Prosecution Insights
Last updated: April 19, 2026
Application No. 16/751,528

CHEATING DETECTION USING ONE OR MORE NEURAL NETWORKS

Non-Final OA §101§102
Filed
Jan 24, 2020
Examiner
MOSSER, ROBERT E
Art Unit
3715
Tech Center
3700 — Mechanical Engineering & Manufacturing
Assignee
Nvidia Corporation
OA Round
3 (Non-Final)
46%
Grant Probability
Moderate
3-4
OA Rounds
3y 10m
To Grant
58%
With Interview

Examiner Intelligence

Grants 46% of resolved cases
46%
Career Allow Rate
253 granted / 551 resolved
-24.1% vs TC avg
Moderate +12% lift
Without
With
+11.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 10m
Avg Prosecution
58 currently pending
Career history
609
Total Applications
across all art units

Statute-Specific Performance

§101
35.2%
-4.8% vs TC avg
§103
33.7%
-6.3% vs TC avg
§102
16.3%
-23.7% vs TC avg
§112
8.4%
-31.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 551 resolved cases

Office Action

§101 §102
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on September 30th, 2025 has been entered. Information Disclosure Statement The information disclosure statement entered October 13th, 2025 has been considered. A copy of the cited statement(s) including the notation indicating its respective consideration is attached for the Applicant's records. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-30 are rejected under 35 U.S.C. 101 because the claimed invention as a whole, considering all claim elements both individually and in combination, is directed to a judicial exception (i.e., a law of nature, a natural phenomenon, or an abstract idea) without significantly more. As summarized in MPEP § 2106, subject matter eligibility is determined based on a Two-Part Analysis for Judicial Exceptions. In Step 1, it must be determined whether the claimed invention is directed to a process, machine, manufacture or composition of matter. The instant application includes claims concerning one or more processors or system (i.e., a machine) in claims 1-12, 25-30, a method (i.e., a process) in claims 13-18 and a machine-readable medium (i.e. a manufacture) in claim 19-24. In Prong 1 of Step 2A, it must be determined whether the claimed invention recites an Abstract Idea, Law of Nature or a Natural Phenomenon. In particular exemplary presented claim 1 includes the following underlined claim elements: 1. One or more processors, comprising: circuitry to: receive one or more images of gameplay of a game; detect cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game; and generate an indication of the cheating by the one or more players. The claim elements underlined above, concern the court enumerated abstract ideas of Mental Processes including observation, evaluation, and judgement because the claims are directed to series of steps that evaluate image data to determine anomalies and indicate cheating as well as Certain Methods of Organizing Human Activity including managing personal behavior involving interactions between people including social activities and following rules or instructions because the claims set forth rules interactions involving one or more parties in the context of game cheating. As the exemplary claim recites an Abstract Idea, Law of Nature or a Natural Phenomenon it is further considered under Prong 2 of Step 2A to determine if the claim recites additional elements that would integrate the judicial exception into a practical application. Wherein the practical applications are set forth by MPEP §2106.05(a-c,e) are broadly directed to: the improvement in technology, use of a particular machine and applying or using the judicial exception in a meaningful way beyond generally linking the use thereof to a technology environment. Limitations that explicitly do not support the integration of the judicial exception in to a practical application are defined by MPEP 2106.05(f-h) and include merely using a computer to implement the abstract idea, insignificant extra solution activity, and generally linking the use of the judicial exception to a particular technology environment or field of use. With respect to the above the claimed invention is not integrated into a practical application because it does not meet the criteria of MPEP §2106.05(a-c,e) and although it is performed on one or more processor(s) and circuitry it is not directed to a particular machine because the hardware elements are not linked to a specific device/machine and would reasonably include other devices such as generic computers, smart phones, game consoles, and the like. Accordingly, the claims limitations are not indicative of the integration of the identified judicial exception into a practical application, and the consideration of patent eligibility continues to step 2B. Step 2B requires that if the claim encompasses a judicially recognized exception, it must be determined whether the claimed invention recites additional elements that amount to significantly more than the judicial exception. The additional element(s) or combination of elements in the claim(s) other than the abstract idea(s) per se including one or more processor(s) and circuitry amount(s) to no more than: (i) mere instructions to implement the idea on a computer, and/or (ii) recitation of generic computer structures that serves to perform generic computer functions that are well-understood, routine, and conventional activities previously known to the pertinent industry per the applicant’s description (Applicant’s specification Paragraphs [0097], [0106], [0259]). Viewed as a whole, these additional claim element(s) do not provide meaningful limitation(s) to transform the abstract idea into a patent eligible application of the abstract idea such that the claim(s) amounts to significantly more than the abstract idea itself. Accordingly, as presented the claimed invention when considered as a whole amounts to the mere instructions to implement an abstract idea [i.e. software or equivalent process steps] on a generic computer [i.e. controller or processor] without causing the improvement of the generic computer or another technology field. The applicant’s specification is further noted as supporting the above rejection wherein neither the abstract idea nor the associated generic computer structure as claimed are disclosed as improving another technological field, improvements to the function of the computer itself, or meaningfully linking the use of an abstract idea to a particular technological environment (Applicant’s specification Paragraphs [0097], [0106], [0259]). In particular the applicant’s specification only contains computing elements which are conventional and generally widely known in the field of the invention described, and accordingly their exact nature or type is not necessary for an understanding and use of the invention by a person skilled in the art per the requirements of 37 CFR 1.71. Were these elements of the applicant’s invention to be presented in the future as non-conventional and non-generic involvement of a computing structure, such would stand at odds with the disclosure of the applicant's invention as found in their specification as originally filed. “[I]f a patent’s recitation of a computer amounts to a mere instruction to ‘implemen[t]’ an abstract idea ‘on . . .a computer,’ . . . that addition cannot impart patent eligibility.” Alice, 134 S. Ct. at 2358 (quoting Mayo, 132S. Ct. at 1301). In this case, the claims recite a generic computer implementation of the covered abstract idea. The remaining presented claims 2-30 incorporate substantially similar abstract concepts as noted with respect to the exemplary claim 1, while the additional elements recited by the additional claims including one or more of one or more processors, memory, circuitry, a machine-readable medium and a ticket as respectively presented in certain claims that when considered both individually and as a whole in the respective combinations of each of the additional claims are not sufficient to support patent eligibility under prong 2 of step 2A or step 2B because they each present substantially similar abstract concepts as noted with reflection to exemplary claim 1 above and accordingly for the same reasons set forth above with respect to the exemplary claim 1 are similarly directed to or otherwise include abstract ideas. Therefore, the listed claim(s) are rejected under 35 U.S.C. 101 as being directed to non-statutory subject matter. As the claimed invention incorporates the use of AI/Neural Networks. The 2024 Guidance Update on Patent Subject Matter Eligibility, Including on Artificial Intelligence as published on July 17th, 2024 and Example 47 are of particular relevance in determining when the use of AI to detect anomalies would and would not be considered patent eligible. At present the claimed invention is most similar to ineligible claim 2 of Example 47. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claims 1-30 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by NAM (US 20200114265). Claim 1: NAM teaches one or more processors (NAM Figure 1), comprising: circuitry to: receive one or more images of gameplay of a game (NAM Figures 2-3; Paragraphs [0008], [0047], [0074]); detect cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game (NAM Paragraphs [0037], [0043], [0074], [0098], [0125]); and generate an indication of the cheating by the one or more players (NAM Figures 6 & 7; Paragraphs [0004], [0057], [0127]-[0128]). Claim 2: NAM teaches the one or more processors of claim 1, wherein the one or more neural networks include a reconstruction network for detecting the one or more anomalies at least in part by determining a reconstruction probability, for one or more segments of video data, using approved game input (-alternatively describing the identification of reconstruction error- NAM Paragraphs [0126]-[0128]). Claim 3: NAM teaches the one or more processors of claim 2, wherein the one or more neural networks include a decision network for determining, based at least in part upon the reconstruction probability, whether cheating occurred during the one or more segments (-Alternatively describing the identification of abnormal patterns through the comparison of the same to defined threshold values- NAM Paragraphs [0076], [0126]-[0128]). Claim 4: NAM teaches the one or more processors of claim 3, wherein the one or more neural networks include one or more labeling networks for labeling events and occurrences detected during the one or more segments, the events and occurrences providing contextual data for the one or more anomalies detected during the one or more segments by the reconstruction network, wherein the decision network is further to determine whether the cheating occurred based upon the contextual data (-Wherein the reconstruction error is necessarily based on contextual data describing the scene being reconstructed- NAM Paragraphs [0102], [0126]-[0128], [0132]). Claim 5: NAM teaches the one or more processors of claim 1, wherein the circuitry is further to log data for the detected cheating by the one or more players to a cheating log for use in future cheating determinations (-Describing the updating of the model based on identification and/or labeling of anomalies- NAM Paragraphs [0102], [0145]). Claim 6: NAM teaches the one or more processors of claim 1, wherein the circuitry is further to modify an ability of the one or more players to play the game in response to detecting cheating by the one or more players (NAM Paragraphs [0058]-[0059]). Claim 7: NAM teaches a system comprising: one or more processors (NAM Figure 1), to: receive one or more images of gameplay of a game (NAM Figures 2-3; Paragraphs [0008], [0047], [0074]); detect cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game (NAM Paragraphs [0037], [0043], [0074], [0098], [0125]); and generate an indication of the cheating by the one or more players (NAM Figures 6 & 7; Paragraphs [0004], [0057], [0127]-[0128]). Claim 8: NAM teaches the system of claim 7, wherein the one or more neural networks include a reconstruction network for detecting the one or more anomalies at least in part by determining a reconstruction probability, for one or more segments of video data, using approved game input (-alternatively describing the identification of reconstruction error- NAM Paragraphs [0126]-[0128]). Claim 9: NAM teaches the system of claim 8, wherein the one or more neural networks include a decision network for determining, based at least in part upon the reconstruction probability, whether cheating occurred during the one or more segments (-Alternatively describing the identification of abnormal patterns through the comparison of the same to defined threshold values- NAM Paragraphs [0076], [0126]-[0128]). Claim 10: NAM teaches the system of claim 9, wherein the one or more neural networks include one or more labeling networks for labeling events and occurrences detected during the one or more segments, the events and occurrences providing contextual data for the one or more anomalies detected during the one or more segments by the reconstruction network, wherein the decision network is further to determine whether the cheating occurred based upon the contextual data (-Wherein the reconstruction error is necessarily based on contextual data describing the scene being reconstructed- NAM Paragraphs [0102], [0126]-[0128], [0132]). Claim 11: NAM teaches the system of claim 7, wherein the one or more processors are further to log data for the detected cheating by the one or more players to a cheating log for use in future cheating determinations (-Describing the updating of the model based on identification and/or labeling of anomalies- NAM Paragraphs [0102], [0145]). Claim 12: NAM teaches the system of claim 7, wherein the one or more processors are further to modify an ability of the one or more players to play the game in response to detecting cheating by the one or more players (NAM Paragraphs [0058]-[0059]). Claim 13: NAM teaches a method comprising: receiving one or more images of gameplay of a game (NAM Figures 2-3; Paragraphs [0008], [0047], [0074]); detecting cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game (NAM Paragraphs [0037], [0043], [0074], [0098], [0125]); and generating an indication of the cheating by the one or more players (NAM Figures 6 & 7; Paragraphs [0004], [0057], [0127]-[0128]). Claim 14: NAM teaches the method of claim 13, wherein the one or more neural networks include a reconstruction network for detecting the one or more anomalies at least in part by determining a reconstruction probability, for the one or more images of the gameplay, using approved game input (-alternatively describing the identification of reconstruction error- NAM Paragraphs [0126]-[0128]). Claim 15: NAM teaches the method of claim 14, wherein the one or more neural networks include a decision network for determining, based at least in part upon the reconstruction probability, whether cheating occurred during the one or more segments (-Alternatively describing the identification of abnormal patterns through the comparison of the same to defined threshold values- NAM Paragraphs [0076], [0126]-[0128]). Claim 16: NAM teaches the method of claim 15, wherein the one or more neural networks include one or more labeling networks for labeling events and occurrences detected during the one or more segments, the events and occurrences providing contextual data for the one or more anomalies detected during the one or more segments by the reconstruction network, wherein the decision network is further to determine whether the cheating occurred based upon the contextual data (-Wherein the reconstruction error is necessarily based on contextual data describing the scene being reconstructed- NAM Paragraphs [0102], [0126]-[0128], [0132]). Claim 17: NAM teaches the method of claim 13, further comprising logging data for the detected cheating by the one or more players to a cheating log for use in future cheating determinations (-Describing the updating of the model based on identification and/or labeling of anomalies- NAM Paragraphs [0102], [0145]). Claim 18: NAM teaches the method of claim 13, further comprising modifying an ability of the one or more players to play the game in response to detecting cheating by the one or more players (NAM Paragraphs [0058]-[0059]). Claim 19: NAM teaches a machine-readable medium having stored thereon a set of instructions, which if performed by one or more processors (NAM Figure 1), cause the one or more processors to at least: receive one or more images of gameplay of a game (NAM Figures 2-3; Paragraphs [0008], [0047], [0074]); detect cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game (NAM Paragraphs [0037], [0043], [0074], [0098], [0125]), and generate an indication of the cheating by the one or more players (NAM Figures 6 & 7; Paragraphs [0004], [0057], [0127]-[0128]). Claim 20: NAM teaches the machine-readable medium of claim 19, wherein the one or more neural networks include a reconstruction network for detecting the one or more anomalies at least in part by determining a reconstruction probability, for the one or more images of the gameplay, using approved game input (-alternatively describing the identification of reconstruction error- NAM Paragraphs [0126]-[0128]). Claim 21: NAM teaches the machine-readable medium of claim 20, wherein the one or more neural networks include a decision network for determining, based at least in part upon the reconstruction probability, whether cheating occurred during the one or more segments (-Alternatively describing the identification of abnormal patterns through the comparison of the same to defined threshold values- NAM Paragraphs [0076], [0126]-[0128]). Claim 22: NAM teaches the machine-readable medium of claim 21, wherein the one or more neural networks include one or more labeling networks for labeling events and occurrences detected during the one or more segments, the events and occurrences providing contextual data for the one or more anomalies detected during the one or more segments by the reconstruction network, wherein the decision network is further to determine whether the cheating occurred based upon the contextual data (-Wherein the reconstruction error is necessarily based on contextual data describing the scene being reconstructed- NAM Paragraphs [0102], [0126]-[0128], [0132]). Claim 23: NAM teaches the machine-readable medium of claim 19, wherein the one or more processors are further to log data for the detected cheating by the one or more players to a cheating log for use in future cheating determinations (-Describing the updating of the model based on identification and/or labeling of anomalies- NAM Paragraphs [0102], [0145]). Claim 24: NAM teaches the machine-readable medium of claim 19, wherein the one or more processors are further to modify an ability of the one or more players to play the game in response to detecting cheating by the one or more players (NAM Paragraphs [0058]-[0059]). Claim 25: NAM teaches a cheating detection system, comprising: one or more processors (NAM Figure 1), to: receive one or more images of gameplay of a game (NAM Figures 2-3; Paragraphs [0008], [0047], [0074]); detect cheating by one or more players of the game based, at least in part, on one or more neural networks to detect one or more anomalies within the one or more images of the gameplay of the game (NAM Paragraphs [0037], [0043], [0074], [0098], [0125]); and generate an indication of the cheating by the one or more players (NAM Figures 6 & 7; Paragraphs [0004], [0057], [0127]-[0128]); and memory for storing network parameters for the one or more neural networks (NAM Figure 1). Claim 26: NAM teaches the cheating detection system of claim 25, wherein the one or more neural networks include a reconstruction network for detecting the one or more anomalies at least in part by determining a reconstruction probability, for the one or more images of the gameplay, using approved game input (-alternatively describing the identification of reconstruction error- NAM Paragraphs [0126]-[0128]). Claim 27: NAM teaches the cheating detection system of claim 26, wherein the one or more neural networks include a decision network for determining, based at least in part upon the reconstruction probability, whether cheating occurred during the one or more segments (-Alternatively describing the identification of abnormal patterns through the comparison of the same to defined threshold values- NAM Paragraphs [0076], [0126]-[0128]). Claim 28: NAM teaches the cheating detection system of claim 27, wherein the one or more neural networks include one or more labeling networks for labeling events and occurrences detected during the one or more segments, the events and occurrences providing contextual data for the one or more anomalies detected during the one or more segments by the reconstruction network, wherein the decision network is further to determine whether the cheating occurred based upon the contextual data (-Wherein the reconstruction error is necessarily based on contextual data describing the scene being reconstructed- NAM Paragraphs [0102], [0126]-[0128], [0132]). Claim 29: NAM teaches the cheating detection system of claim 25, wherein the one or more processors are further to log data for the detected cheating by the one or more players to a cheating log for use in future cheating determinations (-Describing the updating of the model based on identification and/or labeling of anomalies- NAM Paragraphs [0102], [0145]). Claim 30: NAM teaches the cheating detection system of claim 25, wherein the one or more processors are further to modify an ability of the one or more players to play the game in response to detecting cheating by the one or more players (NAM Paragraphs [0058]-[0059]). Conclusion The following prior art is made of record and though not relied upon is considered pertinent to applicant's disclosure: Jonnalagadda et al (US 2022/0180173) teaches graphics processing units for detection of cheating using neural networks; LIU et al (US 2018/0182208) teaches detecting cheating in games with machine learning; and Breed (US 2016/0035233) teaches secure testing system and method. Any inquiry concerning this communication or earlier communications from the examiner should be directed to ROBERT E MOSSER whose telephone number is (571)272-4451. The examiner can normally be reached M-F 6:45-3:45. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, David Lewis can be reached at 571-272-7673. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. ROBERT E. MOSSER Primary Examiner Art Unit 3715 /ROBERT E MOSSER/Primary Examiner, Art Unit 3715
Read full office action

Prosecution Timeline

Jan 24, 2020
Application Filed
May 26, 2022
Non-Final Rejection — §101, §102
Nov 29, 2022
Examiner Interview Summary
Nov 29, 2022
Applicant Interview (Telephonic)
Dec 01, 2022
Response Filed
Feb 24, 2023
Final Rejection — §101, §102
Aug 01, 2023
Response after Non-Final Action
Aug 01, 2023
Notice of Allowance
Aug 29, 2023
Response after Non-Final Action
Oct 02, 2023
Response after Non-Final Action
Oct 02, 2023
Response after Non-Final Action
Oct 10, 2023
Response after Non-Final Action
Oct 13, 2023
Response after Non-Final Action
Nov 13, 2023
Response after Non-Final Action
Nov 13, 2023
Response after Non-Final Action
Feb 03, 2024
Response after Non-Final Action
Apr 08, 2024
Response after Non-Final Action
Apr 09, 2024
Response after Non-Final Action
Apr 10, 2024
Response after Non-Final Action
Apr 10, 2024
Response after Non-Final Action
Jul 30, 2025
Response after Non-Final Action
Aug 22, 2025
Interview Requested
Aug 29, 2025
Applicant Interview (Telephonic)
Aug 29, 2025
Examiner Interview Summary
Sep 30, 2025
Request for Continued Examination
Oct 02, 2025
Response after Non-Final Action
Jan 06, 2026
Non-Final Rejection — §101, §102
Mar 19, 2026
Interview Requested
Apr 07, 2026
Examiner Interview Summary
Apr 07, 2026
Applicant Interview (Telephonic)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12515122
CONTROLLING A DISPLAY OF A COMPUTER DEVICE
2y 5m to grant Granted Jan 06, 2026
Patent 12508511
MANAGING ACCESS TO DIGITAL ASSETS
2y 5m to grant Granted Dec 30, 2025
Patent 12485347
Systems and Methods for Procedurally Animating a Virtual Camera Associated with Player-Controlled Avatars in Video Games
2y 5m to grant Granted Dec 02, 2025
Patent 12462629
LOTTERY TICKET VENDING MACHINE
2y 5m to grant Granted Nov 04, 2025
Patent 12462614
LOTTERY TICKET VENDING MACHINE
2y 5m to grant Granted Nov 04, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
46%
Grant Probability
58%
With Interview (+11.7%)
3y 10m
Median Time to Grant
High
PTA Risk
Based on 551 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month