Prosecution Insights
Last updated: April 19, 2026
Application No. 18/955,530

Systems and Methods for Anonymizing Large Scale Datasets

Non-Final OA §102
Filed
Nov 21, 2024
Examiner
BROMELL, ALEXANDRIA Y
Art Unit
2156
Tech Center
2100 — Computer Architecture & Software
Assignee
Google LLC
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
3y 3m
To Grant
87%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
410 granted / 543 resolved
+20.5% vs TC avg
Moderate +12% lift
Without
With
+11.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
11 currently pending
Career history
554
Total Applications
across all art units

Statute-Specific Performance

§101
19.2%
-20.8% vs TC avg
§103
36.4%
-3.6% vs TC avg
§102
34.2%
-5.8% vs TC avg
§112
3.5%
-36.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 543 resolved cases

Office Action

§102
DETAILED ACTION Claims 1 – 20, which are currently pending, are fully considered below. 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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on March 20, 2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. 35 USC § 101 Claims 1 – 20 have been evaluated under 35 USC 101. Examiner determines that the limitation of independent claims 1 and 14 of “modifying at least one relationship between an entity in the at least one entity group and the at least one data item to produce an anonymized dataset such that entity is indistinguishable from at least one other entries in the anonymized dataset” recites significantly more than an abstract idea. Priority This application is a CON of 18/345,657 06/30/2023 PAT 12164673; 18/345,657 is a CON of 17/016,788 09/10/2020 PAT 11727147. 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. Claims 1 – 3, 5 – 6, 8 – 10, 14, 16 – 17, and 19 are rejected under 35 U.S.C. 102(a)(1) as being unpatentable over Vincent Huang et al. (U.S. Patent Publication 20130198188). With respect to claims 1 and 14, Huang teaches: a plurality of entities and at least one data item, wherein the dataset is indicative of relationships between the plurality of entities and the at least one data item (see paragraph [0009], where there are entities which are partitioned into groups based on at least a common relationship with one data item (attribute)); grouping, by the computing system, the plurality of entities into at least one entity group (see paragraph [0009], where there are entities which are partitioned into groups based on at least one data item (attribute)); determining, by the computing system, that a majority of the plurality of entities in the at least one entity group are associated with the at least one data item (see paragraph [0009], where there are entities which are partitioned into groups based on at least one data item (attribute), where the majority of entities may be grouped according to similarities to a reference entity’s attributes); and in response to determining, by the computing system, that the majority of the plurality of entities in the at least one entity group are associated with the at least one data item, modifying at least one relationship between an entity in the at least one entity group and the at least one data item to produce an anonymized dataset such that entity is indistinguishable from at least one other entities in the anonymized dataset (see paragraphs [0032] and [0033], where anonymized datasets are produced, where the dataset is indistinguishable). PNG media_image1.png 514 234 media_image1.png Greyscale With respect to claims 2, Huang teaches: after said modifying, distributing, by the computing system, the anonymized to an external computing system (see paragraph [0041] and Fig. 1, where the dataset may be distributed over an external system over a network). PNG media_image2.png 538 382 media_image2.png Greyscale With respect to claims 3, Huang teaches: wherein the dataset comprises at least one of federated learning training data, personally identifiable information, bipartite graph data, or parameters of a machine-learned model (see paragraph [0032], where user data includes personally identifyiable information). With respect to claims 5, and 16 Huang teaches: determining, by the computing system, that a majority of the plurality of entities in the at least one entity group are not associated with the at least one data item (see paragraphs [0094] and [0095], where entities or users may be removed whose preferences or data items are least like the others in the group); and removing, by the computing system, at least one relationship between the entities in the at least one entity group and the at least one data item (see paragraphs [0094] and [0095], where entities or users may be removed whose preferences or data items are least like the others in the group). With respect to claims 6 and 17, Huang teaches: wherein determining that the majority of the plurality of entities in the at least one entity group are not associated with the at least one data item comprises: determining that a majority of the entities in the at least one entity group do not have a relationship with the at least one data item (see paragraphs [0094] and [0095], where entities or users may be removed whose preferences or data items are least like the others in the group). With respect to claims 8, Huang teaches: wherein grouping the plurality of entities comprises: mapping the plurality of entities and the at least one data item to a plurality of points in a dimensional space (see Fig. 8, where entities are mapped in dimensional space); establishing one or more centers in the dimensional space; and distributing the plurality of entities among the one or more centers based at least in part on a plurality of distances between the plurality of points and the one or more centers (see Fig. 8, where entities are distributed among centers or clustered based on a plurality of distances between points). PNG media_image3.png 642 628 media_image3.png Greyscale With respect to claims 9, Huang teaches: wherein distributing the plurality of entities among the one or more centers comprises: selecting the one or more centers from the plurality of points; and assigning each point of the plurality of points to a center of the one or more centers such that a total distance of the points from their assigned centers is minimized (see paragraph [0065], Fig. 5, and Fig. 8, where the distance is calculated from the center to the entity to reduce sparseness). With respect to claims 10, Huang teaches: wherein at least k points are assigned to each center of the one or more centers, wherein k is a number of entities from which data for each entity of the plurality of entities is indistinguishable (see paragraphs [0032] and [0033], where k anonymized data points and datasets are produced, where the dataset is indistinguishable). With respect to claim 19, Huang teaches: mapping the plurality of entities and the at least one data item to a plurality of points in a dimensional space (see Fig. 8, where entities are mapped in dimensional space); establishing one or more centers in the dimensional space (see paragraph [0065], Fig. 5, and Fig. 8, where the distance is calculated from the center to the entity to reduce sparseness); and distributing the plurality of entities among the one or more centers based at least in part on a plurality of distances between the plurality of points and the one or more centers (see Fig. 8, where entities are distributed among centers or clustered based on a plurality of distances between points). Allowable Subject Matter Claims 4, 7, 11 – 13, 15, 18, and 20 are objected to as being dependent upon a rejected base claim, but may be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion/Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to ALEXANDRIA Y BROMELL whose telephone number is (571)270-3034. The examiner can normally be reached M-F 8-4. 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, Robert Beausoliel can be reached at 571-272-3645. 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. /ALEXANDRIA Y BROMELL/Primary Examiner, Art Unit 2156 March 6, 2026
Read full office action

Prosecution Timeline

Nov 21, 2024
Application Filed
Dec 29, 2025
Examiner Interview (Telephonic)
Jan 05, 2026
Examiner Interview Summary
Mar 06, 2026
Non-Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602353
HASH BASED FILTER
2y 5m to grant Granted Apr 14, 2026
Patent 12572609
DATABASE INDEXING, RANKING, AND OPTIMIZATION SYSTEMS FOR ONLINE QUERIES
2y 5m to grant Granted Mar 10, 2026
Patent 12566567
TECHNIQUES FOR DISCOVERING DATA STORE LOCATIONS VIA INITIAL SCANNING
2y 5m to grant Granted Mar 03, 2026
Patent 12566744
PERFORMING MULTITASK MODEL TUNING AT EDGE LOCATIONS
2y 5m to grant Granted Mar 03, 2026
Patent 12566780
Hybrid Classical-Quantum Unsupervised Multiclass Classification
2y 5m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
76%
Grant Probability
87%
With Interview (+11.7%)
3y 3m
Median Time to Grant
Low
PTA Risk
Based on 543 resolved cases by this examiner. Grant probability derived from career allow 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