Prosecution Insights
Last updated: April 19, 2026
Application No. 18/606,972

SUPPLY AND INVENTORY PREDICTIONS IN SUPPLY CHAIN NETWORKS

Non-Final OA §101
Filed
Mar 15, 2024
Examiner
MITCHELL, NATHAN A
Art Unit
3627
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Noodle Analytics, Inc.
OA Round
1 (Non-Final)
73%
Grant Probability
Favorable
1-2
OA Rounds
2y 9m
To Grant
83%
With Interview

Examiner Intelligence

Grants 73% — above average
73%
Career Allow Rate
689 granted / 940 resolved
+21.3% vs TC avg
Moderate +10% lift
Without
With
+10.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
36 currently pending
Career history
976
Total Applications
across all art units

Statute-Specific Performance

§101
16.4%
-23.6% vs TC avg
§103
44.3%
+4.3% vs TC avg
§102
19.9%
-20.1% vs TC avg
§112
11.2%
-28.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 940 resolved cases

Office Action

§101
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . 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 rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Claims 1-20 recite: 1. A computer-implemented method comprising: training a Graph Neural Network (GNN) using a loss function to obtain a GNN model, the loss function configured to minimize cumulative supply prediction errors and inventory-level prediction errors; accessing data about planned shipments and planned inventory levels for nodes in a supply chain network, each planned shipment having a planned shipping date and a planned unit amount; for each shipment between nodes, calculating, utilizing the GNN model, an outgoing supply prediction comprising a probability distribution of estimated shipment dates and a probability distribution for estimated amount of units shipped; for each node in the supply chain network: aggregating results for incoming and outgoing shipments associated with the node based on the probability distribution of estimated shipment dates and the probability distribution for estimated amount of units shipped; and calculating a predicted inventory level by date at the node based on the aggregated results for incoming and outgoing shipments associated with the node; and causing presentation of updated inventory levels by date in one or more nodes. 2. The method as recited in claim 1, wherein the loss function includes a predicted cumulative daily quantity vector for the nodes in the supply chain network and an actual cumulative daily quantity vector of outgoing supply for the nodes in the supply chain network. 3. The method as recited in claim 1, wherein calculating the outgoing supply prediction comprises calculating a normalized cumulative error over a planning horizon, wherein calculating the normalized cumulative error comprises: calculating a predicted cumulative quantity vector; calculating an actual cumulative daily quantity vector; and normalizing a difference between the predicted cumulative quantity vector and the actual cumulative daily quantity vector based on an actual daily quantity. 4. The method as recited in claim 1, wherein an input to the GNN model includes planned shipment events and demand forecasting over a predefined time horizon. 5. The method as recited in claim 1, wherein the GNN model is a delta model and calculates incremental modifications to the planned shipments and planned inventory levels. 6. The method as recited in claim 1, wherein the GNN model is a horizon model that calculates shipments and inventory levels without considering the data about planned shipments and planned inventory levels. 7. The method as recited in claim 1, wherein the GNN model is a hybrid model that utilizes a delta model for a period within a planning horizon and a hybrid model for times outside the period in the planning horizon. 8. The method as recited in claim 1, wherein aggregating results for the node further comprises: calculating a cumulative predicted supply over by date; calculating a cumulative actual supply by date; and calculating a cumulative supply prediction error based on the cumulative predicted supply and the cumulative actual supply. 9. The method as recited in claim 1, wherein node features for the GNN model comprise demand information, planned shipment information, and edge-level features corresponding to shipments between two nodes. 10. The method as recited in claim 1, wherein an output of the GNN model comprises a shipment event delta probability and a shipped quantity scaler. 11. The method as recited in claim 1, further comprising: creating a directional graph for the nodes in the supply chain network, the directional graph comprising edges between nodes in the supply chain network; and creating a reverse graph of the directional graph with same nodes and features as the directional graph and with directions of edges reversed. 12. A system comprising: a memory comprising instructions; and one or more computer processors, wherein the instructions, when executed by the one or more computer processors, cause the system to perform operations comprising: training a Graph Neural Network (GNN) using a loss function to obtain a GNN model, the loss function configured to minimize cumulative supply prediction errors and inventory-level prediction errors; accessing data about planned shipments and planned inventory levels for nodes in a supply chain network, each planned shipment having a planned shipping date and a planned unit amount; for each shipment between nodes, calculating, utilizing the GNN model, an outgoing supply prediction comprising a probability distribution of estimated shipment dates and a probability distribution for estimated amount of units shipped; for each node in the supply chain network: aggregating results for incoming and outgoing shipments associated with the node based on the probability distribution of estimated shipment dates and the probability distribution for estimated amount of units shipped; and calculating a predicted inventory level by date at the node based on the aggregated results for incoming and outgoing shipments associated with the node; and causing presentation of updated inventory levels by date in one or more nodes. 13. The system as recited in claim 12, wherein the loss function includes a predicted cumulative daily quantity vector for the nodes in the supply chain network and an actual cumulative daily quantity vector of outgoing supply for the nodes in the supply chain network. 14. The system as recited in claim 12, wherein calculating the outgoing supply prediction comprises calculating a normalized cumulative error over a planning horizon, wherein calculating the normalized cumulative error comprises: calculating a predicted cumulative quantity vector; calculating an actual cumulative daily quantity vector; and normalizing a difference between the predicted cumulative quantity vector and the actual cumulative daily quantity vector based on an actual daily quantity. 15. The system as recited in claim 12, wherein an input to the GNN model includes planned shipment events and demand forecasting over a predefined time horizon. 16. The system as recited in claim 12, wherein the GNN model is a delta model and calculates incremental modifications to the planned shipments and planned inventory levels. 17. The system as recited in claim 12, wherein the GNN model is a horizon model that calculates shipments and inventory levels without considering the data about planned shipments and planned inventory levels. 18. A non-transitory machine-readable storage medium including instructions that, when executed by a machine, cause the machine to perform operations comprising: training a Graph Neural Network (GNN) using a loss function to obtain a GNN model, the loss function configured to minimize cumulative supply prediction errors and inventory-level prediction errors; accessing data about planned shipments and planned inventory levels for nodes in a supply chain network, each planned shipment having a planned shipping date and a planned unit amount; for each shipment between nodes, calculating, utilizing the GNN model, an outgoing supply prediction comprising a probability distribution of estimated shipment dates and a probability distribution for estimated amount of units shipped; for each node in the supply chain network: aggregating results for incoming and outgoing shipments associated with the node based on the probability distribution of estimated shipment dates and the probability distribution for estimated amount of units shipped; and calculating a predicted inventory level by date at the node based on the aggregated results for incoming and outgoing shipments associated with the node; and causing presentation of updated inventory levels by date in one or more nodes. 19. The non-transitory machine-readable storage medium as recited in claim 18, wherein the loss function includes a predicted cumulative daily quantity vector for the nodes in the supply chain network and an actual cumulative daily quantity vector of outgoing supply for the nodes in the supply chain network. 20. The non-transitory machine-readable storage medium as recited in claim 18, wherein calculating the outgoing supply prediction comprises calculating a normalized cumulative error over a planning horizon, wherein calculating the normalized cumulative error comprises: calculating a predicted cumulative quantity vector; calculating an actual cumulative daily quantity vector; and normalizing a difference between the predicted cumulative quantity vector and the actual cumulative daily quantity vector based on an actual daily quantity. All claims recite subject matter falling within one of the four categories of invention (Step 1). Claims 1-20 but for the recitation of the underlined additional elements recite mathematical concepts in the form of mathematical calculations and mathematical relationships. Per MPEP 2106.04(a)(2)(I), mathematical concepts are an abstract idea. Thus claims 1-20 recite an abstract idea (Step 2A_1). The computer-related additional elements (computer, processor(s), memory, instructions, system) are recited at a high level of generality such that they amount to mere instructions to implement an abstract idea, which per MPEP 2106.05(f) means they do not provide a practical application or significantly more. Regarding causing presentation of an output, this amounts to data output, which per MPEP 2106.05(g) is extra-solution activity which does not provide a practical application or significantly more. Data output is also regarded as not significantly more because it is well understood and conventional activity. See MPEP 2106.05(d) citing OIP Techs., 788 F.3d at 1362-63, 115 USPQ2d at 1092-93. Thus claims 1-20 are considered to be directed to an abstract idea without a practical application or significantly more (Step 2A_2 and Step 2B) and are ineligible. Prior Art Status Claims 1-20 are considered to distinguish over the cited art. Melancon (US 20250225474 A1) discloses a system that makes predictions about inventory levels (paragraph 15). Boffo (US 20240095667 A1) discloses a system that analyzes inventory levels, incoming/outgoing shipments to make future inventory predictions (paragraph 55). Borjian (US 20230297948 A1) discloses a system for determining inventory replenishment strategies using machine learning (abstract). Miao (CN 116341752 A) discloses making supply chain predictions using a graph neural network (abstract). Cote (US 20210374632 A1) discloses making supply chain predictions using machine learning. Ohlsson (US 20200143313 A1) discloses using machine learning to make predictions regarding inventory. Leidner (US 10262283 B2) discloses using graphs to represent a supply chain. None of the cited art discloses all of the claimed subject matter as specified in claims 1+, 12+ and 18+. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to NATHAN A MITCHELL whose telephone number is (571)270-3117. The examiner can normally be reached M-F 9-5. 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, Ryan Zeender can be reached at 571-272-6790. 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. /NATHAN A MITCHELL/ Primary Examiner, Art Unit 3627
Read full office action

Prosecution Timeline

Mar 15, 2024
Application Filed
Sep 23, 2025
Non-Final Rejection — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602677
SALES TRANSACTION PROCESSING SYSTEM, SALES TRANSACTION PROCESSING APPARATUS, AND METHOD PERFORMED BY SALES TRANSACTION PROCESSING APPARATUS
2y 5m to grant Granted Apr 14, 2026
Patent 12597007
SELF-SERVICE CHECKOUT TERMINAL WITH A SECURITY FUNCTION BASED ON DETECTION OF WEIGHT OF ITEMS
2y 5m to grant Granted Apr 07, 2026
Patent 12591774
ORDERING INFRASTRUCTURE USING APPLICATION TERMS
2y 5m to grant Granted Mar 31, 2026
Patent 12579529
Measurement Information Processing Mode Switching System
2y 5m to grant Granted Mar 17, 2026
Patent 12579591
Artificial Intelligence for Vehicular Drive-Through Based Exchanges
2y 5m to grant Granted Mar 17, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
73%
Grant Probability
83%
With Interview (+10.1%)
2y 9m
Median Time to Grant
Low
PTA Risk
Based on 940 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month