Prosecution Insights
Last updated: November 20, 2026
Application No. 18/790,511

METHODS AND SYSTEMS FOR REPORTING PROBABLE CAUSES OF ERRORS IN SERVICES

Final Rejection §103
Filed
Jul 31, 2024
Priority
Jun 28, 2024 — EU 24306050.6
Examiner
GUYTON, PHILIP A
Art Unit
2114
Tech Center
2100 — Computer Architecture & Software
Assignee
Hewlett Packard Enterprise Development L.P.
OA Round
4 (Final)
84%
Grant Probability
Favorable
5-6
OA Rounds
4m
Est. Remaining
95%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
680 granted / 812 resolved
+28.7% vs TC avg
Moderate +11% lift
Without
With
+10.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
13 currently pending
Career history
837
Total Applications
across all art units

Statute-Specific Performance

§101
11.6%
-28.4% vs TC avg
§103
40.9%
+0.9% vs TC avg
§102
28.6%
-11.4% vs TC avg
§112
12.0%
-28.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 812 resolved cases

Office Action

§103
FINAL OFFICE ACTION Response to Arguments Applicant’s arguments with respect to the claims have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Claim Rejections - 35 USC § 103 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. Claims 1-3, 6-10, 12-17, 19, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over U.S. Patent No. 11,175,947 to Oezmen et al. (hereinafter Oezmen) in view of U.S. Patent Pub. No. 2013/0097183 to McCracken (hereinafter McCracken). Oezmen discloses: 1. A computer-implemented method comprising: identifying, by a network analyzer, an impacted service reporting an error, the network analyzer being a device that includes a processing resource (col. 4, lns. 29-31 and col. 10, lns. 49-52); identifying, by the network analyzer, one or more upstream services related to the impacted service based on a service dependency between the one or more upstream services and the impacted service (col. 8, lns. 12-24 and col. 12, ln. 55-col. 13, ln. 2); identifying, by the network analyzer, at least one modification in one or more of the impacted service or the one or more upstream services based on respective versions of the impacted service and the one or more upstream services (col. 9, lns. 55-65, col. 10, lns. 5-19 and col. 13, lns. 2-21); determining, by the network analyzer, a relevancy score for each candidate modification of a set of candidate modifications based on respective weights assigned to each relationship link between the impacted service and the one or more upstream services related to the impacted service, the set of candidate modifications selected from the at least one modification as probable causes of the error (col. 9, lns. 31-37 and lns. 55-59, col. 10, lns. 44-61); and reporting, by the network analyzer, the set of candidate modifications according to the relevancy score for each candidate modification of the set of candidate modifications (col. 11, lns. 1-12, col. 13, lns. 22-32). Oezmen does not disclose expressly a service dependency graph, the relevancy score for a given candidate modification determined based on the weights of the relationship link or relationship links along a path in the service dependency graph between the service in which the given candidate modification was made and the impacted service. McCracken teaches a service dependency graph (paras. [0055]-[0056] and Fig. 2), the relevancy score for a given candidate modification determined based on the weights of the relationship link or relationship links along a path in the service dependency graph between the service in which the given candidate modification was made and the impacted service (paras. [0064]-[0071]). Before the effective filing date of the claimed invention, it would have been obvious to a person of ordinary skill in the art to modify Oezmen by using a service dependency graph an determining scores, as taught by McCracken. A person of ordinary skill in the art would have been motivated to do so in order to reduce the time from failure to resolution, as discussed by McCracken (para. [0047]). Modified Oezmen discloses: 2. The computer-implemented method of claim 1, wherein the at least one modification comprises a code change, a configuration change, a hardware change, an operating environment change, or combinations thereof (Oezmen - col. 5, lns. 17-20). 3. The computer-implemented method of claim 1, further comprising identifying, by the network analyzer, the error based on service performance data corresponding to a plurality of services (Oezmen - col. 10, lns. 49-52). 6. The computer-implemented method of claim 1, further comprising selecting, by the network analyzer, the set of candidate modifications from the at least one modification based on a timestamp associated with the at least one modification (Oezmen - col. 12, lns. 28-54). 7. The computer-implemented method of claim 6, wherein: the method further comprises: assigning, by the network analyzer, the respective weight to each relationship link between the impacted service and the one or more upstream services related to the impacted service (Oezmen - col. 9, lns. 24-31); and rank-ordering, by the network analyzer, the set of candidate modifications based on the relevancy score for each candidate modification (Oezmen - col. 9, lns. 37-67); and reporting, by the network analyzer, the set of candidate modifications according to the relevancy score for each candidate modification of the set of candidate modifications comprises reporting the set of candidate modifications, as rank-ordered (Oezmen - col. 10, lns. 65-col. 11, ln. 12). 8. The computer-implemented method of claim 7, wherein the relevancy score for a given candidate modification is determined as a product of the respective weights of each relationship link between the impacted service and a service in which the given candidate modification is made (Oezmen - Fig. 2E). Claims 9, 10, 13, 14 are a network analyzer for performing the identical steps as performed by the method of claims 1, 3, 6, 7, and are rejected under the same rationale. 12. The network analyzer of claim 9, wherein non-transitory machine-readable storage medium is configured to store a service dependency database comprising information representing relationships between a plurality of services, and wherein the processing resource is configured to execute one or more of the instructions to determine the one or more upstream services based on the relationships between a plurality of services stored in the service dependency database (Oezmen - col. 9, lns. 24-54). 15. The network analyzer of claim 14, wherein a value of the respective weight is in a range from 0 (zero) to 1 (one) (Oezmen - Fig. 2E). Claims 16, 17, and 19 are a non-transitory machine-readable medium for performing the identical steps as performed by the method of claims 1, 6, and 8, and are rejected under the same rationale. 20. The non-transitory machine-readable storage medium of claim 18, wherein the instructions further comprise instructions to rank-order the set of candidate modifications in descending order of the respective relevancy score (Oezmen - col. 9, lns. 55-67). Claims 4, 5, and 11 are rejected under 35 U.S.C. 103 as being unpatentable over Oezmen in view of McCracken, and further in view of U.S. Patent Pub. No. 2021/0026676 to Sharma et al. (hereinafter Sharma). Oezmen does not disclose expressly: 4. The computer-implemented method of claim 3, wherein the service performance data comprises information from one or more of incident logs, error logs, or service health logs. Sharma teaches wherein the service performance data comprises information from one or more of incident logs, error logs, or service health logs (para. [0033]). Before the effective filing date of the claimed invention, it would have been obvious to a person of ordinary skill in the art to modify Oezmen by using error logs, as taught by Sharma. A person of ordinary skill in the art would have been motivated to do so in order to efficiently provide notifications without frequent polling necessary, as discussed by Sharma (para. [0013]). Modified Oezmen discloses: 5. The computer-implemented method of claim 4, wherein each entry in one or more of the incident logs, error logs, or device health logs comprises a unique identifier associated with a service relating to the entry, and wherein identifying the impacted service comprises identifying the unique identifier corresponding to impacted service reporting the error based on one more of the incident logs, error logs, or device health logs (Sharma – para. [0034]). Claim 11 is a network analyzer for performing the identical steps as performed by the method of claims 4 and 5, and is rejected under the same rationale. Claim 21 is rejected under 35 U.S.C. 103 as being unpatentable over Oezmen in view of McCracken, and further in view of U.S. Patent No. 8,943,154 to Bodell et al. (hereinafter Bodell). Oezmen does not disclose expressly: 21. The computer-implemented method of Claim 1, wherein the respective weights assigned to each relationship link between the impacted service and the one or more upstream services related to the impacted service are assigned according to a relationship distance between the impacted service and the one or more upstream services. Bodell teaches wherein the respective weights assigned to each relationship link between the impacted service and the one or more upstream services related to the impacted service are assigned according to a relationship distance between the impacted service and the one or more upstream services (col. 2, lns. 20-37, col. 4, lns. 36-43 – weights of edges may be based on hop count). Before the effective filing date of the claimed invention, it would have been obvious to a person of ordinary skill in the art to modify Oezmen by using weights according to a hop count, as taught by Bodell. A person of ordinary skill in the art would have been motivated to do so in order to more efficiently resolve issues, as discussed by Bodell (col. 1, lns. 22-25). Conclusion Applicant's amendment necessitated the new grounds of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Philip Guyton whose telephone number is (571)272-3807. The examiner can normally be reached M-F 8:00-4:30. 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, Bryce Bonzo can be reached at (571)272-3655. 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. /PHILIP GUYTON/ Primary Examiner, Art Unit 2113
Read full office action

Prosecution Timeline

Show 4 earlier events
Apr 06, 2026
Response after Non-Final Action
Apr 16, 2026
Request for Continued Examination
Apr 24, 2026
Response after Non-Final Action
Jul 15, 2026
Non-Final Rejection mailed — §103
Oct 07, 2026
Examiner Interview Summary
Oct 07, 2026
Applicant Interview (Telephonic)
Oct 09, 2026
Response Filed
Nov 06, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12792441
STORAGE DEVICE, METHOD OF OPERATING STORAGE DEVICE, AND METHOD OF OPERATING NON-VOLATILE MEMORY
2y 10m to grant Granted Nov 10, 2026
Patent 12794981
SERVER SYSTEM
2y 4m to grant Granted Nov 10, 2026
Patent 12792480
MEDIA AGENT STATE MANAGEMENT BASED ON PERFORMANCE TRENDING ANALYSIS
1y 11m to grant Granted Nov 10, 2026
Patent 12775395
MEMORY DEVICE, STORAGE DEVICE, AND COMPUTING SYSTEM INCLUDING MEMORY DEVICE AND STORAGE DEVICE
2y 0m to grant Granted Oct 27, 2026
Patent 12762009
DATA PROCESSING METHOD BASED ON BLOCKCHAIN NETWORK AND RELATED PRODUCT
2y 1m to grant Granted Oct 13, 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

5-6
Expected OA Rounds
84%
Grant Probability
95%
With Interview (+10.9%)
2y 8m (~4m remaining)
Median Time to Grant
High
PTA Risk
Based on 812 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