Prosecution Insights
Last updated: November 20, 2026
Application No. 19/228,070

MULTI-STAGE QUANTIZATION FOR AUDIO CODING

Non-Final OA §102§103§112§DOUBLEPATENT
Filed
Jun 04, 2025
Priority
Jun 05, 2024 — provisional 63/656,497
Examiner
WONG, LINDA
Art Unit
2655
Tech Center
2600 — Communications
Assignee
Qualcomm Incorporated
OA Round
1 (Non-Final)
85%
Grant Probability
Favorable
1-2
OA Rounds
1y 5m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 85% — above average
85%
Career Allowance Rate
613 granted / 722 resolved
+22.9% vs TC avg
Strong +16% interview lift
Without
With
+15.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
19 currently pending
Career history
752
Total Applications
across all art units

Statute-Specific Performance

§101
7.8%
-32.2% vs TC avg
§103
45.5%
+5.5% vs TC avg
§102
21.0%
-19.0% vs TC avg
§112
14.3%
-25.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 722 resolved cases

Office Action

§102 §103 §112 §DOUBLEPATENT
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 . Drawings The drawings were received on 6/4/2025. These drawings are accepted. Claim Objections Claims 6,7,9 are objected to because of the following informalities: Such claims recite the term “course”. The specification discloses “coarse quantization”. The term is spelled incorrectly in the claims. Appropriate correction is required. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claim 11 is rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 11 recites the limitation “relatively higher bitrate”. It is unclear and indefinite as to what the boundaries are for the recited limitation. What constitutes as a “relatively higher bitrate”? Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-6,9-11,13-20 is/are rejected under 35 U.S.C. 102a1 as being anticipated by Shahbazi Mirzahasanloo et al (US Publication No.: 20190333527). Claim 1, Shahbazi Mirzahasanloo et al discloses Preamble: A device (Fig. 1 shows the device) configured to decode audio data (Fig. 13 shows the receiver with decoder. Fig. 2 shows the transmitter with encoder.), the device comprising: a memory configured to store an encoded audio bitstream representative of the audio data (Fig. 13, label 25 as the encoded audio bitstream representing audio data, label 21’. Paragraph 46 discloses “the source device 12 may output the bitstream 31 to an intermediate device positioned between the source device 12 and the sink device 14. The intermediate device may store the bitstream 31 for later delivery to the sink device 14…”. Paragraph 47 discloses the source device 12 may store the bitstream 31 to a storage medium. Fig. 15,16 shows memory and processor.); and processing circuitry in communication with the memory (Fig. 15,16 shows the processing circuitry in communication with memory.), the processing circuitry configured to: perform inverse multi-stage vector quantization (Fig. 13, label subband processing unit. Abstract discloses performing inverse pyramid vector quantization. Fig. 13, label 106’,108’,104’ shows the multi-stage vector quantization.) with respect to the encoded audio bitstream (Fig. 13, label encoded audio data, where label 128’ processes inputs in accordance with the encoded audio bitstream.) to obtain one or more subbands representative of the audio data (Fig. 13, label 114’ as the subbands representing audio data, label 21’.); reconstruct, based on the one or more subbands, the audio data (Fig. 13, label 100’,102’ reconstructs the audio data based on the subbands.); render, based on the audio data, one or more speaker feeds (Fig. 13, label audio data 21’ is output to label 48a-n of Fig. 1, wherein Fig. 13 shows label 44 of Fig. 1.); and output, for playback, the one or more speaker feeds (Fig. 1, label 49a-n). Claim 2, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to recursively perform each stage of the inverse multi-stage vector quantization with respect to the encoded audio bitstream to obtain the one or more subbands representative of the audio data (paragraph 50 discloses audio decoder 44 may operate in a manner that is reciprocal to the audio encoder 24. Fig. 7 shows the unification unit found in the compact map generation unit of 12 and 14 (paragraph 78). Paragraph 82 discloses a recursive function is used to generate unified vectors from subbands. Since the decoder works in reciprocal of the encoder, this indicates the recursive function is also used in the decoder.). Claim 3, Shahbazi Mirzahasanloo et al discloses wherein the encoded audio bitstream includes, for each stage of the multi-stage vector quantization, residual data that has been normalized to standardize energy (Paragraph 63 discloses the vector quantizer quantizes the residual vector 118 (residual data). Label 108 quantizes the residual vector using pyramid vector quantization. Paragraph 64 discloses vector 108 may be configured to map the residual vector 118 to a hyperpyramid or hypersphere (with constant L2 norm).) prior to performing each successive stage of the multi-stage vector quantization (Fig. 3 shows the internals of the vector quantization. Label 140 performs mapping unit to map the residual vector onto N-dimensional hyperphyramid or hypersphere as per paragraph 64. This is done prior to enumeration unit, a successive stage of the multi-stage vector quantization of Fig. 2, label 128 and bitstream encoder, label 110.). Claim 4, Shahbazi Mirzahasanloo et al discloses wherein the residual data is normalized according to an L2 norm (paragraph 64 discloses L2 norm or hypersphere.). Claim 5, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to perform inverse multi-stage pyramid vector quantization with respect to the encoded audio bitstream to obtain the one or more subbands representative of the audio data (Fig. 13, label 128’, paragraph 63,50.). Claim 6, Shahbazi Mirzahasanloo et al discloses wherein the encoded audio bitstream includes, for a first stage of a multi-stage vector quantization, a course quantization value for each of the one or more subbands and a fine quantization value for each of the one or more subbands (paragraph 61 discloses a subband processing unit configured to perform a gain-shape vector quantization process with extended-range coarse-fine quantization. Paragraph 65 discloses “these energy-assigned bits may then be allocated between a coarse quantization process and a fine quantization process.” Fig. 2, label 120,122 as the fine and coarse energy of the energy level 116. Paragraph 67 discloses energy quantizer 106 may first quantize the energy level 116 with a first number of bits for a coarse quantization process and paragraph 68 discloses label 106 may then quantize the quantization error using a second number of bits in a fine quantization process to produce the fine energy 122.). Claim 9, Shahbazi Mirzahasanloo et al discloses wherein the fine quantization value is allocated based on the course quantization value (Paragraph 68 discloses “the number of bits used for fine quantization bits is determined by the total number of energy assigned bits minus the number of bits used for coarse quantization process”.). Claim 10, Shahbazi Mirzahasanloo et al discloses wherein the inverse multi-stage vector quantization has a limited number of stages that is greater than one and less than a maximum number of stages (Paragraph 63 discloses quantization occurs on a block of samples, wherein more than 1 block can exist in the encoded audio data. Depending on the number of blocks, the number of states of quantization occurs.), the maximum number of stages limited by a number of bits allocated for each of the one or more subbands (Paragraph 63 discloses block of samples are quantized. Depending on the quantization parameters and the vector quantization 108, the maximum number of stages can be limited to the number of bits allocated per a subband and number of blocks of samples.). Claim 11, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to perform the inverse multi-stage vector quantization to facilitate a scalable bitrate in which a bitrate for the encoded audio bitstream scales between a low bitrate and a relatively higher bitrate (paragraph 107 discloses a scalable quality/bitrate of the audio decoder and encoder. Depending on the encoder and decoder, the bitrate or quality is scaled to a range between a low bitrate and a relatively higher bitrate.). Claim 13, Shahbazi Mirzahasanloo et al discloses wherein the one or more subbands exclude one or more low energy subbands representative of the audio data that were filtered, based on an energy threshold, by an audio encoder (Fig. 2, label 24) that encoded the audio data to obtain the encoded audio bitstream (Fig. 2, label 24,102 filters the subbands to obtain encoded audio bitstream, label 25.). Claim 14, Shahbazi Mirzahasanloo et al discloses wherein bits allocated to the low energy subbands are reallocated by the audio encoder to the one or more subbands (paragraph 59 discloses subband filter separates the frequency domain audio data 112 into subbands 114. Paragraph 60 discloses the subband filter may be configured to separate the frequency domain audio data 112 into subbands according to Bark scale where subbands have frequency ranges that are perceptually equal distance. This indicates the subbands are generated according to a scheme such as Bark scale, wherein depending on the scheme, the subbands with low energy can be shifted or reallocated or divided into other subbands.). Claim 15, Shahbazi Mirzahasanloo et al discloses wherein bits are allocated to each of the one or more subbands across each stage of a multi-stage vector quantization process performed by the audio encoder that encoded the audio data to obtain the encoded audio bitstream (Fig. 2, label quantization 128’ and bistream encoder adds bits to each of the subbands.). Claim 16, Shahbazi Mirzahasanloo et al discloses Preamble: A method for decoding audio data (Fig. 13 shows the receiver with decoder. Fig. 2 shows the transmitter with encoder.), the method comprising: obtaining an encoded audio bitstream representative of the audio data (Fig. 2, label encoded audio bitstream, Fig. 13, label encoded audio bistream.); and performing inverse multi-stage vector quantization (Fig. 13, label subband processing unit. Abstract discloses performing inverse pyramid vector quantization. Fig. 13, label 106’,108’,104’ shows the multi-stage vector quantization.) with respect to the encoded audio bitstream (Fig. 13, label encoded audio data, where label 128’ processes inputs in accordance with the encoded audio bitstream.) to obtain one or more subbands representative of the audio data (Fig. 13, label 114’ as the subbands representing audio data, label 21’.); reconstructing, based on the one or more subbands, the audio data (Fig. 13, label 100’,102’ reconstructs the audio data based on the subbands.); rendering, based on the audio data, one or more speaker feeds (Fig. 13, label audio data 21’ is output to label 48a-n of Fig. 1, wherein Fig. 13 shows label 44 of Fig. 1..); and outputting, for playback, the one or more speaker feeds (Fig. 1, label 49a-n). Claim 17, Shahbazi Mirzahasanloo et al discloses Preamble: A device (Fig. 1 shows the device) configured to decode audio data (Fig. 13 shows the receiver with decoder. Fig. 2 shows the transmitter with encoder.), the device comprising: A memory configured to store the audio data (Fig. 13, label 25 as the encoded audio bitstream representing audio data, label 21’. Paragraph 46 discloses “the source device 12 may output the bitstream 31 to an intermediate device positioned between the source device 12 and the sink device 14. The intermediate device may store the bitstream 31 for later delivery to the sink device 14…”. Paragraph 47 discloses the source device 12 may store the bitstream 31 to a storage medium. Fig. 15,16 shows memory and processor.); and processing circuitry in communication with the memory (Fig. 15,16 shows the processing circuitry in communication with memory.), the processing circuitry configured to: perform multi-stage vector quantization (Fig. 2, label 128,104,108,06 as the stages of vector quantization.) with respect to one or more subbands of the audio data (Fig. 2, label subbands 114) to obtain quantized audio data (Fig. 2, label 106,108); generate, based on the quantized audio data, an encoded audio bitstream representative of the audio data (Fig. 13, label 128’ includes 106,108.); and output, to an audio decoding device, the encoded audio bitstream (Fig. 2, label 25). Claim 18, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to recursively perform each stage of the multi-stage vector quantization with respect to the one or more subbands of the audio data to obtain the encoded audio bitstream (paragraph 50 discloses audio decoder 44 may operate in a manner that is reciprocal to the audio encoder 24. Fig. 7 shows the unification unit found in the compact map generation unit of 12 and 14 (paragraph 78). Paragraph 82 discloses a recursive function is used to generate unified vectors from subbands. Since the decoder works in reciprocal of the encoder, this indicates the recursive function is also used in the decoder.). Claim 19, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to, when performing the multi-stage vector quantization, normalize residual data to standardize the energy (Paragraph 63 discloses the vector quantizer quantizes the residual vector 118 (residual data). Label 108 quantizes the residual vector using pyramid vector quantization. Paragraph 64 discloses vector 108 may be configured to map the residual vector 118 to a hyperpyramid or hypersphere (with constant L2 norm).) prior to performing each successive stage of the multi-stage vector quantization (Fig. 3 shows the internals of the vector quantization. Label 140 performs mapping unit to map the residual vector onto N-dimensional hyperphyramid or hypersphere as per paragraph 64. This is done prior to enumeration unit, a successive stage of the multi-stage vector quantization of Fig. 2, label 128 and bitstream encoder, label 110.). Claim 20, Shahbazi Mirzahasanloo et al discloses wherein the processing circuitry is configured to normalize the residual data according to an L2 norm (paragraph 64 discloses L2 norm or hypersphere.). 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. Claim(s) 12 is/are rejected under 35 U.S.C. 103 as being unpatentable over Shahbazi Mirzahasanloo et al (US Publication No.: 20190333527) in view of Shahbazi Mirzahasanloo et al (‘348) (US Publication No.: 20190371348). Claim 12, Shahbazi Mirzahasanloo et al discloses subband processing unit comprising vector quantization (Fig. 2, label 128), but fails to disclose bitrate range as recited. Shahbazi Mirzahasanloo et al (‘348) discloses wherein the low bitrate is equal to or less than 82 Kilobits per second - Kbps, and wherein the relatively higher bitrate is equal to or greater than one Megabits per second – Mbps (Paragraph 74 discloses determining K, determines the total number of bits required. That minimizes E^i. The bits allocated to code each residual vector are less than the maximum number of bits each register in the implementation platform can contain. This indicates depending on the determination of K, the bitrate of the quantized residual vector can be between 82 Kbits/s and 1 Mbit/s.). Both references discloses audio encoding and decoding, hence it would be obvious to one skilled in the art before the effective filing date of the application to modify Shahbazi Mirzahasanloo et al’s audio encoder/decoder by incorporating bitrates for quantization as disclosed by Shahbazi Mirzahasanloo et al (‘348) so to improve the encoder decoder’s ability to generate encoded audio at a rate without distorting the input audio, hence improving the decoder’s ability to decode encoded audio without loosing excess amount of data. Claim(s) 7-8 is/are rejected under 35 U.S.C. 103 as being unpatentable over Shahbazi Mirzahasanloo et al (US Publication No.: 20190333527) in view of Lauber (DE 000010065363). Claim 7, Shahbazi Mirzahasanloo et al discloses multi-stage vector quantization (Fig. 13, label 128’), but fails to discloses the recited limitations. Lauber discloses wherein the coarse quantization value is selected based on a type of the audio data (Page 2 discloses “The encoder described, in which a variable data rate on the one hand and an arbitrarily high data rate on the other hand is permitted, will therefore quantize tonal areas of the audio signal very finely, which leads to a high data rate and thus to a low data reduction. On the other hand, this encoder will quantize noisy audio signal components very coarsely, which introduces a lot of quantization noise, which in turn leads to a low data rate and thus to a high data rate reduction.” Such disclosure indicates coarse quantization is selected based on the type of audio data (noisy or tonal).), and wherein the type of the audio data includes one of speech type, a tonal music type, and a non-tonal music type (Page 2 discloses tonal as a type of audio, wherein tonal music is a type of tonal audio signal. Noisy is a type of non-tonal music type.), and wherein the type of the audio data corresponds to a different vector table used for performing the vector quantization (Page 2 discloses variable data rate for quantization, wherein the type of audio signal corresponds to different data rate for quantization (fine or coarse). This indicates a different vector table used for performing vector quantization.). It would be obvious to one skilled in the art before the effective filing date of the application to modify Shahbazi Mirzahasanloo et al’s decoder by incorporating variable quantization rate as disclosed by Lauber so to improve the decoders ability to accurate decode the audio signal. Claim 8, Lauber discloses wherein the encoded audio bitstream includes a syntax element identifying the type of the audio data, wherein the processing circuitry is configured to perform the inverse multi-stage vector quantization based on the syntax element to select the corresponding different vector table. (page 3 discloses information about the data signal includes information about the data signal decoded or general information about the data signal known externally to the decoder such as information indicating the general nature of the data signal such as whether a particular instrument is dominant, and information about the coded data signal currently present at the decoder, wherein such information includes type of audio data (information about the coded data signal). Such information is used to generate a substitute value for quantization value (page 3 discloses the substitute value is generated using the information about the data signal available from the decoder.). The decoder uses either the substitute value or quantization value from the encoded data signal for decoding. Such indicates syntax element (information about the data signal) enables selection of quantization value or substitute value to select different vector table or quantization for decoding the encoded signal.). Double Patenting 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 conflicting claims 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); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). 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 nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined 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 § 2146 et seq. 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 filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual 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 www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 1-17 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-4,6-16,19,20 of copending Application No. 19573044 (reference application). Although the claims at issue are not identical, they are not patentably distinct from each other because the recited claimed language of this application is broader than the copending application, hence anticipates the invention of the copending application. This is a provisional nonstatutory double patenting rejection because the patentably indistinct claims have not in fact been patented. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to LINDA WONG whose telephone number is (571)272-6044. The examiner can normally be reached 9-5. 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, Andrew C Flanders can be reached at 571-272-7516. 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. /LINDA WONG/Primary Examiner, Art Unit 2655
Read full office action

Prosecution Timeline

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

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12801653
SYSTEMS AND METHODS FOR AGGLOMERATIVE CLUSTERING
3y 4m to grant Granted Nov 17, 2026
Patent 12793699
SYNTHESIZING MULTI-ACCENT SPEECH USING ADAPTIVE WEIGHTS
3y 5m to grant Granted Nov 10, 2026
Patent 12783573
PROCESSING DEVICE, PROCESSING METHOD, AND NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM
2y 8m to grant Granted Nov 03, 2026
Patent 12763083
BANDWIDTH EXTENSION OF INCOMING DATA USING NEURAL NETWORKS
2y 2m to grant Granted Oct 13, 2026
Patent 12763077
VOICE RECOGNITION METHOD AND VOICE RECOGNITION DEVICE
2y 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
85%
Grant Probability
99%
With Interview (+15.5%)
2y 11m (~1y 5m remaining)
Median Time to Grant
Low
PTA Risk
Based on 722 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