CA2615221C - User interface for legal case histories - Google Patents

Abstract

An exemplary legal research system provides graphical user interfaces to client access devices, with the user interfaces specifically designed to facilitate access to procedural case histories. Each interface is dynamically customized based on the procedural relationships of a plurality of legal cases to provide hyperlinks to corresponding case law documents. The hyperlinks are positioned within indicator band of the interface to indicate corresponding tiers of a court system, but also to mirror the procedural and temporal relationships of legal cases corresponding to the case law documents.
Additionally, the exemplary interface includes case validity indicators to signal the precedential value or status of corresponding legal cases. The graphical user interface, in some embodiments, provides analogous access to statutory information.

Description

USER INTERFACE FOR LEGAL CASE HISTORIES
Copyright Notice One or more portions of this patent document contain material subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyrights whatsoever. The following notice applies to this document: Copyright 2005, Thomson Legal and Regulatory, Inc.
Technical Field Various embodiments of the invention concern systems, methods, and software for enabling users to interface with documents, such as judicial opinions or case documents that have complex temporal, semantic, and/or legal relationships.
Background The American legal system, as well as some other legal systems around the world, relies heavily on written judicial opinions, the written pronouncements of judges, to articulate or interpret the laws governing resolution of disputes. Each judicial opinion is not only important to resolving a particular legal dispute, but also to resolving or avoiding similar disputes, or cases, in the future. Because of this, judges and lawyers within our the American legal system are continually researching an ever-expanding body of past opinions, or case law, for the ones most relevant to resolution of new disputes.
To facilitate these searches, companies, such as Thomson Legal and Regulatory, Inc. of St. Paul, Minnesota (doing business as Thomson West), collect and publish the judicial opinions of courts across the United States in electronic form and make them available to online researchers through its Westlaw research service. Many of these opinions are published with bibliographic cites or hyperlinks to historically related opinions, known as prior cases, from other courts that have previously ruled on all or part of the same dispute.
The cites and hyperlinks enable researchers to readily access the related opinions electronically within the Westlaw research system. For example, an opinion in a patent case from the United States Supreme Court, the highest court in the United States, would generally cite not only an opinion from the Court of Appeals for the Federal Circuit, the next highest court for patent cases, but also an opinion of a local Federal District Court where the patent case started, thus documenting the history or progression of the case through the U.S. federal judicial system.
The history or progression of a dispute through the court system is particularly important, because subsequent cases in a chain may overrule one or more portions of prior case. Thus, before relying on rulings in any given case, judges and lawyers need to understand its history. To this end, the Westlaw research system includes a KeyCite feature which, among other things, provides not only a sequential listing of cases that constitute the history of virtually any given case, but also a short description of the relationship between the cases.
For example, the history listing having two cases might list that one case granted a motion made in another case. The listing is a powerful tool.
However, the present inventors have recognized that some cases histories are quite complex and difficult to follow in a sequential list. This is particularly

2 true for history listings that list a case more than once, present listings that have gaps between cases, or list multiple cases that affect a given prior case.
Accordingly, the present inventors have recognized, among other things, a need for better ways for users to interface with historically related legal cases.
Summary of the Invention According to an aspect of the present invention, there is provided a computer-implemented method for indicating legal case histories, the method comprising the steps of:
using a processor to identify occurrences of a piece of text having a predetermined format in a textual document;
using the processor to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in a database;
receiving a request from a client access device for the legal case history for a piece of formatted text in the textual document;
using the processor to search the database based on the request and to retrieve the requested legal case history from the database; and indicating the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case;
wherein the indicating step includes displaying the legal case history on an output device in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.

3 According to another aspect of the present invention, there is provided a computer system for retrieving legal case histories, the computer system comprising:
a server computer having a processor and interfacing with a database;
a client access device interfacing with the server computer; and an output device interfacing with server computer;
wherein the processor is configured to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in the database;
wherein the server computer is configured to receive a request for the legal case history from the client access device;
wherein the processor is further configured to search the database based on the request and to retrieve the requested legal case history from the database;
wherein the output device is configured to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case; and wherein the output device is further configured to display the legal case history in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.
According to a further aspect of the present invention, there is provided a computer program product comprising a computer useable medium having control logic stored therein for indicating legal case histories, said control logic comprising:
3a first computer readable program code means for causing the computer to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in a database;
second computer readable program code means for causing the computer to receive a request from a client access device for the legal case history for a piece of formatted text in the textual document and to search the database based on the request and to retrieve the requested legal case history from the database;
and third computer readable program code means for causing the computer to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case;
wherein the third computer readable program code means is further adapted to cause the computer to display the legal case history on an output device in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.
Brief Description of the Drawings Figure 1 is a block diagram of a computer system which may be used to automatically generate case law citation data in a legal text processing system in accordance with the invention;
Figures 2A - 2D are screen shots illustrating examples of the user interface displayed to a user of the case law citation system in accordance with the invention;
3b Figure 3 is a diagram illustrating the flow of data in a case law citation system in accordance with the invention;
Figure 4 is a diagram illustrating more details of the flow of data in the case law citation system of Figure 3.
Figure 5 is a diagram illustrating a system for quotation identification in accordance with the invention that may be part of the case law citation system;.
Figure 6 is a flowchart illustrating a method for quotation identification and verification process in accordance with the invention;
Figure 7 is a flowchart illustrating a method for quotation verification in accordance with the invention;
Figure 8 is a diagram illustrating a negative history determining process in accordance with the invention;
Figure 9 is a flowchart illustrating a method for determining the depth of treatment of a legal case in accordance with the invention; and Figure 10 is a diagram illustrating a method for assigning subject matter classifications in accordance with the invention.
Description of Exemplary Embodiments This description, which references and incorporate the identified figures and incorporates the appendix and appended claims, describes and illustrates one 3c

4 or more exemplary embodiments of the invention(s.) These embodiments, offered not to limit but only to exemplify and teach, are shown and described in sufficient detail to enable those skilled in the art to make and use the invention(s). Thus, where appropriate to avoid obscuring the invention(s), the description may omit certain information known to those of skill in the relevant art.
Some embodiments of the invention are particularly applicable to a computer-implemented legal text processing system and method for semi-automatically identifying characteristics, such as citations and quotations, within a legal document and identifying relationships between the legal document and other legal documents stored in-the database. The legal document may be a legal case, a statute, a law review article, an ALR article or a legal treatise. It is in the context of a legal case that the exemplary embodiments are described.
It will be appreciated, however, that the system and method in accordance with the invention has greater utility and may be used for different legal documents, such as statutes, legislative histories, and administrative proceedings, and patents.
Some embodiments apply the teachings herein to non legal documents, such as scientific literature.
Before describing the preferred embodiment of the invention, a brief description of the terminology that will be used to describe the invention will be provided. Any reported decision of a legal case is presumed to be an authoritative statement of the law when it is written. Then, later events may affect the authoritativeness of this legal case's decision. These later events may include later proceedings or written decisions during the same litigation (e.g., direct history), a decision of a later legal case from a different litigation which resolves the same issues in a different way or using different reasoning and overrules the earlier case, or a decision of a later legal case from a different litigation which resolves the same issue differently, but does not explicitly overrule the case. The direct history of a legal case may include a record of the connections between the legal cases that are part of the same litigation. The direct history may be of varying degrees of relevance and may include positive history (i.e., maintaining or supporting the authority (of the legal case) or negative history (for example, the legal case may no longer have the authority it once had)). The indirect history of a case is a record of the connections between legal case and other legal cases which are not part of the same litigation.
The indirect history of a legal case may also be positive or negative. The significance of a particular case may often be indicated by the amount of discussion (i.e., the amount of text) that a later case uses in discussing a decision of another legal case while following, overruling or explaining the case. This is referred to as the depth of treatment of the case, as described below. One or more embodiments described herein may also be implemented on a system, such as that described in US Patent No. 8,126,818 issued on February 28, 2012.
Figure 1 is a block diagram of a computer system 30 in which the invention may be embodied. The system may semi-automatically identify characteristics, such as citations and quotations within a legal case document, and then generate information about the legal case in the context of other legal cases. The computer system may include a computer 32, a server 34 and a plurality of client computers 36. The computer 32 may further include a central processing unit (CPU) 38, a memory 40 and one or more processes 42, which may be software applications that are stored in the memory 40. The CPU
controls the operation of the computer and executes the software applications stored in the memory. In operation, a plurality of pieces of electronic data corresponding to the text of the published decisions for the legal cases are fed into the computer and temporarily stored in the memory 40. In the following discussion, the written opinion of the legal case is referred to as the legal case.
Each piece of electronic data (i.e., each written opinion of a legal case) may be automatically processed by the CPU, using the processes contained in the software applications contained in the memory, to generate information about the legal case, as described below. For example, the CPU may parse the text of the legal case to identify candidate (i.e., unverified) citations to other legal cases and mark these citations for later processing, may identify candidate (i.e., unverified) quotations in the text of the legal case and mark the text accordingly, may verify the source of a quotation in the text of the legal case. may determine a depth of treatment of a cited legal case (i.e., the significance of the cited legal case based on some predetermined criteria), may determine the negative treatment of the legal case, and may assign subject matter text, such as headnotes, in accordance with a predetermined classification system to citations in the legal case. Each of these processes may be performed by a software application in the memory 40, which is executed by the CPU 38. The details of each of these processes will be described below.
Once the processing has been completed by the processes 42, the computer 32 outputs a data record 44 for the particular legal case which contains information about the history of the legal case, information about the depth of treatment of citations in the legal case, information about quotations within the legal case, and information about the subject matter text (i.e., headnotes) assigned to each citation in the legal case. The data record generated by the computer 32 for each legal case may be stored in a database 33 in a server 34.

Then, when a user of one of the plurality of client computers 36 requests information about a legal case, the server 34 generates a user interface containing a variety information about the requested legal case based on the data records in the database 33, and presents the user reviewing the legal case with a variety of information about the legal case.
An example of the user interface provided to the user of each client computer is described below with reference to Figures 2A - 2D. In this manner, a user of the client computer may request data about a particular case, and the system in accordance with the invention provides that data to the user.
As the electronic data for the text of each written opinion for a new legal case is received by the computer 32, the legal case is processed as described above and the results of the processing is stored as a data record 44 in the database 33 of the in the server 34. The users of the client computers may then retrieve data about a particular legal case from the server 34. Thus, while the server 34 is providing data about a legal case to the one or more users of the client computers, the computer 32 may be simultaneously processing additional new legal cases and adding the information for that new legal case into the database 33 in the server 34. Now, an example of a preferred user interface and information provided to the user of a client computer will be described in more detail.
Figures 2A - 2D are screen shots illustrating examples of a preferred user interface and the information provided to and displayed by a client computer in accordance with the invention. Figure 2A shows a computer screen 50 on a client computer displaying a legal case being reviewed by the user of the particular client computer in which the user interface has a Windows format, a toolbar, pull down menus, etc. In this example, the display is of the text of a legal case called Pleasant v. Celli which was decided by a California Court of Appeals. As described above, any citation for a legal case has a well-defined format which facilitate the identification of these citations within the text of the written opinion of the legal case. In order to access more information about the displayed legal case, the user of the client computer may select the citation service, which may be referred to as KeyCiteTM, from the Services menu 51 by clicking on a "KC" button 52 or click on a symbol 54. KeyCiteTm is a trademark of a citator of the assignee of the present invention. The symbol may be a colored symbol, e.g., a flag, which gives a quick status of the legal case. A
red colored flag may warn that the legal case being reviewed may not be good law for at least some portion of the legal case, a yellow colored flag may indicate that the legal case has some negative history, as described below, or another colored symbol, such as a blue H, may indicate that the legal case has some history which is not negative. The invention, however is not limited to any particular types of symbols or colors. Once the user of the client computer has selected the citator system in some manner, the screen shown in Figure 2B may be displayed.
Figure 2B is a screen shot showing an example of a computer screen 50 which the invention may employ having a control interface portion 58, and a display portion 60. The control interface portion of the display permits the user to customize the information being displayed. For example, if a first radio button 62 is selected, then the full history of the legal case, including direct history which is negative or positive, negative indirect history, and any related references may be shown. If a second radio button 64 is selected then only the negative direct and indirect history may be shown. If a third radio button 66 is selected, then only the direct history of the legal case may be displayed so that any minor direct history (including references), remote direct history (such as appeals after remand) and mildly negative indirect history are not displayed.
The control portion 58 of the display also may indicate the number of cases which are considered to be the history of the legal case. The control portion may also include a fourth radio button 68 and an indication of the number of citations to the legal case being displayed. When the fourth radio button is selected, a list of other documents is displayed.
In the example shown in Figure 2B, the full history of the Pleasant v.
Celli case is indicated. As shown, the various types of history, such as the direct history and the negative indirect history are displayed in the display portion and are separated from one another by headings. For each piece of history, a short description of the history or tag, such as "opinion vacated by", "disapproved of by", or "disagreed with by" may indicate the relationship between the cases listed and the base case. In this example, an earlier decision of the same court was vacated by the Pleasant case. (Appendix shows other exemplary interfaces that may be used in conjunction with the embodiments described via Figure 2B and/or elsewhere in this description.) Now, the citations to the legal case will be described with reference to Figure 2C.
Figure 2C is an example of a screen shot showing the computer screen 50 having the control interface portion 58, and the display portion 60. This screen displays the legal cases which have cited the legal case currently being reviewed (i.e., Pleasant v. Celli in the example). In this screen shot, the fourth radio button 68 is selected. Thus, the control portion may also have a button 70 which permits the user of the system to limit the types of citations displayed, as described below with reference to Figure 2D. The display portion 60 may also display a quotation mark symbol 72 and a depth of treatment symbol 74, which are associated with the citations for the legal case, etc. which cite to the legal case of interest. The quotation symbol 72 indicates that the cited legal case directly quotes from the case of interest (i.e., in the example Lubner v. City of Los Angeles contains a quotation from Pleasant v. Celli). A metli.A
fit-identifying quotations and verifying the source of the quotations in accordance with the invention will be described below. The depth of treatment symbol 74, which may be, for example, one or more stars, where the number of stars indicate the degree to which the legal case's written opinion is treated, e.g., the amount of text in the cited case opinion which is devoted to the case of interest.
The details of the depth of treatment assignment process will be described below in more detail. Now, a screen which permits a user to the limit the citations displayed in the display portion will be described with reference to Figure 2D.
Figure 2D is an example of a screen shot showing the computer screen 50 with the control portion 58 and the display portion 60. In this screen shot, it is assumed the user of the system has selected the limit citation button 70 shown in Figure 2C. As shown, the user of the system may restrict the citations displayed based on headnotes or topics and the system will evaluate all of the citations against the selected headnotes or topics so that only the legal cases containing the selected headnotes or topics are displayed in the screen shot shown in Figure 2C. A headnote may be a few sentences/paragraph which are located at the beginning of a legal case and indicate a summary of the law of a particular portion of the legal case. The user interface of the system permits a researcher to quickly and efficiently perform verification and collocation functions on a legal case. The details of the system for generating information about the legal case and providing the verification and collocation functions in accordance with the invention will now be described.
Figure 3 is a diagram illustrating a method 100 in accordance with the invention which may be implemented on the computer system of Figure 1 for processing a legal case to generate information about the legal case which may be used for verification and collocation functions. As an aid in understanding the processes, the movement of a single legal case will be described. It should be understood, however, that a plurality of legal cases may be processed at the same time since each legal case may be at a different point in the process. An electronic version of the text of a legal case 102 , referred to herein as "WLLOAD", is fed into a citation identification process 104 (ACITE) that identifies candidate citations to other legal cases and other legal material within the text of the legal case, and marks up the text, i.e., adds a characteristic mark-up symbol to the text, so that the citations may be easily identified at a later time.
An example of a mark up symbol may be that the symbol combination " /0v "
placed at the beginning and at the end of the citation. This identifies the citation for later processing.
Briefly, the citation identification process identifies candidate citations by identifying certain patterns of text in the legal document and compares these patterns to a predetermined set of reference patterns. In particular, digits may be first identified in the text. Next, the text is scanned for abbreviations proximate to the digits which correspond to known reporter abbreviations, such as "Cal."
or "P.". Once a piece of text having the particular formatting and punctuation of a candidate citation is identified, a case control database 124 is queried to determine if the identified candidate citation corresponds to a valid citation in the case control database. If the identified candidate citation matches a citation in the case control database, a second processing pass is performed. If no match is located, the identified candidate citation may be flagged for later manual review. As described above, each citation has a predetermined format. The format may be <case name>, <volume number> <abbreviation of reporter name> <series number (if more than one)> <page number in volume>. For example, in "18 Cal. App. 4th 841". "Cal. App. 4th" refers to the "California Appellate" reporter, 4th series; "18" refers to volume 18; and "841" refers to page 841, the page of volume 18 of Cal. App. 4th where the case decision begins.
As example of a citation to a legal case is Pleasant v. Celli, 18 Cal.
App. 4th 841, 22 Cal. Rptr 2d 663 (1993) in which the first name portion, i.e., Pleasant v. Celli, identifies the parties of the legal case; the second reporter portions, i.e., 18 Cal App. 4th 841 and 22 Cal. Rptr 2d 663, identify the reporters which themselves have a particular characteristic format as described above.
Once text corresponding to a reporter name is located, the text adjacent the reporter name is analyzed to identify the volume, series and page number of the citation as well as the year of the published opinion. Once till qiiifnrn, ti fly+

found, the candidate citation is identified and marked up, as described above, to identify it as a citation. The citation identification process may use a two pass process in which first, full format citations, such as Pleasant v. Celli, 18 Cal.
App. 4th 841, 22 Cal. Rptr 2d 663 (1993), are identified, matched to the case control database, and placed within a table. In a second pass through the legal case, short form citations, such as Pleasant, may be identified based on the text of the full citations that are contained in the table. It should be noted that these short form citations cannot be identified automatically without first identifying each full citation. For doubtful short form citations which don t match the table, a tentative identification may be made.
The citation identification process 104 in Figure 3 outputs a file 106 containing the text of the legal case with any citations marked up. The file may then be fed into a quote identification process 108 (IQUOTE) in which the text of the legal case is parsed quotations in the text of the legal case are identified and marked up, and a possible source of the quotation is also identified. At this point, the marked up quotations have not been verified.
They are merely candidate quotations which must be further processed to be verified.
The details of the quote identification process will be described below with reference to Figures 4-6. The quote identification process may output a file that contains the text of the legal case in which both the citations and the quotations are marked up. At this point, the text of the legal case with the citations and quotations mark-ups may be stored in a database for later use and may also be fed into several processes. These processes may include a quote verification process 112, a depth treatment process 114, and a negative treatment process 116. As shown, these processes may execute in parallel on the same file since each process generates information about the legal case which is separate and independent from that generated by the other processes. Each of their processes will be described in more detail below with reference to Figure 7, Figure 9, and Figure 8, respectively.
In general, the quote verification process 112 verifies that the candidate quotations identified by the quote identification process 108 are in fact from the source (i.e., the citing case) by comparing the candidate qUOtatinn in the cited case to the quotation in the citing case. The process then generates a data record 118 containing information about the verified quotation. The depth treatment process 114 uses information generated by the system, including the verified quotations to generate depth treatment information, such as the number of occurrences of a citation and the characteristics of the citation based on its position (e.g., whether it is free standing, at the head of a string or in the interior of a string). The process then generates a data record 120 containing information about the depth of treatment information that is applied to each citation in the case of interest. The negative treatment process 116 generates information about any negative treatment the case of interest has received by any of the citing cases and, in step 122, a database 124 containing information about each legal case being processed is updated manually to reflect the negative treatment. The data records 118, 120 from the quotation verification and depth treatment processes, respectively, may be combined together by a grouper process 126 along with a headnote assignment data record 128 (HNRESULT), as described below, to generate a single data record containing the depth treatment information, the quotation information, and the headnote assignment information, about the legal case being processed. This single data record may then be used to generate the information displayed on a computer screen to the user as shown in Figures 2A- 2D.
The data record 118 containing the information about the verified quotations in the legal case also may be fed into a citation loci identification process 130 which attempts to identify the supporting text surrounding quotations and citations in the legal case to generate a citation loci data record 132. The citation loci data record may then be input into a subject matter assignment and thresholding process 134 which matches the words and phrases in the quotations to one or more headnotes or topics and then determines, based on a threshold value, which headnotes are selected, as described below with reference to Figure 10. The subject matter assignment and thresholding process 134 outputs the data record 128 (HNRESULT) containing the selected subject matter text, such as headnotes, which is fed into the grouper 126, as described above. Thus, the system in accordance with the invention automn=",n11,, generates information about a legal case and then provides that information, using a graphical user interface, to a person using the system when requested.

The user may quickly and efficiently locate various information, such as citation information, depth of treatment information, negative treatment information and subject matter text, such as a headnote, about the legal case from a single source.
More details about the system will now be described with reference to Figure 4.
Figure 4 is a diagram illustrating more details of the quote identification process 108, the quote verification process 112, the depth treatment process 114, the negative treatment process 116, the citation loci identification process and the subject matter assignment and thresholding process 134 of Figure 3. As shown, the outputs from each of these processes are fed into a system information database 33, as described above.
The quote identification process 108 uses the file containing the text of the legal case with marked up citations to identify and mark-up quotations as described above. The text the legal case contains unverified quotations while the file 144 containing the verified quotations is stored in the database 33. The output of the quote identification process is a plurality of data records in which each data record has an identified quotation and a possible source of the quotation. The output of the quote identification process may be combined with the file containing the text of the legal case and the marked up citations to produce a file with marked up citations and quotations 110 which is used as an input to the depth of treatment process 114, the negative treatment process 116, the loci identification process 130 and the subject matter assignment and thresholding process 134. During the quote identification process 108, as described below in more detail with reference to Figures 5 and 6, several processes are performed. First, candidate quotations in the text file are identified by scanning the text to identify symbols, e.g., quotation marks, which indicate the beginning or end of a quotation. Next, the beginning and end of the identified quotations are marked up with a quote identifier symbol, such as "%q". Finally, a possible source of the quotations, such as the legal case or other legal material from which the quotations originate is tentatively identified.
The source of the quotation is then verified during the quote verification process 112 as described below. The output of the quote identification process 108 may include a Qdata file 140 which contains information about each quotation that is later verified against the probable source of the quotations and a Qtxt file which contains the actual text of the quotations.
The Qdata and Qtxt files 140, 142 are then fed into the quote verification process 112 which uses an electronic database of legal cases, already available, to find and verify the possible source of each quotation found by the quotation identification process. For each quotation, the possible source of the quotation is retrieved. Next, the quotation identified by the quotation identification process is matched against the text of the possible source to locate text in the source corresponding to the quotation. This verifies the source as the origin of the quotation. For each quotation with a verified source, a data record 144 containing the verified quotations for a legal case is stored in the database 33.
Then, when a legal case containing verified quotations is displayed as a citation to a legal case, the citation will contain a quotation symbol, as described above, indicating that the legal case has a verified quotation. The depth treatment process will now be described.
The depth treatment process 114 may receive the file 110 containing the legal case text with the marked up citations and quotations and, in step 146, the depth treatment process performs several processes in order to determine the significance of the citation based on a set of predetermined criteria that are related in some ways to significance. These criteria may be the number of times that the citation appeared in the legal case, the type of the citation, and the association of a verified quotation with the citation. First, the depth treatment process reads through the file 110 and identifies citations which have been marked up previously by the citation identification process. For each identified citation, the type of the citation is determined to be either an ordinary citation, a middle of a string citation, or the head of a string citation. An ordinary citation is a typical citation which usually appears within a legal case and that does not have other citations adjacent to it. A middle of a string (interior) citation is a citation that appears in the middle or at the end of a string citation in which a series of legal documents are cited together in a sentence or para2ranh. An interior citation is usually perceived by users as contributing less to the depth with which the cited case is discussed. The head of string citation is a citation that appears at the beginning of a string citation and is perceived by users as contributing more to the depth since it is conventional to place the most pertinent citation at the head of a string citation. The depth of treatment process may also identify the page number of the legal case for all available pagination on which the citation appears so that a depth record is written as many times as page breaks occur in the legal case.
The information about each citation in a legal case, such as the total number of times that the citation appears in the legal case document, the types of each of these citations, and the page number for each citation occurrence is output in a file 148 which is stored in the database 33. This information, in addition to any verified quotations associated with any of the occurrences of the citation, may be used to generate both the "citations to the case" section described above and the depth of treatment symbols. The technique for generating the depth of treatment symbols will be described in more detail below.
The negative treatment process 116 may include an automatic processing step 150 and a manual verification step 152 which generate a list of the negative history (i.e., other written opinions from other legal case which disagree with or overrule the current legal case) for the legal case. During the automatic processing step 150, the file containing the legal text with the marked up citations and quotations is scanned in order to identify stems of certain words, such as "overrule", "recede", "disapprove", or "distinguish", which may indicate negative treatment. As an illustration, the process to identify the root of the word "overrule" in the text of the legal case is described. When an instance of the root "overrule" is identified, a set of heuristic rules, as described below, are applied to make a determination about whether the sentence containing the identified root is actually an overruling, as described below with reference to Figure 8. Then, during the manual verification process 152, a human operator of the system verifies the results of the automatic process and the actual verified overrulings are added to the case control database 124. The human operator may also identify other negative history about the legal case which cannot be easily identified automatically, as described below. The negative treatment process aids a human operator in rapidly identifying overrulings. These overrulings are negative history which affect the authority of the reasoning of the legal case.
The loci identification process 130 uses the file containing the legal case text with marked up citations and quotations and a file 144 containing the verified quotations, identifies any marked up citations, and applies a set of heuristic rules, as described below, to identify and select a portion of text from around each citation which may indicate the text supported by the citation. If a citation appears multiple times in a legal case, the surrounding text for each of the occurrences of the citation is combined. In addition, if the quote verification process, as described above, has verified any quotation associated with that citation, the text of that verified quotation is also combined with the other text surrounding the citation. All of the identified text that surrounds each citation may then be used to determine one or more headnotes or subject matter headings which may be applicable to the citation. The subject matter heading classifies the citation based on a predetermined number of subject matter areas, such as Intellectual Property or Patents. A process 154 (Headqf) reads all of the text identified adjacent to a given citation and generates a natural language search query to search an existing database for matches to the identified text, as described below. The natural language query process is generally described in U.S. Patent Nos. 5,265,065 and 5,418,948, which are assigned to the same assignee as the present application. The Headqf process 154 generates a file 156 containing the natural language queries.
Using the natural language queries, a subject matter assignment process step runs the natural language queries against a headnotes database to identify subject matter headings, such as headnotes, which possibly match the text surrounding the citation. For each matched subject matter heading, the query also generates a belief score value indicating how close the subject matter heading match was to the text. A predetermined number of the most closely relevant subject matter headings and their belief scores are provided to a thresholding process step 160.

The thresholding step uses the subject matter headings identified and performs various calculations which take into account the rank of the subject matter headings, the belief score of the subject matter headings and the number of citations which reference that subject matter heading. After the calculations are performed, a predetermined number of top headnote hits and a flag for each headnote indicating if the headnote passed the thresholding are stored in the database 33 with a link to the citation. These subject matter headings permit citations in the legal case to be classified by and searched for using these subject matter headings, as described above with reference to Figure 2D. Now, the quote identification process will be described in more detail.
Figures 5 and 6 are diagram illustrating more details about the quote identification process 108 in accordance with the invention. The quote identification process 108 may include a lexical scanner process 170, a paragraph buffer 172 and a main loop process 174 to receive the text of the legal case and automatically generate a file containing each quotation identified and a possible source for each quotation. The lexical scanner 170 splits documents into logical fragments, known as tokens, and these tokens are then used by the main loop process 174 to identify quotations. The tokens which are identified by the lexical scanner may include capitalized words, punctuation marks that might end a sentence, white space such as one or more spaces, case names, footnote references, star of quote markers and end of quote markers. The lexical scanner process used may be based on any of a number of commercially available software applications, such as, for example, an application known as FLEX, available from Sun Microsystems Inc, Mountain View, CA. The lexical scanner accepts grammar specifying patterns and identifies an action when a specific pattern is located. In particular, the lexical scanner, in accordance, with the invention may divide a legal case into the certain types of paragraphs based on a predetermined set of criteria, such as a set of rules: 1) a paragraph which might contain a quotation; 2) paragraphs which are indented block quotations; 3) paragraphs which contain important information about the document, such as the star of the document, the document's serial number or the end of the document;

and 4) paragraphs which are of no interest to the quotation identification process, such as headnotes, headings and the like. A variety of different criteria and rules may be used to identify these paragraphs.
An example of a set of rules which may be used by the invention will now be described. The set may include a rule that identifies paragraphs which do not contain any quotations and stores them in the paragraph buffers where they are overwritten by the next paragraph, and a rule for paragraphs with possible quotations in which the lexical scanner returns a tag to the main loop indicating that the paragraph is either a normal text paragraph, an indented block quotation paragraph, or that the text of the quotation appears in a footnote.
Once Ihe type of the paragraph is determined, the lexical scanner processes the text within the paragraph in the same manner to identify any tokens in each paragraph.
Within each paragraph, the lexical scanner may identify the following tokens: a capitalized word, a non-capitalized word, a numeric character string, an abbreviation, a proper name (i.e., "Mr. Smith"), a case citation, a section reference (i.e., "Section 150"), a case name (i.e., Roe v. Wade), an embedded reference, any end of the sentence punctuation, any other punctuation characters, a colon, semicolon or comma followed by a space, single or multiple white space characters, a start of a quotation, an end of a quotation, the number of a footnote, open and close parentheses, open and close brackets, open and close curly braces, a mark-up for a citation, and a mark-up for an embedded reference.
More details about the operation and modification of the FLEX software application is available from the Sun Microsystems Inc. Reference Manual, Programmer's Overview Utilities and Libraries, Chapter 9, pp, 203 - 226.
The paragraph buffers 172 are where the tokens about the paragraph most recently scanned by the lexical scanner are stored before being processed by the main loop 174 and then possibly written out into an output file if a quotation is identified in the paragraph. The main loop 174 may decide what action to take for each token returned by the lexical scanner, manage the paragraph buffers, and decide when to discard data for a previous paragraph from the paragraph buffer, link several physical paragraphs together into a virtual paraaranh fnr quotations which run over several physical paragraphs, determine where the breaks between sentences occur within a paragraph, and decide when to process a virtual paragraph by a set of heuristic rules, as described below.
Figure 6 is a flowchart of the quotation identification process 108 in accordance with the invention. In step 180, the legal case text is scanned paragraph by paragraph and for each paragraph, the sentences and tokens in the paragraph are identified. In the step 182, a set of heuristic rules is applied to each token in a paragraph to determine if a quotation had been identified. One of the most important functions of the lexical scanner and the quotation identification process is to identify the beginning and end of a quotation.
This is difficult since each writer may use a slightly different format for the beginning and ending of a quotation. Therefore, several rules are needed to identify the beginning and ending of a quotation. An example of a set of heuristic rules that may be applied to accomplish such identification will now be described. These rules may use the lexical scanner to identify a conventional start quotation punctuation symbol, such as "or", to identify a conventional end of quotation delimiter, such as "or", or to identify a start/end of quotation symbol in a longer string of characters. For example, a rule may attempt to identify strings in which the conventional end of quotation symbol is embedded within a sentence. For each of these rules, the characters surrounding the token may be checked to ensure that the token is in fact a star of end of the quotation.
Once the rules have been applied to each token in a paragraph, the quotation identification process determines if another paragraph exists in step 184 and loop to step 180 to process a new paragraph. Once all of the paragraphs have been analyzed, in step 186, the process output the data record containing the identified quotations and the possible source of those quotations. Now, the quotation verification process will be described.
Figure 7 is a flowchart illustrating the method 112 for verifying a quotation in accordance with the invention. At step 200, the quote verification process reads in the text strings identified as quotations by the quote identification process 108 and identifies separators, when present, from a predetermined set of separators in the text strings. The separators may include ellipses, bracketed expressions, and stop phrases. The stop phrases include a variety of legal phrases and others which do not help identify the source of a quotation, for example, "citation(s) omitted", "sic", "emphasis provided" and the like. When present, the separators are used to parse the text string into segments in which each segment includes the works that occur between a pair of separators. In step 202, the text string is parsed to determine its length since the minimum verifiable quote length may be, for example, six non-stop words, where stop words are non-content bearing words such as articles and prepositions. The text string is also parsed to collapse any words which contain apostrophes or other punctuation marks (e.g., "T]hen"). The parsed quotation text string falls into one of two distinct categories: (1) a text string with a single segment, or (2) a text string with multiple segments. Thus, in step 204, the system determines if the text string has a single segment. If the text string has a single segment, then in step 205, the collection normalized inverse document frequency (IDF) for each term (word) in the single segment of the text string is determined. A document frequency value indicates the frequency of a particular term in a typical document collection, while IDF is equal to the reciprocal of document frequency (i.e., 1/doe freq), or in other words, the rarity of a term in a document collection. In a preferred embodiment, the collection normalized inverse document frequency (IDF) may be calculated, if the number of occurrences of a word is greater than zero, as:
log Collection _Does Doc Occurences idf _score=
log(Collection _Does) where Doc_Occurrences is the number of documents in which the given term is present and Collection Does is the total number of documents in the collection.
The IDF is used for purposes of determining good terms for matching, since a rare word is more likely to be distinct and provide a good indication that the quotation is from the candidate source.
Once the IDF has been calculated for each term, a selected number of the terms (i.e., six) with the highest IDF values below a selected threshold may be ranked by IDF value (step 206) and placed into a "template" (i.e., storage array) (step 207) which indicates the position of each term in the text string. Any terms with an unusually high IDF value (e.g., greater than 0.80) are not used, since such infrequently occurring terms are often misspelled words. If there are several terms with the same IDF value, then the alphanumeric ordering of the terms may be used as a secondary key for ranking the terms for the template.
Should there still exist equivalent terms (e.g., terms with the same IDF
values and alphanumeric spellings) then the position of the terms in the text string may be used as a third key for ranking the terms in the template. The template may then be compared to the quotation from the candidate source document to determine if an exact match, based on the positions of the high IDF terms, occurs in step 208. If an exact match occurs, then in step 210, the verified quotation is output and fed into the database as described above. In the event that an exact match does not occur in step 212, a certification match failure message is generated and the quotation is not stored in the database.
In step 204, if the text string has multiple segments (i.e., it contains one or more separator terms in the text string, such as "The roof fell in...
crashing down), the process goes to step 214 in which the IDF for each term within each required segment is determine. Then, a selected number of terms (e.g., four) within each segment, with the highest IDF values below the threshold, are ranked by IDF (step 215) and placed into a template (step 216) in order to determine the position of the terms in the segment for matching purposes (step 208). For a text string with more than four segments, the first two and last two segments may be used to match against the candidate source document (step 217-218). In this manner, the quotations identified by the automatic quote identification process are automatically verified and any verified quotations are identified by a quotation symbol, as described above. Now, the negative treatment process in accordance with the invention will be described.
Figure 8 is a diagram illustrating a method 220 for determining the negative treatment of a legal case in accordance with the invention. The file containing the text of the legal case with the marked up quotations and citations is input into the automatic negative treatment process 150. The automatic negative treatment process may 1) identify occurrences of the word stem "overrule" in the legal case; 2) determine the proximity of the stem to a citation;
and 3) exclude any bad legal cases. Prior to identifying the stem "overrule", the case control database 124 may be checked and the automatic processing stopped if any history already exists for the legal case. To identify the occurrences of the stern "overrule", the text of the legal case is are scanned and the verb tense of any occurrences of the stem is determined. The verb tense of the stem indicates whether the overruling refers to the current case overruling a previous case or some other type of overruling. A set of heuristic rules may look for a particular verb tense and then take an action based on the verb tense.
An example of the set of the rules used will now be described, but the invention is not limited to any particular set of rules. For example, one rule may locate "overrule" or overrules" in a sentence and then scans backwards for up to four words. If "not" or never" is located, then the sentence is discarded since it does not refer to an actual overruling. If "we" is found, then the sentence is added to the list of possible overruling which are reviewed by a human being.
If none of the phrases is located during the backwards scan, the sentence is also added to the list.
Another rule may locate "overrule" and then scans backwards for up to five words to attempt to locate non-case words which would indicate that something other than the legal case is being overruled so that the sentence is not added to the list. A few examples of these non-case words include "request", "motion", "objection", "claim", and "verdict". If the rule locates "point" or "points", then the sentence may be scanned forward to the end of the sentence and if "case", "cases" or "supra" is located, then the status of the sentence is unknown and it is passed on to the human reviewer.
Another rule may locate "overrule" and scan backwards or forwards, and reject or accepts possible overrulings based on the other words within close proximity to the word "overrule" since these additional words will provide the context in which the word "overrule" is being used. For example, once "overrule" is located, four words before the word may be scanned and the following actions are taken when the following words are located: 1) if "we"
is located, and the word prior to "we" is "that", the "we" is ignored (discussion about overruling only), but if no word "that" is located, then the sentence is a possible overruling; 2) if the verb is modified by a word that indicates uncertainty, such as "rather", "might", etc... the sentence is rejected since the court may be only indicating it might overrule the case; 3) if any word indicates a discussion of an overruling, then the sentence is rejected; 4) if a word indicates that another person did the overruling, then the sentence is rejected; and 5) if "will" or "should" are located, the process looks back five words for a positive word in order to accept the sentence. There may also be a similar set of rules for the verb "overrules", the infinitive form of the verb and the passive voice of the verb.
Another set of rules may look for various words which indicate a discussion of whether to overrule, whether a court has the authority to overrule or a past overruling since these sentences are rejected as not containing an actual overruling. Another set of rules may reject sentences which indicate that someone else is doing the overruling (i.e., another court in the past). Still another rules may look for "overruling" and then determine if the sentence is rejected or accepted based on the sentences surrounding the word, as described above.
There are also other rules which look for particular features of a sentence independent of the verb "overrule". For example, if the phrase "COURT:" is located at the beginning of a sentence, which indicates a direct quotation from the judge, the sentence may be accepted. If the word "Congress" is located at the beginning of a sentence, which may indicate that a Congressional statute is being overruled or that Congress itself is overruling a case, the sentence may be rejected. If the word "circulated" is found in a sentence near the word "overrule", the sentence may be accepted to catch unusual language, such as "because the decision overrules an opinion of this court, it was circulated to all active judges..." which could not be automatically identified in some other manner. Another rule may look for "overrule" within a quoted string and reject the sentence since it is usually an overruling by another court of a case which is being quoted by the current court.

In addition to the word stem "overrule", other synonyms may be searched for and identified. For example, the rules may also detect the word stem "abrogat" for California cases which use the term "abrogated" and the phrase "receded from" for Florida cases since these terms are used to indicate an overruling in each respective state. These verb tense rules may be applied in any order and the invention is not limited to any particular set of rules or any particular order of execution of the rules.
The output of the set of verb tense rules from the automatic negative treatment process is a list of possible overrulings. Then, a proximity rule is applied to each possible overruling to determine if the overruling applies to a particular legal case. For example, the proximity rule may eliminate a possible overruling if the sentence containing the stem does not contain a citation, if the previous or next sentence does not contain a citation or the sentence with the stem "overrul" does not contain a word or phrase used to refer to a case such as "case", "opinion", "holding", "precedent", their plurals or "progeny" or "v.", "ex rel", "ex parte" or "supra". Any sentences which contains the stern "overrul"
and satisfies the proximity rules are added to a suggested list 222 of overruling in the legal case. These suggested overrulings are then reviewed and checked during the manual review process step 152 by a human being. The human being, during the manual review process, also determines the case which is overruled and that data is entered into the case control database 124 which tracks legal cases within the legal cases database.
In accordance with another aspect of this negative treatment process, the automatic process may also identify relationships other than overruled, such as "disting" for "distinguished" or "apposite" in a legal case, by extending the method to the language that characterizes those other relationships. In summary, the negative treatment process aids the human reviewer in determining possible overruling in the legal cases by automatically determining possible locations of overruling so that the amount of text that has to be actually reviewed by the human being is significantly reduced. Thus, the negative treatment process increases the speed with which overruling in a legal case may be identified and added into the negative history of the legal case. Now, the depth treatment process will be described in more detail.
Figure 9 is a flow chart of the depth treatment process 114 in accordance with the invention in which a depth treatment symbol is assigned to each citation within a legal case so that a person using the system may quickly determine the amount of text devoted to discussing a particular citation. This information may be utilized as one indication of the relevance of the citation since a court will devote more text and discussion to a highly relevant citation.
At step 230, the file with the text of the legal case and the marked up citations and quotations, as described above, is received by the depth treatment process. At step 232, the depth treatment process identifies a citation in the legal case, and then in step 234, the type of citation is determined. Each citation in the legal case may be 1) a citation at the head of a string citation; 2) a citation without other accompanying citations; 3) a citation within the interior of a string citation; or 4) a pro forma history citation (i.e., a citation that, in the context of the document, are cited solely as a ancillary historical references for one of the cases cited in its own right). Each of these types of citations has a different amount of significance. For example, a lone citation or a citation at the head of a string citation tends to be more significant than a citation in the middle of the string.
The depth treatment process next determines if there are any additional citations in the legal case in step 236 and loops back to step 232 to process the next citation in the legal case. Once all of the citations in the legal case have been identified and sorted into one of the types described above, they are fed into the grouper process 126 as shown in Figure 3. After the grouper process, in step 238, the depth treatment process determines, for each different citation, the total number of each type of citation in the legal case. For example for a citation to Pleasant v. Celli, there may be a total of five cites in the legal case of which three are at the head of a string citation and two are within the interior of a string citation. This information about each citation in the legal case and any data about a verified quotation which is associated with a particular citation are used in step 240 to determine the depth symbol which will be assigned to the particular citation. Once the depth symbols have been assigned for each citation, the depth treatment process has been completed.
One example of a technique for assigning a depth symbol to a particular citation will now be described, but the invention is not limited to any particular technique for assigning the depth symbols. In addition, the invention is not limited to any particular type of depth symbol. In this example, a citation in the legal case with one to three occurrences of any type of citation (i.e., the citation standing along, the citation is the head of the string citation or the citation is in the middle of a string citation) in the legal case is assigned two stars (e.g., **), a citation in the legal case with four to eight occurrences of any type of citation is assigned three stars (e.g., ***), and a citation with nine or more occurrences of any type of citation is assigned four stars (e.g., ****). To further refine these assignments, a citation with three occurrences of any type of citation and a verified quotation associated with the citation is assigned three stars( e.g., ***) while if a citation has only internal string citation types, one star is deducted from that citation. Thus, the depth symbol for a particular citation in the legal case is automatically assigned by the system in accordance with the invention.

The depth symbols help a user of the system more quickly determine which citations are probably more relevant. Now, the subject matter text assignment process in accordance with the invention will be described.
Figure 10 is a flowchart illustrating a method 250 in accordance with the invention for assigning a piece of text nom the cited case to the citation in the legal case. In the example described below, the text of a headnote in the cited case is assigned to the citation, but the text assignment process in accordance with the invention may be utilized with a plurality of different pieces of text in the cited cases. In step 252, a citation locus (i.e., a region of text likely to correspond to the text supported by the citation) for each citation is assigned according to the a set of rules which are now described.
To identify the citation locus, several text-parsing rules may be used, some of which are stronger than others, but which collectively would be highly likely to identify the text. To allow for varying effectiveness of the different rules, the extracted text may be divided into three groups, "high", "medium"
and "low", according to the likelihood that the extracted text was part of the correct citation locus. These rules may include:
Category Text High 1. any non-citation material contained in the sentence that includes the base citation.
2. all of the first non-citation sentence preceding the base citation within the same paragraph.
3. if there is no type 2 sentence, then all of the first non-citation sentence following the citation within the same paragraph.
4. all text that can be identified as a quotation form the cited case.
Medium 5. all sentences occurring between the citation next preceding (but not contiguous to) the base citation and a type 2 sentence.
6. all sentences occurring between the citation next following (but not contiguous to) the base citation and a type 3 sentence.
7. if there is not type 2 or type 3 sentences, and theparagraph containing the base citation ends with a colon or comma, the whole of the paragraph next following the paragraph containing the base citation 8. if there is not type 2 or type 3 sentences and no type 6 paragraph, the whole of the paragraph next preceding the paragraph containing the base citation 9. if any of the text areas identified by any rule includes a headnote reference marker, include the headnote and its keyline Low 10. the whole of the paragraph containing the base citation General 11. if the citation occurs in a footnote, it is treated as if it occurred at both the footnote location and the location of the footnote marker Not Posted 12. citations occurring only in the subsequent history of another citation Then, in step 254, the terms in the citation loci are weighted according to the rule that was used to identify them, with a high, medium or low matching corresponding to weights of 2.0, 1.0 and 0.5, respectively. Different types of documents, such as legal cases or law review articles, may require a different set of rules to determine the weights. Once the pieces of text have been identified and assigned a belief value, in step 256, the identified pieces of text are matched against pieces of text which may be within the cited document. In one example, the pieces of text within the cited document may be headnotes, but the invention is not limited to any particular type of text which the identified pieces of text are matched against. The matching may be done using natural language query as described in previously referenced U.S. Patent Nos. 5,265,065 and 5,418,948 which are owned by the assignee of the application. The results of the search is a list of possible pieces of text from the cited case, such as a headnote, which may be assigned to the citation in the legal case and a belief score for each possible piece of text.
Next, in step 258, the one or more pieces of text that are going to be assigned to the citation are selected though a thresholding process. The thresholding process ranks the pieces of text for each citation based on the belief score. The piece of text may be posted to the database whenever the following quantity equals or exceeds 0.5:

14-e 4130 A Vbelief ¨ 0.4 + 132In(freq)+ 133In(belief ¨lag2+0.0001) The beta values for this equation are as follows:
Document Rank Oo P2 03 non-ALR 1 4.0451 3.1975 0.8477 .9033 non-ALR 2 0.5573 9.0220 1.0348 0.6743 non-ALR 3 -2.0421 11.2619 0.8949 0.2954 ALR 1 -1.4256 50.4929 0.3488 0.0000 ALR 2 -2.8199 65.6148 0.6207 0.0000 ALR 3 -2.3701 40.8479 1.2445 0.0000 ALR 4 -3.3474 60.8075 1.7349 0.0000 ALR 5 -3.0805 55.6003 1.3188 0.0000 where the columns marked "ALR" contain variables for ALR articles, as described above, which have a higher belief score than the non-ALR documents.
The columns labeled "non-ALR" contain variables for non-ALR documents.
In the equation, Freq is the total citation frequency for the citation pair, and lag2 is the belief score of the second following candidate when the candidates are sorted by belief score in descending order (or 0.4 if there is no such candidate). Once the thresholding has been completed and the one or more pieces of text has been assigned to each citation in the legal case, one or more pieces of text are stored in the database in step 260 as described above so that it may be retrieved for a user when requested.
hi summary, the subject matter assignment process automatically generates one or more pieces of text for a citation in the legal case based on pieces of text in the cited case such as a headnote. The process first automatically identifies supporting text in the legal case and assigns a belief value to the supporting text, matches all of the piece of text against pieces of text in the cited cases, and then automatically assigns a piece of text, such as a headnote, from the cited case to the particular citation. These subject matter assignments permit a citation to the legal case to be sorted or selected by the subject matters which helps during the collocation process.
Thus, the machine implemented system in accordance with the invention automatically processes a document, such as a legal case, and generates information about the document which may provide the user of the system with useful information about the contents of the document. In a conventional system, on the other hand most of this information about the document would be generated by a human being reading the document and making notes about the document which is a slow, expensive, error-prone process. For a legal case, the system may automatically generate information about the negative history the legal case, about the depth treatment of a citation by the legal case, about the quotation in the legal case which are verified as originating from a particular source, and about one or more headnote which are assigned to a particular citation in the legal case. Thus, the operator of the system may rapidly generate this information about the legal case and a user of the system may quickly locate this information since it is all readily accessible from a graphical user interface.

CA _n2615221 2008-01-11 Appendix Slide 1 , , '-ni=kilIngliti=gi =
, = " = : :,,,, , == =
= .
=
, -1-1/-14r:# rol _,,, (=sir.' i - == vei-,::;
, - lop. i, !; ; ,:: QI=Jt .1 ,.= ,L; ;!. , ,,,,,ammosurrialli = ._ ; '--;--'-- - - - = -.
=
.=
õ
, =
. -_ ..
õ
, , . .
, , - , , ..
-, . -:
= = 4-===...
.1 4. =V.--;, . . ,.., . .
, = " W k . :
, Graphical µ.,, = ' .. ' , , 1..'.
V
. __ ' = .! ).',.' 4'.. = '''' '=
_. = . ' . .. :4 4.. . ; 4 l'-- -. = ' k - Ai, .;:-,,: .-4 .:1., i=
, ... .
. , .4.A.
..i7-=
:'it4ii1,1:
I': 1:'-' = . 46, J .'" IsT '' '-'1, - =
=== .7=4"'"'= ''' 'c'":4':1 Pah KeyCiLe ,....,, .........õ
te--.,-, = == õ9õ=:,*.11.4,,,,,.4.4,õ,iiritilolieõ:...t,õ:!
,..,õ,".11: == ..,,..41.,111000t,==,4Ethwv411.1=1.---õ,..= =
,w.11- :frv. .. ,,,,-.,,-,0,11, ........ ,,,=4.,01,7=14g,!=ei,L711:1=i,.,,,i,ii....,,,t,...
4,,vv.õ,h,.,,i.õw,,,,=õ=,,,Ir ,...,, = = . ..,,,,====...--,1:-]=::,q44-411'.t. ' -t,...,s../- .;.,,,- .,,,,...w.-= ::.
Ili,iiill!!..U01. = .'=:;
i:,.,,jili.17,11,4411Et439.41111!:ti,:"''' ::17-- . ,:'I '*.z...7-:.1.:
.."'4r'::A' .7f .1.'-i141!:,.':: H I reP.-2 . '.6ii'l 1 VIP:K;Ffili. -'C'W..:'.'.
411,,..k.======%÷11*,..,. A qiii 1:..f.k...44, Nri,,,,,,,,,,i..:0.,,?!iii,t, =
:1,14.1 .:..., = . - ' ; ,,,,,, =0:1-=.:1; ,..11õ1::., . I..., ,,,,014,:ve..,.:.1.,.--:,,,.., i ..,,,, ''',,itim:':5=,,,5'ErgAqf , .
*::' !k'.13.. ;lit' .f.,]..5.;,- i li, 1.4..T ,j:: ;;- ,.. :!-,-2,1,:: ,, taci (411.V,'Itr,c.qa.:=',..1;; If ilikill,451114/.NH'Ilg-7-11b1 1- ' . 11411114H' '''''Ilt'lleS.4rril -11=11'4'.,1' AR41:'=11:4111f1., P'''k''':"':4%;:i..=
.%,,..siP=i'':iiiil,j,4.:..""1.'"4: I.
..14111111T4;.KktilignAii:114'140.1! Pi,'... "q,01.l, I iNY.311di P :ff: =
;`,"A,.,,=., 41' Y,.1'..L.,;:i.ikibitikl.11L.,..= _,.., ',.....,¨...--...--PV?A',-.,n.:iikr.,i:10 I. .4.:: .":,,,Iii..1h1.KØ,,sr,t,i:-,2twitigiellik,i.j..,ez.,..:-...-u'.
E N. = ='''4,.?1':i:' i E .=-V i .:2..:=.11,1 r R'Vt.t.f:le.j kg' ;:,.U.SIUM
'''''' ¨ ''''''' =
_______ SA.E3:2 L^.:(EL: I'M¨I,' --, -,...
, , Slide 2 vtres-r Graphic;!

= Visual display of KeyCite direct history for cases = Designed to make cases direct history easier to understand and use = Majority of direct history displays not difficult to understand now, however:
¨ Customers still prefer the graphical display ¨ Customers who said that they preferred the textual display were able to get more questions correct when they used Graphical KeyCite = Will play large role in Academic market ¨ instructors will use to teach direct history Slide 3 ¨71:11777.' =
411 - -4, -wIcs-r Grq lrbr , (T, , Some Motivating Problems Recognized by Inventor(s) Slide 4 Wf.... ay 'el Some case Histories in text format can be r _ __ challenging to follow...
..1-; i - ' oe s,ct, 4-602t . .
. .Ct 60THONIScuu 4 _________________________________________________________________________ rc< Full ScreenZt r> U.S.Arlz. 1966. wEs.r Jun 13, 1966 Find citation: 1----10 , History r,Some negative history but not KeyCial (Showing 104 documents) r overruled *History =
Citing References Direct History Monitor With KeyCite Alert ____ - = -- -----; PI People v. Vignera, 21 A.D.2d 752, 252 N.Y.5.2d 29 (N. Y.A.D. 2 Dept. May 04, 1964) Full-Text Document = Case Outline , Motion Granted by 'tons, Briefs -H 2 People v. Vignera, 14 N.Y.2d 951, 1964 WL 113481 (N.Y. Rd 10, 1964) (TABLE) Peti ar Filinos ., AND Motion Granted by . . -. . =
-ReglitsPliss-- About . -' . ---- H 3 People v. Vignera, 14 N.Y.2d 981, 1964 Wl. 18577 (N.Y. Oct 01, 1964) (TABLE) ALR ' ' = .
1.,. Comment Note.--Necessity of informing 1 AND Judgment Affirmed by =
Suspect of rights Under privilege against self- I r M . A
incrimination, Prior to oolice interrogation r r a People v. Vignera, 15 N.Y.2d 970, 267 N.E.2d 527, 259 N.V.s.2d 857 (N.Y. Apr 15, 1955) , P1001054 Remittitur Amended by , ____ , . __ ' ALR -1 H a People v. Vignera, 16 N.Y.2d 619, 1965 VVL
18822 (N.Y. May 20, 1965) (TABLE) " ..
2. What constitutes assertion of right to ! AND Remittitur Amended by counsel following Miranda warnings-state H 6 people v. Vignera, 16 N.Y.2d 614, 209 N.E,2d 110, 261 N.Y,S,2d 65 (N.Y. May 26, 1965) caseq 83 AL04Tli 443 ..i.- AND Certiorari Granted by , , = ________________ .. -=== i H 7 Vignera v. New York, 382 U.S. 925, 86 S.Ct. 320, 15 L.Ecl.2d 339 (U.S.N.Y. Nov 22, 1965) AmJur42d (NO, 397, 841SC) 3. Evidence Confessions Other Matters Affecting = . .i AND Judgment Reversed by Admissibility; Constitutional Rights, = i , ' w=a .
Generally; Fifth Amendment Rights; Mirand ! keyCited Citation.
' Warnings Miranda v. Arizona, 384 U.S. 436, 111 Ohio MiSc, 9, 86 S.Ct, 1602, 16 L,Ed.2d 594, 10 = I- A.L.R.3d 974 (U.S.Ariz, Jun 13, 1966) (NO. 759, 760, 761, 5.84) ' _,--- ---- - '---- - ' ruble of=Authorities=Rehearing Denied by - - - - . " '-: --- - 1.7-- H 9 California V. Stewart, 385 U.S. 890, 87 S.Ct. 11, 17 L.Ed.2d 121 (U.S.Ariz. Oct 10, 1966) Wes_t Key Numbers (NO, 584, OCT. TERM 1965) j, :. _õ=,õ,..,,,,,,...., , , , , Slide 5 lAe...Aildv KeyCite case appearing more than once I
Research Trail 1 atlp,..e $1gni in history result can be confusing! = <evSeert.h 11µ40-re -' ....,0.7.--dr...,a,L.... is V,x,': =:, . ...-, : ert.tt. i313i7--1. I- geycire.
, le.tn,.., .136, 1') $,Ct. 360A 111011VISCS
<-4 Full Scn-tr, OA G> 0.S.A0z. 1966. -..............
wise Jun 13,1966 ......-............., Find citadel): E.-- 10 --- N z Wawa v. New York. 382 U.S, 925,85 S.Ct. 320, IS L.Ed.2d 339 (Li.S.N.Y. Nov 22, 1965) D.. Same negative historY hot not Keyat (NO. 397, MSC) ' overruled N,,0 aldgment Reversed by *History Mina Fefora_nPas I itoa KeyCited Citation:
ontor With rsitC41-e Met Miranda v. Arizona, 354 U.S. 436, 10 Ohio Misc, 9, 86 S.Ct, 1602, 16 1...Ed.2c/ 694, 10 A,L,12,3.1 974 (U.5.Aria. Jun 13, 1960) (NO, 759, 764, 761, 584) EP,Ratactl ...Q813116.44 Rehearing Dertfed by e ,asa Otithno ,...õ,,, _ ., _ . , ,,,,õ = . H / California ,.f, Stewart, 385 U.S. 890, 67 S,Ct. 11, 17 L.Ed.2d 121 (U.S.Ariz. Oct 10, 1966) Brieff; kitrs, (NO. 584, OCT. TERM 1965) gesultsPitvl .
i . __ .,, Po' a People v. Vignera, IS N.Y.2d 970, 207 N.E.2d 527, 259 N.Y.S.2d 867 (N.Y. Apr 15, 1965) f 1. corrirrtent ticte,..-tieoe5iy of infornion I s#1.3oect cf. rtaht: 1.1t1riCT relVtlf%a...RWri$t;,54- V, Remittitur Amended by f kicritniagl* ,r * , ,. griaintmogioa.
t la AMID 1054 '. H 1.1. People v. Vignera, 18 N,Y,26 732, 1966 WL
20838 (N.Y. Sep 22, 1966) (TABLE) rAt.Fr , ........---.....a.....-................._,... .....,-,, AND
Remittitur Amended by =, .,, t._ :
ite6 ,:ertioag.eau2 12 People v. Vignera, 18 N.Y.2t1 723, 220 N.E.2d 806, 274 N.Y.S.2d 152 (N.Y. Sep 22, 1966) =, counsel folftwAno miranda +gammas-state 1 cses .
i 83 ALR4Tli 444 -1 Westover v. U. 5, 342 F.2d 594 (9th Cu. (Cal) Mar 11, 1965) (NO. 19543) _. _______ ,.._ .1 Arnitir.2d ' I 0er-tiered Granted by oth,,,, mv.-xers Affr,q H 11 Westover v. U.S., 3821)0. 924, 86 S,Ct. 318, 15 1....Eti.2d 339 (U.S.Cal. Nov 22, 1965) Rioht. (r , 00, misc) , ,(- -11=-:!-.-0L.F,F.i,_,. :',,,....,),,L, ',)t Pinb.t.i.ditittilit -fie ii KeyCited Citation: V

, zalasLat rtelliierittga, Mirenite v. ?wizens, ae4 U,S. 436, 10 Ohio ritisc, 9, 86 5,Ct, 1502, 16 1,2626 524, 10 *
,A,L,R,30 974 ("0õ.5 Ari7. Ain IX 1W) (NO- 759, 7601,, 76 584) * - ' -=
West Fee Numbers Rehearing benled by , II

Slide 6 Velawõ
141111Westlaw 1 Research Trail 1 Help Siont õ
Westlaw = .4i, .
. -table of Contents 1 KeySearch ;More -Miranda v. Arizona , And then there are the "gaps"... ..

7384 I.J.S, 436, 86 9,Ct. 1602 , a46..........
U.S.Arlz, 1966, WEST
..
.7un 13, 1966 Find citation: L -7= 0 .., .
r.p...Some negative history but not H 9 C- (N= ' orni4 a v. St. art, 385 U.S, 890, 87 S.Ct. 11, 17 L.Ec1.2c1 121 (U.S.Ariz. Oct 10, 1966) .,' iqe: -79, OCT. ERM 1965) ' overruled ,, *History Citing References Monitor With KevCite Alert -lirgo 10 People v. Vigni a, 15 N.Y.2d 970, 207 N.E.2d 527, 259 N.v.s.2d 857 (N.Y. Apr 15, 1965) Full-Text Document Remittitur A =niled by = Case Outline _ . ____. _ ., __________ 4..._____-__ 1, People v. Vign: a, 18 N.Y,2d 752, 1966 WL 20838 (N.Y. Sep 22, 1966) (TABLE) Petitions.Brieft& Fillnos: AND Remittitu Amended by , , ResuitsPitivo Abotkt H 1.2 le v. Vignr. ,.. 18 N.Y.2c1 723, 220 N,8,2d 806, 274 N.Y.S.2c1 162 (N.Y, Sep 22 1966) ' ALR
, 1, Comment Note.-Nacessity of informing suspect of rights under privilege against self-incrimination, Prior to notice interrogation is P' la Westover v. U.
..,, 342 F.2d 684 (9th Cir,(Cal.) Mar 11, 1965) (NO, 19543) ALM' 1054 , , . . Certiorari Gra ed by :, . F, ' H 14 Westover v. U,' , 382 U.S. 924, 86 S.Ct.
318, 15 L.Ed.2d 339 ((i,S,Cal. Nov 22, 1965) 1 2. What constitutes assertion of right to (NO. 80, MISC) 1 wun el following Miranda warnings--state AND Reversed 1 cases , i...83_ALR4TH 443 . _ _ . , ...a Keycited citatio .:, Miranda v. Ariz no, 384 U.S. 436, 101 Ohio Misc, 9, 86 S.Ct. 1602, 16 LEI:1,2d 694, 10 A.L.R.3d 974 (U, 'Ariz. Jun 13, 1966) (NO. 759, 760, 761, 594) Arn.Jur.2d .
! 3. Evidence Rehearing Den, 7O1 by 1 Confessions, Other Matters Affecting I
. H If! California v. Stewart, 385 U.S. 890, 87 S.Ct. 11, 17 1_,Ed.2d 121 (U.S.Ariz. Oct 10, 1966) !Admissibility: Constitutional Rights, !Generally: Fifth Amendment Rights; Miranda: (NO. 584, OCT. M 1965) 1 kik/amines Table of Authorities ,, ,,õ , _õ,õõ õõ, ,,,.õ _ _.õ,.. _,_ i> 17 People v. Stewart, 52 Ca1.2d 571, 400 P.2d 97, 43 Cal.Rptr. 201 (Cal. Mar 25, 1965) (NO.
_., West Kev Nurnberii. CR, 7662) , =
.
---,.-..,. roe al Slide 7 lAgri.....
litWestlaw 1 Research Trail I Help @ Sign Of ...and ANDs , ,, , *1 ..
r rind { ,KeyCite t Directory i !able of Contents ( KeySearch (Mom _ --------_. , _---,-, _ .
t'nft+Kr, 4 , it r , Miranda v. Arizona I 861-11.1g. for 1 Kum =tticirmsot4 a- 384 U.S. 435õ 56 s.Ct. 1602 zk.
.4.4 Full Screen List ca' U.S.Arlz. 1966.
WEST
Jun 13,1966 Find citation; ITV
$j.9 keyCited Citation;
r,Some negative history but not KeyaaMiranda v. Arizona, 384 U.S. 436, 10 Ohio Misc, 9, 86 S,Ct, 1602, 16 L.Ed,2d 694, 10 ' overruled A.L,R,3d 974 (U.S.Anz, 3un 13, 1966) (NO, 759, 760, 761, 594) .
*History citina References Rehearing Denied by Monitor With Keycite Alert H 2_0. California v, Stewart, 385 U.S, 890, 97 S.Ct. 11, 17 L.Eci.2d 121 (U.S.Ariz, Oct 10, 1966) (NO. 584, OCT. TERM 1965) 04 xE_____e_t C__ j_c_ento um 0 Case Outline Petitions, Briefs iiFilinaq I* a State v. Miranda, 98 Ariz, 18, 401 P.2d 721 (Ariz. Apr 22, 1965) (NO. 1394) t3e5U1I5PIDS",'.......: ApOUt Certiorari Granted by ALR71 H 22 Miranda v. Arizona, 382 U.S. 925, 86 S.Ct, 320, 15 L.Ed.2d 338 (U.S.Ariz. Nov 22, 1965) 1, Comment Note.--Necessitv of informing k I
suspect of rights under privilege against self-incrimination, priorto oolice interrogation = . AND Reversed by { 10 AUM 1054 . . ., . *2 ".ey I e. I a ion:
__________________________ - -----______________________ -,- Miranda v. Arizona, 384 U.S. 436, 10 Ohio tvlisc. 9, 86 S.Ct. 1602, 16 L,Ed.2d 694, 10 ria-- -,------,. . A I D '3.4 a7a (I1 q Ari'. WI 13, 1966) (NO, 759, 760, 761, 584) 2. What constitutes assertion of right to '- 1 Rehearing Denied by counsel following Miranda wamings-state casesH 2A California v. Stewart, 385 U.S. 890, 87 S.Ct. 11, 17 L.Ed.2d 121 (U.S.Ariz. Oct 10, 1966) 83 At.R4Tft 4. J (NO, 584, OCT. TERM 1965) . --,---.7__- --AM.3ur.2d 1 Negative Indirect History (U.S.A.) 3. Evidence Confessions, Other Matters Affecting Superseded by Statute as Stated in Admis ibilitv; constitutional Rights, ' P. 25 U.S.v Di k r on 166 F.3d 667 (4th Cir,(Va,) Feb 013, 1999) (NO. 97-4750)* ** *
GenerailY: Fifth Amendment Rights: Miranda 1" - V. c e 5 ' Warninca 1 HN: 71,77,78 (S.Ct.) L ii ,., * , - ,-.1-1 People v. Banks, 2000 WL 33519258 (imich=App. Apr 21, 2000) (NO, 211439, 216965)*
Table of Authorities = ' = * I-IN: 1 (S.Ct.) ' Wust __ Key Numbers. Declined to Follow by , - C 27 grAt.,, mnni-nuA_ --I=rvi2o4..43n_p21 RAc "t to_ mr, 3n 1 ci67.1nurl _R24.7 \ 4' -1" J4111.
' = '`µ,06-1171 _______________________ ,, ,, . --a C

Slide 8 ;sr , ?Any = =
9-, -. =-.
Graphical KerSiCite.
rtaiP--44' .
Alternatives to the Conventional Text Interface THOMSON
WkST

Slide 9 ...
r ,...,,,....,:l... --i-,i,.. ,:g i?
õ
.=.,ctIll,IVe, ' :
:
A vertically oriented õ,õ,,,õ,,, .. . =====:-thread-focused design -user selectable hyperlinks for retrieving artd/or br. Ni.õ,,-i-,:,,,li 74 86 5 . 3...160:.''' A ft , 142r,r,,iciv.
displaying referenced case documents i...."
(rtirT"Trr7:2=41 .a."4 ..... . .

..
1 lod,,v,i-tvr =cli== 30,,,i1v0;7.4t4 - = '" '''' rVil";;;;;;V- 31 = = - r.---.:,,,,,,...t ...
,s s.a. raiimilpf, ,,,,,, ;2,1461 r 6, :061: - '.1,-;...-, OM: = 3 ',. ": ' µ'-' . r=e,,,,I.v.111,11 ......,...:===774-..... ,,1,11 .,11.....W.i. = ' -=.--7.-7.7,.i:..:_taii N15greggli 7rr7WIVW/ .
IT, Ma; N,1,10. i Nrt,,,I. Z2,1966 r= IM =,,,..4vslur -,..ted.eta.41_711 !J
r?or,...:
t TM 1:.! .-1,==_. v..?,1-4'."
....., ,,, .,., .1 , L. -L.......1..-*!. , 3,12 E2d 684 =
hi.. '''=", ., =
raregnaty Viimso . Lc.f.r.dza:y6-,.-) .. : trred 7574 1.1?1,1v) it, N; elm. 2. Y9,,B= -! , Sep.: i, 3.9r/,, ' . . _ 1 E=44xv= '...v,vrvvvf rvi.lihkir . ",=,-,=',== .
=
hl _v_u.o,,,,i LP
NI LL,,1 ,YLL,L- (min-C= I
, . .._ .. -,...-17. ,.-;;;141,:. v, i'4 N , C , L,V,Fi g 1.
,..
,.;,.., ......;
=
Fri people v. Vlavvr.l. = = .µ
I al, 1. 4.C..4 7SZ (frOf ,,,,, 1.:',..1 i N:i. A 0.,'?DePt 14-1,1'4,4.9t-- ., ,......L.-...

Slide 10 1=111111111111111111111111111111111111111MIUMEi;,...L..õ:õ,:õ...7, 77"-rr _______________________________________________________________________ : ;
E.14.!.m,., 1 rkt Praaci.::2ilill=L:fLo,,,:qp,ty 1_,Ii. J2 I , -1,=.q2,, , VVeStlaW r Pcnien"wnia (Imr637:11$5r, y Cori==.A.,,.-......-,=-= i ...,..., 4; ' .!,: = ' , :: '.! '''-: !!: !, :1!: !: .. ::: : ' : i,' :. . ,õ : -Search I Find I Kayata 1 Direatry I et ¨
i,, . : :
= : ; , 7 -ir4: 186ri.ii'32042 1 __________ 117 if.ItT 13a9c5"tm'mt¨' i'vgiznr 1151Isliranda v. AZ '----1 i Crekt211,g rui CA v Stew 86 S.St, 1602 ! dWildil Ur 87 S.Ct, 11 (mem),1-1 Nov 22, 1965 ! , Dec6, 1965 ¨ Yr Jun 13,1966 1"---"--410- Oct 10, 1966 biWAint Dora 1 MCnttrt, Dom , ]C.o.nt Do _ ___ I., )03=11t , = C'Kl!.t :I.PTi: R:-:
mi,y.wre 0-.%lkit ' ' õ , .
......... .. .. .. L
.1.
. Horizontally oriented time/court level focused design õ
. .
. .
. . .
ira':51177111-17RiZIATETAlligErkt µ7.:',177:712FIT.Z.E7q.117-46N.,..
:.17.121.01144,WOZi,..;i1 ti- = '-' I . =
WEST

Slide 11 Vier, aW. litrestlaw I Research Trail I tiLle igl SignOf Wcstl" 4,'''aTi. ., ..
Welcome I Find I KeyCite 1 Directory 1 Table of Contents 1 KeySearch i More N CA v. Stewart 07 9.6t. 11mem) A vertically oriented ( Oct 10, /966 thread-focused design I:. h.3Arieg ' 1 i azd hv ________________________________________________________________ ¨
0.- Judiproint gav'd bd Miranda v. AZ ll _________________________ 86 6 Ct. 1602 . .
Jun 13, 1966 0 Court Docs -v.V.pdgm*... 'd b?
A
3tor-T¨irrient rer'd'hy .1;4mi-it zled;1 H H _______ x, Vicinera v ii NY ot Miranda v.
California v. Stewart i

5 86 SCt. 320 ( 89 86 S.Ct. 320 86 S.Ct, 395 (room)-.=*rt lruntrid i --, i .
..-X Nov 22, 1965 Noy 22, 1965 Dec O, 1965 It t A
,p4 = ____________________________________________ = t , 0 .
,.:=7.4t gi -7, People v. Iiiionera People v. Vionera I aritld ,7.1 11=3 {-, 16 NY2d 619 (table) 18 9Y2d 723 (table) ILL,, NY May 20, 1965 NY Sep 22, 1966 li.
I 1 ___________________________ , z State v. Miranda z People v. Stewart 71over W t v. 11 ,,, es I LS 401 P.2d 721 is 400 P.2d 97 "VC,' 342 F.2d 684 Z. AZ, Apr 22, 1965 I CA, Mar 25, 1965 e..".,4 9th Cir. Mar 11, a _______________________________________________________________________ R tont?
r yng.:Tirrirli:/
, hmer4ei 'tat H
.= 1.1 Peo . In v. VI. nera rJ People v. Yitinera '15 16 NY2d 61.4 (table) 18 NY2d 752 (table) NY May 20, 1965 NY Sep 22, 1966 ¨ - --- ¨ .:
, __ ¨ ¨ ¨ ¨ I-Slide 12 wertiw. IntWestlaYi I Research Trail I 1:Agla @ !
Westiaty ., Welcome Find I KeyCite I' Directory I Table of Contents I KeYSearch Oy_lore I.,_..., i _____________________________________________________ A ___________________________________________________________ A
N CIrk It:anted by People v. Vianera People v. Vianera L.
16 NY2d 619 (table) 18 NY2d 723 (table) NY May 20, 1965 NY Sep 22, 1966 M- 7 = 0 State v. Miranda i People v. Stewart õof(' West , i P,...atitti+r-1 _________ I _________________________________ 401 P.2d 721 00 by F.
Rfttrilttur i f.Tioridayi by I
AS, Apr 22, 1965 4 CA, r,Pla.2rd259,71962 ill j, 342 F.2 :',/, e:,,:r4 9th Cir.
I H H
. People v. Vi n ra-7!',-t people v. Vianera 16 NY2d 614 (table) - 18 NY2d 752 (table) NY May 20, 1965 ',f NY Sep 22, 1966 .
ITT MAW,. 'm... .1 I . aeird - YrrAnd 03mittut l' Motion*, .
, . .
' rainittin' I
People v. Vicinera 15 NY2d 970 (mere) ''"''''' NY Apr 15, 1965 Legend H/ Federal High Court 4 m e415152 Federal Appellate Court u People v. Vionera People v. Vicinera ,---. , mar Federal Trial Court J
14 NY2d 951 (table) 14 NY2d 981 (table) :.),Idifinant NY Jul 10, 1964 NY Oct 1, 1964 ' ifr,l'by [1L1State High Court k i S*, ..It.1 State Appellate Court tio.-,Nt gy.antvid k. 1 aiati:ia I wanbyd,bi , S. LOW State Trial Court People v. Vianera ..*...¨ ..,.. ________ 21 A.D.2d 752 (ream) ' .l.q N.Y. A.D.2 Dept May 4, 1964 ' ¨ __ t:>Maa 44 i '11 , r," A , ..

, , Slide 13 WelaW.
liftWestlaw I Research TrailI lielp_La. ' SignOf . .
Westlato Welcome I Find I KeyCite I Directory I Table of Contents I KeySearch [More =
17177:Ar.i.14614f:Tt#,,i-;,':.i'-'4;41-d;f7-'2110;i::!..1riZTIAID:i4':',.:-.:, H LA v. Stewart !!' A vertically oriented thread-focused i , 1 ,-,1,,=:, : ,A design ¨ with designated court level zones >kl ,4.
14,1 ;) ,-P-: ilii .11...1... v.
ii,," ! 4 : - .--".
la .,.0 ::õ:
E ::: ,c -" 'Will .. iT.4 : - =:=4;ii .'4, ''' ,A5 86 S.Ct, 1602 'igt:!
e , ... ,. . :, NI:: :
!1,1- 5., mii.H::: Id Jun 13, 1966 , = illi :.;=:: i ,.. :
114. Ci,c1..1 ,in.1:: 7 7^''', D a cc * , V44 li-k.:1P':' VI , T1, 5,:, ' iliNi 1 s'.4.
-'.'--1,1_ . .'=,-..,. .?,:. : : _ ,,,,,,õ,,,A1 .
oi .=H 1 : ...... ;, 3 :t:u:-,1=4=.'.,-y!!, -4.ti::,_ All I f:. 'u:=--J,-,.......e:LIA .
: ,,,=,.'"4 01Eii .:'''1 :11:.: .. ]k'41q1..
i,i.i..ii..õ' t%10-;.i. .1!al.'''411 L'W , H Yitmera v. NY
,,.' 1lr1E.1%444ipir ' !WiF"' , iPrip,...W,! I ;oil o.,,, .-:-.4w:H.--: : =,4:,;iz.:f.u.,w - ::
.!.,:,:=:,..$ ,, :. ; :: - a:440. i : i : ;
.=<::i.,,,,,,, . ..?..6. g,Ct, 320 (mere) :
Nov 22, 1965 ....... .,, .= õ . . . >. ' 41.:247'i I : ::. I
n. . :%' :.:4. ' 4:. :i..:
..',4: n. A:4- Judgment 1 , 11:versed by 1 = ; , ).. "Tr;;re"77iliiierit ' :1Trie-0-17i, ;.17-iigrcer.;;' "'H Pi"-f;irlie-Tilcir-Ilr. II PL.pre-li iin-ne;:ri" '''''''' : - ..-.e.,.1' - ',. . l' = -16 N.Y.2d 614 (table) , 18 N.Y.2d 723 (table) :. 16 N.Y.2d 619 (table) ' ,1 18 N.Y.2d 752 (table) ,, tnrantid byt;. :.
."'' :='`µ I roue NY May 20, 1965 . NY SeP 22..1966 ......./'4,.. NY Nlay 20, 1965 .. '; =
.:::, =-. : e '..:.: . = 4E: ..._ L .
,,,L_.,;A: 't, :4.1õ. ::
1,,,.7.- .. , IN-iteMittu; a.ro'ende--"-d kryl õ.Remittur alne-'nded bi-1, , .,., Motion to arn_ano, ' -i =`= = : : ''..:1.;. :) = = fe., remittur I ,=,;;õ ' == k, ..,,..........õ. .0, . = = ! -4,1 remtttur , , . = : ,0 1 '.----,,.- i , d -7,-;,,%:=':.' . . =?:1. < c' .:;õ ' - ' : . : - ..?!..e.,, ......:-'7"17,,S7":-'7---7 . ,,,,, ,...
= '''''r t '',., ... -,.. = 'V-, : =
*Z '; ., . '4,, !%:. .. - =,:. 1.= = '..t; 5,y, El People v. Vionera ...1, H 12s..ople v. Vinnera : p.. People .. yitnx_om . := .i..., : . = pi. stai 1.T., 14 ii.r.2d 951 (table) .i! 14 ri.Y.2d 991 (table) .õ. t ..' 15 N.Y.2D 970 (mem) , .... : 4.74: . 7)'!. . 401 - ' NY Jul 10, 1964 A NY Oct 1: 19E4 '1 : NY
April, 1965 , , ..= = .. _ = : : A2, A
,A= . :=7 'e.r.=--1,. 4, ¨
'-. ---µ."-.-, ...r. - kZ' -''.
.4' = ' '4''.., ,1"..lotiorr arantaci'by r _. Motion grantedbyl'!4'= ..:',} , Judgment s.i.... õ , : = :i= ' .:
,.õ k-.. .:
::::,t : ==.':::
. : _ .i. : = - :::- = ' 7.=:--!' . IT % ---:-7-..--:---77 11,4 ic ,k=C ..a S
ffiemidt,Y '':...:';',== I. ,=k .= ' =
' . = =
' = 017 .t.N . ' 4glftl'ii ___________________________________________ i Slide 14 WeaTAT.,, Itwestiaw 1 Research Trail Westlaty -----Welcome j Find I heyCite I Directory I Table of Contents I KeySearch 1 More . . _ ....., =
fr.¨ 1 ' E illit4IRITRI:F
1 ..E " --- ' 7¨ : . IrElq=li ii - .
= qNB. I.I:i:!1:1:: = :
:: i= = ..... =
=:.;', ;,111111:=: ,.1!..== = = =
H :: = =
,i-*: '=== = = =='= ='Hi''':: =:'!' = : = , õõ,õ
.. .,-... =,,..... ; ::. . . .
= =
. .
;',,' = ' = .= =
k- ........... = .. = . = .:: ..,, = : ' !!illir, = . = - .- = ,' - .1':,,",'...õ.'='..',.., ,. .
;= ...!:,i:=!!i.=iii::!=!.:. = . = . = ..=!!,.
1 : ......... : .. = .. ! , !!= , . :: = .... =
= =
!.4 1 ....... ,, . = = . ,, ,,,,,,,,,,, :,, , .. .,,,,,: , . =. ..
= .= = = . .. = =
- = ' t , - = - - ' = .. , = .,t, , =
.. .frt.
_ ..,õ,,. . ".., .f. , = = d = =
,?:=,,,4 .. ":4` ___ t.k..=..=. ficii.i1;77,41.47:F*1"*"",,,01;11..crilTe=. ".11 ::
, 7 . .. . . .. , , = .
. .. ,

6..._ =
.., , .. , 1.?...-.:.
: . . '5"--=...= ' = i .t I
4 -;=',:=,..: .,, ,.
. S'.:-..,si I =
= = = - ,..
= V7; ' .r, :. .
,f,,-- -4.fr - .
= ,,4 ,..
= ' ' . ..
= . A'S ,....i.= .= =;..t, = ,. 1,71,-.i::....:c.,.J:iiii = . ii . , 7. ,.,-.... .. ,,, , , , .
..t ;.;
.. -. = = = = = ,.', :- . : - .- ' =
s''''''-`"-") "ht,?.2,:_w_n.li..211. rib e...., ,.F...iliial.= " :
..,...7!......., . :::,4, , .. m 2=11.t.:1.3pas=S = 111. MoliersOrmla 1 :::.
. Nfina w...........t.. in : .. ,., 4,.:_li., i i,'..g11 : . ., P.C.; .:3. Nn = . ' .1........
=?..,, L", = : if-. , µ1. =',A S.i: =.õ,,, = =

7==,,,:.; . . . = = = 1:' " =i ': . '''' = . , ''''''';' ' = ,''' 4 : = ' Ail .: = . ....t. . , , ' i.'i . . 4 ...., .A...ii-. = = .
4." , 'õ :,.....Vit ,= = '..f..14-, . . = ' k.,. .:-).' = .i. . I* 114.: = ?:Cli. .
, .
, . .
pp elosit..kowtra. . - = :
21t.;. :g*:,.1,',E116 i z5,2.1;16.
9*...,..4. ti.tigI =
, A vertically oriented thread-focused design ¨ with designated court level zones minimized procedural boxes :.:..
.4 ...
r0 Slide 15 ¨ ...................................................
* _________________ -vvEs7r Tech noickg CHALLENGE RESOLUTION STATUS
TECHNOLOGY Use GDI+ in .Net. This solution produces an RESOLVED
image that can be displayed in all browsers.
BUSINESS RULES Produced a "Rules document" that broke our RESOLVED
decisions down into short defined rules LOGIC Devised "grid" solution RESOLVED
BILLING/TRACKING Requirements clarified for Billing groups. No RESOLVED
charge for Graphical display, but we do track usage. Some embodiments may charge a per transactional access of the grid; others may add a lump sum option fee to flat-rate type accounts to make this feature avaiable PRINTING WSDL file recently completed; rest of In Progress development in progress Slide 16 , .
.. . , :' = 1101.'::.;.."-.. === i: ],. :!,:* ,,,,,r:i ..õ,õõ.
11-11-114C)1svel C:1#11N1 : . = , .
ii.ol, .:.,.i.;.,,W.:1.4! , - 71 - = -.=., ri-: .
uraph...1',:7-:, , ).,,,..,;õ-,.,:,: .,i,..... , il, = l' .1 i::::::' (!i!' l'illn.:.ig .: . 'L ' . - ' :'--, ' ' =
Hi,h=rili=jii.E:1'01,11:10-tAtlie.:7;di14.1.!
Early embodiment Emtgamwww.r.¨

r - ''''''' , i'.=
,, : ,,,,-. . = -:.:1!=,....'il!:,===
= : = = ' !: ' , ,1;:.:=== :- .''' ',.,':
'. ',,,,,:õ..,....= , Lars.ilarail 1 XML4.
= : : .:, , ,::.,..... .
. . : = 1 i ;.. .
.... ===:...1111=!!== . -.. ' ..:"!: l= =='= ..'. ..
= = :H::..1!!'=.E..:':=gi:::.' .. =:;: =': ...:';..i.:Y : .:
- .....".!!".Y:HE: =; .=,. : ......'. - ' :!.....:'!.;===' ' ' '' -aa;
I.: . . . . . = .. = = ==:
= . . = . = . ...:::. :. = = ::::
I ------"'li 1 = --'''';-Li'l''-q . ; := .' :: = Tift717f&I = = = - % ::::: I ''''' ' '' :- = ' U'l ' = = = . : L._.-'' ''::::77-74'= = 1.-11'5'47 Aic - .:== ! .= :1 ; :'..., . ... ' = ::
:,=1 ,' ..- , = - - '-1 [ .',,... :...'f.:'--141.- .1'-aii,.....ai,... i o9u,E,;s.7,--d, ..
Ln.a.'1,L,=7,:.. 1:1.411-f. -r ..,:¨. j .. ''''''--------''' ."=:.!.4117.---:.;,,,..-7---icAPV:410; . ..:. = 0A.:=11PlItielFtit7.-7=t-": ' = ' = ' 4 : 1,1.:: .....'-U.)-...-::.:.' __ ''''!..f.;1___= . I) .4õ..1.
liL,-_.,1 L ;'..'.!:::4.12'4,:i=-,.. = =.:' :,;.; ' .3..-,-,..,.-,.:.=:. rl'-'.., ...":',.,...;,... ..1',......117iri, !..'..;:'''.-...
,;.ii",=
= , 1.,,,..1 . 11,16......,31 = = .....P., , '1"..'1'47::'',. .i.' '-,.," - '44:.:!:;.,õ . = - i..., . '''' '2SiZM ,,... .: . = _.?:..,_..__ ,. ''. Mt ., , .s., _., . ' ==
11In-'1".-4". =!: .I.VrIlL
'7=1!3=154,''%1:i..,4.?-tiL ...." '4 =)=iii::, -,=';'..:
.;,4.1:Al 544:,.1,:;4\: .12114. .
-....i.,=ks : . ...iiii141,4õ.A,..:;.;, ,..- . ., :.4:-,.[C!ANTizo,"ctr,,ltiult:!:i111.::*11=I=41.-i=-. '1'.'-,--7.ffi,i;:b'.7'.
'Yi.,=!-.'ta!,Y;;;QT=rjbrjrt-t-64 ..,. .
. ... ....õ ................. . .4,-, = = = 1, Iiita ; = . '''.
, =,, . ., õ
..,= .... ...,..õ, = ,.....
. , ... , == ' :-!rt., . : . -p 011X-I
VAII2d12 õ , ' , jk. ' ''= 'LL .r4'='::- '.. = , ' '...- L., = ''''' :-1. _ 4.. L.,-. : = =: :J,:=- " i'.. = i?'''' = ' Slide 17 lri-itic:ir nil ,...c73=INJI 'i'"iii iiii0ii II: µ,...i.i ,-.4.ir...j.),;.,-;,.,,,-;,-., (r-).4-,;.)-=;.,',. ;.,=.;
VVIES11.
= i 'mil '1474' , ;: = = " = , : .
"P4.11;7!3ii =:=1: -..,. , 4 : :
ip. .
P''....; Jr, " , ., 1-4 _ . , =
' :1*.r.:1' Refined Embodiment . .
_ , . .
r (5 f61',11;;;,,,,, A,:i,iii.- :, . = = , ' ...i=r7ItVgPt=Wi'....."'' ' = ..!
amIng.1,a4galent 4KIP1,11, . .
=
Zuarrt7.1.rdpmnt Z,411,7132 , .1 , õ ,, =, ., = , .
[ " TL:, Ef.;:, ;:r; I ='====i;" f =
= .
. , LIN:,..A;51%.õ,... 1 .:=-=
, ==:, ii-õõ...,--.........,--: 1-7 ciii;,,,1;==:;:;as 1 4, 1-igliate..,.::ifi: i 1..rri to,!..,,..,:;,--= .: , . '. ----' '. ¨ - ' I¨ - ' -""'".."''-' ..` -I.
34 1===^4..;i:1;,,.:71:-..) , Ay.- .___._-.F i_.. ._4=!::;;,.
1 ,' : , ,::.
=:Ine?!...n..M4P',. ' 2:..!...2'.':.N.AZ ::.
I. ' h, I , ' 2'. , . ' , . : = ...
.....V . I -,, - I 1 : : : ,,,,,...J.: ;.':.:?,,, j= ¨ - s.
L = 4 ..: , ,. --,1- plig,-44 '114_ margt2;"":2 .;, : it, : = " : l. .
0., = :: . IN ',=,/
I.. _ .. -..-,...... ...X.
! ":' 'µ 4 . : ,,,, ', '.1' ..116% .1' . =''''' :==¶..
- ' " ' ' = : . ' = 4 - ! I- .N.f..., !',:'''= : -1: ..7.?!.-1 1.
- I5;
,,,-cie" . '' .'":',.,[777 ziZ- r.= = = - = - . - = - - , ,:.- ,..C....-3": :,-,-,k, -'.,, = = ,w1 :t.: .,..?:.-ip , .i.:
",kv= ',1`.,,n.,4 i=-; ' ''''', ' 4,='=4:, L , '..: ' ..:I., Ef'µi.lz . V:I' :'' r-,,,,n1,,tv:-.1, :.:...,..,õ: .. -,.::
,..,,,1!.4,. ..,,,-,,:, Ir. ,--' =,4-.., '1,1.=".7:i-.47: '21 !4! ti,;., .:i..i.',...,,,'..!..4:!2'..,-., ...N.:4! I . .. , : -.rõ:. .... _Ai,. 0?',.....,=,..,:,1.i.:! '.!'''''''''.'''''':'=''r-- .
44,c1" .,õ,..-.. ,4t=rl=ii, ,-.''';::ii.= - - :, ,f.;4.1:====,i113=:.-,...,..,..,(. .A,:i', -" .-.i',====!..' :.;
j!--''''*=,.::=141AE=rr41-;===''''''"====.,4:;: Ti,'*:'T'Atil r,4I!A=142b.:,:iNg.Witi:140 ,.', ...:':i.- ..,:',:k,.; i'-- --::.*:Ailiggiteõ:4-gri*,14.:=1,4. .z, : -,v,*f.tg.L.i1,,4:.,Atttif;,41 - t,,, .-: = '4. ilia, 11. : 'E ..?-if'g= -.:1',. 0- v;t1.,i13..2d.1:2t1_,,....
',42:::atalkilzwil ih:37.4.1.+,-,1161.,---1,..ih*-4:41,:....2µ.11.4:1 ''.' ',t ,.1.4t:-.:V:4;241riimisr,--,ilif - ..

Slide 18 , , ,,:.,....i ¨ ar, .,1r1 .. -. I-m , ..... .. . - , = . '...= - i , , 1,..1; I, ri 11; 4,-, Architecture oglri--,,..
04.44434 .. .r'l 4 I
:WE d.2, 'Ali -=-=fi- , . rq' i - :1-''',;iii;:i' MIIIMIIIIIIIIIIIIMIIIIIIIIIIII
- ¨
Westlaw Web Servers Reusable Ul Framework Client Desktop control that renders an image Fax Stand Alone rinte -, 4 - , HTML Page with Image and Image AP Ul and Image map. Takes XML _ -- - L,., W... ,,,, , , / and processes it into an object -t- :_--__--model for rendenng using N
µ' I
KeyCite COO get XML COI+ In .NET. It win break A
6 - A from Westlaw Server, large images up into many ¨ R El I stream image(s) to Image CDO's small ones for printing tI= i Broker and send image ; '. CIkeys with print request ! I
i c4 ,4giff ' ____ 0 3 A
, 4 :::0 ...--- --...
,.... _______________________________________ ...0 el,.
-5,-, E , ¨
o 4='% -1-4, 0 11. ]
Attached Printer ,=)411 t. Archive µ - I
Af.....õ....õõrlY Database 1 a Archive INF Servic -' -....... _________________________________ , --Insert and retrieve RI
image IMage INF Servic -= 3 image and metadata %
l 2-' Calls Archive to get Image fa ' printwestlaw.co 1 Existing print/delivery µ 1 . wog 1 servers will pull /5)eirje image(s) from the -'s tee I I
- TO ,Westlaw Server µ
image broker and r p'ell ge() s Image Broke 1 m a Rg(o eet sr i r fver d T leFI rv e , y deliver it for OLD, very = Image Broker will call Image INF
Westlaw Server will build an XML
representation of direct history with = .
Email (attached or - a, Service to get image(s) with key - - r existing KC request. It will also process inline) in the specified -. , . and convert to TIFF
if needed, print and delivery for images like it does format (word, pdf "---.., today (STP and FAX) with changes in the etc...) or ATP .., --. GP for KeyCite to include image key(s) =-...õ. , = ..-====.,...,... =
f ,......
....
-__. .....-OPD Recor = -..-Y
The OPD record could have 1 ton , ,--- ------, image keys stored in the record -e,- - OPD =-....._ ,......"
- ---because of printing large images will ADABAS Case Control _ be broken into many small ones.
ADABAS or =.._ ..., Galaxy DB/2 ________________________________________________________________________ _.., Red boxes represent systems that required changes ,...,_ , "
.1(4 WesttaW Server Enhan Luavi = KeyCite engines to build and return xml representation of direct history chain(s) = Metadata enhancements to meet new display requirements = Printing via OPD of images created by the client Ul HatVISON
19 wts r Slide 20 4 tw, 1 1 'Kef#' == "
, , i+
Artit;441 .....fti ' Textual KeyCytelits :i, ,, ' .,',tL'y.
, .. . arsentammansumganimanink History Documents in history (showing 4 documents) Direct History P= 1:. Goldberg v. Rostker, 509 F.Supp. 506 (E.D.Pa. Jut 18, 1980) (NO. CIV.
71-1460) 1 Stay Granted by 0 2 KeyCited Citation:
Rostker v. Goldberg, .8 U.S. 1266, 101 S.Ct. 1,6S L.Ed.2d /098 (U.S.Ra. Jul 1.4, 1980) (IVO. A-7 ) 1 ,IND Probable Junsactio ote, by =
H a Rostker v. Goldberg, 449 U.S. .09, 101 S.Ct. 563, 66 L.Ed.2d 467 (11.5.98.
Dec 01, 1980) (NO. 80-2 1;
AND Decision Reversed by r> a Rostker v. Goldberg, 453 U.S. 5 , 0t. 2646, 69 L.Ed.2d 478 (0.S.Pa. Jun 25, 1981) (NO. 80-251) 1 How the documents are related j THONMON
* ________________________________________________________________ nw Slide 21 . =
:
. =
== = . =
XML representation of h Documents in history ocurent id,s1980140075> ion>101 S.CL 1</Citetion><DecidedDate>1980-07-19</DecidedDete><IsOnWeellow>lme<ilsOnWestlaw>
=unedIctionlns ey>U.S.Pa.</JurisdictIonDispley><FullTitle>Rostker V.
Goldberg</FullTitle><F1ag>b4ue</Fleg>
=
<IsKeyCitedByUser>true</IsKeyatedByUser><IsProcedurelMotion>falseglsProceduralM
ollon><IsFederalJurisdictIon>felseqlsFederelJurisdiction>
= < >
A</SteteAbbroviation><CourtOispleyLevel>USSupremeCourt</CourtDisplayLevel><HasC
ounDocs>felse<A-lasCourtDocs></Document>
ocumentid,s1981112321=>< tion>509 F.Supp. 586</Citation><DecidedDate>1980-07-18</DecidedDete><IsOnWestlaw>true<AsOnWesilew>
= <JurisdictionDisplay>E.D.Pa.</JunsdictionDispley><FullTillesGoldberg v.
Rostker</Furrille><Fleg>red<IFIeg><IsKeyCitedByllser>felse<AsKeyCltedEtyUser>
=
<IsProcedurelMotion>telse<ilsFroceduralMotron><IsFederaLlunsdiction>felse</IsFo dereLturisdiction><StateAbbreviation>PA</SteteAbbreviation>
= ourlDispleyL-ev Court</CourlDtsplayLevel><NasCourtOccs>telse<MesCourtDocs></Docurnent>
<Dcunont d,s1981127851>< tion>101 S.CL 2646</Citellon><DecidedDele>1981-06-25</DecidedDate><IsOnWestlaw>ltue<AsOnWestlaW>
= <JurisdictionDisplay>U.S.Pe.</JunsdictionDispley><FullTille>Rostker v.
Goldberg</FullTille><Reo>yellowqmg>
=
<IsKeyCitedByUser>false</IsKeyCitedByUserxIsProceduralMotion>felse<asProcedurel MotionxIsFederalJurisdiction>fdse</IsFedereLludsdiction>
=
eteAbbroviatioateAbbreviation><CourlDisplayLevel>OSSupremeCourt</CourtDispleyLe vel><HesCourlDocs>true<frlasCourtDocs></Document>
<Do¨ ct¨ffStunentid="s1981200130"><tion>101 S.CL
563</Citetion><DecIdedDete>1980-12-01</DecidedDate><IsOnWestlaw>true</lsOnWesUew>
='<tir<itrtgti:201:rY1ljeia.l:g1,14r4lniv the documents are related ionTI:FlUdegti;diction>feJse<IsFederalJurisdiction>
= _______________________________________ <SteteAbbreviatIon>PA</SteleAbbrevi t3isplayLevel><HesCourlDocssfalse</HesCourtDocs>
</Document>
'Stiadaiwahip.....esonIKL,manTLLsdatkLaiontimmpjr:Ull'fa"; = <
reatmentPassiveVoice>Stey Granted by</TreatmentPassiveVolc0>
=
V=It4tcAveVoiTe>Granti=v;f4riaestme:RtActivtg=tertrnaelkpatioergteg:Lateraltiti nation>
kftelationshio><Patent id,s1981112321"/><Child td,s19811278,51"/;<ireatmentPessIveVoice>Decision Reversed by<fTreatmentPassiveVoice>
= <TrestmentActiveVoice>Reversing Decision<areatmentitctiveVoicexIsLateralLIOgetion>talse</IsLaterelLitigation>
=
<rtontinnthipType,dirF,t<ARAminnµhirryp.<1qPpmqndstnlqa,psRemand></Relationship >
1-Rel" 137,4tirrearnTnilt,td="if/leVaolICer'arall ttsilorel>21=7;g2greTt!rZgg=t>itXZtliZtel\ LiolecV"n Noted =
<IslaterelLitigation>telse</IsLeteralLitigetion><RelalionshipType>direct</Relal loruhipTypexIsRomend>false<AsRemand></Reletionship>
= </KeyCiteHistory>
THOWMON

Slide 22 <
Metadata en1. I
= Assign an attribute to each court (approx. 5300) to represent court zone:
¨ U.S. Supreme Court ¨ State High Court ¨ Intermediate Court ¨ Trial Court = Assign new attributes to each treatment phrase:
¨ Substantive Weight = Procedural Motion = Full case ¨ Lateral Litigation 'THOMSON

Slide 23 :ipt illiti.: 11..A.:.,!, .
hA4/wv17.,.:111i1,411.11 iqickl*..
.
.
Metadat,a applicationfhl,,,:-.
, ,,,,_:=,,, z_.:õ.,,,õõ4õ,,õ,,,,,,õ...,:.,..õ,õõ:õ,,,õõ,,,õõõ,,,...:,,,,,,,,,, , U.S. Supreme Court Zone State High Court Zone Intermediate Court Zone Trial Court Zone ,-- -,1 W ....w , . 41=4 'T
. TAVIr* . . . i.
ii -011Afestlavi 1 Rev_arch Trail i Help (0, ' $i ..
/
1 , Westin"
, õ Welcome I Find I Kev I tie , 13frectory 1I,Ii.
oi Contents I Key --nreh 1.More _ ____ _ .
_ , _ :: _ ......=,.:---7.=7-,..z7.--, 7,7..;:=,.....:¨.1 Back to Full History (Text) I Show Negativ= History I View all Citing Refs I M
+inter onth KeyCite Alert Direct History for Boise Cascade Co .. v. Board of Forestry, 63 P.3. 598 (Feb 12, 2003) , _______________________________________________________________________________ ___ - -_ k.
õ
.1 ui 4i..._..._¨ = ____,.., , ¨ . .
.. "..-,....,...,f1.1 I," ..:.:1 -,-,, .., r-,,,:,-,:...,,:z, .., ,t Fe41461:¨ . k ..,... . I. ...... , õ, , ,, -,...,,,:.,:,,......, ... , , ;..
.:. ,,.,..,_..õ.,.:-.,.:-.,L,i.õ.. 4.. `i..õ:=:., , , Z; ,,,,, ==.:_f_,,',:¨....--====,. .
s 1 i. ,, .. = ; ... ..... , ,,, , I . . . . ,.. ;. = .. ' : ..
r .
= 1,.-1:i- TIA
II " ::fli'll = = = . = =,..444....alt ' - - ..r.,A'= = --.4-1:-!g õ .
¨
- '......' i I:
......i.z... ... ... =. . - .:=..-:._ ..............
...
,P= ,..r.;-!!?W12'7,.'0 e J ..-r(*..i= ''..r,'----- . ¨
I 3kil . !.L.-1.! P.. '... 0 ..:S.KI:..... l'e , ...elthil.s.__Lij...1...:;=;:4.1f1'..:k.........1...,...t:
..?..;.:V.4.,:ii'au...-...... : ., ... ...-.:-..=:1,:=:...... ..;.-.......,- ..::..i....ina'f .:,...r..L.!. :.,.'_ .=-.44..;.iikthil.-, 70,' Full Case Lateral Litigation Procedural Motion _ Slide 24 '9n,14 I. _________________ -1111'4:
= ..4 PrantenharT{jt = New print options ¨ Graphical History ¨ Graphical History combined with Textual Citing References = Modify workflow to build a print result from client created image(s) ¨ Images stored and retrieved via the Archive service ¨ Image key(s) passed to Westlaw server on print request = Billing changes to allow separate charges for printing graphical results THONtSCANI

wssr Slide 25 . .
= = .-!!! =
.,,,, = .
-.:=!::, .
= ! != IffiM
. ................................ -Exemplary rule set for building basic diagrams.

Slide 26 ' õHilt =".4k''' Need a set of rules for building basic diagrams.
qncil Parents should be centered below their children Slide 27 - = -s.
= /4,5:=-,.
"
Need a set of rules for building basic diagrams.
Parents should be centered below their children (When possible) Slide 28 Need a set of rules for building basic diagrams.

t rzi t Children should be arranged in date order (left to right, for example) 28 w888 Slide 29 ;= r' Jill' ,,,%..-- ,,:6 Need a set of rules for building basic diagrams.
SU, reme Court r Trial Co-U1 3 -i ,=-::',.k,,-'!' 44-r1 Li:','J
Boxes must be in the correct court level . --, Slide 30 10414*-Y7 Let's examine the "Miranda Rights" case in detail.
HOMSON

Slide 31 I
;t11 irl 11,14.1 .7,17TELMEMMENME
Cases = i USSupremeCourt (Westover v.
U.S.) Nc = a StateHighCourt (People v.
Vignera) Jul 10, 1964 = j USSupremeCourt (Miranda v. Arizona) = b StateHighCourt (People v.
Vignera) Oct 01, 1964 = K StateHighCourt (People v. Vignera) Api = C IntermediateCourt (People v. Vignera) May 04, 1964 = L StateHighCourt (People v. Vignera) Ma!
= D StateHighCourt (People v.
Vignera) May 20, 1965 = mi96U5SSupremeCourt (Vignera v. New Yor = E IntermediateCourt (Westover v. U.S.) Mar 11, 1965 = N StateHighCourt (People v. Vignera) Sel = F StateHighCourt (People v. Stewart) Mar 25, 1965 = 0 USSupremeCourt (Miranda v. Arizona) = G StateHighCourt (State v.
Miranda) Apr 22, 1965 1966 = h USSupremeCourt (California v.
Stewart) Dec 06, = p USSupremeCourt (California v. Stewart = i USSupremeCourt (Westover v.
U.S.) Nov 22, 1965 = Q StateHighCourt (People v. Vignera) Se Slide 32 r t;
Relationships = G -> 0 = C -> a = K -> D
= C -> b = K -> L
= C -> K = K -> m = E -> i = K -> N
= E ->
= K -> 0 = F -> h = K ->
= F -> 0 = 0-> p = G -> j TllOflflSON

Slide 33 ______________________________ 1-7-7 7 7-777-- 'we 0:.4777-7-Start off with the grid ..:;. . .
=,',.:JM
I I 1 1 . I ' 1 1 l . i I
i = 1 . i 1 .."......õ.1.- liiI ":õ..:.,17t t7i....7õ1IL, .4'. :4i ,414: .4r 1t 4:t1" .i., 11'..., ..
, 4i' .. -.... 7..4"-=..-.;i1 ni:::' " ) ', = . = .:.04 .11 = === _ ..

' =,-,.= .. ...,{1.',.,t I, =
1. = := = .1 ..A .,,, ,L,,, , - .411.....44..., - - - :...44.-= '...4...1-= i..,_+..-4....4¨ .=.,;4...,-...4 I
1 1 I 1 1 1 1 1 i 1 1 1 1 1 , Slide 34 r...... . .. . ....õ .
. = ,.,=,.v,.,.-.,.:;.:&..., -,.:.. .
=
..== . ;14,::.... õ,=== .-.;=:. = . :. , = õ.....õ,...,. =
. Put down P.(8=0prerii:=i =
.... 1.1 .
: .--,114121MMIIIESEENENENOWEININIM
A __1_-_/____i____i_____L_I
74 '7-7-7171 - -17- I-- = ''''. :---1, 'i4i ,---.4-4,,.:44,,i.'"'..= '.;:12.:-.: i-44. ..'#;,ir.:, ',Tht.:1144.4-t-4,.4:4,,,k....4 .41 , ,..',..; t,,T =iõ' ', ..,. , 1 ?=^",%,,,.._ ' -.:. ' J.
= ,, f .i.o.,., m. =-t, _,,,_..A:. -;,..1..1.-7.1-- :. ,...; = -.:
: µ. _.,. . ...,- , I
,71,777:õ:]1111: õõqik,',," ..: !TT rriDi-: r'IZ, 7.,:,..',k l'.-,0:;õ 41477-'=!.A0F, :r-,..-:i- 7'....7 "- .4.,...i4v..1!.,4"4- ,,-,751-6.,:,-. 4,7., 4.0 .Ø-014A..i..õ.., - ...:!4:3-.:,-7 -.-t- .ti..04 , -Mjte:;,,r, 4 at-__1 - t- _____ _ 1- ,_rõ....1....1.-1,-.1 7, -1 ______ .-.1...,__t 11111111- 11- 11111i1 -----I----1-- -1 ---71 1-- r----r----r---i- --f - i----i- --I---1 -- 1 r----;
, :::1111111111111 , Ill'''1111'1 1111 111111:11111 1111 -------------------------------------------------- 1111111111 ,õ ' ,õõ1 , .
_____4____i____i____1 ___________ ,__ _i______r_ r_ __I. ___t____i_ __1____i___ 1 ___i__ Slide 35 Put down P (Supreme !=:*...,Q;IE!
I I! 1 1 I i: Ili 1111 1 1 ________________________________________________________ A__i_l_¨_i,._,_,,__ T_Iii___,....._"____t____õ.....r.....i_t_f_t_t õ 7,77.71õ.............õ ,õi7õ,,t,.......i,"....17.17_17,77,,..71õ.1.____, I
I:
7 if7.u ! .2 .::......i.....,......
4,4.11. !

1 1 __ i 1 1 1 1 1 1 1 1 1 1 1 i 1 i i____]____]____i -------------------------------- ,r_ 4._ _i____F__ 4_ 1 ___f_ __i_ _i____1 1 _1H som, 1111111111111, Slide 36 ypir !sit:i - .: -,z = -iq.p- !, : Put down 0 (Sup .7. ::'''= ' 1 111,:4P - '','" .
' ' 0 has a Ohild: P = '' ::: :: , -Ei 41,.' , ;=j,,;:ji,i4UffilinnEMMINMEMIAT=
, p i i 1 41 i -1' [ 111111 1 I f _ - =

.-, -VA ;-,,; 1 I .:
it.174-1-4,711",-17"' . .t.-= : -17-77--'1::.::::' 77 17+-i , ..
.:-::8=:-.4.;:r; . f- .:: '' I'' :i.:-.. .' ; 1 '22' 4'f?.--::.; j: ik 1! 4: 7111a11. '114141:411:11f LL'IKUJillitiif tt*Itte .fr.;:41:
.....t ----i...--1----1----1 --------------------------------- -1-- + .-1-- 1 ---1 I- :

1111111111111111:
11111!111111 ' " '1'111111111jI
U111111 1111111 Esi 1 =

Slide 37 ::: = = :6 :," - 7-WI!! ' - ' ! - ' =
Put down 0 (Supreme Cob 0:s a child: P =. .,-ic.,:ii 0:1'! .....41.enH.
______________ - ,,,,,,,,,,.,;:':.kfigit 1 - : 4 1 i :*1-7-47."11r"7-.'1.,. --1-."---Ir' 1"----"1777: 77---17-+
- = ' ....ii , r'. : ' 1! l' . = t .-1,_ ,..i.
¨yr¨tt¨r.-=.--;:,...fr.:71..E.77.17.,,,t+, .. 7:77t777.7.:: .:-97¨ .. , :, t..:ti.. =,,..4ii, !=!'i 1,,..,'..1.-_.-,õL.V--..:õ,42iLW:,4L4L.,1 ..f, 4 "ii"Illi11,111;

-1--;--; ----- ; ---T----1----; --"1----1¨"----1"---1----1---1 ----------1111111111i111111 _J____J____J___ J -------------------- L____L____L____L____õ____i _L1111111111111, +-Slide 38 === - == ==== = = . ., ... , ,Elt.,c7---,,(.,=-== ,..,it.= - Ir. - =
= .= .
= ., .
= '.....,.:1N:-.f' . ,, = =
Draw the arrow .betwc=,1 :i f' ,":..:. -.- = , = .
-.;111.qiffdaMitgaMMIENNOMMINII
i .3 ,. i'-.1.1 L 1 ? , . , = , .
1 - 1 t= - 4 ='' ; ; i ' ' , i i - 1 1 L__,L.L.4._ ----1 i. 1 i I. 1.. i, ..1 7.-- ¨4--, 1-I . ; .''..) : --,1 , . . .1 , ,-, = . .., . c,:. , I . . ': - . . _ . p_. = 9 1 : ________________ . -I- =44--,--.:=-r. 1 : . '.= - = .':', ,...7?-- 1-- - =--rn-:::-. = ',:t4 .1=Lt., : ..:::::.. - -., . ., = - ... ,.
:), '= ,.-:::li =I: ,-. !" ,...--,;:,?12,;:=7.-',i. = . -1 'a -:-.:i:.'" : :',:,,: = t I
j V=.....1 If:-,,c-1,:-:.,:iNm.-4? gi, .r.Hift.:;:,:. ov .,,,,r4.. 4..õ, '= 14:0,1?;
'zr. ii:: '.--1f4- 3tA6:7-W.'"-- 7;7' t ly'lliF:e4:.. :!:.1..;; .1!1,....t.f.: -'... ,t,ii¨p,,:;t ..i.::'= ,:,,,.
lir,.! L-.4-ir', = 4.1ril 2 _ t?

I 1i 11111 ; ;1i 11 1i 1 I
11111111111 11)1 ----------------------------------------Slide 39 AiEIRH ............................................

H
Put down ( .
I- Iiiii111111 il'Iliji' A. ,I.Iiillt,i I I l' I 1r 11,1 , I
! I
A i ......- . -Tt---÷-...,---r----1-"-:!-4-4-74.7.--v=^"i:"="7+.4"it-rt.

MT,t 0-rrrT"*.: 1,=%:. 7777-7171. 7:77=7'r E, ;'""*:,. "
p.r:P=1! r, ". , ______________________________ ,I, ::-1-.
ii: !='.1 I tir =f: 1" ,''':' . 11...
-r ________________________________ , 1 ..........j..: ' :'-...: N.. '.. . 1, = AE,-...:4...2+1,4,.6i.,,.., :=...-piz.:4--liz ; . , 1: -=- .i.J.4.

111111111:1111111 i__ ____+_ Slide 40 Put down J (Suritc;
.1tia __________________________________________________________ P - .1 it ----------------------------------- L____L.
.....4_,..k...4........i.........4,......+4.---L-4 I t P i 1 r 1 i.= 1 1 1 I
, t. -I- I. I
.õ.....i....4......õ...L___ L t.,.......i... L.__ _i_ 1.......J.,..2....,4.L4 ----H1-41.1-- i ------------------------------------------ -)1H--- --/' 71t04i,-t .7,...r,. i.4.4l,i 1: -t---7I ________________________________________ "-"1t4 +I-.
A
111111)111111 !iii,111111111111 1111:11111111111 ,,,,m11111,..L.,0.
,, 111111111111vt"' , Slide 41 Put down / (Supreme COO
p ,,Ililiil, 11 I j____I__I_II t__i il 1.t1., 11-1---1 I 1 1 , i-4 111111 i J
- - --1--- -11 --- t - - - -1- ' - - -- - 1 -7 -'--1---1 --- --- ------------------------------------------______________________________________________________ ---it_ 0 H 1 :
......................... ' .:=:...,;::4t,1:Ii-.'rr. g.;--!,+tht.,-,4;-,4k4r-!id, õ4.,,,11:-. . ,?,.-f ! ,,A;':::: .14ii: ,i,! ' `i''...... fielmpt:',fr.=,',.:11,11...: i. i I
.. lilli i 1 1 t 1 i 'It t!'t 111,111111i t t !Intl)), 1 III! t I
¨_l____1_¨_-4_ __I_ --.1 -__1_ '..d'm..
-----4----111111111111114Z"
' Slide 42 . ... ...,_ : . õ: . , ,iqi-.-,NK'.ii'. l':=: : .1.:7 ' ' -' . S '''' - ' ;,i .:110! : ,fr.. ' =
Put down Ai(Suprc,-i= :I-:
'-, 'P-1 11 l'i 1'111111 '1,iii 7-1----1----t¨t----71¨r"tr¨H-1.----f¨'17HT--1-----'-------1 . -...----1- I--1----1---M-, -----I----J ----- ,--h 0, H ,J I, i.= . : -+,---'-µ""+r¨'r-------f-r4b7,-1------7-1---------....-----t 't, , 1 il :51 t' t r ''-'1 A
nr:.:Mi: ,, 4775,711iiiritt?, V:47, 7'Onttiettigitttlftitrrtit*e7:77.,,,, ,,,,-'''''tt i 1 I i i 1 1 1 1 i 1 1 if 1!
1 i 1 : i I 1 i 1!1(11111 , i,.. 1 1 1 I 1 ..,¨A, ________________________________________________ 111111111111111ts'l Slide 43 , We are finished with th,--.:;.,, i I =i, ,:-õ,.,,,,õ:..r.Tr. =
: .
,f _________ iiiii P 1 I 1 [ I 1 ' L-1-2.1 -1 --11-1---i____i__-1 ___ 1_1, i"---1----1 -7-1-7t7 -i . =
,1 ' 11 A L 1 ..[Ii OH JI i m . ,L__. = .,' 1.' 1- 1 1 --....,,..i..,,-.... , ,t.,.....:õ...,,.,,...,........,......4....õ-.4 ,:,,,,,,,44.47r .... ..: r4,-;.¨p-,-,..-T--nri .-..,.... -,,,,,7-7 ,J.--t- .
' ....,.............t.r=-=-=,.., 5 = 4,1 ' 11:. : .=' . .;Z]:.: ; ,.,. '4 , : 1._, li I i= 4 r. , , . I ...

"40.,^^s..L
1111 t1111111111vt-*1 Slide 44 : ::;"=:A.i.t.,7 Put down Q, N, L;
Court). None of Itii,,,-,F7 I L i' 1 1 = 1_ , i: i . I i , 1 1 1 ; 1 I -M i 1 ...4i...;_...1...::-.-1---= . = - =
----:-, ' 1¨ , '''',77------1,---7-7.--, --- 5:-.' u.d.1" = , :,.,t r .7,F = = ,,-- A-- 71-(.....õ." ; . 1 ; =,,,,. i µ,., r, :t .2 L. el= . kk , 1,..- .'. õ, , 4.. ..1 - i----1 ---1.----71" .,.:. Trt-,, '11:1'.k.,?.--1 r7i.T.-.'77.7.,,,--;nsfr,-eg.,,,:l. 7;it =:v.,,.:17,--, :: . .:,71,:iiiii.i,:-.417171,, -o- ....,4.:si,,,;..; .,.-:õ..,,rn i !,-.!,-!1. 711:411-Ftro:- --:':* -z-'1,k4040:- At:u- !,'..?* i.I.4. pi.,s, Z,.
N.- :It.i=q11:-.7e 1, 'q. :f. :
-t1111-11 '11111' 11111111i11:1111 111111111111111-tcsTi _ Slide 45 ,..opheilt -, , og ____________ 777,,ki Put down Q, N, L, andil Ir:il Court),F, None of these, F: " -7, 1 1 ' 1 µ77,1r:L., s ..., Plijilliti 1 111,11[
I' t III 1 f1111111 OHJIM -1-11 Iiii _CINILD I¨f ¨¨ 4 ., -,.4.-----:¨.4-1, --4.-:¨

.......,...1_..4 ______ k..._...:,..,,4õ.,..1 ....L.,_,,) it,s. !
4 - : . _ ' Aft4GinitP14 ;!ij.V11!11# ;!.. :T1 -'t '1411 :I ; ,Iti :gi! r 7171 :.:: ' L.:rjt ... ' .,:::4-:4iLL.4-4-:-.4L-.2.4...,14u-ik,201-..." ':,i:j= j: :42: :
,2 i 111 1 I 1 1 i 1 1 I 1 i i Ii11111111i 1 i i iil ------ ----------------- L_ .1._ _L._ __L__ _t____I__ _1_ __1___ 1.____i_j 11111:111'1111111 111111:1111111J-Jm,..1 Slide 46 , :c`viiwr' , 11r 7 We want to put dow , '.. -0,,, --1,..v:
:::.::,t.: r :, ' G has two children : I
A..--;..g,Enausimemat ----------------------------- h---7-1---4---,; -t----1, .,11:1 11 _it,4____1õ.44_4____4 __,,,..

OHJIM I I I 1 1 I l i 1 1 ' ..¨l--- 4-4¨'1--:44,4 .i , : --I-. .,k Q NL:DI. . , , = ' =Fc . i , , . . , ,,.,. _ == .,\,. , ______________________ L......1 i ,:faltr:: . i :,?.,.4y I ..,t; , = iv,...,:4:i q.q. AO !1,:: .,: M r 41,!- i )1,, Ili; ::..:1-Etmv ,. 4 " == ...:õ..,::,¨ õ,...õ.õ:õ....,õ : _== , , ,",=:+õ : ,..." ...,..:.
11'11111111111111 11111111111i11111 11111111:11111111 11111111111111I,,,,L,,,,I
o11111111111111+'.1 Slide 47 , ..1,,,,,,,,:,. ,.õØ
J is earlier in: time (!!. ' -',:i - - ¨7;:vs......::.1) !itl will be on th= left MovelVii, ¨p-11111111,11,11:111 ____________________ l----1----1----4----1----4-----F---H-----t---f----1--- I
i -I -- --- -1-----1-it 1 1 1 I 11_1 I I ii I:i I
0 H J I Mke'-''v.-----''+-,----r---------"-----1----t-t----t 4, Jr _..I.r-_ .:....,.4.....,..:-........,.õ _.......,......4,'õ4 'C). N L. D'14,õ1... -2. .._ =
.r,,. ,..õ,....= =.... .= ,...,,,:.. ==,,=-=-.
1. = -4''-'71 't Iiiiiii111.11111 ----1----1------1-----1-----H¨F----L---1-----f----f----i-----1-----1----1----1 H.---11,11:III:II:III
___i_____F____,_ __F ___F_ __i_ __1_ ___i_ ___I -----------;;;1111111_, , sciN

1 1 vt¨

, , Slide 48 J is earlier in time (telt':
will be o 1 - - 44., . , -i..4,;,..Awastimmixiszywatit i , P. j'..j = = L ... , , = = , , . , :, - =..-..1..... ......,..,,, .,......
¨.1____i_T__õ,...,...1..44..... ........_;
fi..1....144.-t1ILIt!=.1,.i=
i . ' J ....-.õ..4_,t,4___,..1,....4.....i........J....... ...._t_,..4 OH : 1 M ,.1 '' 1 -: .
Ci= N L
C) .. ' ; ..,÷ rf"7:- l, 7776"
:, -`- ' '' l': ''': ''' i .., , t Ø....,:.,f,iti.g.,, .2....,. -.,,,.,,,,,,i,,, 4 ,:t, ..,,,a.p.4-14,4'.%.4 .I.FT,ii.:....0 1õ4,,,=

' 1 1 1 1 1 1 1 1 1 , IIIII
I I, Pill) I IIIIIIIII

P P ' ' '11 1111111111 1 1 1 j 1 ¨111111 7.140fM,.N1, --- s 11..,¨ ----------------t-1--.1 1 1 r____r ___r___1 1 1 1 _t____i___I_ _1,__ _.1, __ 1 _i___ __ I

Slide 49 i.olarezwr ___________ Since there..ar.c..A.,w.õj: o f-!,,i = Y--, 1:,, s'..i1:: Amoopom ,r; = ru i-,: r - :-gap betvvem,... f,; t.f/ 11,.*1 ut,,, i , ,:::::',kiril. , 'i'i I iiiiiii P jilit 1_1___I__I____ii A Ilirh 1,' 1 I 11 1 1 1 i ________________ 1 1 1 Imi j,_1_...._t_l________H___ _.,..t1-i...¨t.
0 H 1 1 = . 1 'H---i-4.---,7,-,., -- ---+---i-a N.L D
: ' = = ,! "7 .01 7-77:7777. = .:12.711::-....,::. 3,- - .4. 0 gigiFi ilMrf...!:. - 44312 7 1 _Irml 1 illiliillililil Ii1111 I 1 i i 1 1 i 1 i i 1¨ "

1 1 sii¨

Slide 50 Since there are two It -, , , .,,- 1..:.) ;:ge:, ,i,--0,.c=:', .:::µ:, A , -, . gap between them !..,3,MEIJIBUNIMIEWMIONIENNI
I i P
71"--171, ¨1 _ ", ------ 1 t r--i------7---, .,... f' i,---i------1 , H IMJ 0 i i ! . 4 i , 4-'--ONLD L_:.4,.._, I
.,.,r., . ¨ . = .. -,-.1 . -..- '.,-...,,,µ: . : ::: I
I, 1 .,,.. -, : ! .[ ;..44,..
,..,,,,.-. '-ii I. !:s.i.., , :::.u....: ... - ;=:-.. ,.....: ,.-.. ..
= ', ,_ 4 ' ;:iij.: ..d =%-;$ fril.:4W14:,'I'.1; ;.P.I' ,':,li : t.' :'.='.70':ii:' !..
1:2-!` :"...1.:':, ..'.-V .,1' i li ii I III 1111111 1 ----1-- -1----1----1 r- -r----r----r------------!ill!!! II li IIli II

-------------------------------------------------------- 't-' ---ii----1-4-1 1----+'---1-----1--- -F¨j----1- ¨1-----1 --1-1-1"7""!
=
-Slide 51 =
AO x 41!:ri: : - 717.1757741 mr.91. ;;=
1 E::1 ;,?1,::õZi.:: ,s-: : = w The children ar'410ce.:,..: ,,,F,-,.,..,,,,,,i,...:=,)..3:
,,Nr:.ot.==,=<:: ' õ.õ H,: = .=:= . = - : = .. :
: ;i,=.;:z.:".FE.Ii.:,- -- .
atimasow _____________________________________________________ : , I
.L LL -i-- ---r----"r "" i i " -iii P 111,1$, 1 11111 i H 1 M J -10 ----i:--17.
1_17,1 1 '-i ---- ----rv-rr---=== --t-Tt-'7",1¨"f 1-Q. 'N' L 'D
.-4; .I. ::µ...:..i....:,,. = ,,,, = l'" -.: _ ., __,...= : : .' . ,t, A = - -I,. ,., :,.:_j_-...: , , -.:,i' .
t 4e4õi_ ;Mr.1.!:- J1. .., . :'.'..,õ. !t1.4; ,.... ,..,;õ Al Fr.,0 ':-14- '..i; fl.W=I'-'1.b 111 .g.-= !t': is , .t.' = A
da1/41.L.s._i:i.:.:::::4.,..2 = ¨ --rJJ-w.:.--- ----= -- :,...¨ ..,.:_-= ,:: .;:=,..34...e..-. ,s- r, s, - ..',.,=:-:---.4., 1 1 1 1 1 1 1 1 i i I

,____-____¨__L__-,----1----L----1-----L----1.----1----i---1-----1-- .1 - -;"
.""jr"' "I
Slide 52 = . .= . ==,., " . = -,!T.--. The children are:.grop4.,.., ; .4::.i .4:.4.E.;11:::-,:,1,=!:,,,µ; = I, . = ' =
1 ---,r-e'-'-i-, L .4 'µp .,i .'7.117-17¨,---L----1------H--1-4¨, --4-:, .----.r -J,--4 __ 1-I ': '" , 1 4 ,... 1 1 ":1.f .I''' .1 .1 1 l= 1 ' 1 , .
,..-----=7-7-- __________________ . . ________ -0- ---- 7¨, , 1 M',-J , 0_ '1:1" , HI ;
, ..,, .:
-= = , . ' t, :,,, - _ , , T-17- - 7- = = ¨
. , , = , . . = 1.1 .0 i=N .L D -,--.4-.-.,,- '.= - i-- --4-,õf4.-1,-.:3,1-.-....1,2Lit--'' '-'1.'5 4 q -- . 4:.! = ..,1- A 1'1 ',IA.,. V ,.. i : i = = 1 ...V.. P= -&?:1;
4. ..' '..4 ,'''. 1 1 -..,._.1,.,, '-...,,,,i,.,44,,,, =:....",..c.: . 41',-t - ,-:,:
.:11:...t.'õ:1,;, 4.,..., ,:.",:i: 7,i;:.,1:1.-. : .
,.c 4: i'rl, 'r : L4' ...; -it t'qj .eZgi ,i, -,...'A. TI, :1:4,1j, ', :..., :,1:-= 1,11.=!>,, ';,:, ff: .:-::., '. "li .: ,.., .., . "--7... ..a..4-...:-.1:: -,,v=','= - -: ....:.... 1.1e44,..-:: :L.; t,:,..:4, - = ''.-IL.-:. ''';.1' - ..' -L...4 ----i---H----1----H i-----1-- I- --1-- -4,---1-,----1----4-----1----111:11111e111 1111 ,e..,=..L __I__ __I -------------------------- 1_-_-_1-_---L- --L----1.---1____I 1 i 1 1 ,,-,j^",0^,i , Slide 53 Draw the arra -- - i-- -,--,-- - ; -""1"------t-I --.1---1-1-1-1----1 t 1---t¨ ¨f¨t----1- 1 . ------1-1---t ----,til , _Is 1 , 1 1 Q N 'L D

s 1 .: i 11 t M I - 1 =
4_ `I
-"*"'71.7"71.1 - - i = : = I = . , 1 ,:: : . -1:, 1:1,.. ' i. -=1,.:.-,: '-,.1.-.4..-:,,;-. = : =:. -..,.:_ ,..,:: ..:,,,..:
.1s::,; :.: iLõLil., ti . li..-j!;: ; .. - I:1 I i, 41,a:.,..,,,_,..4'.i, -;,.., :? LL: P'!.=!=,-h.,1=:,?...:õV
1 I I I I , 11 11 1 I! i1I
Slide 54 i ;.....: ..: v:c5::- . =':,IK' ::- - . :: , ' . Draw the arrowsli, .::
, kaMML1AIENEUaL; __ pi:
. ' L........L
1.77 I 1 ¨1---r-1--1: ' t ¨1-1----1-1----- --.1---I I
H . I M J ----------------------QNLDD 1 __ i ' ' ,,.,= :.--.4. - ,:.-L . 74-----HI¨L-.47--*-H4g= !H--:-1-4;:. ,---71----r = 'I- r -*..: : 1 :' -. 4i k õ...,-,-4--,==;:,--4,--4,4,74,-,:-.--1 , ,---,--+-Hr:,....,44.--,I---,-._..õ--,;---,-I- .µ: '4-: l'. .41. , ,,I t .= ,, :4,,44,,...,p . lAptot,,,,ip.3 ...": ,....,4...:..4_,,õ"..= :-......,,,- ,,,,. ¨:;4; .0= -L = i,:-., =
tati-..ii,,¨...1.cg: ila.4.dill-1 i 1 1 1 i 1 1 i 1 i 1 i i 1 1 jr--4---4 _______________________________________________ 4---4-4----1---1----l----]-1- ri"---Slide 55 .Y-,----rõ---We want to put down ' ,, , :-: ,q,..t, 1[:j .:,'-wit,13V. Itc'Ax.e-:its children D, L, N, 0, and C.),:igiiiiA
_______________________________ .......f_______,_õ_i___ H ,.1 M .1 0 1 .: I. . I. = 1. , , , _ 1 .........õ , .7........õ.......,....... ,4,...,.. !......
,.......õ.........õ.....,..4.,.......7 Q NI L a iTri, 1Tti , 1 1 1 , -t -;.4"."7"- '. ' .' =''''.--t-^1..,.=
"4'",[ft'"'""1, , =-===== ¨^r 'pt,' s, [ I ________ I I 1 j __ =+:i 6.----4,-.-r".7.-."-^^i^",4 .. ===,. ..,. ..7,-7 '";.,,r=t--4rr=-n'',--7.,r'-Z-*,4.7'-:'. ,!--,':,r-- ' = 7---4--i-. 2.. ,:i.....,4,. ,:'1, -:1', :, 1.:" - :µ,....."1:v-; 1- . i - 1:., fri i .. =:. ' . = ..1 -1 ,,: ..: - ''11.. . : 1 I
:.;;:4-12'4',,I,-4Vti. , .4.r.-;,-..,..ii=:'&1, -,:ik õ-,-ivõ-.4...
-= ...õ,õ. T. - ,....r.-..õf,,..,t Tõ,=:. ..... T.,, õ=,,=,:.,,,r.õ.õ:1,..,,,,.
ii 1 1,, 1 ,1111 ---------------------- 1________L____L__ .4____-1_-_4---1...---.1-- -4---_____1____3____3____J____ ' ____L____L____L____I____'____I____.1____'_____I___-'__,=",1"4""' 0, 1 1 I 1 I I 1 I 1 1 I I I
1 +-= I
Slide 56 D is the earliest 41 ' = ': .:
Move it out of the way , .õ J=tallsonsammummommoss '''.-i---1-1.---t :-7-1 ,, ,. - ' 1 i 1 ., i , . .=
,..v. .. , I
- - - - - - Pt ' _1,..` ......_4I,,._____i_1,_4,-, ' H ',' IMJ.
' - ' + ' '.. . ''' . ' .,:"*7-.7.1-71---..-,7'47,------i- ..1,,.,--1, -0NL D µ'Ini,1 1="- '''=f: Ill' 1 i .:';i=
1, ' ___...._=-,....-___- . _..:.---t,õ:".4:-;;-.44. -.,. 7... , = ..õ- =.' -----=-r.
-', t . t -', .,,..,...... -i.:== j ,,-,7,_ ..., - - r,== .i. ...., = : ?, :,.. I._ ,i k-7 ' = 1 -qt ll...- :1'1_ A: :,i,.' '.: .I' - :. 4,.; =.:
,,t.',;s4'.''',:j :!;=1:' :-1..:s." :.' :d. 1 !tirlittftterittfttCettS-'"777.7. 7... -...,;*. ;.:..3=;*idij. ;,:k--'=itit+, .,-.4.k.',.::1-, 't.!..,.1,:i.i,:-: i::.....s'4. ,.,,,..õ..,..v ,,;.1.f.õ-,,Nt,ip=-tti:
====.:.;tfl.,;i-t .;.,,,,,;.-Atilirrg.. :,,,..,,,,,-,,:;,.i,..,;,1Tir 4:
,,õ,11 11111. iiiillil 1 1 1 1 I 1 1 I I 1 I 11 I i I

Slide 57 ir D is the earliest in ti Move it out of the wa r , 1"-i , 11-.1 ____________________________ ____ i_, 14:_i____ ___71__, i_d_____1..
H 1 M J ...., 1 , ; 1 = 4.. 1 _________________________________ ,..,......t.:........4.:., _ ,., .4.......,...:.- A 4 t QN L ' if __ f,D ,,t , F ''.. :.. i . = 1 ..1 '-:! ' I , i t ,.! ==G ..,_..,' : i___, 1 i' 1 '-'1 =..1 , ,i__Ii,..:_ir - - 1-,;,--, , i '_,=4.,':- .-------------1--------,r.--7, :---J.,.7,-. -i....--'17----,`...:,..'..r!; -4-.:-.1- r:-..-, ,.-,..4..::t;-. ....1. ... ...: ..`-'..r,=rl;rr-1.i--:---"tTilv=:-,.-ri=-.=-Ti-it;,' . - . ; . ::.::?=;.: .....,11.,04--"rt ,.... , -i,'..,;-, .-.--.}.1.40,7iitikr-.44:.4::ii.,- . f.:
'.1.C,.,...,,,..,, 4.,. 95.3' .1Arq. f,:21. q.-1' ,:- . =D 4 , i I 1 1 i 1 1 1 1 I I I 1 t II
1 it t t illiiii I 1 i I } t ff I
Slide 58 :
Move L and M intb.
' '' ..=:-'-.11'1*ralani.
I i i - = = i ti ii-=1 I 1 ; r ) I P1 ;
, ____________ Lµ....__.L._ '____ ! __ . L__L._ .1. _ ', _.1_,..i_ ., I

. ..... _i__ ...j--;L:H
..-1, t I 1 1 H' ' 1 MJ , -0 ,,,' ..1 , , i 1õ,..
_ Q -N. L i ,i , it D == = =. L :', . - f, .. t 4 ; = ---i:' '.,r -,--L--,-,--L --:- ' L., .:-4--T71-.,-1-----r---1 __ 7. -----------.,:; 1 ; :. :4'; 1,f. ?' I '' :4 ...,.. 1 4._ ____ G .1 -....,_. 1,..., A ,, 1 -.L_..,.õ, .. , -.17 ' , 7-1-4-717 , 7: ' ' .1,,.' 7.r., . :!!'. .....''. ,!!!:- 7.
7,1177::. - r:-,,,:. !_- : ' T.- , =t!'?.:1,.., 4, , ' .4 .-.1;., .1.'' it. = '...- :1 '''':' I ''=
.1r, ' 'th.: ):. L j'''", I -.''' if___L_ri .....
Itkrit,'4,4. Yari.T2.79.T-:Trr7-:r:flmr:z7'PõT'zr'mT,:prrr'q::r7rf""t j_514.....ky,:x.1,:i:.,x2..:4,:i.:,,. ..1.....:1,, :':.i:..
'',.':. ' , L.:. i -..4.7;424)-1'::::.
e-'---r---4,-j--4"-'"-r - = i--- - ,----r¨r--1---- , -- -- -1"-"' t -1¨a----r r ____,II___I____ C____ i -------------------------- I_L , ... , 1!1:1,11 1111, .1].1111 .____i____i__ _I__ _i i__ __i_____1_____r_ ___I
1; ; i i i i i I ir.j,_,,,,i ---Ii----1-----i----4 h- --i-----h- --i-- -i ---1- --1----1-7:1----1-- -1--4t-Slide 59 . . T:' iii: --Move I_ and M into position,:p , I f 1 1 1 1 1 1 I 1 21_, I_ ,.._ z___ --- --- II

71 ' 1 1 1 H ig J 1 0 i M4 ._,..1..:,.....1_,.+4 0 N ; . ,t..
t -1 -7,-' t D L 4,_ . 1 47.____.. . .....1_ r 1 - .11_ 41 ,,-47-----.. -1 :-Tr_ ii 1 1, = T . [ i 1 õsii;:,. . :k 1, µ! t = r ::1 , -/
IL
;;,.. 47L7-74,1:' ==,',4+41 1.Te ,::- v;:iii ::AdiftS ;.W.,7: t.'il]
.1'fittirek:17.X
=;.:4J:jtj.lk.';' ; 611 Ni5.'' r i 1 1 1 I i I ill ill i 1 i 1 ..".^4--^..4.-..
1111111;11_ 1 -----it----i- ---f-- 1 r----1----1-- -1- --i--11111tf Slide 60 , .. n. . .
Alibli,77.v. ,, k,Efi rts.,,!';:illiliamm,.-i,'' ' AT ,:,1,1 .. ., ,4, il .. !, .
, ¨ - ,.4 movierornti. tt;.,`,.;., Ito , :.,., thõ...4..,.,*¨ ,,_ ' " ,JLsat.awsamsste ---,-- - 4---,-; -A--------V----i---.4 i '4 i 1 I
r 1 , I =
, H t.õ ram_ -17-.....;,.:-..-.
n 0 .. =
'--- el i IQ N D '' " vs -, 1 ' : i G i,... 1 1 : 1 :, ,t,-!,..',.,.
;III IIIIIIIi[ )11 , , , 1 I Itillir r 11:
r____i_ iil,iiiiiII! 1 i,õd_i ------1,-----1------1,----1---------------------------------------------------1----1-----,Thi!,÷ r 61 I I I f ; , ? 111111 =

Slide 61 .'s Move 0 into position :,,l.a.:tgitiaat.,u3kumesswkaammin i =1 1 t _ _ ir I __ , H lof - : I
G
_________________________________________________ L P 1, : :Mk ''g.W!'": =
' = = =.1q, ;-:
= = , 111111111111i1C1 ----------------------/11111111111' 11=.j,=1 6111111111111111 ______________________________________ Slide 62 =,?.;
=
, , N and Q are similarly, = .:"i twagassmaimmogmenewsra IfI
= 1111 1.31 H IJ -7- r 'MON I 4 D N Q

4., = ""7.." .
tg ..L. .t , = =
__________________________ .i` = u "
g g!g g g ,ItIlligg gi, 1111111 1 11111117Hdms.141 Slide 63 ' Now put down K !,!ligglii!
_ ¨,Auffionspo , I Ll.i. 1 1 i P 1 1 ------------1t- -- -V-1-7' --- 1-1---t-1_1.õ,i....J____.
II -.. , I III. J o 1.. NQ
,....-4---- ..4......:-...4.;.-.4,..4.---4... ,771.......1,-,..,___.......3____ , . j 1,.; 1: 4 , .
__2.'?...i_ ¨.1.
2õ..õ,.1._õ_ _____ . =....4._.õ1____ .___t_._4__õ1_,_ .
, , r I47g.t7.-;),.,,,, 7,11777+
41110 ........................................
,a.woi.'õ:, :f* 4,, a' .3.1'<arlit : 4ii i 'N-rilltrth112 i'---- 1 11 1 1i1 1 1 IIill iii 1 ------H-+ --1-H ------- 1-- -4-- --i-----i-----1----4- --1----4----1-----1 H

, , 1 -----A----I----1----1 -- 1----+- -4---4- --t----t- --t ---t----1- --i-1- ---,---Slide 64 . , .., Now put down K

JV _____________ - 1 17-i-I I I ---` -- -' -I-- , ---1----L
= . 1 l' 1 i r :' I
iiL _I_ ...r. -........- ______ .....-4Z:w,.... 1*...
-7-111111 :I ' `' ' -- M FT 0 I
' . - --- - ' 7- ,--r4,-*-I _...
., ....., 4 D 1 l_ ..1:17f i 1' N
µ---ri-nft-.767"t-'---,t----1-,=;,;:r",17¨,1., ".= = V = ;1; ,.,.: ''-' I ,. 1. - =: i''''. ", G .t- I- i ' . A I 4 1.4-. I ,,, ..47'.....lf: .1 ,,.I.
t.õ
77.---r-i-r--,r--1 õ ,,,--,--.-F e-r7,. ,, 7 172-1 4;47-.",,tir.,;-4,t,is, -.4-4,,:4-i-c......;i4-.-..n .,.,,,ti.+:-;,,Livt,....,,,i7.,,+:;7,,,...f.
. I; '':, j! l!', 1 :V ,44V-*'71- 44"'4=' I:
'N: -1 1 .4',Iii! I: i 1.-4,-L4----4..-_-4,-,.. -i.:4-__.4.1-.....42.2=411.L.4......z_,Lle, .,4-.:7.2.14.u.,....--r-iii1111111 J11, --------------------- i_ 4I,I.____I____1_ i_ ----------------------- L_ __L____L_ _1 _1 Iliiillii:11111'4", Slide 65 We can connect K to problem DI: ' i i 1 j i i 1 , i 1 [...... )111 tjt t ...1.......,1; lit i i ill it t t 1 'I
ill''. :1111 I II
et -- mi 1 , , 1 M J 0 ---- ._:._ , -f -IT 1 ,- D L i 17T¨I T N 0 ........;. ..,, .-.......:.4........... 7174 ' 4. ' ' ' : .:: i. L [I( : i-õ
I
--.-..71----1 .. I s= ., ,t ::::: , " .: --.;,-..- ,1...
.:V4 .-t44 1 ?.. ....,.' : 1-"'!.... 1` ..z..t.:..,,.
1,õ4,.,.,......14.,.'.....,..4..,m,.......' ,-.;:.,...õ41 .,r,..r.,:õ:õ.&..,........,,,...n . ,,,,..,..:.,-. x. 1...õ, :0õ..44.õp.õ..), .v .., :" . '':!..,.',.: "x :
f, , : =,' ..7t) . -4. -;4-,.... li...j.4', .;.,,, ...:.'-.]:.
'mm11111111 11111111111;1 ill iflillillillilli Slide 66 But we cannot reach i '''-''' Oi;:;1*.91:' AfAT'it'!'; .1 make the connection ., ..
, li.,Vtql1 111111.1m ; P t I
't"- -1-77 -t-' -1 t -71: : .r.-1".-':---i. . 1. 1 1 i _i. a El j. 0 I ' . L
1.,,, ,,,, .4=4 ,%1:. I -tfk ,,.. ,. .'-:-,,,, ; I: ...:-- I..4t,-i !_:., -.=. õ.. .r. _ .. , ,=_= ,õ",.. .....t; 4MIL t i N
]f' , Q:
: 0 ,.
Le -7-- i s i...1 . ',...
, 1.% i: ' . ..'.
. :µ;'-' .-"C' ' i ,' V Tr;q: ' 1 ..z 1. -,.. .= Tr'11-1- - -a_ 14, v.=::...
r '''' ,E11,1_ :!...r'7.r., ...'..171."7"r iv.L. = 7:477:r"177,70,717,77r, 71.77741: .7...,, ' 11111.111111111vi.'1 PCT/us2006/027302 Slide 67 But we cannot reach 0. If m./..-;:::It-0.-'-'$i4:dirt:
make the connection.
, II i .1. i 1 j .1 : i_: I LI ii:i P 1 -1 ____,____õ___ ___I_____F____ ,____t____f____i____i____, ____j___.1____11____IL___[____[____[____LI ___I____i_________1____f___ 0 I
11 . 1 1, 1---1---- --- ----1---4----1--4--------1-----L--. --i--- ---1-------' ---t 1 I --tI ---; . D Inljr i :in ES Q I
1 , t _i_ ...
---1--1--- ---"T"T-, =1 ,i- ; ,i ' ; ! . . .. ig _1 I.' ---r----r---,- ---.--T- 13 ---1 ----%--- 1- .
[
1 , , ! õ....L i . , LI f . . 1 : 1 .-----_,...,,..
7.-711-71777-t-t-t-E-71-----, "¨t-:-- -I - -÷i--- ,"¨= 7---1--""'T
1.: . : _L.* =

I i : .1 i : ; i ; :µ[
Lµ........a.E._-.L.....-...4_.:..,._,. ..... ,,_ =...i.,.......___-____1.___.;.____.....__L_:...L.. ___.:..L....:-4.......
. ,.,. . . .....
Slide 68 But we cannot reach (;!:'7 F!'i_ve..:,g ..,,.:azi,:, ' ' ,..,./:: _4:12: , make the connection.1,' - , - - , --, , ---: ,..r7:1i 1 , I
L i 1. i 1 A ,, t . '.I L : 1: j:.
P
.--"1-71-'1-717-17-1-77 . - ."- -F-1-1--=- "L I -t _____ ' LI.
i.1 . 1-...1: . . i I . .. õ .

.i..... I. ....i:. ,0 11 _i____i___771.1_47._....1.:õ
I.
---4---7-11----h-1=--- - ---4-4- "---1-"4 .2: ______________ .fi 1.1 i :, ,N4 J ill' rl !,.[ 1,4 r.,,, JD L __________ -71+"ig.,:11.---1,----r--T-7.1--,-: + 1 .i.
1 . L' . 1 1, ' I, 7 - -=!---7 ---z-r---1.---FI-7T-17-17:1-7-E 7--. 1 _____ 7-17---1 l .:___I____L ____________________________________________ .1_____I,L_.4 ---------1-, 1, r. 1 i ..! I
-4-:1-:-.1,--,4-+-f--..-r-_-t-,74-71---1-4-i-----1----4---1-----r 1: : III: 11 : : _______ t :

Slide 69 Now draw the arrow to N. G
We can raise G to make sppeoõ, of:er.itmtv., .
. - ---- --- r--- ' ' r ' ; = =
Ifilti'll_L_iiii P 1 I
- ,- i : -, - ----1--1---i-----1---i,r-õiiõ, ! .
1 1 1 , .
' 1--- L
¨1-- --1--1--- ' ---1--- --. --. --1-1-1---1-- ---F---1 .iiii Ol ---1-1"-T--,-----r-7,---r--t" -1----r-t-t-7--r---1.- --- i ----------, : . 1 .1 1 , 1 , - ________________ -- ' .1 --.-1-t--1-1---t---- Lq - - ig ____t__, .1 1 - i-T-1---:-1,--r:-.:D ni rin 1 _4_ , ; L__, li,___ . iimi , 1 _i___ -7:I = . .1 i : 35 ..: - .. I ell = i i i ---17-77-7-777----1-1--- ra---1:7-r77-7--.
--4-- -1-1::. ' :.....;___4:-:.--,....õ__i_t____ ILIA _ ... 4_,....1_____L-.2:___ I
1-- ..õ1 . =-i =i= : 1 i 1 I 1 - 1 1.11,-,i-L_I.L.111,4:2-1,,<-1=,=1;12ii,L.44,, 1_= 4,..,:_i_L_ j -4...,.,r_ .
, ,.. , J
Slide 70 , =
= Now draw the arrow to , = ',...t I%
i'l-:.=
We can raise G to rnOkr4Orr:-..:- r.t :- i i 1"-::- 1- i - ' i 1.-...' -= = µ.1 = .i -_ i . :4=:- i . , 1., L_ -1 ,1_ 1._ 7-17----1-1.-1---F:-.1.,"-, 7-t¨ I
7-717--77-71¨ 1 __ 1 --k., ..1.-ti-4-,:;.-1-7,-..---.-1--- - , -4.....204:-._4::11: .'1........HILI__4L_ 1 , .
--_1----------1---1-4-----F--4-7."1-1----1-- - ' ---- --- 1-4--$ .. $
__':1 '1 , 1. ___ :1_1'1 ==.: , 111_,,r,i : 1 = 1 =___ 11:11- El , r I. :::1:õ' , 1 rm - = :.. ,, .
, ----1----'----1-4--4ir4 CI Q I

. i -:-.,___I,a1,./,5 . 1 j : {
--7"----r----17,71---,--- pi ---1---r---i--}
__:,..1_..k :,1.4____L.,_ 1 1 .1. -IL 1...__ = ) $ : --t-$--1---' $ ----r -, -.----, ,----1----1--.-- ---,- -i., i 11-, I-11, .._.;..__ ..._4_42_-L - :_zõ,.,:_,_ __;_....1._ .-..41,.. .....4._- , . .

Slide 71 --..:::: ell-5w p,,h!, =
Now draw the arrow to N. G 441 :4 , l,k, ,4 _ We can raise G to male spa*f4k't)iiit.tt.Ortomi, !ill:01[1H I I P 1:i . i 1-11-11 1 11_1:11 ----7-1--. - 1---1----1-----f---1-7--- --1-- -.
iiIIIIII 0.11 --1---4---I-1-7- --1-7-1.-71--r-t-------- .. ---7 i 1. 1 I
---1----1---1---1-- -----..' . t In I I '-------------1i i _ H I , 1_ I __________ I T 7 --., . , f kii . I t I I +
i i- Dill 1.. 1 _11EI

i IT-1-7777-FT7 ".'--i -. t :.1 1,- I : L, --------------------- ...,......ni,,_ ..._, ._,..J.,:___L___,=
f_ ,--1:::--,-,1--:7-4=7:4---_-.r---.:-,--.,=-7--+-4.-.7- -,,:....4-7.--,-1----.4---1-.77--it-, . , Slide 72 =
We notice that we have .`'..:11-Og),-(-11.4.:( -.).-.:3tr'zt ii''''''''''''':
from K to O. -i:4,-.J11.1f:!;Fi''.':-...,:. =:t... = -,::
. i 1 T. -I- 1,=-1,--_-1 _1 r.. p , 1 1 --1'...---....,L-A--:.4-:.:-:-_4-_-4--A-:-_1---1--4-_-i- =I I
.1".
I 1 Jill ,I 1 1 1. I. 1 I . , 1 j 1 .
....--4....-'1-1.... I '''d--""-H+.-.--1 7-1-.1-7171- .'74--1 = I - : I 1 0 1 !'1 7-4-1--1-71,---,71----4----17.---1----7 -71---1---.71----i---__....11___. ...__4 -. -., , ,.. =
, ' -1-4-- ----,-F---1--1--- rim -: 3 -I
= . iv = I 1 DJ
Ell 1-- T 5CV tlick I
--.4i.---T-- r--17 7-77-1----1 ill Z,---)-11711,.T=TIr..,,, 1 I
õ.._.,...:,,_____,.._...+4...,...._..:,......,_____,...___,.._õ__:.
,....,.;....._õ,....4,.._.
, = I 1 , 1 I i 1: i 1 . 1 , , ....-1 õ____.......1____ _+___L___,...__4,_ -.,.__1_ - --,-J--47 Slide 73 =
We notice that we have a better ntAlift ;67,0,-,,,=;
from K to 0.
P

., ' 11 ILI-IL [1 111.11 P ' 1 ¨1 I r I 1 1 1L I 1 I 1 I ' I -----i--1---1-71¨"--- 7r-- __________________ i-- --1---1 , i 1 I 0 i = 1 ----1--- ----1---1-- 7-1---f7-1---- --t--1----,--77-7 - --r---: i I
-i-----i----i-L-,---.--- ---- -.- . ---1----4, _____ .1-----t-- .---- - -TT-L__ J____i____ 1____ ini___ -TT, f r cs ; . -r-H 111 .1 1 .1. 1 1. . m= 1 ;
TT{ 1- , j D III ) i...._. . La El Q I
, i......k .._.,::õ.......,..:.,.._,....._.. ..4......_ _ -';'-i ,. -,,,1 i . 1 '-.' ,,i ,, Li's., . _ t. .
,-EB .= ., .' ---1-:-,---1----T-7--r-r---1---1-7-1 ___________________ T--- pa 717-- ,7-7:1 --"T , 1 1, .: 1.1' V, i 1 '1 .i, 1.1=:='-j: L: [ i . ..: 1:_:......1- .-,,.....=__....1-.4.--4-,-¶L-,..1-1-:-...-...L--:-3:-..: ,...... -- :,....
Slide 74 ,..!!:',=.-:q.-<'_'-, ' =.= ,--oo,,,,i-P-1-.!-' -= : , ''' ' ''' ' The arrow from K to Qis-easX.::=..
. ... , .,,,,.4......._:.,430t.-:',. -.= . i j-'''''' .
1' . r I- ', 1 . -.ID. = I
----f--------- __j_. --,,i-----' 1 I - : '.=it I -I 4 I i= i =I'.
= ... .,, ----i--'4-"1.--P74'-t-"1"--r---t--:-/.'4-41---11-7 --r- 1 .1 µ-i = ] .-L-- .' ' -:. ' L 1 :1 1 - la ' . .
t,--,..

.1-7-' i D PI.L.,..r.õ.': El Mai ,--.-- .., . ;7 ' - '7r ill Siilli ::
i . k= Li. .. ..- ima,_ .,_, ;,..,. _=, . ---I 4. '---., sõ ---- -7-777- ral I 'le- . '..,: µ,..."1 '1 ' ..-,F, '... 1 , .,1 ....1 '- ' , :=;. ... . .,. 4--.:1-7 , -,---1---=/.-"-i^-7- ---1"-- , -------7--77"- .,. .Tr,--'-r-t- ---, -ti--- --.
.

Slide 75 The grid has infinite size, sok*Yiii-iY!µ..4 -i-11,1,-; ; i demonstration purposes, iiiiiii P 1 1 1 .I 21____1_11 I
¨1-1- 1---t- - --I--- 1 I L ' 1, 1 , i ____I____i____I____4_.___ _ __ ___ __,_ . _.+___t.... ___ __.F._______f___.
___-1---4--- ---- . ---1---, i I I 1 El ---1-- --1---1--1--i--t-1,---I
._ ..._.......1.....__.;____4_:. la = --/-1-1.---.1-L- ';,--1¨:4--...4,¨+ -:-''. I ,I,L..............J_____:.......
1 1 1, I
: _L, 1 , 1. .1 .1. t_t_._ = I it 1, i, i - ,7-,,., -1,- ,..: , .-:---t-7:-----. . ..-- -^71=-,r7r7.7:
7,¨"!'"..,. .. t -Slide 76 . ,; Ti...= .
4- -,,,,,,õ, =
Place and connect F. an oheltiti0,..:,!, , rl i , I 1 I . I .1 , i I
' 1 ..1% I . i, iTh.i....r 1 1 1 1 , I :12 :
7-7-.177-47 1 i. -r :1 -- I ---,--r77-11-1-7---.71 --1-..,.....õ..4....f...:.....,..............,..f...r 1 _.. ........ ..+,i-.7.1...._,....:47._,F
.._ ....___._:_, ,i-,.,...._1_,-,,..L.,.4..-k_..1... 0 . i 4_1. l_f_ +
. : I
-, .... 7-74-7--.1--+----4.-----1--- --1----1----i-----1-,--1--- ----t--71-I-:.4 __-_1_______,_.i . ... j -_1,:_ ...;1__.
_,___4 H I I . K4 1 T __ - '' I 1.'1".1. '-'"[' I ,--`õ--:---1,--- '.--, .:--i--,:--,..1--.-- ,-4--4 .?.1.: DLL' ":-'1, ,'G 14 'CI -1. 1-4 11 ,_ .-4_,,,__ .....4 7-71 ;:C. 1 ' 1 . ! t .',:t i ..õ , : 1 .
.1 =,,, : ,1 .11 '........:1....:...r.___4_:......1.......; r 1- _1_ ....:. =
1....._71.:......4... , .,..,...4!.......:4...., .,_,...k....4.
,,, i _1-: 1 ,:l.= K :- I , 1 ' 1 i 5 1, Y
Iii r, 1 , ' 1 I
H
---r---.--'-+----t _j 1 _,;
-!---r--r-i ___________ .: --1--17--- I-- 1---1-1-71-7_,_-r Slide 77 Place and connect F, and ,0 i - 1 1 i I.. 1 .1 L P L I I. 1 I _41 : 1 I 1 I I I I
I I I i 1 1 L
---i-----i-j. - -t----1.
1 ----1,---. -. . 0 --1-- ---!---1---t---+----1---4--"1---1-,--1---+----: 1 iilli I
--7L --.7----+---Eli t-i-1- 1 UM -- F1El 14 3.--- , Iry ----1-----r--.----.
,..
- i - o Mai , I is III Q =1 1 ----1--- 0 as = 77-- . = is , - f':: ___ ;F= i -- = 1 -1-'7. iffi 771 _,.õ.. __,....L..._....1-- ==-=.----f--L-4,----i----H-t7.7". 74 1---"I
.-;.A i .-i=-.':1 _i. 1 . i ':,.1' i i : L i.
1, Slide 78 .-4.--4.rle., ..-,t,-;=.ita..; .. ., '57 ii i,..?i:::(:.._ , t), We are finished with the,S 1r r of.t zikio:, _ ._,,,, -41ii, _y=,...,:. - . ... , . . ...
II'. 1-. , P . 4....' = .IL:_i_ .4._.1 -1 -: 1-- :.77-1---- 1---- 1 ----C.-1' --71--- ..-7---7 --1 i i i : 1 i _i_ .:L.,:.* i. J: I .;*
1 1:_:_i_____1::___ ' ¨7¨i-77 .-- ,-----1--- , -- : --I----- --7" 7-- =-7 ,-- 'Ill ' . 1 ' , i 1 . 0 . , 1 1 1 1 El ,= s: - 1 ! i_ 1. 11' 1___I____L_ 1 __I___ :
__ ma ilm-f---1-- LI
i ,=- ;:.... ., I ' ___ ' ,.....
D IN 1 .q.'1 -. in Earl-,,,,-1----1---T-t-- :
-, I 1.......:
= Inas . ----17-1-77171.-- 1 :t =' -____ 1111_____!____4 _____ . :=,- - = -' =
...1____I-_:.:_---1.-4::: ' ..... i ,., .
Er ] 1 , Slide 79 - -quo,- =
,.
The intermedi* Collo I r "--- ttr.14.-t.t....
Lilt!! P 1 i i 1 111 II ; 1 1 1 1 i 1 ---i-H----i-tHi-i--4-71--- --: '....-+--7 ----- 1---tri:---1-II H 1 1 M __ 1 I __________ I 1 i 1 i ID : ,' G '1\IQ 11,71 f, t1_,.......,._,........t...,,+
1 ,.
i I ! I" _L 1 B __ K .--'1 __ 1-,.: _ L_--L: _ -1____:,..%
IF- ---17-' 1-i __ I i '"'=
' E '1,,-A. i . 1 , 1 7¨r-:-,----1:,-: -1-- ty--.--1 177:-, Slide 80 _ - ..õ,.414,,:: = . -ir.v.== ,,,,,:;====-=== = : : :
:-,:.i 4.1, = , ' , .....:4 x.v.,.; 1 l':: ' ' = = = =
, = = = =
: : :,:.= ....
..: :::: : = , :
ki, ..., .1r:. ri..: 4.1.1' , 7 : , =Ai.4.01,0).1: = . , : .
, : .
Is rendered aSF,A1..:101fif,õ.i.-:'',',:',:-:", =, õ41:, .. ' =
. , , , , .==.
. ..
I
..
-= . . . , -- . =
, I> SOI
tilr,Mtlev.A.nalL :1 . .
=
. .
' .
' 3 ' ' õ, . ' = ,, ,, , =
' , =
, . , = ' "1-2!....t.4-,',.-7,,...i' " `:: ' .=
..=
. = = 1 ' i - er.e:a..--.i;.-1 rw.f,.....:-,;J , , =,.. ==
. =
. =
. , ;=4 . A' f = .,õ'',sk : 4' . ,=, 'õiõ...=. ...: 01 1,.-.
.7= ,,,,..,,,',., - . ........=;-.õ.E c2õ..nia, ,,-. :i .... .?''i..'-' -1T.-r.T-.20,-..;.Liil = '= -.:,-..e4:-..-t,i-'..,..- i , "'"';,;!;t-Te:
ii.:::::T,;=',Tgyi,wir 1 , ,,..,- : = . ''', = I-= . õ ,,,,,,g,.'")2,1==== =-=,: .1 -==== = --"."'A','",' -= = 1 = = =-""!,?:22,=".

= . i ' rib.P.slialsNZar;rft = . .. .. = .
= = .
/ .1 = .... ' '*''': e.: flPi=''." = =
.
== ' -.
'' ' = '= '7 I ''= : ,.' = '''=,µ =A='= ..:
t.õ . . . : =,,,, i . . , =
.
. .
. ?a=.= I; = ..-4, :-,.= -µk,..
,4,õ:i.,." i'i.t=tl'iSA:: . 147-.^,..:1,2õ,,:ir, ,,,,!:,:, . . === .
õ- .
.. . .
..
- _ -4. = .
=
'I P LEINcrasvoc,431. = .. : k , ¨.sr: ;?:
4:: . ... . =
= ,,,,,,L73,:e.i,:66, :'' 71.i.:
:,;1' : , s - - : : : .. .
. . , ::::'''ib''!'' 'ii: = . :.zr.' ' '1:.::P - : rio =gr.:A ,::, v.- ': r' 4. := ''.=-= '.','": . : =
,,,:,õ, .,.. 1 = " ..;,.i.. :-4.:4. -=:' ., .' ::. - ' ...:t,.% c..i:;,'..:' :L.,,,:1,.:,.,..2.,.0¨; .1.,õ, ,,, ..,. - - ..,,.
.i.,.. ..õ4. ':-: : = = = = = = 4.....A. 4:::. .`'' =
'.i = V., = 4. ....,s1:, ':, _ -''':'.i . -A.P:t %:=x".;::::;:g-:. -44 '''..t :::..t..,,,,i.,.- =:::.;i14=Fi;-,.:: =
`::,/..;---.P: . -;;;::,4;..;...: .,,,,:ij:44,,,,, :'4,-.10.=:,..J..,.:.::
':µ&. ,,:...= q.,:..:=-,P = :,{ ,-.. -.:,.:P= .::''= 1:i !:4=4==).
: = , ':.--ci eft, k.s..3 g :k..=:::! %I' -4n: -'.,. ' -.;n1:õ..0414.4.%Wigi,,:,, 'figilitta4V
4t.,53..,,,==::. iis.z.L., ii=Vir,V1...-atli.V.P.:. :`'..]rii44,1.,:.=4t4'...
-,'Z-t=g=:=MVINI,k=51.0';'4,,Iii. ,.. :
rtiliki44::, 5 k-,i6:Ei.: 41=11111.*:0,,r_55Nitahazti 1$ tgitali:pd,' :teteat;:i4:taaka.:L:EtritiMgill'ireir&`?,,L.-.21.i..X.',...i.:11.grliiikiiii:i.r.d:ZIE.r1.: ' THON

WE
' , Slide 81 -v .. ,.....ree¨ , 14111011ag .
' =1== t F't1 .;. 11 I''' ."=1 ''''; 1 ' Mif 41iTiii ' 1 i , , , ?
.:.. ,-õ,,gailViiiiiIMMININININIIIMINI
= Use Microsoft Windows GDI+ (Graphical Device Interface) = Used to draw a bitmap dynamically (vector graphics can also be used.) = Combination of rectangles, lines images and text.
1.õ

8 H Granting Certiorari. = . : _ I 8 ' ,.., li.S.C,a1.1un 29,1959_1 , PT Galley v. Ca111-ornia SO &Ct. 536 in Go , (..) u.s.ca 1, Mar 07, 1960 {
. ________________________________________ ¨_¨_¨

ReversingJudgment 5p P.2a 44-77 ' 6, ..? . =
. ;. _____.;T:;:ilt : ' -.:,kl.stol.5.1.,- .= esr.,f.i , 54z ikin:M.f :VIt."13. 1.4;r31...i-ailes, 1P4iit, *1/4Piltt !..-t, 0141(.4 t,41itil 332 P.2d 447 , 'OA, f P.. .4.f rt,;
..irlIi2 . 1 i. =
1.'. Ati 'aifi k:k4.14 ti.=:. ' ' -' 1.'17 Ark.PV.11;ILCel !App. Super. Nov17, 198 .R.Q:f.t..Mµl ,e,i.,2t 'i"fZ-t, w::
!!,,i Slide 82 .??".
;1111e, ,d 07!
-------------------------------------------------------------The rendering functionality (renderer) was made generic for re-use possibilities (Graphical Statutes?).
An intermediate piece converts data from KeyCite specific data to generic data.

Slide 83 4W itliiii 4 Or ' 1 i ...
...,. : I t -; k , r * _______________ vvEs-r Alittii ---41-4 The Renderer only knows about text, images, lines and arrows.
Each cell of the grid can contain either text and images or lines and arrows.
Text & Images ¨
A 1F1* E
E ti-ri i .,4, ,:=,%. , %i e .U5CI.1 2919 Tfl II
.1 ^ õ U S.Cal. Ma r u t, Mu .3 6 . . .=_. ., ent ' wi4 ,z.! ,,,1 isb People v.1.!lieS, I
332 P2d44 .1.;;;
. i K W.,4.41,,p1:12.0ezi:;:sti:'=
.1 ' ......1¨. -.1`..¨r,li' '-4.1140',"'A,gP ':'.-.' .1.,..%'¨'1','..
Lines & Arrows Slide 84 '--------. .441iiiiirl -irt-vc-zovvea.cniorNi ..ii it!, - - .
.1.1.1 ibi.. : ==
i , :...= .!, o:y.
VIVI:
Each cell of the grid is processed individually to determine its size and then graphing offsets are determined for the whole grid to know where text and lines can be drawn.
(200,75) . . (600, 300) . .
(900,1 I
H Williams v. U.S. IV
1 - I 915,Ct. 1148 U.S.Ariz. Apr 05, 1971 't l p 1 . , LAffirming.Judgm÷t 119 F.S.d 159 i .
' E . - 1. ' r 1 . ..
z H Granting Certiorari '.- - I it drantini ,ertioreri T
.., i ¨ c.õ, mac,key v. ,.,s. .
ot. U.S.Aiiz.Ilar23,1970 U.S. r' a .8,1969 1 .: Si S.Ct. 1160 , .
u, A
L1!2971.
* '. . ..
Affirming Judgment 411 F.2d 5017 =i"6 r"."' !.I ..-,;,, -',4'...,. 1. = z ..
= ,-..-P. Williams v U S , 't) ..;'', .
Ale F.2d 159 '..``.N: Mackey v. Ii S J,..
:, -..' = ., ,;=;:: .I.
) 1.... Ki:' =k -:'-'... .=k;',-11 9th Cir.(Ariz.) Oct17.
1969 ' .. '')'-' ,--;.il ' ' '', ,-. :-..4... .3 ,i....,}..., =?-14, 1A,',.:1 411Fad504 `M .. )ji:=." Ta,',. T"'7777"77*- F:
,, ' 1 1 7th Cir(Ind)Jun 04,1969 bi li, ..,µ; ;: ,i, A....
%i,....=A
'1 -.;.: .f: 3,..... ...-- "". ¨a .
';',...A. F. ,..a .."-- ' ': 2...21.: .2,-. - -.i..... .1.41-,'9.,q . 7iTi...:.:ii I I I I

Slide 85 . 7 1411,,,rit' =
NIVE-Sir Eke ,.1 ..:.Aautigimmm.====
Functionality to shrink the image horizontally With a grid, the width of each column is constant.
Squishing pushes each column as close to the adjacent columns as possible.
This results in columns that overlap the adjacent columns, effectively removing the grid look.

Slide 86 /
. 19- Willgi.E.311 "
"Trr ,i, '''..1:- .
ri .= , 'ir VI 4=1 fSelIM CZN INN , : :: : : = .
* ___ .... :, = ,= , ':
....
.. 1 , õ
, - .:1.1 .
..
i .... :
Start with the rows in each column a fixed width.
, . . . .
I. .,._..... 1 , I, 9 I
. õ. .
1 , .
õ 1 St.1148 H Williams v. U.S. i 91 .0 . U.S.Ariz. Apr 05, Ii ,. 1 Aftl_rmin_g Judgment 418 F42d_15,9 1 I
.. . , =
.,..
_________________________ 4.õõ.õ-....,i -- 1 :
. .
, .....................
. .
1:::, mackey ....s.
i Hg1 GrZIltiFIQ Certiorari : H
Granting Certiorari i U.S.Aria, Mar 23, 1970 ` 11.1.8.1nd. Dec 08,1969 1 . .
' 91 8,Ct.1160 I
0i 4 - g.- ' U.S.Ind. Apr 05, 1971 I
1 . = ' ' : : I
µ
' Affirming Judgment 411 F.2d 504 , .
, ., -.. t - . ..,.., ': rY::::,,=.:

.............................................................. : ..
''': = " 11. - .'. '',10..,,.,IT!.,., '-;,,,Ii:di1t",,,, gi . - io .s I 418 F,2d 159 : ''''',' , tr,µ.=''.! F.., t,i,õ j,õ v õ., ti. s. - T-= .
eve..7Z=Tt....?..W::, -.::,,rfs..4, -...:' A
".- : .1 =ti.===, 1 - == seh Cir.(Ariza Oct17, 1969 : 4 ,:',; ';'.:2 .
, .................................................................. J .1, ... = 76 Cir; Ind )Jun 04 1969 i, j..; ...,,..L...4i:: '',....:. "..L.L.,, ........................................... -..r -::L..,.:,.L4r.12.t.I.::.,Z4i-r.,.4.,.'6....in I I I I
, Slide 87 ;1.ii ids K,. . - : ,..:õ.õ ....õ .. , ---7',,, .: :.: ...:'='7.3110fitill;; : . = ' .1.1 . .
= . . . ::-.7tZ- =
=:11.'04:141..;';11=W.''.. . ..... ...
-11"11-111C0 nets. (Di 111 ; . = : := ; ; r`-:: ; .41::';i1:1; i iiie.r..
Bp.,: :;:: 1 i :; = = .; .. il = ;' Y ' ' = .
*. ::::. 11: : pi = ri . ig - '' ": ' ' Iiilr:i,:,.."
iiii.li 4 i ft: ,.r , ,,!-_i ,,. , ,!,I,I,i,ii,i.!
:,.::.,õ: :... = iii.;. ; . ;
- . - ¨ ii.,.:,=).7-i.:(....si,vir , , VVIE S-r ,:li:41.,1 :i!.;.:4.1-;-41-..:..,.: ': :----- -: ., '. ' '-'.':=:' 4]:,iii.li ::::i,.42L, I
'-' .q:'..= T1115:11g l?',-. =1_,-) : -., :..i,11,::===?1,q.4:=!,...,-,..,1 . , :, . ::..h.:.:m!...f...1;.10...- -..-._=.J.
'.:...,_;: . = .
, =:== : = .
Move the second column as close to the first column until the cells collide. . . .
.... . . I. _________________________________ ...1 .
,.õ
. _ ,; = _ , ,.
,, 1 H Williams Y.U.S.I
, . . .
' . .. , 91 S,Ct, 1148 .
õ
11,5,Ariz, Apr05,1971 ' 1. t ",=,. ... I ..., ,=,, = : 1 Affirming Judgment 418 F,2d 159 ' 1 = , , , = .
.,.
Lr = _ . , ' = , - , , . "-, , :
¨ ' I
õ.
-=1. = , == = i g - H Granting Certiorari'. lc . ¨
., , Granting ertiorari I = = ,. , ' I.., . , I> Macktey. iil.1.5. , ..õ4,47 = ¨ = == ''' ' to ............,I4...,....,.S.Ar...ii......,Mtr 23, 1970 t . U.S.Ind, Dec 08.1969 1 . õ 1 , , , i. 91 $,Ct.11.60 . : - , . = , . ' ,, ' 1 U.S.Ind, Apr 05,1971 õ .
= 1 , I.
... : Affirming Judgment 411 F.2d 504 , i'4.., .. . !=":"!4, ik,' = . I 7, . = . . = =
,,,..,...., = I. = - = = = == .. - = . = I .. = === = .
1, = - . 7- .. = == i =
= . = = - = - .
, .
= = ' == i == = .. -1 t t: F." =.=Piii= ._.¨....,.......,......,......,. .
,.= :-.
' 1 . = " I : = I " =-<
.....;i' ''= = , = 'rr, ...C=== 6 ' = E p. ,-,. ::;i= I. :E. ' ' .10'P'=
Williams y:11'1711 = = = = ' 'f'1'''.....;;=il:,'=li..',..,:i."."N; .=:=1;L: - - - .11444' 'II' '' 1:'-'''''' I
. 1..t.,....= 4, .):6=='--.. - = .. , .,.N 1 -- . = :...,. ....,,,,c . ,-.:-..,,iJii::::.
=-ti, 1 I , A
= ' ' '' ' ' , S= ; = ,.... === ,0i, i fr. tIV== Ail 1,....i.,,,, ==='41'it' ='.
I.. ;. . .,0, := = . = -;_.. '''. - = .. ,==..=. 9th CW.01'10 Oct17,1969 ...--- '=====.ti.i.r:'=,=== --,.., = . ===:.,.' ' - i.r.i4,,, ei=W 1 ' 't0.4;;Th'li,t..,.F. '9,i'r,-.,i=:-.
, = ='' :;. . : . '' l'i i ::.'" ' :!...y. .': -;,:. .., ...
- i ',!.!Lh.,, .. r.,,, r; 7th Cir (Ind )Jun 04 194 :1,.'..,-,-,:-.'..,.....: :::.,,,, ==: ....:1,4.-.
,..,,....,.:,2õ.:,1õ.=,=41,..,....,..s.::...L.:õ........õ.:1,.....:r:.
...iiis.,_. ,.:.L.i.,_11-µ,.. 7,01:: ..1;.,. ....,-=,, 4.:P;=:...:,;===µ717.7:7'41*"! ."-.7"'"4.7.7..2.=:=J,..';'.?_:-===;:::Ef ati.11...=4=q====:===L.,kil.
I I I I
, PCT/us2()()6/()273()2 Slide 88 , ... .
, - ' '. ' ' ':'',,:,'...,-ttl.,,-.4.41 = - -../.. R..-t!--1. '":1[,, f,,.,' tt,itm=-, -' -'3,=,..zglj-4A.;-.. !,u....1,,=T.I.: -0.!.J .... .Z''..,,-r ..;:zo .
vi.z, rvoi sc::pir.s * ______________________ " - '4=ri 0: = µ5 ' '= ,Ir :;,.
= ,., ,,, 4,::!-, c., '. µ. -= , : .: ' 4µ"A 414: ' 4 .. ,.._. ....._ .
Move the second column as close to the first column until the cells collide;
. .
..
I .
. I N Williams v. U.S.
=1 .
91 S,Ct.1149 t" , I ..
I U.S.Arlz, Apr05,1971 I
I Affirming Judgment 418 F.2d 159 I ; .. .
Ia , ' =
0.. n a. _____ .I.
3 Granting Certiorari =I ' . . ' + ..
H Granting Certiorari r> Plackev v. U.S.
la U.S.Ariz. Mar 23, 1970 , 4 .
1.1.S.Ind. Dec 09, 1969 . . , = 91 S.Ct.1160 U.S.Ind. Apr 05,1971 =I
Z - ' ' ¨ = I , . , Affirming .1 mint4U1.21t1Q.
' ''''' - ,_,' '"-fr ' = = = ' I . . ' = 1 ;AA; . '' 1:)ttill tir, I,. = ,. , = - ' 4 t10.4-,,,K.1.11 ',-,,',....,, ,,,o,----. 4i .., ., - ,. ' - 1 ' , : '''-.' 'it,&,...,,,;,. ' ii. A, ',,,4441.0A
,e4eftii.Kilt.::,[0,4,....1.??4,,, , r ill 1,7gt ,,,,,...1, =-=:',',..,,,.. ' 1 ,,,4.gVc-tifi J',. ;,' - ., i...7.rt.NEwfm, ?- a = .-.,õ-:-', . ,.,..õ,A ;;A.
r....,:,,,A1-õ...õ, 1 c? Williams v. U.S. ' õ.,,,,,e ,i 1,- , t6 ,b,t:t'' t , ' , ',' õ,,,,,, .;4 11 ,.). .4.,,,=-pt, , ..., 4', 1.--, PlaCKeY
V. u.S. = .4* j :i.... C., a.,....õ1õ ,,ii:,,,,,X , 9th Cir.(Ariz.) Oct 17, 1969 , - . -,;-,.. ,:-, .1 -... ., .. ,. =
: :r. ,... . i . 411 F.26504 ,.,:r....,.::,.: ' . .
iST!..,,I.i' lir 1 ..1.
fi - ,,. - .I,. . ra1_7c::::=!t'QIIV;;;;,'=,:klit.L';'. :-.1,:',,'. ' ' , .. , . ...:.2 ' =.. . = . , ,-, 4, , _ ., -0 j,j, . . _=,. . :4.1,..au .4....a...
I I I

PCT/US2(1(16/(1273(12 Slide 89 = 1- - -.1or ..-, .1., ,.. i.,-,-, --,. . , - .,.. .,,,õ .
'al, -.,P..,3,:-..,1, -1- i-i.c) nels==3.1N1 , .....z;,.:-,;,,,,}1-,7P0.4...-- ,t A It.:44.-..
- .. ";,, -,t,=,'. tt, .. $...õ:..,:,. ... g. - ' AA/ IE Sir . ''' = , ''rr: ,.-,%, '''õ, ' ,., R ,' '44. . ' : = . I 1'-'?...i.' 1 . ., '.. "
= . .i''.,i4W1 v : . ' ' --'-' Now move the former third column as close to the second column as possible. . .
... I
t..,...
1111111 H __ Williams v, U.S.
91 S.Ct. 1148 U,S,Arit, Apr 05,1971 Affirming Judgment 418 F,2d 159 . .

, 0 7 .i %.
.
U
0 ' =
. E .
.a .
a . N Granting certiorari H Gr..t.or..
LI.S.Ariz. Mar 23, 1970 U.S.Ind. Dec 08, 1969 ' . = ' ' c> Mackey9ts.eti tvi U.S.
o 4 = U.8.1nd. Apr 05,1971 . ...= ,,,.., . -'; , Affirming Judgment 4i I 9,21504 ' ,.. - ' 't =-d.c.,-.. i:
418 F.2d 159 V4V;?1;',,l''j',,, l'=;71M-1, *.'",,I,,..1' d ti 1 . -= p. Williams v. U.S. , ; ,...,,., ,a,.......,:=:. ' 14.7C1 e $
µ;',:1740-1?"..,., , , 9tClr(A

h .rlz.) Oct17 , 1969 , ' . A,10,,:;,.;:tVr, -, ., ' , 's F , , , l> 411.9.26504 ,,,t,,,.^¨ Zit ''':iit,_ õ1;:i=
;0,4,'"." ...".0,,Ay -,',6,,. - . ,, . , , . . õL.
: :.,'-p,!-.1._4,..,41, aiet:r.ge..4,44,0443;1, 7tit Cir. nd Jun 04.1969 , ;.- .=....%Atirt,,,,04,,,,,te..=zi =
94 =

WO 2007/009054 PCT/US2(1(16/(1273(12 Slide 90 =
, . ., .: -..',,.., ; t.,4,,,,,A;iss 4.=,- - --ki ,'' µ-'-'''. ' " ' ol,fr.4,, 11_1_1 c:3, irseii,..4=,r,s1 ... ,, , =-,ft.:,,Njv,*'1i,,,,i;,',-,v.;:t.,'";,,,,,,,*- '''.,,,, ,i4'-',-',;',-;.;-', , iz,t = c. '..,,, ..,,,_ , =S, iprirt,--., ¨
,r .,,, - . 1 =. ''..q. .,1. . ,' ' (4) li i , :-,:s=I P li ,11 * C' =
n 4'..
,,,,,,....0i...,,..I.Jr,,.....,.. , . .1...,.
4),X.),41 Now move the former third column as close to the second column. as possible.
a 1 , ' , . . . M WilliaM$ V. U.S. I
91 8.Ct, 1148 = U.S.Arix. Apr 03, 1971 I
, Affirming Judgment 418yai1.22, =1 ' =
E
. I .
... , It. . 14 Grantina Certiorari N Ortntina Certiorari = I 91 S.Ct 1160 P 0.1NIS.VisiOs ' 1,0 U.S.Arizi Mar 23,1970 LI,S.Ind, Dec 08,1969 = . = . . . . ; 1 U.S.Ind. Apr 05,1971 . .
Affirming Judgment 411F
=
____________________________________________________________ I i '.
1 '1..
't =
...
418F.24 159 F-, Markey v. 11 S. ) i ,A..Irli; -4F-1,4,,W0V,Ith i .0 = ' , - 9th Clr.(Arit)Oct17, 1969 ,,, 411F:,'2,4 i I ,,,....V.:4 '0, ."1. , 41,, le Al v '"=,th`
-i, .,,, , ,21ce=.4 .
', - 0.j., 1 7c'l C , (Int ),, L. , = 1 I .., MY.) 4 .1.,k*4-', ,i',..*,,. = 11 I
=

, Slide 91 :
...,-- 7 , - ' : = 1 i !!';!: ,!d,11.':
);.;,-xrur, i EST
. , -..._ - " = - , n 1 ... ' . ' .
, ! , = !....= =
., , . = = .4 EVIL.
:': agailialeg=1111111111111111111111111111111111111111.
..
,....
' And the next column, etc . .
, Williams V. LI.S.
¨ 91S.Ct1148 .
õ
' U.S.Ariz. Apr 05, 1971 - I. ' it Affirming Judgment 418 F.2d 159 -1 ' t -.
z . c.) E
e . , .
.
õ . .
11 ¨H-intino-Ce 't-tior;:rial '. H
Granting Certiorari ' 1 = i i> Nackey v. us.
m ;
U.S.Ariz. Mar 23,1970 cA : U.S.Ind.Dec 08, 1959 91 S.Ct. 1160 4.1 ',P . ' .' ','. = , ': ' I = ... =
= U.S.Ind. Apr 05,1971 = , 2.' on i .:-',1' . ' ' . =
.1 Affirming Judgment 411 F.2d 504 :ir.L,,=!;i, -,,, -,,.
' ,'' : ' ' = : ='''''' '''' ..' === - = I -1....' ..'7.1.. ......f I. = = ,I,== , -:' ' .: = . :.:''..: t = ::::'::=', .: ' - .'.=-E:.- E.:. = . . 4 -=
,, = ' = -ri = , ; = ' '' = . 1,' ''''.4-44: .. =.4'''''''' ' '.
11'; : = ?- . .. .. ... ..!.;.";,'..,,,':=-,;',4.
.::."' I . = : - 4; r. . :::::-;:ir..."' , .. .
.L'i.",:i!!..;:': 1> William' s v. U.S. 1-1.'= 'C'...T::
' '',1= .. . :1:.- . L., ift.,,:':':':.-, .
,o, UV: 418 F.2d 159 ill . .,. = . .' :K., i> Mackey v. tI.S. 4 ..it ..i., 4.. :,..:_,,..

9,1,Cir.(Ariz.)Oct17,19,624: . = = . = .. t . , . = 11.
'ILI F.2d :504 1.... ; = ...... . ::-.Y.n.'Z,Ii. i.j:::,...,.:. =
= .. !:r:: . !". 4 A
. :: 7th Cir.(Ind.)Ju 04,1969 l ' 1.:,... 41,-.i, ' lil Fli" =
4 .. :- :- 'f.d.
L.-...Li,...,i,digit::-..=:11.2,,L: ;_,,!=.'-'-i!:',:..!:4-,-.-.... :1 --..a.t..I..,: - :,..:,........_,..=_:. ,= ..:=!_,- i.,!..2-..-.L.L...
= : = --- ' , , = = :.=,.P.rzfr!,4 - , I I
, Slide 92 = -,,,a, .
41 7,-,----T.-- - -, õ ?::,=
,,,,, ..,,..::::..,,,,,,,==
= =
... . 1 q,1 .0i, ,:,,,,, . --:: Ai: ==:., * .õ iror, - - -¨ 11 iqq, , : ,=-,r=-,-, :I -,--7, ----,---¨
Neves-I-- ;1' 1 ¨ __________________________ ,.. +' ____________________________ ' aIIIIIIIIIIIIIIIIIIIIIIIIIIIII
' And the next column, etc - . ..... _ . H Williams v. U.S.
91 S.Ct.1148 1 '.
U.S.ArizP
. A r 05, 1971 tt i A !firming Judgment 418 F.2d 159 I
¨

U

E . I
*: H Granting Certiorari ` 114 Granting CertioraCi >
Mackey v.111 U.S.Ariz. Mar 23, 1970 U.S.Ind. Dec 08, 1969 ' 91 S.Ct.1160 , 1 1U.S,Ind. Apr 05,1 Affirm 1 ing Judgment 411 ' ,.....,i - = ,--,z-, 4-':
,: .. . . .
._ .. . .
= ,,..-..t...: , .'d ¨
, . , ,...4j 7 '''µ ' `..i.' " = I> Williams 4 . ILLS. A.
,;' ,..P', =,..
't.. ...
it:4 t'l, ,õ'.,c:== 41 418 F.2d 159 .- ?4..ilackev v.11.5.
,t- 9th Cir.Oriz.) Oct17, 1969 f 1 411 F.2d 504 . , 144.
.... ..t.-; ! p :., il . ...i . ,,,:n=- 7 f, ' "Z',,, %:iii ' A,',.=.4 7th Cin(Ind)Jun 04,1969 ,,,,:1,..õ. , Tt, et=A; H , = !!. ,= . - i " : <:`,'7;J:(tir.. .i? , g0:, .7,5.,,i?T' 1 ,'Ne,' ' -::','= 4. :*: ...:-.. , / 2a. ¨ = . -.... -.. = ==-I,...dõ. ,:=.: ,,,1=1 r..,-.-,ii , ,, ..õiõ?..i 14.2,.: N,:, t=L5z.,:,...,..i i -I
, Slide 93 ,i..,..1 5i-44, ',1b1-111111A-11r, i; : gal;
''.:.
, =
-17" S-1111:ZY ^Al So KZ" r4i . .. '1..riir i'l :
)ic ______ 1.11,,11,1440;11.. Cl ii ,..
¨ ;I 10.1e,õ:v. s .P :1:1 ... i IPME t .: fi' 4 = . '' ' i:
i.lµg;:::*.y:/' .
..

10:=, A, ,,,,,--4-14411111111111MMIIIIIMIIIII
-, And finally we end with , , H Williams v. U.S. .
- 91 S.Ct.1148 U.S.Ari2, Apr05, 1971 t ' t : IAffirming Judgment 418 F.2d 159 0 0 ' (-4 a z. = , . õ . 4 .
1 I H Granting Certiorari i ' L I.J
H Granting Certiorari . I I> Mackey v. U.S.
U.S,Ariz. Mar 23, 1970 ^ .S.Ind . Dec 08,199 6 91 S.Ct.

r LF3 A= U.S.Ind. Apr 05,1971 '..
Affirming Judgment 411 F.2d504 .1 . . ..

--,õ - ,'.
? 1 .:--:,... ..1,-..., - ... . .... w-:. , , "'Po Williams 41 =1 = o iif,. = ' . :-=
,E: ci .f:µ,- 4.) -0.= 41.8F.2d 159 ,..i. ' P'' Mackey v.
U.S. ,,s 4J., ,= =tN- _ c..);
= -. , '1',1,:=rs-., zzi, z, , ,...i, ,µ: '7,=Fr., -..., ..,,:-. , 9th Cir.(A) oct 17,1969-3 ....,,,-, i- 411 R2d 504 , [;:, , fr,,f,:i= ;':
ill: 1: f . ' c ..!.0 TA.Zi-1 :.--;', ' - " . - ' ' "-' - ' '''' 'i 7th Cr(Ind)Jun Jun 04,1969 ,4. i:l'i= ,...,,V-,`.. ,:; :-.:p= :... ,AV.- õ=-., -!, .
t.i......, ..S.µ -.2..--= '.:': ''''':, '-'..1 ' .a... L.Sii'. . :.: 1.':::.L.j.. .2, ..:. :-_? = - ----...2._:' -::: ._...:.:_, ...... ...¶;.-.. ?..

, ' PCT/US2(1(16/(1273(12 Slide 94 =
-T1---14c: rvisicorsi -ThuvrvEs-r The first time we display an image, we shrink it to fit the screen Back to Full History (Text) I Show Neaative History I View all Citing Refs Monitor with KeyCite Alert Direct History for Miranda V. Arizona, 86 S.Ct. 1602 (Jun 13, 1966) = = = =
. . . , .
' ' ' r".":""iit.,...
= , .
-; =
=
=
, I ___ I .
" I=
,--.:7;,7.;ru =
' I 1 L.
= : = = õ,.
= '174.'"4`' ".
k:11 =
. ' - .
= '4' `i== =
ig A, '" - = -?:=,.1,01,11õ
= =,4...=1721,...;p,,, 01,;:"t=*414NZ;=.Siwa'trririe..... 4/'= .0g4Nituvoy Z.
KeyCite tntt- citation: . ' =
tj. Done j I.c?, Local Intranet.
=

Slide 95 -111-110 5.0:311I '11 41 I:' 4P'1` =
' ,=e _ It can get complex...

PCT/US2(1(16/(1273(12 =
Slide 96 471.- ,,i,,. :11,,,f6:0,..itql,Ni, = = = , '..'.4-iji'l,l'.'---- -';;''' ::, i:.
-U11-14=oPvell 'H. d Ni ' , Ã '1 ' 'T'X,:r , ,i' - .
- ,1 i::.=
* ____________________ ,... -- J , ;',:,,itl,) 4, ' `f== I , ' '.' Fest()-'-i'l','õili il1tt:,.:11:
!..=::'.1:;.:',... ti:: õ" ..:
:-. .;r: 14Yar .1:''.!:*1 .Li 44. ''.;.=,g.,.i!: =:: ' .....::::. == ''' :
','=q!l',1.:.,re:r-Lilt,:111,1111:!PIITrprilr,':-. - . . ... , .. . _ . .-.,,,LL_.:....tLLi.tj...,....iikft.,..t; '. .
_____________________ -.I .. . . =
= ____ II SeMainoldemulataftlasiatOs . . = liÃ
i"11""dt,ftimili - . = - . 4 ,.. ,1: = . , .
... _ .
, . = .. , , - .
.... ..=?.,, , .
I . . . .= .
. .
i-!-..-"=':',-.':=: ' ==':::::::.=:. i : ¨ . " - -:. . 7' '.- 7: = --, = = ".- '¨' 'i ....7 . - . ' -..
' ."..:.:'.'""'' ' -:T ,--n.. ".==71 =
=
. = . = - ¨
,..,.... .
. . .. . . , . . =
. r..? .. = - , , , . .
, .. I õ,õõ.õ
I.......................-. -.;,:!(il *.',.'..!:,:!..it.:-..,.. '.'... ' ',..-;..-.2-'::', 2. ' ,..'":,:- s',' ,1.."-.. ,,::.:.: ,!:: iirr -,,d.õ T14;;, - ;fr;,..-i-,....-,-,:;.
.4. . , :: . =:' ......1 . ,., = !....:,'..k,r,..,:ri:,- .....5.5 '.. ..-= .,- .: -,,...-..õ..: , ',.. . ,!-i,,'1,õ. .
1=14.011111 t 1 hisd.W=aula I . : .
. ' ' , '. ... 1 . , ;,, ,,.i.1,, 1. : .- , , , ' ': ' =-..bOtimAidairialtftthimINCLII, ---1'. , , , = ' . : , .
'.:.."'.4 ' . , . ' ..;
S: ::: :!'f .-: li'f':::-. I.:: ! ; ______ ' = : . . . -7 ' ==
' . :............=
1 .. . . . . . - . . - - = .
=
. . . :, . -.
=
= ,: " .!::, i -: ::'. - . '=`4.1x . ' ' ''. ' .
".' = ' ' ""' ::,/, . = =-, ' = '. . . - =
" ..-' . 5== ."---4,4.4'+, [=,, ii,.!::,i,li. ;====i, "....,=.,=:4.......,..=-=::.;...1.z...ii....,...;.....:..;!.1::4f-.LL17...=.-....,......i:....L...;:i,_,.........:6.:...:', =1,,., ::=.=,= ','".-. ".:., - .,,,e,=-'=.: ..... = "'.. , = ;'...,.....-.....:.=:;,'.,-: =::,:,=..:
ii=;:f.=,' '-=.:ijv , =."1:
' -...:,4' .,;'.'11 t...bal6134addas 612"It .b"."1"Ztlirir waustrAL - .:::'' -..1.,': :-,:"'- -..5. '. . ' .' ..,'. :
;' = .' ...='=.:.......k.S..71.4,11 ..,-,...,,,, L'.4.t.',. f=
I-=.-'....' s,-,'.,...i-----.2k -,-.^1-,--=,--=.,-.-.4.---""..i.'''.:', , :
:_. ===,,,_:,.:i.:.:,:i '1 :', - ' :' ,',..'Ite:ty=i;k:44:- ::"=.; le lY71.7.7. ,41.::,,..`,....'..,õ.C2"'"=,:':,=., .t.=.-;= '=-'''..: ',1.:==
.=;hi;'..,!,=:=,,',==,':i4, -",,...i4:14....,,,:lasi:,)14.,:.).'.
',41.0'0'...iiti.=-,.'::-::::,,i, '..*:-i.:11.71:41,!..1:...:.::i.;;;,.,i-iii 1... ---,P,1'4104w1t)Agrii,lijitifiloOliikki;'44iii-41.541itge,s*P1115,V,11.,*, ''.77'--iztA'I ' wi4,1i14,1,#.--lt,',-'1, ,, ...=,,,,,,r!,....t.ef...-4-.....-,-_-_,_.....2.....A.i.,7,,,,,i.,,,,,..!it--1...:.. "..I.Am1..,:fElk.,4.....,:".=!:::: ''KI=i--'1''',.= --A.e.i....,..1,./.:'.c..x.'-'.,An:j.- (:' -:,.A'-''',.,'-',"=I'',Ai.34,111-4!=-=
= __________________________________________________________________________ Slide 97 -4, =

-11-1-1141=11.rv1s.c>na kf VVICES-r Graphicll' fr 41iialW
Graphical KeyCite for statutes takes legislative research even further with a clear visual representation of statute versions and legislative history Slide 98 IftWestlaw I Research Trail The statutory credits are 4,1 "demystified" through clear it ....___ ;ite I Directory I Table of Contents I KeySearch I More presentation of ... iSCA 1 184 ____________________________________________ ;sion of nonimmigrantS
_ __ _....._......,,..,. .1z¨.4....f.Zai....0i1J.L,.;,, ':1, '_.' . -.,;..td .
Text NistorV DIst3laV- I Current Citing References I Monitor with KevCite Alert _______________________________________________________________________________ ____ _ Effective Effective Effective Effective Effective

12/19/2003 ' Prior Text Prior Text Prior Text Prior Text Current Text 3 USCA 1184 lo. 8 USCA 1184 ItIP 8 USCA 1184 pi. 8 USCA
1184 IP. 8 USCA 1184 ...Z.. ¨ I.1 I ..e."
._..._ , .
Amended by: Held Amended by: II Amended by: i Amended by:
Amended by: Pending Unconstitutional Legislation :
P.L. 107-45, P.L. 107-125 I Pl. 107-273 i Pl. 108-78, P.L.
108-193, By:
115 Stats.258, 115 Stets. 2403, '116 Stat. 1758 1117 Stats.970 '117 Stat. 2878 1. 2003 CONG US
SR 1424U,S. v. Hilton, HR 2278 ,HR 2215 1HR 2739 HR 2620 10/1/2001 363 F. 58 1(1/16/2002) 1(11/2/2002) I (9/3/2003) (12/19/2003) 108th Congress, 1 i 2d Session 1 I 1 I ¨ I
(12/7/2004) Cong. Record: Comm. Reports: Comm. Reports:
Bill Drafts: Bill Drafts: 2. 2003 CONG US
Senate Bills and House Report No, House Conf. Rep, Joint Resolutions 107-188 No. 107-685 2739, Enrolled Bill 2620, Enrolled Bill 108th Congress, approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) 2d Session President, (11/19/2004) 147 Cong. Rec, House Report No.2003 CONG US HR

H8246-01 107-696 2739 , Re ported in 2620, Received in (11/15/2001) (9/25/2002) __________________________________ Senate Cong. Record: House ( (7/22/2003) 11/6/2003) Message from the Anniversary of the House Report No.
House: reorganization of 107-125 2003 CONG US HR
147 Conq. Rec. the Senate (7/10/2001) Comm. Reports: 2620, Enorossed in S10151-01 Judiciary House (10/03/2001) Committee, House Report No, ______ (11/5/2003) 148 Cana. Rec. Cong. Record: 108-225(11) S670203 Bills and Joint (7/22/2003) I
Presidential (7/12/2002) Resolutions Comm. Reports:
Messages:House Report No, approved by the 108-229 House Reports No, Communicationof Statement by the President prior to (7/22/2003) from the Clerk sine die Press Secretary, t h e House: adj (9/29/2003) ournment, 1 2001 WL 1152894 148 Curio, Rae, 148 Cono. Rec. Cong.
Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential more,,. New Public Laws: TradeMessages:
,..,..,,,,,,,..,........----, 148 Cana. Rae. Implementation Statement by the I 01124-03 Act, 150 Conch Press Secretary io.......o.4.....14.1 ,, (11/7/2002) _ Rec. H5690-01 annl Vill '&,11 --' 7 .77; . -75:¨ r .:.

Slide 99 litWastlaw I Research Statute effective dates at the top of the display.
ite I Directory I Table of Contents I KeySearch _ ..., .,..i 8 1184. Admission of nonimmigrants Text History DiSOley I Current Citing References I Monitor with KeyCite Alert Effective Effective Effective Effective Effective Prior Text Prior Text Prior Text Prior Text Current Text 8 USCA 1184 PI' 8 USCA 1184 PP' 8 USCA 1184 p* 3 USCA
1184 pl. 8 USCA 1184 PP= , õe ___. ____________ I t. ."
______ ____ i Amended by: I Held Amended by: 1 i Amended by:
[Amended by: Amended by: 1 Pending 1 Unconstitutional Legislatioi Pl. 107-45, P.L. 107-125 . i PI, 107-273 . P,L, 108-78, PI, 108-193, 115 Stats,2581 ; BY: 115 Stats. 2403, i 1116 Stat.
1758 117 Stats.970 117 Stat, 2878 1.2003 CO
SR 1424U .S Hlt HR 2278 I I HR 2215 HR 2739 HR 2620 S

: . v, 10/1/2001 I 363 F.3di 5on,8 1(1/16/2002) ' I (11/2/2002) __________________________________ I I(9/3/2003) (12/19/2003) 108th Cong 2d Session .1 (12/7/2004:
Cong. Record: Comm. Reports: Comm. Reports:
Bill Drafts: Bill Drafts: 2.2003 CO
Senate Bills and House Report No. House Conf, Rep, Joint Resolutions 107-188 No, 107-685 2739, Enrolled Bill 2620, Enrolled Bill 108th Cong approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) 2d Session President,.
(11/19/200, 147 Com Rec. House Report No, 2003 CONG US HR

H8246-01 I 107-696 2739, Reported in 2620, Received in (11/15/2001) (9/25/2002) Senate Cong. Record: House (7/22/2003) (11/6/2003) Message from the Anniversary of the House Report No, House: reorganization of 107-125 2003 CONG US HR
147 Cong. Rec. the Senate (7/10/2001) Comm. Reports: 2620, Engrossed in S10151-01 Judiciary House (10/03/2001) Committee, House Report No. _______ (11/5/2003) 148 Conq, Rec, Cong. Record: 108-225(11) S6702-03 Bills and Joint (7/22/2003) Presidential (7/12/2002) Resolutions Comm. Reports:
Messages: , House Report No, approved by the 108-229 House Reports No.
Communicatiorknof President prior to 108-264 Statement by the (7/22/2003) from the Cle sine die Press Secretary, (9/29/2003) the House: adjournment, 2001 WL 1152894 148 Conq, Rec, 148 Cong. Rec. Cong.
Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential more... New Public Laws: Trade Messages:
¨4.-----------"'", 148 Corm. Rec. Implementation Statement by the I D1124-03 Act, 150 Conti. Press Secretary I p..pcifl.......K., I (11/7/2002) Rec. H5690-01 2003 1:10 27q7774s 4 .:"7" 7 ,!"-'77-7,...'" ¨ . ' ' , Slide 100 viltWWestlaw Current codified text along with prior versions ________________________________________________________________________ :rite 1 Directory 1 Table of Contents 1 K
rLumbiii,gmaromali,zidmaxiai,sandattruld .:...¨uedifirdZi,:iNotrialiiir 81.1SCA 1184 8 1184, Admission of nonimmigrants Text History Display I Current Citing References I Monitor with KevCite Alert Effective Effective Effective Effective Effeo ILIf lb/ LUU 4 1.1./lieUUZ WZ/ZULid l4illiL1TU..1 14/Z4 I I I ___________ I
Prior Text Prior Text Prior Text Prior Text I Current 8 USCA 1184 pi. 8 USCA '1184 pe. 8 USCA 1184 Po.
8 USCA 1184 pe. 8 USCA
...," N..,õ I I l . Amended by: Held Amended by: I Amended by: Amended by: I Amended by:
Unconstitutional , P.L. 107-45, P.L. 107-125 P.L. 107-273 P.L. 108-78, P.L. 108-193, By:
115 Stats,258, 115 Stats, 2403, 116 Stat. 1758 117 Stats,970 117 Stat, 2878 SR 1424US Hlton, HR 2278 HR 2215 HR 2739 HR 2620 i , v. i 10/1/2001 363 F.3d 58 (1/16/2002) (11/2/2002) (9/3/2003) (12/19/2003) ' _T_ _____ _ _____________ Cong. Record: Comm. Reports: Comm. Reports: Bill Drafts: Bill Drafts :
Senate Bills and House Report No, House Conf. Rep.

Joint Resolutions 107-188 No. 107-685 2739, Enrolled Bill 2620, Enrolled Bill approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) President, 147 Cong. Rec. House Report No.2003 CONG US HR

H8246-01 107-69639 R 2620, Received in epot ted in 27, (11/15/2001) (9/25/2002) _________________________________________ Senate Cong. Record: House 7/22/2003) (11/6/2003) ( Message from the Anniversary of the House Report No, House: reorganization of 107-125 2003 CONG US HR
147 Cong. Rec. the Senate (7/10/2001) Comm. Reports:
2620, Engrossed in S10151-01 Judiciary House (10/03/2001) Committee, House Report No. __________ (11/5/2003) ' 148 Cong. Rec, Cong. Record: 108 225(11) S6702-03 Bills and Joint (7/22/2003) Presidential (7/12/2002) Resolutions Comm.
Reports:
Messages: House Report No.
approved by the 1087229 House Reports No.
Communication President prior to 108-264 Statement by the (7/22/2003) from the Clerk of sine die Press Secretary,( 3) the House: adjournment, 2001 WL 1152894 148 Cong. Rec. 148 Cong. Rec. Cong. Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential =
more... New Public Laws: Trade Messages:
...--...õ--,-----,-----...,-...,--' 148 Cong. Rec. Implementation Statement by the I D1124-03 Act, 150 Cong.
Press Secretary (11/7/2002) Rec, H5690-01 2rtn9 Slide 101 '474Westlaw I
I
Clear association of amending laws Research Trail H
, with codified versions , .
_ -ite I Directory I Table of Contents I KeySearch I More ¨8 ilSCA 1184 9 1184, Admission of nonimmigrants Text History DiSOlay 1 Current Citing References I Monitor with KeyCite Alert - -Effective Effective Effective Effective Effective I I I I I
1 Prior Text Prior Text Prior Text Prior Text Current Text 8 USCA 1184 PO' 0 lil-.1-.. 1104 fi.,-- 0 ,..rw_,p, 1104 p- .
L.1.5,....Th 1104 II... p USLA 1104 r.
.1 I J... 2 "^N. ,.....
Amended by: Held Amended by: Amended by: Amended by:
Amended by: Pending Unconstitutiona P.L. 107-45, P.L. 107-125 P.L, 107-273 P.L. 108-78, P.L. 108-1931 tegislat on :
By:
115 Stats.2581 115 Stets, 2403, 116 Stat, 1758 117 Stats,970 117 Stat. 2878 1. 2003 ONG US
SR 1424 v. Hilton, HR 2278 , ; HR 2215 HR 2739 HR

U.S.
10/1/2001 1 363 F.3d 58 (1/16/2002) I (11/2/2002) (9/3/2003) (12/19/2003) 108th Co lgress, 2d Session (12/7/204) Cong. Record: Comm. Reports: Comm. Reports: Bill Drafts: Bill Drafts: 2. 2003 ( ONG US
Senate Bills and House Report No, House Conf, Rep. 2003 CONG US HR 2003 corqG US HR S 5413 Joint Resolutions , - . , . . ....:: = . . _ , .=
, . õ _ . .-,- 108th Co Aress, -approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) . ession President, (11/19/2004) 147 Cong, Rec. House Report No, 2003 CONG US HR

H8246-01 I 107-696 2739, Reported in 2620, Received in (11/15/2001) (9/25/2002) Senate Cong. Record: House 11/6/2003) ( (7/22/2003) Message from the Anniversary of the House Report No.
House: reorganization of 107-125 I 2003 CONG
US HR
147 Cong. Rec, the Senate (7/10/2001) Comm. Reports:
2620, Engrossed in 510151-01 Judiciary IHouse (10/03/2001) Committee, House Report No. (11/5/2003) I 148 Cong. Rec, Cong. Record:
Bills and Joint 105-225(11) (7/22/2003) I
Presidential (7/12/2002) Resolutions Comm. Reports:
House Report No.
Messages: approved by the 108-229 House Reports No, Communication President prior to (7/22/2003) 108-Statement by the from the Clerk of sine die (9/29/2003) Press Secretary, the House: adjournment, I
2001 WI_ 1152894 148 Cong, Rec. 148 Cong. Rec. Cong. Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential more... New Public Laws: Trade Messages:
.-----...--,-,...-.-----', 148 Cong, Rec. Implementation Statement by the I
131124-03 Act, 150 Cong. Press Secretary I Da..r.i.l.nfi al I (110/2002) Rec. H5690-01 ?nn 3 Virl Slide 102 Legislative history clearly associated with litWestlaw I Research Trail I Help relevant amending legislation and codified ¨
;tory I Table of Contents I KeySearcb More statute .. .
,mmigren ¨ ____________________________________________________ ts f- =
extHistory Display I 'Current Citing References I Monitor with KevCite Alert _________________________________________________________________________ ¨ __ . _________ . . ¨ ___________ Effective Effective Effective Effective Effective 1 1 i 1 ______________ 1 Prior Text Prior Text Prior Text Prior Text Current Text . i F
8 USCA 1184 Ilm. 8 USCA 1184 Pl. 8 USCA 1184 P. 8 USCA
1184p. 8 USCA 1184 POI` I 8 _____.

Amended by: Held ' Amended by: I Amended by: :
rA"mended by: Amended by: Pending Unconstitutional 1 P.L. 107-4E, I P.L. 107-125 1P.L. 107-273 P.L. 108-78, P.L.
108-193, Legislation:
By:
115 Stats.258, 1115 Stats. 2403, 1116 Stat. 1758 117 Stats.970 117 Stat, 2878 1.2003 CONG LIS
SR 1424 U.S Hilt iHR 2278 I HR 2215 HR 2739 HR 2620 . V . on, 10/1/2001 363 F.3d 58 (1/16/2002) 1(11/2/2002) (9/3/2003) (12/19/2003) 108th Congress, ____________________ . I 2d Session (12/7/2004) Cong. Record: Comm. Reports: Comm. Reports: Bill Drafts: Bill Drafts: 2. 2003 CONG US
Senate Bills and House Report No, House Conf, Rep. 2003 CONG

Joint Resolutions 107-188 No. 107-685 2739, Enrolled Bill 2620, Enrolled Bill 108th Congress, approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) . 2d Session President, (11/19/2004) 147 Conch Rec. House Report No, 2739, Reported in 2620, Received in (11/15/2001) ____________________ (9/25/2002)= Senate Cong. Record: House 11/6/2003) ( (7/22/2003) Message from the Anniversary of the House Report No.
House: reorganization of 107-125 1 2003 CONG
US HR
147 Conch Rec. the Senate (7/10/2001) Comm. Reports:
2620, Engrossed in S10151-01 Judiciary IHouse (10/03/2001) Committee, House Report No. (11/5/2003) 1 148 Cong, Rec, Cong. Record: 108-225(11) (7/22/2003) 1 S6702-03 Bills and Joint Presidential (7/12/2002) Resolutions Comm. Reports:
Messages:
a House Report No.
approved by the 108-229 House Reports No, Communication President prior to 108-264 Statement by the (7/22/2003) from the Clerk of sine die Press Secretary, (9/29/2003) 2001 'OIL 11E2894 the House: adjournment, I
148 Cong. Rec, 148 Conch Rec. Cong. Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential more... New Public Laws: Trade Messages:
......-,..õ.õ...----,--..õ-,--,, 148 corm. Rec. Implementation Statement by the I D1124-03 Act, 150 Cong, Press Secretary .01 " "11, 7 -- ...1.imm......44..m .v.../............i..1,1,14 .14.1411a.1..........,,. ¨
..,,L.V. 115690"W - -- ---777- - ., . .
747-4.
7- -.:7^;!!t -=
Slide 103 14.1,,,,suat...,t I Jlesearch Trail I
Unconstitutional/Preemption .
.
postings clearly associated with -ite I Directory I Table of Contents I KeySearett LkAore relevant statutory versionI 1SCA 1 184 ________________________________________ ;sion of nonimmigrants ... ¨ ..
Text History Display tag-rent Citing References I Monitor with KeyCite Alert ¨ ___________________________ ¨
Effective Effective Effective Effective Effective 10/1/2001- 1/1.6/2002- 11/2/2002 9/3/2003- 12/19/2003 Prior To=-* Hew Text Prior Text Prior Text Current Text I
8 US L'A 1184 p. 8 JSCA 1184 p. 8 USCA 1184 p.. 8 USCA 1184 p. 8 USCA 1184 p. i I
__ _......2.1 _____________ _ ________ I ________ I I _____ ..." .___..
. ,-- .
Amended by: Held Aniended by: Amended by: Amended by:
i Amended by: Pending Unconstitutional Legislation :
PI, 107-45, P.L 107-125 P.L. 107-273 P.L. 108-78, P.L.
108-193, B
115 Stats.259, y: 11 E Stats. 2403, 1 116 Stat. 1758 =117 Stats.970 117 Stat. 2878 0.2003 CONG US
SR 1424 HR 2278 1 HR 2215 HR. 2739 HR 2620 S 3031 U.S. v. HilMn, 1.0/1/2001 363 F.3d 58 (1,46/2002) i (11/2/2002) , (9/3/2003) (12/19/2003) 108th Congress, 2d Session __ .---1-- ¨ _____ I ______________________________________ ......,......
I I¨ (12/7/2004) Cong. Record: COTM. Reports: Comm. Reports: Bill Drafts:
Bill Drafts: 2. 2003 CONG US
... ___________________ Senate Bills and House Report No. House Conf. Rep. 2003 CONG US

Joint Resolutions 107-188 No, 107-685 2739, Enrolled Bill 2620, Enrolled Bill 108th Congress, approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) 2d Session President, (11/19/2004) 147 Cong. Rec. House Report No. ____________________ 2003 CONG US HR

I _______________________________ 107-696 2739. Reported in 2620, Received in (11/15/2001) (9/25/2002) Senate Cong. Record: tioits_e. (11/6/2003) (7/22/2003) Message from the Anniversary of the House Report No.
House: reorganization of 107-125 I 2003 CONG US
HR
147 Cong. Rec. the Senate (7/10/2001) Comm. Reports: 2620, Ennmssed in 510151-01 Judiciary iHouse Report No, House (10/03/2001) Committee, (11/5/2003) I 148 Conch Rec. Cong. Record: 108-225(11) (7/22/2003) I
56702-03 Bills and Joint Presidential (7/12/2002) Resolutions Comm. Reports:
Messages:ication House Report No.
approved by the House Reports No, Commun President prior to 108-264 Statement by the (7/22/2003) from the clerk of sine die Press Secretary, (9/29/2003) 2001 WL 1152894 the House: adjournment, I
148 Conch Rec, 148 Conti. Rec, Cong. Record:

I
, (6/21/2002) (12/16/2002) United States-Australia Free Presidential more... New Public Laws: Trade Messages:
-------------"'-------' 148 Cono. Rec. Implementation Statement by the I _______________________________ D1124-03 Act, 150 Cong, Press Secretary (11/7/2002) Rec. H5690-01 7003 Ito 27977z45 .. õõ._ , 4t, , Slide 104 'illtWestlaw I Research Trail I
Pending Legislation and Future Text ~....14R1...:'^.....' -.. 4,,, _______________________________________ Welcome I Find I KeyCite I Directory I Table of Contents I KevSearch I More ... . _. . .õ õ

13 USCA 1184 8 1.1.84. Admission of nonimMiorents Text History Display I Current Citine References I Monitor with KevCite Alert Effective Effective Effective Effective Effective Prior Text Prior Text Prior Text Prior Text 'Current lext 8 USCA 1184 P. 8 USCA 1184 Pt 8 USCA 1184 p 8 USCA 1184 Pt 8 USCA 1 84 P.
..e..:
---------- V
t Amended by: Held Amended by: I I Amended by: I Amended by: Amended by: Pending Unconstitutional Legislation:
PA.. 107-45, Pt. 107-125 I i P .1_, 107-273 I Pt. 108-78, P.L.
108-193, By:
115 Stats.258, 115 Stets. 2403 H116 Stat, 1758 1117 Stats.970 117 Stat. 2878 .1.2003 CONG US
SR 1424 HR 2278 ' I HR 2215 I HR 2739 HR 2620 Hilton, 10/1/2001 (1/16/2002) 1 1(11/2/2002) j (9/3/2003) 1(12/19/2003) 108th Congress, 363 F,3d 58 , . 2d Session ,..._ ¨I ___________ _.........
-I-- I 1 ----r--- ,(12/7/2004) Cong. Record: comm. Reports: Comm. Reports: Bill Drafts:
Bill Drafts: , 2. 2003 CONG LIS
Senate Bills and House Report No. House Conf, Rep. 2003 CONG US

Joint Resolutions 107-188 No, 107-685 2739, Enrolled Bill 2620, Enrolled Bill 108th Congress, approved by the (8/2/2001) (9/25/2002) (7/31/2003) (12/9/2003) 2d Session President, (11/19/2004) 147 Cong. Rec. House Report No. 2003 CONG US HR 2003 CONG
US HR , 118246-01 I 107-696 2739, Repott ed in 2620, Received in (11/15/2001) (9/25/2002) Senate Cong. Record: 11 t_e____ise 7/22/2003) (11/6/2003) ( Message from the Anniversary of the House Report No.
House: reorganization of 107425 I 2003 CONG US
HR ' 147 Conch Rec, the Senate (7/10/2001) Comm. Reports: _____ 2620, Engrossed in 510151-01 Judiciary IHouse (10/03/2001) Committee, House Report No. (11/5/2003) I
148 Conch Rec. Cong. Record: 108-2251M
S670203 Bills and Joint (7/22/2003) I
Presidential (7/12/2002) Resolutions Comm. Reports:
essages:
M House Report No. House Repo approved by the 108-229 Reports No.
Communication President prior to 108-264 Statement by the (7/22/2003) from the Clerk of sine die (9/29/2003) Press Secretary, the House: adjournment, I __ 2001 WL 1152894 148 Cong. Rec. 148 Cong, Rec. Cong. Record:

(6/21/2002) (12/16/2002) United States-Australia Free Presidential more... New Public Laws: Trade Messages:
...--,...-----.......õ...,, 148 Cong. Rec. Implementation Statement by the I 01124-03 Act, 150 Cona. Press Secretary In....ciao...M.1.i . I (11/7/2002) Rec. H5690-01 7003 WI 729777,15 ,,, ,.õ,.., ¨ . .tit#

Graphical Key Cite for Cases Case Box Layout ......................................................... 111 Procedural Motion Box Layout ............................................ 111 Scenarios ............................................................... 112 Summary of Rules ........................................................ 145 Case Box Layout icon Short Title Citation Court Line Date File Line or UPO
File Line or UPO
History Treatment Citation Histoty Treatment Citation Procedural Motion Box Layout [icon] History Treatment Court Line Date [KeyCited Case Box]

Scenarios Legend:
Full Case = UPPER CASE = A
lower case = procedural motion = a 1 Scenario:
A->B: A is a parent of B 1 A & B are in court 1 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from A
the bottom of the box.
2 Scenario:
A -> B: A is a parent of B 1 A -> C: A is a parent of C
A, B & C are in court 1 Rules: ¨t¨ ¨A¨

= Parents are centered below their children.
= Non-remand relationship A
arrows should enter from the bottom of the box.

3 Scenario:
A -> B: A is a parent of B 1 A -> C: A is a parent of C
A -> D: A is a parent of D
A, B, C &D are in court 1 A
Rules:
= Parents are centered below their children. A
= When there is a T
intersection between a parent and child, the bottom vertical line will be offset.
4 Scenario:
A -> B: A is a parent of B 1 A -> C: A is a parent of C
D -> B: D is a parent of B
A, B, C &D are in court 1 -A-A- A
Rules:
= Parents are centered below their children. A
= Non-remand relationship arrows should enter from the bottom of the box.
Scenario:
A -> B: A is a parent of B 1 B is in court 1 A is in court 2 Rules: =

= Parents are centered below A
their children.
= Non-remand relationship >
arrows should enter from the bottom of the box.

6 Scenario:
A -> B: A is a parent of B 1 A -> C: A is a parent of C
B & C are in court 1 A is in court 2 A

Rules:
= Parents are centered below A
their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
7 Scenario:
A -> B: A is a parent of B 1 A -> C: A is a parent of C
C is in court 1 A & B are in court 2 - A

Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will A
occur in the court level of the parent.
8 Scenario:
A -> B: A is a parent of B
A -> C: A is a parent of C
C is in court 1 B is in court 2 A is in court 3 õ
2.
Rules:
= Parents are centered below their children.
= Non-remand relationship 3 f arrows should enter from the A
bottom of the box.
= The relationship split will occur in the court level of the parent.

9 Scenario:
A->B: A is a parent of B 1 B->C: B sends case down to C
B is in court 1 A & C are in court 2 A
Rules:
= Parents are centered below 2 their children.
= Non-remand relationship A
arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
Scenario:
A->B: A is a parent of B 1 B->C: B sends case down to C
B->D: B sends case down to D
B is in court 1 ---A, C & D are in court 2 A
A (01/01/00) B (02/01/00) 2=
C(03/01/00) *
D (04/01/00) A
Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= When there is more than one case sent down from a single parent, the line from the right of the parent will continue on to accommodate the additional cases.

11 Scenario:
A->B: A is a parent of B 1 B->C: B sends case down to C
C->D: C is a parent of D
B & D are in court 1 A & C are in court 2 A (01/01/00) B (02/01/00) 2 C(03/01/00) A
D (04/01/00) Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.

12 Scenario:
A->B: A is a parent of B 1 B->C: B sends case down to C
C->D: C is a parent of D
C->E: C is a parent of E
B, D & E are in court 1 A
A & C are in court 2 A (01/01/00) 2 B (02/01/00) C(03/01/00) A
D (04/01/00) Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.
13 Scenario:
A->B: A is a parent of B 1 A->C: A is a parent of C
B->C: B is a parent of C
B is in court 1 A
A & C are in court 2 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.

14 Scenario:
A->B: A is the parent of B 1 A & B's relationship is "Appeal A
after Remand"
A & B are in court 1 Rules:
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.

15 Scenario:
A->B: A is the parent of B 1 A & B's relationship is "Appeal after Remand"
A is in court 2 B is in court 1 2 --Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= When the parent and child's relationship is on the Lateral Litigation list, but they are not in the same court level the Lateral Litigation will not be used to determine the placement.

16 Scenario:
A->B: A is the parent of B 1 A->C: A is the parent of C
A & B's relationship is "Appeal after Remand"
A & C's relationship is "Appeal after Remand" A
A, B & C are in court 1 Rules:
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.

17 Scenario:
A->C: A is a parent of C 1 B->C: B is a parent of C
C is in court 1 A & B are in court 2 AA
Rules:
= Parents are centered below their children.
= Non-remand relationship A
arrows should enter from the bottom of the box.
= If a parent cannot be centered below a child, it will be offset below a child.

18 Scenario:
A->D: A is a parent of D 1 B->D: B is a parent of D
C->D: C is a parent of D
D is in court 1 t A, B & C are in court 2 Rules:
= Parents are centered below their children.
= Non-remand relationship C B A
arrows should enter from the bottom of the box.
= If a parent cannot be centered below a child, it will be offset below a child.

19 Scenario:
A->E: A is a parent of E
B->E: B is a parent of E 1 C->E: C is a parent of E
D->E: D is a parent of E
E is in court 1 A A A __ =
A, B, C &D are in court 2 Rules:
= Parents are centered below their children.
= Non-remand relationship D C B A
arrows should enter from the bottom of the box.
= If a parent cannot be centered below a child, it will be offset below a child.
= The width of the child will expand to the point necessary in order for all of it's parents relationships to be drawn.

20 Scenario:
A->B: A is a parent of B 1 B->C: B is a parent of C
A->C: A is a parent of C
C is in court 1 ' __ #
B is in court 2 A is in court 3 2 Rules:
= Parents are centered below their children.
= Non-remand relationship A
arrows should enter from the bottom of the box.
= When the parent would need to go around one child to get to another it will be offset.

21 Scenario:
A->B: A is a parent of B 1 B->C: B is a parent of C
A->C: A is a parent of C
I ____________________________________________________________ A A
D->C: D is a parent of C
D->A: D is a parent of A
C is in court 1 B is in court 2 2 A is in court 3 B
D is in court 4 A
- õ -Rules:
= Parents are centered below A
their children.
õ.
= Non-remand relationship 'A
arrows should enter from the e , bottom of the box= .
When the parent would need õ
to go around one child to get D
to another it will be offset.
__________________________________________________ ,

22

23 Scenario:
A->b: A is a parent of b b is in court 1 1 A is in court 2 ¨A
¨

Rules:
= Parents are centered below their children.
= Non-remand relationship 2 arrows should enter from the A
bottom of the box.

24 Scenario:
A->b: A is a parent of b 1 A->c: A is a parent of c A, b & c are in court 1 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box. A
= Motions for the same parent in the same court level are stacked on top of each other.

25 Scenario:
A->b: A is a parent of b 1 A->c: A is a parent of c c 1 b & c are in court 1 A is in court 2 b 1 Rules: A
= Parents are centered below their children.
= Non-remand relationship A
arrows should enter from the bottom of the box.
II Motions for the same parent in the same court level are stacked on top of each other.

26 Scenario:
A->b: A is a parent of b A->c: A is a parent of c A->d: A is a parent of d b & c are in court 2 d is in court 1 A is in court 3 Rules:.
= Parents are centered below their children. 4 = Non-remand relationship A
, arrows should enter from the , bottom of the box.
= Motions for the same parent in the same court level are stacked on top of each other.

27 Scenario:
A->b: A is a parent of b 1 A->c: A is a parent of c A, b & c are in court 1 A (01/01/00) b (02/01/00) c (03/01/00) Rules:
= Parents are centered below A
their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Motions for the same parent in the same court level are stacked on top of each other = Stacked procedural motions are ordered with the earliest on the bottom and the latest on the top.

28 Scenario:
A->b: A is a parent of b 1 A->c: A is a parent of c A, b & c are in court 1 A(01/01/00) b (02/01/00) c (02/01/00) Rules:
= Parents are centered below their children. A
= Non-remand relationship arrows should enter from the bottom of the box.
= Motions for the same parent in the same court level are stacked on top of each other = When procedural motions have the same date, they are stacked in whatever order we receive them.

29 Scenario:
A->b: A is a parent of b 1 A->c: A is a parent of c A->d: A is a parent of d d is in court 1 A, b & c are in court 2 A (01/01/00) b (02/01/00) d(03/01/00) c (04/01/00) Rules:.
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Motions for the same parent in the same court level are stacked on top of each other.
= Stacked procedural motions are ordered with the earliest on the bottom and the latest on the top.
= When ordering the children from left to right, an entire stack of procedural motions takes on the date of its earliest member.

30 Scenario:
A->b: A is a parent of b 1 b->c: b is a parent of c A->d: A is a parent of d d is in court 1 2 A, b & c are in court 2 A (01/01/00) b(02/01/00) d (03/01/00) c (04/01/00) Rules:
= Parents are centered below A
their children.
= Non-remand relationship arrows should enter from the bottom of the box.
II The relationship split will occur in the court level of the parent

31 Scenario:
A->c: A is a parent of e with 1 history treatment of x.
B->c: B is a parent of c with history treatment of y. A t A, B & c are in court 1 A
A (01/01/00) B (02/01/00) c (03/01/00) Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= If a procedural box has different history treatments to display, it shall be promoted to a substantive full case box.

32 Scenario:
A->B: A is a parent of B 1 A->C: A is a parent of C
C is in court 1 A & B are in court 3 A
Rules: 2 = Parents are centered below their children.
= Non-remand relationship arrows should enter from the =
bottom of the box.
= The relationship split will occur in the court level of the parent - z .1

33 Scenario:
A->B: A is a parent of B 1 A->C: A is a parent of C
A (01/01/00) B (02/01/00) C(03/01/00) ¨A-- --A¨
A, B, &C are in court 1 Rules:
= Parents are centered below A
their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The children will be in order with the earliest child on the left and the latest child on the right.

34 Scenario:
A->B: A is a parent of B 1 A->C: A is a parent of C
D->C: D is a parent of LA
D (01/01/00) A (02/01/00) 1 B (03/01/00) D B
C (04/01/00) A, B, C &D are in court 1 Rules:
= Parents are centered below A
their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= If a parent cannot be centered below a child, it will be offset below a child = The children will be in order with the earliest child on the left and the latest child on the right.

35 Scenario:
C->E: C is a parent of E 1 C->D: C is a parent of D
B->E: B is a parent of E
B->C: B is a parent of C AA
A->B: A is a parent of B
A->D: A is a parent of D
A, B, C, D & E are in court 1 A (01/01/00) B (02/01/00) -C (03/01/00) D (04/01/00) E (05/01/00) Rules:
n Parents are centered below their children.
= Non-remand relationship 13 arrows should enter from the bottom of the box.
If a parent cannot be centered below a child, it will be offset below a child A
a The children will be in order with the earliest child on the left and the latest child on the right.
= When lines need to cross their will be a bump on the horizontal line at the point where the lines cross.

36 Scenario (Miranda - 86 sct Rules:
1602): = Parents are centered below their children.
A->B: A is a parent of B = Non-remand relationship arrows should enter from A->c: A is a parent of c the bottom of the box.
A->d: A is a parent of d = When there is a T intersection between a parent B->e: B is a parent of e and child, the bottom vertical line will be offset.
B->f: B is a parent off = The relationship split will occur in the court level B->g: B is a parent of g of the parent.
B->h: B is a parent of h = The width of the child will expand to the point B->i: B is a parent of i necessary in order for all of it's parents B->P: B is a parent of P relationships to be drawn.
K->l: K is a parent of 1 = Motions for the same parent in the same court K->P: K is a parent of P level are stacked on top of each other.
J->m: J is a parent of m = Stacked procedural motions are ordered with the J->P: J is a parent of P earliest on the bottom and the latest on the top.
0->n: 0 is a parent of n = When procedural motions have the same date, they 0->P: 0 is a parent of P are stacked in whatever order we receive them.
P->q: P is a parent of q = When ordering the children from left to right, an entire stack of proaedural motions takes on the A and J are in court 3 date of its earliest member.
B,c,d,e,f,g,h,K, and 0 are in = The children will be in order with the earliest child court 2 on the left and the latest child on the right.
i,l,m,n,P and q are in court 1 fAA ________________________________________________ A
i 1 A A

--A-- A
=
= :; = = ;
, - ': =
*PP "
=
A
. . . = = = . ?õ, ________

37 Scenario (Festo - 172 F.3d 1361): Rules:
A->E: A is a parent of E = Parents are centered below their children.
A->J: A is a parent/great-grandparent of J = Non-remand relationship arrows should B->E: B is a parent of E enter from the bottom of the box.
B->J: B is a parent/great-grandparent of J = When there is a T intersection between a B->C: B is a parent of C parent and child, the bottom vertical line D->E: D is a parent of E will be offset.
E->F: E is a parent of F = The relationship split will occur in the E->G: E is a parent/grandparent of G court level of the parent.
E->H: E is a parent/grandparent to H = Cases sent down will start with a line F->G: F is a parent of G from the right of the case to the top of the F->H: F is a parent of H case sent down to.
F->J: F is a parent of J = When there is more than one case sent H->I: H is a parent of I down from a single parent, the line from H->J: H is a parent / sibling of J the right of the parent will continue on to J->k: J is a parent of k accommodate the additional cases.
J->L: J is a parent of L = Parents that have a line coming into the L->M: L is a parent of M top of the case will have a line coming M->N: M is a parent of N out of the right that will then connect to N->o: N is a parent of o it's children.
N->p: N is a parent of p = If a parent cannot be centered below a child, it will be offset below a child.
F, k, L, p & 0 are in court 1 = Motions for the same parent in the same E, G, H, I, J, M & N are in court 2 court level are stacked on top of each C & D are in court 3 other.
A & B are in court 4 = Stacked procedural motions are ordered with the earliest on the bottom and the A (12/00/1973) latest on the top.
B (10/12/1982) = When procedural motions have the same C (04/12/1982) date, they are stacked in whatever order D (02/03/1994) we receive them.
E (12/14/1995) = When ordering the children from left to F (03/17/1997) right, an entire stack of procedural G (06/09/1997) motions takes on the date of its earliest H (04/19/1999) member.
1(08/20/1999) = The children will be in order with the J (11/29/2000) earliest child on the left and the latest k (06/18/2001) child on the right.
L (05/28/2002) M (09/20/2002) N (09/26/2002) o (04/19/2004) p (04/19/2004) 1 ______ D
F ________________________________________ k L ____ o A A A A , 2 .. ________ v ______________________________________________ I - N , ..

, .
' #
. 1 , , M, . . . , '.
- G H
, . . . , . , .
t '' ' 4 ' : .
=
, .
..
, . .
.. . , .
,.. . õ
E
, .. , . , . .
. .
, = . , .
.
..

, ,... = ..... = , .
= ,, 0.51 V
Ir __________________________________ . = gS' efri - ,, ..' .
l',.../1 = , A. N.
, C D
,.
, =
=t, ; -:-.=, .-,.
..
's 4 r- .: ''' ' - ,-..
..
= .-,: - ., A =I'' i litd:i 1, = -;.i'-, -t. ...."...'. . ......3=A 4..-' f:- . -.' -,-i-i -...-A
xi \ :1-,,`- `-- ;,-. :;-:. . 4 /..:', ' -' . :4., ,....- 4,4.
!,- , ,= t] % . . = . :c41- fi.,. E. =,-..,. = 2.': .1 -- - '-=
'N.' '...'"i=-.' ,..,..^.
Ski, q=
= ..i:2r,-- ..4": 1!.. t, ,, .:1:-- ...,.
.t.' .!--,?;:t= ¨1:,ti, 7..i. :.4' ''-`''' - ''... ''-''.
..;...,,:, = , fc-, ' ' i =,,4,ie -=:, = ,., = ..S.:::, . , 14,.''. 4:'=':'', g-.....õ ...:='-,.;$, I ; ;,i ,..i.,t.... 5...: ,....,,t_ .,.... - ,.
.1.: "=7'. ' E, '.:;.! . '1;1'; 4. . n .
:. =' . 1-!,.... =-=,J.::,,, ;,.:',..,;.-7- -cif. -... '--.:
, -j.:. -A,K 1,,..i!.:6,-.: i; n-.,;,..,,, ,,i,..1.,,õ3, :.1-0,, .. ,ii .. .-.._. , . ',.;". ,,,_. .
.õ_,.., ........,.... ::: ..õ..,:' ---..''.;k,. ' ''.',.=:::,,,,, . _ ... .,...:. ,,.., ,. ;.--... ...,..f.,,:.,:.......
2.1.,k11;lii:P?:',!: U...- VA

38 Scenario (Habeas - 666 NYS2d 463): 1 ____ A -> b: A is a parent of b A -> C: A is a parent of C
C -> D: C is a parent of D
D -> E: D is a parent of E
E -> F: E is a parent of F
C -> F: C is a parent of F 2 b & C are in court level 1 A E ___ A & E are in court level 2 D & F are in court level 3 A
A (Dec 1997) 3v _____________________________________________________________ -b (Mar 1998) DF
_ C (Dec 1998) N
D (Jun 2003) 7:: 'i7Y, = 4Z ___ 3 E (Oct 2004) F (Dec 2004) Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= When there is more than one case sent down from a single parent, the line from the right of the parent will continue on to accommodate the additional cases.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.
= The children will be in order with the earliest child on the left and the latest child on the right.

39 Scenario (CPC international 777 Fsupp 549): 1 A -> B: A is a parent of B
A -> D: A is a parent of D
B -> C: B is a parent of C
B -> D: B is a parent of D
D ________________________________________ -> e: D is a parent of e -D -> F: D is a parent of F
D -> G: D is a parent of G
D -> H: D is a parent of H A A --A-F -> I: F is a parent of I
I -> J: I is a parent of J 2 e, F, G & H are in court 1 B, C, D & I are in court 2 A & J are in court 3 A (Aug 1991) C c D
B (Jul 1995) C (Oct 1995) D (May 1997) e (Dec 1997) F (Jun 8, 1998) G (Jun 15, 1998) H (Jun 15, 1998) I (Jun 17, 1998) J (Nov 2001) A
Rules:
= Parents are centered below their children.
^ Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= When ordering the children from left to right, an entire stack of procedural motions takes on the date of its earliest member.
= The children will be in order with the earliest child on the 14403 61tvlittlest child on the right. 135 _

40 Seenario(583 So2d 276):
A -> B: A is a parent of B 1 B-> c: B is a parent of c B -> D: B is a parent of D
A -> E: A is a parent of E
E -> F: E is a parent of F A =
E -> g: E is a parent of g B & D are joined by a lateral B _____ litigation phrase A & E are joined by a lateral A __ litigation phrase 3 1, c & g are in court 1 D
B is in court 2 A, D, E & F are in court 3 "
A (Aug 3, 1990) ____________________________________________ -__________________________________________________________________ -;
B (Apr 11, 1991) ' , c (Mar 2, 1992) A _________________ E
D (Aug 14, 1998) E (Dec 16, 2003) . V- =
F (Feb 18, 2004) g (Oct 4, 2004) Rules:
= Parents are centered below = Parents will be drawn to the left of a child, their children, when they are in the same court level and there = Non-remand relationship relationship is on the Lateral Litigation list.
arrows should enter from the = The children will be in order with the earliest bottom of the box. child on the left and the latest child on the right.
* The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.

41 Scenario (125 SCt 82): Rules:
B -> A: B is a parent of A = Parents are centered below their children.
C -> A: B is a parent of A = Non-remand relationship arrows should enter from D -> A: B is a parent of A the bottom of the box.
E -> A: B is a parent of A = If a parent cannot be centered below a child, it will F -> A: B is a parent of A be offset below a child.
G -> A: B is a parent of A = The width of the child will expand to the point H -> A: B is a parent of A necessary in order for all of it's parents I -> A: B is a parent of A relationships to be drawn.
J -> A: B is a parent of A = The children will be in order with the earliest child K -> A: B is a parent of A on the left and the latest child on the right.
L -> A: B is a parent of A
M -> A: B is a parent of A
N -> A: B is a parent of A
0 -> A: B is a parent of A
P ->A: B is a parent of A
Q -> A: B is a parent of A
R -> A: B is a parent of A
S ->A: B is a parent of A
T -> A: B is a parent of A
U ->A: B is a parent of A
V -> A: B is a parent of A
W -> A: B is a parent of A
X -> A: B is a parent of A
Y -> A: B is a parent of A
Z -> A: B is a parent of A
AA -> A: B is a parent of A
BB -> A: BB is a parent of A
A is in court level 1 B, C, D, F, G, H, I, J, K, L, M, N, 0, P, Q, R, S, T, U, V, W, X, Y, Z, AA & BB are in court level A
flA=A=AAAAAAA=AAAAAAAAAA=AA
___ , 'BCDEFGHIJKLMNOPQUAIITIEVICEE111113FIBB

=

42 Scenario (2002 WL 485700):

A->B: A is a parent of B
A->C: A is a parent of C
C->D: C is a parent of D
D->E: D is a parent of E
C & D are joined by a lateral 2 v litigation phrase A (Mar 2002) B (May 2002) C (2003) D (June 2004) E (Nov 2004) C & D are in court level 1 A, B & E are in court level 2 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.
= The children will be in order with the earliest child on the left and the latest child on the right.

43 Scenario (212 Fsupp2d 1319):
A->B: A is a parent of B 1 B->C: B is a parent of C
C->D: C is a parent of D
A->D: A is a parent of D
B & C are joined by a lateral 2 litigation phrase B D
C & D are joined by a lateral litigation phrase A A
A(2002) B (Apr 2003) C (Dec 2003) A
D (2004) _ C is in court level 1 B & D are in court level 2 A is in court level 3 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.
= If a parent cannot be centered below a child, it will be offset below a child.
= The children will be in order with the earliest child on the left and the latest child on the right.

44 Scenario(320 F3d 1073):

A->B: A is a parent of B
B->C: B is a parent of C
A & B are joined by a lateral litigation phrase B & C are joined by a lateral 2 litigation phrase A
A (2003) B (2004) C (2005) =
B is in court level 1 A & C are in court level 2 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.
= The children will be in order with the earliest child on the left and the latest child on the right.

45 Scenario(179 BR 264):
A->B: A is a parent of B 1 A->C: A is a parent of C
D->B: D is a parent of B
D->C: D is a parent of C
A (1995) B(2001) C (2004) D (1996) -1---A--B & C are in court level 1 A & D are in court level 2 A D
Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= The relationship split will occur in the court level of the parent.
= The children will be in order with the earliest child on the left and the latest child on the right.

46 Scenario (923 P2d 197):
A->b: A is a parent of b 1 A->C: A is a parent of C
C->D: C is a parent of D
D->E: D is a parent of E =
A->E: A is a parent of E

A & C are joined by a lateral litigation phrase D & E are joined by a lateral litigation phrase A & E are joined by a lateral A
E -litigation phrase :
A(1995) = =:1 __ b(1997) D
C (2001) D(2002) "
'''..A1Aff Hi; 141 t1,1' E(2004) r _________________________________________________________ i.= õi'l!!!!i:
ALM I
AAR: C __ b is in court level 1 55::
õ.
- A, D& E are in court level 3 õ
C are in court level 4 Airs,5457-mmilogrogcrt191:,:v4;:Aii, 2-4.5 -Rules:
=
Parents are centered below = Parents will be drawn to the left of a child, when their children, they are in the same court level and there = Non-remand relationship relationship is on the Lateral Litigation list.
arrows should enter from the = A case has remanded Child and a lateral bottom of the box. litigation child there should have two lines = Cases sent down will start coining out of the right of the box.
with a line from the right of the case to the top of the case sent down to.
= When there is more than one case sent down from a single parent, the line from the right of the parent will continue on to accommodate the additional cases.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.

47 Scenario(1998 WL 1285714):
A->B: A is a parent of B 1 B->C: B is a parent of C
C->D: C is a parent of D
C->E: C is a parent of E
F->B: F is a parent of B
B & C are joined by a lateral 2 litigation phrase C & D are joined by a lateral litigation phrase C & E are joined by a lateral litigation phrase A(1998)' A F , B(2001) C (2002) D (Nov 20, 2002) E (Nov 20, 2002) , -F (2000) C is in court level 1 B, D& E are in court level 2 A & F are in court level 3 Rules:
= Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= When there is more than one case sent down from a single parent, the line from the right of the parent will continue on to accommodate the additional cases.
= The children will be in order with the earliest child on the left and the latest child on the right.

Summary of Rules = Parents are centered below their children.
= Non-remand relationship arrows should enter from the bottom of the box.
= When there is a T intersection between a parent and child, the bottom vertical line will be offset.
= The relationship split will occur in the court level of the parent.
= Cases sent down will start with a line from the right of the case to the top of the case sent down to.
= When there is more than one case sent down from a single parent, the line from the right of the parent will continue on to accommodate the additional cases.
= Parents that have a line coming into the top of the case will have a line coming out of the right that will then connect to it's children.
= Parents will be drawn to the left of a child, when they are in the same court level and there relationship is on the Lateral Litigation list.
= If a parent cannot be centered below a child, it will be offset below a child.
= The width of the child will expand to the point necessary in order for all of it's parents relationships to be drawn.
= When the parent would need to go around one child to get to another it will be offset.
= Motions for the same parent in the same court level are stacked on top of each other.
= Stacked procedural motions are ordered with the earliest on the bottom and the latest on the top.
= When procedural motions have the same date, they are stacked in whatever order we receive them.
= When ordering the children from left to right, an entire stack of procedural motions takes on the date of its earliest member.
= The children will be in order with the earliest child on the left and the latest child on the right.
= When lines need to cross their will be a bump on the horizontal line at the point where the lines cross.
= If a procedural box has different history treatments to display, it shall be promoted to a substantive box.
= A case has remanded Child and a lateral litigation child there should have two lines coming out of the right of the box.
= Only stack procedural motions that have a common single parent.

=
Highlights Beyond Citation Checking: Graphical KeyCite Paints a Picture of Procedural Case History A picture is worth a thousand words. For legal researchers, the powerful, new Graphical KeyCite may be worth even more because it literally illustrates the procedural history of case law.
Thomson West, a business within The Thomson Corporation (NYSE: TOC;
TSX: TOC) today introduced Graphical KeyCite, the latest innovation to KeyCite , the service that has revolutionized citation checking since it was first introduced.
In that year, law librarians at the American Association of Law Libraries applauded the intuitive KeyCite flags that instantly let legal researchers know whether a judicial opinion was still good law, as well as the depth-of-treatment stars and symbols that indicated how extensively the case had been relied on in other opinions. KeyCite also was the first citation checking service to enable researchers to effortlessly probe the history of a case.
Graphical KeyCite takes these innovations to a new plateau by literally painting a picture of a case's direct history. The feature links citations to later motions, pleadings and lower-court decisions as the case ascends to higher courts. This exclusive KeyCite feature helps researchers to instantly see how a case moved through the court system over time, and to quickly understand the impact at each level.

"For the first time, the history of the court case is illustrated, helping researchers understand the impact faster," said Jon Medin, director of Product Development for KeyCite.
Medin added that KeyCite combines analysis from legal editors at Thomson West with technology to illuminate issues such as how much the citing case discusses the cited case. "The same attorney-editors who author West's extensive collection of authoritative case law headnotes also assign the KeyCite flags and symbols attorneys and the judiciary rely on to see whether citations are still good law," noted Medin.
Documents on Westlaw include more links to related sources than any other legal research service. Medin noted that Graphical KeyCite leverages those links and uses proprietary technologies to illustrate the connections between court documents as they move through the judicial system. Additionally, researchers can simply click icons to open the full-text documents on Westlaw.
"In our tests, researchers using Graphical KeyCite understood the direct history of cases faster and more accurately," said Mike Bernstein, senior director of Westlaw Marketing for Thomson West. "For anyone performing citation research, a Graphical KeyCite picture is definitely worth a thousand words."
While the foregoing has been with reference to a particular embodiment of the invention, it will be appreciated by those skilled in the art that changes in this embodiment may be made without departing from the principles of the invention, the scope of which is defined by the appended claims.

Claims (17)

The embodiments of the invention in which an exclusive property or privilege is claimed are defined as follows:

1. A computer-implemented method for indicating legal case histories, the method comprising the steps of:
using a processor to identify occurrences of a piece of text having a predetermined format in a textual document;
using the processor to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in a database;
receiving a request from a client access device for the legal case history for a piece of formatted text in the textual document;
using the processor to search the database based on the request and to retrieve the requested legal case history from the database; and indicating the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case;
wherein the indicating step includes displaying the legal case history on an output device in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.

2. The method of claim 1, wherein the at least one related case comprises at least one of a child case and a lateral litigation case.

3. The method of claim 1 or 2, wherein the visual indicator is an arrow.

4. The method of any one of claims 1 to 3, further comprising positioning the graphical representations within one of a plurality of designated court-level zones, with each court-level zone representing a tier of a court system.

5. The method of any one of claims 1 to 4, wherein the step of displaying the legal case history further comprises displaying a case validity indicator adjacent to each graphical representation in the graphical flow chart.

6. The method of any one of claims 1 to 5, wherein the step of displaying the legal case history further comprises embedding a hyperlink within the graphical representation for each parent case and related case, wherein the embedded hyperlink is selectable to initiate retrieval of a corresponding legal case document.

7. The method of any one of claims 1 to 6, wherein the step of displaying the legal case history further includes automatically positioning the graphical representation of the parent case and the graphical representations of the related cases in the graphical flow-chart format according to a set of rules.

8. The method of claim 7, wherein the set of rules includes the following rule: when the parent case has one or more related cases that are children to the parent case, and where the parent and child cases were decided in different courts, the graphical representation of the parent case is positioned below the graphical representations of the child cases.

9. The method of claim 7, wherein the set of rules includes the following rule: when the parent case has one or more related cases that are children to the parent case, and where the parent and child cases were decided in the same court, the graphical representation of the parent case is positioned to the left of the graphical representations of the child cases.

10. The method of claim 7, wherein the set of rules includes the following rule: when the parent case has more than one child case, the graphical representations of each child case will be positioned by date of decision, with the earliest child on the left and the latest child on the right.

11. A computer system for retrieving legal case histories, the computer system comprising:
a server computer having a processor and interfacing with a database;
a client access device interfacing with the server computer; and an output device interfacing with server computer;
wherein the processor is configured to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in the database;
wherein the server computer is configured to receive a request for the legal case history from the client access device;
wherein the processor is further configured to search the database based on the request and to retrieve the requested legal case history from the database;
wherein the output device is configured to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case; and wherein the output device is further configured to display the legal case history in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.

12. The system of claim 11, wherein the at least one related case comprises at least one of a child case and a lateral litigation case.

13. The system of claim 11 or 12, wherein the output device is further configured to display the graphical representations within one of a plurality of designated court-level zones, with each designated court-level zone representing a tier of a court system.

14. The system of any one of claims 11 to 13, wherein the output device is configured to automatically position the graphical representation of the parent case and the graphical representation of the related cases in the graphical flow-chart format according to a set of rules.

15. The system of claim 14, wherein the set of rules includes the following rule: when the parent case has one or more related cases that are children to the parent case, and where the parent and child cases were decided in different courts, the graphical representation of the parent case is positioned below the graphical representations of the child cases.

16. The system of claim 14, wherein the set of rules includes the following rule: when the parent case has one or more related cases that are children to the parent case, and where the parent and child cases were decided in the same court, the graphical representation of the parent case is positioned to the left of the graphical representations of the child cases.

17. A computer program product comprising a computer useable medium having control logic stored therein for indicating legal case histories, said control logic comprising:
first computer readable program code means for causing the computer to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing the legal case history in a database;
second computer readable program code means for causing the computer to receive a request from a client access device for the legal case history for a piece of formatted text in the textual document and to search the database based on the request and to retrieve the requested legal case history from the database; and third computer readable program code means for causing the computer to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case;
wherein the third computer readable program code means is further adapted to cause the computer to display the legal case history on an output device in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases.