Prosecution Insights
Last updated: July 17, 2026
Application No. 19/064,341

MACHINE LEARNING-BASED GENEALOGICAL RESEARCH ASSISTANT

Non-Final OA §102
Filed
Feb 26, 2025
Priority
Feb 29, 2024 — provisional 63/559,769
Examiner
SHARPLESS, SAMUEL
Art Unit
2165
Tech Center
2100 — Computer Architecture & Software
Assignee
Ancestry.com Operations Inc.
OA Round
1 (Non-Final)
80%
Grant Probability
Favorable
1-2
OA Rounds
1y 7m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 80% — above average
80%
Career Allowance Rate
105 granted / 131 resolved
+25.2% vs TC avg
Strong +29% interview lift
Without
With
+28.6%
Interview Lift
resolved cases with interview
Typical timeline
3y 0m
Avg Prosecution
13 currently pending
Career history
157
Total Applications
across all art units

Statute-Specific Performance

§101
1.4%
-38.6% vs TC avg
§103
74.6%
+34.6% vs TC avg
§102
20.8%
-19.2% vs TC avg
§112
1.9%
-38.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 131 resolved cases

Office Action

§102
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 . Specification The lengthy specification has not been checked to the extent necessary to determine the presence of all possible minor errors. Applicant’s cooperation is requested in correcting any errors of which applicant may become aware in the specification. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 1-20 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Gibson et al (US20250156460) Gibson discloses: 1. A computer-implemented method for genealogical research assistance, comprising: receiving a user query at a user interface ([0005] One example aspect of the present disclosure is directed to a computing system. The computing system includes one or more processors and one or more tangible, non-transitory, computer readable media that store instructions that are executable by the one or more processors to cause the computing system to perform operations. The operations include receiving input data comprising a user query and query context data; ); classifying the user query using a classification large language model (LLM) ([0024] The system may classify the user queries into specific content clusters derived from the previously created training set. By linking user queries to the appropriate clusters, the system can streamline the response generation process. This classification can allow the LLM to identify which content is most relevant to the user's query in an efficient manner.); refining the classified user query using a refinement LLM ([0025] The system generates a workflow data structure to store these content clusters and the correlations between user queries and their corresponding responses. This structure serves as a repository of information that the LLM can reference when generating responses. In some cases, the LLM may employ a Retrieval-Augmented Generation (RAG) architecture when generating the query responses. When the LLM accesses the workflow data structure, it may employ RAG to retrieve relevant correlations between user inquiries and previous responses. Using this, the LLM can reference a curated set of information that directly addresses the user query. This allows the model to generate contextually relevant query responses that are grounded in corpus of documents.); vectorizing the refined, classified user query using an embedding model ([0008] - ; classifying, using a large language model (LLM), the user query to at least one content cluster of a plurality of content clusters based on the query context data; constructing, using the LLM, a workflow data structure as a function of the classifying; and generating, using the LLM, a query response as a function of the user query, the query context data, and the workflow data structure.); retrieving, from a vector database, a plurality of results based on the vectorized, refined, classified user query ([0053] With continued reference to FIG. 2, processing the corpus of documents 106 can include producing one or more embeddings 206 for each segment of the plurality of segments 202. Embeddings are mathematical representations of words or phrases in a continuous vector space where semantically similar items are located closer together. With respect to the plurality of segments 202, the plurality of embeddings 206 can be used to represent textual data using vectors. These embeddings 206 are configured to capture the semantic meanings and relationships between words within each segment. For instance, two segments discussing a maintenance procedure for a piece of equipment might generate embeddings that are closely aligned in the vector space, while segments on unrelated topics would be positioned farther apart. The spatial relationship between the embeddings can be used to generate training data for the LLM.); generating, using a response-generating LLM, a response to the vectorized, refined, classified user query based on the retrieved plurality of results; and causing to display, at the user interface, the generated response.( [0102] The LLM 110 utilizes the workflow data structure 118 to tailor the query response 120 to the specific context of the instant user query 112. By analyzing the user query 112 in conjunction with the structured data of the workflow data structure 118, the LLM 110 can tailor its output to better fit the individual's needs. For instance, if a user has previously engaged with the system about a particular software application, the LLM 110 can reference information that is specific to that application, offering insights and solutions that are more relevant and tailored to the user's ongoing challenges. The LLM 110 can be configured to adjust the query response 120 based on various factors, such as prior interactions or the nuances of the current inquiry.) 2. The computer-implemented method of claim 1, further comprising: assessing, using a response-validation LLM, the generated response prior to displaying the response at the user interface.( [0102] The LLM 110 utilizes the workflow data structure 118 to tailor the query response 120 to the specific context of the instant user query 112. By analyzing the user query 112 in conjunction with the structured data of the workflow data structure 118, the LLM 110 can tailor its output to better fit the individual's needs. For instance, if a user has previously engaged with the system about a particular software application, the LLM 110 can reference information that is specific to that application, offering insights and solutions that are more relevant and tailored to the user's ongoing challenges. The LLM 110 can be configured to adjust the query response 120 based on various factors, such as prior interactions or the nuances of the current inquiry.) 3. The computer-implemented method of claim 1, wherein the response-generating LLM includes a transformer architecture. ([0056] The processor 102 can generate one or more embeddings 206 for each segment of the plurality of segments 202 from the tokenized text. This will allow for the transformation of the textual data of the plurality of segments 202 into a numerical format that can be utilized by machine-learning models or other computer-based processes. Based on the tokenized text, the processor 102 can select a method for generating the embedding. These methods can include, but are not limited to, Word2Vec, Global Vectors for Word Representation (GloVe), transformer-based models (i.e., BERT and GPT), and similar approaches.) 4. The computer-implemented method of claim 1, wherein the classification LLM, the refinement LLM, and the response-generating LLM utilize distinct large-language models. 5. The computer-implemented method of claim 1, further comprising: generating the vector database using the embedding model, wherein the embedding model generates vectors from a plurality of genealogical-research content. ([0053] With continued reference to FIG. 2, processing the corpus of documents 106 can include producing one or more embeddings 206 for each segment of the plurality of segments 202. Embeddings are mathematical representations of words or phrases in a continuous vector space where semantically similar items are located closer together. With respect to the plurality of segments 202, the plurality of embeddings 206 can be used to represent textual data using vectors. These embeddings 206 are configured to capture the semantic meanings and relationships between words within each segment. For instance, two segments discussing a maintenance procedure for a piece of equipment might generate embeddings that are closely aligned in the vector space, while segments on unrelated topics would be positioned farther apart. The spatial relationship between the embeddings can be used to generate training data for the LLM.) 6. The computer-implemented method of claim 1, further comprising: modifying the vector database to include the vectorized, refined, classified user query. ([0111] In some cases, the method further includes generating, by the LLM, one or more contextual inquiries based on the user query and the query context data; receiving, by the LLM, a second user query from a user based on the one or more contextual inquiries; and updating, by the LLM, the query context data based on the second user query.) 7. The computer-implemented method of claim 1, further comprising: determining, using the classification LLM, that the user query requires clarification; generating, using the refinement LLM, a follow-up prompt; and causing to display, at the user interface, the follow-up prompt. ([0122] In a non-limiting example, assume the computing device receives user query such as “When is the next time Machine A should be serviced?” To analyze the user query, the LLM can classify the user query into a content cluster focused on Machine A's maintenance. After classifying the query, the LLM interacts with the workflow data structure to access known training examples concerning Machine A's service history. In an embodiment, the workforce data structure might contain information about protocols for maintenance, historical service intervals, and best practices derived from past repairs. Based on this information, the LLM generates a query response that might state, “Machine A was last serviced on Jan. 7, 2024, and is due for service every six months or 4000 machine hours.”) 8. The computer-implemented method of claim 1, further comprising: receiving a follow-up user query in response to the follow-up prompt; and wherein refining the classified user query using the refinement LLM comprises using the user query, the follow-up prompt and the follow-up user query to generate the classified user query. ([0122] In a non-limiting example, assume the computing device receives user query such as “When is the next time Machine A should be serviced?” To analyze the user query, the LLM can classify the user query into a content cluster focused on Machine A's maintenance. After classifying the query, the LLM interacts with the workflow data structure to access known training examples concerning Machine A's service history. In an embodiment, the workforce data structure might contain information about protocols for maintenance, historical service intervals, and best practices derived from past repairs. Based on this information, the LLM generates a query response that might state, “Machine A was last serviced on Jan. 7, 2024, and is due for service every six months or 4000 machine hours.”) 9. The computer-implemented method of claim 1, further comprising: receiving a follow-up user query in response to the follow-up prompt; and wherein vectorizing the refined, classified user query using the embedding model comprises vectorizing the user query, the follow-up prompt and the follow-up user query and conducting sematic search using the vectorized, refined, classified user query. ([0118] Classifying the user query to at least one content cluster of a plurality of content clusters can include using one or more natural language processing techniques to identify key words and phrases within the user query. These key words may be compared against a predefined set of content clusters, wherein each content cluster represents a distinct subject matter. The LLM may evaluate which content cluster aligns best with the user's query based on a semantic analysis. Once a suitable match is identified, the LLM links the user query to the relevant content cluster.) 10. The computer-implemented method of claim 1, wherein retrieving, from a vector database, a plurality of results based on the vectorized, refined, classified user query comprises: performing a semantic search of the vector database using the vectorized, refined, classified user query. ([0118] Classifying the user query to at least one content cluster of a plurality of content clusters can include using one or more natural language processing techniques to identify key words and phrases within the user query. These key words may be compared against a predefined set of content clusters, wherein each content cluster represents a distinct subject matter. The LLM may evaluate which content cluster aligns best with the user's query based on a semantic analysis. Once a suitable match is identified, the LLM links the user query to the relevant content cluster.) 11. The computer-implemented method of claim 10, further comprising: wherein the plurality of results comprises top five closest matches to the vectorized, refined, classified user query identified from the semantic search.( [0117] At step 508, the method includes classifying, using the LLM operating on the one or more processors, the user query to at least one content cluster of a plurality of content clusters based on the query context data. [0118] Classifying the user query to at least one content cluster of a plurality of content clusters can include using one or more natural language processing techniques to identify key words and phrases within the user query. These key words may be compared against a predefined set of content clusters, wherein each content cluster represents a distinct subject matter. The LLM may evaluate which content cluster aligns best with the user's query based on a semantic analysis. Once a suitable match is identified, the LLM links the user query to the relevant content cluster. [0119] In some embodiment, The LLM can classify portions of the corpus of documents into respective content clusters using the same or substantially similar process for categorizing the user query. As the LLM processes each document, it can use the labeled training data associated with the corpus of documents to organize the corpus of documents into the appropriate clusters. ) Claims 12-20 are rejected using similar reasoning seen in the rejection of claims 1-11 above due to reciting similar limitations but directed towards different statutory categories. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. US20260050615 teaches limitations seen in the independent claims. Any inquiry concerning this communication or earlier communications from the examiner should be directed to SAMUEL SHARPLESS whose telephone number is (571)272-1521. The examiner can normally be reached M-F 7:30 AM- 3:30 PM (ET). 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, ALEKSANDR KERZHNER can be reached at 571-270-1760. 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. /S.C.S./Examiner, Art Unit 2165 /ALEKSANDR KERZHNER/Supervisory Patent Examiner, Art Unit 2165
Read full office action

Prosecution Timeline

Feb 26, 2025
Application Filed
May 14, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12675485
ASSOCIATING USER-PROVIDED CONTENT ITEMS TO INTEREST NODES
1y 8m to grant Granted Jul 07, 2026
Patent 12670129
Data storage device and storage control method based on log-structured merge tree
3y 3m to grant Granted Jun 30, 2026
Patent 12664207
Context-Based Dictionaries for Multimedia Audiobook Systems Including Linguistic Dictionary Entries
1y 8m to grant Granted Jun 23, 2026
Patent 12651021
DIGITAL CONTENT MANAGEMENT IN VIRTUAL ENVIRONMENTS
3y 2m to grant Granted Jun 09, 2026
Patent 12585614
PREDICTING OUTAGE CONDITIONS AND HANDLING ARCHIVING
3y 2m to grant Granted Mar 24, 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
80%
Grant Probability
99%
With Interview (+28.6%)
3y 0m (~1y 7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 131 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