PATENT CLAIM ANALYSIS

Application Number: 15965745
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["706", "025000"]

Abstract:
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a computational graph to include send and receive nodes. Communication between unique devices performing operations of different subgraphs of the computational graph can be handled efficiently by inserting send and receive nodes into each subgraph. When executed, the operations that these send and receive nodes represent may enable pairs of unique devices to conduct communication with each other in a self-sufficient manner. This shifts the burden of coordinating communication away from the backend, which affords the system that processes this computational graph representation the opportunity to perform one or more other processes while devices are executing subgraphs.

Claim (Index 21):
A method for processing a computational graph using a plurality of devices, the computational graph comprising a plurality of nodes and directed edges, wherein each node represents a respective operation, wherein each directed edge connects a respective first node to a respective second node that represents an operation that receives, as input, an output of an operation represented by the respective first node, wherein the method comprises, for a first device of the plurality of devices:\n receiving data representing a subgraph of the computational graph assigned to the first device, the subgraph comprising a plurality of nodes and directed edges from the computational graph; and performing the operations represented by the nodes in the subgraph, comprising:\n performing an operation represented by a respective first node in the subgraph to generate a first output: \n determining that the first node is connected by a directed edge to a send node in the subgraph; \n performing the operation represented by the send node to transmit the first output of the operation represented by the respective first node to another device of the plurality of devices; \n performing an operation represented by a receive node in the subgraph to obtain a second output from an operation represented by a second node assigned to another device in the plurality of device; \n determining that the receive node is connected by a directed edge to a third node in the subgraph; and \n performing an operation represented by the third node using as input the obtained second output.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 91.0
- Lexical Diversity: 1.55128
- Patent Class: 706.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15965742', '15965670', '15400942', '15685055', '15400937']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3873898045974825
- 35 USC 102 Novelty (BERT): 0.4983247621893927
- Combined Prediction Score: 0.3984833003566735
- Mean Citation Score: 234.71224600000005
- Max Citation Score: 294.50504
- Similarity Product: 259.5246391730785

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test