Prosecution Insights
Last updated: November 18, 2026
Application No. 18/679,883

SYSTEMS AND METHODS FOR DETERMINING A DEAL STRUCTURE

Final Rejection §101
Filed
May 31, 2024
Examiner
KANG, TIMOTHY J
Art Unit
3689
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Cox Automotive Inc.
OA Round
2 (Final)
46%
Grant Probability
Moderate
3-4
OA Rounds
72%
With Interview

Examiner Intelligence

Grants 46% of resolved cases
46%
Career Allowance Rate
133 granted / 292 resolved
-6.5% vs TC avg
Strong +26% interview lift
Without
With
+26.3%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
41 currently pending
Career history
344
Total Applications
across all art units

Office Action

§101
DETAILED ACTION 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 . 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 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis 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. Status of Claims Claims 1-20 have been subject to restriction. Claims 1-4 and 6-9 remain pending, and are rejected. Claim 5 has been cancelled. Claims 10-20 are non-elected, and are withdrawn. Response to Arguments Applicant’s arguments filed on 6/18/2026 with respect to the rejection under 35 U.S.C. 101 have been fully considered, but are not persuasive for at least the following rationale: Applicant’s arguments filed on 6/18/2026 with respect to the rejection under 35 U.S.C. 101 for claims directed to a judicial exception are not persuasive. Notably, on pages 8-9 of the Applicant’s Remarks, arguments are made that the claims do not recite a generic commercial practice of structuring a vehicle deal, but recites a specific, ordered method employing four distinct machine learning models, each defined by a specific function, specific inputs, and a specific predictive output, which are also further defined by their training methodology and training dataset structure, including the fourth step producing a concrete result, such as by maximizing the product of three independently predicted values. Examiner respectfully disagrees. The four distinct machine learning models does not represent any particular combination of various models or any technology. The four distinct models merely represent different calculations being performed for the abstract idea. The training/dataset used by the models merely defines what information of the abstract idea are being utilized in the calculations. For example, the first machine learning model is trained using historical loan application approval data to predict a buy lending rate. The claims do not recite any particular technical manner in how these models are trained, or any particular changes to any underlying technology of machine learning, but merely defines the category of information used to train the model, and what information of the abstract idea the model outputs. Similarly, all the machine learning models are not recited in any particular manner except to provide an output for the abstract idea using other information of the abstract idea without any further detail. On pages 9-10 of the Applicant’s Remarks, it is argued that the claims integrate any abstract idea into a practical application. The Applicant argues that the claims not recite the training data for each model, and further recites that the first machine learning model is further defined by its learning mechanism of iteratively building sequential models based on residuals of a prior model to reduce prediction error. The Applicant also cites dependent claims 5 and 6 being free of prior art as evidence that the first machine learning model recited in claim 1 reflects a non-conventional, non-generic computational element. It is further argued that the claims also recite third machine learning model is trained on historical purchase data to determine a threshold interest rate above which the customer is unlikely to purchase the vehicle, and that the second value is determined based on a comparison of the loan parameters against that threshold rate. The Applicant argues that this is a specific, defined two-step determination by deriving a threshold from historical data and applying that threshold as a comparator against the current loan parameters to produce a probability output. On pages 10-11, the Applicant argues that the claim as amended recites a specific four-model architecture in which the output of the first machine learning model, the buy lending rate, forms part of the loan parameters that serve as inputs to the second machine learning model. The various machine learning models each produce an independent predictive value, which are then combined in a specific mathematical operation, such that their product is maximized to determine loan parameters for the deal structure. The Applicant argues that this is a concrete improvement to deal-structuring systems, citing specification paragraph [0069] disclosing the automatic and efficient recommending of alternate vehicles while limiting user inputs, instead of requiring users to bring many documents, reducing processing time, and enhance a computer-based decision-making processes traditionally performed by dealers. Examiner respectfully disagrees. The training data used for each model does not represent any technical undertaking, but merely defines what data of the abstract idea is used in the calculation of values for the process of the abstract idea. The training data used does not change or improve the technical process of how machine learning models are trained. The iterative building of sequential models based on residuals of prior models is also not recited with any detail. The specification is also silent to any details of the technical process. The closest disclosure occurs at paragraph [0042] of the specification does not provide any further detail than the claims. As such it is evident that this process is not any specific machine learning process, and is merely a machine learning component that has been added to the claims to provide more of a general link to a computing environment, but the claims are not directed to any technical process of machine learning technology, such as the technical ability of the machine learning model or any technical problems of machine learning. It is merely a further description of the machine learning model that is not associated with the whole body of the claims; the machine learning models merely output data for the abstract idea. Dependent claims 5 and 6 being free of prior art does not allude to eligibility. The claims were found free of prior art because the specific process of the claim were not disclosed in any previous art, such as claim 5, which recited how the training data included a list of accepted loan applications, the buy lending rate for each of the accepted loan applications, the customer profile for each of the accepted loan applications, and the financial data for each of the accepted loan applications. The modification of references to include all of such data would not have been obvious. However, this does not indicate eligibility of the claims as it merely defines the data of the abstract idea that is utilized in determining the output. The third machine learning model being trained by historical purchase data to determine a threshold interest rate above which the customer is unlikely to purchase the vehicle, and that the second value is determined based on a comparison of the loan parameters against that threshold rate also does not define any technical process. Again, this merely defines the abstract data used, and what abstract values are output. Deriving a threshold from historical data and applying that threshold as a comparator against the current loan parameters to produce a probability output merely defines the abstract algorithm. The underlying technology of the machine learning models are not recited and are not affected. They merely are applied to the abstract idea to be calculators for the algorithm of the abstract idea, and such details as the iterative building of sequential models based on residuals of a prior model merely describe what kind of calculator is being applied to the abstract idea. Maximizing the product of the output of the machine learning models to determine loan parameters for the deal structure do not describe any technical process, but merely recite mathematical concepts to determine deal parameters, which is an abstract idea in sales and marketing, and unrelated to any technical field. Deal structuring systems are not technical systems, but merely systems of abstract ideas, and the automatic and efficient of recommending of alternate vehicles while limiting user inputs merely describes the automating of abstract ideas onto a computing device. While processing times may be reduced, this does not come from a change in the processors ability or from an improvement to any other technical field, but only from a more efficient algorithm of the abstract idea that merely provides less information to be processed. The claims merely automate processes traditionally performed by dealers, and apply generic computing components to the abstract idea to provide a general link to a computing environment. In view of the above, the rejection under 35 U.S.C. 101 has been maintained below. Applicant’s arguments filed on 6/18/206 with respect to the rejection under 35 U.S.C. 103 have been fully considered, and are persuasive. Applicant has amended the subject matter of dependent claim 5 into the independent claim, which had been indicated as free of the prior art in the previous Office Action. 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-4 and 6-9 are rejected under 35 U.S.C. 101 because the claims are directed to a judicial exception without significantly more. Step 1: Claims 1-4 and 6-9 are directed to a method, which is a process. Therefore, claims 1-4 and 6-9 are directed to one of the four statutory categories of invention. Step 2A (Prong 1): Claim 1 sets forth the following limitations reciting the abstract idea of determining deal structures for sale of a vehicle based on probability of acceptance and profitability: receiving a customer identifier associated with a customer interested in a vehicle; determining a financial data associated with the customer identifier and a vehicle data associated with the vehicle; determining one or more product or services associated with the vehicle; determining, based on the financial data associated with the customer identifier and the vehicle data associated with the vehicle, loan parameters for financing purchase of the vehicle; based on historical loan application data to predict a buy lending rate, the historical loan application approval data comprising a list of accepted loan applications, the buy lending rate for each of the accepted loan applications, the customer profile for each of the accepted loan applications, and the financial data for each of the accepted loan applications; determining the buy lending rate; determining, based on the loan parameters, a first value indicative of acceptance of the loan parameters by at least one lending entity; determining, a second value indicative of a probability of the customer purchasing the vehicle and the one or more product or services based on the loan parameters; historical purchase data to determine a threshold interest rate above which the customer is unlikely to purchase the vehicle, wherein the second value is determined based on a comparison of the loan parameters against the threshold interest rate; determining, a third value indicative of a profitability in the purchase of the vehicle and the one or more products or services based on the associated loan parameters; providing a deal structure comprising the loan parameters to the customer for the purchase of the vehicle and the one or more product and services, the loan parameters maximizing a product of the total of the first value, the second value, and the third value. The recited limitations above set forth the process for determining deal structures for sale of a vehicle based on probability of acceptance and profitability. These limitations amount to certain methods of organizing human activity, including commercial or legal transactions (e.g. agreements in the form of contracts, advertising, marketing or sales activities or behaviors, etc.). The claims are directed to determining financial data and vehicle data in order to determine loan parameters and profitability in order to optimize and provide a deal structure to a customer (see specification: [0001-0002] disclosing the problem of inaccurate estimates for loans by vehicle dealers and short transaction windows for vehicle transactions), which is an sales and marketing activity. Such concepts have been identified by the courts as abstract ideas (see: MPEP 2106.04(a)(2)). Step 2A (Prong 2): Examiner acknowledges that representative claim 1 recites additional elements, such as: a device comprising a processor; a first machine learning model; a second machine learning model; a third machine learning model; training the first machine learning model; wherein the first machine learning model iteratively builds sequential decision models based on residuals of a prior model to reduce prediction error; the third machine learning model is trained; Taken individually and as a whole, claim 1 does not integrate the recited judicial exception into a practical application of the exception. The additional elements do no more than generally link the use of a judicial exception to a particular technological environment or field of use. Furthermore, this is also because the claim fails to (i) reflect an improvement in the functioning of a computer, or an improvement to other technology or technical field, (ii) implement a judicial exception with a particular machine, (iii) effect a transformation or reduction of a particular article to a different state or thing, or (iv) apply the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment. While the claims recite a device comprising a processor, this is recited with a very high level of generalization, and is recited in passing as merely performing the steps of the abstract idea. As disclosed in paragraph [0071] of the specification, the device comprising a processor may be any of a tablet device, a mobile device, a smart phone, a personal computer, etc. The paragraph further discloses that the computing device can include any computer operating environment. It is evident that the device comprising a processor is any generic computing device that merely provides a general link to a computing environment, such that the abstract idea is performed by the computing device. The machine learning models are also disclosed with a very high level of generality. The closest disclosure occurs in specification paragraph [0034] and [0042], which merely discloses the learning model includes a learning algorithm, merely disclosing a gradient boosting algorithm, nth degree polynomial, or tree-based classification algorithm as an example. There is no further discussion of any particularity or specific functionality of the machine learning models. The machine learning models merely act as a black box that receives inputs of the abstract idea to provide an output of the abstract idea. They merely perform calculations for determining various data, and are merely applied to the abstract idea. In view of the above, under Step 2A (Prong 2), claim 1 does not integrate the recited exception into a practical application (see: MPEP 2106.04(d)). Step 2B: Returning to claim 1, taken individually or as a whole, the additional elements of claim 1 do not provide an inventive concept (i.e. whether the additional elements amount to significantly more than the exception itself). As noted above, the additional elements recited in claim 1 are recited in a generic manner with a high level of generality and only serve to implement the abstract idea on a generic computing device. The claims result only in an improved abstract idea itself and do not reflect improvements to the functioning of a computer or another technology or technical field. As discussed above with respect to the integration of the abstract idea into a practical application, the additional elements used to perform the claimed process ultimately amount to no more than the mere instructions to apply the exception using a generic computer and/or no more than a general link to a technological environment. Even when considered as an ordered combination, the additional elements of claim 1 do not add anything further than when they are considered individually. In view of the above, claim 1 does not provide an inventive concept under step 2B, and is ineligible for patenting. Dependent claims 2-4 and 6-9 recite further complexity to the judicial exception (abstract idea) of claim 1, such as by further defining the algorithm of determining deal structures for sale of a vehicle based on probability of acceptance and profitability, and do not recite any further additional elements. Thus, each of claims 2-4 and 6-9 are held to recite a judicial exception under Step 2A (Prong 1) for at least similar reasons as discussed above. Under prong 2 of step 2A, the additional elements of dependent claims 2-4 and 6-9 also do not integrate the abstract idea into a practical application, considered both individually or as a whole. More specifically, dependent claims 2-4 and 6-9 rely on at least similar elements as recited in claim 1. Further additional elements are also acknowledged; however, the additional elements of claims 2-4 and 6-9 are recited only at a high level of generality (i.e. as generic computing hardware) such that they amount to nothing more than the mere instructions to implement or apply the abstract idea on generic computing hardware (or, merely uses a computer as a tool to perform an abstract idea). Further, the additional elements do no more than generally link the use of a judicial exception to a particular technological environment or field of use (such as the Internet or computing networks). Secondly, this is also because the claims fails to (i) reflect an improvement in the functioning of a computer, or an improvement to other technology or technical field, (ii) implement the judicial exception with, or use the judicial exception in conjunction with, a particular machine or manufacture that is integral to the claim, (iii) effect a transformation or reduction of a particular article to a different state or thing, or (iv) applies or uses the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment. Taken individually and as a whole, dependent claims 2-4 and 6-9 do not integrate the recited judicial exception into a practical application of the exception under step 2A (prong 2). Lastly, under step 2B, claims 2-4 and 6-9 also fail to result in “significantly more” than the abstract idea under step 2B. The dependent claims recite additional functions that describe the abstract idea and use the computing device to implement the abstract idea, while failing to provide an improvement to the functioning of a computer, another technology, or technical field. The dependent claims fail to confer eligibility under step 2B because the claims merely apply the exception on generic computing hardware and generally link the exception to a technological environment. Even when viewed as an ordered combination (as a whole), the additional elements of the dependent claims do not add anything further than when they are considered individually. Taken individually or as an ordered combination, the dependent claims simply convey the abstract idea itself applied on a generic computer and are held to be ineligible under Steps 2B for at least similar rationale as discussed above regarding claim 1. Thus, dependent claims 2-4 and 6-9 do not add “significantly more” to the abstract idea. Subject Matter Free of Prior Art Claim 1-4 and 6-9 are determined to have overcome the prior art of rejection and are free of the prior art, however, the claims remain rejected under 35 U.S.C. 101. Claim 1-4 and 6-9 are found to overcome the prior art rejection for the reasons as set forth below. Claim 1 recites the claimed features of training the first machine learning model based on historical loan application approval data to predict a buy lending rate, the historical loan application approval data comprising a list of accepted loan applications, the buy lending rate for each of the accepted loan applications, the customer profile for each of the accepted loan applications, and the financial data for each of the accepted loan applications, and wherein the first machine learning model iteratively builds sequential decision models based on residuals of a prior model to reduce prediction error; The closest prior art was found be as follows: Gaur (US 20210233164 A1) recites [0036] - “during training, the machine learning model may assign weights and/or bias to the loan information, the financial data, and/or vehicle data. The machine learning model may adjust weights in order to optimize a loss function or a cost function such that an error between an output of the machine learning model and an expected output is reduced. The weights may be proportional to the likelihood that a product or service, or information associated with a purchase, will influence the customer to purchase or not purchase a vehicle with a product or service”. Price (US 20210374616 A1) recites [0011] - “The machine learning model may be trained using data generated by the pricing model, and the data may include historical vehicle information, historical customer information, and historical dealership information” and [0034] – “Training data 129 may be stored in database 207. Computing device 101 may use pricing model 130 to determine a loan amount and loan details (e.g. a loan package or structure) to give to a customer based on the customer and the vehicle. In some embodiments, the loan package may be based on dealership information as well. Computing device 101 may use pricing model 130 to determine certain loan details (e.g. an annual percentage rate, length or loan term, monthly payment) charged for a loan for the customer”. Venuraju (US 20200126135 A1) recites [0076] – “the offer package system 110 may receive customer financial information. The customer financial information may include a customer's credit history, loan history, employment information, and the like. In some embodiments, the system may be further configured to determine the proposed offer package based on preferred user financing preferences. For example, in some embodiments, the customer may value a lower monthly payment more so than a lower overall purchase price. The personalized financing information may include specific loan terms that the customer has been approved for as they apply to the vehicle of choice” and [0040] – “offer package system 110 may determine personalized financing information for the at least one vehicle based on the customer financial information and the determined promotion recommendation. Accordingly, the offer package system 110 may provide inventory items meeting the customer financial information and display personalized financing information including details such as loan term, loan interest rate, and the monthly payment”. Dua (US 20230394035 A1) discloses [0052] – “the training module re-runs several iterations of the machine learning model. At block 316, the training module evaluates the machine learning model. At block 318, the training module determines whether or not the machine learning model is ready for deployment before either proceeding to block 320 to output final production model or returning to block 312 to further develop, test, or validate the model; and [0058] – “ PTO Reference V (see PTO-892 Reference V mailed on 2/18/2026) discloses challenges in prediction accuracy of credit defaults in portfolios of loans, and addressing these challenges with machine learning methods adapted to specific needs of credit assessment. Two machine learning models are utilized to identify defaulting and non-defaulting loan contracts, and then use logistic regression to predict a contract’s probability of default. It was found that no references alone or in combination, neither anticipates, reasonable teaches, nor renders obvious the below noted features of Applicant’s invention. The features of claims 5 and 6 in combination that overcome the prior art are: training the first machine learning model based on historical loan application approval data to predict a buy lending rate, the historical loan application approval data comprising a list of accepted loan applications, the buy lending rate for each of the accepted loan applications, the customer profile for each of the accepted loan applications, and the financial data for each of the accepted loan applications, and wherein the first machine learning model iteratively builds sequential decision models based on residuals of a prior model to reduce prediction error; Therefore, none of the cited references disclose or render obvious each and every feature of the claimed invention and the claimed invention is determined to be free of the prior art. Although individually the claimed features could be taught, any combination of references would teach the claimed limitations using a piecemeal analysis, since references would only be combined and deemed obvious based on knowledge gleaned from the applicant's disclosure. Such a reconstruction is improper (i.e., hindsight reasoning). See In re McLaughlin, 443 F.2d 1392, 170 USPQ 209 (CCPA 1971). The examiner emphasizes that it is the interrelationship of the limitations that renders these claims free of the prior art/additional art. Therefore, it is hereby asserted by the Examiner that, in light of the above, that the claims 1-4 and 6-9 are free of prior art as the references do not anticipate the claims and do not render obvious any further modification of the references to a person of ordinary skill in art. Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to TIMOTHY J KANG whose telephone number is (571)272-8069. The examiner can normally be reached Monday - Friday: 8:30am - 7:00pm 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, Maria-Teresa Thein can be reached at 571-272-6764. 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. /T.J.K./Examiner, Art Unit 3689 /VICTORIA E. FRUNZI/Primary Examiner, Art Unit 3689 10/9/2026
Read full office action

Prosecution Timeline

May 31, 2024
Application Filed
Feb 18, 2026
Non-Final Rejection mailed — §101
Jun 18, 2026
Response Filed
Oct 14, 2026
Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12718285
METHODS TO PROMOTE BIDDER PARTICIPATION
4y 2m to grant Granted Aug 25, 2026
Patent 12700031
SYSTEM FOR FACILITATING USER ENGAGEMENTS DURING NAVIGATION OF VIRTUAL MARKETPLACE
3y 6m to grant Granted Aug 04, 2026
Patent 12597058
IDENTIFICATION OF ITEMS IN AN IMAGE AND RECOMMENDATION OF SIMILAR ENTERPRISE PRODUCTS
3y 2m to grant Granted Apr 07, 2026
Patent 12541791
Qualitative commodity matching
4y 1m to grant Granted Feb 03, 2026
Patent 12468775
Assistance Method for Assisting in Provision of EC Abroad, and Program or Assistance Server For Assistance Method
3y 3m to grant Granted Nov 11, 2025
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

3-4
Expected OA Rounds
46%
Grant Probability
72%
With Interview (+26.3%)
Moderate
PTA Risk
Based on 292 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