A system and method for propagating an opt-in through an identity graph fully honors opt-in requests without otherwise modifying the graph data structure. From a node corresponding to the touchpoint of the opt-in, the graph is traversed to find the associated primary node, from which all connected edges are traversed. Nodes on paths that are not connected to other primary nodes are opted in, along with the primary node. Edges that lead to nodes which have edges to other primary nodes are not opted in, but only the edge from the primary node itself is opted in. If household nodes are used, an identifier for the person at the household node may be opted in without opting in other members of the household node by opting in only the edge between the primary opt-in node and the household node.

The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

Methods and systems are presented for retrieving data associated with one or more portions of a graph by a computer system. Multiple graph indices are generated based on the graph. Each of the multiple graph indices stores records of data representing the graph in different formats. Upon receiving a request for accessing a sub-graph of the graph, edge-based attributes of the sub-graph are analyzed. The sub-graph may be divided into a first portion and a second portion of the sub-graph. A first graph index may be selected for retrieving records associated with the first portion of the sub-graph based on the edge-based attributes of the first portion of the sub-graph. A second graph index may be selected for retrieving records associated with the second portion of the sub-graph based on the edge-based attributes of the second portion of the sub-graph.

A method is provided. The method includes obtaining an enhanced state graph. The enhanced state graph represents a set of objects within an environment and a set of positions of the set of objects. The enhanced state graph includes a set of object nodes, a set of property nodes and a set of goal nodes to represent a set of objectives. The method also includes generating a set of instructions for a set of mechanical systems based on the enhanced state graph. The set of mechanical systems is configured to interact with one or more of the set of objects within the environment. The method further includes operating the set of mechanical systems to achieve the set of objectives based on the set of instructions.

Present invention discloses method and system for generating knowledge graph and sub-graph clusters to perform a root cause analysis. Method comprising extracting at least one of objects, data entities, links between the objects and the data entities, or relationships between the objects and the data entities from input content. Thereafter, method comprising generating a knowledge graph from the extracted data and sub-graphs from the knowledge graph using an unsupervised ML technique and extracting graph data structure information for each sub-graph. Subsequently, method comprising generating root cause model based on the sub-graphs and the graph data structure information and generating at least one sub-graph cluster and corresponding probabilistic graphical model using the root cause model and the knowledge graph. Generated Knowledge graph, root cause model and at least one sub-graph cluster and corresponding probabilistic graphical model are used to determine a root cause for an issue from an issue content.

Methods and systems for presenting time series for analysis. A method may receive a first input defining a metric that indicates a relationship between a first and a second time series that are each associated with at least a first data object of a plurality of data objects, generate a first plot depicting the metric as determined from the first and the second time series, receive, via the user interface, a second input of a selection of a second data object of the plurality of data objects, determine, via an ontology, a relationship of the second data object with a third and a fourth time series that, respectively, are associated with series types that match series types associated with the first and the second time series, and generate and display, in the user interface, a second plot depicting the metric as determined from the third and the fourth time series.

A method may include presenting a user interface on a display device of a computing device, the user interface including: a search query input element; a plurality of graph type options; a graph level selection element; and a graph presentation area; receiving a search query inputted into the search query input element, the search query identifying a concept object in an ontology; retrieving data associated with the concept object from a graph database based on selections made in the graph type options and the graph level selection element, the data including a set of result objects related to the concept object; and rendering a hierarchical graph in the graph presentation area, the hierarchical graph illustrating the set of result objects and the concept object as interactive nodes.

A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes. Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path. Utilizing DAG Path Addressing with bindings the memory can be organized to store a generalization hierarchy of logical propositions.

This disclosure relates to streaming real-time messages over time to client applications according to query subscriptions that match content from a large stream of messages exchanged on a messaging platform in a manner that increases the speed of message delivery, effectively controls the management of computer resources to handle the fluctuation of the number of active query subscriptions, and/or increases the security of matching the query subscriptions against messages generated from the perspective of the authors while delivering those messages in real-time from the perspective of the users that initiated the query subscriptions.

A diamond asset comprising one or more diamonds and an encryption chip is used to asset-back a cryptographic token that can be used to conduct transactions. The cryptographic token is written to a blockchain using a smart contract that is configured to enable a transaction associated with the token in response to two or more of: a signature by the encryption chip, a signature by the owner of the diamond asset, and a validation of a visual layout of the diamond asset.