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 .
Response to Amendment
The following is a FINAL Office action in reply to the Amendments and Arguments received on August 13, 2026.
Status of Claims
Claims 1-12 and 14-20 have been amended.
Claims 1-20 are currently pending and have been examined.
Double Patenting
Claims 1, 2, 7-9, and 14-16 of this application is patentably indistinct from claim 1, 2, 6, 8, 9, 13, 15, 16, and 20 of Application No. 18/802,101. Pursuant to 37 CFR 1.78(f), when two or more applications filed by the same applicant or assignee contain patentably indistinct claims, elimination of such claims from all but one application may be required in the absence of good and sufficient reason for their retention during pendency in more than one application. Applicant is required to either cancel the patentably indistinct claims from all but one application or maintain a clear line of demarcation between the applications. See MPEP § 822.
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 1, 2, 7, 8, 9, and 14-16 provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 2, 6, 8, 9, 13, 15, 16, and 20 of copending Application No. 18/802,101 (reference application). Although the claims at issue are not identical, they are not patentably distinct from each other because:
Instant Application 18/778,892
Pending Application 18/802,101
Claim 1, 8 and 15: A system, comprising:
a memory configured to store a plurality of instances of a software application
executable on a computing device, a set of historical generated responses, and a set of
confidence scores,
Claim 1, 8 and 15: a memory configured to store a plurality of instances of a software application executable on a computing device and a set of confidence scores
receive, from at least one instance of the software application executing
on the computing device, a first support request
receive, from at least one instance of the software application executing on the computing device, an interaction request
identify, based on the first support request, an intent and one or more
named entities
identify, based on the interaction request and the metadata, an intent and one or more named entities
generate, based on the identified support service interaction and
the at least one historical generated response, a generative response
comprising a recommendation to initiate an execution of the identified
support service interaction to satisfy the support request.
generate, based at least in part on the confidence score assigned to the interaction request, a generative response comprising a recommendation to initiate the execution of the interaction to satisfy the interaction request
Claim 2, 12 and 16: wherein the one or more generative machine learning
models comprises one or more classical machine-learning (CML) models, and the one
or more quantum machine-learning (QML) models
Claim 2, 9 and 16: wherein the one or more generative machine-learning models comprises one or more classical machine-learning (CML) models, one or more quantum machine-learning (QML) models, or a combination thereof.
Claim 7 and 14: display the generative response comprising the recommendation
to initiate the execution of the identified support service interaction
Claim 6:, 13 and 20 generate… recommendation to initiate the execution of the interaction to satisfy the interaction request
This is a provisional nonstatutory double patenting rejection because the patentably indistinct claims have not in fact been patented.
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.
Step 1:
Claims 8-14 are drawn to methods while claim(s) 1-7 and 15-20 is/are drawn to an apparatus. As such, claims 1-20 are drawn to one of the statutory categories of invention (Step 1: YES).
Step 2A - Prong One:
Claim 8 (representative of independent claim(s) 1 and 15) recites the following steps:
receiving, a support request; and
identify, based on first the support request, an intent and one or more named entities included within the first support request;
determine, based on the identified intent and one or more named entities, whether the support request is associated with at least one historical generated response of a set of historical generated responses;
in response to determining that the support request is associated with the at least one historical generated response, identify, based on the at least one historical generated response and a confidence score associated therewith, a support service interaction to be executed for satisfying the first support request, wherein the confidence score comprises an indication of how well the at least one historical generated response and the identified support service interaction performed in satisfying a second support request;
generate, based on the identified support service interaction and the at least one historical generated response, a generative response comprising a recommendation to initiate an execution of the identified support service interaction to satisfy the first support request.
These steps, under its broadest reasonable interpretation, encompass a human manually (e.g., in their mind, or using paper and pen) generating support request responses and recommendations (i.e., one or more concepts performed in the human mind, such as one or more observations, evaluations, judgments, opinions), but for the recitation of generic computer components. If one or more claim limitations, under their broadest reasonable interpretation, covers performance of the limitation(s) in the mind but for the recitation of generic computer components, then it falls within the "mental processes" subject matter grouping of abstract ideas.
As such, the Examiner concludes that claim 8 recites an abstract idea (Step 2A - Prong One: YES).
Independent claim(s) 1 and 15 are determined to recite an abstract idea under the same analysis.
Step 2A - Prong Two:
This judicial exception is not integrated into a practical application. The claim(s) recite the additional elements/limitations of:
from at least one instance of a software application executing on a computing device, server
executing one or more quantum machine- learning (QML) models trained to:
A system, comprising: a memory configured to store a plurality of instances of a software application executable on a computing device, a set of historical generated responses, and a set of confidence scores, wherein each confidence score of the set of confidence scores is associated with a respective one of the set of historical generated responses; and a quantum processor operably coupled to the memory and configured to
A non-transitory computer-readable medium storing instructions that, when executed by a quantum processor, cause the quantum processor to
The requirement to execute the claimed steps/functions listed above is equivalent to adding the words ''apply it'' on a generic computer and/or mere instructions to implement the abstract idea on a generic computer. This/these limitation(s) do/does not impose any meaningful limits on producing the abstract idea and therefore do/does not integrate the abstract idea into a practical application (see MPEP 2106.05(f)).
The Examiner has therefore determined that the additional elements, or combination of additional elements, do not integrate the abstract idea into a practical application. Accordingly, the claim(s) is/are directed to an abstract idea (Step 2A -Prong Two: NO).
Step 2B:
The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception.
As discussed above in "Step 2A - Prong 2", the requirement to execute the claimed steps/functions listed above is equivalent to adding the words "apply it" on a generic computer and/or mere instructions to implement the abstract idea on a generic computer. These limitations therefore do not qualify as "significantly more" (see MPEP 2106.05 (f)).
The Examiner has therefore determined that no additional element, or combination of additional claims elements is/are sufficient to ensure the claim(s) amount to significantly more than the abstract idea identified above (Step 2B: NO).
Regarding Dependent Claims:
Dependent claims 6, 11, 13 and 20 fail to include any additional elements and are further part of the abstract idea as identified by the Examiner.
Dependent claims 2-4, 5, 7, 9, 10, 12, 14 and 16-19 include additional limitations that are part of the abstract idea except for:
quantum processor
one instance of the software application executing on the computing device
wherein the one or more generative machine learning models comprises one or more classical machine-learning (CML) models, one or more quantum machine-learning (QML) models,
the one or more processors are further configured to: execute the one or more generative machine-learning models further trained to:
train the one or more generative machine-learning models
The additional elements of the dependent claims are equivalent to adding the words ''apply it'' on a generic computer and/or mere instructions to implement the abstract idea on a generic computer. Even in combination, these additional elements do not integrate the abstract idea into a practical application and do not amount to significantly more than the abstract idea itself. The claims are ineligible.
Response to Arguments
Applicant's arguments with respect to the rejection under 35 USC 101 have been fully considered but they are not persuasive.
Applicant Argues: Claims 1, 8, and 15 are not directed to a mental process or any other abstract idea because the claims recite "execute one or more quantum machine-learning models trained to" perform the recited operations, including "identify, based on the first support request, an intent and one or more named entities included within the first support request," "determine, based on the identified intent and one or more named entities, whether the first support request is associated with at least one historical generated response," and "identify, based on the at least one historical generated response and the confidence score associated therewith, a support service interaction to be executed for satisfying the first support request."
Examiner respectfully disagrees. First, "execute one or more quantum machine-learning models trained to" perform the recited operations” is not considered as a part of the abstract idea, but rather as an additional element under Step 2A Prong Two. Examiner notes that as stated in the updated 101 rejection above, the particular “identify…” and “determine…" features of the claims are SO broad that they could reasonably be done mentally in the human mind as part of an observation, evaluation, judgement, or opinion. There is nothing in the claim language nor in the specification that would prohibit such an implementation. In fact, there is no limiting technology tied to these features at all other a generic machine learning models. Therefore, contrary to applicant's assertion, these claimed features can and should be deemed part of a recited abstract idea categorized in Mental Process. Therefore, the argument is not persuasive.
Applicant Argues: The present claims are analogous to the USPTO's Subject Matter Eligibility Example 39 because, as in that example, the claims recite machine learning model execution that is not practically performed in the human mind.
The “"execute one or more quantum machine-learning models trained to" perform the recited operations,” step is considered as an additional element under Step 2A Prong Two. Regarding Example Claim 39, the instant claims are not at all like the example claim. The instant application lacks the technical disclosure of the example claim and merely recites at a high level of how the machine learning is performed. For this reason, the claims are considered to merely implement the abstract idea on a generic computer.
Applicant Argues: Even if the pending claims involve an abstract idea, which Applicant disputes, the claims recite elements that integrate any alleged exception into a practical application.
Examiner respectfully disagrees with Applicant’s argument. As explained in the rejection, the only feature here that may be considered to be an “additional element” is the requirement for the broadly claimed “quantum machine learning” to be done using a “model”. Such a requirement amounts to a general requirement to perform the “learning” function (e.g., identifying a simple correlation in data using some basic mathematical approach) to be performed using a general purpose computer. Additional elements are parsed out of the claim language and considered during step 2A prong two and step 2B of the analysis. Parsing out the additional elements during step 2A prong one is proper, and does not mean the Examiner ignored any limitations.
Applicant Argues: Claim 1 integrates any alleged exception into a practical application by linking model execution to historical generated responses and confidence scores associated therewith.
Examiner respectfully disagrees. The Court was clear in Electric Power Group, LLC v. Alstom, 830 F. 3d 1350, 119 U.S.P.Q.2d 1739 (Fed. Cir. 2016) that the important distinction to draw regarding the decision in Enfish and how it relates to any claimed subject matter in question is that the focus of the claims need be on an improvement in computers as tools, not just on abstract ideas that use computers as tools. (See Electric Power Group at 8.
"The claims here are unlike the claims in Enfish. There, we relied on the distinction made in Alice between, on one hand, computer-functionality improvements and, on the other, uses of existing computers as tools in aid of processes focused on “abstract ideas” (in Alice, as in so many other § 101 cases, the abstract ideas being the creation and manipulation of legal obligations such as contracts involved in fundamental economic practices). Enfish, 822 F.3d at 1335-36; see Alice, 134 S. Ct. at 2358-59. That distinction, the Supreme Court recognized, has common-sense force even if it may present line-drawing challenges because of the programmable nature of ordinary existing computers. In Enfish, we applied the distinction to reject the § 101 challenge at stage one because the claims at issue focused not on asserted advances in uses to which existing computer capabilities could be put, but on a specific improvement—a particular database technique—in how computers could carry out one of their basic functions of storage and retrieval of data. Enfish, 822 F.3d at 1335-36; see Bascom, 2016 WL 3514158, at *5; cf Alice, 134 S. Ct. at 2360 (noting basic storage function of generic computer). The present case is different: the focus of the claims is not on such an improvement in computers as tools, but on certain independently abstract ideas that use computers as tools.”) (emphasis added)
Based on these findings of fact, the claimed subject matter at best is using a general purpose computer as a tool, but fails to provide any improvement to said computer. The Examiner respectfully notes that the needed "improvement" in terms of patent eligibility is not one resulting from programming a generic processor to perform a different (or even improved) function, but rather a specific and actual improvement to the machine itself is needed. Based on these findings of fact, the Examiner contends the claims are indeed directed towards an abstract idea and Applicant's arguments to the contrary are considered to be non-persuasive.
Applicant Argues: The specification confirms that Claim 1 is directed to a technical improvement. For
example, the specification states that "the present embodiments improve the efficiency, accuracy, speed, and security of generating support request responses and recommendations, as well as the one or more processors and memory on which the generated support request responses and recommendations may be executed and stored by generating support request responses and recommendations utilizing quantum computing."
Examiner respectfully disagrees. The claimed areas of improvement, as stated by the Applicant, are improvements made to the abstract idea when using computers as tools. There is no improvement to the computer, aside from Applicant’s broad statement claiming so. Applicant claims that the instant application provides for more accurate recommendations and support request responses. Examiner respectfully disagrees. The examiner contends that this allegation at best amounts to an improvement to the abstract idea itself. The Applicant essentially alleges that better” support request responses and recommendations” is their technical improvement. However, better support request responses and recommendations is simply an improvement to the data (i.e., improvement to the abstract idea itself). The claimed subject matter fails to recite any technically improved way in which this data is being leveraged. The claimed invention simply takes data representing a support request and pairs it with a previous support request to leverage a support solution. Such an implementation does not amount to a technical improvement. Therefore, the rejection is maintained.
Applicant Argues: Claim 1 expressly ties the "confidence score" to "how well the at least one historical generated response and the identified support service interaction performed in satisfying a second support request."
Examiner respectfully disagrees. Determining a confidence score based on how well the support response addressed a new support request is at best a mathematical relationship, which falls under an abstract idea, not a technical improvement.
Applicant Argues: In Ex parte Desjardins, the Board cautioned against evaluating machine-learning claims at such a high level of generality that meaningful technical limitations are disregarded, and credited claim limitations that reflected improvements in how a machine learning model operated. The same principle applies here. The pending claims do not merely recite the result of "generating a recommendation."
Examiner respectfully disagrees. Applicant argues that the claims are similar to Ex Parte Desjardins in that they provide a technological improvement. This is not persuasive. Although the claims feature the training and execution of quantum machine learning models, this does not constitute an improvement in the realm of quantum machine learning or computers. For example, the claims fail to introduce any unconventional method of training the quantum machine learning model, or any details regarding execution of the quantum machine learning model. The claims merely feature the conventional training of machine learning models with particular data. The machine learning model are merely results-oriented and lack implementation detail. Even if the claims “improve the efficiency, accuracy, speed, and security of generating support request responses and recommendations” this does not reflect a technological improvement. If anything, it merely presents an improvement to a business method using the computer as the tool to make such gains.
Applicant Argues: Ex parte Carmody is also instructive. There, the Board recognized that AI-based recommendation or orchestration claims may integrate any alleged abstract idea into a practical application when the claims improve how trained models are used by a recommendation engine to generate useful orchestrations.
Examiner respectfully disagrees. Ex parte Carmody was found to integrate the abstract idea into a practical application because they recited technical improvements in AI model training and architecture, rather than merely applying AI to achieve a business outcome. Such an improvement is not readily apparent in the instant claims. The instant claims merely use the quantum machine learning model to train data in the way that machine learning models in the way that the machine learning tools operate.
Applicant Argues: Accordingly, the claims as a whole are directed to technical improvements in the functioning of an automated support-response system and computing technology.
The Examiner notes that the claimed subject matter could clearly be performed by a human user via a manual and/or mental process, or with pen and paper, and performing said operations on a general-purpose computer at best ties the abstract idea(s) to an online environment. The claims are merely automating what a trained, experienced human operator would do by learning the job. And while implementing the claimed subject matter on a computer may speed up the process, these gains in speed are at best from the capabilities of a general-purpose computer, rather than the patented method itself. See Bancorp Servs., LLC v. Sun Life Assurance Co. of Can. (U.S.), 687 F.3d 1266, 1278 (Fed Cir. 2012) ("[T]he fact that the required calculations could be performed more efficiently via a computer does not materially alter the patent eligibility of the claimed subject matter."). And as in FairWarning (FairWarning IP, LLC v.Iatric Systems, _F.3d_, 120 U.S.P.Q.2d 1293 (Fed. Cir. 2016)), the Court was clear in FairWarning that "[...] As we have explained, "the fact that the required calculations could be performed more efficiently via a computer does not materially alter the patent eligibility of the claimed subject matter." Bancorp Servs., 687 F.3d. at 1278."
Based on these findings of fact, the examiner considers applicant's argument to be non-persuasive.
Applicant Argues: Finally, the present claims do not reflect an attempt to monopolize a judicial exception but instead include particular technological features for implementing the practical applications described above and achieving the above-described technological advantages… The claims also do not preempt all ways of generating support-request responses, all chatbots, all recommendation systems, or all uses of machine learning in customer support.
The Applicant fails to provide support for their contention that anything more than a conventional computer would be required to perform the claimed functions. Examiner therefore does not find the Applicant’s arguments to be persuasive. See Alice, 134 S.Ct. at 2359 (noting, in carrying out the second step, that the “the relevant question is whether the claims here do more than simply instruct the practitioner to implement the abstract idea ... on a generic computer”); Dealertrack, Inc. v. Huber, 674 F.3d 1315, 1333-34 (Fed. Cir. 2012) (“Simply adding a ‘computer aided’ limitation to a claim covering an abstract concept, without more, is insufficient to render [a] claim patent eligible.”). Finally, the Examiner is not persuaded by the Applicant’s argument that the claim will not preempt the underlying idea of generating support-request responses, all chatbots, all recommendation systems, or all uses of machine learning in customer support methods. Although it may be true that there are other methods to generate recommendations, that issue is not dispositive as to whether the claim is patent eligible. See Ariosa Diagnostics, Inc. v. Sequenom, Inc., 788 F.3d 1371, 1377 (Fed. Cir. 2015) (“While preemption may signal patent ineligible subject matter, the absence of complete preemption does not demonstrate patent eligibility.”).
Applicant Argues: Even if, arguendo, the claims were found to be directed to a judicial exception, they recite "significantly more" than any such exception under Step 2B.
The Examiner notes that this claim of significantly more is not representative of an "actual" improvement to the technology itself, but at best is an improvement to the business method or abstract idea itself. In fact. Applicant can provide no tangible findings that there was actually anything different and/or improved in the instant system compared to prior "conventional systems", other than a mere allegation and unsubstantiated, conclusory statement that the instant invention improves existing systems and is significantly more than using rules to identify options. However, the Examiner respectfully notes that the features of the claimed invention does not represent an improvement. The Applicant cannot point to anything that was specifically done either in the claimed subject matter, the specification, or provided reasoning to show how this is significantly more or provides an improvement to the technology of the conventional system implementation. Moreover, the Examiner respectfully notes that the needed "improvement" in terms of patent eligibility is not one resulting from programming a generic processor to perform a different (or even improved) function, but rather a specific and actual improvement to the machine itself is needed. Based on these findings of fact, the Examiner contends the claims are indeed directed towards an abstract idea and Applicant's arguments to the contrary are considered to be non-persuasive.
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). 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 RASHIDA R SHORTER whose telephone number is (571)272-9345. The examiner can normally be reached Monday- Friday from 9am- 530pm. 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, Jessica Lemieux can be reached at (571) 270-3445. 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.
/RASHIDA R SHORTER/Primary Examiner, Art Unit 3626