PATENT CLAIM ANALYSIS

Application Number: 15958265
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2019-10
Patent Classification: ["708", "520000"]

Abstract:
A method includes storing a sparse triangular matrix as a compressed sparse row (CSR) dataset. For each factor of a plurality of factors in a first vector, a value of the factor is calculated by identifying for the factor a set of one or more antecedent factors in the first vector, where the value of the factor is dependent on each of the one or more antecedent factors. In response to a completion array indicating that all of the one or more antecedent factor values are solved, the value of the factor is calculated based on one or more elements in a row of the matrix and a product value corresponding to the row. In the completion array, a first completion flag for the factor is asserted, indicating that the factor is solved.

Claim (Index 2):
The method of  claim 1 , further comprising:\n storing elements of the matrix in a values array of the CSR dataset; in a columns array of the CSR dataset, identifying a column of the matrix for each of the elements stored in the values array; and in a row pointers array of the CSR dataset, identifying the elements in each row of the matrix.

Metadata:
- Claim Count in Document: 56.0
- Percentile: 91.0
- Lexical Diversity: 2.44068
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14580110', '13651464', '11006385', '15795091', '14314750']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3629534596383678
- 35 USC 102 Novelty (BERT): 0.48247833968251
- Combined Prediction Score: 0.374905947642782
- Mean Citation Score: 158.26984
- Max Citation Score: 174.61737
- Similarity Product: 134.37301301550326

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

Dataset: test