# US 2022/0277158 A1 · System and method for efficient creation and incremental updating of representations of email conversations

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

- Number: US 2022/0277158 A1
- Document ID: US20220277158A1
- Status: Published application
- Kind: A1
- Application number: 17/187,116
- Filed: 2021-02-26
- Published: 2022-09-01
- Earliest claimed: 2021-02-26
- Assignees: Cs Disco, Inc.
- Applicants: Cs Disco, Inc.
- Inventors: Levi Jonathan Bucao; Peter Anthony Lee; Ajay Guyyala
- Web page: https://patentgrep.com/patent/US20220277158A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/93: Document management systems
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments as disclosed include document analysis systems that may obtain email data collected or obtained from email servers from one or more source systems and build a graph of the emails, where the nodes of the email graph represent data about an email and the edges in the graph between the nodes of the graph are determined based on metadata associated with the emails or the text content of the emails. These email graphs may be quickly and efficiently updated as new email data is obtained such that the document analysis systems may organize emails into conversations for utilization by users in reviewing these emails in context.

## Claims

### Claim 1

A system for document analysis, comprising:
a processor;
a data store, having an email graph; and
a non-transitory computer readable medium instructions for incrementally updating the email graph, by:
obtaining email data;
determining an incremental graph comprising a set of nodes representing emails and edges representing relationships between the emails, the determination of an incremental graph comprising:
determining a first node for the incremental graph, wherein the first node represents a first email determined from the obtained email data;
adding the first node to the incremental graph;
determining one or more edges for the incremental graph, wherein the one or more edges include at least one edge determined by:
determining a candidate edge for the incremental graph based on a comparison of first text of the first email to second text of a second email represented by a second node in the email graph or the incremental graph; and
adding the candidate edge to the incremental graph as one of the one or more edges;
starting with the one or more edges in the email graph, traversing the email graph to determine a related set of nodes and a related set of edges of the email graph to add to the incremental graph, wherein the related set of nodes and a related set of edges of the email graph are directly or indirectly related to the one or more edges; and
adding the related set of nodes and related set of edges determined from the email graph to the incremental graph;
traversing the incremental graph to identify a set of conversations in the incremental graph, each of the set of conversations comprising a subgraph of the incremental graph; and
updating the identified set of conversations in the email graph based on the incremental graph to incrementally update the email graph based on the obtained email data.

### Claim 2 (depends on 1)

The system of claim 1, wherein the data store comprises a columnar data store.

### Claim 3 (depends on 2)

The system of claim 2, wherein the data store is part of a database system comprising a database system including a database engine, wherein the incremental graph is determined at least partially using the database engine.

### Claim 4 (depends on 1)

The system of claim 1, wherein the email graph comprises a raw graph and a simplified graph, and the incremental graph comprises an incremental raw graph and an incremental simplified graph.

### Claim 5 (depends on 4)

The system of claim 4, wherein the incremental simplified graph is determined by collapsing the nodes and edges of the incremental raw graph.

### Claim 6 (depends on 5)

The system of claim 5, wherein the incremental simplified graph is traversed to identify the set of conversations in the incremental graph.

### Claim 7 (depends on 6)

The system of claim 6, comprising traversing the subgraph of each conversation to identify each node of the conversation for the subgraph that represents an inclusive email.

### Claim 8

A method for document analysis, comprising:
storing an email graph; and
incrementally updating the email graph, by:
obtaining email data;
determining an incremental graph comprising a set of nodes representing emails and edges representing relationships between the emails, the determination of an incremental graph comprising:
determining a first node for the incremental graph, wherein the first node represents a first email determined from the obtained email data;
adding the first node to the incremental graph;
determining one or more edges for the incremental graph, wherein the one or more edges include at least one edge determined by:
determining a candidate edge for the incremental graph based on a comparison of first text of the first email to second text of a second email represented by a second node in the email graph or the incremental graph; and
adding the candidate edge to the incremental graph as one of the one or more edges;
starting with the one or more edges in the email graph, traversing the email graph to determine a related set of nodes and a related set of edges of the email graph to add to the incremental graph, wherein the related set of nodes and a related set of edges of the email graph are directly or indirectly related to the one or more edges; and
adding the related set of nodes and related set of edges determined from the email graph to the incremental graph;
traversing the incremental graph to identify a set of conversations in the incremental graph, each of the set of conversations comprising a subgraph of the incremental graph; and
updating the identified set of conversations in the email graph based on the incremental graph to incrementally update the email graph based on the obtained email data.

### Claim 9 (depends on 8)

The method of claim 8, wherein the data store comprises a columnar data store.

### Claim 10 (depends on 10)

The method of claim 10, wherein the data store is part of a database system comprising a database system including a database engine, wherein the incremental graph is determined at least partially using the database engine.

### Claim 11 (depends on 8)

The method of claim 8, wherein the email graph comprises a raw graph and a simplified graph, and the incremental graph comprises an incremental raw graph and an incremental simplified graph.

### Claim 12 (depends on 11)

The method of claim 11, wherein the incremental simplified graph is determined by collapsing the nodes and edges of the incremental raw graph.

### Claim 13 (depends on 12)

The method of claim 12, wherein the incremental simplified graph is traversed to identify the set of conversations in the incremental graph.

### Claim 14 (depends on 13)

The method of claim 13, comprising traversing the subgraph of each conversation to identify each node of the conversation for the subgraph that represents an inclusive email.

### Claim 15

A non-transitory computer readable medium comprising instructions for document analysis, comprising instructions for:
storing an email graph; and
incrementally updating the email graph, by:
obtaining email data;
determining an incremental graph comprising a set of nodes representing emails and edges representing relationships between the emails, the determination of an incremental graph comprising:
determining a first node for the incremental graph, wherein the first node represents a first email determined from the obtained email data;
adding the first node to the incremental graph;
determining one or more edges for the incremental graph, wherein the one or more edges include at least one edge determined by:
determining a candidate edge for the incremental graph based on a comparison of first text of the first email to second text of a second email represented by a second node in the email graph or the incremental graph; and
adding the candidate edge to the incremental graph as one of the one or more edges;
starting with the one or more edges in the email graph, traversing the email graph to determine a related set of nodes and a related set of edges of the email graph to add to the incremental graph, wherein the related set of nodes and a related set of edges of the email graph are directly or indirectly related to the one or more edges; and
adding the related set of nodes and related set of edges determined from the email graph to the incremental graph;
traversing the incremental graph to identify a set of conversations in the incremental graph, each of the set of conversations comprising a subgraph of the incremental graph; and
updating the identified set of conversations in the email graph based on the incremental graph to incrementally update the email graph based on the obtained email data.

### Claim 16 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the data store comprises a columnar data store.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein the data store is part of a database system comprising a database system including a database engine, wherein the incremental graph is determined at least partially using the database engine.

### Claim 18 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the email graph comprises a raw graph and a simplified graph, and the incremental graph comprises an incremental raw graph and an incremental simplified graph.

### Claim 19 (depends on 18)

The non-transitory computer readable medium of claim 18, wherein the incremental simplified graph is determined by collapsing the nodes and edges of the incremental raw graph.

### Claim 20 (depends on 19)

The non-transitory computer readable medium of claim 19, wherein the incremental simplified graph is traversed to identify the set of conversations in the incremental graph.

### Claim 21 (depends on 20)

The non-transitory computer readable medium of claim 20, comprising traversing the subgraph of each conversation to identify each node of the conversation for the subgraph that represents an inclusive email.
