# US 2026/0094320 A1 · Generation of interactive node graph showing process states

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

- Number: US 2026/0094320 A1
- Document ID: US20260094320A1
- Status: Published application
- Kind: A1
- Application number: 18/901,140
- Filed: 2024-09-30
- Published: 2026-04-02
- Earliest claimed: 2024-09-30
- Assignees: Oracle International Corporation
- Applicants: Oracle International Corporation
- Inventors: Haiyan Wang; Qiu Zhong; Michael Patrick Rodgers
- Web page: https://patentgrep.com/patent/US20260094320A1

## CPC

- G06T 11/26: Drawing of charts or graphs
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 16/26: Visual data mining; Browsing structured data
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06T 2200/24: involving graphical user interfaces [GUIs]
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems, methods, and computer-readable media are provided for generating an interactive node graph showing process states. A data management system accesses a data structure that includes a set of candidate process records representing a plurality of candidate process states, where each candidate process record represents a candidate process state and one or more sequentially connected candidate process states. The data management system generates an interactive node graph that includes nodes, each node representing a candidate process state. The interactive node graph includes edges representing candidate connections between candidate process states. The data management system causes display of the interactive node graph. The data management system receives input modifying settings for displaying the interactive node graph and causes display of an updated interactive node graph using the settings as modified.

## Claims

### Claim 1

A computer-implemented method comprising:
accessing a data structure comprising a set of candidate process records representing a plurality of candidate process states, wherein each candidate process record of a plurality of candidate process records from the set of candidate process records represents a candidate process state and one or more sequentially connected candidate process states; wherein at least one candidate process state of the plurality of candidate process states represents a particular candidate process state and two or more sequentially connected candidate process states;
generating an interactive node graph comprising a plurality of nodes, each node of the plurality of nodes representing a candidate process state of the plurality of candidate process states; wherein the interactive node graph comprises a plurality of edges representing a plurality of candidate connections between candidate process states of the plurality of candidate process states; wherein a particular node corresponding to the particular candidate process state is connected to two or more other nodes corresponding to the two or more sequentially connected candidate process states using two or more edges;
causing display of the interactive node graph;
receiving input modifying one or more settings for displaying the interactive node graph; and
causing display of an updated interactive node graph based at least in part on the one or more settings as modified.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, further comprising:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a first status code and a second status code;
parsing the ledger of data to determine a first status that is not yet recorded in the data structure;
recording, in the data structure, the first status code as a candidate process state;
recording, in the data structure, the second status code as a sequentially connected candidate process state;
generating the data structure comprising a set of candidate process records.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, further comprising:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a status code;
determining a metric to be a number of entries within the ledger of data with a status code equivalent to a specified status code;
causing concurrent display of the metric with the interactive node graph in association with a graph element corresponding to the specified status code.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, further comprising:
parsing the ledger of data for an entry containing a new status code or new sequentially connected candidate process state that is not represented in the interactive node graph;
generating a new graph element representing the new status code or new sequentially connected candidate process state.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the one or more settings for displaying the interactive node graph are modified to graphically distinguishing the new graph element.

### Claim 6 (depends on 3)

The computer-implemented method of claim 3, further comprising:
receiving input modifying one or more settings for displaying the metric; and
causing concurrent display of an updated metric with the interactive node graph in association with a graph element corresponding to the status code based at least in part on the one or more settings as modified.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, wherein the input modifying one or more settings for displaying the metric is a time period for filtering the data used to calculate the metric, wherein each entry of the plurality of entries further comprises a time code, and wherein the computer-implemented method further comprises:
determining a new valued for the metric to be a number of entries within the ledger of data with a status code equivalent to a specified status code and with a time code within the time period.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein a remote data source is stored in association with one or more data source access parameters, the computer-implemented method further comprising:
sending a request to the remote data source using the one or more data source access parameters to retrieve an aggregation of occurrences of a specified candidate process state; and
causing display of at least one graph element representing the aggregation of occurrences of the specified candidate process state.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the two or more sequentially connected candidate process states comprise a first sequentially connected candidate process state and a second sequentially connected candidate process state, and wherein the first sequentially connected candidate process state is indicated as a default sequentially connected candidate process state, and wherein the computer-implemented method further comprises:
changing display of an edge representing a connection between the particular node of the particular candidate process state and a sequential node representing the first sequentially connected candidate process state based on the first sequentially connected candidate process state being a default sequentially connected candidate process state.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the computer-implemented method further includes causing one or more changes to a selected candidate process record of the set of candidate process records based at least in part on a user input to the interactive node graph altering a graph element representing the selected candidate process record.

### Claim 11

A computer-program product comprising one or more non-transitory machine-readable storage media, including stored instructions configured to cause a computing system to perform a set of actions comprising:
accessing a data structure comprising a set of candidate process records representing a plurality of candidate process states, wherein each candidate process record of a plurality of candidate process records from the set of candidate process records represents a candidate process state and one or more sequentially connected candidate process states; wherein at least one candidate process state of the plurality of candidate process states represents a particular candidate process state and two or more sequentially connected candidate process states;
generating an interactive node graph comprising a plurality of nodes, each node of the plurality of nodes representing a candidate process state of the plurality of candidate process states; wherein the interactive node graph comprises a plurality of edges representing a plurality of candidate connections between candidate process states of the plurality of candidate process states; wherein a particular node corresponding to the particular candidate process state is connected to two or more other nodes corresponding to the two or more sequentially connected candidate process states using two or more edges;
causing display of the interactive node graph;
receiving input modifying one or more settings for displaying the interactive node graph; and
causing display of an updated interactive node graph based at least in part on the one or more settings as modified.

### Claim 12 (depends on 11)

The computer-program product of claim 11, wherein the set of actions further comprises:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a first status code and a second status code;
parsing the ledger of data to determine a first status that is not yet recorded in the data structure;
recording, in the data structure, the first status code as a candidate process state;
recording, in the data structure, the second status code as a sequentially connected candidate process state;
generating the data structure comprising a set of candidate process records.

### Claim 13 (depends on 11)

The computer-program product of claim 11, wherein the set of actions further comprises:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a status code;
determining a metric to be a number of entries within the ledger of data with a status code equivalent to a specified status code;
causing concurrent display of the metric with the interactive node graph in association with a graph element corresponding to the specified status code.

### Claim 14 (depends on 13)

The computer-program product of claim 13, wherein the set of action further comprises:
parsing the ledger of data for an entry containing a new status code or new sequentially connected candidate process state that is not represented in the interactive node graph;
generating a new graph element representing the new status code or new sequentially connected candidate process state.

### Claim 15 (depends on 11)

The computer-program product of claim 11, wherein the set of actions further comprises causing one or more changes to a selected candidate process record of the set of candidate process records based at least in part on a user input to the interactive node graph altering a graph element representing the selected candidate process record.

### Claim 16

A system comprising:
one or more processors;
one or more non-transitory computer-readable media storing instructions, which, when executed by the system, cause the system to perform a set of actions comprising:
accessing a data structure comprising a set of candidate process records representing a plurality of candidate process states, wherein each candidate process record of a plurality of candidate process records from the set of candidate process records represents a candidate process state and one or more sequentially connected candidate process states; wherein at least one candidate process state of the plurality of candidate process states represents a particular candidate process state and two or more sequentially connected candidate process states;
generating an interactive node graph comprising a plurality of nodes, each node of the plurality of nodes representing a candidate process state of the plurality of candidate process states; wherein the interactive node graph comprises a plurality of edges representing a plurality of candidate connections between candidate process states of the plurality of candidate process states; wherein a particular node corresponding to the particular candidate process state is connected to two or more other nodes corresponding to the two or more sequentially connected candidate process states using two or more edges;
causing display of the interactive node graph;
receiving input modifying one or more settings for displaying the interactive node graph; and
causing display of an updated interactive node graph based at least in part on the one or more settings as modified.

### Claim 17 (depends on 16)

The system of claim 16, wherein the set of actions further comprises:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a first status code and a second status code;
parsing the ledger of data to determine a first status that is not yet recorded in the data structure;
recording, in the data structure, the first status code as a candidate process state;
recording, in the data structure, the second status code as a sequentially connected candidate process state;
generating the data structure comprising a set of candidate process records.

### Claim 18 (depends on 16)

The system of claim 16, wherein the set of actions further comprises:
accessing a ledger of data comprising a plurality of entries representing a change in status for one or more items within a process, wherein each entry comprises a status code;
determining a metric to be a number of entries within the ledger of data with a status code equivalent to a specified status code;
causing concurrent display of the metric with the interactive node graph in association with a graph element corresponding to the specified status code.

### Claim 19 (depends on 18)

The system of claim 18, wherein the set of action further comprises:
parsing the ledger of data for an entry containing a new status code or new sequentially connected candidate process state that is not represented in the interactive node graph;
generating a new graph element representing the new status code or new sequentially connected candidate process state.

### Claim 20 (depends on 16)

The system of claim 16, wherein the set of actions further comprises causing one or more changes to a selected candidate process record of the set of candidate process records based at least in part on a user input to the interactive node graph altering a graph element representing the selected candidate process record.
