Prosecution Insights
Last updated: July 17, 2026
Application No. 18/651,011

COGNITIVE AUTOMATION FOR NETWORKING, SECURITY, IoT, AND COLLABORATION

Non-Final OA §102§103
Filed
Apr 30, 2024
Priority
Mar 03, 2020 — provisional 62/984,668 +1 more
Examiner
NILSSON, ERIC
Art Unit
2151
Tech Center
2100 — Computer Architecture & Software
Assignee
Cisco Technology Inc.
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
11m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
422 granted / 510 resolved
+27.7% vs TC avg
Strong +17% interview lift
Without
With
+17.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
26 currently pending
Career history
533
Total Applications
across all art units

Statute-Specific Performance

§101
13.9%
-26.1% vs TC avg
§103
65.2%
+25.2% vs TC avg
§102
7.4%
-32.6% vs TC avg
§112
1.3%
-38.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 510 resolved cases

Office Action

§102 §103
DETAILED ACTION This action is in response to claims filed 30 April 2024 for application 18651011 filed 30 April 2024. Currently claims 1-20 are pending. 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. Claim(s) 1-4, 7-9, 11-14, and 17-20 is/are rejected under 35 U.S.C. 102(A)(1) as being anticipated by Chougule et al. (US 20180157723 A1). Regarding claims 1, 11 and 20, Chougule discloses: A method, comprising: monitoring, by a learning agent that is part of a monitored system, information used by a metamodel that describes the monitored system (“Further in the second part, once the template model is defined and agreed, the plurality of data sources can be monitored online and the conversion to instance model can be triggered on data presence. During this process an appropriate template is picked up which best matches to the data source. For this in the template data source specific images, texts, or any other identifiable data can be marked as key for a template to match. In absence of any such key markings a best template can also be configured to be chosen based on the content and largest match of the templates available. For example, a bank name, a bank logo along with the name of form can be looked for matching by specifying these as key markings. A template with all three will be best match and will be used for the instance model generation.” [0032]), wherein the metamodel comprises a plurality of layers and a knowledge graph (“In the context of present disclosure, the term ‘knowledge’ and ‘information’ can be defined as follow: Knowledge: a domain model capturing structural and the functional properties of all domain elements. The knowledge representation may be termed as (domain) ontology or knowledge graph. And the reasoning and inference engine is the processing unit. Information: It is the subset of knowledge (in exact/specific context) used to solve a certain problem And both information extraction as well as information retrieval is performed here.” [0022], [0038] discloses layers in entity and attribute); making, by the learning agent, a determination regarding performance of the metamodel at a specified time period (“In case of simple information extraction (structured data), only ER model and simple static patterns are sufficient. Once a template is provided, the template gets applied on input data and the instance model gets generated. Also there could be need of time series data extraction, targeting the time factor over the infrastructure and their properties. The time based blueprint is useful for time based data analytics like predicting future events and setting alarms etc.” [0036]); generating, by the learning agent and based on the determination, an update to the metamodel (“Also to make the processing faster and smarter for given domain, ontology of knowledge elements can also be created over the set of given entity, attribute, actions within the domain. The knowledge elements are open to link (or contain) elements from NLP ontologies. That way it is a pre-processing of knowledge (data sources) to increase the processing efficiency and accuracy. Over the time, the learning (continual improvement) will make this domain ontology more and more complete and correct. Language structures can also be learnt over the period to avoid processing in some cases and to minimize processing in others.” [0035]); and sending, by the learning agent, the update to the metamodel to a device that maintains the metamodel (“creating the instance model by the instance model generation module; and merging the created instance model to one or more existing instance models.” Claim 1). Regarding claims 2, and 12, Chougule discloses: The method as in claim 1, wherein the monitored system comprises a distributed computing environment (“Entity can have more than one instance, for example user, file, file system can have multiple instance. Entity Instances can have association with other entity instances.” [0038]). Regarding claims 3, and 13, Chougule discloses: The method as in claim 1, wherein the learning agent is executed by a network router, switch, or gateway (“Existing meta-modeling environments typically may be used to create domain-specific modeling tools. Meta-models include syntax, semantics and entities. Entities such as routers, switches, operating systems, VMs, Servers continuously generate vast amount of logs data per second. This data contain useful information which can be used to take automatic action if machine can understand it. Automation tools can perform troubleshooting, security check if this unstructured information can be converted into structured format. The input information such as log files or any other data sources can be straightforward or obscure, depending on the attitude of the developer who wrote them. Either way, most of the time they are written with human readers in mind. It is necessary to extract relevant information from the data.” [0004]). Regarding claims 4, and 14, Chougule discloses: The method as in claim 3, wherein the device is a different network router, switch, or gateways as that of the learning agent (“According to an embodiment of the disclosure the user interface 102 is configured to provide inputs to the system 100. The user interface 102 is configured to provide a plurality of data sources as a first input. The user interface 102 can also be configured to provide an existing entity relationship (ER) model as a second input. The user interface 102 can include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like and can facilitate multiple communications within a wide variety of networks N/W and protocol types, including wired networks, for example, LAN, cable, etc., and wireless networks, such as WLAN, cellular, or satellite.” [0024]). Regarding claims 7, and 17, Chougule discloses: The method as in claim 1, further comprising: providing an indication of the update to the metamodel to a user interface (“Meta-modeling environments allow modelers to simulate complex scenarios with high-level modeling tools. Meta-modeling environments provide the user with the basic tools with which the user can create a meta-model. The user-defined meta-model, which may also be referred to as an ontology, can then be processed by the meta-modeling environment to generate an interface that can be used to create one or more instance models. Often, meta-modeling environments provide a visual language, allowing modelers to create detailed models, without requiring low-level knowledge of the underlying classes that make up the model.” [0003]). Regarding claims 8, and 18, Chougule discloses: The method as in claim 1, wherein the update to the metamodel is sent, by the device, to other learning agents that are part of the monitored system (“According to an embodiment of the disclosure the user interface 102 is configured to provide inputs to the system 100. The user interface 102 is configured to provide a plurality of data sources as a first input. The user interface 102 can also be configured to provide an existing entity relationship (ER) model as a second input. The user interface 102 can include a variety of software and hardware interfaces, for example, a web interface, a graphical user interface, and the like and can facilitate multiple communications within a wide variety of networks N/W and protocol types, including wired networks, for example, LAN, cable, etc., and wireless networks, such as WLAN, cellular, or satellite.” [0024]). Regarding claims 9, and 19, Chougule discloses: The method as in claim 1, wherein the update to the metamodel comprises information obtained by the learning agent that is compressible by an autoencoder (“Also to make the processing faster and smarter for given domain, ontology of knowledge elements can also be created over the set of given entity, attribute, actions within the domain. The knowledge elements are open to link (or contain) elements from NLP ontologies. That way it is a pre-processing of knowledge (data sources) to increase the processing efficiency and accuracy. Over the time, the learning (continual improvement) will make this domain ontology more and more complete and correct. Language structures can also be learnt over the period to avoid processing in some cases and to minimize processing in others.” [0035], note: the ontology data and updates include information compressible by an autoencoder as autoencoders can be used for many types of data including text and relationships. The claim does not require using an autoencoder to perform anything). Claim Rejections - 35 USC § 103 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 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claim(s) 5-6 and 15-16 are rejected under 35 U.S.C. 103 as being unpatentable over Chougule in view of Rubin (US 9471885 B1). Regarding claims 5, and 15, Chougule does not explicitly disclose: The method as in claim 1, wherein the plurality of layers of the metamodel ranges from a sub-symbolic space to a symbolic space and the knowledge graph represents symmetric relations between concepts in the knowledge graph. Rubin teaches: wherein the plurality of layers of the metamodel ranges from a sub-symbolic space to a symbolic space and the knowledge graph represents symmetric relations between concepts in the knowledge graph (C22L60-C23-18 disclose symbols the represent sub-symbolic concepts, “In the final analysis, this methodology captures symmetric knowledge to the extent that it blurs with random knowledge. It evidences that the machine learning of rules can be increasingly creative as a function of scale (and attendant processor capabilities). Unlike neural network paradigms, against which it may be compared, this methodology is capable of modus ponens and analogical reasoning. These serve as the basis for human-level symbolic reasoning, which is something that neural networks can never do. Most significantly, storing knowledge as a composition of transforms can exponentially increase the applicability of that knowledge in comparison to literal storage (e.g., simple production systems). This is possible through the use of carefully controlled (i.e., domain-specific) generalization.” C26 L42-56). Chougule and Rubin are in the same field of endeavor of knowledge and metamodels and are analogous. Chougule discloses metamodels for monitored systems. Rubin discloses symbolic and knowledge graph models. It would have been obvious to one of ordinary skill in the art before the effective filing date to modify the known metamodel monitoring system of Chougule with the known symbolic reasoning as taught by Rubin to yield predictable results of increased speed (C3 L41-47). Regarding claims 6, and 16, Chougule does not explicitly disclose: The method as in claim 5, wherein a semantic reasoning engine is used on the symbolic space to make an inference about the monitored system. Rubin teaches: wherein a semantic reasoning engine is used on the symbolic space to make an inference about the monitored system (“FIG. 2 shows a block diagram of an embodiment of a distributed processor system 100 in accordance with the methods disclosed herein. The speed of a case-based reasoning system can be increased through the use of associative memory and/or parallel (distributed) processors, such as shown in FIG. 2. Furthermore, an increase in speed can be obtained if information stores are subdivided for the case knowledge by domain for threaded parallel processing. This is known as segmenting the domain. Such segmentation can be automatically managed by inferred symbolic heuristics, but this will necessarily introduce much redundancy into the system—albeit brain-like. The idea here is to match the candidate case to be acquired against the dynamic case residing at the head of each segment. This case is acquired by those segments, whose head most-closely (not perfectly) matches it based on their possibilities.” C3L36-51). Claim 10 is rejected under 35 U.S.C. 103 as being unpatentable over Chougule in view of Dehghani et al. (US 20190354567 A1). Regarding claim 10, Chougule discloses meta-models, however, does not explicitly disclose: The method as in claim 1, wherein making the determination regarding the performance of the metamodel at the specified time period comprises: loading a subset of the metamodel into a short-term memory; and evaluating the subset of the metamodel as a focus of attention. Deghani teaches: wherein making the determination regarding the performance of the [meta]model at the specified time period comprises: loading a subset of the [meta]model into a short-term memory; and evaluating the subset of the metamodel as a focus of attention (“For subject-verb agreement tasks, the goal is to predict number-agreement between subjects and verbs in English. This task acts as a proxy for measuring the ability of a model to capture hierarchical dependency structure in natural language sentences. The system can use a language modeling training setup, i.e., a next word prediction objective, followed by calculating the ranking accuracy of the target verb at test time. The Universal Transformer was evaluated on subsets of the test data with different task difficulty, measured in terms of agreement attractors the number of intervening nouns with the opposite number from the subject (meant to confuse the model). For example, given the sentence, “The keys to the cabinet,” the objective during training is to predict the verb are (plural). At test time, the ranking accuracy of the agreement attractors is evaluated: i.e. the goal is to rank “are” higher than is in this case. The best LSTM with attention from the literature achieves 99.18% on this task, which outperforms a regular Transformer. The Universal Transformer significantly outperforms standard Transformers and achieves an average result comparable to the current state of the art (99.2%). However, the Universal Transformers (and particularly with dynamic halting) perform progressively better than all other models as the number of attractors increases. TABLE 2 summarizes the results.” [0074]). Chougule and Deghani are in the same field of endeavor of knowledge and models and are analogous. Chougule discloses metamodels for monitored systems. Deghani discloses short term and attention models. It would have been obvious to one of ordinary skill in the art before the effective filing date to modify the known metamodel monitoring system of Chougule with the known universal model subset analysis using LSTM and attention as taught by Deghani to yield predictable results of increased performance [0074]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ERIC NILSSON whose telephone number is (571)272-5246. The examiner can normally be reached M-F: 7-3. 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, James Trujillo can be reached at (571)-272-3677. 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. /ERIC NILSSON/ Primary Examiner, Art Unit 2151
Read full office action

Prosecution Timeline

Apr 30, 2024
Application Filed
May 12, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12675752
SCHEDULE CREATION METHOD, SCHEDULE CREATING DEVICE, SUBSTRATE PROCESSING APPARATUS, SUBSTRATE PROCESSING SYSTEM, AND STORAGE MEDIUM
3y 11m to grant Granted Jul 07, 2026
Patent 12670397
MACHINE LEARNING METHOD AND PRUNING METHOD
3y 7m to grant Granted Jun 30, 2026
Patent 12670443
LEARNING MODEL OPTIMIZATION DEVICE, LEARNING MODEL OPTIMIZATION METHOD, AND LEARNING MODEL OPTIMIZATION PROGRAM
3y 3m to grant Granted Jun 30, 2026
Patent 12657467
METHOD OF SLICING DEEP LEARNING MODEL FOR HETEROGENEOUS EMBEDDED SYSTEM AND INFERENCING METHOD BASED ON SLICED DEEP LEARNING MODEL IN HETEROGENEOUS EMBEDDED SYSTEM
3y 7m to grant Granted Jun 16, 2026
Patent 12626169
BAYESIAN CAUSAL RELATIONSHIP NETWORK MODELS FOR HEALTHCARE DIAGNOSIS AND TREATMENT BASED ON PATIENT DATA
2y 11m to grant Granted May 12, 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 (+17.3%)
3y 1m (~11m remaining)
Median Time to Grant
Low
PTA Risk
Based on 510 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