Prosecution Insights
Last updated: July 17, 2026
Application No. 18/541,033

Information Monitoring System and Method

Non-Final OA §102
Filed
Dec 15, 2023
Priority
Dec 16, 2022 — provisional 63/387,885 +1 more
Examiner
FEATHERSTONE, MARK D
Art Unit
Tech Center
Assignee
Gudea Inc.
OA Round
1 (Non-Final)
59%
Grant Probability
Moderate
1-2
OA Rounds
1y 7m
Est. Remaining
84%
With Interview

Examiner Intelligence

Grants 59% of resolved cases
59%
Career Allowance Rate
185 granted / 312 resolved
-0.7% vs TC avg
Strong +25% interview lift
Without
With
+24.6%
Interview Lift
resolved cases with interview
Typical timeline
4y 2m
Avg Prosecution
6 currently pending
Career history
318
Total Applications
across all art units

Statute-Specific Performance

§101
0.8%
-39.2% vs TC avg
§103
87.1%
+47.1% vs TC avg
§102
7.0%
-33.0% vs TC avg
§112
2.4%
-37.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 312 resolved cases

Office Action

§102
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 § 102 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. 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)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. (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. Claims 1-30 are rejected under 35 U.S.C. 102(a)(1)/(a)/(2) as being anticipated by Galitsky (US 2020/0286463), hereinafter Galitsky. Regarding claim 1, Galitsky discloses a computer-implemented method, executed on a computing device, comprising: generating a plurality of synthetic Al-based users, wherein each of these synthetic Al-based users has a plurality of interests within a content platform (para [0071], "More specifically, certain aspects enable autonomous agents ("chatbots") that deliver content in the form of virtual persuasive dialogue. A virtual dialogue is defined as a multi-turn adversarial argumentation dialogue between agents.", para [0500], "An autonomous agent implemented by dialogue application 102 crates and presents a virtual persuasive dialogue session. As a result, the session not only provides a user with content on his topic of interest but imitates his conversations with proponents and a dispute with opponents. The user's opinion may evolve over time with subsequent interactions with an autonomous agent.", para [0509], "In a more specific example, dialogue application 102 forms a list of candidate topics. Then dialogue application 102 clusters this list and selects the members of the candidate list which are as close to the centers of cluster as possible. Dialogue application 102 can add a small number of expressions as topics of a given search results to show along the other search results to a list. Dialogue application 102 can present each of the topics to a user device."); enabling the plurality of synthetic Al-based users to generate content within the content platform based, at least in part, upon the plurality of interests (para [0350], "Dialogue chatbot systems need to be capable of understanding and matching user communicative intentions, reason with these Intentions, build their own respective communication intentions and populate these intentions with actual language to be communicated to the user. para [0606], "In some implementations, server 5312 may include one or more applications to analyze and consolidate data feeds and/or event updates received from users of client computing devices 5302, 5304, 5306, and 5308. As an example, data feeds and/or event updates may include, but are not limited to, Twitter® feeds, Facebook® updates or real-time updates received from one or more third party information sources and continuous data streams, which may include real-time events related to sensor data applications, financial tickers, network performance measuring tools (e.g., network monitoring and traffic management applications), clickstream analysis tools, automobile traffic monitoring, and the like. "); Identifying a piece of content for addressing with the plurality of synthetic Al-based users, thus defining target content (para [0588], Dialogue application 102 identifies, from the electronic documents, a question and an answer that are relevant to the selected topic. The answer is in rhetorical agreement with the question and can be verified, for example, by a classifier trained to detect rhetoric agreement of a question CDT and an answer CDT. Together, the question and the answer form a virtual conversation that can be depicted as between one or more agents or users."); and generating a response to the target content (para [0512], "For example, in return, the user inputs, at utterance 4505, "I think Marxism does not necessarily associated with the political correctness." In response, based on the presented opinion, dialogue application 102 forms a virtual dialogue from available documents and pages, simulating a conversation between virtual proponents and opponents and virtual bots."). Regarding claim 2, Galitsky discloses the computer-implemented method of claim 1 wherein the plurality of synthetic Al-based users includes: a plurality of content platform bot accounts (para [0279], "The authors formed the training sets from their own accounts and also public Facebook accounts available via API over a number of years (at the time of writing Facebook API for getting messages is unavailable). In addition, we used 860 email threads from Enron dataset. Also, we collected the data of manual responses to postings of an agent", para [0606], "In some implementations, server 5312 may include one or more applications to analyze and consolidate data feeds and/or event updates received from users of client computing devices 5302, 5304, 5306, and 5308. As an example, data feeds and/or event updates may include, but are not limited to, Twitter® feeds, Facebook updates or real-time updates received from one or more third party information sources and continuous data streams, which may include real-time events related to sensor data applications, financial tickers, network performance measuring tools (e.g., network monitoring and traffic management applications), clickstream analysis tools, automobile traffic monitoring, and the like."). Regarding claim 3, Galitsky discloses the computer-implemented method of claim 1 wherein enabling the plurality of synthetic Al-based users to generate content within a content platform based, at least in part, upon the plurality of interests includes: enabling the plurality of synthetic Al-based users to generate one or more original pieces of content for posting within the content platform (para [0169], "Dialogue application 102 can create, analyze, and compare communicative discourse trees. Communicative discourse trees are designed to combine rhetoric information with speech act structures. CDTs include with arcs labeled with expressions for communicative actions. By combining communicative actions, CDTs enable the modeling of RST relations and communicative actions.", para [0254], "A question sentence can be an explicit question, a request, or a comment. Dialogue application 102 creates question communicative discourse tree from input text. Using the example discussed in relation to FIGS. 13 and 15, an example question sentence is "are rebels responsible for the downing of the flight." Dialogue application 102 can use process 1500 described with respect to FIG. 15. The example question has a root node of "elaborate.", para [0500]. "An autonomous agent implemented by dialogue application 102 crates and presents a virtual persuasive dialogue session. As a result, the session not only provides a user with content on his topic of interest but imitates his conversations with proponents and a dispute with opponents. The user's opinion may evolve over time with subsequent interactions with an autonomous agent. Process 4400 can use machine learning. For example, dialogue application 102 can train classifier 120 to perform one or more functions described in process 4400 and use classifier 120 instead of algorithmic techniques. For example purposes, process 4400 is discussed with respect to FIG. 45."). Regarding claim 4, Galitsky discloses the computer-implemented method of claim 1 wherein enabling the plurality of synthetic Al-based users to generate content within a content platform based, at least in part, upon the plurality of interests includes: enabling the plurality of synthetic Al-based users to recycle one or more pieces of content for posting within the content platform (para [0134], "The second type has a response that is, e.g., a good answer, to the question. The answer could take the form of, for example, in some aspects, the Al constructing an answer from its extensive knowledge base(s) or from matching the best existing answer from searching the internet or intranet or other publicly/privately available data sources."). Regarding claim 5, Galitsky discloses the computer-implemented method of claim 1 wherein identifying a piece of content for addressing with the plurality of synthetic Al-based users, thus defining target content includes: vectorizing the target content, thus defining vectorized target content (para [0232], "To handle meaning of words expressing the subjects of CAs, a word can be applied to a vector model such as the "word2vector" model. More specifically, to compute generalization between the subjects of communicative actions, the following rule can be used: if subject1=subject2, subject1 (circumflex over ()}subject2=. Here subject remains and score is 1."); and comparing the vectorized target content to a pool of vectorized known undesirable information and/or a pool of vectorized known desirable information to classify the target content (para [0330], "The outcome is that after the model is trained, the word vectors are mapped into a vector space such that Distributed Representations of Sentences and Documents semantically similar words have similar vector representations. This kind of model can potentially operate on discourse relations, but it is hard to supply as rich linguistic information as we do for tree kernel learning. There is a corpus of research that extends word2vec models to go beyond word level to achieve phrase-level or sentence-level representations. For instance, a simple approach Is using a weighted average of all the words in the document, (weighted averaging of word vectors), losing the word order similar to how bag-of-words approaches do. A more sophisticated approach is combining the word vectors in an order given by a parse tree of a sentence, using matrix-vector operations."). Regarding claim 6, Galitsky discloses the computer-implemented method of claim 1 wherein generating a response to the target content includes: generating a response that contradicts the target content (para [0347], "Argumentation detail relation is important because many cases in scientific publications, where some background information (for example the definition of a term) is important for understanding the overall argumentation. A support relation between an argument component Resp and another argument component Req indicates that Resp supports (reasons, proves) Req. Similarly, an attack relation between Resp and Req is annotated if Resp attacks (restricts, contradicts) Req. The detail relation is used, if Resp is a detail of Req and gives more information or defines something stated in Req without argumentative reasoning. Finally, we link two argument components (within Req or Resp) with the sequence relation, if the components belong together and only make sense in combination, i.e., they form a multi-sentence argument component."). Regarding claim 7, Galitsky discloses the computer-implemented method of claim 1 wherein generating a response to the target content includes: generating a response that reinforces the target content (para [0094], "In an aspect, dialogue application 102 can use classifier 120, which can be trained with training data 125. Classifier 120 can be trained to identify rhetorical similarity between text, to determine whether argumentation is present in text, and/or to determine one or more chains of argumentation in text (e.g., two sentences that support each other in advancing an argument). Classifier 120 can be a predictive model, a classification model, or other model type that is trained to detect a presence or absence of features in text. An example of a model is a support vector machine. Examples of learning approaches include nearest neighbor models and tree kernel models."). Regarding claim 8, Galitsky discloses the computer-implemented method of claim 1 wherein generating a response to the target content includes: generating a response to the target content using a generative Al model (para [0133], "The underlying rational for having an AI chatbot respond like a human is that the human brain can formulate and understand the request and then give a good response to the human request much better than a machine. Thus, there should be significant Improvement in the request/response of a chatbot, if human B is mimicked. So an initial part of the problem is how does the human brain formulate and understand the request? To mimic, a model is used. RST and DT allow a formal and repeatable way of doing this.", para [0167], "By using an iterative process, dialogue application 102 provides a training pair to classifier 120 and receives, from the model, a level of complementarity. Dialogue application 102 calculates a loss function by determining a difference between the determined level of complementarity and an expected level of complementarity for the particular training pair.", para [0501], Dialogue area 4500 depicts utterances 4501-4510. In particular, utterances 4507 and 4510 are examples of virtual persuasive dialogues generated by dialogue application 102."). Regarding claim 9, Galitsky discloses the computer-implemented method of claim 8 wherein generating a response to the target content using a generative AI model includes: generating a response to the target content using the generative Al model and a contradiction instruction script when the response to the target content contradicts the target content (para [0295], "Agreement by sentiment shows the contribution of proper sentiment match in RR pair. The sentiment rule includes, in particular, that if the polarity of RR is the same, response should confirm what request is saying. Conversely, if polarity is opposite, response should attack what request is claiming. Agreement by logical argumentation requires proper communication discourse where a response disagrees with the claim in request.", para [0347], "Argumentation detail relation is important because many cases in scientific publications, where some background information (for example the definition of a term) is important for understanding the overall argumentation. A support relation between an argument component Resp and another argument component Req indicates that Resp supports (reasons, proves) Req. Similarly, an attack relation between Resp and Req is annotated if Resp attacks (restricts, contradicts) Req. The detail relation is used, if Resp is a detail of Req and gives more information or defines something stated in Req without argumentative reasoning. Finally, we link two argument components (within Req or Resp) with the sequence relation, if the components belong together and only make sense in combination, i.e., they form a multi-sentence argument component.", para [0516], "Argumentation makes an utterance persuasive. But an utterance is even more persuasive if a sequence of utterances includes utterances that are linked by an explanation chain. Therefore, in an aspect, the dialogue application 102 can detect an explanation chain in a result. Detecting an argumentation chain can be performed in conjunction with or instead of detecting argumentation."). Regarding claim 10, Galitsky discloses the computer-implemented method of claim 8 wherein generating a response to the target content using a generative AI model includes: generating a response to the target content using the generative AI model and a reinforcement instruction script when the response to the target content reinforces the target content (para [0347], "Argumentation detail relation is important because many cases in scientific publications, where some background information (for example the definition of a term) is important for understanding the overall argumentation. A support relation between an argument component Resp and another argument component Req indicates that Resp supports (reasons, proves) Req. Similarly, an attack relation between Resp and Req is annotated if Resp attacks (restricts, contradicts) Req. The detail relation is used, If Resp is a detail of Req and gives more information or defines something stated in Req without argumentative reasoning. Finally, we link two argument components (within Req or Resp) with the sequence relation, if the components belong together and only make sense in combination, i.e., they form a multi-sentence argument component.", para [0500], An autonomous agent implemented by dialogue application 102 crates and presents a virtual persuasive dialogue session. As a result, the session not only provides a user with content on his topic of interest but imitates his conversations with proponents and a dispute with opponents. The user's opinion may evolve over time with subsequent interactions with an autonomous agent. Process 4400 can use machine learning. For example, dialogue application 102 can train classifier 120 to perform one or more functions described in process 4400 and use classifier 120 Instead of algorithmic techniques. For example purposes, process 4400 is discussed with respect to FIG. 45."). Claims 11-20 correspond to claims 1-10, and are analyzed accordingly. Claims 21-30 correspond to claims 1-10, and are analyzed accordingly. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MARK D FEATHERSTONE whose telephone number is (571)270-3750. The examiner can normally be reached Monday-Friday 9:00AM - 5:00PM. 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, John Cottingham can be reached at 571-272-1400. 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. /MARK D FEATHERSTONE/Supervisory Patent Examiner, Art Unit 2111
Read full office action

Prosecution Timeline

Dec 15, 2023
Application Filed
Jun 08, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12658271
DETERMINISTIC TEST PROGRAM GENERATION FOR EVALUATING CACHE COHERENCY
2y 7m to grant Granted Jun 16, 2026
Patent 12645758
LEARNING CONTROL DEVICE, LEARNING CONTROL METHOD, AND COMPUTER PROGRAM PRODUCT
3y 9m to grant Granted Jun 02, 2026
Patent 12647135
FAST EFFICIENT DECODER FOR LOW DISTANCE RS AND BCH CODES
3y 0m to grant Granted Jun 02, 2026
Patent 12639569
RESOURCE INFRASTRUCTURE PREDICTION USING MACHINE LEARNING
3y 7m to grant Granted May 26, 2026
Patent 12608628
PREDICTION ENHANCEMENT FOR CLASSIFICATION MODELS
3y 8m to grant Granted Apr 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
59%
Grant Probability
84%
With Interview (+24.6%)
4y 2m (~1y 7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 312 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