Prosecution Insights
Last updated: April 19, 2026
Application No. 19/216,314

OBJECT-BASED SEARCH PROCESSING

Non-Final OA §101§DP
Filed
May 22, 2025
Examiner
UDDIN, MOHAMMED R
Art Unit
2161
Tech Center
2100 — Computer Architecture & Software
Assignee
Caret Holdings Inc.
OA Round
1 (Non-Final)
78%
Grant Probability
Favorable
1-2
OA Rounds
3y 3m
To Grant
99%
With Interview

Examiner Intelligence

Grants 78% — above average
78%
Career Allow Rate
564 granted / 726 resolved
+22.7% vs TC avg
Strong +31% interview lift
Without
With
+30.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
23 currently pending
Career history
749
Total Applications
across all art units

Statute-Specific Performance

§101
22.4%
-17.6% vs TC avg
§103
51.9%
+11.9% vs TC avg
§102
5.4%
-34.6% vs TC avg
§112
8.8%
-31.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 726 resolved cases

Office Action

§101 §DP
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 . This action is in response to the communication filed on June 06, 2025. Claims 2-21 are examined and are pending. Double Patenting A rejection based on double patenting of the “same invention” type finds its support in the language of 35 U.S.C. 101 which states that “whoever invents or discovers any new and useful process... may obtain a patent therefor...” (Emphasis added). Thus, the term “same invention,” in this context, means an invention drawn to identical subject matter. See Miller v. Eagle Mfg. Co., 151 U.S. 186 (1894); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Ockert, 245 F.2d 467, 114 USPQ 330 (CCPA 1957). A statutory type (35 U.S.C. 101) double patenting rejection can be overcome by canceling or amending the claims that are directed to the same invention so they are no longer coextensive in scope. The filing of a terminal disclaimer cannot overcome a double patenting rejection based upon 35 U.S.C. 101. 5. Claims 2-21 are rejected under 35 U.S.C. 101 as claiming the same invention as that of claims 1-20 of prior U.S. Patent No. 12,332,879 B2. This is a double patenting rejection. Present Application: 19216314 Patent: 12,332,879 B2 2. (NEW) A method, comprising: parsing and translating records of structured data into object data associated with objects; providing, for each object, at least one function to access corresponding object data; and providing the objects within a processing environment for accessing the records via calls made by applications to a corresponding object's at least one function. 3. (NEW) The method of claim 2 further comprising, providing duplicated objects for the objects within a second processing environment in parallel to the processing environment for accessing the records via other calls made by other applications of the second processing environment. 4. (NEW) The method of claim 3, wherein parsing further includes embedding primary data associated with each record within the corresponding object data of a corresponding object. 5. (NEW) The method of claim 2, wherein parsing further includes using a schema for the structured data to identify keys, fields, and primary data associated with each record. 6. (NEW) The method of claim 2, wherein providing the objects further includes loading each object into memory associated with the processing environment as executable code. 7. (NEW) The method of claim 2, wherein providing, for each object, further includes providing, for each object, the at least one function as search and retrieval functions for the applications to call within the processing environment and access corresponding primary data of corresponding records of the structured data. 8. (NEW) The method of claim 2, wherein providing, for each object, further includes providing, for each object, at least one input parameter for input data used by the at least one function. 9. (NEW) The method of claim 2, wherein providing, for each object, further includes providing, for each object, the at least one function as a match function that takes as input search criteria provided as input parameters and returns corresponding values associated with the corresponding object data of a corresponding object that matches the input search criteria. 10. (NEW) The method of claim 2, wherein parsing and translating further includes: identifying search keys, fields, and primary data; tagging the search keys, the fields, and the primary data; and embedding tagged data within the corresponding object data for each object. 11. (NEW) The method of claim 2, wherein providing, for each object, the at least one function further includes creating the corresponding object data with dynamic interpretable source code for the at least one function that is dynamically executed when called by a corresponding application within the processing environment. 12. (NEW) The method of claim 11, wherein creating further includes creating the dynamic interpretable source code for the at least one function with input parameters to receive input data provided by the corresponding application during a corresponding call. 13. (NEW) A method, comprising: embedding primary data of records for structured data into sets of object data, wherein each set of object data corresponds to a certain record of the structured data; generating source code for searching each set of object data based on input data provided as one or more parameters to a corresponding source code; encapsulating each set of object data into an executable instance of an object; loading executable instances of objects from the sets of object data into memory of a processing environment; and executing, by executable instances of the objects, searches based on corresponding input data provided by applications that call the executable instances of the objects from the processing environment. 14. (NEW) The method of claim 13 further comprising: loading second executable instances of the objects into a second memory of a second processing environment; and executing, by the second executable instances of the objects and in parallel with the executable instances of the objects in the processing environment, second searches based on additional corresponding input provided by second applications that call the second executable instances of the objects from the second processing environment. 15. (NEW) The method of claim 13, wherein encapsulating further includes providing the source code as dynamically interpretable source code that does not requiring compiling of the source code to produce the executable instances of the objects. 16. (NEW) The method of claim 13, wherein encapsulating further includes compiling the source code producing the executable instances of the objects. 17. (NEW) The method of claim 16, wherein compiling further includes linking the source code for each executable instance of each object within the memory associated with the processing environment. 18. (NEW) The method of claim 13, wherein encapsulating further includes maintaining a version number with each executable instance of each object. 19. (NEW) The method of claim 13, wherein loading further includes loading the executable instances of the objects with a cache associated with the processing environment. 20. (NEW) A system, comprising: at least one server system comprising at least one server having at least one processor and a non-transitory computer-readable storage medium having executable instructions; the executable instructions when executed by the at least one processor cause the at least one processor to perform operations comprising: generating executable instances of objects from records of structured data, wherein each record includes primary data, fields corresponding to the primary data, and keys for a corresponding record, wherein the primary data, the fields, and the keys for each record embedded as object data within each executable instance of a corresponding object; providing a match function that performs a match on input data against corresponding keys, fields, and primary data within each executable instance of the corresponding object; loading the executable instances of the objects into cache of a processing environment; and executing, by the executable instances of the objects, corresponding match functions when called by applications with application-provided input data. 21. (NEW) The system of claim 20, wherein generating further includes maintaining a version number associated with the structured data, the object data, and the executable instances of the objects, wherein loading further includes permitting multiple versions of the executable instances of the objects to be simultaneously loaded into the cache based on corresponding version numbers. 1. A method, comprising: parsing and translating records of structured data into object data associated with objects; providing, for each object, at least one function to access corresponding object data; and providing the objects within a processing environment for accessing the records via calls made by applications to a corresponding object's at least one function. 2. The method of claim 1 further comprising, providing duplicated objects for the objects within a second processing environment in parallel to the processing environment for accessing the records via other calls made by the other applications of the second processing environment. 3. The method of claim 1, wherein parsing further includes using a schema for the structured data to identify keys, fields, and primary data associated with each record. 4. The method of claim 2, wherein parsing further includes embedding primary data associated with each record within the corresponding object data of a corresponding object. 5. The method of claim 1, wherein providing the objects further includes loading each object into memory associated with the processing environment as executable code. 6. The method of claim 1, wherein providing, for each object, further includes providing, for each object, the at least one function as search and retrieval functions for the applications to call within the processing environment and access corresponding primary data of corresponding records of the structured data. 7. The method of claim 1, wherein providing, for each object, further includes providing, for each object, at least one input parameter for input data used by the at least one function. 8. The method of claim 1, wherein providing, for each object, further includes providing, for each object, the at least one function as a match function that takes as input search criteria provided as input parameters and returns corresponding values associated with the corresponding object data of the corresponding object that matches the input search criteria. 9. The method of claim 1, wherein parsing and translating further includes: identifying search keys, fields, and primary data; tagging the search keys, the fields, and the primary data; and embedding tagged data within the corresponding object data for each object. 10. The method of claim 1, wherein providing, for each object, the at least one function further includes creating the corresponding object data with dynamic interpretable source code for the at least one function that is dynamically executed when called by a corresponding application within the processing environment. 11. The method of claim 10, wherein creating further includes creating the dynamic interpretable source code for the at least one function with input parameters to receive input data provided by the corresponding application during a corresponding call. 12. A method, comprising: embedding primary data of records for structured data into sets of object data, wherein each set of object data corresponds to a certain record of the structured data; generating source code for searching each set of object data based on input data provided as one or more parameters to a corresponding source code; encapsulating each set of object data into an executable instance of an object; loading the executable instances of the objects into memory of a processing environment; and executing, by the executable instances of the objects, searches based on corresponding input data provided by applications that call the executable instances of the objects from the processing environment. 13. The method of claim 12 further comprising: loading second executable instances of the objects into a second memory of a second processing environment; and executing, by the second executable instances of the objects and in parallel with the executable instances of the objects in the processing environment, second searches based on additional corresponding input provided by second applications that call the second executable instances of the objects from the second processing environment. 14. The method of claim 12, wherein encapsulating further includes providing the source code as dynamically interpretable source code that does not requiring compiling of the source code to produce the executable instances of the objects. 15. The method of claim 12, wherein encapsulating further includes compiling the source code producing the executable instances of the objects. 16. The method of claim 15, wherein compiling further includes linking the source code for each executable instance of each object within the memory associated with the processing environment. 17. The method of claim 12, wherein encapsulating further includes maintaining a version number with each executable instance of each object. 18. The method of claim 12, wherein loading further includes loading the executable instances of the objects with a cache associated with the processing environment. 19. A system, comprising: at least one server system comprising at least one server having at least one processor and a non-transitory computer-readable storage medium having executable instructions; the executable instructions when executed by the at least one processor cause the at least one processor to perform operations comprising: generating executable instances of objects from records of structured data, wherein each record includes primary data, fields corresponding to the primary data, and keys for a corresponding record, wherein the primary data, the fields, and the keys for each record embedded as object data within each executable instance of a corresponding object; providing a match function that performs a match on input data against corresponding keys, fields, and primary data within each executable instance of the corresponding object; loading the executable instances of the objects into cache of a processing environment; and executing, by the executable instances of the objects, the match functions when called by applications with application-provided input data. 20. The system of claim 19, wherein generating further includes maintaining a version number associated with the structured data, the object data, and the executable instances of the objects, wherein loading further includes permitting multiple versions of the executable instances of the objects to be simultaneously loaded into the cache based on corresponding version numbers. Contact Information 6. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MOHAMMED R UDDIN whose telephone number is (571)270-3138. The examiner can normally be reached M-F: 9:00 AM-5:00 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, 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. /MOHAMMED R UDDIN/Primary Examiner, Art Unit 2161
Read full office action

Prosecution Timeline

May 22, 2025
Application Filed
Apr 03, 2026
Non-Final Rejection — §101, §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602432
SUMMARY GENERATION FOR A DISTRIBUTED GRAPH DATABASE
2y 5m to grant Granted Apr 14, 2026
Patent 12596676
RECORDS RETENTION MANAGEMENT
2y 5m to grant Granted Apr 07, 2026
Patent 12596960
MISUSE INDEX FOR EXPLAINABLE ARTIFICIAL INTELLIGENCE IN COMPUTING ENVIRONMENTS
2y 5m to grant Granted Apr 07, 2026
Patent 12585890
System and Method for Image Generation Using Neuroscience-Inspired Prompt Strategy
2y 5m to grant Granted Mar 24, 2026
Patent 12566800
EFFICIENT AND SCALABLE DATA PROCESSING AND MODELING
2y 5m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
78%
Grant Probability
99%
With Interview (+30.8%)
3y 3m
Median Time to Grant
Low
PTA Risk
Based on 726 resolved cases by this examiner. Grant probability derived from career allow 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