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 .
Continued Examination Under 37 CFR 1.114
A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 09/01/2026 has been entered.
Response to Arguments
Claim Objection
Applicant's arguments filed 09/01/2026 have been fully considered. Applicant argues that the amendments to the claim make the objection moot and therefore the objection should be withdrawn. In response to Applicant’s cancellation of the claim, the objection is withdrawn.
Rejection Under 101
Applicant's arguments filed 09/01/2026 have been fully considered.
Applicant argues that the newly amended independent 22 and 23 are directed to a specific improvement in the way a computer system represents, executes, and updates workflow states. The claims do not merely receive information and display a result but instead construct a specialized data structure and update the runtime representation while preserving the underlying structured representation. Such processing is a technological improvement to the operation of the computer itself.
In response to Applicant, the arguments are directed toward the amended claims and are therefore moot. However, the amended claims fall under an abstract idea since the limitations are directed at following rules or instructions for defining a model and its graphical representation for managing workflow events. The specification describes managing a workflow of events for clinical visits of a clinical trial and adjusting patient visits. The claims are directed at improving the management of the workflow, which is not a technical problem. See Spec. [0005]-[0007].
Applicant argues that the claims are not directed to workflow management. The amended claims are directed to specialized computer implementation of a structures representation that separates a persistent graph-based representation defining executable relationship and mutable runtime execution representation that evolves during the execution based upon context information. The architecture improves the operation of the computer by permitting generation and maintenance of runtime execution state without reconstructing the underlying computational model.
In response to Applicant, even without the recited language of workflow and clinical trial in the amended claims, the claims are still directed to managing a workflow. For example, the claims recite nodes and how they are defined in the graphical representation of the model. The specification at [0005] states the invention is directed to “a computer method of managing a workflow of scheduled nodes is disclosed” and “the mathematical model defines a plurality of nodes to be scheduled by a workflow application.” The amended claims are still directed at managing a workflow. See the updated rejection in light of the amendments.
Applicant argues that the amended claims solve a technical problem arising from conventional computerized workflow systems. The amended claims introduce specialized computer architecture that separates persistent workflow definition from mutable runtime execution state.
In response to Applicant, The claims are directed to following rules or instructions for defining a model and its graphical representation for managing workflow events. Thus, the claims fall under the abstract idea grouping of organizing human activity. See the updated rejection in light of the amendments.
Claim Rejections - 35 USC § 112
The following is a quotation of the first paragraph of 35 U.S.C. 112(a):
(a) IN GENERAL.—The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor or joint inventor of carrying out the invention.
The following is a quotation of the first paragraph of pre-AIA 35 U.S.C. 112:
The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor of carrying out his invention.
Claims 2-7, 14, 22 are rejected under 35 U.S.C. 112(a) or 35 U.S.C. 112 (pre-AIA ), first paragraph, as failing to comply with the written description requirement. The claim(s) contains subject matter which was not described in the specification in such a way as to reasonably convey to one skilled in the relevant art that the inventor or a joint inventor, or for applications subject to pre-AIA 35 U.S.C. 112, the inventor(s), at the time the application was filed, had possession of the claimed invention. Regarding independent claim 22, the claim recites “receiving inputs that define the computation model, the inputs comprising…” however, after review, the specification does not appear to provide support for this amendment. The specification discusses receiving inputs to define the node cycle as iteratively scheduled, and the sequence and time-based anchors. See [0005]. But there does not appear to be support for the receiving inputs related to computing relationships as well as limitations recited in (v) and (vi). Appropriate correction or clarification is required. The dependent claims are rejected for inheriting the issues of the independent claim.
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 2-7, 9-14, 16-17, 19-20, 22-23 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., an abstract idea) without significantly more.
Step 1 of the Alice/Mayo Test
Claims 2-7, 9-14, 16-17, 19-20, 22-23 are drawn to a method, which is within the four statutory categories (i.e. process).
Step 2A of the Alice/Mayo Test - Prong One
The independent claims recite an abstract idea. For example, claim 22 (and substantially similar with independent claim 23) recites:
A method performed by an application executing on a computer system, the method comprising:
receiving inputs that define a computational model, the inputs comprising
(i) a plurality of nodes,
(ii) a plurality of edges interconnecting the plurality of nodes,
(iii) a plurality of time-based anchors defining rules for computing time relationships between different ones of the plurality of nodes,
(iv) a plurality of sequence-based anchors defining rules for computing sequence relationships between different ones of the plurality of nodes,
(v) a plurality of activities associated with respective ones of the plurality of nodes, and
(vi) a plurality of computational branches and associated branching conditions;
instantiating, in memory, a structured representation of the computational model based on the inputs, wherein
(a) each of the plurality of nodes is represented by a corresponding one of a plurality of node data structures,
(b) each of the plurality of edges is represented by an association between a pair of the plurality of node data structures,
(c) the plurality of time-based anchors are stored as executable constraints associated with the plurality of node data structures,
(d) the plurality of sequence-based anchors are stored as executable constraints associated with the plurality of node data structures, and
(e) the plurality of computational branches are stored as executable branch objects associated with at least some of the plurality of node data structures;
parsing the structured representation by traversing associations among the plurality of nodes, for a number of iterations until an exit condition is satisfied, to identify, for a given node, applicable time-based anchors, applicable sequence-based anchors, and applicable computational branches;
determining, based on an outcome of said parsing, dependency relationships for the given node by evaluating the applicable time-based anchors, the applicable sequence-based anchors, and the applicable computational branches to establish executable ordering and timing relationships among a subset of the plurality of nodes that includes the given node; and
storing the structured representation in the memory, such that the structured representation is parsable, by the application, to determine different execution states without modifying the structured representation.
These underlined elements recite an abstract idea that can be categorized, under its broadest reasonable interpretation, to cover the management of personal behavior or interactions (i.e., following rules), but for the recitation of generic computer components. For example, but for an application executing on a computer system, memory, the limitations in the context of this claim encompass following rules or instructions to define a model and its graphical representation for managing workflow events. If a claim limitation, under its broadest reasonable interpretation, covers management of personal behavior or interactions but for the recitation of generic computer components, then the limitations fall within the “Certain Methods of Organizing Human Activity” grouping of abstract ideas. See MPEP § 2106.04(a).
Dependent claims recite additional subject matter which further narrows or defines the abstract idea embodied in the claims (such as claims 2-7, 9-14, 16-17, 19-20 reciting particular aspects of the abstract idea).
Step 2A of the Alice/Mayo Test - Prong Two
For example, claim 22 (and substantially similar with independent claim 23) recites:
A method performed by an application executing on a computer system, (merely invokes use of computer and other machinery as a tool as noted below, see MPEP 2106.05(f)) the method comprising:
receiving inputs that define a computational model, the inputs comprising
(i) a plurality of nodes,
(ii) a plurality of edges interconnecting the plurality of nodes,
(iii) a plurality of time-based anchors defining rules for computing time relationships between different ones of the plurality of nodes,
(iv) a plurality of sequence-based anchors defining rules for computing sequence relationships between different ones of the plurality of nodes,
(v) a plurality of activities associated with respective ones of the plurality of nodes, and
(vi) a plurality of computational branches and associated branching conditions;
instantiating, in memory (merely invokes use of computer and other machinery as a tool as noted below, see MPEP 2106.05(f)), a structured representation of the computational model based on the inputs, wherein
(a) each of the plurality of nodes is represented by a corresponding one of a plurality of node data structures,
(b) each of the plurality of edges is represented by an association between a pair of the plurality of node data structures,
(c) the plurality of time-based anchors are stored as executable constraints associated with the plurality of node data structures,
(d) the plurality of sequence-based anchors are stored as executable constraints associated with the plurality of node data structures, and
(e) the plurality of computational branches are stored as executable branch objects associated with at least some of the plurality of node data structures;
parsing the structured representation by traversing associations among the plurality of nodes, for a number of iterations until an exit condition is satisfied, to identify, for a given node, applicable time-based anchors, applicable sequence-based anchors, and applicable computational branches;
determining, based on an outcome of said parsing, dependency relationships for the given node by evaluating the applicable time-based anchors, the applicable sequence-based anchors, and the applicable computational branches to establish executable ordering and timing relationships among a subset of the plurality of nodes that includes the given node; and
storing the structured representation in the memory, (merely invokes use of computer and other machinery as a tool as noted below, see MPEP 2106.05(f)) and (merely insignificant extrasolution activity steps as noted below, see MPEP 2106.05(g)) such that the structured representation is parsable, by the application, (merely invokes use of computer and other machinery as a tool as noted below, see MPEP 2106.05(f)) to determine different execution states without modifying the structured representation.
The judicial exception is not integrated into a practical application. In particular, the additional elements do not integrate the abstract idea into a practical application, other than the abstract idea per se, because the additional elements amount to no more than limitations, which:
amount to mere instructions to apply an exception (such as recitations of an application executing on a computer system, memory, thereby invoking computers as a tool to perform the abstract idea, see applicant’s specification [0075]-[0077], [00121]-[00122], see MPEP 2106.05(f))
add insignificant extra-solution activity to the abstract idea (such as recitation of storing the structured representation in memory amounts to insignificant extrasolution activity, see MPEP 2106.05(g))
Dependent claims recite additional subject matter which amount to limitations consistent with the additional elements in the independent claims (such as claims 2-7, 9-14, 16-17, 19-20 recite additional limitations which amount to invoking computers as a tool to perform the abstract idea, and claims 2-7, 9-14, 16-17, 19-20 additional limitations which generally link the abstract idea to a particular technological environment or field of use). Looking at the limitations as an ordered combination adds nothing that is not already present when looking at the elements taken individually. There is no indication that the combination of elements improves the functioning of a computer or improves any other technology. Their collective functions merely provide conventional computer implementation and do not impose a meaningful limit to integrate the abstract idea into a practical application.
Step 2B of the Alice/Mayo Test for Claims
The claims do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to discussion of integration of the abstract idea into a practical application, the additional elements amount to no more than mere instructions to apply an exception, add insignificant extra-solution activity to the abstract idea, and generally link the abstract idea to a particular technological environment or field of use. Additionally, the additional elements, other than the abstract idea per se, amount to no more than elements which:
amount to elements that have been recognized as well-understood, routine, and conventional activity in particular fields (such as using an application executing on a computer system, memory, e.g., Applicant’s spec describes the computer system with it being well-understood, routine, and conventional because it describes in a manner that the additional elements are sufficiently well-known that the specification does not need to describe the particulars of such elements to satisfy 112a. (See Applicant’s Spec. [0075]-[0077], [00121]-[00122]); storing the structured representation in memory, e.g., storing and retrieving information in memory, Versata Dev. Group, MPEP 2106.05(d)(II)(iv); using computer system with an application, memory, e.g., merely adding a generic computer, generic computer components, or a programmed computer to perform generic computer functions, Alice Corp. Pty. Ltd. v. CLS Bank Int’l, 134 S. Ct. 2347, 2358-59, 110 USPQ2d 1976, 1983-84 (2014).
Dependent claims recite additional subject matter which, as discussed above with respect to integration of the abstract idea into a practical application, amount to invoking computers as a tool to perform the abstract idea, adding insignificant extra solution activity, and are generally linking the abstract idea to a particular field of environment. Looking at the limitations as an ordered combination adds nothing that is not already present when looking at the elements taken individually. There is no indication that the combination of elements improves the functioning of a computer or improves any other technology. Their collective functions merely provide conventional computer implementation. Therefore, the claims are not patent eligible, and are rejected under 35 U.S.C. § 101.
Subject Matter Free of Prior Art
Claims 2-7, 9-14, 16-17, 19-20, 22-23 are free of prior art over Ponce de Leon (US 8400467) in view of Kleeman et al. (US2014/0316822) and Stephenson (US 2007/0250344). The prior art references, or reasonable combination thereof, could not be found to disclose, or suggest all of the limitations found in the independent claims. The closest prior art is Ponce de Leon (US 8400467), which teaches a graphical planning and scheduling system. Kleeman et al. (US2014/0316822) teaches generating clinical study reports by analyzing submitted clinical study data. Stephenson (US 2007/0250344) teaches systems and methods for scheduling and sequencing sessions or appointments using a follow-up system. The references taken solely, or in combination, fail to provide the required limitations, and modification of any complementary combination of the references of record would be impermissible hindsight and not provide any advantages over their present application. The dependent claims are also free of prior art due to their corresponding dependency of the independent claims.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to AMANDA R COVINGTON whose telephone number is (303)297-4604. The examiner can normally be reached Monday - Friday, 10 - 5 MT.
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, Jason B. Dunham can be reached on (571) 272-8109. 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.
/AMANDA R. COVINGTON/Examiner, Art Unit 3686
/RACHELLE L REICHERT/Primary Examiner, Art Unit 3686