Prosecution Insights
Last updated: November 20, 2026
Application No. 18/581,161

System and Methods for Solving Constraint Optimization Problems using Machine Learning

Non-Final OA §101§112
Filed
Feb 19, 2024
Priority
Feb 18, 2023 — provisional 63/446,838
Examiner
HOANG, MICHAEL H
Art Unit
2122
Tech Center
2100 — Computer Architecture & Software
Assignee
GEORGIA TECH RESEARCH Corporation
OA Round
1 (Non-Final)
55%
Grant Probability
Moderate
1-2
OA Rounds
1y 7m
Est. Remaining
76%
With Interview

Examiner Intelligence

Grants 55% of resolved cases
55%
Career Allowance Rate
89 granted / 161 resolved
At TC average
Strong +21% interview lift
Without
With
+21.2%
Interview Lift
resolved cases with interview
Typical timeline
4y 4m
Avg Prosecution
36 currently pending
Career history
207
Total Applications
across all art units

Statute-Specific Performance

§101
29.7%
-10.3% vs TC avg
§103
44.3%
+4.3% vs TC avg
§102
10.6%
-29.4% vs TC avg
§112
12.9%
-27.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 161 resolved cases

Office Action

§101 §112
DETAILED ACTION This action is in response to the claims filed 02/19/2024 for Application number 18/581,161. Claims 1-20 are currently pending. 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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on 12/23/2024 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Claim Objections Claim 1 is objected to because of the following informalities: The claim recites: a state machine memory module a crossbar array of rows and columns. This sentence is grammatically incorrect. Claim 1 further recites “the global learning guides solver towards…” The term “solver” should be read as “the solver circuit” in order to avoid any antecedent basis/indefiniteness issues Appropriate correction is required. Claim Interpretation The following is a quotation of 35 U.S.C. 112(f): (f) Element in Claim for a Combination. – An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof. The following is a quotation of pre-AIA 35 U.S.C. 112, sixth paragraph: An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof. The claims in this application are given their broadest reasonable interpretation using the plain meaning of the claim language in light of the specification as it would be understood by one of ordinary skill in the art. The broadest reasonable interpretation of a claim element (also commonly referred to as a claim limitation) is limited by the description in the specification when 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is invoked. As explained in MPEP § 2181, subsection I, claim limitations that meet the following three-prong test will be interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph: (A) the claim limitation uses the term “means” or “step” or a term used as a substitute for “means” that is a generic placeholder (also called a nonce term or a non-structural term having no specific structural meaning) for performing the claimed function; (B) the term “means” or “step” or the generic placeholder is modified by functional language, typically, but not always linked by the transition word “for” (e.g., “means for”) or another linking word or phrase, such as “configured to” or “so that”; and (C) the term “means” or “step” or the generic placeholder is not modified by sufficient structure, material, or acts for performing the claimed function. Use of the word “means” (or “step”) in a claim with functional language creates a rebuttable presumption that the claim limitation is to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites sufficient structure, material, or acts to entirely perform the recited function. Absence of the word “means” (or “step”) in a claim creates a rebuttable presumption that the claim limitation is not to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is not interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites function without reciting sufficient structure, material or acts to entirely perform the recited function. Claim limitations in this application that use the word “means” (or “step”) are being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action. Conversely, claim limitations in this application that do not use the word “means” (or “step”) are not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action. This application includes one or more claim limitations that do not use the word “means,” but are nonetheless being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, because the claim limitation(s) uses a generic placeholder that is coupled with functional language without reciting sufficient structure to perform the recited function and the generic placeholder is not preceded by a structural modifier. Such claim limitation(s) is/are: neural network acceleration module is configured to update... in claim 14 Because this/these claim limitation(s) is/are being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, it/they is/are being interpreted to cover the corresponding structure described in the specification as performing the claimed function, and equivalents thereof. If applicant does not intend to have this/these limitation(s) interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, applicant may: (1) amend the claim limitation(s) to avoid it/them being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph (e.g., by reciting sufficient structure to perform the claimed function); or (2) present a sufficient showing that the claim limitation(s) recite(s) sufficient structure to perform the claimed function so as to avoid it/them being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 1-20 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. The term “higher” in claims 1 and 14 is a relative term which renders the claim indefinite. The term “higher” is not defined by the claim, the specification does not provide a standard for ascertaining the requisite degree, and one of ordinary skill in the art would not be reasonably apprised of the scope of the invention. It is not clear as to what degree would be considered to be a higher number of satisfied clauses as there is no frame of reference provided in the claims. Claims 2-13 and 15-20 are rejected as being dependent on a rejected base claim without curing any of the deficiencies. 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-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Regarding claim 1, Step 1 Analysis: Claim 1 is directed to a process, which falls within one of the four statutory categories. Step 2A Prong 1 Analysis: Claim 1 recites, in part, The limitations of: [neuron circuits coupled to the state machine memory module] to generate assignment of the variables can be considered to be an evaluation in the human mind, [wherein the state machine circuit is configured to] (i) compute a score from the Boolean states of the clauses from weights which can be considered to be an evaluation in the human mind (ii) determine a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities which can be considered to be an evaluation in the human mind These limitations as drafted, are processes that, under broadest reasonable interpretation, covers performance of the limitation in the mind or with the aid of pen and paper which falls within the “Mental Processes” grouping of abstract ideas. Accordingly, the claim recites an abstract idea. Step 2A Prong 2 Analysis: This judicial exception is not integrated into a practical application. In particular, the claim recites the additional elements - “A co-processor comprising…”, “a solver circuit comprising a neural network configured for unsupervised learning”, “a binary input interface configured to…”, “a state machine memory module...”, “a crossbar array of rows and columns, the crossbar array being used to map and compute Boolean states of clauses, wherein each bit-cell in the array indicates a presence or absence of variables in a clause”, “neuron circuits coupled to the state machine memory module to generate…”, “a state machine circuit operably coupled to state machine accelerator module, the binary input interface, and the neural network acceleration module, wherein the state machine circuit is configured to…” and “wherein the weights of the state machine memory module are iteratively updated through unsupervised global learning rules and local learning rules, the global learning guides solver towards the higher number of satisfied clauses, and the local learning guides the system to explore a local problem region.”. Thus, these elements in the claim are recited at a high level of generality such that they amount to no more than mere instructions to apply the exception using a generic computer component. Please see MPEP 2106.05(f). The claim further recites the additional element of “a neural network acceleration module having arrays of weights corresponding to nodes in a neural network”. This element that is recited is only generally linked to the judicial exception. Please see MPEP 2106.05(h). Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea. The claim further recites: receive binary inputs corresponding to variables and clauses for a Boolean problem; This limitation is a mere data gathering step and thus is an insignificant extra-solution activity. (iii) provide the plurality of weights to NN memory module, This is an insignificant extra-solution activity. Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea. The claim as a whole is directed to an abstract idea. Step 2B Analysis: The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of utilizing “A co-processor”, “a solver circuit comprising a neural network configured for unsupervised learning”, “a binary input interface”, “a state machine memory module...”, “a crossbar array of rows and columns”, “neuron circuits coupled to the state machine memory module to generate…”, “a state machine circuit operably coupled to state machine accelerator module, the binary input interface, and the neural network acceleration module,” to perform the steps of the claimed process amount to no more than mere instructions to apply the exception using a generic computer component. Mere instructions to apply an exception using a generic computer component cannot provide an inventive concept. Additionally, the claim recites: “a neural network acceleration module having arrays of weights corresponding to nodes in a neural network”. This element that is recited is only generally linked to the judicial exception. Furthermore, the limitations of receive binary inputs corresponding to variables and clauses for a Boolean problem; (iii) provide the plurality of weights to NN memory module, are well-understood, routine, and conventional, as evidenced by MPEP §2106.05(d)(II)(I), “receiving or transmitting data over a network”. These limitations therefore remain insignificant extra-solution activity even upon reconsideration, and does not amount to significantly more. Even when considered in combination, these additional elements amount to mere instructions to apply the exception using generic computer components, generally linking the additional element to the judicial exception and insignificant extra-solution activity, which cannot provide an inventive concept. The claim is not patent eligible. Regarding claim 2, the rejection of claim 1 is further incorporated, and further, the claim recites: wherein the state machine circuit comprises a processor circuit configured to output the plurality of learning probabilities. This limitation amounts to mere instructions to apply the judicial exception using a generic computer component. Please see MPEP 2106.05(f). The claim does not include any additional elements that amount to an integration of the judicial exceptions into a practical application, nor to significantly more than the judicial exceptions. The claim is not patent eligible. Regarding claim 3, the rejection of claim 2 is further incorporated, and further, The claim does recite the additional element of “wherein the state machine circuit comprises a weight update circuit operably coupled to the probability processor circuit, wherein the weight update circuit is configured to determine the plurality of weights using the plurality of learning probabilities.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 4, the rejection of claim 1 is further incorporated, and further, the claim recites: wherein the neuron circuits comprise analog neuron circuits having adjustable randomness. This limitation amounts to more specifics of the judicial exception identified in the rejection of claim 1 above. The claim does not include any additional elements that amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception. The claim is not patent eligible Regarding claim 5, the rejection of claim 4 is further incorporated, and further, the claim recites: wherein the neuron circuits comprise stochastic neurons. This limitation amounts to more specifics of the judicial exception identified in the rejection of claim 1 above. The claim does not include any additional elements that amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception. The claim is not patent eligible Regarding claim 6, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein at least one of the state machine memory module and the neural network memory module comprises processing in memory (PIM) controller.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 7, the rejection of claim 6 is further incorporated, and further, the claim recites: wherein at least one of the state machine memory module and the neural network memory module comprises SRAM. This limitation amounts to more specifics of the judicial exception identified in the rejection of claim 1 above. The claim does not include any additional elements that amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception. The claim is not patent eligible Regarding claim 8, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein the state machine circuit comprises a digital finite-state machine (FSM) configured to compute current satisfiability score from the Boolean states of the clauses and updates the weights to NN memory module to control stochasticity of the neuron circuits.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 9, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein the state machine circuit comprises an input filter configured to process the assignment of the variables to map an input vector to an output vector according to a set of predefined rules.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 10, the rejection of claim 1 is further incorporated, and further, the claim recites: wherein the neural network comprises a recurrent neural network. This limitation amounts to generally linking the judicial exception to a field of use or technological environment. Please see MPEP 2106.05(h). The claim does not include any additional elements that amount to an integration of the judicial exceptions into a practical application, nor to significantly more than the judicial exceptions. The claim is not patent eligible. Regarding claim 11, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein the co-processor is implemented with a host processing unit.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 12, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein the co-processor is implemented as an external integrated circuit.”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 13, the rejection of claim 1 is further incorporated, and further, The claim does recite the additional element of “wherein the solver circuit is configured to solve a Boolean Satisfiability problem (SAT).”, however it does not amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception, for the reasons set forth in connection with the rejection of claim 1 above. Please see MPEP 2106.05(f). The claim is not patent eligible. Regarding claim 14, Step 1 Analysis: Claim 14 is directed to a process, which falls within one of the four statutory categories. Step 2A Prong 1 Analysis: Claim 14 recites, in part, The limitations of: mapping a plurality of Boolean states corresponding to the clauses of the Boolean problem can be considered to be an evaluation in the human mind generating an assignment of variables based on the Boolean problem [by a plurality of neuron circuits]; can be considered to be an evaluation in the human mind computing a score for the assignment of variables; can be considered to be an evaluation in the human mind determining a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities; can be considered to be an evaluation in the human mind These limitations as drafted, are processes that, under broadest reasonable interpretation, covers performance of the limitation in the mind or with the aid of pen and paper which falls within the “Mental Processes” grouping of abstract ideas. Accordingly, the claim recites an abstract idea. Step 2A Prong 2 Analysis: This judicial exception is not integrated into a practical application. In particular, the claim recites the additional elements - “by a plurality of neuron circuits” and “inputting the plurality of weights to a neural network acceleration module, wherein the neural network acceleration module is configured to update the weights of a state machine memory module iteratively to guide a solver toward a higher number of satisfied clauses of the Boolean problem.”. Thus, these elements in the claim are recited at a high level of generality such that they amount to no more than mere instructions to apply the exception using a generic computer component. Please see MPEP 2106.05(f). Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea. The claim further recites: receiving binary inputs corresponding to variables and clauses for a Boolean problem. This limitation is a mere data gathering step and thus is an insignificant extra-solution activity. Accordingly, these additional elements do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea. The claim as a whole is directed to an abstract idea. Step 2B Analysis: The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements of utilizing a plurality of neuron circuits and a neural network acceleration module to perform the steps of the claimed process amount to no more than mere instructions to apply the exception using a generic computer component. Mere instructions to apply an exception using a generic computer component cannot provide an inventive concept. Furthermore, the limitation of receiving binary inputs corresponding to variables and clauses for a Boolean problem is well-understood, routine, and conventional, as evidenced by MPEP §2106.05(d)(II)(I), “receiving or transmitting data over a network”. These limitations therefore remain insignificant extra-solution activity even upon reconsideration, and does not amount to significantly more. Even when considered in combination, these additional elements amount to mere instructions to apply the exception using generic computer components and insignificant extra-solution activity, which cannot provide an inventive concept. The claim is not patent eligible. Regarding Claim 15, it recites features similar to claim 4 and is rejected for at least the same reasons therein. Regarding Claim 16, it recites features similar to claim 5 and is rejected for at least the same reasons therein. Regarding claim 17, the rejection of claim 14 is further incorporated, and further, the claim recites: wherein the Boolean problem comprises a Boolean SAT. This limitation amounts to generally linking the judicial exception to a field of use or technological environment. Please see MPEP 2106.05(h). The claim does not include any additional elements that amount to an integration of the judicial exceptions into a practical application, nor to significantly more than the judicial exceptions. The claim is not patent eligible. Regarding Claim 18, it recites features similar to claim 6 and is rejected for at least the same reasons therein. Regarding claim 19, the rejection of claim 14 is further incorporated, and further, the claim recites: further comprising filtering the binary inputs based on a set of predefined rules. This claim recites additional mental steps in addition to the judicial exception identified in the rejection of claim 14, thus recites a judicial exception. The claim does not include any additional elements that amount to an integration of the judicial exceptions into a practical application, nor to significantly more than the judicial exceptions. The claim is not patent eligible. Regarding claim 20, the rejection of claim 14 is further incorporated, and further, the claim recites: wherein the plurality of learning probabilities comprise global learning probabilities and local learning probabilities. This limitation amounts to more specifics of the judicial exception identified in the rejection of claim 14 above. The claim does not include any additional elements that amount to an integration of the judicial exception into a practical application, nor to significantly more than the judicial exception. The claim is not patent eligible Allowable Subject Matter Claims 1-20 are objected to as being allowable over prior art if all outstanding rejections were withdrawn. None of the prior art, either alone or in combination, fairly discloses limitations of claims 1 and 14 in particular: Claim 1: provide the plurality of weights to NN memory module, wherein the weights of the state machine memory module are iteratively updated through unsupervised global learning rules and local learning rules, the global learning guides solver towards the higher number of satisfied clauses, and the local learning guides the system to explore a local problem region. Claim 14: inputting the plurality of weights to a neural network acceleration module, wherein the neural network acceleration module is configured to update the weights of a state machine memory module iteratively to guide a solver toward a higher number of satisfied clauses of the Boolean problem. No prior art was uncovered which fairly discloses the particular functions of each module disclosed in the claims and more specifically updating weights of a state machine memory module in order to guide a solver. The closest prior art uncovered was Pedretti et al. (“US 20230410903 A1”) which discloses a method of solving a K-SAT problem, more specifically discloses the limitations of receiving binary inputs, mapping a plurality of Boolean states, generating an assignment of variables, however the prior art fails to explicitly teach determining a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities; inputting the plurality of weights to a neural network acceleration module wherein the weights of the state machine memory module are iteratively updated Yakopcic et al. (“US 20210019597 A1”) discloses a spiking neural network associated with clause values associated with a SAT problem. The reference discloses a general architecture of neural-hardware SAT system however the reference does not go into details of determining a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities; inputting the plurality of weights to a neural network acceleration module wherein the weights of the state machine memory module are iteratively updated Pershyn (“US 20210342681 A1”) discloses methods for finding solution to hard problems including maximum satisfiability using Boolean hybrid computing circuits. However the prior art does not specifically teach determining a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities; inputting the plurality of weights to a neural network acceleration module wherein the weights of the state machine memory module are iteratively updated as required by the claims. Si et al. (“US 20220044097 A1”) discloses satisfiability solving for Boolean formulas using restricted Boltzmann machines. The reference discloses a satisfiability solver system that receives an input Boolean formula and a satisfiability criteria and generates satisfiability results based on the request. However the prior art fails to explicitly disclose determining a plurality of learning probabilities to generate a plurality of weights based on the plurality of learning probabilities; inputting the plurality of weights to a neural network acceleration module wherein the weights of the state machine memory module are iteratively updated as required by the claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL H HOANG whose telephone number is (571)272-8491. The examiner can normally be reached Mon-Fri 8:30AM-4:30PM. 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, Kakali Chaki can be reached at (571) 272-3719. 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. /MICHAEL H HOANG/PRIMARY EXAMINER, Art Unit 2122
Read full office action

Prosecution Timeline

Feb 19, 2024
Application Filed
Oct 19, 2026
Non-Final Rejection mailed — §101, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12801899
MULTI-RESOLUTION FIELD REPRESENTATIONS IN NEURAL NETWORKS
3y 2m to grant Granted Nov 17, 2026
Patent 12792922
MACHINE LEARNING MODEL UPDATE BASED ON DATASET OR FEATURE UNLEARNING
3y 9m to grant Granted Nov 10, 2026
Patent 12792896
Solving Inaccuracies Associated with 0bject Detection
3y 1m to grant Granted Nov 10, 2026
Patent 12770064
METHODS AND SYSTEMS FOR OPERATIONAL SURVEILLANCE OF A PHYSICAL ASSET USING SMART EVENT DETECTION
3y 1m to grant Granted Oct 20, 2026
Patent 12762421
SYSTEM AND METHOD FOR MULTI-OBJECTIVE REINFORCEMENT LEARNING
3y 6m to grant Granted Oct 13, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
55%
Grant Probability
76%
With Interview (+21.2%)
4y 4m (~1y 7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 161 resolved cases by this examiner. Grant probability derived from career allowance 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