CTFR 18/802,296 CTFR 90852 DETAILED ACTION 07-03-aia AIA 15-10-aia The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA. This action is in reply to the communications filed on February 4, 2026. The Applicant’s Amendment and Request for Reconsideration has been received and entered. Claims 1, 4-8, 12-15, and 18-20 are pending and have been examined in this application. Claims 1, 4, 8, and 15 have been amended. Claims 2, 3, 9-11, 16 and 17 have been cancelled. Response to Arguments Applicant’s amendments necessitated the new grounds of rejection. Regarding the rejection of claims 1, 4-8, 12-15, and 18-20 under 35 USC 101, Applicant’s arguments have been fully considered but they are not persuasive for the reasons set forth infra . The Examiner respectfully argues that while AI types and natural language processing are recited, these limitations are recited at a high level of generality and thus does not amount to significantly more. Applicant’s remaining arguments have been fully considered but they are not persuasive. Particularly, Applicant’s arguments are directed to the instantly amended claims, and are thus moot in view of the new grounds of rejection. Claim Rejections - 35 USC § 101 07-04-01 AIA 07-04 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-8, 12-15, and 18-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter. Step 1. When considering subject matter eligibility under 35 U.S.C. 101, it must be determined whether the claim is directed to one of the four statutory categories of invention, i.e., process, machine, manufacture, or composition of matter. Step 2A – Prong One. If the claims fall within one of the statutory categories, it must then be determined whether the claims recite an abstract idea, law of nature, or natural phenomenon. Step 2A – Prong Two. If the claims recite an abstract idea, law of nature, or natural phenomenon, it must then be determined whether the claims recite additional elements that integrate the judicial exception into a practical application. If the claims do not recite additional elements that integrate the judicial exception into a practical application, then the claims are directed to a judicial exception. Step 2B. If the claims are directed to a judicial exception, it must be evaluated whether the claims recite additional elements that amount to an inventive concept (i.e. “significantly more”) than the recited judicial exception. In the instant case, claims 1 and 4-7 are directed to a process; claims 8 and 12-14 are directed to a process; and claims 15 and 18-20 are directed to a manufacture. A claim “recites” an abstract idea if there are identifiable limitations that fall within at least one of the groupings of abstract ideas enumerated in MPEP 2106. In the instant case, claim 1, and similarly claims 8 and 15, recites the steps of: obtaining prerequisite information related to an transaction, wherein the prerequisite information includes real-time market data, pricing trends and product availability; analyzing the prerequisite information using advance data analytic and algorithms to generate analyzed information responsive to market trends and demand patterns related to the transaction; conducting a negotiation between a plurality of buyers and a plurality of sellers using a algorithm to generate negotiated terms between potential buyer-seller pairs, wherein conducting a negotiation includes generating a negotiation strategy, including initial offer parameters, response tactics, and concession rates using game theory principles to anticipate potential party responses, and wherein generating the negotiation strategy further includes engaging in a negotiation dialogue between the potential eCommerce buyer-seller pairs using natural language and semantic analysis, wherein the negotiation dialogue includes responses, counter-offers, and concessions between the potential eCommerce buyer-seller pairs, and adjusting the negotiation dialogue in real-time based on market changes; and matching an buyer with an seller based on a requirement of the buyer, an offering of the seller, and the negotiated terms -- these claim limitations set forth certain methods of organizing human activity, particularly commercial and legal interactions including agreements in the form of contracts and advertising, marketing, and sales activities/behaviors. Additionally, these steps set forth mental processes, particularly concepts performed in the human mind or by a human using a pen and paper, including, inter alia , the observation and evaluation of information. Further, the limitations of the claims are not indicative of integration into a practical application. Taking the independent claim elements separately, the additional elements of performing the steps via eCommerce, machine learning algorithms, predictive models, simulated negotiation dialogue including simulated responses, and natural language processing -- merely implement the abstract idea on a computer environment. The dependent claims do not recite further additional elements. Considered in combination, the steps of Applicant’s method add nothing that is not already present when the steps are considered separately. Thus, claims 1, 4-8, 12-15, and 18-20 are directed to an abstract idea. Regarding the independent claims, the technical elements of performing the steps via eCommerce, machine learning algorithms, predictive models, simulated negotiation dialogue including simulated responses, and natural language processing merely implement the abstract idea on a computer environment. Additionally, the dependent claims do not recite further technical elements. When considering the elements and combinations of elements, the claim(s) as a whole, do not amount to significantly more than the abstract idea itself. This is because the claims do not amount to an improvement to another technology or technical field; the claims do not amount to an improvement to the functioning of a computer itself; the claims do not move beyond a general link of the use of an abstract idea to a particular technological environment; the claims merely amounts to the application or instructions to apply the abstract idea on a computer; or the claims amounts to nothing more than requiring a generic computer to perform generic computer functions that are well-understood, routine and conventional activities previously known to the industry. The analysis above applies to all statutory categories of invention. Accordingly, claims 1, 4-8, 12-15, and 18-20 are rejected as ineligible for patenting under 35 USC 101 based upon the same rationale. Claim Rejections - 35 USC § 102 07-06 AIA 15-10-15 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis 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. 07-07-aia AIA 07-07 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – 07-12-aia AIA (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. 07-15-03-aia AIA Claims 1, 4, 8, 15, and 1 8 are rejected un der 35 U.S.C. 102(a)(2) as being anticipate d by Krasadak is (US PGP 2017/0287038). As per claim 1 , Krasadakis teaches [a] method for Autonomous Facilitation of Procurement Negotiation and Transaction in an eCommerce Environment, the method comprising: obtaining prerequisite information related to an eCommerce transaction, wherein the prerequisite information includes real-time market data, pricing trends and product availability; ( Krasadakis : Fig. 6 (604, 606, 608); Fig. 7 (732, 734, 736); [0089]-[0090] (The seller AI negotiator 208 retrieves and loads product definition information (either from a product catalog, online source, manual entry by the seller 174, a combination thereof, or some other source), inventory stock-availability information, sales targets (e.g., quantity to sell in a sales timeframe), profitability margins, and seller parameter elasticity, as shown at 604. The seller AI negotiator 208 scans the marketplace to perform a “demand analysis” for the product from the market data (e.g., based on any one or combination of the product data 212, pricing data 214, trends and social data 216, supply-and-demand data 218, and industry news 220 in the database cluster 204) and predicts the market viability selling potential for specific products and alternatives thereof. For example, a seller 174 of vehicles may notice that the price of a particular sport utility vehicle (SUV) is decreasing due to increased gasoline prices; whereas, a more fuel-efficient model (e.g., electric, hybrid, etc.) of the same SUV may be selling much faster due to the uptick in gasoline prices. This fuel-efficient model may be identified as a high-demand product to be selling in the current environment by the seller AI negotiator 208. Along these same lines, sales patterns and trend data on specific products and categories of products may be loaded to aid in shaping the demand analysis picture, as shown at 608.)) analyzing the prerequisite information using advance data analytic and machine learning algorithms to generate analyzed information responsive to eCommerce market trends and demand patterns related to the eCommerce transaction; ( Krasadakis : Fig. 6 (608, 610); [0089]-[0091](The seller AI negotiator 208 scans the marketplace to perform a “demand analysis” for the product from the market data (e.g., based on any one or combination of the product data 212, pricing data 214, trends and social data 216, supply-and-demand data 218, and industry news 220 in the database cluster 204) and predicts the market viability selling potential for specific products and alternatives thereof. For example, a seller 174 of vehicles may notice that the price of a particular sport utility vehicle (SUV) is decreasing due to increased gasoline prices; whereas, a more fuel-efficient model (e.g., electric, hybrid, etc.) of the same SUV may be selling much faster due to the uptick in gasoline prices. This fuel-efficient model may be identified as a high-demand product to be selling in the current environment by the seller AI negotiator 208. Along these same lines, sales patterns and trend data on specific products and categories of products may be loaded to aid in shaping the demand analysis picture, as shown at 608. Product in industry news, user reviews, price statistics, and the like about the products—and alternative products—for sale by the retailer 174 may be automatically analyzed for a given sales campaign, as shown at 610. Based on the news, user reviews, and price statistics, an effective campaign execution timeframe is estimated. Additional or alternative criteria may be used in this estimation. For instance, product specifications, social media, online sources, industry news (e.g., Tesla announces a new production line with capacity of 1000 model S cars per month to service the Brazilian, Irish, and German markets), and any other market or buyer/seller parameter described herein may be used to estimate the sales campaign timeframe.)) conducting a negotiation between a plurality of eCommerce buyers and a plurality of eCommerce sellers using a machine learning algorithm to generate negotiated terms between potential eCommerce buyer-seller pairs; and ( Krasadakis : Fig. 6 (620-632); [0092]-[0094] (For each specific matching buying plan identified in the active buyer AI negotiators 206, the seller AI negotiator 208 identifies an offer price—as well as other offering terms (e.g., delivery, specification, etc.)—and prepares an adapted and negotiate offer for a (or multiple) buyer AI negotiator(s) 206, as shown at 620. The offer may then be submitted to the buyer AI negotiator 08, as shown at 622, to which the buyer AI negotiator 206 may accept, discard, or counter the or ask for a re-negotiation or new iteration based, possibly, on a specific ask (e.g., price, delivery method, etc.) from the seller 174. If the buyer AI negotiator 206 rejects the offer, work flow 600 repeats steps 620-622 to come up with a new offer, taking into account the recent rejection. In some examples, this portion (i.e., 620-624) of work flow 600 may be repeated until the buyer AI negotiator 206 accepts an offer from the seller AI negotiator 208, as shown by the NO pathway from decision box 624.)), wherein conducting a negotiation includes generating a negotiation strategy, including initial offer parameters, response tactics, and concession rates using game theory principles and predictive models to anticipate potential party responses, and wherein generating the negotiation strategy further includes engaging in a simulated negotiation dialogue between the potential eCommerce buyer-seller pairs using natural language processing and semantic analysis, wherein the simulated negotiation dialogue includes simulated responses, counter-offers, and concessions between the potential eCommerce buyer-seller pairs, and adjusting the simulated negotiation dialogue in real-time based on market changes; ( Krasadakis : [0092]-[0093] (The seller AI negotiators 208 may also have access to active product price statistics including competition pricing, offers and related insights of the specific and alternative products, either from previous sales of the seller 174, other seller AI negotiators 208, or buyer AI negotiators 206. The seller AI negotiator 208 analyzes active product price statistics from valid offers submitted to buyer AI negotiators 206, as shown at 616. The seller AI negotiator 208 also estimates price elasticity for the specific product being sold by the seller 174 based on the trends, sales statistics, profit margins, buying plan parameters, and the running performance of the sales campaign (e.g., how many products have sold and in what timeframe), as shown at 618. For each specific matching buying plan identified in the active buyer AI negotiators 206, the seller AI negotiator 208 identifies an offer price—as well as other offering terms (e.g., delivery, specification, etc.)—and prepares an adapted and negotiate offer for a (or multiple) buyer AI negotiator(s) 206, as shown at 620. The offer may then be submitted to the buyer AI negotiator 08, as shown at 622, to which the buyer AI negotiator 206 may accept, discard, or counter the or ask for a re-negotiation or new iteration based, possibly, on a specific ask (e.g., price, delivery method, etc.) from the seller 174. If the buyer AI negotiator 206 rejects the offer, work flow 600 repeats steps 620-622 to come up with a new offer, taking into account the recent rejection. In some examples, this portion (i.e., 620-624) of work flow 600 may be repeated until the buyer AI negotiator 206 accepts an offer from the seller AI negotiator 208, as shown by the NO pathway from decision box 624.); [0026]; [0042]-[0047]; [0057]-[0058]; [0124] (Machine learning, natural language processing, data mining, statistical modeling, predictive modeling, deep learning, neural networks, and game theory components may be implemented); Figs. 3-4; [0078]-[0081]; [0067] (Similarly, the seller AI negotiators 206 may dynamically adjust product deal terms for a product based on the negotiated or offered terms of multiple buyer AI negotiators 206. For example, if multiple buyer AI negotiators 206 are offering the same price for a product, and the overall response from the seller AI negotiators 208 proves to be smaller than expected implying limited supply for the product at this price, a new seller AI negotiator 210 may raise the starting price of the product and then start negotiation sessions with buyer AI negotiators 206 to determine which ones want the product as the new market-adjusted price. In the same example, existing seller AI negotiators 208 may increase the price based on the same signals, and request the engaged Buyer AI agents to approve it. This multi-stage negotiation session may occur with any of the selling parameters and may be based on the level of interest in products at certain deal parameters, the market conditions, or a combination thereof.); [0028]; [0049]; [0064]-[0068]) matching an eCommerce buyer with an eCommerce seller based on a requirement of the eCommerce buyer, an offering of the eCommerce seller, and the negotiated terms. ( Krasadakis : Fig. 6 (620-632); [0092]-[0094] (In some examples, the seller AI negotiator 208 on the application server 202 scans for active buyers 124 by scanning for associated buyer AI negotiators 206 that are attempting to negotiate buyer plans requesting the same or similar products than those offered by the seller 174, as shown at 614. . . . For each specific matching buying plan identified in the active buyer AI negotiators 206, the seller AI negotiator 208 identifies an offer price—as well as other offering terms (e.g., delivery, specification, etc.)—and prepares an adapted and negotiate offer for a (or multiple) buyer AI negotiator(s) 206, as shown at 620. The offer may then be submitted to the buyer AI negotiator 08, as shown at 622, to which the buyer AI negotiator 206 may accept, discard, or counter the or ask for a re-negotiation or new iteration based, possibly, on a specific ask (e.g., price, delivery method, etc.) from the seller 174. . . . If the seller 174 accepts the offer, a purchase order for the product may be created, as shown at 632, or a link to a checkout web page, including the identifiers mentioned above, or a coupon or other way to summarize the negotiated offer agreement in a claim ticket.)) As per claim 4 , Krasadakis teaches wherein the eCommerce buyer is matched with the eCommerce seller based on an agreement being reached during the simulated negotiation dialogue ( Krasadakis : Fig. 6 (620-632); [0092]-[0094] (In some examples, the seller AI negotiator 208 on the application server 202 scans for active buyers 124 by scanning for associated buyer AI negotiators 206 that are attempting to negotiate buyer plans requesting the same or similar products than those offered by the seller 174, as shown at 614. . . . For each specific matching buying plan identified in the active buyer AI negotiators 206, the seller AI negotiator 208 identifies an offer price—as well as other offering terms (e.g., delivery, specification, etc.)—and prepares an adapted and negotiate offer for a (or multiple) buyer AI negotiator(s) 206, as shown at 620. The offer may then be submitted to the buyer AI negotiator 08, as shown at 622, to which the buyer AI negotiator 206 may accept, discard, or counter the or ask for a re-negotiation or new iteration based, possibly, on a specific ask (e.g., price, delivery method, etc.) from the seller 174. . . . If the seller 174 accepts the offer, a purchase order for the product may be created, as shown at 632, or a link to a checkout web page, including the identifiers mentioned above, or a coupon or other way to summarize the negotiated offer agreement in a claim ticket.); [0064]-[0068]) As per claim 8 , this claim is substantially similar to claim 1 and is therefore rejected in the same manner as this claim, as set forth above. Additionally, claim 8 recites wherein the eCommerce buyer is matched with the eCommerce seller based on an agreement being reached during the simulated negotiation dialogue. ( Krasadakis : Fig. 6 (620-632); [0092]-[0094]; [0026]; [0042]-[0049]; [0057]-[0058]; [0124]; Figs. 3-4; [0078]-[0081]; [0028]; [0064]-[0068]) As per claims 15 and 18 , these claims are substantially similar to claims 8 and 4, respectively, and are therefore rejected in the same manner as these claims, as set forth above . Claim Rejections - 35 USC § 103 07-06 AIA 15-10-15 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis 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. 07-20-aia AIA The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. 07-21-aia AIA Claims 5, 7, 12, 14, and 19 are rej ected under 35 U.S.C. 103 as being unpatentable over Kra sadakis in view of Carstens (US PGP 2018/0197128). As p er claim 5 , Krasadakis teaches wherein matching the eCommerce buyer with the eCommerce seller includes . . . connecting potential supply relationships along a supply network with the eCommerce buyer and the eCommerce seller, wherein the links are based on the requirements of the eCommerce buyer and an ability of the eCommerce seller to meet the requirements of the eCommerce buyer. ( Krasadakis : Fig. 6 (620-632); [0092]-[0094] (In some examples, the seller AI negotiator 208 on the application server 202 scans for active buyers 124 by scanning for associated buyer AI negotiators 206 that are attempting to negotiate buyer plans requesting the same or similar products than those offered by the seller 174, as shown at 614. . . . For each specific matching buying plan identified in the active buyer AI negotiators 206, the seller AI negotiator 208 identifies an offer price—as well as other offering terms (e.g., delivery, specification, etc.)—and prepares an adapted and negotiate offer for a (or multiple) buyer AI negotiator(s) 206, as shown at 620. The offer may then be submitted to the buyer AI negotiator 08, as shown at 622, to which the buyer AI negotiator 206 may accept, discard, or counter the or ask for a re-negotiation or new iteration based, possibly, on a specific ask (e.g., price, delivery method, etc.) from the seller 174. . . . If the seller 174 accepts the offer, a purchase order for the product may be created, as shown at 632, or a link to a checkout web page, including the identifiers mentioned above, or a coupon or other way to summarize the negotiated offer agreement in a claim ticket.); [0060]-[0068]( Negotiations between the buyer AI negotiators 206 and the seller AI negotiators 208 may be on matching what the buyers 124 plan to buy and what the sellers 174 plan to sell, taking into consideration the elasticity defined in both sides (e.g., specification, delivery, price, product information, etc.), the state of the market for the product, and in reference to the strategic goals or objectives of buyers or sellers (e.g., when the AI negotiators are looking to meet shared buying or selling targets). . . . In some examples, the buyers 124 and/or sellers 174 are presented with the deal parameters of negotiated offers for final acceptance. Alternatively, the buyer AI negotiator 206 and the seller AI negotiator 208 may be given autonomy to execute buying and selling on behalf of the buyer 124 and seller 174, respectively. To illustrate this latter scenario, a seller 174 may set a seller AI negotiator 208 to obtain at least a given profit margin on a particular product, given a cost of goods figure, for a set inventory of the product and may sell all of the inventory without seller 174 intervention, or may maximize, according to the strategy, the profit margin across a range of products within the same period; the volume of products sold; or combination thereof, including different targets for different products served by different seller AI negotiators 208. Likewise, the buyer 124 may, through his/her buying plan, set a buyer AI negotiator to purchase a particular product within a certain price so long as some mandatory product features (e.g., memory quantity, year/make of car, etc.) are included.)) Krasadakis does not explicitly disclose the following known technique which is taught by Carstens : . . . generating a knowledge graph containing links connecting potential supply relationships along a supply network with the eCommerce buyer and the eCommerce seller . . . ( Carstens : [0025]-[0026] (wherein each edge represents a directed supply relationship pointing from a supplier to a customer and directly relates items stored in the graph database; wherein the supply relations data is at least in part derived from a set of source data in electronic form and representing textual content comprising potential relation and risk phrases and/or numeric data; a risk scoring module adapted to access the first data set from the graph database, generate a set of scores related to the first data set, and store the set of scores in the graph database, wherein the risk scoring module generates the set of scores using both direct and transitive risk propagation along a plurality of nodes; and a supply graph generator adapted to access the first data set and the set of scores stored in the graph database and generate for presentation at a remote user computing device a directed graph comprising a plurality of interconnected nodes and edges representing a network of supply chain related entities.); [0016] (We represent relations between companies as a graph, where companies are represented as nodes and supply relations as directed edges, pointing from a supplier to a customer (or consignee). Not only does this allow us to interpret relations between companies in a formally defined manner, but it additionally provides the opportunity to investigate links between companies beyond their first-tier suppliers and customers. More specifically, we use this graph to identify peers of a company within its supply chain that are not only particularly relevant, but that are also exposed to certain risks and thus increase the potential for supply chain disruptions. Our graph-based model captures the connectedness of the supplier-consignee supply chain ecosystem in conjunction with the strength of the relationships and the risk exposure of each company entity, which transitively affects potentially large parts of the graph.)) This known technique is applicable to the method of Krasadakis as they both share characteristics and capabilities, namely, they are directed to determining ability of sellers to meet buyer requirements. One of ordinary skill in the art at the time of filing would have recognized that applying the known technique of Carstens would have yielded predictable results and resulted in an improved method. It would have been recognized that applying the technique of Carstens to the teachings of Krasadakis would have yielded predictable results because the level of ordinary skill in the art demonstrated by the references applied shows the ability to incorporate such knowledge graph features into similar methods. Further, applying the generating a knowledge graph containing links to the matching of Krasadakis would have been recognized by those of ordinary skill in the art as resulting in an improved method that would allow identification and mitigation of supply chain risk. ( Carstens : [0013]) As per claim 7 , Krasadakis/Carstens teaches wherein the data is analyzed to assess supply risks, generate alternative actions in case of supply chain disruptions and to trace demand from an end user to a source of product materials and components. ( Carstens : [0016]; [0021] (The present invention may be incorporated into an Enterprise Content Platform (ECP) that combines risk mining and supply chain graph information in a single database. This will provide supply chain risk mined from textual sources, and may include the results of risk mining using an SVP. The present invention may also be used as a component for event extraction application for detecting supply chain disruptions (e.g. Floods, explosions). The present invention may also be used in risk mining to automatically identify risks relating to suppliers in a supply chain.); [0025]; [0105] (A risk scoring module accesses supply relations data from the graph database at step 312, generates a set of scores related to the supply relations data at step 314, and stores the set of scores in the graph database at step 316. As shown in this example at step 315, the risk scoring module generates the set of scores using both direct and transitive risk propagation along a plurality of nodes.); [0045]; [0070]-[0078] (Scoring Method—The graph database described above facilitates the analysis of supply relations between companies within the context of a larger network. We now describe how we use the graph database to identify relevant suppliers of a customer through multiple tiers of the supply graph and score them according to two metrics, (1) importance and (2) risk. Importance, described in detail immediately below, scores suppliers of a company based on a combination of metrics, incorporating both the structure of the graph and the supplier's position in it, and attributes of the supplier itself. With it we aim to quantify the adverse impact that a disruption to the supply, e.g., of key components or materials, from a specific supplier would have on a specific customer. In this example, a high importance, e.g., a score close to 1, reflects a high potential adverse impact. Risk, described further below, is scored, for example, according the credit risk scores assigned to each company in the graph. . . . Replaceability (b): Represents a function of suppliers in the same business sector as sm, e.g., the sum of how many suppliers s operate in the same business sector (sϵS) as sm (based on TRBC codes): b=1−(Replaceability/(n−1)).); [0110] (For a given customer c having an associated nodec and having an identified set of suppliers s={s0, . . . sn} each having an associated node, the risk scoring module 124 may be further adapted to generate a set of risk scores R={r0, . . . rn} and a set of importance scores I={i0, . . . , in}. Each risk score rmϵR may be based on a single attribute of a node in the graph G, the single attribute representing, for example, a credit risk associated with supplier m. Each importance score im ϵ I may be an aggregate of a plurality of measures including, for example, at least two of the following measures: criticality; replaceability; centrality; and distance. Criticality may be a function of a proportion of goods, materials, commodities or other things received in business sector q associated with target company c as supplied from suppliers s={s0, . . . sn} operating in identified business sector associated with such suppliers s. Replaceability may be a function of the sum of the number of suppliers sϵ S that operate in the same business sector as sm.); Fig. 7; [0117]-[0120]) The motivation for applying the known techniques of Carstens to the teachings of Krasadakis is the same as that set forth above, in the rejection of Claim 5. As per claims 12 and 14 , these claims are substantially similar to claims 5 and 7, respectively, and are therefore rejected in the same manner as these claims, as set forth above. As per claim 19 , this claim is substantially similar to claim 5 and is therefore rejected in the same manner as this claim, as set forth above . 07-21-aia AIA Claim s 6, 13, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Krasadakis/Carstens in view of Riggs (US PGP 2005/0091100) . As per claim 6 , Krasadakis/Carstens teaches wherein vertices of the knowledge graph are augmented with data related to links between the potential supply relationships, wherein the data is updated in real-time . . . ( Carstens : [0016] (We represent relations between companies as a graph, where companies are represented as nodes and supply relations as directed edges, pointing from a supplier to a customer (or consignee). Not only does this allow us to interpret relations between companies in a formally defined manner, but it additionally provides the opportunity to investigate links between companies beyond their first-tier suppliers and customers. More specifically, we use this graph to identify peers of a company within its supply chain that are not only particularly relevant, but that are also exposed to certain risks and thus increase the potential for supply chain disruptions. Our graph-based model captures the connectedness of the supplier-consignee supply chain ecosystem in conjunction with the strength of the relationships and the risk exposure of each company entity, which transitively affects potentially large parts of the graph.); [0025]-[0026]; [0070]-[0076]; Fig. 7; [0116]-[0120] (Now with reference to FIG. 7, an exemplary risk mapping 700 is provided comprised of supply risk mapping 702 for company C01 704 and supply risk mapping 706 for company C 02 708. The mappings of FIG. 7 illustrate the propagation of risk from node-to-node as contemplated in accordance with the present invention. This mapping visualization and interface provides a user with one effective manner of conveying risk associated with a related set of suppliers as the risk propagates along tier groups.); [0089] (In one manner, the supply data source 114 may comprise continuous feeds and may be updated, e.g., in near or close to real time (e.g., about 150 ms), allowing the SRRM 100 to automatically analyze content, update data based on “new” content in close to real-time, i.e., within approximately one second.)) The motivation for applying the known techniques of Carstens to the teachings of Krasadakis is the same as that set forth above, in the rejection of Claim 5. Krasadakis/Carstens do not explicitly disclose the following known technique which is taught by Riggs : . . .and includes transport cost, capacity, time, regulatory issues, and tariffs. ( Riggs : [0054] (landed cost); [0053] (Routes, rates and transit times); [0087] (regulation data); [0091] (compliance regulations); [0097] (hazmat regulations); [0099] (regulations); [0043]-[0045] (tariffs)) This known technique is applicable to the method of Krasadakis/Carstens as they share characteristics and capabilities, namely, they are directed to data for provided products. One of ordinary skill in the art at the time of filing would have recognized that applying the known technique of Riggs would have yielded predictable results and resulted in an improved method. It would have been recognized that applying the technique of Riggs to the teachings of Krasadakis/Carstens would have yielded predictable results because the level of ordinary skill in the art demonstrated by the references applied shows the ability to incorporate such transport cost, capacity, time, regulatory issues, and tariffs data features into similar methods. Further, applying the transport cost, capacity, time, regulatory issues, and tariffs to the data of Krasadakis/Carstens would have been recognized by those of ordinary skill in the art as resulting in an improved method that would allow for full logistics supply chain capability, providing advantages in circumstances where goods are transported across multiple modes leverage, and identifies differences between rates and negotiate intermediate rates which benefit all parties concerned by virtue of the various information available from the transport business interests ( Riggs : [0005]-[0010], [0023], [0024]). As per claim 13 , this claim is substantially similar to claim 6 and is therefore rejected in the same manner as this claim, as set forth above. As per claim 20 , this claim is substantially similar to the limitations of claims 6 and 7 and is therefore rejected in the same manner as these claims, as set forth above . Conclusion 07-96 AIA The prior art made of record and not relied upon is considered pertinent to applicant's disclosure : Klaue, Susanne, Karl Kurbel, and Iouri Loutchko . "Automated negotiation on agent-based e-marketplaces: an overview." BLED 2001 Proceedings (2001): 8. 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 JENNIFER V LEE whose telephone number is (571)272-4778. The examiner can normally be reached Monday - Friday 9AM - 5PM 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, JEFFREY A. SMITH can be reached at (571)272-6763. 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. /JENNIFER V LEE/Examiner, Art Unit 3688 /Jeffrey A. Smith/Supervisory Patent Examiner, Art Unit 3688 Application/Control Number: 18/802,296 Page 2 Art Unit: 3688 Application/Control Number: 18/802,296 Page 3 Art Unit: 3688 Application/Control Number: 18/802,296 Page 4 Art Unit: 3688 Application/Control Number: 18/802,296 Page 5 Art Unit: 3688 Application/Control Number: 18/802,296 Page 6 Art Unit: 3688 Application/Control Number: 18/802,296 Page 7 Art Unit: 3688 Application/Control Number: 18/802,296 Page 8 Art Unit: 3688 Application/Control Number: 18/802,296 Page 9 Art Unit: 3688 Application/Control Number: 18/802,296 Page 10 Art Unit: 3688 Application/Control Number: 18/802,296 Page 11 Art Unit: 3688 Application/Control Number: 18/802,296 Page 12 Art Unit: 3688 Application/Control Number: 18/802,296 Page 13 Art Unit: 3688 Application/Control Number: 18/802,296 Page 14 Art Unit: 3688 Application/Control Number: 18/802,296 Page 15 Art Unit: 3688 Application/Control Number: 18/802,296 Page 16 Art Unit: 3688 Application/Control Number: 18/802,296 Page 17 Art Unit: 3688 Application/Control Number: 18/802,296 Page 18 Art Unit: 3688 Application/Control Number: 18/802,296 Page 19 Art Unit: 3688
Prosecution Insights