Prosecution Insights
Last updated: May 29, 2026
Application No. 18/507,044

TASK-GUIDED GRAPH AUGMENTATION AND EDITING FOR NODE CLASSIFICATION AND FRAUD DETECTION

Non-Final OA §101§112
Filed
Nov 11, 2023
Examiner
POLLOCK, GREGORY A
Art Unit
3691
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Massachusetts Institute Of Technology
OA Round
2 (Non-Final)
11%
Grant Probability
At Risk
2-3
OA Rounds
2y 6m
Est. Remaining
24%
With Interview

Examiner Intelligence

Grants only 11% of cases
11%
Career Allowance Rate
71 granted / 642 resolved
-40.9% vs TC avg
Moderate +13% lift
Without
With
+12.6%
Interview Lift
resolved cases with interview
Typical timeline
5y 1m
Avg Prosecution
23 currently pending
Career history
676
Total Applications
across all art units

Statute-Specific Performance

§101
23.2%
-16.8% vs TC avg
§103
59.5%
+19.5% vs TC avg
§102
3.6%
-36.4% vs TC avg
§112
11.9%
-28.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 642 resolved cases

Office Action

§101 §112
DETAILED ACTION The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This action is responsive to claims filed 12/09/2025 and Applicant’s communication regarding application 18/507044 filed 12/09/2025. Claims 1-3, 5, 7-11, 13, and 15- 20 have been examined with this office action. 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-3, 5, 7-11, 13, and 15- 20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea of performance of a downstream task (fraudulent transaction prediction) without significantly more. Subject Matter Eligibility Standard When considering subject matter eligibility under 35 U.S.C. 101, it must be determined whether the claim is directed to one of the four statutory categories of invention, i.e., process, machine, manufacture, or composition of matter. If the claim does fall within one of the statutory categories, it must then be determined whether the claim is directed to a judicial exception (i.e., law of nature, natural phenomenon, and abstract idea), and if so, it must additionally be determined whether the claim is a patent-eligible application of the exception. If an abstract idea is present in the claim, any element or combination of elements in the claim must be sufficient to ensure that the claim amounts to significantly more than the abstract idea itself. Examples of abstract ideas include fundamental economic practices; certain methods of organizing human activities; an idea itself; and mathematical relationships/formulas. Alice Corporation Pty. Ltd. v.CLS Bank International, et al., 573 U.S. _ (2014) as provided by the interim guidelines FR 12/16/2014 Vol. 79 No. 241. Analysis Step 1, the claimed invention must be to one of the four statutory categories. 35 U.S.C. 101 defines the four categories of invention that Congress deemed to be the appropriate subject matter of a patent: processes, machines, manufactures and compositions of matter. In this case independent claim 1 and all claims which depend from it are directed toward a method, and independent claim 10 and all claims which depend from it are directed toward a system and independent claim 17 all claims which depend from it are directed toward a computer program product comprising a computer readable storage medium storing instruction to perform functions/steps. As such, all claims fall within one of the four categories of invention deemed to be the appropriate subject matter. Step 2A Prong 1, Under Step 2 A, Prong 1 of the 2019 Revised § 101 Guidance, it is determined whether the claims are directed to a judicial exception such as a law of nature, a natural phenomenon, or an abstract idea (See Alice, 134 S. Ct. at 2355) by identify the specific limitation(s) in the claim that recites abstract idea(s); and then determine whether the identified limitation(s) falls within at least one of the groupings of abstract ideas enumerated in the 2019 PEG. Specifically, claim 1 comprises inter alia the functions or steps of “A computer-implemented method for task-guided graph augmentation and editing, the computer-implemented method comprising: receiving an input graph in an observed financial transaction network; extracting, using a task-guided context extractor, network contextual information from the input graph by sampling a set of temporal random walk sequences conditioned on a downstream task, wherein the extracted network contextual information includes topological properties and temporal properties of the input graph; training a multi-resolution temporal generative model based on the set of temporal random walk sequences; learning, based on the training of the multi-resolution temporal generative model, a data augmentation function that maintains a true data distribution of the input graph; and generating, based on the data augmentation function, an augmented financial transaction network that enhances performance of the downstream task and preserves the topological properties and the temporal properties of the input graph”. Claim 10 comprises inter alia the functions or steps of “A system comprising: a processor; a data bus coupled to the processor; a memory coupled to the data bus; and a computer-usable medium embodying a computer program code, the computer program code comprising instructions executable by the processor and configured to: receive an input graph in an observed financial transaction network; extract, using a task-guided context extractor, network contextual information from the input graph by sampling a set of temporal random walk sequences conditioned on a downstream task, wherein the extracted network contextual information includes topological properties and temporal properties of the input graph; train a multi-resolution temporal generative model based on the set of temporal random walk sequences; learn, based on the training of the multi-resolution temporal generative model, a data augmentation function that maintains a true data distribution of the input graph; and generate, based on the data augmentation function, an augmented financial transaction network that enhances performance of the downstream task and preserves the topological properties and the temporal properties of the input graph”. Claim 17 comprises inter alia the functions or steps of “A computer program product for task-guided graph augmentation and editing, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform operations comprising: receiving an input graph in an observed financial transaction network; extracting, using a task-guided context extractor, network contextual information from the input graph by sampling a set of temporal random walk sequences conditioned on a downstream task, wherein the extracted network contextual information includes topological properties and temporal properties of the input graph; training a multi-resolution temporal generative model based on the set of temporal random walk sequences; learning, based on the training of the multi-resolution temporal generative model, a data augmentation function that maintains a true data distribution of the input graph; and generating, based on the data augmentation function, an augmented financial transaction network that enhances performance of the downstream task and preserves the topological properties and the temporal properties of the input graph”. Those claim limits in bold are identified as claim limitations which recite the abstract idea, while those that are un-bolded are identified as additional elements. The cited limitations as drafted are systems and methods that, under their broadest reasonable interpretation, covers performance of a method of organizing human activity, but for the recitation of the generic computer components. Further, none of the limitations recite technological implementations details for any of the steps but, instead, only recite broad functional language being performed by the generic use of at least one processor. Performance of a downstream task (fraudulent transaction prediction) is a fundamental economic practice long prevalent in commerce systems. If a claim limitation, under its broadest reasonable interpretation, covers a fundamental economic principle or practice but for the general linking to a technological environment, then it falls within the organizing human activity grouping of abstract ideas. Accordingly, the claim recites an abstract idea. Step 2A Prong 2, Next, it is determined whether the claim is directed to the abstract concept itself or whether it is instead directed to some technological implementation or application of, or improvement to, this concept, i.e., integrated into a practical application. See, e.g., Alice, 573 U.S. at 223, discussing Diamond v. Diehr, 450 U.S. 175 (1981). The mere introduction of a computer or generic computer technology into the claims need not alter the analysis. See Alice, 573 U.S. at 223—24. “[T]he relevant question is whether the claims here do more than simply instruct the practitioner to implement the abstract idea on a generic computer.” Alice, 573 U.S. at 225. In the present case, the judicial exception is not integrated into a practical application. The claim limitations are not indicative of integration into a practical application by claiming an improvement to the functioning of the computer or to any other technology or technical field. Further, the claim limitations are not indicative of integration into a practical application by applying or using the judicial exception in some other meaningful way. In particular, the claims contain the following additional elements: a system; a processor; a data bus; a memory; a computer-usable medium; a computer program code / program instructions; a computer program product; a computer readable storage medium; training / learning. However, the specification description of the additional elements a system ([Figure 9, element 900] [0068]); a processor ([Figure 9, element 910] [0068]); a data bus ([0006]); a memory ([0067]); a computer-usable medium ([0006]); a computer program code / program instructions ([0006]); a computer program product ([0066-0067]); a computer readable storage medium ([0067] [0088]); training / learning ([0004] [0025] [0065]) are at a high level of generality using exemplary language or as part of a generic technological environment and are functions any general purpose computer performs such that it amount no more than mere instruction to apply the exception to a particular technological environment. Further, none of the limitations recite technological implementations details for any of the steps but, instead, only recite broad functional language being performed by the generic use of at least one processor. Accordingly, these additional elements do not integrate the abstract idea into a practical application because it does not impose any meaning limits on practicing the abstract idea. Thus, the claim is directed toward an abstract idea. Step 2B, the claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception because the additional elements when considered both individually and as an ordered combination do not amount to significantly more that the abstract idea(s). As discussed above with respect to integration of the abstract idea into a practical application, the additional element of using a processor to perform the abstract idea(s) amounts to no more than mere instructions to apply the exaction using a generic computer component. Mere instruction to apply an exertion using a generic computer component cannot provide an inventive concept. These generic computer components are claimed at a high level of generality to perform their basic functions which amount to no more than generally linking the use of the judicial exception to the particular technological environment of field of use (Specification as cited above for additional elements) and further see insignificant extra-solution activity MPEP § 2106.05 I. A. iii, 2106.05(b), 2106.05(b) III, 2106.05(g). Thus, the claims are not patent eligible. As for dependent claims 2-3, 5, 7-9, 11, 13, 15-16, and 18- 20 these claims recite limitations that further define the same abstract idea using previously identified additional elements noted from the respective independent claims from which they depend. Therefore, the cited dependent claims are considered patent ineligible for the reasons given above. Prior Art The claims overcome the prior art of record such that none of the cited prior art reference’s disclosures can be applied to form the basis of a 35 USC § 102 rejection nor can they be combined to fairly suggest in combination, the basis of a 35 USC § 103 rejection when the limitations are read in the particular environment of the claims. The prior art of record, Rossi (US Patent No. 10728104), Shekhar (US Patent No. 11403643), and Sun (PGPub No. 20230351215) all teach the use temporal random walk algorithm used in fraud detection. However, none of the prior art teaches the use of the terms “true data distribution” and that they “preserve topological and temporal properties of the input graph”. The examiner notes that these functional objectives are merely claimed at a high level of generality without implementation details of how the functional objectives are achieved. Therefore, the claims may be allowable if amended to overcome the rejection(s) under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), 2nd paragraph and 35 U.S.C. 101, set forth in this Office action. Response to Arguments Applicant's arguments with regards to claims have been fully considered but they are not persuasive. EXAMINER’S RESPONSE TO APPLICANT REMARKS CONCERNING Claim Rejections - 35 USC § 101: Applicant's arguments with regards to 35 USC § 101 have been fully considered but are not persuasive. The learning and training are claimed at a high level of generality and are merely linked to the abstract idea of the claim. Regarding applicant’s argument directed toward paragraph [0037], [0039], and [0040], this argument and those which follow on pages 12-13 are moot since the content of cited paragraphs is no currently in the claims. None of the prior art teaches the use of the terms “true data distribution” and that they “preserve topological and temporal properties of the input graph”. However, the examiner maintains that these functional objectives are merely claimed at a high level of generality without implementation details of how the functional objectives are achieved within the claims. As such, the examiner maintains the rejection. Conclusion For prior art made of record and not relied upon is considered pertinent to applicant's disclosure see Notice of References Cited items A-E submitted 09/10/2025 used as prior art and in the conclusion section in the office action submitted 09/10/2025. Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Gregory A Pollock whose telephone number is (571) 270-1465. The examiner can normally be reached M-F 8 AM - 4 PM. 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, Abhishek Vyas can be reached on 571 270-1836. 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. /Gregory A Pollock/Primary Examiner, Art Unit 3691 02/03/2026
Read full office action

Prosecution Timeline

Nov 11, 2023
Application Filed
Sep 10, 2025
Non-Final Rejection mailed — §101, §112
Dec 09, 2025
Response Filed
Feb 05, 2026
Final Rejection mailed — §101, §112
Apr 06, 2026
Response after Non-Final Action
May 05, 2026
Request for Continued Examination
May 08, 2026
Response after Non-Final Action

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12094003
Apparatus, method and system for providing an electronic marketplace for trading credit default swaps and other financial instruments, including a trade management service system
1y 1m to grant Granted Sep 17, 2024
Patent 12045786
SYSTEMS AND METHODS FOR GLOBAL TRANSFERS
3y 9m to grant Granted Jul 23, 2024
Patent 12033216
SYSTEM AND METHOD FOR A MACHINE LEARNING SERVICE
1y 1m to grant Granted Jul 09, 2024
Patent 11922381
DISTRIBUTED TRANSACTION SYSTEM
5y 12m to grant Granted Mar 05, 2024
Patent 11900455
METHOD AND APPARATUS FOR DECENTRALIZED VC FUNDS
2y 7m to grant Granted Feb 13, 2024
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

2-3
Expected OA Rounds
11%
Grant Probability
24%
With Interview (+12.6%)
5y 1m (~2y 6m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 642 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