Prosecution Insights
Last updated: October 04, 2026
Application No. 19/367,922

PATTERN IDENTIFICATION IN STRUCTURED EVENT DATA

Non-Final OA §103§112§DOUBLEPATENT
Filed
Oct 24, 2025
Priority
May 16, 2022 — provisional 63/364,789 +1 more
Examiner
PYO, MONICA M
Art Unit
2161
Tech Center
2100 — Computer Architecture & Software
Assignee
Plaid Inc.
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
2y 1m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
520 granted / 627 resolved
+27.9% vs TC avg
Strong +35% interview lift
Without
With
+35.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
14 currently pending
Career history
645
Total Applications
across all art units

Statute-Specific Performance

§101
20.7%
-19.3% vs TC avg
§103
46.6%
+6.6% vs TC avg
§102
10.4%
-29.6% vs TC avg
§112
14.2%
-25.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 627 resolved cases

Office Action

§103 §112 §DOUBLEPATENT
Notice of Pre-AIA or AIA Status 1. The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . DETAILED ACTION 2. Claims 1-20 are present for examination. Information Disclosure Statement 3. The information disclosure statement (IDS) filed on 10/24/2025 is being considered by the examiner. Double Patenting 4. The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. 5. Claims 4, 11 and 18 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 8 and 14 of U.S. Patent No. 12,468,711. Although the claims at issue are not identical, they are not patentably distinct from each other because the claimed invention of the instant application is a similar version of the claimed invention of the above identified U.S. Patent with the similar intended scope as shown below: Instant Application Patent No. 12,468,711 Claim 1. A system, comprising: one or more memories; and one or more processors, communicatively coupled to the one or more memories, configured to: receive, from a device of a requestor, and by a remote server, a request, wherein the request includes an identifier associated with the requestor that authorizes at least the device to receive structured data; receive, from a data source and by the remote server, a set of structured data including a plurality of entries; determine, by the remote server and based on analyzing the plurality of entries, subsets of the structured data that are representative of different recurring events; [Claim 4. The system of claim 1, wherein determining the subsets of the structured data that are representative of the different recurring events is based on applying a plurality of rules related to the properties associated with the different recurring events.] determine, by the remote server and based on analyzing the subsets of the structured data, properties associated with the different recurring events; generate, by the remote server, a data structure representative of the different recurring events and the properties; and transmit, by the remote server, the generated data structure to a user device. Claim 1. A system for pattern identification, the system comprising: one or more memories; and one or more processors, communicatively coupled to the one or more memories, configured to: receive, from a device, by a remote server, and via an application programming interface (API) call associated with the system, a request, wherein the request includes a parameter that encapsulates a token associated with the device and authorizes the device to receive structured data; receive, from a data source and by the remote server, a set of structured data including a plurality of entries; determine, by the remote server and based on a first entry of the plurality of entries being associated with a same event as a first number of other entries of the plurality of entries, that the first number satisfies a threshold number, wherein the same event is associated with a first type of a first recurring event; determine, by the remote server and based on descriptive data associated with a second entry of the plurality of entries, that the second entry is associated with a second type of a second recurring event, wherein an event associated with the second entry is related to a second number of other entries of the plurality of entries, wherein the second number does not satisfy the threshold number, and wherein the determination of the second entry being associated with the second type of the second recurring event enables distinguishing the first type of the first recurring event from the second type of the second recurring event; determine, by the remote server and for the first recurring event, a first derived property; determine, by the remote server and for the second recurring event, a second derived property; generate, by the remote server, a data structure indicating the first recurring event, the first derived property, the second recurring event, and the second derived property; and transmit, by the remote server and to a user device, the generated data structure. Claim Rejections - 35 USC § 112 6. 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. 7. 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. Regarding claims 1, 8 and 15, claim 1 recites the limitation of “transmit, by the remote server, the generated data structure to a user device” [emphasis added] in line 16. Claim 1 also recites the limitation of “receive, from a device of a requestor” [emphasis added] in line 5. It is unclear how the phrase of “a device of a requestor” is related to the phrase of “a user device.” Clarification is required. Claims 8 and 15 are rejected due to the similar reasons set forth with respect to claim 1. Claims not specifically mentioned above are rejected by virtue of their dependency on a rejected claim. Claim Rejections - 35 USC § 103 8. In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 9. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. 10. Claims 1-3, 5-6, 8-10, 12-13, 15-17 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over US 2019/0035032 (hereinafter Soufiani) in view of U.S. 11,405,379 (hereinafter Clauss). Regarding claims 1, 8 and 15, as far as the claim is understood, Soufiani discloses a system, comprising: one or more memories; and one or more processors, communicatively coupled to the one or more memories, configured to (fig. 1): receive, from a device of a requestor, and by a remote server, a request ([0047-0050]; “receive an allow message from the one or more remote devices…”; “The user identifier can correspond to an individual…”), wherein the request includes an identifier associated with the requestor that authorizes [at least the device] to receive structured data; receive, from a data source and by the remote server, a set of structured data including a plurality of entries ([0009-0010 and 0077]; Table 1 as shown below; “…A set of transaction data is received, wherein each transaction data includes at least a user identifier, a recipient identifier, a date and an amount. A data array of transactions corresponding to a data pair over a time period is created from the set of transaction data. The data array of transactions is stored in a first array data structure in the one or more databases. One or more time-based patterns are identified in the set of transaction data stored in the one or more databases corresponding to the data pair over the time period by projecting the set of transaction data into a frequency domain using a Fourier transformation and identifying and dominant frequencies with the frequency domain using the one or more processors…”); PNG media_image1.png 970 1860 media_image1.png Greyscale determine, by the remote server and based on analyzing the plurality of entries, subsets of the structured data that are representative of different recurring events ([0010 and 0076-0078]; Table 1 as shown above; “…FIG. 3 shows a flow chart of a method 300 in which a user’s transaction data is received and stored as a data structure to be analyzed for identifying patterns in block 302…”); determine, by the remote server and based on analyzing the subsets of the structured data, properties associated with the different recurring events; generate, by the remote server, a data structure representative of the different recurring events and the properties ([0064-0067]; “receiving a new transaction data corresponding to a new completed transaction, a new pending transaction or a new predicted transaction, and storing the new transaction data in the data structure; or adding the new transaction data to the set of transaction data, and repeating the analyzing, classifying, generating and responding steps; or generating one or more new actions whenever the new transaction data matches one or more of the pattern categories, or invoking one or more of the stored actions…”); and PNG media_image2.png 2153 1747 media_image2.png Greyscale transmit, by the remote server, the generated data structure to a user device ([0082-0091]; fig. 8A as shown above; “…As shown in FIG. 8A above, exemplary spending suggestions 800 could display the merchant or vendor name, the approximate amount spent per time period and a suggestion to reduce the spending with an expected savings over a time period”). The reference does not explicitly disclose the feature of wherein an identifier associated with the requestor that authorizes at least the device to receive data. However, such feature is well known in the art as disclosed by Clauss (col. 8, lns. 45-62) it would have been obvious for one with ordinary skill in the art to utilize the teachings of Clauss in the system of Soufiani in view of the desire to enhance the data process system by utilizing the identity authentication scheme resulting in improving the efficiency of securing the recurring events. Regarding claims 2, 9 and 16, while Soufiani discloses the system wherein the request includes a parameter that encapsulates a token associated with the device (Clauss: col. 9, lns. 55-col. 10, lns. 12). Therefore, the limitations of claims 2, 9 and 16 are also rejected in the analysis of claims 1, 8 or 15, and the clams are rejected on that basis. Regarding claims 3, 10 and 17, Soufiani discloses the system wherein the token is generated based on a key associated with the user device (Clauss: col. 11, lns. 37-52). Therefore, the limitations of claims 3, 10 and 17 are also rejected in the analysis of claims 1, 8 or 15, and the clams are rejected on that basis. Regarding claims 5, 12 and 19, Soufiani discloses the system wherein the one or more processors are further configured to: cluster entries of the plurality of entries based on the properties associated with the different recurring events ([0077 and 0082]; fig. 8A as shown above). Regarding claims 6 and 13, Soufiani discloses the system wherein the generated data structure includes information related to an inflow stream and an outflow stream ([005-0046 and 0057]). 11. Claims 4, 7, 11, 14, 18 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Soufiani in view of Clauss, and further in view of US 2021/0406896 (hereinafter Chaturvedi). Regarding claims 4, 11 and 18, Soufiani discloses the system wherein determining the subsets of the structured data that are representative of the different recurring events is [based on applying a plurality of rules] related to the properties associated with the different recurring events ([0009-0010]). The reference does not explicitly disclose the limitation of “recurring events is applying a plurality of rules.” However, such features are well known in the art as disclosed by Chaturvedi ([0079]) and it would have been obvious for one with ordinary skill in the art to utilize the teachings of Chaturvedi in the system of Soufiani in view of the desire to enhance the data process system by utilizing the processing rules resulting in improving the efficiency of identifying the transaction patterns. Regarding claims 7, 14 and 20, Soufiani discloses the system wherein the one or more processors are further configured to: [standardize] information associated with the structured data; and filter the structured data based on information associated with the properties ([0020-0021]). Soufiani does not explicitly disclose the feature of utilizing standardize information. However, such features are well known in the art as disclosed by Chaturvedi ([0075 and 0093]) and it would have been obvious for one with ordinary skill in the art to utilize the teachings of Chaturvedi in the system of Soufiani in view of the desire to enhance the transaction data process by utilizing the specific configuration scheme resulting in improving the efficiency of identifying the transaction patterns. Conclusion 12. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MONICA M PYO whose telephone number is (571)272-8192. The examiner can normally be reached Monday-Friday 8am-4pm. 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, APU MOFIZ can be reached at 571-272-4080. 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. /MONICA M PYO/Primary Examiner, Art Unit 2161
Read full office action

Prosecution Timeline

Oct 24, 2025
Application Filed
Sep 16, 2026
Non-Final Rejection mailed — §103, §112, §DOUBLEPATENT (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12748790
HYBRID DATABASE INTERFACE WITH INTENT EXPANSION
4y 0m to grant Granted Sep 29, 2026
Patent 12724766
SYSTEMS AND METHODS FOR WRITING UPDATES TO AND/OR READING PREVIOUSLY STORED UPDATES OF ASSETS IMPLEMENTED AS SMART CONTRACTS ON A DECENTRALIZED DATABASE
1y 8m to grant Granted Sep 01, 2026
Patent 12717685
DISTRIBUTED TRANSACTION MANAGEMENT DEVICE AND DISTRIBUTED TRANSACTION MANAGEMENT METHOD
2y 6m to grant Granted Aug 25, 2026
Patent 12711167
SYSTEMS AND METHODS FOR AUTOMATIC GENERATION OF DATASETS FOR RECORD OBJECTS USING MACHINE LEARNING ARCHITECTURES
2y 0m to grant Granted Aug 18, 2026
Patent 12688436
ARTIFICIAL INTELLIGENCE ADVISORY SYSTEMS AND METHODS FOR BEHAVIORAL PATTERN MATCHING AND LANGUAGE GENERATION
2y 2m to grant Granted Jul 21, 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
83%
Grant Probability
99%
With Interview (+35.3%)
3y 1m (~2y 1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 627 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