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 .
The following is a Final Office Action in response to communications received on 9/14/2026. Claims 1 and 3-20 are currently pending and have been examined. Claims 1, 3, 8, and 15 have been amended. Claim 2 is cancelled.
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.
Step 1: The claims 1-7 are a computer readable medium, claims 8-14 are a method and claims 15-20 are a system. Thus, each independent claim, on its face, is directed to one of the statutory categories of 35 U.S.C. §101. However, the claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
Step 2A Prong 1: The independent claims (1, 8 and 15, taking claim 1 as a representative claim) recite:
One or more computer storage media storing computer-usable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations, the operations comprising:
receivinginformation regarding an activity involving a user interaction by a user with an online transaction platform and one or more risk signatures;
persisting, in a time series database, the event data for each of the plurality of checkpoint as an immutable record for the user, the immutable record sorted by time sequence;
converting, without human intervention, a search query into graph traversal logic, wherein the search query is in a domain-specific language and defines a combination of risk signatures, within a look back time window, indicative of fraud;
at a current checkpoint in a current user workflow of the user, retrieving, from the time series database, in a single read operation, a subset of the event data for each of the plurality of checkpoint within the look back time window, the look back time window being bounded by a first timestamp and a second timestamp, wherein bounding the look back time window by the first timestamp and the second timestamp enables the subset of the event data to be fetched in the single read operation;
generating, in memory, a knowledge graph using the subset of the event data for each of the plurality of checkpoint retrieved in the single read operation, wherein the knowledge graph is organized as a topologically-sorted time-ordered graph between the first timestamp and the second timestamp, and wherein the knowledge graph comprises activities as vertices and qualifiers for activities as adjacency relations between activities;
traversing the knowledge graph utilizing the graph traversal logic, by testing adjacency relations to identify, in memory, the combination of risk signatures within the look back time window; and
based on the traversing, dynamically modifying the current user workflow to prevent fraudulent activity.
These limitations, except for the italicized portions, under their broadest reasonable interpretations, recite certain methods of organizing human activity for managing personal behavior or relationships or interactions between people (including social activities, teaching, and following rules or instructions) as well as commercial or legal interactions (including agreements in the form of contracts; legal obligations; advertising, marketing or sales activities or behaviors; business relations). The claimed invention recites steps for preventing fraud in online transactions (see [0002 of the instant specification) through the analysis of user activities being converted into a knowledge graph, searching for fraudulent activities, and modifying workflow based on the findings. The steps under its broadest reasonable interpretation specifically fall under sales activities. The Examiner notes that although the claim limitations are summarized, the analysis regarding subject matter eligibility considers the entirety of the claim and all of the claim elements individually, as a whole, and in ordered combination.
Prong 2: This judicial exception is not integrated into a practical application. In particular, the claims recite the additional elements of
One or more non-transitory computer storage media storing computer-usable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations, the operations comprising: (claim 1)
A computer-implemented method comprising: (claim 8)
A computer system comprising: one or more processors; and one or more computer storage medium storing computer-usable instructions that, when used by the one or more processors, causes the computer system to perform operations comprising: (claim 15)
an online transaction platform and one or more risk signatures;
single read operation;
persisting, in a time series database, the event data;
retrieving, from the time series database, a subset of the event data;
generating, in memory, a knowledge graph
The additional elements of emphasized above are recited at a high-level of generality (i.e., as a generic processor performing a generic computer function of processing data) such that it amounts no more than mere instructions to apply the exception using a generic computer component. The limitations do not impose any meaningful limits on practicing the abstract idea, and therefore do not integrate the abstract idea into a practical application – MPEP 2106.05(f).
Accordingly, these additional elements when considered individually or as a whole do not integrate the abstract idea into a practical application because they do not impose any meaningful limits on practicing the abstract idea. The independent claims are directed to an abstract idea.
Step 2B: The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed with respect to Step 2A Prong two, the additional elements in the claims amount to no more than mere instructions to apply the judicial exception using a generic computer component.
Even when considered as an ordered combination, the additional elements of claim 1, 8, and 15 do not add anything that is not already present when they are considered individually. Therefore, under Step 2B, there are no meaningful limitations in claims 1, 8, and 15 that transform the judicial exception into a patent eligible application such that the claims amount to significantly more than the judicial exception itself (see MPEP 2106.05).
As such, independent claims 1, 8, and 15 are ineligible.
Dependent claims 2-7, 9-14, and 16-20 when analyzed as a whole, are held to be patent ineligible under 35 U.S.C. §101 because the additional recited limitations fail to establish that the claims are not directed to the same abstract idea of Independent Claims 1, 8 and 15 without significantly more.
Claim 3 recites further comprising, receiving, at a user interface, a search query for signatures of risk indicators, wherein the signatures of risk indicators comprise a combination of signatures. The limitation merely further limits the abstract idea and recited the additional element of a user interface. However, the interface is recited at a high level of generality and does not recite significantly more to integrate the judicial exception into a practical application.
Claim 4 recites further comprising, aggregating a geolocation of a user device corresponding to the user workflow, a device type of the user device, and browser or application information corresponding to the user workflow. The limitation merely further limits the abstract idea and does not recite significantly more to integrate the judicial exception into a practical application.
Claim 5 recites further comprising, enabling, at a user interface, a business user to dynamically specify the checkpoint in the user workflow. The limitation merely further limits the abstract idea and recited the additional element of a user interface. However, the interface is recited at a high level of generality and does not recite significantly more to integrate the judicial exception into a practical application.
Claim 6 recites further comprising, enabling, at a user interface, a business user to dynamically search for the combination of signatures leading up to the checkpoint in the user workflow. The limitation merely further limits the abstract idea and recited the additional element of a user interface. However, the interface is recited at a high level of generality and does not recite significantly more to integrate the judicial exception into a practical application.
Claim 7 recites wherein the checkpoint comprises: user registration, user sign in, change in shipping address, change in email address, change in user device, or checkout. The limitation merely further limits the abstract idea and does not recite significantly more to integrate the judicial exception into a practical application.
Claims 9-14 and 16-20 recite parallel claim language and therefore are also rejected for the reasons set forth above. For these reasons claims 1-20 are rejected under 35 USC 101.
Subject Matter Free of Prior Art
Claims 1, 8 and 15 are determined to have overcome the prior art of rejection and are free of prior art, however the claims remain rejected under 35 USC 101, as set forth above. All dependent claims are also free of prior art by virtue of dependency, but remain rejected under 35 USC 101.
Taking amended claim 1 as a representative claim, the claims as amended are found to overcome the prior art rejection for the reasons set forth below.
Claim 1 now recites the additional claimed features of
converting, without human intervention, a search query into graph traversal logic, wherein the search query is in a domain-specific language and defines a combination of risk signatures, within a look back time window, indicative of fraud;
traversing the knowledge graph utilizing the graph traversal logic, by testing adjacency relations to identify, in memory, the combination of risk signatures within the look back time window; and
In addition to the previously cited prior art, which does not disclose the limitations above, the closest prior art found for the newly added limitations was found to be:
Reddy US20190259033 discloses the process for constructing a fingerprint for an individual which comprises a compact knowledge graph representation of the behaviors of the individual related to financial matters. Once receiving a new financial transaction, time-based behavior over a period of time is reviewed, and a correlation of the current patterns to those of suspicious behavior are determined. A risk score is generated for the current instance and based on the risk score and monitoring of the behavior pattern; a prediction of an action is determined (see Figure 5). However, the reference does not disclose converting, without human intervention, a search query into graph traversal logic, wherein the search query is in a domain-specific language and defines a combination of risk signatures, within a look back time window, indicative of fraud; traversing the knowledge graph utilizing the graph traversal logic, by testing adjacency relations to identify the combination of risk signatures, as required by the claimed invention.
“Towards Fraud Detection Methodologies” discloses “fraud in financial platforms can therefore be modeled as a recurring lifecycle illustrating the continual response of financial institutions to fraudster behavior (Figure 3). Emerging fraud trends are identified through data analysis and mining techniques over the institutions labeled transactional database to assist in formulation of new security policies and authentication protocols. In response, fraudsters modify their methods based upon new security deployments while identifying alternative fraud opportunities within the current service platform. New fraud patterns resulting from deployed security enhancements are then identified initiating further realignment of the organizations fraud prevention strategy through implementation of additional authentication and security procedures.” Techniques for analyzing the patterns include supervised algorithms and hybrid algorithms. The hybrid algorithms include a graph-theoretic method is used to visually detect communities of interest. However, the reference does not disclose converting, without human intervention, a search query into graph traversal logic, wherein the search query is in a domain-specific language and defines a combination of risk signatures, within a look back time window, indicative of fraud; traversing the knowledge graph utilizing the graph traversal logic, by testing adjacency relations to identify the combination of risk signatures, as required by the claimed invention.
It was found that no references alone or in combination, neither anticipates, reasonable teaches, nor renders obvious the below noted features of Applicant’s invention. The features of claim 1 (and parallel claims 8 and 15) in combination that overcome the prior art are:
converting, without human intervention, a search query into graph traversal logic, wherein the search query is in a domain-specific language and defines a combination of risk signatures, within a look back time window, indicative of fraud;
traversing the knowledge graph utilizing the graph traversal logic, by testing adjacency relations to identify, in memory, the combination of risk signatures within the look back time window; and
Therefore, none of the cited references disclose or render obvious each and every feature of the claimed invention and the claimed invention is determined to be free of the prior art. The examiner emphasizes, that although individually the claimed features could be taught, any combination of references would teach the claimed limitations using a piecemeal analysis, since references would only be combined and deemed obvious based on knowledge gleaned from the applicant's disclosure. Such a reconstruction is improper (i.e., hindsight reasoning). See In re McLaughlin, 443 F.2d 1392, 170 USPQ 209 (CCPA 1971). The examiner emphasizes that it is the interrelationship of the limitations that renders these claims free of the prior art/additional art.
Therefore, it is hereby asserted by the Examiner that, in light of the above, that the claims are free of prior art as the references do not anticipate the claims and do not render obvious any further modification of the references to a person of ordinary skill in art.
Related Art Not Cited
Motaharian (US 2020/0320619) generating graph that represents that represents a community of shared tradelines based on matches between attributes associated with tradelines such as account numbers or account type. A set of machine learning models can be trained using a training dataset to provide a set of rules that is optimized for evaluating the graph to detect synthetic identities.
Steiman (US 11693958) identifying anomalies using knowledge graphs
Response to Arguments
Applicant's arguments filed 5/4/2026 have been fully considered but they are not persuasive.
With respect to the remarks directed to Step 2A Prong 2, the examiner maintains the claims recited an abstract idea. As the applicant notes, the specification states the problem addresses is to organizing user activity between a plurality of time stamps as a knowledge graph. The scale of the amount of data appears to be solved by the organization of data, not by a technical solution to a technical problem. The data held and or processed in memory is merely the application of the abstract idea using an additional element, but not an improvement to the memory itself. Again, the fraud detection queries the database for a timeframe and the information is arranged in a graph for the activities and the relationships of the data. This is merely organization of data and based on the analysis (such as graph traversal), an action is taken related to the business process (freezing an account or blocking a transaction). The examiner does not find the manner in which the information is retrieved to be comparable to that of the Enfish v. Microsoft, decision. In this case, the operations such as retrieving or storing from memory and performing actions in a single operation are recited at a high level of generality. The same analysis applies to the comparison of the instant application to Desjardins, in which there is not machine learning technology itself in the instant application being improved. At most the abstract idea is improved by improving to the business process of stopping fraudulent transactions/activity.
As to the specifics now recited in the amended claim, the examiner asserts the amendment merely further limits the abstract idea and now recited additional limitations that are carrying out the abstract idea at a high level of generality. The claimed invention is not comparable to Example 47 which goes beyond merely identifying an anomaly in a dataset which was rooted in machine learning technology and in parts of the example did not recite an abstract idea itself. Here, the claims recite an abstract idea being carried out by additional elements recited at a high level. The single operation element which an additional element tied to the function of the computer, is merely limited by a set of parameters that are part of the abstract idea (bounding back time window) and the appropriate information is retrieved.
With respect to Step 2B, while the inventive concept may reside in the combination of steps and generic components, the examiner asserts here the combination does not amount to more than the additional elements implementing the abstract idea. While there is no prior art rejection, the considerations for subject matter eligibility and novelty/obviousness differ. Here the novelty lies in the combination of the steps recited, however the combination of the steps and considerations of the limitations alone are in the abstract idea. At most the abstract idea is being improved.
Lastly, the examiner has not asserted that the claims recite well-understood, routine and conventional limitations and therefore the analysis does not require Berkheimer framework/evidence. Therefore the remarks directed to this are moot.
For at least these reasons, the claims remain rejected under 35 USC 101.
Conclusion
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 nonprovisional extension fee (37 CFR 1.17(a)) 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 mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to VICTORIA E. FRUNZI whose telephone number is (571)270-1031. The examiner can normally be reached Monday- Friday 7-4 (EST).
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, Marissa Thein can be reached at (571) 272-6764. 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.
VICTORIA E. FRUNZI
Primary Examiner
Art Unit TC 3689
/VICTORIA E. FRUNZI/Primary Examiner, Art Unit 3689 11/2/2026