PATENT CLAIM ANALYSIS

Application Number: 16239184
Application Type: Utility
Filing Date: 2019-01
Publication Date: 2019-05
Patent Classification: ["341", "051000"]

Abstract:
A device that includes a node engine configured to emulate a first node, a second node, and a third node. The first node is configured to receive a first correlithm object, fetch a second correlithm object based on the first correlithm object, and output the second correlithm object to the second node and the third node. Each correlithm object is a point in an n-dimensional space represented by a binary string. The second node is configured to receive the second correlithm object, fetch a third correlithm object based on the second correlithm object, and output the third correlithm object to the third node. The third node is configured to receive the second correlithm object, receive the third correlithm object, fetch a fourth correlithm object based on the second correlithm object and the third correlithm object, and output the fourth correlithm object.

Claim (Index 1):
A device configured to emulate an asynchronous correlithm object processing system, comprising:\n a node engine configured to emulate:\n a first node linked with a first node table, wherein:\n the first node table identifies:\n a first plurality of correlithm objects, wherein each correlithm object in the first plurality of correlithm objects is a point in a first n-dimensional space represented by a binary string; and \n a second plurality of correlithm objects linked with the first plurality of correlithm objects, wherein each correlithm object in the second plurality of correlithm objects is a point in a second n-dimensional space represented by a binary string; and \n \n the first node is configured to:\n receive a first correlithm object; \n fetch a second correlithm object from among the second plurality of correlithm objects based on the first correlithm object, wherein fetching the second correlithm object comprises: \n \u2003determining Hamming distances between the first correlithm object and each of the first plurality of correlithm objects; \n \u2003identifying a correlithm object with the shortest Hamming distance between the first correlithm object and each of the first plurality of correlithm objects; and \n \u2003identifying an entry in the first node table that corresponds with the identified correlithm object; and \n output the second correlithm object to a second node.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 99.0
- Lexical Diversity: 4.18919
- Patent Class: 341.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15983883', '15824782', '15983813', '15701258', '15701294']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6576863586541489
- 35 USC 102 Novelty (BERT): 0.6056110349905812
- Combined Prediction Score: 0.6524788262877921
- Mean Citation Score: 474.23008
- Max Citation Score: 510.00958
- Similarity Product: 507.3601299986124

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

Dataset: test