Prosecution Insights
Last updated: October 01, 2026
Application No. 18/564,797

GENERATING LEARNED REPRESENTATIONS OF DIGITAL CIRCUIT DESIGNS

Non-Final OA §101
Filed
Nov 28, 2023
Priority
May 28, 2021 — provisional 63/194,934 +1 more
Examiner
GARBOWSKI, LEIGH M
Art Unit
Tech Center
Assignee
Google LLC
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
98%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
665 granted / 756 resolved
+28.0% vs TC avg
Moderate +10% lift
Without
With
+10.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
12 currently pending
Career history
765
Total Applications
across all art units

Statute-Specific Performance

§101
18.9%
-21.1% vs TC avg
§103
17.7%
-22.3% vs TC avg
§102
31.6%
-8.4% vs TC avg
§112
22.6%
-17.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 756 resolved cases

Office Action

§101
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 . Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefore, subject to the conditions and requirements of this title. Claims 1-17 and 19-21 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. The claims recite mathematical concepts; taking claim 1 as exemplary of claims 1, 14-15, 17 and 21, and based on the plain meaning of the words in the claims, the broadest reasonable interpretation is obtaining and processing data representing a program and represented as a graph and generating a representation of the data by using a graph neural network; thus, the mathematical concepts are written in prose form. This judicial exception is not integrated into a practical application because the claimed features are recited at a high level of generality such that there are no meaningful details of a digital circuit design recited beyond the mathematical concepts of a program and a graph representing the digital circuit design for processing the data using a graph neural network (see, for example, [0022] for specific types of circuits). Claims 2-12 and 19-20 recite further mathematical concepts in prose form for a prediction neural network to obtain, process and generate data; there are no meaningful details of hardware verification or test recited beyond data and mathematical concepts as similarly described above. Also, the generically recited system (see claims 17, 19-20) and one or more non-transitory computer-readable storage media (see claim 21) do not add meaningful imitations to the abstract idea because they amount to simply implementing the abstract idea on or with a computer. The claims not include additional elements that are sufficient to amount to significantly more than the judicial exception because there are no meaningful details recited regarding a digital circuit (see, for example, [0022]), and adding insignificant extra solution activity, such as manufacturing as recited in claims 13 and 16, is not indicative of integration into a practical application as recited; the generically recited features are well-understood, routine and conventional. Thus, given a broadest reasonable interpretation of the high level of generality claimed, the claims are rejected as being directed to an abstract idea without significantly more. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. D. Bieber et al. [“Learning to Execute Programs with Instruction Pointer Attention Graph Neural Networks”] appear to disclose the closest prior art for constructing embedding of source code that capture information about program semantics, graph neural networks and control flow graphs (see entire document). Also, P. Philipp et al. disclose “Analysis of Control Flow Graphs Using Graphs Using Graph Convolutional Neural Networks” (see entire document). T. Roddenberry et al. [“HodgeNet: Graph Neural Networks for Edge Data”] disclose analysis of flow data on graphs (see entire document). F. Scarselli et al. disclose “The Graph Neural Network Model” (see entire document). Y. Ma et al. [“High Performance Graph Convolutional Networks with Applications in Testability Analysis”] disclose test point insertion (see entire document). Any inquiry concerning this communication or earlier communications from the examiner should be directed to LEIGH M GARBOWSKI whose telephone number is (571)272-1893. The examiner can normally be reached M-F 9-5 EST. 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, Jack Chiang can be reached at 571-272-7483. 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. /LEIGH M GARBOWSKI/ Primary Examiner, Art Unit 2851
Read full office action

Prosecution Timeline

Nov 28, 2023
Application Filed
Aug 25, 2026
Non-Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12743572
System and Method for Automatic Generation of Standard Cells Using Satisfiability Modulo Theory Solver
3y 3m to grant Granted Sep 22, 2026
Patent 12717991
DELAY CALCULATION WITH PATTERN MATCHING FOR STATIC TIMING ANALYSIS
3y 9m to grant Granted Aug 25, 2026
Patent 12717993
ARITHMETIC METHOD AND ARITHMETIC DEVICE
3y 5m to grant Granted Aug 25, 2026
Patent 12711299
SYSTEMS AND METHODS FOR DETERMINING SPECIFICATION LIMITS IN A SEMICONDUCTOR DEVICE VIRTUAL FABRICATION ENVIRONMENT
3y 7m to grant Granted Aug 18, 2026
Patent 12699824
DETERMINING SUBSTRATE CHARACTERISTICS BY VIRTUAL SUBSTRATE MEASUREMENT
3y 9m to grant Granted Aug 04, 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
98%
With Interview (+10.4%)
2y 2m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 756 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