Prosecution Insights
Last updated: October 01, 2026
Application No. 19/093,695

COMMUNICATION METHOD AND COMMUNICATION APPARATUS

Non-Final OA §102§103
Filed
Mar 28, 2025
Priority
Sep 30, 2022 — CN 202211214639.0 +1 more
Examiner
WOO, ANDREW M
Art Unit
Tech Center
Assignee
Huawei Technologies Co., Ltd.
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
1y 3m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allowance Rate
478 granted / 578 resolved
+22.7% vs TC avg
Strong +44% interview lift
Without
With
+43.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
11 currently pending
Career history
595
Total Applications
across all art units

Statute-Specific Performance

§101
12.5%
-27.5% vs TC avg
§103
45.9%
+5.9% vs TC avg
§102
17.5%
-22.5% vs TC avg
§112
14.7%
-25.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 578 resolved cases

Office Action

§102 §103
DETAILED ACTION The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . The application has been examined. Claims 1-18 are pending. Information Disclosure Statement The information disclosure statement (IDS) submitted on 04/17/2025. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Priority Acknowledgment is made of applicant’s claim for foreign priority under 35 U.S.C. 119 (a)-(d). The certified copy has been filed in Application No. CN 202211214639.0, filed on 09/30/2022. Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. Claim Objections Claims 3 and 5 are objected to because of the following informalities: lack of terminology consistency Claim 3, line 2, recites “a first message comprises” and should be changed to -- [[a]] the first message comprises --. Similar changes are suggested for subsequent claims. Claim 3, line 4, recites “a second message comprises” and should be changed to -- [[a]] the second message comprises --. Similar changes are suggested for subsequent claims. Appropriate corrections are required. 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)(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. Claims 1-5, 7-11, and 13-17 are rejected under 35 U.S.C. 102(a)(1) as being unpatentable by Thomasson et al. (2020/0044940, hereinafter Thomasson). Regarding claim 1, Thomasson discloses a communication method, wherein the method comprises: obtaining, by a first node, network topology configuration information (Thomasson discloses that the management server may retrieve (obtain) network configuration information from neighboring nodes or from a set of discovered nodes defined by the discovery parameters) (Thomasson, para. 34), wherein the network topology configuration information comprises a node identity, a node type, and network topology information (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); receiving, by the first node, a first message, wherein the first message comprises a node identity of a second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); obtaining, by the first node, network configuration information of the second node based on the network topology configuration information (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); and sending, by the first node, a second message, wherein the second message comprises the network configuration information of the second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying one or more network routes between the first node and the plurality of nodes) (Thomasson, para. 100), wherein the network configuration information of the second node indicates: a node type of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); an adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); and a node type of the adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37). Regarding claim 2, Thomasson discloses the method according to claim 1, wherein the second node and the adjacent node of the second node are of different node types (Thomasson discloses that the discovery parameters for discovering configuration information for the plurality of nodes in the network includes device type information identifying specific types of nodes or specify types (different) of nodes based upon their functions) (Thomasson, para. 44). Regarding claim 3, Thomasson discloses the method according to claim 1, wherein the receiving, by the first node, a first message comprises: receiving, by the first node, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60); and the sending, by the first node, a second message comprises: sending, by the first node, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60). Regarding claim 4, Thomasson discloses the method according to claim 1, further comprising: before receiving the first message, sending, by the first node, a broadcast message, wherein the broadcast message indicates that the first node has a network topology configuration capability (Thomasson discloses that the updated discovery parameters are received (broadcast message), which the updated discovery request may specify which types of devices and/or roles to be included and identified) (Thomasson, para. 60). Regarding claim 5, Thomasson discloses the method according to claim 1, wherein the receiving, by the first node, a first message comprises: receiving, by the first node, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60) by using a routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44); and the sending, by the first node, a second message comprises: sending, by the first node, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60) by using the routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44). Regarding claim 7, Thomasson discloses an apparatus, comprising at least one processor (Thomasson, para. 60), wherein when the at least one processor invokes a computer program or instructions in a memory (Thomasson, para. 60), the apparatus implements operations comprising: obtaining, network topology configuration information (Thomasson discloses that the management server may retrieve (obtain) network configuration information from neighboring nodes or from a set of discovered nodes defined by the discovery parameters) (Thomasson, para. 34), wherein the network topology configuration information comprises a node identity, a node type, and network topology information (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); receiving, a first message, wherein the first message comprises a node identity of a second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); obtaining, network configuration information of the second node based on the network topology configuration information (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); and sending, a second message, wherein the second message comprises the network configuration information of the second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying one or more network routes between the first node and the plurality of nodes) (Thomasson, para. 100), wherein the network configuration information of the second node indicates: a node type of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); an adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); and a node type of the adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37). Regarding claim 8, Thomasson discloses the apparatus according to claim 7, wherein the second node and the adjacent node of the second node are of different node types (Thomasson discloses that the discovery parameters for discovering configuration information for the plurality of nodes in the network includes device type information identifying specific types of nodes or specify types (different) of nodes based upon their functions) (Thomasson, para. 44). Regarding claim 9, Thomasson discloses the apparatus according to claim 7, wherein when the at least one processor invokes the computer program or the instructions, the apparatus implements operations comprising: receiving, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60); and sending, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60). Regarding claim 10, Thomasson discloses the apparatus according to claim 7, wherein when the at least one processor invokes the computer program or the instructions, the apparatus implements operations further comprising: sending a broadcast message, wherein the broadcast message indicates that the apparatus has a network topology configuration capability (Thomasson discloses that the updated discovery parameters are received (broadcast message), which the updated discovery request may specify which types of devices and/or roles to be included and identified) (Thomasson, para. 60). Regarding claim 11, Thomasson discloses the apparatus according to claim 7, wherein when the at least one processor invokes the computer program or the instructions, the apparatus implements operations comprising: receiving, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60) by using a routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44); and sending, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60) by using the routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44). Regarding claim 13, Thomasson discloses a non-transitory computer-readable storage medium (Thomasson, para. 60), wherein the non-transitory computer-readable storage medium is configured to store instructions or a computer program (Thomasson, para. 60); and when the instructions or the computer program is executed, the following operations are performed: obtaining, network topology configuration information (Thomasson discloses that the management server may retrieve (obtain) network configuration information from neighboring nodes or from a set of discovered nodes defined by the discovery parameters) (Thomasson, para. 34), wherein the network topology configuration information comprises a node identity, a node type, and network topology information (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); receiving, a first message, wherein the first message comprises a node identity of a second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); obtaining, network configuration information of the second node based on the network topology configuration information (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers for the nodes and plurality of nodes (second node)) (Thomasson, para. 98); and sending, a second message, wherein the second message comprises the network configuration information of the second node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying one or more network routes between the first node and the plurality of nodes) (Thomasson, para. 100), wherein the network configuration information of the second node indicates: a node type of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); an adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37); and a node type of the adjacent node of the second node (Thomasson discloses that the discovery parameter may define which types of nodes are to be discovered, the type of configuration information to be discovered, and the scope for discovering neighboring nodes) (Thomasson, para. 37). Regarding claim 14, Thomasson discloses the non-transitory computer-readable storage medium according to claim 13, wherein the second node and the adjacent node of the second node are of different node types (Thomasson discloses that the discovery parameters for discovering configuration information for the plurality of nodes in the network includes device type information identifying specific types of nodes or specify types (different) of nodes based upon their functions) (Thomasson, para. 44). Regarding claim 15, Thomasson discloses the non-transitory computer-readable storage medium according to claim 13, wherein when the instructions or the computer program is executed, the following operations are further performed: receiving, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60); and sending, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60). Regarding claim 16, Thomasson discloses the non-transitory computer-readable storage medium according to claim 13, wherein when the instructions or the computer program is executed, the following operations are performed: sending a broadcast message, wherein the broadcast message indicates that a first node has a network topology configuration capability (Thomasson discloses that the updated discovery parameters are received (broadcast message), which the updated discovery request may specify which types of devices and/or roles to be included and identified) (Thomasson, para. 60). Regarding claim 17, Thomasson discloses the non-transitory computer-readable storage medium according to claim 13, wherein when the instructions or the computer program is executed, the following operations are performed: receiving, the first message from the second node (Thomasson discloses that the updated discovery parameters are received and specifically defines new parameters such as, a new starting node, new maximum hop count, and/or updated device types and roles for discovered nodes) (Thomasson, para. 60) by using a routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44); and sending, the second message to the second node (Thomasson discloses that the updated discovery parameters are received, which the updated discovery request may specify which types of devices and/or roles to be included) (Thomasson, para. 60) by using the routing node (Thomasson discloses that the discovery parameters include device type information identifying specific types of nodes, such as routers, switches, servers, or any other specific network device or specify that only core routers (routing node) to be discovered and used to route traffic) (Thomasson, para. 44). 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 of this title, 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. Claims 6, 12, and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Thomasson et al. (2020/0044940, hereinafter Thomasson) as applied to claim 1, 7, and 13 above, and further in view of Brandwine et al. (2015/0168417, hereinafter Brandwine). Regarding claim 6, Thomasson discloses the method according to claim 1, wherein the method further comprises: receiving, by the first node, a third message from a third node by using the second node, wherein the third message comprises a node identity of the third node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98). Thomasson does not explicitly disclose performing, by the first node, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information; and when the secure access authentication succeeds on the third node, sending, by the first node, a fourth message to the third node by using the second node, wherein the fourth message comprises network configuration information of the third node. In analogous art, Brandwine teaches performing, by the first node, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44); and when the secure access authentication succeeds on the third node, sending, by the first node, a fourth message to the third node by using the second node, wherein the fourth message comprises network configuration information of the third node (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44). Therefore it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention to take the teachings of Brandwine related to performing a secure access authorization and to combine with Thomasson in order to increase the efficiency and security of sharing various computing resources between users (Brandwine, para. 2). Regarding claim 12, Thomasson discloses the apparatus according to claim 7, wherein when the at least one processor invokes the computer program or the instructions, the apparatus implements operations further comprising: receiving, a third message from a third node by using the second node, wherein the third message comprises a node identity of the third node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98). Thomasson does not explicitly disclose performing, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information; and when the secure access authentication succeeds on the third node, sending a fourth message to the third node by using the second node, wherein the fourth message comprises network configuration information of the third node. In analogous art, Brandwine teaches performing, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44); and when the secure access authentication succeeds on the third node, sending a fourth message to the third node by using the second node, wherein the fourth message comprises network configuration information of the third node (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44). Therefore it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention to take the teachings of Brandwine related to performing a secure access authorization and to combine with Thomasson in order to increase the efficiency and security of sharing various computing resources between users (Brandwine, para. 2). Regarding claim 18, Thomasson discloses the non-transitory computer-readable storage medium according to claim 13, wherein when the at least one processor invokes the computer program or the instructions, when the instructions or the computer program is executed, the following operations are further performed: receiving, a third message from a third node by using the second node, wherein the third message comprises a node identity of the third node (Thomasson discloses that the discovery request (message) is sent to the node for the network configuration information identifying connectivity between the node and the subset of plurality of nodes and receive network configuration information comprises network addresses, endpoint identifiers for connections, and/or MAC identifiers (node identity) for the nodes and plurality of nodes (second node)) (Thomasson, para. 98). Thomasson does not explicitly disclose performing, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information; and when the secure access authentication succeeds on the third node, sending a fourth message to the third node by using the second node. In analogous art, Brandwine teaches performing, secure access authentication on the third node, wherein the node identity of the third node is not comprised in the network topology configuration information (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44); and when the secure access authentication succeeds on the third node, sending a fourth message to the third node by using the second node (Brandwine discloses that the communication manager will verify (secure access authorization) that the communions are received over the network are authorized and/or valid) (Brandwine, para. 44). Therefore it would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention to take the teachings of Brandwine related to performing a secure access authorization and to combine with Thomasson in order to increase the efficiency and security of sharing various computing resources between users (Brandwine, para. 2). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANDREW WOO whose telephone number is (571)270-7521. The examiner can normally be reached Telework 9:00AM-6:00PM | IFP M-F 9:00AM-6: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, Umar Cheema can be reached at 571-270-3037. 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. /A.W./Examiner, Art Unit 2458 /UMAR CHEEMA/Supervisory Patent Examiner, Art Unit 2458
Read full office action

Prosecution Timeline

Mar 28, 2025
Application Filed
Sep 23, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12706977
SYSTEM AND METHOD FOR IMPROVED OPT-OUT RECOGNITION FOR A MOBILE DEVICE
2y 1m to grant Granted Aug 11, 2026
Patent 12701157
INFORMATION PROCESSING METHOD, COMPUTER DEVICE AND STORAGE MEDIUM
2y 2m to grant Granted Aug 04, 2026
Patent 12696135
TRAFFIC BALANCING FOR MOVING USERS, PROACTIVE SLICE MANAGEMENT, AND PREDICTIVE SLICE MANAGEMENT USING ARTIFICIAL INTELLIGENCE
2y 4m to grant Granted Jul 28, 2026
Patent 12659787
DYNAMIC TRAFFIC IDENTIFIER MAPPING BASED ON INTERNET-OF-THINGS DEVICE PRESENCE
2y 1m to grant Granted Jun 16, 2026
Patent 12634348
PLATFORM AND METHOD FOR AUTOMATED DEVICE MANAGEMENT AND INFRASTRUCTURE SERVICING
2y 7m to grant Granted May 19, 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 (+43.8%)
2y 9m (~1y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 578 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