Exhibit C
`
`Claim Chart for U.S. Patent No. 7,076,431 Based on Obviousness References
`
`The Obviousness References below disclose and/or render obvious Claims 1, 2, 4, 5, 6, 7, 9, 10, 13, and 14 of U.S. Patent No.
`7,076,431 in combination with other references, as set forth in the chart below and explained in Defendants’ Invalidity Contentions.
`Defendants incorporate in this chart all applicable qualifications, clarifications, and other statements made in Defendants’ Invalidity
`Contentions. This invalidity claim chart is based on Defendants’ present understanding of Claims 1, 2, 4, 5, 6, 7, 9, 10, 13, and 14 and
`Parus’s apparent construction of the claims, as set forth in Parus’s Infringement Contentions. Defendants are not adopting Parus’s
`apparent constructions, nor are Defendants admitting the accuracy of any particular construction. Where the chart below states that
`the reference ‘discloses’ a limitation, such disclosure may be express, inherent, or implicit. Moreover, to the extent the Court finds that
`this reference does not disclose certain limitations in the asserted claims, such limitations would have been obvious. By mapping
`claim language to this reference, Defendants do not imply or admit that the claim language satisfies 35 U.S.C. § 112. To the extent
`any cell lacks citations to a charted reference, this should not be taken as an admission that the reference does not disclose the
`corresponding limitation but rather indicates that Defendants do not presently intend to rely on the reference as disclosing the
`limitation based on Defendants’ present understanding of the claim limitation.
`
`The following Obviousness References are charted below:
`
`
`• U.S. Patent No. 6,427,165 to Anderson (“Anderson”)
`• U.S. Patent No. 6,112,203 to Bharat (“Bharat”)
`• U.S. Patent No. 6,397,212 to Biffar (“Biffar”)
`• U.S. Patent No. 6,418,433 to Chakrabarti (“Chakrabarti”)
`• J. Cho and H. Garcia-Molina, The Evolution of the Web and Implications for an Incremental Crawler (“Cho”)
`• M. Chun and J. Wolfe, Just Say No: How Are Visual Searches Terminated When There Is No Target Present? (“Chun”)
`• U.S. Patent App. Pub. No. 2005/0108219 to De La Huerga (“De La Huerga”)
`• U.S. Patent No. 5,787,470 to DeSimone (“DeSimone”)
`• U.S. 6,317,778 to Dias (“Dias”)
`• JP H11265400A to Fujinami (“Fujinami”)
`• U.S. Patent No. 6,393,423 to Goedken (“Goedken”)
`• U.S. Patent No. 5,774,859 to Houser (“Houser”)
`• JP H9-311869 to Kurosawa (“Kurosawa”)
`• U.S. Patent No. 5,941,944 to Messerly (“Messerly”)
`
`
`
`1
`
`Parus Exhibit 2003
`Apple Inc. v. Parus Holdings, Inc.
`IPR2020-00686
`Page 1 of 189
`
`

`

`• U.S. Patent No. 5,913,214 to Madnick (“Madnick”)
`• U.S. Patent No. 6,427,187 to Malcolm (“Malcolm”)
`• U.S. Patent No. 6,262,987 to Mogul (“Mogul”)
`• U.S. Patent No. 6,324,534 to Neal (“Neal”)
`• U.S. Patent No. 6,421,675 to Ryan (“Ryan”)
`• Network Working Group, Request for Comments 2182: Selection and Operation of Secondary DNS Servers (“RFC 2182”)
`• U.S. Patent No. 6,650,998 to Rutledge (“Rutledge”)
`• University of Sheffield TREC-8 Q&A publication (“Sheffield”)
`• U.S. Patent No. 7,181,438 to Szabo (“Szabo”)
`• U.S. Patent No. 6,976,053 to Tripp (“Tripp”)
`• G. Michael Youngblood, Web Hunting: Design of a Simple Intelligent Web Search Agent (“Youngblood”)
`
`References
`
`See Exs. A1-A25, B1-B18, preamble.
`
`
`
`
`
`
`U.S. Patent No.
`7,076,431
`[1.pre] A system
`for retrieving
`information from
`pre-selected web
`sites by uttering
`speech
`commands into a
`voice enabled
`device and for
`providing to
`users retrieved
`information in an
`audio form via
`said voice
`enabled device,
`said system
`comprising:
`
`2
`
`
`
`
`
`
`Parus Exhibit 2003, Page 2 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`[1.a] a computer,
`said computer
`operatively
`connected to the
`internet;
`
`References
`
`See Exs. A1-A25, B1-B18, limitation 1.a.
`
`See also, e.g., disclosures below.
`
`“For example, a search engine may be instructed by an operator of information handling system 100 to search the
`Internet for sources of information on the Internet regarding the Gettysburg Address or President Kennedy's Moon
`Mission Pledge Speech. A determination is made at step 212 whether an information source, a node on the network,
`satisfies the search criterion by containing the desired information, also known as a ‘hit.’ If no information source is
`found, the network continues to be searched until a predetermined condition is met, for example, a time-out period has
`passed or until a site containing the desired information is found.” (Anderson, 4:27-38.)
`
`“Referring now to FIG. 3, a flow diagram of a method in accordance with the present invention will be discussed. The
`method 300 begins with a search for information possibly located on a network at step 310. For example, a user may
`instruct a search engine to search the Internet for information regarding President Kennedy’s speech about the goal of
`landing men on the moon. The user would type in the string ‘JFK MOON SPEECH’, and based upon the text, the
`search engine would look for nodes on the network containing the words of the text string.” (Anderson, 5:12-21.)
`
`“For example, method 400 may begin with a program running on information handling system 100 for gathering
`sources at step 410 for a certain type of information. The sources may be news sources for current events or in a given
`category (i.e., computer technology new, medical technology news, weather news, etc.). Alternatively, method 400
`may begin with a program running on information handling system 100 for browsing the network at step 412 for
`casually finding information of interest or entertainment. Such a program may be a network browser program such as
`an Internet browser.” (Anderson, 6:31-41.)
`
`Anderson, FIGS. 2-3
`
`***
`
`“In a computerized method, a set of documents is ranked according to their content and their connectivity by using
`topic distillation. The documents include links that connect the documents to each other, either directly, or indirectly. A
`graph is constructed in a memory of a computer system. In the graph, nodes represent the documents, and directed
`
`
`
`3
`
`Parus Exhibit 2003, Page 3 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`edges represent the links. Based on the number of links connecting the various nodes, a subset of documents is selected
`to form a topic. A second subset of the documents is chosen based on the number of directed edges connecting the
`nodes. Nodes in the second subset are compared with the topic to determine similarity to the topic, and a relevance
`weight is correspondingly assigned to each node. Nodes in the second subset having a relevance weight less than a
`predetermined threshold are pruned from the graph. The documents represented by the remaining nodes in the graph
`are ranked by connectivity based ranking scheme.” (Bharat, Abstract.)
`
`“It has become common for users of host computers connected to the World Wide Web (the ‘Web’) to employ Web
`browsers and search engines to locate Web pages having specific content of interest to users. A search engine, such as
`Digital Equipment Corporation's Alta Vista search engine, indexes hundreds of millions of Web pages maintained by
`computers all over the world. The users of the hosts compose queries, and the search engine identifies pages that match
`the queries, e.g., pages that include key words of the queries. These pages are known as a result set.” (Bharat, 1:14-
`23.)
`
`“In order to help users locate Web pages of interest, a search engine 140 maintains an index 141 of Web pages in a
`memory, for example, disk storage. In response to a query
`111 composed by a user, the search engine 140 returns a result set 112 which satisfies the terms (key words) of the
`query 111. Because the search engine 140 stores many millions of pages, the result set 112, particularly when the query
`111 is loosely specified, can include a large number of qualifying pages. These pages may, or may not satisfy the user's
`actual information need. Therefore, the order in which the result 112 set is presented to the client 110 is indicative of
`the usefulness of the search engine 140. A good ranking process will return "useful" pages before pages that are less
`so.” (Bharat, 4:9-21.)
`
`“For IDF weights, we measured frequency of occurrence of terms in a collection of 400,000 Yahoo! documents, see
`"http://www.yahoo.com". We boost the weights of terms i that appear in the original user query 111 by a factor K, for
`example three.” (Bharat, 7:28-32.)
`
`“When examining a page, we fetch it and compute its relevance, if not previously processed, until five pages have been
`fetched, or enough top ranked pages have been found relevant, for example, fifteen. In the latter case, the process
`terminates, and in the former case the process starts a new round until the quota of pages to be fetched is exhausted
`(step 340), one hundred in our preferred implementation. The last set of rankings determined for hubs and authorities is
`
`
`
`4
`
`Parus Exhibit 2003, Page 4 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`returned as the result set 112. The motivation for stopping each round when a fixed number of pages, e.g., five in our
`preferred our implementation, have been fetched is that it is usually sufficient if the top ranked pages are pruned,
`because these pages tend to be represented by high degree nodes that have a high influence on the ranking of other
`nodes. After this point, it is more profitable to execute another round than to continue with the pruning.” (Bharat, 8:35-
`51.)
`
`***
`
`“In this paper we study how to build an effective incremental crawler. The crawler selectively and incrementally
`updates its index and/or local collection of web pages, instead of periodically refreshing the collection in batch mode.
`The incremental crawler can improve the ‘freshness’ of the collection significantly and bring in new pages in a more
`timely manner. We first present results from an experiment conducted on more than half million web pages over 4
`months, to estimate how web pages evolve over time. Based on these experimental results, we compare various design
`choices for an incremental crawler and discuss their trade-offs. We propose an architecture for the incremental crawler,
`which combines the best design choices.” (Cho at Abstract.)
`
`“A crawler is a program that automatically collects Web pages to create a local index and/or a local collection of web
`pages. Roughly, a crawler starts off with an initial set of URLs, called seed URLs. It first retrieves the pages identified
`by the seed URLs, extracts any URLs in the pages, and adds the new URLs to a queue of URLs to be scanned. Then
`the crawler gets URLs from the queue (in some order), and repeats the process. In general, the crawler can update its
`index and/or local collection in two different ways. Traditionally, the crawler visits the web until the collection has a
`desirable number of pages, and stops visiting pages. Then when it is necessary to refresh the collection, the crawler
`builds a brand new collection using the same process described above, and then replaces the old collection with this
`brand new one. We refer to this type of crawler as a periodic crawler. Alternatively, the crawler may keep visiting
`pages after the collection reaches its target size, to incrementally update/refresh the local collection. By this
`incremental update, the crawler refreshes existing pages and replaces ‘less-important’ pages with new and ‘more-
`important’ pages. When the crawler operates in this mode, we call it an incremental crawler.” (Cho at 1).
`
`***
`
`
`
`
`5
`
`Parus Exhibit 2003, Page 5 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`“A method to be used with a system including a processor linked to a plurality of databases on which records are
`stored, a local database linked relatively proximate the processor and an Internet linked database, the method for
`efficiently searching the databases for at least one record referenced by a DR and comprising the steps of, a) receiving
`a DR, b) searching the local database for records referenced by the received DR, c) searching at least one Internet
`linked database for records referenced by the received DR, and d) rendering identified records accessible.” (De La
`Huerga, Abstract.)
`
`“Herein, unless indicated otherwise, the term ‘record’ is used to refer generally to electronically stored and accessible
`data including, among other things, word processor documents, web browser pages, pictures, tables, charts, video clips,
`audio clips, multi-media presentations, etc. Also, hereinafter, the term "database" will be used to refer to a collection of
`data stored on an electronic medium while the term "database" will be used to refer to a data construct which resides on
`a database and which catalogues at least a sub-set of database data in an ordered fashion to expedite database
`searching.” (De La Huerga, ¶ 0004.)
`
`“In addition, it is contemplated that processor 68 may also be programmed to be able to recognize that some other web
`linked processor or server may be better equipped to determine which databases and directories will include records
`sought via a query. In effect, instead of identifying a database to be searched, processor 68 identifies another server to
`perform a search. In this case, it is contemplated that processor 68 is programmed to aid or cooperate with the other
`processor/server to gather information about the record sought which can then be used to select databases to be
`searched and then search the databases for relevant records. Hereinafter such an exemplary "other" web linked server
`or processor will be referred too generally as a second search processor. Referring still to FIG. 1, an exemplary second
`search processor is identified by numeral 63. Referring also to FIG. 2, second processor 63 will generally have the
`same architecture as search processor 24. Although only a single second search processor 63 is illustrated it is
`contemplated that many (e.g., hundreds) second processors may be linked to system 10.” (De La Huerga, ¶ 0059.)
`
`“Although not illustrated in FIG. 3, another important NCQ (e.g., NCQ-Q) includes record information which,
`although hidden to a system user, can be identified by processor 68 (see also FIG. 2). The most familiar record
`information fitting this description includes markup language notations including hypertext markup language (H1ML)
`and extensible markup languages (XML). The XML protocol enables document generators to include "XML tags"
`within records that earmark record segments as corresponding to specific information types. While the tags are
`recognizable by a processor (e.g., processor 68) the tags are invisible to a system user viewing the record. For example,
`
`
`
`6
`
`Parus Exhibit 2003, Page 6 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`when viewing an ECG report via a workstation display, the report may include a diagnosis section. To enable a
`processor to identify the diagnosis section, processor recognizable "begin diagnosis" and "end diagnosis" tags are
`placed within the record before and after the diagnosis portion of the record. The tags can be used to further qualify any
`DR that appears within the record segment between the tags.” (De La Huerga, ¶ 0073.)
`
`“It should be recognized that a server that initially receives a search query might, instead of identifying a database set
`to be searched, identify another server that should perform the step of identifying the database set to be searched. In
`some of the above example, a first search processor (e.g., 68 in FIG. 2) to receive a DR may have direct access to
`databases having only very little information related to a DR and therefore any database selection by a search processor
`may be essentially meaningless (or at least relatively less meaningful than a similar task performed by another web
`linked processor). By sending the query to some other web linked processor a better-suited database set may be
`identified for searching purposes.” (De La Huerga, ¶ 0083.)
`
`***
`
`FIG. 2 is a block diagram that illustrates an example of a computing environment 22 that is suitable for practicing the
`exemplary embodiment of the present invention. The computing environment 22 includes a client computer system 24
`that may communicate with servers 26 and 28 via a network connection. The connection may be realized via modem or
`a network adapter. For illustrative purposes in the discussion below, it is assumed that the connection is an Internet
`connection and that servers 26 and 28 reside on the Internet. The client computer 24 includes a central processing unit
`(CPU) 30, such as a microprocessor. The CPU is accessed to a storage 32 and input/output (I/O) devices 34. The I/O
`devices 34 may include but are not limited to a keyboard, a mouse, a video display, a modem, and audio loudspeakers.
`The storage 32 may include both primary storage and secondary storage. Accessing code 36, such as a web browser, is
`held within a storage 32 and run on the CPU 30. For purposes of the discussion, it is assumed that the accessing code is
`a web browser. Nevertheless, those skilled in the art will appreciate that the accessing code 36, more generally may be
`any code, such as an operating system or network operating system, that is used to gain access to a resource. The
`accessing code is used to gain access to resources 40A and 40B. For purposes of the discussion below, it is assumed
`that these resources are media content. A database, denoted as an "index" 38, is also stored on the storage 32. As will
`be described in more detail below, the index 38 contains information regarding what web pages are substantially
`identical to each other. (Messerly, 5:11-39.)
`
`
`
`
`7
`
`Parus Exhibit 2003, Page 7 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`
`***
`
`Ryan, 3:66-4:11:
`“The present invention is preferably implemented in a network environment wherein each computer contains, typically,
`a microprocessor, memory and modem, a certain of the computers contain displays and the like, as are well known. As
`shown in FIG. 1B, a plurality of user sites/computers 100A-100D are shown, as are a plurality of server computers
`102A-B, and developer sites/computers 104A-B. It is understood that in a typical internet network, that different server
`computers 102 can be interconnected together, as is illustrated. Further, while only a few user sites, developer sites and
`server computers are shown, it is understood that thousands of such computers are interconnected together.”
`
`***
`
`“A search engine utilizes a bottom-up approach to index the content of a network with agent programs running on each
`host computer instead of relying on a top-down approach as used by conventional search engines. A central catalog of
`object references is compiled on the central site or sites from the meta data reported from each web site. One or more
`brochure files may also be created and stored on each web site to provide conceptual or non-key-word data about the
`site, such as target demographics and categorization information. This conceptual information is then utilized in
`constructing the central catalog so that more accurate search results may be generated for search queries applied to the
`catalog.” (Tripp, Abstract.)
`
`“As a result of the rapid growth in web sites on the Internet, it has become increasingly difficult to locate pertinent
`information in the sea of information available on the Internet. A search engine, such as Inktomi, Excite, Lycos,
`Infoseek, or FAST, is typically utilized to locate information on the Internet. FIG. 1 illustrates a conventional search
`engine 10 including a router 12 that transmits and receives message packets between the Internet and a web crawler
`server 14, an index server 16, and a web server 18. A web crawler or spider is a program that roams the Internet,
`accessing known web pages, following the links in those pages, and parsing each web page that is visited to thereby
`generate index information about each page. The index information from the spider is periodically transferred to the
`index server 16 to update the catalog or central index stored on the index server. The spider returns to each site on a
`regular basis, such as every several months, and once again visits web pages at the site and follows links to other pages
`within the site to find new web pages for indexing.” (Tripp, 2:31-49.)
`
`
`
`
`8
`
`Parus Exhibit 2003, Page 8 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`[1.b] a voice
`enabled device
`operatively
`connected to said
`computer, said
`voice enabled
`device
`configured to
`receive speech
`commands from
`users;
`
`References
`
`Tripp, FIGS. 1-5.
`
`***
`
`
`See Exs. A1-A25, B1-B18, limitation 1.b.
`
`See also, e.g., disclosures below.
`
`“In some embodiments of the invention, it is not necessary to provide a visual display. For example, user interaction
`may proceed with a text to voice System, in which results are read
`it to the user over the telephone. The user uses the phone pad (DTMF tones) or his/her voice new commands/response
`to Search characteristic.” (Biffar, 6:9-14.)
`
`“The action 4400 is the method by which the search parameters for the next Search can be changed by the user. The
`action may be executed by a variety of methods, Such as a pull down menu 4400 (see FIGS. 3 and 4), yes and no
`questions 4410 (see FIG. 5), multiple choice questions 4420 (see FIG. 5), and/or ratings 4430 (see FIG. 5). It is
`important to note that yes/no and/or ratings are especially useful for devices that do not have a keyboard, Such as
`limited function input devices or limited Voice recognition. Examples of Such devices include television remote
`controls, PDAS, pagers, and telephones with and without Screens. In contrast thereto, most modern Search engines
`require the input of words via a keyboard.” (Biffar, 6:31-43.)
`
`“A new search button 4600 allows a user to select a next iteration to find a better fitting solution. The new search
`function can be an enter function that may be voice activated or may be otherwise actuated.” (Biffar, 6:50-54.)
`
`“The interface of the Search engine can be structured Such that an alphanumeric keyboard is not needed for the data
`input. Therefore, a simple, Standard remote control can be used to lock and change characteristics. This makes the
`Search engine particularly valuable for use with television set-top boxes and other Internet devices that have limited
`data input options. The user controls can therefore be readily based on Simple Voice commands, e.g. up, down, left,
`right, Select.” (Biffar, 7:19-27.)
`
`
`
`
`9
`
`Parus Exhibit 2003, Page 9 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`[1.c] at least one
`speaker-
`independent
`speech
`recognition
`device, said
`speaker-
`independent
`speech
`recognition
`device
`operatively
`connected to said
`computer and to
`said voice
`enabled device;
`
`References
`“Finally, the Search engine may be set up Such that no keyboard and/or mouse interface is required to operate the
`Search engine or that it can be operated using a Standard phone, using voice recognition and/or the phone pad as input
`device.” (Biffar, 7:66-8:3.)
`
`***
`
`See Exs. A1-A25, B1-B18, limitation 1.c.
`
`See also, e.g., disclosures below.
`
`“In some embodiments of the invention, it is not necessary to provide a visual display. For example, user interaction
`may proceed with a text to voice System, in which results are read
`it to the user over the telephone. The user uses the phone pad (DTMF tones) or his/her voice new commands/response
`to Search characteristic.” (Biffar, 6:9-14.)
`
`“The action 4400 is the method by which the search parameters for the next Search can be changed by the user. The
`action may be executed by a variety of methods, Such as a pull down menu 4400 (see FIGS. 3 and 4), yes and no
`questions 4410 (see FIG. 5), multiple choice questions 4420 (see FIG. 5), and/or ratings 4430 (see FIG. 5). It is
`important to note that yes/no and/or ratings are especially useful for devices that do not have a keyboard, Such as
`limited function input devices or limited Voice recognition. Examples of Such
`devices include television remote controls, PDAS, pagers, and telephones with and without Screens. In contrast thereto,
`most modern Search engines require the input of words via a keyboard.” (Biffar, 6:31-43.)
`
`“A new search button 4600 allows a user to select a next iteration to find a better fitting solution. The new search
`function can be an enter function that may be voice activated or may be otherwise actuated.” (Biffar, 6:50-54.)
`
`“The interface of the Search engine can be structured Such that an alphanumeric keyboard is not needed for the data
`input. Therefore, a simple, Standard remote control can be used to lock and change characteristics. This makes the
`Search engine particularly valuable for use with television set-top boxes and other Internet devices that have limited
`data input options. The user controls can therefore be readily based on Simple Voice commands, e.g. up, down, left,
`right, Select.” (Biffar, 7:19-27.)
`
`
`
`10
`
`Parus Exhibit 2003, Page 10 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`[1.d] at least one
`speech synthesis
`device, said
`speech synthesis
`device
`operatively
`connected to said
`computer and to
`said voice
`enabled device;
`[1.e] at least one
`instruction set
`for identifying
`said information
`to be retrieved,
`said instruction
`set being
`associated with
`said computer,
`said instruction
`set comprising:
`
`References
`
`
`“Finally, the Search engine may be set up Such that no keyboard and/or mouse interface is required to operate the
`Search engine or that it can be operated using a Standard
`phone, using voice recognition and/or the phone pad as input device.” (Biffar, 7:66-8:3.)
`
`***
`
`See Exs. A1-A25, B1-B18, limitation 1.d.
`
`See also, e.g., disclosures below.
`
`“In Some embodiments of the invention, it is not necessary to provide a visual display. For example, user interaction
`may proceed with a text to voice System, in which results are read it to the user over the telephone.” (Biffar, 6:9-13.)
`
`***
`
`
`See Exs. A1-A25, B1-B18, limitation 1.e.
`
`See also, e.g., disclosures below.
`
`“Other components of information handling system 100 include main memory 104, auxiliary memory 106, and an
`auxiliary processor 108 as required. Main memory 104 provides storage of instructions and data for programs
`executing on central processor 102. Main memory 104 is typically semiconductor based memory such as dynamic
`random access memory (DRAM) and or static random access memory (SRAM). Auxiliary memory 106 provides
`storage of instructions and data that are loaded into the main memory 104 before execution. Auxiliary memory 106
`may include semiconductor based memory such as read-only memory (ROM), programmable read-only memory
`(PROM) erasable programmable read-only memory (EPROM), electrically erasable read-only memory (EEPROM), or
`flash memory (block oriented memory similar to EEPROM).” (Anderson, 3:8-22.)
`
`
`
`
`11
`
`Parus Exhibit 2003, Page 11 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`“For example, a search engine may be instructed by an operator of information handling system 100 to search the
`Internet for sources of information on the Internet regarding the Gettysburg Address or President Kennedy's Moon
`Mission Pledge Speech. A determination is made at step 212 whether an information source, a node on the network,
`satisfies the search criterion by containing the desired information, also known as a ‘hit.’ If no information source is
`found, the network continues to be searched until a predetermined condition is met, for example, a time-out period has
`passed or until a site containing the desired information is found.” (Anderson, 4:27-38.)
`
`“Referring now to FIG. 3, a flow diagram of a method in accordance with the present invention will be discussed. The
`method 300 begins with a search for information possibly located on a network at step 310. For example, a user may
`instruct a search engine to search the Internet for information regarding President Kennedy’s speech about the goal of
`landing men on the moon. The user would type in the string ‘JFK MOON SPEECH’, and based upon the text, the
`search engine would look for nodes on the network containing the words of the text string.” (Anderson, 5:12-21.)
`
`“For example, method 400 may begin with a program running on information handling system 100 for gathering
`sources at step 410 for a certain type of information. The sources may be news sources for current events or in a given
`category (i.e., computer technology new, medical technology news, weather news, etc.). Alternatively, method 400
`may begin with a program running on information handling system 100 for browsing the network at step 412 for
`casually finding information of interest or entertainment. Such a program may be a network browser program such as
`an Internet browser.” (Anderson, 6:31-41.)
`
`“One of the embodiments of the invention can be implemented as sets of instructions resident in the main memory 104
`of one or more computer systems configured generally as described in FIG. 1. Until required by the computer system,
`the set of instructions may be stored in another computer readable memory such as auxiliary memory 106 of FIG. 1, for
`example in a hard disk drive or in a removable memory such as an optical disk for utilization in a CD-ROM drive, a
`floppy disk for utilization in a floppy disk drive, a floptical disk for utilization in a floptical drive, or a personal
`computer memory card for utilization in a personal computer card slot. Further, the set of instructions can be stored in
`the memory of another computer and transmitted over a local area network or a wide area network, such as the Internet,
`when desired by the user. Additionally, the instructions may be transmitted over a network in the form of an applet that
`is interpreted or compiled after transmission to the computer system rather than prior to transmission. One skilled in the
`art would appreciate that the physical storage of the sets of instructions or applets physically changes the medium upon
`
`
`
`12
`
`Parus Exhibit 2003, Page 12 of 189
`
`

`

`U.S. Patent No.
`7,076,431
`
`References
`which it is stored electrically, magnetically, chemically, physically, optically or holographically so that the medium
`carries computer readable information.” (Anderson, 7:20-43.)
`
`Anderson, FIGS. 2-3
`
`***
`
`“In a computerized method, a set of documents is ranked according to their content and their connectivity by using
`topic distillation. The documents include links that connect the documents to each other, either directly, or indirectly. A
`graph is constructed in a memory of a computer system. In the graph, nodes represent the documents, and directed
`edges represent the links. Based on the number of links connecting the various nodes, a subset of documents is selected
`to form a topic. A second subset of the documents is chosen based on the number of directed edges connecting the
`nodes. Nodes in the second subset are compared with the topic to determine similarity to the topic, and a relevance
`weight is correspondingly assigned to each node. Nodes in the second subset having a relevance weight less than a
`predetermined threshold are pruned from the graph. The documents represented by the remaining nodes in the graph
`are ranked by connectivity based ranking scheme.” (Bharat, Abstract.)
`
`“It has become common for users of host computers connected to the World Wide Web (the ‘Web’) to employ Web
`browsers and search engines to locate Web pages having specific content of interest to users. A search engine, such as
`Digital Equipment Corporation's Alta Vista search engine, indexes hundreds of millions of Web pages maintained by
`computers all over the world. The users of the hosts compose queries, and the search engine identifies pages that match
`the queries, e.g., pages that include key words of the queries. These pages are known as a result set.” (Bharat, 1:14-
`23.)
`
`“Provided is a computerized method for ranking a set of documents. The documents include links that connect the
`various documents to each other. According to the invention, a graph is constructed in a memory of a computer system.
`The graph includes nodes and directed edges. Each node represents one of the documents, and the directed edges
`represent the links connecting the documen