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 .
Status of Claims
This action is in response to amendment filed on 5 August 2026. Claims 1, 4, 7, 8, 14, 15 and 18 have been amended. Claims 2, 9, and 16 have been cancelled. Claims 21-23 have been added. Claims 1, 3-8, 10-15 and 17-23 are currently pending and have been examined.
Double Patenting
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, 3-8, 10-15 and 17-23 are rejected on the ground of nonstatutory double patenting over claims 1-12 of U.S. Patent No. 12, 008,575 since the claims, if allowed, would improperly extend the “right to exclude” already granted in the patent.
The subject matter claimed in the instant application is fully disclosed in the patent and is covered by the patent since the patent and the application are claiming common subject matter, as follows:
18/737,266
12/008,575
A computer-implemented method for managing a transaction between a providing entity and a receiving entity, the method comprising:
receiving, by a computer system over a communication network, a first plurality of entity parameters for each of a plurality of receiving entities;
receiving, by the computer system over the communication network, a second plurality of entity parameters for each of a plurality of providing entities, wherein the second plurality of entity parameters comprise a plurality of transaction preferences provided by each of the plurality of providing entities;
registering, by the computer system, the plurality of receiving entities based on the first plurality of entity parameters;
registering, by the computer system, the plurality of providing entities based on the second plurality of entity parameters;
receiving, by a request reception module of the computer system over the communication network, a request to initiate a transaction from a receiving entity of the plurality of receiving entities;
extracting, by an entity parameter extraction module of the computer system, one or more entity parameters of the first plurality of entity parameters associated with the receiving entity upon receiving the request;
generating. by a transaction rules generation module of the computer system, a structural tree associated with transaction rules related to the plurality of providing entities based on the second plurality of entity parameters wherein generating the structural tree comprises:
generating a first layer of the structural tree, the first layer comprising l a first set of nodes, each of the first set of nodes representing a transaction value to be provided by one of the plurality of providing entities;
assigning each of the first set of nodes to a providing entity of the plurality of providing entities, wherein a respective node of the first set of nodes assigned to a respective providing entity of the plurality of providing entities represents an amount of money that is provided by the respective providing entity:
generating at least one second layer of the structural tree comprising a second set of nodes, each of the second set of nodes representing a transaction preference of the plurality of transaction preferences provided by the plurality of providing entities; and
generating a third layer of the structural tree comprising a single node, the single node representing a transaction token configured to enable the transaction between the at least one providing entity and the receiving entity:
matching, by an entity parameters matching module of the computer system, each of the one or more entity parameters of the first plurality of entity parameters with the structural tree to identify at least one providing entity of the plurality of providing entities for enabling the transaction, wherein the matching comprises:
identifying at least one node of the first set of nodes and at least one second node of the second set of nodes matching nodes amongst the plurality of nodes of the plurality of layers associated with a representation matching each of the one or more entity parameters of the first plurality of entity parameters to provide a plurality of matching nodes;
activating links between the plurality of matching nodes and the single node of the third layer;
identifying an unbroken link between the at least one node in the first set of nodes of the first layer, the at least one second node in the second set of nodes of the second layer, and the single node of the third layer; and
selecting [[the]] a providing entity associated with the at least one first node and the at least one second node to be the at least one providing entity for enabling the transaction based on identifying the unbroken link, wherein the at least one providing entity cannot be identified if the unbroken link is not identified; and
automatically enabling, by a transaction enable module of the computer system, the transaction from the at least one providing entity to the receiving entity based on the matching, wherein enabling the transaction comprises establishing a connection separate from the communication network between a first bank associated with the at least one providing entity and a second bank associated with the receiving entity to provision a transaction amount from the at least one providing entity to the receiving entity.
A computer-implemented method for managing a transaction between a providing entity and a receiving entity, the method comprising:
receiving a first plurality of entity parameters for each of a plurality of receiving entities;
receiving a second plurality of entity parameters for each of a plurality of providing entities;
registering the plurality of receiving entities based on the first plurality of entity parameters;
registering the plurality of providing entities based on the second plurality of entity parameters;
receiving a request to initiate a transaction from a receiving entity of the plurality of receiving entities;
extracting one or more entity parameters of the first plurality of entity parameters associated with the receiving entity upon receiving the request;
matching each of the one or more entity parameters with pre-determined transaction rules related to the plurality of providing entities to identify at least one providing entity of the plurality of providing entities for the receiving entity, wherein the pre-determined transaction rules comprise a structural tree comprising a plurality of layers with a plurality of nodes, wherein each node of the plurality of nodes in a bottom layer of the plurality of layers represents a transaction value to be provided by one of the plurality of providing entities, wherein the plurality of nodes in intermediate layers of the plurality of layers represents one or more transaction preferences from the second plurality of entity parameters of the plurality of providing entities, wherein a top layer of the plurality of layers comprises a single node representing a transaction token configured to enable the transaction between the at least one providing entity and the receiving entity, and wherein the matching comprises: identifying matching nodes amongst the plurality of nodes of the plurality of layers associated with a representation matching each of the one or more entity parameters; activating links between the matching nodes to identify an unbroken link between at least one node in the bottom layer to the single node in the top layer through nodes in the intermediate layers; and selecting a providing entity related to the at least one node to be the at least one providing entity for enabling the transaction; and enabling the transaction from the at least one providing entity to the receiving entity.
Although the claims at issue are not identical, they are not patentably distinct from each other because: though the wording are different, the limitations carried are either inherently implied or would have been obvious to one of ordinary skill in the art. 18/737, 266 recites “wherein the first plurality of entity parameter wherein received from each of the plurality of receiving entity during registration” vs “ receiving a first plurality of entity parameters for each of a plurality of receiving entities and “registering the plurality of receiving entities based first plurality of entity parameters”. One ordinary skill in the art would have contemplated that the act of wherein includes the previously received a plurality of entities parameters from sources (i.e., from receiving entity or during registration), the nature of the steps are different, however do not result in a patentable distinction in either case the plurality of paraments must be received from a certain source and processed. 18/737, 266 recites “nodes comprising a first set of and a second set of nodes ” vs “layers with a plurlity of nodes ” which is merely a different way of wording to the patent’s, however, do not result in a patentable distinction in either case. 18/737, 266 recites “in the first set of nodes to the node” vs at least node in the bottom layer to the single nodes” which is merely a different way of wording to the patent’s, however, do not result in a patentable distinction in either case.
Furthermore, there is no apparent reason why applicant was prevented from presenting claims corresponding to those of the instant application during prosecution of the application which matured into a patent. See In re Schneller, 397 F.2d 350, 158 USPQ 210 (CCPA 1968). See also MPEP § 804.
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 therefore, subject to the conditions and requirements of this title.
Step 1: The claims 1, 3-7 and 21 are a method, claims 8, 10-14 and 22 are a system and claims 15, 17-20 and 23 are medium. Thus, each independent claim, on its face, is directed to one of the statutory categories of 35 U.S.C. §101. However, the claims 1, 3-8, 10-15 and 17-23 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
Step 2A-Prong 1: The (independent claims 1, 8 and 15) recite receiving a request to initiate a transaction from a receiving entity, extracting one or more entity parameters associated with the receiving entity upon receiving the request, matching each of the one or more entity parameters with pre-determined transaction rules related to a plurality of providing entities registered with a system to identify at least one providing entity for the receiving entity and enabling the transaction from the at least one providing entity to the receiving entity; generating structural tree; assigning the set of nodes; matching parameters; identifying at least one node; identifying un broken link; and selecting link. The extracting limitation, as drafted, is a process that , under its broadest reasonable interpretation covers processing of information of the limitation in the mind but for the recitation of the generic computer components. Thus, the limitation is a mental process. The matching limitation, as drafted, is a process that, under its broadest reasonable interpretation, covers performance of the limitation in the mind but for the recitation of the generic computer components. That is, other than reciting the generic computer components, nothing in claim element precludes the step from practically being performed in the mind. For example, but for the computer components language, the claims encompass that user comparing one or more parameters with pre-determined transaction rules related to a plurality of providing entities registered with a system. Thus, the limitation is also a mental process.
Step 2A-Prong 2: The claims recited additional elements of the computer components (i.e., , memory) is used to perform both the extracting and matching steps. The computer components (i.e., processor , memory) in both steps is recited at a hash level of generality, i.e., as a generic processor performing a generic computer function of processing data (comparing information in response to receiving request and pulling out information. This generic processor limitation is no more than mere instructions to apply the exception using a generic computer component. Accordingly, this additional element does not integrate the abstract idea into a practical application because it does not impose any meaningful limits on practicing the abstract idea. The claims are directed to the abstract idea.
Step 2B: As discussed with respect to Step 2A Prong Two, the additional element in the claim amounts to no more than mere instructions to apply the exception using a generic computer component. The same analysis applies here in 2B, i.e., mere instructions to apply an exception using a generic computer component cannot integrate a judicial exception into a practical application at Step 2A or provide an inventive concept in Step 2B. The claim is ineligible.
Dependent claims 3-7, 10-14 and 17-23, these claims recite limitation that further define the same abstract idea noted in claims 1, 8 and 15. These claims recite additional limitation of structural tree comprising a plurality of layers with plurality of nodes that represent a plurality of transactions. The structural graph is recited at a high level of generality that represents plurality of transaction. This generic processor limitation is no more than mere instructions to apply the exception using a generic computer component. The structural graph limitation used to store information and at best is doing no more than generally linking the claims to computer environment. In sum, the combination of steps that stores data, receives and send message, activate link between nodes at best is doing no more than generally linking the claims to network environment that sends and receives communications– see MPEP 2106.05(h). See also, OIP Techs., Inc., v. Amazon.com, Inc., 788 F.3d 1359, 1363, 115 USPQ2d 1090, 1093 (Fed. Cir. 2015) (sending messages over a network). Thus, the claims are an abstract idea.
TLI Communications provides an example of a claim invoking computers and other machinery merely as a tool to perform an existing process. The court stated that the claims describe steps of recording, administration and archiving of digital images, and found them to be directed to the abstract idea of classifying and storing digital images in an organized manner. 823 F.3d at 612, 118 USPQ2d at 1747. The court then turned to the additional elements of performing these functions using a telephone unit and a server and noted that these elements we’re being used in their ordinary capacity (i.e., the telephone unit is used to make calls and operate as to identifying the connection , and simply receives data, extracts information from the received data, and stores the digital images based on the extracted information). 823 F.3d at 612-13, 118 USPQ2d at 1747-48.
The closest prior arts to the applicants claimed invention:
Banerjee et al (US Pub/. No., 2018/0196694 A1) discloses techniques described herein relate to generating graphoriented data structures based on cross-channel multi-user transaction and/or interaction data from one or more data sources, Additional techniques relate to analyzing and processing transactions using the graph-oriented data structures. Transaction data may be received from various data sources and analyzed to determine subsets of the transaction data relating to interactions between specific pairs of users.
Kenyon et al (US Pub., 2014/0244493 A1) discloses systems and methods that receive one or more images and based at least in part on the received images, identify information associated with a payment instrument. The information associated with the payment instrument may be stored in a payment instrument repository, such as an electronic wallet (eWallet), associated with a user. The eWallet may be accessed by the user to add, delete, or modify payment instruments and associated information in the eWallet.
Miller et al (US Pu., 2016/0224993 A1) focused on systems, apparatuses, methods, and/or computer program products for identifying existing relationships between entities. Identification of relationships is based on an analysis of received entity data of one or more entities. The system of the present invention may compare received entity data with existing entity data to determine a match of entity data between one or more entities(abstract), receiving a first plurality of entity parameters for each of a plurlity of parameters of receiving entities (Fig. 2, 210, discloses receiving first entity data [plurality of entity parameter]); receiving a second plurality of entity parameters for each of a plurality of parameters of receiving entities (Fig. 2, 220 discloses the entity data of the plurality of other entities [second plurlity of entity parameters] stored in a database); registering the plurlity of receiving entities based on the first plurality of entity parameters; registering the plurality of receiving entities based on the second plurality of entity parameters(paragraph [0097], discloses entities have an entity profile that is registered with the financial institution ..); receiving a request to initiate a transaction from a receiving entity of the plurlity of receiving entities (paragraph [0040], discloses the system 120 and/or user input system 130 is configured to initiate presentation of any of the user interfaces );extracting one or more entity parameters of the first plurality of entity parameters associated with the receiving entity upon receiving the request (paragraph [0058], discloses upon receipt of the files by the system 120, the entity data is extracted from the received file)); and matching each of the one or more entity parameters with pre-determined transaction rules related to the plurality of providing entities (Fig. 2, 220, discloses comparing the first entity data to entity data of a plurlity of other entities, .., and Fig. 2, 230, discloses identifying based on comparing the first entity data to entity data of the plurality of other entities, at least a partial match between the first entity data ,..).
Manoharan et al. (US Pub. No.: US 2019/0188578 Al) focused on methods and systems for automatically discovering data types required by a computer-based rule engine for evaluating a transaction request are presented. Multiple potential paths for evaluating the transaction request according to the rule engine are determined. An abstract syntax tree may be generated based on the rule engine to determine the multiple potential paths. Based on an initial set of data extracted from the transaction request, one or more potential paths that are determined to be irrelevant to evaluating the transaction request are identified (abstract), a rule engine comprises numerous conditions and is conjured to provide an outcome for the transaction request by analyzing the transaction request according to the condition. In some embodiments, the outcome provided by the rule engine may be a binary outcome – an indication of where whether the truncation request is a legitimate request (paragraph [0011]), the abstract syntax tree is a tree-based data structure that include inter-connected nodes. Each node represents a set of condition for evaluating the transaction requested, and noes that are serially connected together by edges from a path (paragraph [0019]), the user device 100 [receiving entity] , in one embodiment, includes a user interface (UI) application 112 (e.g., a web browser), which may be utilized by the user 140 to conduct transactions (e.g., shopping, purchasing, bidding, etc.) with the service provider server 130[providing entity] over the network 160. In one aspect, purchase expense may be directly and/or automatically debited from an account related to the suer 140 via the user interface application 112 (paragraph [0024]) , extracting information related to a transaction type from the transaction request (which can be easily extracted from the transaction request itself) (paragraph [0055]), and upon receiving a transaction request (e.g., from a user device via the web server 134), the rule set analyzer 204 may extract information directly from the transaction request. In this example, the rule set analyzer 204 may be able to extract the transaction type related to the transaction request from the transaction request itself without retrieving information from other sources(paragraph [0056]).
Ur et al (US Pub., 2019/0342205 A1) focused on system and a method of routing transactions between nodes of a computer network, by at least one processor. Embodiments of the method may include: receiving a destination feature vector (DFV) for at least one destination node of a plurality of destination nodes of the computer network; receiving a transaction request to route a transaction between a source node of the computer network and the at least one destination node; extracting from the transaction request one or more transaction parameters; and selecting a destination node from the plurality of destination nodes based on one or more of the transaction parameters and the DFV of the at least one destination node(abstract), extracting by the processor from the transaction request and FV comprising at least one feather associated with the request transaction (Fig. 6, S1010 and paragraphs [0010] [0020]) , extracting from the transaction request one or more transaction parameters (Fig. 12, S4015 and paragraph [0028), receiving a transaction request to route a transaction between a soured node and destination node of the computer network (Fig. 10, S3005) and obtaining one or more transaction parameters for each avaible routing path, based on the truncation request (Fig. 10, S3015).
Kanza et al (US Pub., No., 2018/0006897 A1) focused on a system may include a processor and an input adapted to communicate with a network. The system may also include memory storing instructions that cause the processor to effectuate operations. The operations may include detecting a plurality of nodes in the network based on data received at the input and for each of a plurality of nodes, instantiating a node data structure. The operations may also include, for each respective node of the plurality of nodes, identifying an indicative edge of a connection between the respective node and a second node of the plurality of nodes (abstract), create a graph database comprising a layered graph based on the node data structures and the edge data structure (Fig, 2B, 245, paragraphs [0008]-[0009]), for each respective node , identifying an edge. The edge may indicate a connection between the respective nod and a second node …, identifying all edge between nodes… edges may indicate that two nodes are in communication with another (paragraph [0041]).
Leung et al (US Pub., No., 2011/0221769 A1) discloses technologies are generally described for providing a robust object recognition scheme based on dynamic modeling. Correlations in fine scale temporal structure of cellular regions may be employed to group the regions together into higher order entities. The entities represent a rich structure and may be used to code high level objects. Object recognition may be formatted as elastic graph matching
Chrapko et al (US Pub., 2014/0172708 A1) discloses systems and methods for conducting reliable financial transactions, credit decisions, and security assessments are provided. Connectivity values may be assigned to members of a community by users, third parties, or automatically based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation within the network community, or the degree of trust. Information about a financial transaction may be automatically published to other qualifying members of the community based on connectivity values.
However, none of the above reference either alone or in a combination the corresponding structural tree comprises a plurality of layers represents a transaction value to be provided by one of the plurality of providing entities, wherein the plurality of nodes in intermediate layers of the plurality of layers represents one or more transaction preference from the second plurality of entity of the plurality nodes, wherein each node of the plurality layers represents one or more transactions preferences form the second plurality of entity parameter of the plurality of providing entities, wherein a top layer of the plurality of layers comprises a single node representing a transaction token configure to enable the transaction between the at least one providing entity and the receiving entity, and wherein the matching comprises: identify at least one node of the fist set of noes and at least one second node of the scone set of noes associated with a representation matching each of the one or more entity parameters of the first plurlity of entity parameters to provide a plurality of matching nodes ; activating links between the plurlity of matching nodes and the single nodes of the third to identify an unbroken link between at least one node in the bottom layer to the single node in the top layer through nodes in the top layer through nodes in the intermediate layers; and selecting a providing entity related to the at least one node to be the at least one providing entity for enabling the transaction, automatically enabling, by a transaction enable module of the computer system, the transaction from the at least one providing entity to the receiving entity based on the matching, wherein enabling the transaction comprises establishing a connection separate from the communication network between a first bank associated with the at least one providing entity and a second bank associated with the receiving entity to provision a transaction amount from the at least one providing entity to the receiving entity.
Response to Arguments
Applicant's arguments of 35 U.S.C 101 rejection with respect to claims 1-20 filed 27 February 2026 have been fully considered but they are not persuasive. Applicants’ arguments of (A) the claims are not “directed to” an abstract idea is not persuasive. The amended steps is directed to an abstract idea under the categories of certain Method of Organizing Human Activity (commercial transactions, managing rules) or Mathematical Concepts/Mental Process (data organization, tree matching. ) .
The claims are directed to an abstract idea of falling under one or more recognized categories:
Certain Methods of Organizing Human Activity: Managing commercial transactions, banking, and balancing financial accounts (e.g., matching a "providing entity" and "receiving entity" using "amounts of money" or "transaction tokens").
Certain Fundamental Economic Practices: The elements tracking "transaction values," "amounts of money," and identifying "providing entities for enabling the transaction" are commercial/financial clearing processes, which courts traditionally label as abstract
Mathematical Concepts or Mental Processes: Generating a "structural tree" (a hierarchical data structure) and "matching" parameters can be construed as fundamental mathematical or logical relationships that could theoretically be performed in the human mind or with pen and paper.
Furthermore, claims do not add "significantly more" to the abstract idea because the elements simply invoke generic computer functions. They will argue that modules like a "transaction rules generation module" or an "entity parameters matching module" are just functional labels for a standard computer processor performing routine data manipulation (storing, filtering, and indexing data).
Meanwhile, the examiner submits the software modules ("entity parameter extraction module," "transaction rules generation module," "entity parameters matching module") are generic functional computer components. If the modules merely automate the abstract commercial transaction via generic data structures (the tree), the abstract idea has not been integrated into a practical application.
In conclusion, executing financial transaction matching using conventional computer processing logic does not provide "something more" to transform the claim into patent-eligible subject matter.
Applicant’s arguments of the claims are not directed to a practical application improved techniques for automatically enabling a transaction between a providing entity and receiving entity via a connection between a first bank…. The improvements are realized by, for example receiving a first plurlity of entity parameters for each a plurality of receiving entities over a communication network… is not persuasive. The claims are directed to an abstract idea, specifically falling under the category of fundamental economic practices or certain methods of organizing human activity (specifically, managing financial transactions or routing money between banking institutions). Merely automating a transaction or matching data on a computer system using generic modules (transaction enable module) does not escape the abstract idea classification. In order to integrated into a practical application. The claims must contain a highly specific physical/technical limitation establishing a connection separate from the communication network or internet connection between a first bank... and a second bank..."
Furthermore, the "Generic Computer Functions" of "matching" data and "automatically enabling" actions via software modules are routine, conventional, and generic computer functions that do not provide an inventive concept.
The steps of "activating links," "identifying an unbroken link," and "selecting a providing entity" are viewed as data manipulation, logic processing, or a method of organizing business transactions. Because the claim describes what the system does conceptually rather than a specific physical solution, it is categorized as an abstract mathematical or logical concept.
Futher, the claim relies on generic computer logic ("identifying," "activating," "selecting"). It does not state how the computer is fundamentally altered or improved to do this. Simply using a multi-layer node graph to automate a transaction is seen as conventional computer automation.
Applicant further argued that management of transaction between receiving entity and providing entity is improved by the unique and un conventional combination of steps and the user of multiple, separate communication network and the applicant paragraphs [0003],[0004], [0055], [0064, -[0065] and [0074]. None of these paragraphs provides a detail the specific, unconventional steps the computer takes to create this separate channel other than facilitating a transaction between two entities which is considered a "fundamental economic practice”. The claims and the paragraphs focus on the result (connecting two banks to move funds) rather than the specific technical implementation (how the connection is physically established). The "Providing Entity" / "Receiving Entity": These terms describe the participants in a transaction, not a technical improvement to computer functionality.
Furthermore, the additional limitation of a generic computer implementation: The claim recites generic computer components, such as a "request reception module" and "entity parameters matching module." The Supreme Court has repeatedly held that merely implementing an abstract idea on a generic computer is not sufficient to satisfy the "inventive concept" requirement.
Thus, the 35 U.S.C 101 rejection with respect to claims 1, 3-8, 10-15 and 17-23 is maintained.
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 SABA DAGNEW whose telephone number is (571)270-3271. The examiner can normally be reached 9-6:45.
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, Waseem Ashraf can be reached at (571) 270 -3948. 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.
/SABA DAGNEW/Primary Examiner, Art Unit 3621
Prosecution Insights