Prosecution Insights
Last updated: November 20, 2026
Application No. 19/351,229

Systems and Methods for Node Graph Data Storage Across Disparate Data Sources

Non-Final OA §101
Filed
Oct 06, 2025
Priority
Jun 03, 2022 — provisional 63/348,751 +2 more
Examiner
MIAN, MUHAMMAD U
Art Unit
2163
Tech Center
2100 — Computer Architecture & Software
Assignee
Michigan Health Information Network Shared Services
OA Round
1 (Non-Final)
67%
Grant Probability
Favorable
1-2
OA Rounds
1y 8m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 67% — above average
67%
Career Allowance Rate
249 granted / 370 resolved
+12.3% vs TC avg
Strong +22% interview lift
Without
With
+22.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
21 currently pending
Career history
406
Total Applications
across all art units

Statute-Specific Performance

§101
22.2%
-17.8% vs TC avg
§103
48.5%
+8.5% vs TC avg
§102
8.7%
-31.3% vs TC avg
§112
15.6%
-24.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 370 resolved cases

Office Action

§101
DETAILED ACTION Remarks This Office Action is in response to the application 19/351229 filed on 6 October 2025. Claims 1-20 have been examined. 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 . 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. As to claims 1, 13, and 18, the claims recite a node graph comprising a plurality of entity nodes and a plurality of group entity nodes. The broadest reasonable interpretation (BRI) of this limitation encompasses a simple node graph having just a few entity nodes and a few group entity nodes. These claims recite linking an entity node with a group entity node through a relationship status node, where the relationship status node is as described in the claims. A human could, with the aid of pencil and paper, mentally visualize a simple node graph having an entity node linked to a group entity node through a relationship status node, as claimed. If a claim limitation, under its broadest reasonable interpretation, covers performance of the limitation in the mind (and/or with a pencil and paper) but for the recitation of generic computer components, then it falls within the “Mental Processes” grouping of abstract ideas. These claims also recite adding a string comprising an active status to the relationship status node responsive to data identifying the entity. For the simple node graph encompassed by the BRI of the claims, a human could, with the aid of pencil and paper, mentally perform this limitation. Hence, this limitation is also an abstract idea under the “Mental Processes” grouping. Accordingly, the claim recites an abstract idea. This judicial exception is not integrated into a practical application. Other than the abstract idea, the claims recite the following: a) “receiving, by the processor from a data source corresponding to the group entity, a data file comprising data identifying the entity;” b) “one or more processors configured by machine readable instructions;” and c) “non-transitory computer-readable media comprising instructions”. Limitation (a) amounts to no more than mere data gathering, which has been deemed by the courts to be insignificant extra-solution activity. See MPEP 2106.05(g). Limitations (b) and (c) are recited at a high level of generality, i.e. as generic computer components performing generic computing functions. 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. Looking at the additional elements as a whole adds nothing beyond the additional elements considered individually—they still represent insignificant extra-solution activity and/or generic computer implementation. Hence, the claim as a whole, looking at the additional elements individually and in combination, does not integrate the abstract idea into a practical application. The claim is directed to an abstract idea. The claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception. Limitation (a) amounts to no more than mere data gathering, which has been deemed by the courts to be insignificant extra-solution activity. See MPEP 2106.05(g). In addition, the courts have deemed receiving data to be well-understood, routine, and conventional activity, as in the following cases: Symantec, 838 F.3d at 1321, 120 USPQ2d at 1362 (utilizing an intermediary computer to forward information); OIP Techs., Inc., v. Amazon.com, Inc., 788 F.3d 1359, 1363, 115 USPQ2d 1090, 1093 (Fed. Cir. 2015) (sending messages over a network); buySAFE, Inc. v. Google, Inc., 765 F.3d 1350, 1355, 112 USPQ2d 1093, 1096 (Fed. Cir. 2014) (computer receives and sends information over a network); Versata Dev. Group, Inc. v. SAP Am., Inc., 793 F.3d 1306, 1334, 115 USPQ2d 1681, 1701 (Fed. Cir. 2015) (storing and retrieving information in memory). See MPEP 2106.05(d)(II). As discussed above with respect to integration of the abstract idea into a practical application, additional elements (b) and (c) amount to no more than mere field of use limitations and instructions to apply the exception using generic computer components. Mere instructions to apply an exception using conventional computer components and functions cannot provide an inventive concept. Looking at the additional elements as a whole adds nothing beyond the additional elements considered individually—they still represent insignificant extra-solution activity; well-understood, routine, and conventional subject matter; and/or generic computer implementation. Hence, the claim as a whole, looking at the additional elements individually and in combination, does not amount to significantly more than the abstract idea. These claims are not patent eligible. As to dependent claims 2-6, 9-12, 14-17, and 19-20, these claims merely provide more details of the claimed adding of the string and/or the claimed linking. Given that the BRI of the claims encompasses a simple case, as set forth above, nothing in these claims goes beyond what a human could mentally perform with the aid of pencil and paper. Hence, these dependent claims are also directed to an abstract idea under the “Mental Processes” grouping. As to dependent claims 7-8, these claims recite functionality for calculating an evidence score. The limitations of these claims amount to no more than mathematical calculations. Hence, these claims are directed to an abstract idea under the “Mathematical Concepts” grouping. Alternatively, these claim may be deemed an abstract idea under the “Mental Processes” grouping, since a human could, with the aid of pencil and paper, perform these calculations for the simple case encompassed by the BRI of the claims. Additional Art Considered The prior art made of record and not relied upon is considered pertinent to the Applicants’ disclosure. The following patents and papers are cited to further show the state of the art at the time of Applicants’ invention with respect to node graph data storage across disparate data sources. a. Livesay et al.; “SYSTEMS AND METHODS FOR PREDICTING HEALTHCARE OUTCOMES BASED ON SEMANTIC RELATIONSHIPS”; U.S. PGPub. No. 20190189287 A1. Teaches a node graph data structure that has entity nodes representing entities (i.e. patients) receiving clinical care from group entity nodes (e.g. providers, hospitals, etc.). See para. 0027-0040 and Fig. 2. Teaches that healthcare information is received from disparate data sources, including health organizations, providers, and patients. See para. 0042. Teaches that the system is implemented as a distributed system. See para. 0050. b. Miller et al.; “HIERARCHICAL ASSOCIATION OF ENTITY RECORDS FROM DIFFERENT DATA SYSTEMS”; U.S. PGPub. No. 20170124216 A1. Teaches the use of graph data structures to link patient records (see Figs. 8A, 10A-E, and corresponding paragraphs of specification). Teaches that healthcare information is received from disparate data sources, including electronic health records (EHR), records from a claims system, lab feed, various data sources implementing the HL7 standard, patient satisfaction survey, clinically integrated networks (CIN) or galaxies, etc. See para. 0018 and Fig. 6. Teaches that vertices of the graph data structure are marked as active/inactive (see Figs. 8E-F and corresponding paragraphs of specification) c. Randall et al.; “GRAPH DATABASE FOR OUTBREAK TRACKING AND MANAGEMENT”; U.S. PGPub. No. 20200004746 A1. Teaches a graph data structure that links and shows relationships between patients receiving clinical care and the providers providing the care (see Figs. 8, 9, and 10A-B, and corresponding paragraphs of the specification). Teaches that patient data 206 is received from disparate data sources, including social media servers 204a, demographic servers 204b, geolocation servers 204c, etc. See para.0068-0070 and Fig. 2. Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to UMAR MIAN whose telephone number is (571)270-3970. The examiner can normally be reached Monday to Friday, 10 am to 6:30 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, Tony Mahmoudi can be reached on (571) 272-4078. 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. /Umar Mian/ Primary Examiner, Art Unit 2163
Read full office action

Prosecution Timeline

Oct 06, 2025
Application Filed
Oct 06, 2026
Non-Final Rejection mailed — §101
Nov 06, 2026
Examiner Interview Summary
Nov 06, 2026
Response Filed
Nov 06, 2026
Applicant Interview (Telephonic)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12783500
RECORD-LEVEL TRANSACTION CONFLICT DETECTION AT STORAGE NODES OF A RECORD AWARE DISTRIBUTED DATA STORAGE SYSTEM
2y 4m to grant Granted Nov 03, 2026
Patent 12762185
ISLANDS TECHNIQUE OF GRAPH SYNTHESIS
1y 9m to grant Granted Oct 13, 2026
Patent 12730827
SELECTIVE PROOF OF EXISTENCE USING ORDERED, APPEND-ONLY DATA STORAGE
2y 3m to grant Granted Sep 08, 2026
Patent 12711145
CRAWLING DATA TRANSFORMS
2y 1m to grant Granted Aug 18, 2026
Patent 12689637
System for automatically discovering, enriching and remediating entities interacting in a computer network
5y 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
67%
Grant Probability
90%
With Interview (+22.2%)
2y 10m (~1y 8m remaining)
Median Time to Grant
Low
PTA Risk
Based on 370 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