PATENT CLAIM ANALYSIS

Application Number: 15750630
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2019-01
Patent Classification: ["370", "238000"]

Abstract:
Examples relate to identifying shortest paths. In one example, a computing device may: access an edge table that specifies, for each edge of a graph, an edge source, an edge destination, and an edge distance value; access a current path table that specifies paths between nodes of the graph and, for each path, a source node, a destination node, a distance, and a node path; identify each path included in the current path table as a shortest known path; and for each path having a destination node that matches an edge source node, add a new path to the current path table, the new path specifying: the source node as a new source; the edge destination as a new destination; a sum of the edge value and the path distance as a new distance; and the edge destination appended to the node path as a new node path.

Claim (Index 15):
The method of  claim 13 , further comprising:\n determining that each path flag of each path included in the combined table indicates that the path is inactive; and in response to the determination, determining that each the combined table is a shortest path table specifying the shortest paths between the nodes of the graph.

Metadata:
- Claim Count in Document: 7.0
- Percentile: 88.0
- Lexical Diversity: 3.4
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['10150816', '11776919', '14128889', '14556355', '12491085']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4999896279470629
- 35 USC 102 Novelty (BERT): 0.4886776378602219
- Combined Prediction Score: 0.4988584289383788
- Mean Citation Score: 132.557865
- Max Citation Score: 138.30113
- Similarity Product: 82.00505963654159

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

Dataset: test