# US 2026/0073144 A1 · Field data framework

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

- Number: US 2026/0073144 A1
- Document ID: US20260073144A1
- Status: Published application
- Kind: A1
- Application number: 19/326,050
- Filed: 2025-09-11
- Published: 2026-03-12
- Earliest claimed: 2024-09-11
- Assignees: Schlumberger Technology Corporation
- Applicants: Schlumberger Technology Corporation
- Inventors: Yuan Wang; Neelansh Garg; Monisha Manoharan
- Web page: https://patentgrep.com/patent/US20260073144A1

## CPC

- G06F 40/289: Phrasal analysis, e.g. finite state techniques or chunking
- G06F 40/40: Processing or translation of natural language (natural language analysis G06F40/20; semantic analysis G06F40/30)
- G06T 11/26: Drawing of charts or graphs
- G06T 2200/24: involving graphical user interfaces [GUIs]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A method can include receiving input text associated with field operations at a field site that includes at least one well in fluid communication with a reservoir; assessing the input text with respect to one or more criteria to generate one or more chunks of text from the input text; directing the one or more chunks of text and a prompt to a large language model to generate corresponding output; and transforming the corresponding output into a graph structure, where the graph structure includes nodes and edges, and where each of the edges describes a relationship between a pair of the nodes.

## Claims

### Claim 1

A method comprising:
receiving input text associated with field operations at a field site that comprises at least one well in fluid communication with a reservoir;
assessing the input text with respect to one or more criteria to generate one or more chunks of text from the input text;
directing the one or more chunks of text and a prompt to a large language model to generate corresponding output; and
transforming the corresponding output into a graph structure, wherein the graph structure comprises nodes and edges, and wherein each of the edges describes a relationship between a pair of the nodes.

### Claim 2 (depends on 1)

The method of claim 1, wherein the one or more criteria comprise a text length criterion associated with a text length limit of the large language model.

### Claim 3 (depends on 1)

The method of claim 1, wherein the one or more chunks comprise multiple chunks.

### Claim 4 (depends on 3)

The method of claim 3, wherein the multiple chunks comprise sequential chunks wherein each pair of sequential chunks comprises an overlap.

### Claim 5 (depends on 4)

The method of claim 4, wherein the overlap provides for contextual continuity.

### Claim 6 (depends on 3)

The method of claim 3, comprising reaggregating the corresponding output of the multiple chunks using a reaggregation prompt.

### Claim 7 (depends on 6)

The method of claim 6, comprising submitting the corresponding output and the reaggregation prompt to the large language model to generate unified output or to another large language model to generate unified output.

### Claim 8 (depends on 7)

The method of claim 7, transforming the unified output into the graph structure.

### Claim 9 (depends on 1)

The method of claim 1, wherein the input text comprises text in one or more documents.

### Claim 10 (depends on 1)

The method of claim 1, wherein the input text comprises text recognized in one or more documents via application of text recognition to the one or more documents.

### Claim 11 (depends on 1)

The method of claim 1, wherein the input text comprises text generated from one or more graphics in one or more documents.

### Claim 12 (depends on 1)

The method of claim 1, comprising storing the graph structure to a database.

### Claim 13 (depends on 12)

The method of claim 12, comprising submitting a query to the database for generation of a result.

### Claim 14 (depends on 13)

The method of claim 13, wherein the generation of the result utilizes one or more large language models to process the query.

### Claim 15 (depends on 1)

The method of claim 1, wherein the input text comprises digital data text received responsive to performance of one or more of the field operations.

### Claim 16 (depends on 15)

The method of claim 15, comprising dynamically adapting the graph structure based at least in part on additional digital data text.

### Claim 17 (depends on 1)

The method of claim 1, comprising controlling one or more of the field operations using the graph structure.

### Claim 18 (depends on 1)

The method of claim 1, comprising generating instructions for rendering the graph structure to a display as part of an interactive graphical user interface.

### Claim 19

A system comprising:
a processor;
a memory operatively coupled to the processor; and
processor-executable instructions stored in the memory and executable to instruct the system to:
receive input text associated with field operations at a field site that comprises at least one well in fluid communication with a reservoir;
assess the input text with respect to one or more criteria to generate one or more chunks of text from the input text;
direct the one or more chunks of text and a prompt to a large language model to generate corresponding output; and
transform the corresponding output into a graph structure, wherein the graph structure comprises nodes and edges, and wherein each of the edges describes a relationship between a pair of the nodes.

### Claim 20

One or more computer-readable storage media comprising processor-executable instructions executable by a system to instruct the system to:
receive input text associated with field operations at a field site that comprises at least one well in fluid communication with a reservoir;
assess the input text with respect to one or more criteria to generate one or more chunks of text from the input text;
direct the one or more chunks of text and a prompt to a large language model to generate corresponding output; and
transform the corresponding output into a graph structure, wherein the graph structure comprises nodes and edges, and wherein each of the edges describes a relationship between a pair of the nodes.
