Prosecution Insights
Last updated: April 19, 2026
Application No. 18/297,964

SYSTEMS AND METHODS FOR DESTINATION OBJECT CONSOLIDATION

Final Rejection §101
Filed
Apr 10, 2023
Examiner
LEE, PO HAN
Art Unit
3623
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
The Eighth Notch Inc.
OA Round
2 (Final)
32%
Grant Probability
At Risk
3-4
OA Rounds
3y 6m
To Grant
74%
With Interview

Examiner Intelligence

Grants only 32% of cases
32%
Career Allow Rate
51 granted / 158 resolved
-19.7% vs TC avg
Strong +41% interview lift
Without
With
+41.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 6m
Avg Prosecution
50 currently pending
Career history
208
Total Applications
across all art units

Statute-Specific Performance

§101
40.9%
+0.9% vs TC avg
§103
31.3%
-8.7% vs TC avg
§102
11.4%
-28.6% vs TC avg
§112
14.8%
-25.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 158 resolved cases

Office Action

§101
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 . DETAILED ACTION Status of the Application The following is a Final Office Action. In response to Examiner's communication of 4/3/2025, Applicant responded on 10/2/2025. Amended claims 1, 3, 5-6, 8, 10, 12-13, 15, 17, and 19-20. Claims 1-21 are pending in this application and have been examined. Response to Amendment Applicant's amendments to claims 1, 3, 5-6, 8, 10, 12-13, 15, 17, and 19-20 are not sufficient to overcome the 35 USC 101 rejections set forth in the previous action. Applicant's amendments to claims 1, 3, 5-6, 8, 10, 12-13, 15, 17, and 19-20 are sufficient to overcome the prior art rejections set forth in the previous action. The prior art rejections are hereby withdrawn. Response to Arguments – 35 USC § 101 Applicant’s arguments with respect to the rejections have been fully considered, but they are not persuasive. Applicant submits, “…Without addressing the propriety of the rejection in order to expedite prosecution, Claims 1, 3, 5-6, 8, 10, 12-13, 15, 17, and 19-20 have been amended as noted above. Claims 2-7 depend from Claim 1. Claims 9-14 depend from Claim 8. Claims 16-21 depend from Claim 15. Withdrawal of the rejection under 35 U.S. C. §101 is therefore respectfully requested....” The Examiner respectfully disagrees. The claims, are directed to, …consolidating shipping package objects…, which is a problem directed to organizing human activity and a mental process, as established in Step 2A Prong 1. This problem does not specifically arise in the realm of computer technology, but rather, this problem existed and was addressed long before the advent of computers. Thus, the claims do not recite a technical improvement to a technical problem or necessarily roots in computing technologies. The alleged solutions are solutions directed to solving abstract ideas, which are still abstract ideas. Additionally, pursuant to the broadest reasonable interpretation, as an ordered combination, each of the additional elements are computing elements recited at high level of generality implementing the abstract idea, and thus, are no more than applying the abstract idea with generic computer components. Further, these additional elements generally link the abstract idea to a technical environment, namely the environment of a computer, performing extra solution activities. Therefore, as a whole, the additional elements do not integrate the abstract ideas into a practical application in Step 2A Prong 2 or amount to significantly more under Step 2B. Even novel and newly discovered judicial exceptions are still exceptions, despite their novelty. July 2015 Update, p. 3; see SAP America Inc. v. Investpic, LLC, No. 2017-2081, slip op. at 2 (Fed Cir. May 15, 2018). Simply reciting specific limitations that narrow the abstract idea does not make an abstract idea non-abstract. 79 Fed. Reg. 74631; buySAFE Inc. v. Google, Inc., 765 F.3d 1350, 1355 (2014); see SAP America at p. 12. As discussed in SAP America, no matter how much of an advance the claims recite, when “the advance lies entirely in the realm of abstract ideas, with no plausibly alleged innovation in the non-abstract application realm,” “[a]n advance of that nature is ineligible for patenting.” Id. at p. 3. 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-21 is/are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter. Claim 1 (similarly 8, 15) recite, “ receiving an object request, wherein the object request is received through an …, and wherein the object request corresponds to a set of objects associated with an object distribution system and a destination for distribution of the set of objects; dynamically training a … algorithm to automatically generate object distribution times corresponding to different nodes associated with the object distribution system, wherein the …. algorithm is trained using a dataset that includes sample object requests and sample object distribution times corresponding to sample nodes associated with different object distribution systems; processing the object request through the … algorithm to generate a set of object distribution times corresponding to a set of nodes associated with the object distribution system; updating the … to provide the set of object distribution times, wherein when the … is updated, an object distribution time is selected from the set of object distribution times through the …: obtaining transit data associated with the …, wherein the transit data indicates transit times from the set of nodes to an endpoint corresponding to the … and the destination; processing the object distribution time, the transit data, and data corresponding to the set of nodes through the … algorithm to identify a set of times for transiting the set of objects from the set of nodes to the endpoint; generating a set of object distribution requests, wherein the set of object distribution requests includes the object request and the set of times, and wherein when the set of object distribution requests is received, the set of nodes transits the set of objects to the endpoint according to the set of times to allow for consolidation of the set of objects at the endpoint for consolidated distribution according to the object distribution time; obtaining feedback corresponding to the object distribution time and other object distribution times associated with other object requests as the set of objects and other sets of objects are distributed: and re-training the … algorithm based on the feedback, wherein when the … algorithm is re-trained, the … algorithm generates new object distribution times according to new object requests.“ Analyzing under Step 2A, Prong 1: The limitations regarding, …receiving an object request, wherein the object request is received through an …, and wherein the object request corresponds to a set of objects associated with an object distribution system and a destination for distribution of the set of objects; dynamically training a … algorithm to automatically generate object distribution times corresponding to different nodes associated with the object distribution system, wherein the …. algorithm is trained using a dataset that includes sample object requests and sample object distribution times corresponding to sample nodes associated with different object distribution systems; processing the object request through the … algorithm to generate a set of object distribution times corresponding to a set of nodes associated with the object distribution system; updating the … to provide the set of object distribution times, wherein when the … is updated, an object distribution time is selected from the set of object distribution times through the …: obtaining transit data associated with the …, wherein the transit data indicates transit times from the set of nodes to an endpoint corresponding to the … and the destination; processing the object distribution time, the transit data, and data corresponding to the set of nodes through the … algorithm to identify a set of times for transiting the set of objects from the set of nodes to the endpoint; generating a set of object distribution requests, wherein the set of object distribution requests includes the object request and the set of times, and wherein when the set of object distribution requests is received, the set of nodes transits the set of objects to the endpoint according to the set of times to allow for consolidation of the set of objects at the endpoint for consolidated distribution according to the object distribution time; obtaining feedback corresponding to the object distribution time and other object distribution times associated with other object requests as the set of objects and other sets of objects are distributed: and re-training the … algorithm based on the feedback, wherein when the … algorithm is re-trained, the … algorithm generates new object distribution times according to new object request.…, under the broadest reasonable interpretation, can include a human using their mind and using pen and paper to, …receiving an object request, wherein the object request is received through an …, and wherein the object request corresponds to a set of objects associated with an object distribution system and a destination for distribution of the set of objects; dynamically training a … algorithm to automatically generate object distribution times corresponding to different nodes associated with the object distribution system, wherein the …. algorithm is trained using a dataset that includes sample object requests and sample object distribution times corresponding to sample nodes associated with different object distribution systems; processing the object request through the … algorithm to generate a set of object distribution times corresponding to a set of nodes associated with the object distribution system; updating the … to provide the set of object distribution times, wherein when the … is updated, an object distribution time is selected from the set of object distribution times through the …: obtaining transit data associated with the …, wherein the transit data indicates transit times from the set of nodes to an endpoint corresponding to the … and the destination; processing the object distribution time, the transit data, and data corresponding to the set of nodes through the … algorithm to identify a set of times for transiting the set of objects from the set of nodes to the endpoint; generating a set of object distribution requests, wherein the set of object distribution requests includes the object request and the set of times, and wherein when the set of object distribution requests is received, the set of nodes transits the set of objects to the endpoint according to the set of times to allow for consolidation of the set of objects at the endpoint for consolidated distribution according to the object distribution time; obtaining feedback corresponding to the object distribution time and other object distribution times associated with other object requests as the set of objects and other sets of objects are distributed: and re-training the … algorithm based on the feedback, wherein when the … algorithm is re-trained, the … algorithm generates new object distribution times according to new object request…; therefore, the claims are directed to a mental process. Further, …receiving an object request, wherein the object request is received through an …, and wherein the object request corresponds to a set of objects associated with an object distribution system and a destination for distribution of the set of objects; dynamically training a … algorithm to automatically generate object distribution times corresponding to different nodes associated with the object distribution system, wherein the …. algorithm is trained using a dataset that includes sample object requests and sample object distribution times corresponding to sample nodes associated with different object distribution systems; processing the object request through the … algorithm to generate a set of object distribution times corresponding to a set of nodes associated with the object distribution system; updating the … to provide the set of object distribution times, wherein when the … is updated, an object distribution time is selected from the set of object distribution times through the …: obtaining transit data associated with the …, wherein the transit data indicates transit times from the set of nodes to an endpoint corresponding to the … and the destination; processing the object distribution time, the transit data, and data corresponding to the set of nodes through the … algorithm to identify a set of times for transiting the set of objects from the set of nodes to the endpoint; generating a set of object distribution requests, wherein the set of object distribution requests includes the object request and the set of times, and wherein when the set of object distribution requests is received, the set of nodes transits the set of objects to the endpoint according to the set of times to allow for consolidation of the set of objects at the endpoint for consolidated distribution according to the object distribution time; obtaining feedback corresponding to the object distribution time and other object distribution times associated with other object requests as the set of objects and other sets of objects are distributed: and re-training the … algorithm based on the feedback, wherein when the … algorithm is re-trained, the … algorithm generates new object distribution times according to new object request…, under the broadest reasonable interpretation, are human managing and consolidating shipping packages, therefore it is, commercial interactions. Thus, the claims are directed to certain methods of organizing human activity. Accordingly, the claims are directed to a mental process, certain methods of organizing human activity, and thus, the claims are directed to an abstract idea under the first prong of Step 2A. Analyzing under Step 2A, Prong 2: This judicial exception is not integrated into a practical application under the second prong of Step 2A. In particular, the claims recite the additional elements beyond the recited abstract idea identified under Step 2A, Prong 1, such as: Claim 1, 8, 15: computer-implemented, training in real-time a machine learning algorithm, interface associated with an object distribution processor, machine learning, A system, comprising: one or more processors; and memory storing thereon instructions that, as a result of being executed by the one or more processors, cause the system, A non-transitory, computer-readable storage medium storing thereon executable instructions that, as a result of being executed by one or more processors of a computer system, cause the computer system Claim 4, 11, 18: an instance of a SaaS-based system accessed through one or more application programming interface (API) calls Claim 6, 13, 20: training in real-time another machine learning algorithm , and pursuant to the broadest reasonable interpretation, as an ordered combination, each of the additional elements are computing elements recited at high level of generality implementing the abstract idea, and thus, are no more than applying the abstract idea with generic computer components. Further, these additional elements generally link the abstract idea to a technical environment, namely the environment of a computer. Additionally, with respect to, “receiving …”, “obtaining…”, “…updating…”, “generating…”, these elements do not add a meaningful limitations to integrate the abstract idea into a practical application because they are extra-solution activity, pre and post solution activity - i.e. data gathering – “receiving …”, “obtaining…”, data output – “…updating…”, “generating…” Analyzing under Step 2B: The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception under Step 2B. As noted above, the aforementioned additional elements beyond the recited abstract idea are not sufficient to amount to significantly more than the recited abstract idea because, as an order combination, the additional elements are no more than mere instructions to implement the idea using generic computer components (i.e. apply it). Additionally, as an order combination, the additional elements append the recited abstract idea to well-understood, routine, and conventional activities in the field as individually evinced by the applicant’s own disclosure, as required by the Berkheimer Memo, in at least: [0028] In an embodiment, to access the object distribution optimization system 102, the object distribution system 104 calls a representational state transfer (REST) application programming interface (API) of the object distribution optimization system 102. In this REST API call, the object distribution system 104 may provide a set of credentials that may be used to authenticate the object distribution system 104. For example, in the REST API call, the object distribution system 104 may provide its username and corresponding password to the object distribution optimization system 102. The object distribution optimization system 102 may evaluate the provided credentials to determine whether the credentials are valid. If so, the object distribution optimization system 102 may provide the object distribution system 104 with an access token that may be used by the object distribution system 104 to access the object distribution optimization system 102 without providing its credentials for a period of time (e.g., until the access token expires). [0037] The machine learning algorithm or artificial intelligence implemented by the object distribution optimization system 102 may be dynamically trained in real-time using supervised training techniques. For instance, a dataset of input object requests (e.g., prior object requests associated with different recipients, hypothetical object requests generated for training of the machine learning algorithm or artificial intelligence, etc.) and known object distribution times for different distribution system nodes associated with the input object requests (e.g., prior object distribution times for actual distribution system nodes associated with prior object requests, hypothetical object distribution times for different distribution system nodes associated with hypothetical object requests, etc.) can be selected for training of the machine learning algorithm or artificial intelligence. Additionally, the dataset may include any applicable parameters and/or performance characteristics associated with the different distribution system nodes that may be used for object distributions. These parameters and/or performance characteristics, along with the known object distribution times, may be used to define a ground truth for dynamic evaluation of the machine learning algorithm or artificial intelligence to ensure that the machine learning algorithm or artificial intelligence is generating accurate object distribution times for any identified distribution system nodes associated with different object distribution requests. [0054] The object distribution system 208-2 may provide the object request and object distribution requests for a particular recipient 210 to an object distribution orchestration system 204 of the object distribution optimization system 202. The object distribution orchestration system 204, in an embodiment, is a SaaS-based system that can be accessed by an object distribution system via authorized API calls. The object distribution orchestration system 204 may be configured to identify one or more object distribution times for each distribution system node associated with an object distribution system 208-2 based on transit data associated with an object distribution processor 206, and a defined set of parameters that each object distribution location needs; as well as any times corresponding to pending object distributions scheduled for the recipient 210. [0152] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the methods of some examples. The required structure for a variety of these systems will appear from the description below. In addition, the techniques are not described with reference to any particular programming language, and various examples may thus be implemented using a variety of programming languages. [0153] In various implementations, the system operates as a standalone device or may be connected (e.g., networked) to other systems. In a networked deployment, the system may operate in the capacity of a server or a client system in a client-server network environment, or as a peer system in a peer-to-peer (or distributed) network environment. [0154] The system may be a server computer, a client computer, a personal computer (PC), a tablet PC, a laptop computer, a set-top box (STB), a personal digital assistant (PDA), a cellular telephone, an iPhone, a Blackberry, a processor, a telephone, a web appliance, a network router, switch or bridge, or any system capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that system. [0172] Some portions of this description describe examples in terms of algorithms and symbolic representations of operations on information. These algorithmic descriptions and representations are commonly used by those skilled in the data processing arts to convey the substance of their work effectively to others skilled in the art. These operations, while described functionally, computationally, or logically, are understood to be implemented by computer programs or equivalent electrical circuits, microcode, or the like. Furthermore, it has also proven convenient at times, to refer to these arrangements of operations as modules, without loss of generality. The described operations and their associated modules may be embodied in software, firmware, hardware, or any combinations thereof. [0173] Any of the steps, operations, or processes described herein may be performed or implemented with one or more hardware or software modules, alone or in combination with other devices. In some examples, a software module is implemented with a computer program object comprising a computer-readable medium containing computer program code, which can be executed by a computer processor for performing any or all of the steps, operations, or processes described. [0174] Examples may also relate to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, and/or it may comprise a general-purpose computing device selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a non-transitory, tangible computer readable storage medium, or any type of media suitable for storing electronic instructions, which may be coupled to a computer system bus. Furthermore, any computing systems referred to in the specification may include a single processor or may be architectures employing multiple processor designs for increased computing capability. Furthermore, as an ordered combination, these elements amount to generic computer components receiving or transmitting data over a network, performing repetitive calculations, electronic record keeping, and storing and retrieving information in memory, which, as held by the courts, are well-understood, routine, and conventional. See MPEP 2106.05(d). Moreover, the remaining elements of dependent claims do not transform the recited abstract idea into a patent eligible invention because these remaining elements merely recite further abstract limitations that provide nothing more than simply a narrowing of the abstract idea recited in the independent claims. Looking at these limitations as an ordered combination adds nothing additional that is sufficient to amount to significantly more than the recited abstract idea because they simply provide instructions to use a generic arrangement of generic computer components to “apply” the recited abstract idea, perform insignificant extra-solution activity, and generally link the abstract idea to a technical environment. Thus, the elements of the claims, considered both individually and as an ordered combination, are not sufficient to ensure that the claim as a whole amounts to significantly more than the abstract idea itself. Since there are no limitations in these claims that transform the exception into a patent eligible application such that these claims amount to significantly more than the exception itself, claims 1-21 are rejected under 35 U.S.C. 101 as being directed to non-statutory subject matter. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee 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 date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to PO HAN MAX LEE whose telephone number is (571)272-3821. The examiner can normally be reached on Mon-Thurs 8:00 am - 7:00 pm. 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, Rutao Wu can be reached on (571) 272-6045. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /PO HAN LEE/Primary Examiner, Art Unit 3623
Read full office action

Prosecution Timeline

Apr 10, 2023
Application Filed
Mar 31, 2025
Non-Final Rejection — §101
Oct 02, 2025
Response Filed
Jan 21, 2026
Final Rejection — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602629
USING MACHINE LEARNING TO PREDICT FLEET MOVES IN HYDRAULIC FRACTURING OPERATIONS
2y 5m to grant Granted Apr 14, 2026
Patent 12548089
OPTIMIZATION OF HYBRID GROWING INFRASTRUCTURE FOR DIFFERENT WEATHER PROFILES AND MARKET CONDITIONS
2y 5m to grant Granted Feb 10, 2026
Patent 12548046
SYSTEM FOR ACCURATE PREDICTIONS USING A PREDICTIVE MODEL
2y 5m to grant Granted Feb 10, 2026
Patent 12547241
SYSTEMS AND METHODS FOR COMPUTER-IMPLEMENTED SURVEYS
2y 5m to grant Granted Feb 10, 2026
Patent 12361363
METHOD AND SYSTEM FOR PROFICIENCY IDENTIFICATION
2y 5m to grant Granted Jul 15, 2025
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

3-4
Expected OA Rounds
32%
Grant Probability
74%
With Interview (+41.2%)
3y 6m
Median Time to Grant
Moderate
PTA Risk
Based on 158 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