Prosecution Insights
Last updated: November 20, 2026
Application No. 19/231,181

MESSAGING AMONG MESSAGE GROUPS IN A MESH NETWORK

Non-Final OA §102§103
Filed
Jun 06, 2025
Priority
Sep 16, 2022 — continuation of 12/368,720
Examiner
RAHMAN, SM AZIZUR
Art Unit
2434
Tech Center
2400 — Computer Networks
Assignee
Itron Inc.
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
1y 1m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
475 granted / 537 resolved
+30.5% vs TC avg
Strong +18% interview lift
Without
With
+17.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
12 currently pending
Career history
551
Total Applications
across all art units

Statute-Specific Performance

§101
7.7%
-32.3% vs TC avg
§103
53.0%
+13.0% vs TC avg
§102
33.9%
-6.1% vs TC avg
§112
3.5%
-36.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 537 resolved cases

Office Action

§102 §103
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 1. Status of Claims: Claims 1-20 are pending in this Office Action. Information Disclosure Statement 2. The information disclosure statement (IDS) submitted on 08/07/2025, 08/14/2025, 11/12/2025, 04/20/2026, and 09/24/2026 are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Priority 3. Examiner acknowledges that this present application is a continuation of United States application titled “MESSAGING AMONG MESSAGE GROUPS IN A MESH NETWORK,” filed on September 16, 2022, and having Serial No. 17/933,007. The subject matter of this related application is hereby incorporated herein by reference. 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)(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. 4. Claims 1-2 and 17 are rejected under 35 U.S.C. 102 (a) (2) as being anticipated by WO2022082825A1 issued to Bo et al. (Bo). As per claim 1, Bo teaches a method comprising: receiving, by a messaging application executing on a first node of a mesh network, a request from an agent executing on the first node to join a message group (Bo: Pg. 4, last paragraph - the multicast processing node located at the edge of the network receives and processes the join request message based on the multicast identifier forwarded by the multicast member agent, sends a resolution request to the identification resolution service module, and parses the multicast identifier carried in the join request message); in response to determining that the agent is permitted to join the message group, adding, by the messaging application, the agent to the message group (Bo: Pg. 6. 3rd Paragraph - if the destination network address carried in the modified join request message is the network address of the multicast processing node that currently receives the modified join request message, update the local multicast forwarding table (adding the agent by updating table) according to the modified join request message, and construct a Forward request response message); and delivering, by the messaging application, one or more messages associated with the message group between the agent and one or more other agents that are members of the messaging group (Bo: Pg. 9, 3rd Paragraph - one or more multicast member agents and one or more multicast receivers, and the multicast member agents and the multicast receivers are located in the same broadcast domain; multicast The member agent has a local identifier, which is used for information exchange between the multicast receiver and the multicast member agent in the local broadcast domain). As per claim 2, Bo teaches the method of claim 1, further comprising creating, by the messaging application, the message group in response to a request from the agent to create the message group (Bo: Pg. 4, last paragraph - the multicast processing node located at the edge of the network receives and processes the join request message based on the multicast identifier forwarded by the multicast member agent, sends a resolution request to the identification resolution service module, and parses the multicast identifier carried in the join request message; Bo: Pg. 6. 3rd Paragraph – teaches if the destination network address carried in the modified join request message is the network address of the multicast processing node that currently receives the modified join request message, update the local multicast forwarding table (by adding the agent and update the table) according to the modified join request message. Examiner’s interpretation is when the table is updated by adding the agent, it becomes a new table and being created). As per claim 17, Bo teaches a network device in a mesh network, comprising: one or more processors; and a memory storing executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: in response to receiving a request from an agent executing on the network device to access a message group (Bo: Pg. 4, last paragraph - the multicast processing node located at the edge of the network receives and processes the join request message based on the multicast identifier forwarded by the multicast member agent, sends a resolution request to the identification resolution service module, and parses the multicast identifier carried in the join request message), making the agent a member of the message group (Bo: Pg. 6. 3rd Paragraph - if the destination network address carried in the modified join request message is the network address of the multicast processing node that currently receives the modified join request message, update the local multicast forwarding table (adding the agent by updating table) according to the modified join request message, and construct a Forward request response message); and transmitting and receiving one or more messages having an identifier of the message group between the agent and one or more other agents that are included in the message group, the one or more other agents executing on respective other network devices in the mesh network (Bo: Pg. 9, 3rd Paragraph - one or more multicast member agents and one or more multicast receivers, and the multicast member agents and the multicast receivers are located in the same broadcast domain; multicast The member agent has a local identifier, which is used for information exchange between the multicast receiver and the multicast member agent in the local broadcast domain). 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. 5. Claims 3, 7-13, 15-16, 18, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over WO2022082825A1 issued to Bo et al. (Bo) in view of US 8,310,973 issued to Garofalo et al. (Garofalo) (Applicant IDS). As per claim 3, Bo teaches the method of claim 1 however does not explicitly teach further comprising prior to transmitting a first message from the agent to the one or more other agents, verifying, by the messaging application, that a policy for the message group permits the agent to transmit the first message to the message group. Garofalo however explicitly teaches further comprising prior to transmitting a first message from the agent to the one or more other agents, verifying, by the messaging application, that a policy for the message group permits the agent to transmit the first message to the message group (Garofalo: Col. 4, ll. (50-59) – by delivery policy it is meant here a set of rules that guide the treatment of a content request according to specific conditions related to the user (i.e., his/her identity, his/her credit), the connectivity (the available bandwidth), the content (i.e. the necessary bandwidth and other attributes) and/or in general according to parameters that can be acquired in real time analyzing the session. These rules determine the action that will be acted (enforced) on the request i.e., authorizing the original one or modifying it with a different content reference). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach prior to transmitting a first message from the agent to the one or more other agents, verifying, by the messaging application, that a policy for the message group permits the agent to transmit the first message to the message group. One would be motivated to do so as by delivery policy it is meant here a set of rules that guide the treatment of a content request according to specific conditions related to the user (i.e., his/her identity, his/her credit), the connectivity (the available bandwidth), the content (i.e. the necessary bandwidth and other attributes) and/or in general according to parameters that can be acquired in real time analyzing the session. These rules determine the action that will be acted (enforced) on the request i.e., authorizing the original one or modifying it with a different content reference (Garofalo: Col. 4, ll. (50-59)). As per claim 7, Bo teaches the method of claim 1 however does not explicitly teach further comprising: receiving, by the messaging application, a first message for the message group from a second messaging application executing on a second node of the mesh network; and delivering, by the messaging application, the first message to the agent. Garofalo however explicitly teaches further comprising: receiving, by the messaging application, a first message for the message group from a second messaging application executing on a second node of the mesh network; and delivering, by the messaging application, the first message to the agent (Garofalo: Col. 6, ll. (54-56) – for the multicast content if a content redirection 55 is active at the moment for the host 15 connected to the router). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach receiving, by the messaging application, a first message for the message group from a second messaging application executing on a second node of the mesh network; and delivering, by the messaging application, the first message to the agent. One would be motivated to do so as for the multicast content if a content redirection is active at the moment for the host connected to the router (Garofalo: Col. 6, ll. (54-56)). As per claim 8, the modified teaching of Bo teaches the method of claim 7, wherein the first message is included in a composite message that also includes a second message for a second message group, and the method further comprises: delivering, by the messaging application, content from the first message to the agent; and delivering, by the messaging application, content from the second message to at least one agent executing on the first node that is included in the second message group (Garofalo: Col. 6, ll. (46-55) – an Intermediate Agent (IA) 18 is disposed on the line towards hosts 15, between each host 15 and the Replication Point 13; the Intermediate Agent 18 deals with adding an interface (e.g., line) identifier to the IGMP signalling sent by the hosts 15, in order to identify the host in an unequivocal manner and independently of the credentials provided. Moreover, the Intermediate Agent 18 performs NAT/PAT (Network Address Translation/Port Address Translation) functionality for the multicast content if a content redirection is active at the moment for the host 15 connected to the router). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach the first message is included in a composite message that also includes a second message for a second message group, and the method further comprises: delivering, by the messaging application, content from the first message to the agent; and delivering, by the messaging application, content from the second message to at least one agent executing on the first node that is included in the second message group. One would be motivated to do so as an Intermediate Agent (IA) is disposed on the line towards hosts, between each host and the Replication Point; the Intermediate Agent deals with adding an interface (e.g., line) identifier to the IGMP signalling sent by the hosts, in order to identify the host in an unequivocal manner and independently of the credentials provided. Moreover, the Intermediate Agent 18 performs NAT/PAT (Network Address Translation/Port Address Translation) functionality for the multicast content if a content redirection is active at the moment for the host connected to the router (Garofalo: Col. 6, ll. (46-55)). As per claim 9, Bo teaches the method of claim 1 however does not explicitly teach wherein determining that the agent is permitted to join the message group comprises verifying that a policy permits the agent to join the message group. Garofalo however explicitly teaches wherein determining that the agent is permitted to join the message group comprises verifying that a policy permits the agent to join the message group (Garofalo: Col. 4, ll. (32-34) – determine a delivery policy associated to that host for the requested group). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach wherein determining that the agent is permitted to join the message group comprises verifying that a policy permits the agent to join the message group. One would be motivated to do to determine a delivery policy associated to that host for the requested group (Garofalo: Col. 4, ll. (32-34)). As per claim 10, the modified teaching of Bo teaches the method of claim 9, wherein the policy indicates at least one of a permission of the agent to create message groups of one or more message group types, a permission of the agent to join one or more message groups, or a permission of the agent to transmit messages to one or more message groups (Garofalo: Col. 4, ll. (32-34) – determine a delivery policy associated to that host for the requested group). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach wherein the policy indicates at least one of a permission of the agent to create message groups of one or more message group types, a permission of the agent to join one or more message groups, or a permission of the agent to transmit messages to one or more message groups. One would be motivated to do to determine a delivery policy associated to that host for the requested group (Garofalo: Col. 4, ll. (32-34)). As per claim 11, Bo teaches one or more non-transitory computer-readable media storing instructions that, when executed by one or more processors of a node of a mesh network, cause the one or more processors to execute a messaging application performing operations comprising: receiving a request from an agent executing on the node to become a member of a messaging group (Bo: Pg. 4, last paragraph - the multicast processing node located at the edge of the network receives and processes the join request message based on the multicast identifier forwarded by the multicast member agent, sends a resolution request to the identification resolution service module, and parses the multicast identifier carried in the join request message); and exchanging one or more messages designated for the messaging group between the agent and one or more other agents executing on other nodes of the mesh network, the one or more other agents being members of the messaging group (Bo: Pg. 9, 3rd Paragraph - one or more multicast member agents and one or more multicast receivers, and the multicast member agents and the multicast receivers are located in the same broadcast domain; multicast The member agent has a local identifier, which is used for information exchange between the multicast receiver and the multicast member agent in the local broadcast domain). Bo however does not explicitly teach subscribing the agent to the messaging group in response to determining that a policy for the messaging group allows the agent to become a member of the messaging group; Garofalo however explicitly teaches subscribing the agent to the messaging group in response to determining that a policy for the messaging group allows the agent to become a member of the messaging group (Garofalo: Col. 4, ll. (32-34) – determine a delivery policy associated to that host for the requested group); It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach subscribing the agent to the messaging group in response to determining that a policy for the messaging group allows the agent to become a member of the messaging group. One would be motivated to do to determine a delivery policy associated to that host for the requested group (Garofalo: Col. 4, ll. (32-34)). As per claim 12, the modified teaching of Bo teaches the one or more non-transitory computer-readable media of claim 11, wherein the operations further comprise: receiving a second request from the agent to form the messaging group; and in response to determining that the policy allows the agent to form the messaging group, forming the messaging group (Bo: Pg. 4, last paragraph - the multicast processing node located at the edge of the network receives and processes the join request message based on the multicast identifier forwarded by the multicast member agent, sends a resolution request to the identification resolution service module, and parses the multicast identifier carried in the join request message; Bo: Pg. 6. 3rd Paragraph – teaches if the destination network address carried in the modified join request message is the network address of the multicast processing node that currently receives the modified join request message, update the local multicast forwarding table (by adding the agent and update the table) according to the modified join request message. Examiner’s interpretation is when the table is updated by adding the agent, it becomes a new table and being created). As per claim 13, the modified teaching of Bo teaches the one or more non-transitory computer-readable media of claim 11, wherein the operations further comprise: receiving content for a first message from the agent; and in response to determining that the policy allows the agent to send the content to the messaging group, sending the first message to the one or more other agents (Garofalo: Col. 4, ll. (50-59) – by delivery policy it is meant here a set of rules that guide the treatment of a content request according to specific conditions related to the user (i.e., his/her identity, his/her credit), the connectivity (the available bandwidth), the content (i.e. the necessary bandwidth and other attributes) and/or in general according to parameters that can be acquired in real time analyzing the session. These rules determine the action that will be acted (enforced) on the request i.e., authorizing the original one or modifying it with a different content reference). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach receiving content for a first message from the agent; and in response to determining that the policy allows the agent to send the content to the messaging group, sending the first message to the one or more other agents. One would be motivated to do so as by delivery policy it is meant here a set of rules that guide the treatment of a content request according to specific conditions related to the user (i.e., his/her identity, his/her credit), the connectivity (the available bandwidth), the content (i.e. the necessary bandwidth and other attributes) and/or in general according to parameters that can be acquired in real time analyzing the session. These rules determine the action that will be acted (enforced) on the request i.e., authorizing the original one or modifying it with a different content reference (Garofalo: Col. 4, ll. (50-59)). As per claim 15, the modified teaching of Bo teaches the one or more non-transitory computer-readable media of claim 11, wherein the operations further comprise: receiving a first message for the messaging group from a second node of the mesh network; and delivering the first message to the agent (Garofalo: Col. 6, ll. (54-56) – for the multicast content if a content redirection 55 is active at the moment for the host 15 connected to the router). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Garofalo to teach wherein the operations further comprise: receiving a first message for the messaging group from a second node of the mesh network; and delivering the first message to the agent. One would be motivated to do so as for the multicast content if a content redirection is active at the moment for the host connected to the router (Garofalo: Col. 6, ll. (54-56)). As per claim 16, the claim resembles claim 10 and is rejected under the same rationale. As per claim 18, the claim resembles claim 13 and is rejected under the same rationale. As per claim 20, the claim resembles claim 7 and is rejected under the same rationale. 6. Claims 4-6 are rejected under 35 U.S.C. 103 as being unpatentable over WO2022082825A1 issued to Bo et al. (Bo) in view of US 2004/0111612 issued to Choi et al. (Choi) (Applicant IDS). As per claim 4, Bo teaches the method of claim 1 however does not explicitly teach further comprising: encrypting, by the messaging application, a first message with a cryptographic key that is associated with the message group; and transmitting, by the messaging application, the encrypted first message to the one or more other agents. Choi however explicitly teaches further comprising encrypting, by the messaging application, a first message with a cryptographic key that is associated with the message group; and transmitting, by the messaging application, the encrypted first message to the one or more other agents (Choi: ¶ 0062 – to implement authentication, the group owner challenges a group member by sending an instant value of a symmetric key variable encrypted by its private key). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Choi to teach further comprising encrypting, by the messaging application, a first message with a cryptographic key that is associated with the message group; and transmitting, by the messaging application, the encrypted first message to the one or more other agents. One would be motivated to do so as to implement authentication, the group owner challenges a group member by sending an instant value of a symmetric key variable encrypted by its private key (Choi: ¶ 0062). As per claim 5, Bo teaches the method of claim 1 however does not explicitly teach further comprising transmitting, by the messaging application, a first message from the agent to the message group and a second message for a second message group in a composite message. Choi however explicitly teaches transmitting, by the messaging application, a first message from the agent to the message group and a second message for a second message group in a composite message (Choi: Claim 1 – a group message distribution module to convert a single group message addressed to a group into a plurality of individual messages and to deliver one individual message to each group member, wherein the identities of the group members are kept undisclosed to one another and group message routing information is attached for successive group message exchanges). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Choi to teach wherein the transmitting includes transmitting the message and a second message for a second message group in a composite message. One would be motivated to do so as a group message distribution module to convert a single group message addressed to a group into a plurality of individual messages and to deliver one individual message to each group member, wherein the identities of the group members are kept undisclosed to one another and group message routing information is attached for successive group message exchanges (Choi: Claim 1). As per claim 6, the modified teaching of Bo teaches the method of claim 5, wherein content of the first message is encrypted using a first cryptographic key that is associated with the message group and content of the second message is encrypted using a second cryptographic key that is associated with the second message group (Choi: ¶ 0015 – the sender encrypts the symmetric key once per group using the group public key). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Choi to teach wherein the transmitting includes transmitting the message and a second message for a second message group in a composite message. One would be motivated to do so as a group message distribution module to convert a single group message addressed to a group into a plurality of individual messages and to deliver one individual message to each group member, wherein the identities of the group members are kept undisclosed to one another and group message routing information is attached for successive group message exchanges (Choi: ¶ 0015). 7. Claims 14 and 19 are rejected under 35 U.S.C. 103 as being unpatentable over WO2022082825A1 issued to Bo et al. (Bo) in view of US 8,310,973 issued to Garofalo et al. (Garofalo) (Applicant IDS) and further in view of US 2004/0111612 issued to Choi et al. (Choi) (Applicant IDS). As per claim 14, the modified teaching of Bo teaches the one or more non-transitory computer-readable media of claim 11 however does not explicitly teach wherein the operations further comprise: receiving first content for a first message to the messaging group from the agent; receiving second content for a second message to a second messaging group from the agent; combining the first message and the second message to create a composite message; and sending the composite message. Choi however explicitly teaches wherein the operations further comprise: receiving first content for a first message to the messaging group from the agent; receiving second content for a second message to a second messaging group from the agent; combining the first message and the second message to create a composite message; and sending the composite message (Choi: Claim 1 – a group message distribution module to convert a single group message addressed to a group into a plurality of individual messages and to deliver one individual message to each group member, wherein the identities of the group members are kept undisclosed to one another and group message routing information is attached for successive group message exchanges). It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to modify the teaching of Bo in view of Choi to teach wherein the operations further comprise: receiving first content for a first message to the messaging group from the agent; receiving second content for a second message to a second messaging group from the agent; combining the first message and the second message to create a composite message; and sending the composite message. One would be motivated to do so as a group message distribution module to convert a single group message addressed to a group into a plurality of individual messages and to deliver one individual message to each group member, wherein the identities of the group members are kept undisclosed to one another and group message routing information is attached for successive group message exchanges (Choi: Claim 1). As per claim 19, the claim resembles claim 10 and is rejected under the same rationale. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to SM AZIZUR RAHMAN whose telephone number is (571) 270-7360. The examiner can normally be reached on M-F Telework; If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Ali Shayanfar can be reached on 571-270-1050. 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. /SM A RAHMAN/Primary Examiner, Art Unit 2434
Read full office action

Prosecution Timeline

Jun 06, 2025
Application Filed
Nov 04, 2026
Non-Final Rejection mailed — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12786230
INTERNAL RECONNAISSANCE ATTACK IDENTIFICATION USING COMMAND LINE ANALYSIS
4y 3m to grant Granted Nov 03, 2026
Patent 12786164
SYSTEM AND METHOD FOR GENERATING A SIGNATURE OF A SPAM MESSAGE BASED ON CLUSTERING
2y 1m to grant Granted Nov 03, 2026
Patent 12785925
CRYPTOGRAPHICALLY SECURE CONTROL USING SECURE MULTI-PARTY COMPUTATION
1y 11m to grant Granted Nov 03, 2026
Patent 12771563
PROOF-OF-WORK OPERATION METHOD, PROOF-OF-WORK CHIP, AND UPPER COMPUTER
3y 2m to grant Granted Oct 20, 2026
Patent 12763963
BLOCKCHAIN ADDRESS MANAGEMENT FOR MORE EFFICIENT BLOCKCHAIN NETWORKS
3y 2m 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

1-2
Expected OA Rounds
88%
Grant Probability
99%
With Interview (+17.9%)
2y 7m (~1y 1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 537 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