PATENT CLAIM ANALYSIS

Application Number: 15919203
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-07
Patent Classification: ["345", "440000"]

Abstract:
A method and system for graphical enumeration. The method includes creating an ordered set of vertices for a graph such that each vertex is associated with a corresponding index, and wherein each vertex in the ordered set of vertices includes information. A plurality of keys is created for defining the information. A plurality of lists of vertices is created, each of which is associated with a corresponding key such that vertices in a corresponding list include information associated with the corresponding key. For a first list of vertices, a least valued index is determined from a group of associated vertices based on vertices in the first list and vertices pointed to by the vertices in the first list. Also, all associated vertices are pointed to a root vertex associated with the least valued index.

Claim (Index 17):
The non-transitory computer-readable storage medium of  claim 11 , further comprising instructions for:\n deleting a vertex in the graph responsive to the vertex being expired under a predetermined condition.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 90.0
- Lexical Diversity: 2.52632
- Patent Class: 345.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13905952', '14728499', '12367180', '12367415', '14012270']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6765964608024942
- 35 USC 102 Novelty (BERT): 0.5650880491683945
- Combined Prediction Score: 0.6654456196390842
- Mean Citation Score: 345.282776
- Max Citation Score: 448.1089
- Similarity Product: 415.7637706157984

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

Dataset: test