Prosecution Insights
Last updated: April 19, 2026
Application No. 18/802,399

METHOD, DEVICE AND SYSTEM FOR ENHANCING PREDICTIVE CLASSIFICATION OF ANOMALOUS EVENTS IN A CLOUD-BASED APPLICATION ACCELERATION AS A SERVICE ENVIRONMENT

Non-Final OA §DP
Filed
Aug 13, 2024
Examiner
SHINGLES, KRISTIE D
Art Unit
2453
Tech Center
2400 — Computer Networks
Assignee
Aryaka Networks Inc.
OA Round
1 (Non-Final)
82%
Grant Probability
Favorable
1-2
OA Rounds
3y 0m
To Grant
95%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allow Rate
653 granted / 792 resolved
+24.4% vs TC avg
Moderate +13% lift
Without
With
+13.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 0m
Avg Prosecution
29 currently pending
Career history
821
Total Applications
across all art units

Statute-Specific Performance

§101
6.4%
-33.6% vs TC avg
§103
37.7%
-2.3% vs TC avg
§102
45.2%
+5.2% vs TC avg
§112
3.8%
-36.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 792 resolved cases

Office Action

§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 . DETAILED ACTION Claims 1-20 are pending. Double Patenting I. The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). II. A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/forms/. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. III. CLAIMS 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over U.S. Patent No. 12,088,473. Although the claims at issue are not identical, they are not patentably distinct from each other because as show in the table below: Instant Application – 18/802,399 Conflicting Patent – 12,088,473 1, 8, 15. A method of a computing network implemented in a data processing device communicatively coupled to a memory, comprising: detecting a set of point anomalies in real-time data associated with each network entity of a plurality of network entities of the computing network for each feature thereof in sequential time based on determining whether the real-time data falls outside at least one threshold expected value thereof; computing anomaly scores for the detected set of point anomalies indicative of anomalousness thereof; determining an event associated with a pattern of change of the real-time data associated with the each network entity for the each feature thereof based on the detected set of point anomalies and the computed anomaly scores; determining data correlation scores for the point anomalies associated with the event that reflect commonness of the event by way of at least one combination of features that has led to the event; in accordance with reading the anomaly scores associated with the event as an input feedback to the data processing device, the each feature of the each network entity as a dimension of the input feedback and a category of the event as a label of the event and in accordance with the determination of the data correlation scores, predictively classifying a future event into a predicted category thereof in accordance with subjecting the anomaly scores associated with the event to a binning process and interpreting a severity indicator of the event also input thereto; refining the predictive classification of the future event based on a subsequent input to the data processing device from another data processing device that modifies a classification model for predictively classifying the future event into the predicted category; representing each detected point anomaly of the set of point anomalies in a full mesh Q node graph, wherein Q is a number of features applicable for the each network entity; capturing a transition in the each detected point anomaly associated with a newly detected one of: anomaly and non-anomaly in the real-time data associated with the each feature of the each network entity of the Q number of features via the representation of the full mesh Q node graph; deriving a current data correlation score for the each detected point anomaly across the captured transition as: CS=∑i=1APC(1-EWPiTSAC)APC, wherein CS is the current data correlation score for the each detected point anomaly across the captured transition, APC is a count of a total number of pairs of Y current anomalous features in the Q number of features and is given by YC2+YC1, EWPi is a weight of an edge of the ith pair of the Y current anomalous features in the representation of the full mesh Q node graph, and TSAC is a total number of time samples of the each detected point anomaly comprising the captured transition, and wherein the current data correlation score is indicative of a commonness of a combination of the Y current anomalous features contributing to the each detected point anomaly with respect to an equivalent Y anomalous features contributing to another previously detected point anomaly associated with the each network entity; and utilizing the current data correlation score to predictively classify the future event into the predicted category thereof. 1, 8, 15. A method comprising: detecting, through a server of a cloud computing network comprising a plurality of subscribers of application acceleration as a service provided by the cloud computing network at a corresponding plurality of client devices communicatively coupled to the server, a set of point anomalies in real-time data associated with each network entity of a plurality of network entities of the cloud computing network for each feature thereof in sequential time based on determining whether the real-time data falls outside at least one first threshold expected value thereof; computing, through the server, anomaly scores for the detected set of point anomalies indicative of anomalousness thereof; determining, through the server, an event associated with a pattern of change of the real-time data associated with the each network entity for the each feature thereof based on the detected set of point anomalies and the computed anomaly scores; determining, through the server, data correlation scores for the point anomalies associated with the event that reflect commonness of the event by way of at least one combination of features that has led to the event; in accordance with reading the anomaly scores associated with the event as an input feedback to the server, the each feature of the each network entity as a dimension of the input feedback and a category of the event as a label of the event and in accordance with the determination of the data correlation scores, predictively classifying, through the server, a future event into a predicted category thereof in accordance with subjecting the anomaly scores associated with the event to a binning process and interpreting a severity indicator of the event also input thereto; refining, through the server, the predictive classification of the future event based on a subsequent input to the server from a client device of the plurality of client devices that modifies a classification model for predictively classifying the future event into the predicted category; representing, through the server, each detected point anomaly of the set of point anomalies in a full mesh Q node graph, wherein Q is a number of features applicable for the each network entity; capturing, through the server, a transition in the each detected point anomaly associated with a newly detected one of: anomaly and non-anomaly in the real-time data associated with the each feature of the each network entity of the Q number of features via the representation of the full mesh Q node graph; deriving, through the server, a current data correlation score for the each detected point anomaly across the captured transition as: CS=∑i=1A⁢P⁢C⁢(1-EWPiTSAC)A⁢P⁢C, wherein CS is the current data correlation score for the each detected point anomaly across the captured transition, APC is a count of a total number of pairs of Y current anomalous features in the Q number of features and is given by YC2+YC1, EWPi is a weight of an edge of the ith pair of the Y current anomalous features in the representation of the full mesh Q node graph, and TSAC is a total number of time samples of the each detected point anomaly comprising the captured transition, and wherein the current data correlation score is indicative of a commonness of a combination of the Y current anomalous features contributing to the each detected point anomaly with respect to an equivalent Y anomalous features contributing to another previously detected point anomaly associated with the each network entity; and utilizing the current data correlation score to predictively classify, through the server, the future event into the predicted category thereof. 2, 9, 16. The method of claim 1, comprising predictively classifying the future event into the predicted category using one of: a decision tree and at least one non-linear classification algorithm based on an amount of feedback data available to the data processing device. 2. The method of claim 1, comprising predictively classifying, through the server, the future event into the predicted category using one of: a decision tree and at least one non-linear classification algorithm based on an amount of feedback data available to the server. 3, 10, 17. The method of claim 1, comprising one of: boosting and scaling down one or more of the anomaly scores associated with the event to impact prediction of a severity thereof. 3. The method of claim 1, comprising, through the server, one of: boosting and scaling down one or more of the anomaly scores associated with the event to impact prediction of a severity thereof. 4, 11. The method of claim 1, further comprising building the classification model based on feedback data to the data processing device during each cycle of a set of periodic cycles. 4. The method of claim 1, further comprising the server building the classification model based on feedback data thereto during each cycle of a set of periodic cycles. 5, 12, 18. The method of claim 1, comprising the computation of the anomaly scores involving both relative scoring and absolute deviation scoring, and the absolute deviation scoring being based on previous data deviations from reference data bands. 5. The method of claim 1, comprising the computation of the anomaly scores involving both relative scoring and absolute deviation scoring, and the absolute deviation scoring being based on previous data deviations from reference data bands. 6, 13, 20. The method of claim 1, comprising the subsequent input to the data processing device from the another data processing device modifying the classification model in accordance with at least one of: reclassifying at least one of: the event and the future event under another at least one of: category and predicted category; reclassifying the at least one of: the event and the future event under at least one of: a new category and a new predicted category; and one of: nullifying and modifying one or more elements of the classification model. 6. The method of claim 1, comprising the subsequent input to the server from the client device modifying the classification model in accordance with at least one of: reclassifying at least one of: the event and the future event under another at least one of: category and predicted category; reclassifying the at least one of: the event and the future event under at least one of: a new category and a new predicted category; and one of: nullifying and modifying one or more elements of the classification model. 7, 14, 19. The method of claim 1, comprising: the data processing device predictively classifying the future event into the predicted category thereof further in accordance with at least one graph image generated as a time series also input thereto, the at least one graph image representing at least one point anomaly of the set of point anomalies. 7. The method of claim 1, comprising: the server predictively classifying the future event into the predicted category thereof further in accordance with at least one graph image generated as a time series also input thereto, the at least one graph image representing at least one point anomaly of the set of point anomalies. Allowable Subject Matter IV. CLAIMS 1-20 have been deemed allowable over the 35 U.S.C. 102 and 35 U.S.C. 103 statutes. Other than the above Double Patenting rejection, no prior art has been found to anticipate, teach or suggest the detailed features of the claimed inventive scope. Conclusion V. Any inquiry concerning this communication or earlier communications from the examiner should be directed to KRISTIE D. SHINGLES whose telephone number is (571) 272-3888. The examiner can normally be reached on Monday-Thursday 10am-7pm. 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. VI. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kamal Divecha can be reached on 571-272-5863. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /KRISTIE D SHINGLES/Primary Examiner, Art Unit 2453
Read full office action

Prosecution Timeline

Aug 13, 2024
Application Filed
Dec 12, 2025
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591653
AUTHENTICATION USING AI-GENERATED MEDIA SAMPLES
2y 5m to grant Granted Mar 31, 2026
Patent 12587509
HYBRID MEDIA DISTRIBUTION FOR TELEHEALTH SESSIONS
2y 5m to grant Granted Mar 24, 2026
Patent 12586063
FORTIFIED DECOUPLED STATE MACHINE REPLICATION
2y 5m to grant Granted Mar 24, 2026
Patent 12568131
AMBIENT, AD HOC, MULTIMEDIA COLLABORATION IN A GROUP-BASED COMMUNICATION SYSTEM
2y 5m to grant Granted Mar 03, 2026
Patent 12563015
SECURE TRANSFER GATEWAY
2y 5m to grant Granted Feb 24, 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
82%
Grant Probability
95%
With Interview (+13.0%)
3y 0m
Median Time to Grant
Low
PTA Risk
Based on 792 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