PATENT CLAIM ANALYSIS

Application Number: 16188261
Application Type: Utility
Filing Date: 2018-11
Publication Date: 2019-03
Patent Classification: ["708", "250000"]

Abstract:
A method for assigning a random number to a user in a set of users includes computing a random number assignment seed value based on an ASCII-value representation of the user's name, dividing the random number assignment seed value by a quantity of unassigned numbers available to be assigned to the user to produce a modified random number assignment seed value, rounding the modified random number assignment seed value down to an integer, computing a random number offset value by multiplying the quantity of unassigned numbers by the rounded modified random number assignment seed value, subtracting the random number assignment offset value from the random number assignment seed value to determine a random number assignment lookup number, determining the random number to be assigned to the user based on the random number assignment lookup number, and assigning the determined random number to the user.

Claim (Index 11):
A computer-implemented method of selecting a final user from a set of users, the method comprising:\n assigning a random number from a set of numbers to each user in the set of users; sorting the set of users into a first subset of users, a second subset of users, and a third subset of users, the sorting being based at least in part on a present value associated with each of the users in the set of users, a historical value associated with each of the users in the set of users, or both; dynamically arranging the users in the first subset of users based on the random number previously assigned to each of the users in the first subset of users; removing one or more of the users in the first subset of users, thereby forming a reduced first subset of users, the removing of one user in the first subset of users including:\n computing a first removal seed value that is specific to the one user in the first subset of users based at least on an ASCII-value representation of a name of each user currently remaining in the first subset of users; \n modifying the computed first removal seed value to produce a modified first removal seed value, the modifying including dividing the computed first removal seed value by D 1 , wherein D 1  is the number of users currently remaining in the first subset of users; \n rounding the modified first removal seed value down to an integer value closest to the modified first removal seed value, the integer value being D 2 ; \n computing a first removal offset value by multiplying D 1  by D 2 ; \n computing a first removal lookup number by subtracting the first removal offset value from the computed first removal seed value; \n determining the one user in the first subset of users to be removed by using the computed first removal lookup number and the dynamic arrangement of the users in the first subset of users; and \n removing the determined one user in the first subset of users from the first subset of users; \n combining the reduced first subset of users and the second subset of users to create a fourth subset of users; dynamically arranging the users in the fourth subset of users based on the random number previously assigned to each of the users in the fourth subset of users; removing one or more of the users in the fourth subset of users, thereby forming a reduced fourth subset of users, the removing of one user in the fourth subset of users including:\n computing a second removal seed value that is specific to the one user in the fourth subset of users based at least on an ASCII-value representation of a name of each user currently remaining in the fourth subset of users; \n modifying the computed second removal seed value to produce a modified second removal seed value, the modifying including dividing the computed second removal seed value by E 1 , wherein E 1  is equal to the number of users currently remaining in fourth subset of users; \n rounding the modified second removal seed value down to an integer value closest to the modified second removal seed value, the integer value being equal to E 2 ; \n computing a second removal offset value by multiplying E 1  by E 2 ; \n computing a second removal lookup number by subtracting the second removal offset value from the computed second removal seed value; \n determining the one user in the fourth subset of users to be removed by using the computed second removal lookup number and the dynamic arrangement of the users in the fourth subset of users; and \n removing the determined one user in the fourth subset of users from the fourth subset of users; \n combining the reduced fourth subset of users and the third subset of users to create a fifth subset of users; arranging the users in the fifth subset of users based on the random number previously assigned to each of the users in the fifth subset of users; and selecting the final user from the fifth subset of users.

Metadata:
- Claim Count in Document: 11.0
- Percentile: 98.0
- Lexical Diversity: 2.98039
- Patent Class: 708.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['15620455', '15614328', '12315724', '13553731', '12419645']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3640864511358774
- 35 USC 102 Novelty (BERT): 0.5712851279085746
- Combined Prediction Score: 0.3848063188131471
- Mean Citation Score: 217.946164
- Max Citation Score: 460.68646
- Similarity Product: 331.45130668116093

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