# US 2010/0138865 A1 · Presenting content

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0138865 A1
- Document ID: US20100138865A1
- Status: Published application
- Kind: A1
- Application number: 12/452,158
- Filed: 2008-06-25
- Published: 2010-06-03
- Earliest claimed: 2007-06-26
- Assignees: NDS Limited
- Inventors: Pete Rai; Colin John Davies; Simon John Parnall; Ian Bastable; Kevin Murray; Peter Gibbs; Miles Davis; James Geoffrey Walker; Ray Taylor
- Web page: https://patentgrep.com/patent/US20100138865A1

## CPC

- H04N 7/16: Analogue secrecy systems; Analogue subscription systems
- H04N 7/17318: {Direct or substantially direct transmission and handling of requests}
- H04N 21/25891: {being end-user preferences (retrieval of video data in a video database based on user preferences G06F16/739; arrangements for recognizing users' preferences H04H60/46; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18)}
- H04N 21/4312: {involving specific graphical features, e.g. screen layout, special fonts or colors, blinking icons, highlights or animations}
- H04N 21/4314: {for fitting data in a restricted space on the screen, e.g. EPG data in a rectangular grid}
- H04N 21/4532: {involving end-user characteristics, e.g. viewer profile, preferences (monitoring of user activities for profile generation for accessing a video database G06F16/739; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18)}
- H04N 21/454: Content {or additional data} filtering, e.g. blocking advertisements
- H04N 21/47202: {for requesting content on demand, e.g. video on demand}
- H04N 21/482: End-user interface for programme selection
- H04N 21/6582: {Data stored in the client, e.g. viewing habits, hardware capabilities, credit card number (arrangements where receivers interact with the broadcast H04H20/38)}
- H04N 21/478: Supplemental services, e.g. displaying phone caller identification, shopping application
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method of presenting content to a viewer is described. The method includes: receiving a schedule of content at a client operable by the viewer, the schedule of content including a directed graph, the directed graph including a plurality of nodes, wherein each node in the plurality of nodes is connected to one or more other nodes in the plurality of nodes by one or more paths, wherein each path represents content presentable to the viewer; traversing the directed graph by following a route between nodes and along paths of the directed graph, wherein at each node the client determines a path to follow according to state information accessible by the client; and presenting content to the viewer as each path is followed.

## Claims

### Claim at position 1

1-19. (canceled)

### Claim 20

A method of presenting content to a viewer, said method comprising:
receiving a schedule of content at a client operable by said viewer, said schedule of content comprising a directed graph, said directed graph comprising a plurality of nodes, adjacent nodes in said plurality of nodes being connected by a path representing content presentable to a viewer, at least one node in said plurality of nodes being connected to a succeeding node by at least two paths;
traversing said directed graph by following a route between nodes and along paths of said directed graph, wherein said client determines which path of said at least two paths between said at least one node and said succeeding node to follow according to state information accessible by said client; and
presenting content to said viewer as each path is followed.

### Claim 21 (depends on 20)

The method of claim 20, wherein said state information comprises content previously viewed by said viewer.

### Claim 22 (depends on 20)

The method of claim 20, wherein said state information further comprises content previously skipped by said viewer.

### Claim 23 (depends on 20)

The method of claim 20, wherein said state information further comprises content for which said viewer has expressed satisfaction.

### Claim 24 (depends on 20)

The method of claim 20, wherein said state information further comprises content for which said viewer has expressed dissatisfaction.

### Claim 25 (depends on 20)

The method of claim 20, wherein said state information further comprises a location of said viewer.

### Claim 26 (depends on 20)

The method of claim 20, wherein said state information further comprises at least one of a time and day that content is presented to said viewer.

### Claim 27 (depends on 20)

The method of claim 20, further comprising: traversing said directed graph in advance of presenting content to said viewer; identifying content to present to said viewer for each path; and pre-caching identified content.

### Claim 28 (depends on 20)

The method of claim 20, wherein content is presented to said viewer by said client requesting unicast delivery of said content from a content playout system.

### Claim 29 (depends on 20)

The method of claim 20, wherein content is presented to said viewer by said client tuning to a live broadcast of said content.

### Claim 30 (depends on 20)

The method of claim 20, wherein one or more paths represent a choice of content that is presentable to said viewer.

### Claim 31 (depends on 30)

The method of claim 30, wherein said choice of content comprises a plurality of content items having a common attribute.

### Claim 32 (depends on 20)

The method of claim 20, wherein said state information is stored at said client.

### Claim 33 (depends on 20)

The method of claim 20, wherein said state information is stored external to said client.

### Claim 34

A device for presenting content to a viewer, said device comprising:
means for receiving a schedule of content at a client operable by said viewer, said schedule of content comprising a directed graph, said directed graph comprising a plurality of nodes, adjacent nodes in said plurality of nodes being connected by a path representing content presentable to a viewer, at least one node in said plurality of nodes being connected to a succeeding node by at least two paths;
means for traversing said directed graph by following a route between nodes and along paths of said directed graph, wherein said client determines which path of said at least two paths between said at least one node and said succeeding node to follow according to state information accessible by said client; and
means for presenting content to said viewer as each path is followed.
