# US 2026/0099543 A1 · Object relationship analysis using force-directed graphs based on object metric values

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

- Number: US 2026/0099543 A1
- Document ID: US20260099543A1
- Status: Published application
- Kind: A1
- Application number: 18/909,950
- Filed: 2024-10-09
- Published: 2026-04-09
- Earliest claimed: 2024-10-09
- Assignees: Sap SE
- Applicants: Sap SE
- Inventors: Christoph Kommer; Wei-Yi Chen
- Web page: https://patentgrep.com/patent/US20260099543A1

## CPC

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

## Abstract

Disclosed techniques provide improved relationship evaluation for computing objects, including to provide improved resource management. First metric values for object instances of a first set of a plurality of object instances of an object type are received. A graph data structure with nodes holding identifiers and metric values is instantiated. Directed edges are generated between nodes using the metric values, and edge weights are assigned based on these values. A graph can be rendered on a user interface, or code can be executed to identify a node pointed to by another node. When the code is executed, the identifier can be used to adjust resource allocation for the identified node, adjust prioritization of processing using the identified node, generate a notification that includes the identifier of the identified node, or trigger a computing process that uses the identifier of the identified node as an argument.

## Claims

### Claim 1

A computing system comprising:
at least one memory;
one or more hardware processor units coupled to the at least one memory; and
one or more computer readable storage media storing computer-executable instructions that, when executed, cause the computing system to perform operations comprising:
receiving first metric values of a metric type for respective object instances of a first set of a first plurality of object instances of an object type;
instantiating a first instance of a graph data structure having a first plurality of instances of a graph node datatype, respective instances of the first plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the first plurality of object instances;
from the first metric values, including as part of the instantiating, generating directed edges between pairs of related nodes, and thus related corresponding object instances, using the first metric values of the nodes;
for respective pairs of related nodes of the first instance of the graph node datatype, assigning an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
(1) causing a graph to be rendered on a user interface that illustrates at least a portion of the nodes and edges of the instance of the graph node datatype, including showing directional relationships between the at least a portion of the nodes; or
(2) executing code to provide an identified node by identifying a node of the first plurality of nodes pointed to by one or more other nodes of the first plurality of nodes; and
adjusting prioritization of resource allocation to the identified node;
adjusting prioritization of processing using the identified node;
generating a notification comprising the identifier of the identified node; or
triggering a computing process using the identifier of the identified node as an argument.

### Claim 2 (depends on 1)

The computing system of claim 1, wherein the generating directed edges comprises assigning a node in a pair of nodes having a lower metric value as an origination node and a node in the pair of nodes having a higher metric value as a termination node.

### Claim 3 (depends on 1)

The computing system of claim 1, wherein the assigning an edge weight uses a quotient of the metric values for nodes in a pair of nodes.

### Claim 4 (depends on 3)

The computing system of claim 3, wherein nodes of the plurality of nodes having a higher metric value in a given pair of the nodes are identified as high value nodes and nodes of the first plurality of nodes having a lower metric value in a given pair of nodes are identified as low value nodes, and the assigning the edge weight comprises normalizing the quotient using an aggregated value of metric value for low value nodes or an aggregated metric value of high value nodes.

### Claim 5 (depends on 3)

The computing system of claim 3, wherein nodes of the plurality of nodes having a higher metric value in a given pair of the nodes are identified as high value nodes, and the assigning the edge weight comprises normalizing the quotient using an aggregated value of metric value of high value nodes.

### Claim 6 (depends on 1)

The computing system of claim 1, the operations further comprising:
receiving second metric values for the metric type for respective object instances of a second set of a second plurality of object instances of the object type;
instantiating a second instance of the graph data structure having a second plurality of instances of the graph node datatype, respective instances of the second plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the second plurality of object instances, at least a portion of the second plurality of instances corresponding to object instances of the first plurality of object instances, but having a second metric value of the second metric values;
from the second metric values, including as part of the instantiating, generating directed edges between pairs of related nodes, and thus related corresponding object instances, using the second metric values of the nodes;
for respective pairs of related nodes of the second instance of the graph node datatype, assigning an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
generating a difference graph by computing a difference in edge weights of the first graph instance and corresponding edge weights of second graph instance.

### Claim 7 (depends on 6)

The computing system of claim 6, the operations further comprising:
generating a graph that only comprises edges between nodes that have a positive difference.

### Claim 8 (depends on 6)

The computing system of claim 6, the operations further comprising:
generating a graph that only comprises edges between nodes that have a negative difference.

### Claim 9 (depends on 6)

The computing system of claim 6, wherein the first metric values are metric values at a first point in time and the second metric values are metric values at a second point in time.

### Claim 10 (depends on 6)

The computing system of claim 6, the operations further comprising:
generating a first adjacency matrix corresponding to the first instance of the graph data structure using the first metric values;
generating a second adjacency matrix corresponding to the second instance of the graph data structure using the second metric values; and
calculating a difference between the first adjacency matrix and the second adjacency matrix.

### Claim 11 (depends on 6)

The computing system of claim 6, the operation further comprising:
generating graph centrality metrics for nodes in the difference graph using edge weight differences; or
generating a stochastic process model for nodes in the difference graph using edge weight differences.

### Claim 12 (depends on 1)

The computing system of claim 1, wherein the object type represents a topic and the first metric values represent user intent scores for instances of the topic generated from user interaction with electronic content associated with a corresponding topic.

### Claim 13

A method, implemented in a computing system comprising at least one memory and one or more hardware processor units coupled to the at least one memory, the method comprising:
receiving first metric values of a metric type for respective object instances of a first set of a first plurality of object instances of an object type;
instantiating a first instance of a graph data structure having a first plurality of instances of a graph node datatype, respective instances of the first plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the first plurality of object instances;
from the first metric values, including as part of the instantiating, generating directed edges between pairs of related nodes, and thus related corresponding object instances, using the first metric values of the nodes;
for respective pairs of related nodes of the first instance of the graph node datatype, assigning an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
(1) causing a graph to be rendered on a user interface that illustrates at least a portion of the nodes and edges of the instance of the graph node datatype, including showing directional relationships between the at least a portion of the nodes; or
(2) executing code to provide an identified node by identifying a node of the first plurality of nodes pointed to by one or more other nodes of the first plurality of nodes; and
adjusting prioritization of resource allocation to the identified node;
adjusting prioritization of processing using the identified node;
generating a notification comprising the identifier of the identified node; or
triggering a computing process using the identifier of the identified node as an argument.

### Claim 14 (depends on 13)

The method of claim 13, wherein the generating directed edges comprises assigning a node in a pair of nodes having a lower metric value as an origination node and a node in the pair of nodes having a higher metric value as a termination node.

### Claim 15 (depends on 13)

The method of claim 13, the operations further comprising:
receiving second metric values for the metric type for respective object instances of a second set of a second plurality of object instances of the object type;
instantiating a second instance of the graph data structure having a second plurality of instances of the graph node datatype, respective instances of the second plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the second plurality of object instances, at least a portion of the second plurality of instances corresponding to object instances of the first plurality of object instances, but having a second metric value of the second metric values;
from the second metric values, including as part of the instantiating, generating directed edges between pairs of related nodes, and thus related corresponding object instances, using the second metric values of the nodes;
for respective pairs of related nodes of the second instance of the graph node datatype, assigning an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
generating a difference graph by computing a difference in edge weights of the first graph instance and corresponding edge weights of second graph instance.

### Claim 16 (depends on 15)

The method of claim 15, the operations further comprising:
generating a graph that only comprises edges between nodes that have a positive difference or that only comprises edges between nodes that have a negative difference.

### Claim 17

One or more non-transitory computer-readable storage media comprising:
computer-executable instructions that, when executed by a computing system comprising at least one memory and at least one hardware processor coupled to the at least one memory, cause the computing system to receive first metric values of a metric type for respective object instances of a first set of a first plurality of object instances of an object type;
computer-executable instructions that, when executed by the computing system, cause the computing system to instantiate a first instance of a graph data structure having a first plurality of instances of a graph node datatype, respective instances of the first plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the first plurality of object instances;
computer-executable instructions that, when executed by the computing system, cause the computing system to, from the first metric values, including as part of the instantiating, generate directed edges between pairs of related nodes, and thus related corresponding object instances, using the first metric values of the nodes;
computer-executable instructions that, when executed by the computing system, cause the computing system to, for respective pairs of related nodes of the first instance of the graph node datatype, assign an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
(1) computer-executable instructions that, when executed by the computing system, cause the computing system to cause a graph to be rendered on a user interface that illustrates at least a portion of the nodes and edges of the instance of the graph node datatype, including showing directional relationships between the at least a portion of the nodes; or
(2) computer-executable instructions that, when executed by the computing system, cause the computing system to execute code to provide an identified node by identifying a node of the first plurality of nodes pointed to by one or more other nodes of the first plurality of nodes; and
computer-executable instructions that, when executed by the computing system, cause the computing system to adjust prioritization of resource allocation to the identified node;
computer-executable instructions that, when executed by the computing system, cause the computing system to adjust prioritization of processing using the identified node;
computer-executable instructions that, when executed by the computing system, cause the computing system to generate a notification comprising the identifier of the identified node; or
computer-executable instructions that, when executed by the computing system, cause the computing system to trigger a computing process using the identifier of the identified node as an argument.

### Claim 18 (depends on 17)

The one or more computer-readable storage media of claim 17, further comprising:
computer-executable instructions that, when executed by the computing system, cause the computing system to receive second metric values for the metric type for respective object instances of a second set of a second plurality of object instances of the object type;
computer-executable instructions that, when executed by the computing system, cause the computing system to instantiate a second instance of the graph data structure having a second plurality of instances of the graph node datatype, respective instances of the second plurality of instances of the graph node datatype holding an identifier and a metric value for a corresponding object instance of the second plurality of object instances, at least a portion of the second plurality of instances corresponding to object instances of the first plurality of object instances, but having a second metric value of the second metric values;
computer-executable instructions that, when executed by the computing system, cause the computing system to, from the second metric values, including as part of the instantiating, generate directed edges between pairs of related nodes, and thus related corresponding object instances, using the second metric values of the nodes;
computer-executable instructions that, when executed by the computing system, cause the computing system to, for respective pairs of related nodes of the second instance of the graph node datatype, assign an edge weight to the edge connecting the nodes in the respective pair, the edge weight being the metric value for a node in the respective pair or a value generated using the metric value for the node in the respective pair; and
computer-executable instructions that, when executed by the computing system, cause the computing system to generate a difference graph by computing a difference in edge weights of the first graph instance and corresponding edge weights of second graph instance.

### Claim 19 (depends on 18)

The one or more computer-readable storage media of claim 18, further comprising:
computer-executable instructions that, when executed by the computing system, cause the computing system to generate a graph that only comprises edges between nodes that have a positive difference or that only comprises edges between nodes that have a negative difference.

### Claim 20 (depends on 17)

The one or more computer-readable storage media of claim 17, wherein the computer-executable instructions that cause the computing system to generate directed edges compromise computer executable instructions that cause the computing system to assign a node in a pair of nodes having a lower metric value as an origination node and a node in the pair of nodes having a higher metric value as a termination node.
