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 .
Response to Amendment
Claims 1-19 are currently pending.
Response to Arguments
Upon consideration of Applicant’s arguments filed on 09/04/2026, the Examiner finds the arguments persuasive. Accordingly, the rejection of the claims under 35 USC §101 is withdrawn.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claim(s) 1-3, 8, 10-13 and 18 is/are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-3, 8, 10-13 and 18 of U.S. Patent No.US-12333010-B1 (hereinafter “Pat ‘010”). Although the claims at issue are not identical, they are not patentably distinct from each other.
Per claim 1 (independent):
Claim 1 of Pat ‘010 anticipates all of the limitations in claim 1 of the instant application.
Claims / App Language
Pat ‘010 Language
1
A method for generating a subgraph view of a security graph, comprising:
generating a representation in a security database to represent an element of a first computing environment based on a predefined data schema, the predefined data schema including at least: a principal data object structure and a resource data object structure, wherein the security database further includes a representation of the first computing environment;
generating a first tag as a data field in a database storing therein the security database, the security database further including a plurality of representations, wherein at least a first portion of the plurality of representations correspond each to a principal, and at least a second portion of the plurality of representations correspond each to a resource;
selecting a representation from the plurality of representations;
associating the selected representation with the generated first tag; and
generating a subgraph, the subgraph including at least the selected representation associated with the generated first tag and a child representation of the at least the selected representation, wherein the selected representation is connected to at least a child representation via a vertex.
1
A method for generating a subgraph view of a security graph, comprising:
generating a node in a digital security graph to represent an element of a first cloud computing environment based on a predefined data schema, the predefined data schema including a digital data record structure for representing at least: a principal data object structure and a resource data object structure, wherein the digital security graph includes a representation of the first cloud computing environment;
generating a first tag as a data field in a graph database storing therein the digital security graph, the security graph further including a plurality of nodes, wherein at least a first portion of the plurality of nodes correspond each to a principal, and at least a second portion of the plurality of nodes correspond each to a resource, and wherein each node is a digital data record;
receiving a selection of a node from the plurality of nodes via a user interface of the graph database on which the security graph is stored;
writing a value to graph database which associates the selected node with the generated first tag;
generating a subgraph in the graph database, the subgraph comprising at least the selected node associated with the generated first tag and each child node of the at least the selected node, wherein the selected node is connected to at least a child node via a vertex, the vertex indicating a connection type; and
rendering the generated subgraph on a display.
Per claim 2 (dependent on claim 1):
Claim 2 of Pat ‘010 anticipates all of the limitations in claim 2 of the instant application.
Per claim 3 (dependent on claim 2):
Claim 3 of Pat ‘010 anticipates all of the limitations in claim 3 of the instant application.
Per claim 8 (dependent on claim 1):
Claim 8 of Pat ‘010 anticipates all of the limitations in claim 8 of the instant application.
Per claim 10 (independent):
Claim 10 of Pat ‘010 anticipates all of the limitations in claim 10 of the instant application.
Claims / App Language
Pat ‘010 Language
10
A non-transitory computer-readable medium storing a set of instructions for generating a subgraph view of a security graph, the set of instructions comprising:
one or more instructions that, when executed by one or more processing circuitries of a device, cause the device to:
generate a representation in a security database to represent an element of a first computing environment based on a predefined data schema, the predefined data schema including at least:
a principal data object structure and a resource data object structure, wherein the security database further includes a representation of the first compute environment;
generate a first tag as a data field in a database storing therein the security database, the security database further including a plurality of representations, wherein at least a first portion of the plurality of representations correspond each to a principal, and at least a second portion of the plurality of representations correspond each to a resource;
select a representation from the plurality of representations;
associate the selected representation with the generated first tag; and
generate a subgraph, the subgraph including at least the selected representation associated with the generated first tag and a child representation of the at least the selected representation, wherein the selected representation is connected to at least a child representation via a vertex
10
A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute a process for generating a subgraph view of a security graph, the process comprising:
generating a node in a digital security graph to represent an element of a first cloud computing environment based on a predefined data schema, the predefined data schema including a digital data record structure for representing at least:
a principal data object structure and a resource data object structure, wherein the digital security graph includes a representation of the first cloud computing environment;
generating a first tag as a data field in a graph database storing therein the digital security graph, the security graph further including a plurality of nodes, wherein at least a first portion of the plurality of nodes correspond each to a principal, and at least a second portion of the plurality of nodes correspond each to a resource, and wherein each node is a digital data record;
receiving a selection of a node from the plurality of nodes via a user interface of the graph database on which the security graph is stored;
writing a value to graph database which associates the selected node with the generated first tag;
generating a subgraph in the graph database, the subgraph comprising at least the selected node associated with the generated first tag and each child node of the at least the selected node, wherein the selected node is connected to at least a child node via a vertex, the vertex indicating a connection type; and
rendering the generated subgraph on a display
Per claim 11 (independent):
Claim 11 of Pat ‘010 anticipates all of the limitations in claim 11 of the instant application.
Claims / App Language
Pat ‘010 Language
11
A system for generating a subgraph view of a security graph comprising:
one or more processing circuitries configured to:
generate a representation in a security database to represent an element of a first computing environment based on a predefined data schema, the predefined data schema including at least:
a principal data object structure and a resource data object structure, wherein the security database further includes a representation of the first compute environment;
generate a first tag as a data field in a database storing therein the security database, the security database further including a plurality of representations, wherein at least a first portion of the plurality of representations correspond each to a principal, and at least a second portion of the plurality of representations correspond each to a resource;
select a representation from the plurality of representations;
associate the selected representation with the generated first tag; and
generate a subgraph, the subgraph including at least the selected representation associated with the generated first tag and a child representation of the at least the selected representation, wherein the selected representation is connected to at least a child representation via a vertex.
11
A system for generating a subgraph view of a security graph, comprising:
a processing circuitry; and
a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
generate a node in a digital security graph to represent an element of a first cloud computing environment based on a predefined data schema, the predefined data schema including a digital data record structure for representing at least:
a principal data object structure and a resource data object structure, wherein the digital security graph includes a representation of the first cloud computing environment;
generate a first tag as a data field in a graph database storing therein the digital security graph, the security graph further including a plurality of nodes, wherein at least a first portion of the plurality of nodes correspond each to a principal, and at least a second portion of the plurality of nodes correspond each to a resource, and wherein each node is a digital data record;
receiving a selection of a node from the plurality of nodes via a user interface of the graph database on which the security graph is stored;
write a value to graph database which associates the selected node with the generated first tag;
generate a subgraph in the graph database, the subgraph comprising at least the selected node associated with the generated first tag and each child node of the at least the selected node, wherein the selected node is connected to at least a child node via a vertex, the vertex indicating a connection type; and
render the generated subgraph on a display.
Per claim 12 (dependent on claim 11):
Claim 12 of Pat ‘010 anticipates all of the limitations in claim 12 of the instant application.
Per claim 13 (dependent on claim 12):
Claim 13 of Pat ‘010 anticipates all of the limitations in claim 13 of the instant application.
Per claim 18 (dependent on claim 11):
Claim 18 of Pat ‘010 anticipates all of the limitations in claim 18 of the instant application.
Allowable Subject Matter
Claim(s) 1-19 is/are allowed.
The following is a statement of reasons for the indication of allowable subject matter:
Regarding claims 1-19, the reasons for allowance were previously set forth in the Non-Final Office Action mailed on 06/04/2026. Reference is made thereto for the reasons why claims 1-19 are considered allowable.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
LEVIN et al., US-20220086179-A1 – constructs a graph including service nodes and geolocation nodes, with edges representing access relationships between the respective nodes. The graph is used to derive vector representations of the nodes based on observed access patterns, thereby enabling identification of anomalous service-access behavior.
THIS ACTION IS MADE FINAL. 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 SANGSEOK PARK whose telephone number is (571)272-4332. The examiner can normally be reached Monday-Friday 7:30-5:30 and Alternate Fridays 9:00 am-5: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, PHILIP CHEA can be reached at (571)272-3951. 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.
/SANGSEOK PARK/Primary Examiner, Art Unit 2499
Prosecution Insights