Prosecution Insights
Last updated: April 19, 2026
Application No. 19/246,848

METHOD FOR ACQUIRING LABEL INFORMATION, AND TERMINAL DEVICE

Non-Final OA §101§102
Filed
Jun 24, 2025
Examiner
DAYE, CHELCIE L
Art Unit
2161
Tech Center
2100 — Computer Architecture & Software
Assignee
Guangdong OPPO Mobile Telecommunications Corp., Ltd.
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
3y 9m
To Grant
92%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
445 granted / 584 resolved
+21.2% vs TC avg
Strong +16% interview lift
Without
With
+16.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 9m
Avg Prosecution
7 currently pending
Career history
591
Total Applications
across all art units

Statute-Specific Performance

§101
15.5%
-24.5% vs TC avg
§103
54.6%
+14.6% vs TC avg
§102
7.9%
-32.1% vs TC avg
§112
12.1%
-27.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 584 resolved cases

Office Action

§101 §102
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 . DETAILED ACTION This action is issued in response to Application filed June 24, 2025. Claims 1-20 are pending. Information Disclosure Statement The information disclosure statement (IDS) submitted on June 24, 2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. 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 therefor, subject to the conditions and requirements of this title. Claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an Abstract Idea without significantly more. Claims 1-11 are method claims and directed to the process category of patentable subject matter. Claims 12-19 are method claims and directed to the process category of patentable subject matter. Claim 20 is a device claim and directed to the machine category of patentable subject matter. Although claims 1-20 fall under at least one of the four statutory categories, it should be determined whether the claims recite a judicial exception. The following claim limitations are drawn to abstract idea recitations (struck-through limitations have been identified as additional elements and will be discussed in later sections): A method for acquiring label information, comprising: [a] determining, [b] determining, 12. A method for acquiring label information of a data set, comprising: [b] determining, [b] 20. A terminal device comprising a memory, a processor and a transceiver, [b] determining a data set and label information corresponding to each data in the data set, wherein the label information is determined based on a correction parameter, and [b] The claims fall within the “Mental Processes” grouping of abstract ideas; since the claims are simple process that, under their broadest reasonable interpretation, covers performance of the limitations in the mind. With regard to limitation [a], a human may perform mental processing of determinations for “determining” a correction parameter. A human may mentally observe a parameter for correction. This claim limitation has been identified as a recitation of a mental process. With regard to limitation [b], a human may perform mental processing of determinations for “determining” label information and dataset data. A human may mentally observe and associate label information with data from a dataset. This claim limitation has been identified as a recitation of a mental process. The examiner notes that under MPEP 2106.04(a)(2)(III), the courts consider a mental process (thinking) that “can be performed in the human mind, or by a human using a pen and paper” to be an abstract idea. The limitations of “determining”; fall within the “Mental Processes” grouping of abstract ideas because this recites a mentally performable process of observing and determining information, such as label information and dataset data for a correction parameter. CyberSource Corp. v. Retail Decisions, Inc., 654 F.3d 1366, 1372, 99 USPQ2d 1690, 1695 (Fed. Cir. 2011). As the Federal Circuit explained, “methods which can be performed mentally, or which are the equivalent of human mental work, are unpatentable abstract ideas the ‘basic tools of scientific and technological work’ that are open to all”. Specifically, the limitations as discussed above, as claimed, is a process that covers performance of the limitations in the mind, or with pen and paper, but for the recitation of generic computer components (i.e., processor, memory, device, etc.) because a user can mentally, or with pen and paper, perform the steps as discussed above. See Digitech (organizing and manipulating information through mathematical correlations), Electric Power Group (collecting information, analyzing it, and displaying certain results of the collection and analysis). This judicial exception is not integrated into a practical application. The claim(s) includes additional elements which fall within the mental processing of information. In particular, the limitations of a network device; a transceiver for communication with a network device; memory stores a computer program executable on the process; a processor; have been identified as recitations of generic computing functions. In particular, the claims only recite additional elements (i.e., processor, memory, device, etc.) that are recited at a high-level of generality (e.g., as a generic computer or as a generic processor performing a generic computer function), such that it amounts to no more than mere instructions to apply the exception using generic computer components. See 2106.05(d) (II). The claim limitations further discuss training a model; however, the model for training in the claim limitation is a basic element for learning the data associations. Accordingly, the additional element(s) do not integrate the abstract idea into a practical application because it does not impose meaningful limits on practicing the abstract idea. The claims as a whole do not appear to integrate the mental process into a practical application and is thus directed to an abstract idea. The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements amount to no more than mere instructions to apply the exception using a generic computer component, or are merely drawn to insignificant extra-solution activity. Mere instructions to apply an exception using a generic computer component or insignificant extra-solution is not significantly more than the judicial exception. The dependent claims, 2-11 and 13-19, depend on a rejected parent claim and do not cure its deficiencies. Similar to the above discussion, each of the dependent claims are drawn to an abstract idea within the “Mental Processes” grouping of abstract ideas. The claims are drawn to subject matter that covers performance of the claimed limitations in the mind, or with pen and paper, but for the recitation of generic computer components as discussed above. The claims are not integrated into a practical application. The claims only recite additional elements that is/are recited at a high-level of generality (e.g., as a generic computer or as a generic processor performing a generic computer function) such that it amounts to no more than mere instructions to apply the exception using a generic computer component or are merely drawn to insignificant extra-solution activity. The claim elements considered individually or in combination do not result in a new or improved method for acquiring label information. 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-3, 12, 13, and 20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Asgarieh (U.S. Patent Application No. 2022/0067443). Regarding Claim 1, Asgarieh discloses a method for acquiring label information, comprising: determining, by a first network device1, a correction parameter (par [0032-0034], [0042-0043], Asgarieh – labeling via data source(s) can be corrected via learning; wherein learning correct label prediction for data from source 3, which is used for collaborating with the label decoders to allow learning model parameters for decoding data from source 1 and source 3 and target as well as models parameters); and determining, by the first network device, label information corresponding to each data in a data set based on the correction parameter (par [0029-0030], Asgarieh - data from target source may correspond to a small data set yet with the most consistent/correct set of training data. With data from such sources, traditional multi-label classification solutions may lead to incorrect/incomplete predictions for samples as the small training data set from the target source is generally not sufficient for training deep and more accurate models. To overcome such shortcomings, the multi-task dual loop learning framework incorporate mechanism to allow learning, while training the traditional encoder and decoders, of mapping data to correct labels by leveraging the although small yet with consistent/correct set of training data from target to bootstrap the capability of correcting inconsistent and noisy labels… par [0045]), wherein the data set and the label information corresponding to each data in the data set are used to train a first model (par [0028-0030], Asgarieh – presented is a framework for meta-learning or learning-to-learn and is general and model agnostic, which is a multi-task dual loop learning scheme. Not only encoder/decoder models can be trained and optimized, the label decoders or models that learn-to-learn for producing correct labels can be trained smoothly using target task data… allow learning, while training the traditional encoder and decoders, of mapping data to correct labels by leveraging the although small yet with consistent/correct set of training data from target source to bootstrap the capability of correcting inconsistent and noisy labels from other unreliable data sources… also see par [0005-0006] and [0039], Asgarieh). Regarding Claim 2, Asgarieh discloses the method of claim 1, wherein, the correction parameter is determined based on an error value between actual information and estimated information of a first terminal device (par [0033], Asgarieh - target loss is directed to data from target source and is determined based on a label from target and a label predicted by decoder based on data from the target. In the first loop, the label decoders are assumed correct so that their predicted labels based on data from the respective sources are used as actual ground truth in learning the parameters of the encoder and decoders… par [0035], [0039], Asgarieh - the label decoder learns its model parameters based on discrepancy between a predicted label from the decoder using the updated encoder/decoder parameters and an actual ground truth label from the target data set. As discussed herein, the model parameters for the label decoders are learned by minimizing the target loss… par [0042], [0044], Asgarieh - the label decoder is assumed to be correct and is used to predict a ground truth (not actual) label that is used for updating the encoder and decoder parameters based on the source loss. In the outer loop, the label decoder learns and updates its label predictor parameters stored in by minimizing the target loss determined based on an actual ground truth label retrieved from target source). Regarding Claim 3, Asgarieh discloses the method of claim 2, wherein a number of the first terminal device is more than one, the correction parameter is determined based on an average value of error values between actual information and estimated information of the plurality of the first terminal devices (par [0033], Asgarieh - target loss is directed to data from target source and is determined based on a label from target and a label predicted by decoder based on data from the target. In the first loop, the label decoders are assumed correct so that their predicted labels based on data from the respective sources are used as actual ground truth in learning the parameters of the encoder and decoders… par [0035], [0039], Asgarieh - the label decoder learns its model parameters based on discrepancy between a predicted label from the decoder using the updated encoder/decoder parameters and an actual ground truth label from the target data set. As discussed herein, the model parameters for the label decoders are learned by minimizing the target loss… par [0042], [0044], Asgarieh - the label decoder is assumed to be correct and is used to predict a ground truth (not actual) label that is used for updating the encoder and decoder parameters based on the source loss. In the outer loop, the label decoder learns and updates its label predictor parameters stored in by minimizing the target loss determined based on an actual ground truth label retrieved from target source)2. Claims 12 and 13 contain similar subject matter as claim 1 above; and are rejected under the same rationale. Claim 20 contains similar subject matter as claim 1 above; and is rejected under the same rationale with the addition of par [0046] of Asgarieh for the disclosure of the claimed processor, memory, and transceiver for communication. Points of Contact Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHELCIE L DAYE whose telephone number is (571) 272-3891. The examiner can normally be reached on Monday-Friday 7:30-4:00pm. 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, Apu Mofiz can be reached on 571-272-4080. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). Chelcie Daye Patent Examiner Technology Center 2100 April 2, 2026 /CHELCIE L DAYE/Primary Examiner, Art Unit 2161 1 Examiner Notes: See Asgarieh at par [0046] and [0048]. 2 Examiner Notes: For details about multiple devices see par [0046], [0048].
Read full office action

Prosecution Timeline

Jun 24, 2025
Application Filed
Apr 02, 2026
Non-Final Rejection — §101, §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602443
SEMANTIC-AWARE NEXT BEST ACTION RECOMMENDATION
2y 5m to grant Granted Apr 14, 2026
Patent 12602436
SYSTEM FOR REAL-TIME FACT-CHECKING OF MULTIMEDIA CONTENT
2y 5m to grant Granted Apr 14, 2026
Patent 12592981
MEDIA CAPTURE DEVICE COMMAND TRIGGERING SYSTEMS AND METHODS
2y 5m to grant Granted Mar 31, 2026
Patent 12566789
DOCUMENT PROCESSING SERVICE USING CUSTOMIZABLE SCHEMAS
2y 5m to grant Granted Mar 03, 2026
Patent 12554769
SYSTEMS AND METHODS FOR SUPPORTING SKETCH-BASED QUERYING FOR DATA TREND ANALYSIS
2y 5m to grant Granted Feb 17, 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
92%
With Interview (+16.0%)
3y 9m
Median Time to Grant
Low
PTA Risk
Based on 584 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