DETAILED ACTION
Notice of Pre-AIA or AIA Status
1. 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 § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
2. Claims 7 and 14 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention.
Claims 7 and 14 recite, “wherein the graph neural network module weights a certification type and a location…”
The term “weights used in this context renders the claim indefinite. Did the applicant intend to claim “weighs?”
For examination purposes, “weights” will be interpreted as –weighs.—
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.
3. Claims 1, 6-8, 13-15, 20 are rejected under 35 U.S.C. 101 because the claimed invention recites an abstract idea without significantly more.
Using the limitations in claim 1 to illustrate, the claim recite(s) the limitations of: determine a trades group corresponding to the at least one of the bid request or the labor request; maintain a graph database structure with a virtualized storage component, wherein the graph database structure comprises a plurality of user profiles mapped to corresponding skilled trades certifications, wherein data with the graph database structure is represented as a graph context where nodes represent users, certifications, locations, and trade groups and edges represent relations between the nodes; present a curated list of n user profiles to an initiator of the at least one bid request or labor request, wherein a presentation order of the curated list is prioritized based on a ranking derived from a trade-matching relatedness metric; and generate a post displaying information corresponding to the at least one of the bid request or the labor request within a news feed corresponding to the trades group.
The limitations, as drafted, recite a process that, under its broadest reasonable interpretation, covers certain methods of organizing human activity, in particular, commercial or legal interactions, but for the recitation of generic computer components.
The claimed invention allows for receiving bid requests or labor requests and determining a trades group corresponding to the bid or labor request and displaying information within a news feed corresponding to the trades group which is a certain method of organizing human activity (commercial or legal interactions and fundamental economic practices). The mere nominal recitation of a processor and a memory do not take the claim out of the methods of organizing human activity grouping. Thus, under Eligibility Step 2A, prong one, (MPEP §2106.04(a)), the claims recite an abstract idea.
Under Eligibility Step 2A, prong two, (MPEP §2106.04(d)), this judicial exception is not integrated into a practical application. The claim recites the additional elements: receive data corresponding to at least one of a bid request or a labor request. The receiving steps/functions are recited at a high level of generality (i.e., as a general means of receiving data). Receiving data is a form of insignificant extra-solution activity –see MPEP 2106.05(g).
The processor and memory including instructions such that when executed by the processor, cause the processor to: determine a trades group…; maintain a graph database structure …; present a curated list…; and generate a post displaying information…; are also recited at a high level of generality and merely automates the determining and generating steps. Each of the additional limitations is no more than mere instructions to apply the exception using generic computer components (the processor and memory). The combination of these additional elements is no more than mere instructions to apply the exception using generic computer components (processor and memory). Accordingly, even in combination, these additional elements do not integrate the abstract idea into a practical application because they do not impose meaningful limits on practicing the abstract idea.
Similar arguments can be extended to independent claims 8 and 15 and hence claims 8 and 15 are rejected on similar grounds as claim 1. In addition, claim 8 recites a processor and claim 15 recites a system comprising a computer including a processor and a memory, the memory including instructions such that when executed by the processor cause the processor to perform the claimed functions that amount to generic computer implementation.
The claims are directed to an abstract idea.
Under Eligibility Step 2B, (MPEP §2106.05), the claim(s) does/do not include additional elements that are sufficient to amount to significantly more than the judicial exception. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements in the claims amount to no more than mere instructions to apply the exception using generic computer components. Mere instructions to apply an exception using generic computer components cannot provide an inventive concept.
Furthermore, under Step 2B, the additional elements found to be insignificant extra-solution activities under step 2A prong two, are re-evaluated to determine if the elements are more than what is well-understood, routine and conventional activity in the field. Here, the Specification does not provide any indication that the processor and memory are anything other than generic computer components and the Symantec, TLI Communications, OIP Techs, and buySafe court decisions cited in MPEP 2106.05[d][ii] indicate that the mere receiving data over a network are well-understood, routine, and conventional functions when they are claimed in a merely generic manner (as they are here). Accordingly, a conclusion that the receiving limitations are well understood, routine, and conventional activities is supported under Berkheimer Option 2. For these reasons, there is no inventive concept. The claims are not patent eligible.
The dependent claims have been given the full two-part analysis including analyzing the additional limitations both individually and in combination. The dependent claim(s) when analyzed both individually and in combination are also held to be patent ineligible under 35 U.S.C. 101 because for the same reasoning as above and the additional recited limitation(s) fail(s) to establish that the claim(s) is/are not directed to an abstract idea.
As for dependent claims 6-7, 13-14, 20, these claims recite limitations that further define the abstract idea noted above. In addition, they recite the additional element of using a graph neural network. The use of a graph neural network is recited at a high level of generality such that it amounts to no more than generally linking the use of the judicial exception to a particular technological environment or field of use.-see MPEP 2106.05(h). The additional limitations of the dependent claim(s) when considered individually and as an ordered combination do not amount to significantly more than the abstract idea.
Viewing the claim limitations as an ordered combination does not add anything further than looking at the claim limitations individually. When viewed either individually, or as an ordered combination, the additional limitations do not amount to a claim as a whole that is significantly more than the abstract idea. Accordingly, claim(s) 1, 6-8, 13-15, and 20 is/are ineligible.
Response to Arguments
4. In response to the amendment of claim 1, 5, 11, 12, 15, and 19, the Examiner withdraws the 35 U.S.C. § 112(b) rejection.
In response to the amendment of the claims, the Examiner withdraws the 35 U.S.C. § 103 rejection.
Claims 7 and 14 have not been amended and therefore the rejection under 35 USC 112(b) is maintained.
The remaining arguments filed 6/22/2026 have been fully considered but they are not persuasive.
On page 2 of the Remarks, Applicants argue that the claims do not recite an abstract idea because the described tasks cannot be performed in the human mind, nor can they be executed via generic “pen and paper.”
The Examiner respectfully disagrees.
The Patent Office has issued guidance about this framework. -See MPEP§ 2106 (9th ed. Rev. 10.2019, rev. June 2020), in particular, Sections 2103 through 2106.07(c). As indicated in the MPEP § 2106, to decide whether a claim is directed to an abstract idea, we evaluate whether the claim (1) recites one of the abstract ideas listed in the Revised Guidance (“Prong One”) and (2) fails to integrate the recited abstract idea into a practical application (“Prong Two”).
Beginning with Prong One, step 2A of the eligibility analysis, we must determine whether the claims at issue are directed to one of those patent-ineligible concepts. One of the subject matter groupings identified as an abstract idea in the Guidance is “[certain methods of organizing human activity—fundamental economic principles or practices (including . . . mitigating risk, insurance); commercial. . . interactions (including agreements in the form of contracts; . . . sales activities or behaviors; business relations); managing personal behavior or relationships or interactions between people (including . . . following rules or instructions)].”- See MPEP 2106.04(a).
Here, apart from the recited systems, i.e., a processor and a memory, claim 1 recites abstract ideas in the category of “methods of organizing human activity.” In the 101 analysis in the rejection above, the Examiner identifies and considers each of the underlying steps for the claims as a basis for describing and explaining the recited abstract idea. For example, the Examiner identifies the underlying steps of claim 1—i.e., determine a trades group…; maintain a graph database structure …; present a curated list…; and generate a post displaying information…; —and explains that they describe the concept of receiving bid requests or labor requests and determining a trades group corresponding to the bid or labor request and displaying information within a news feed corresponding to the trades group. The Examiner’s approach here is consistent with USPTO guidance.
Applicants further argue that executing an automated graph neural network module to compute a metric cannot be performed by the human mind. As recited in the 35 USC 101 rejection above, each of the additional limitations is no more than mere instructions to apply the exception using generic computer components (the processor and memory) and the limitations in the dependent claim reciting using a neural network, are generic and amount to generally linking the use of the judicial exception to a particular technological environment or field of use, -see MPEP 2106.05(h).
Although use of a graph neural network is recited, such use is generic. The object of the claim limitations using a graph neural network is to determine a trade-matching relatedness metric, and apply weights to a certification type and location for the trade-matching relatedness metric, not to produce technology enabling a neural network to operate. The claims call for generic use of such a model in the manner such models customarily operate. Simply reciting a particular technological module or piece of equipment in a claim does not confer eligibility.
On page 3 of the Remarks, applicants argue that under step 2A, prong two, the claims are directed to a technological improvement in network functioning. The argument is not convincing.
The claims are directed to a social and job-matching platform for skilled trades workers and trade-related businesses using a graph neural network to determine a metric and weighing a certification type and location higher than monetary and labor constraints for the trade-matching relatedness metric. The claims are directed to an improvement in a business process, not to an improvement to technology.
Here, the focus of the claims is not on an improvement to the identified additional elements as tools, but on the abstract ideas that use the additional elements as tools. The use of generic computer components to carry out the abstract idea does not impose any meaningful limit on the computer implementation of the abstract idea.
On page 4 of the Remarks, Applicants argue that the architectural framework limits database search latency and removes query overhead by utilizing relational graph vectors rather than scanning disparate flat relational tables. It is noted that the features upon which applicant relies (i.e., utilizing relational graph vectors) are not recited in the rejected claim(s). Although the claims are interpreted in light of the specification, limitations from the specification are not read into the claims. See In re Van Geuns, 988 F.2d 1181, 26 USPQ2d 1057 (Fed. Cir. 1993).
Furthermore, this argument is not persuasive because the argued increase in speed and capability comes from the capabilities of a general-purpose computer that includes a microprocessor, rather than the claimed method itself. See Bancorp Servs., L.L.C. v. Sun Life Assurance Co. of Can. (U.S.), 687 F.3d 1266, 1278 (Fed. Cir. 2012)(“[T]he fact that the required calculations could be performed more efficiently via a computer does not materially alter the patent eligibility of the claimed subject matter.”).
Applicants further argue that the claims of the instant invention are similar to the features recited in the claims at issue in Enfish, the claims in Enfish were not simply adding conventional computer components to well-known business practices; mathematical formulas performed on any general-purpose computer; or generalized steps performed on a computer using conventional computer activity. The patent claims here are not directed to a specific implementation to a solution to a problem in the software arts of improving the way a computer stores and retrieves data in memory through use of a specific data structure. In Enfish, the claims at issue focused not on asserted advances in uses to which existing computer capabilities could be put, but on a specific improvement—a particular database technique— in how computer could carry out one of their basic functions of storage and retrieval of data. Enfish, 822 F.3d at 1335-36. The present case is different: the focus of the claims is not on such an improvement in computers as tools, but on certain independently abstract ideas that use computers as tools.
Applicants argue that pursuant to McRO, the claims weave a highly customized, domain-specific node-weighting strategy directly into the structural traversal mechanics of a graph network model and therefore, are directed to a practical application. The argument is not persuasive.
In McRO, the claimed process used a combined order of specific rules that rendered information in a specific format that was applied to create a sequence of synchronized, animated characters. McRO, 837 F.3d at 1315. Notably, the recited process automatically animated characters using particular information and techniques—an improvement over manual three-dimensional animation techniques that was not directed to an abstract idea. Id, at 1316.
Unlike in McRO, the recited memory and processor is not a rule-based improvement of a technological process. The claims here are not directed to a specific implementation to a solution to a problem in the software arts of improving computer animation through the use of specific rules to set morph weights and transition parameters between phonemes. The McRO court indicated that it was the incorporation of the particular claimed rules in computer animation that “improved [the] existing technological process.” The claims at issue in McRo described a specific way (use of particular rules to set morph weights and transitions through phonemes) to solve the problem of producing accurate and realistic lip synchronization and facial expressions in animated characters. In contrast, Applicants’ claims address a computer-based social and job-matching platform for skilled trades workers and trade-related businesses. The claims in McRO were directed to an improvement in the operation of the computer at a task, rather than applying a computer to perform generic data manipulation steps, as in the claims of the instant application. See id, at 1314.
On page 5, Applicants argue that the claims amount to significantly more than the abstract idea under step 2B. As discussed above with respect to integration of the abstract idea into a practical application, the additional elements in the claims amount to no more than mere instructions to apply the exception using generic computer components and generally linking the use of the judicial exception to particular technological environment or field of use. Mere instructions to apply an exception using generic computer components and generally linking the abstract idea to a technological environment cannot provide an inventive concept.
Conclusion
5. THIS ACTION IS MADE FINAL. Applicants are 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 ELDA MILEF whose telephone number is (571)272-8124. The examiner can normally be reached Monday-Thursday 6:30am-3:30pm; Friday 7am-12pm.
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, Bennett Sigmond can be reached at (303)297-4411. 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.
/ELDA G MILEF/Primary Examiner, Art Unit 3694