Prosecution Insights
Last updated: August 17, 2026
Application No. 18/588,910

DIGITAL WATERMARKING OF MACHINE LEARNING MODELS

Non-Final OA §DP
Filed
Feb 27, 2024
Priority
Mar 29, 2018 — provisional 62/649,926 +2 more
Examiner
GERMICK, JOHNATHAN R
Art Unit
Tech Center
Assignee
The Regents of the University of California
OA Round
1 (Non-Final)
46%
Grant Probability
Moderate
1-2
OA Rounds
2y 1m
Est. Remaining
76%
With Interview

Examiner Intelligence

Grants 46% of resolved cases
46%
Career Allowance Rate
46 granted / 101 resolved
-14.5% vs TC avg
Strong +30% interview lift
Without
With
+30.1%
Interview Lift
resolved cases with interview
Typical timeline
4y 7m
Avg Prosecution
28 currently pending
Career history
124
Total Applications
across all art units

Statute-Specific Performance

§101
28.5%
-11.5% vs TC avg
§103
39.2%
-0.8% vs TC avg
§102
17.1%
-22.9% vs TC avg
§112
14.3%
-25.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 101 resolved cases

Office Action

§DP
DETAILED ACTION This action is responsive to the Claims filed on 04/02/2024. Claims 44-63 are pending in the case. Claims 44, 54 and 63 are independent claims. 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 . 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 44, 54 and 63 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1, 21 and 41 of U.S. Patent No. 11972408, respectively. Although the claims at issue are not identical, they are not patentably distinct from each other because:with respect to claim 44: The following limitations of claim 44 correspond to the italicized limitations of claim 1 of 11972408, the differences in word choice have been underlined. A system, comprising: at least one processor; and at least one memory including program instructions (A system, comprising: at least one processor; and at least one memory including program code) which when executed by the at least one processor causes operations comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; and embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model (which when executed by the at least one processor provides operations comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model) Examiner notes the underlined words are understood to have the same scope. Finally, claim 44 of the instant application recites, wherein the first digital watermark enables an owner of the first machine learning model to detect unauthorized deployment of the first machine learning model. This limitation is an intended result and therefore is not given patentable weight. Further it is clear from the disclosure of 11972408 (pp. 0038 “The presence of the digital watermark may enable the owner of the machine learning model to determine whether the machine learning model and/or the proprietary training data used to generate the machine learning model are being misused by a third party.”). The presence of a watermark has the result of enabling the owner to detect unauthorized use or deployment, as such the reference claim anticipates the instant claim because the reference claim recites embedding a digital watermark therefore having the same intended result. with respect to claim 54 The following limitations of claim 54 correspond to the italicized limitations of claim 21 of 11972408, the differences in word choice have been underlined. A computer-implemented method, comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; and embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model (A computer-implemented method, comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model) Finally claim 54 of the instant application recites, wherein the first digital watermark enables an owner of the first machine learning model to detect unauthorized deployment of the first machine learning model. This limitation is an intended result and therefore is not given patentable weight. Further it is clear from the disclosure of 11972408 (pp. 0038 “The presence of the digital watermark may enable the owner of the machine learning model to determine whether the machine learning model and/or the proprietary training data used to generate the machine learning model are being misused by a third party.”). The presence of a watermark has the result of enabling the owner to detect unauthorized use or deployment, as such the reference claim anticipates the instant claim because the reference claim recites embedding a digital watermark therefore having the same intended result. with respect to claim 63 The following limitations of claim 63 correspond to the italicized limitations of claim 41 of 11972408, the differences in word choice have been underlined. non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; and embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model, wherein the first digital watermark enables an owner of the first machine learning model to detect unauthorized deployment of the first machine learning model (A non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model, a first plurality of input samples altering one or more low probabilistic regions of the first activation map, the first hidden layer including a plurality of neurons, each of the plurality of neurons applying an activation function to generate an output, and the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons; embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training, based at least on training data including the first plurality of input samples, the first machine learning model) Finally claim 63 of the instant application recites, wherein the first digital watermark enables an owner of the first machine learning model to detect unauthorized deployment of the first machine learning model. This limitation is an intended result and therefore is not given patentable weight. Further it is clear from the disclosure of 11972408 (pp. 0038 “The presence of the digital watermark may enable the owner of the machine learning model to determine whether the machine learning model and/or the proprietary training data used to generate the machine learning model are being misused by a third party.”). The presence of a watermark has the result of enabling the owner to detect unauthorized use or deployment, as such the reference claim anticipates the instant claim because the reference claim recites embedding a digital watermark therefore having the same intended result. Allowable Subject Matter Independent claims 44, 54 and 63 recite allowable subject matter and would be considered allowable but for the intervening rejection(s). Specifically, none of the reference of record either alone or in combination fairly disclose or suggest the limitations of at least claim 44: From at least claim 44: identifying, based at least on a first activation map associated with a first hidden layer of a first machine learning model… , a first plurality of input samples … the one or more low probabilistic regions of the first activation map being occupied by values having below a threshold probability of being output by the plurality of neurons… and embedding, in the first hidden layer of the first machine learning model, a first digital watermark corresponding to the first plurality of input samples, the embedding of the first digital watermark includes training… The closest prior art of record Uchida et al. “Embedding Watermarks into Deep Neural Networks” discloses embedding watermark bits into a neural network via training by projecting a vector X onto weights of a neural network layer. This is done with and/or without training the machine learning model. However, Uchida does not disclose identification of neurons with low probabilistic regions of an activation map according to a threshold probability. Further, Nagai et al “Digital watermarking for deep neural networks” discloses again embedding a binary T-bit vector into the parameters of the layers of the neural network, however this embedding is not according to the identified input samples whose activation values being below a threshold probability. Further, Merrer et al “adversarial frontier stitching for remote neural network watermarking” discloses a watermarking approach built upon model boundary modification and the use of random adversarial samples that lie near decision boundaries rather than embedding the watermark according to the values of a feature map. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JOHNATHAN R GERMICK whose telephone number is (571)272-8363. The examiner can normally be reached M-F 9:30-4:30. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kakali Chaki can be reached on 571-272-3719. 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. /J.R.G./ Examiner, Art Unit 2122 /KAKALI CHAKI/Supervisory Patent Examiner, Art Unit 2122
Read full office action

Prosecution Timeline

Feb 27, 2024
Application Filed
Jul 15, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12699893
SELF-SUPERVISED REPRESENTATION LEARNING USING BOOTSTRAPPED LATENT REPRESENTATIONS
5y 2m to grant Granted Aug 04, 2026
Patent 12694266
CORRELATION RECURRENT UNIT FOR IMPROVING PREDICTION PERFORMANCE OF TIME-SERIES DATA AND CORRELATION RECURRENT NEURAL NETWORK
3y 7m to grant Granted Jul 28, 2026
Patent 12670369
CENTRAL SCHEDULER AND INSTRUCTION DISPATCHER FOR A NEURAL INFERENCE PROCESSOR
8y 2m to grant Granted Jun 30, 2026
Patent 12664441
METHOD AND SYSTEM FOR IDENTIFYING RELEVANT VARIABLES
5y 5m to grant Granted Jun 23, 2026
Patent 12645917
NEURAL ARCHITECTURE FOR SELF SUPERVISED EVENT LEARNING AND ANOMALY DETECTION
6y 11m to grant Granted Jun 02, 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
46%
Grant Probability
76%
With Interview (+30.1%)
4y 7m (~2y 1m remaining)
Median Time to Grant
Low
PTA Risk
Based on 101 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