Office Action Predictor
Last updated: April 16, 2026
Application No. 19/043,566

INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD, AND NON-TRANSITORY COMPUTER-READABLE MEDIUM

Non-Final OA §102
Filed
Feb 03, 2025
Examiner
BROMELL, ALEXANDRIA Y
Art Unit
2156
Tech Center
2100 — Computer Architecture & Software
Assignee
Toyota Jidosha Kabushiki Kaisha
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
3y 3m
To Grant
82%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
410 granted / 543 resolved
+20.5% vs TC avg
Moderate +7% lift
Without
With
+6.8%
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 – 12, which are currently pending, are fully considered below. Priority Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. Information Disclosure Statement The information disclosure statement (IDS) submitted on February 3, 2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. 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 . 35 USC § 101 Note: The instant claims recite significantly more than an abstract idea. Instant paragraph [0016] discloses that the information processing system calculates each vector of a high-dimensional vector using significantly more than a mental process (for example, word2vec has 200 dimensions and BERT has 768 dimensions) using a Gini coefficient that indicates the density of the vector. 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. Claims 1 – 12 are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Pranitha Bhimanagouda Patil (U.S. Patent Publication 20240194342). With respect to claims 1, 11, and 12, Patil teaches: data acquisition means for acquiring vector data of a plurality of dimensions (see paragraph [0086], and Fig. 3A, where clustering models 304 are generated in a vector space having dimensions that correspond to features 305); PNG media_image1.png 638 594 media_image1.png Greyscale clustering means for grouping, based on relative distances between pieces of the vector data acquired by the data acquisition means, the pieces of the data in which the relative distances therebetween are close to each other, and performing hierarchical clustering for repeating the grouping (see paragraph [0104], where clustering model 304 uses distance based clustering and where the clustering model may be a hierarchical based clustering model as in Fig. 6D); and PNG media_image2.png 252 232 media_image2.png Greyscale density calculation means for calculating density of each of clusters of the pieces of the vector data, wherein the clustering means divides or integrates the clusters based on the density of each of the clusters calculated by the density calculation means when the clustering means performs the hierarchical clustering (see paragraph [0104], for density based clustering, and hierarchy based clustering, also see Fig. 6A, 6B, 6C, and 6D for density based clustering and other clustering). PNG media_image3.png 556 436 media_image3.png Greyscale With respect to claim 2, Patil teaches: the clustering means extracts at least two vectors by comparing densities of vector components of the vector data of a plurality of dimensions with each other, extracts from each of the extracted vectors dense parts in which vector values are dense, extracts from each of the extracted vectors a region of interest onto which clustering is concentrated based on the extracted dense parts, and performs the hierarchical clustering on the extracted region of interest and a peripheral region surrounding the region of interest (see paragraph [0104], for density and hierarchical clustering, where the vector data components (or features), are clustered by density). With respect to claim 3, Patil teaches: when the clustering means determines that the density of each of the clusters calculated by the density calculation means is equal to or greater than a threshold, the clustering means divides the cluster, and when the clustering means determines that the density of each of the clusters is not equal to or greater than a threshold, the clustering means determines whether or not the current number of the clusters is equal to or greater than a target value, and then when the clustering means determines that the current number of the clusters is equal to or greater than the target value, the clustering means stops the hierarchical clustering (see paragraph [0104], where data sets are divided into clusters, see paragraph [0101], for clustering using a threshold). With respect to claim 4, Patil teaches: when the clustering means determines that the density of each of the clusters has reached a predetermined value during the hierarchical clustering, the clustering means temporarily stops the hierarchical clustering and outputs the current number of the clusters and vectors included in each of the clusters (see paragraph [0104], for clustering termination logic). With respect to claim 5, Patil teaches: the density is a Gini coefficient (see paragraph [0104] for the Gini coefficient). With respect to claim 6, Patil teaches: the data acquisition means, clustering means, and the density calculation means are a processor (see paragraph [0005], where processors and memory are used to implement clustering methods). PNG media_image4.png 496 428 media_image4.png Greyscale With respect to claim 7, Patil teaches: the data acquisition means, clustering means, and the density calculation means are a processor (see paragraph [0005], where processors and memory are used to implement clustering methods). With respect to claim 8, Patil teaches: the data acquisition means, clustering means, and the density calculation means are a processor (see paragraph [0005], where processors and memory are used to implement clustering methods). With respect to claim 9, Patil teaches: the data acquisition means, clustering means, and the density calculation means are a processor (see paragraph [0005], where processors and memory are used to implement clustering methods). With respect to claim 10, Patil teaches: the data acquisition means, clustering means, and the density calculation means are a processor (see paragraph [0005], where processors and memory are used to implement clustering methods). 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 2167 January 7, 2026
Read full office action

Prosecution Timeline

Feb 03, 2025
Application Filed
Jan 08, 2026
Non-Final Rejection — §102
Mar 23, 2026
Response Filed

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
82%
With Interview (+6.8%)
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 for Full Analysis

Enter your email to receive a magic link. No password needed.

Free tier: 3 strategy analyses per month