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
Applicant's response filed 11 March 2026 has been considered and entered. Accordingly, claims 21-40 are pending in this application. Claims 21-40 are newly added; and claims 1-20 are cancelled.
Abstract
3. Applicant is reminded of the proper language and format for an abstract of the disclosure.
The abstract should be in narrative form and generally limited to a single paragraph on a separate sheet within the range of 50 to 150 words in length. The abstract should describe the disclosure sufficiently to assist readers in deciding whether there is a need for consulting the full patent text for details.
The language should be clear and concise and should not repeat information given in the title. It should avoid using phrases which can be implied, such as, “The disclosure concerns,” “The disclosure defined by this invention,” “The disclosure describes,” etc. In addition, the form and legal phraseology often used in patent claims, such as “means” and “said,” should be avoided.
The abstract contains the legal term “embodiment” and that it should be removed. It is suggested to add “aspect” instead of “embodiment”.
Double Patenting
4. 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.
5. Claims 21-40 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 6 and 25 of U.S. Patent No. 9740744. The subject matter claimed in the instant application is fully disclosed in the U.S. Patent No. 9740744 and is covered by the U.S. Patent No. 9740744 and the application are claiming common subject matter, as follows:
Instant Application - 18/946,847
U.S. Patent No. 9740744
21. (New) A graph database manipulation system, comprising: at least one processor; and a memory, wherein the memory stores a graph database manipulation application and a graph database; where the graph database comprises a set of nodes and a set of edges, and where an edge in the set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes; and where the graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; recursively traverse the graph database to locate a subgraph comprising a set of related nodes and a set of related edges based on the source node, wherein the subgraph encodes attributes of any other subgraph within the graph database; determine emergent data describing relationships between the related nodes based on the related edges; and generate an ontology based on the perspective of the source node within the graph database, wherein the ontology describes relationships between the nodes and edges from the perspective of the source node, and wherein the ontology is determined based on the emergent data and the relationships between the nodes and edges within a local perspective of the source node.
1. (Currently Amended) A graph database manipulation system, comprising: a graph database server system comprising: at least one processor; and a memory configured to store a first graph database manipulation application, and a graph database; wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; and wherein the first graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and a graph manipulation device comprising: a processor; a display device; and a memory configured to store a second graph database manipulation application; wherein the second graph database manipulation application configures the processor to: obtain the information describing representation of the set of related nodes from the perspective source node; and display a visualization of the representation of the set of related nodes from the perspective source node using the display device.
25. (New) The graph database manipulation system of claim 21, wherein a node comprises permission metadata describing a set of nodes that have access to the node, and wherein the graph database manipulation application further configures the at least one processor to locate the set of related nodes based on the permission metadata for the nodes in the set of related nodes.
6. (Currently Amended) The graph database manipulation system of claim 1, wherein: a node comprises permission metadata, where the permission metadata describes a set of nodes that have access to the node; and the first graph database manipulation application further configures the at least one processor to locate the set of related nodes for the source based on the permission metadata for the nodes in the set of related nodes.
26. (New) The graph database manipulation system of claim 21, wherein an edge comprises edge weight metadata and edge display metadata, and wherein the generated ontology is further based on the edge weight metadata and the edge display metadata from the edges defining the relationships between the nodes.
1. (Currently Amended) A graph database manipulation system, comprising: a graph database server system comprising: at least one processor; and a memory configured to store a first graph database manipulation application, and a graph database; wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; and wherein the first graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and a graph manipulation device comprising: a processor; a display device; and a memory configured to store a second graph database manipulation application; wherein the second graph database manipulation application confiqures the processor to: obtain the information describing representation of the set of related nodes from the perspective source node; and display a visualization of the representation of the set of related nodes from the perspective source node using the display device.
27. (New) The graph database manipulation system of claim 21, wherein the graph database manipulation application further configures the at least one processor to generate an approximation of the graph database from the perspective of the source node, and wherein the ontology is generated based on the approximation.
25. (New) The graph database manipulation system of claim 1, wherein the displayed representation of the set of related nodes from the perspective source node is based on an approximation of the graph database.
31. (New) A method for manipulating a graph database, comprising: determining, using at least one processor, a source node within a set of nodes of a graph database stored in a memory, where the graph database comprises the set of nodes and a set of edges, and where an edge in the set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes; recursively traversing, using the at least one processor, the graph database to locate a subgraph comprising a set of related nodes and a set of related edges based on the source node, wherein the subgraph encodes attributes of any other subgraph within the graph database; determining, using the at least one processor, emergent data describing relationships between the related nodes based on the related edges; and generating, using the at least one processor, an ontology based on the perspective of the source node within the graph database, wherein the ontology describes relationships between the nodes and edges from the perspective of the source node, and wherein the ontology is determined based on the emergent data and the relationships between the nodes and edges within a local perspective of the source node.
1. (Currently Amended) A graph database manipulation system, comprising: a graph database server system comprising: at least one processor; and a memory configured to store a first graph database manipulation application, and a graph database; wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; and wherein the first graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and a graph manipulation device comprising: a processor; a display device; and a memory configured to store a second graph database manipulation application; wherein the second graph database manipulation application configures the processor to: obtain the information describing representation of the set of related nodes from the perspective source node; and display a visualization of the representation of the set of related nodes from the perspective source node using the display device.
35. (New) The method of claim 31, wherein a node comprises permission metadata describing a set of nodes that have access to the node, and wherein locating the set of related nodes is based on the permission metadata for the nodes in the set of related nodes.
6. (Currently Amended) The graph database manipulation system of claim 1, wherein: a node comprises permission metadata, where the permission metadata describes a set of nodes that have access to the node; and the first graph database manipulation application further configures the at least one processor to locate the set of related nodes for the source based on the permission metadata for the nodes in the set of related nodes.
36. (New) The method of claim 31, wherein an edge comprises edge weight metadata and edge display metadata, and wherein the generated ontology is further based on the edge weight metadata and the edge display metadata from the edges defining the relationships between the nodes.
1. (Currently Amended) A graph database manipulation system, comprising: a graph database server system comprising: at least one processor; and a memory configured to store a first graph database manipulation application, and a graph database; wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; and wherein the first graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and a graph manipulation device comprising: a processor; a display device; and a memory configured to store a second graph database manipulation application; wherein the second graph database manipulation application configures the processor to: obtain the information describing representation of the set of related nodes from the perspective source node; and display a visualization of the representation of the set of related nodes from the perspective source node using the display device.
37. (New) The method of claim 31, further comprising generating, using the at least one processor, an approximation of the graph database from the perspective of the source node, and wherein the ontology is generated based on the approximation.
25. (New) The graph database manipulation system of claim 1, wherein the displayed representation of the set of related nodes from the perspective source node is based on an approximation of the graph database.
Noted, it would have been obvious to a person of ordinary skill in the art at the time the invention was made to modify or to omit the additional elements of claims 1, 6 and 25 of U.S. Patent No. 9740744 to arrive at the claims 21, 25-27, 31 and 35-37 of the instant application because the person would have realized that the remaining element would perform the same functions as before. "Omission of element and its function in combination is obvious expedient if the remaining elements perform same functions as before." See In re Karlson (CCPA) 136 USPQ 184, decide Jan 16, 1963, Appl. No. 6857, U.S. Court of Customs and Patent Appeals.
The remaining claims are rejected for fully incorporating the deficiencies of the base claim(s) from which they depend.
6. Claims 21-40 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 6 and 24 of U.S. Patent No. 9348947. The subject matter claimed in the instant application is fully disclosed in the U.S. Patent No. 9348947 and is covered by the U.S. Patent No. 9348947 and the application are claiming common subject matter, as follows:
Instant Application - 18/946,847
U.S. Patent No. 9348947
21. (New) A graph database manipulation system, comprising: at least one processor; and a memory, wherein the memory stores a graph database manipulation application and a graph database; where the graph database comprises a set of nodes and a set of edges, and where an edge in the set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes; and where the graph database manipulation application configures the at least one processor to: determine a source node within the set of nodes; recursively traverse the graph database to locate a subgraph comprising a set of related nodes and a set of related edges based on the source node, wherein the subgraph encodes attributes of any other subgraph within the graph database; determine emergent data describing relationships between the related nodes based on the related edges; and generate an ontology based on the perspective of the source node within the graph database, wherein the ontology describes relationships between the nodes and edges from the perspective of the source node, and wherein the ontology is determined based on the emergent data and the relationships between the nodes and edges within a local perspective of the source node.
1. A graph database manipulation device, comprising: a processor; and a memory configured to store a graph database manipulation application; wherein the graph database manipulation application configures the processor to: obtain a graph database, wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and recursively update the generated representation of the set of sub- related nodes from the perspective of the source node and the set of related nodes, where the representation of a sub-related node in the set of sub-related nodes within the generated representation is recursively based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular sub-related node and its predecessor nodes.
25. (New) The graph database manipulation system of claim 21, wherein a node comprises permission metadata describing a set of nodes that have access to the node, and wherein the graph database manipulation application further configures the at least one processor to locate the set of related nodes based on the permission metadata for the nodes in the set of related nodes.
6. The graph database manipulation device of claim 1, wherein: a node comprises permission metadata, where the permission metadata describes a set of nodes that have access to the node; and the graph database manipulation application further configures the processor to locate the set of related nodes for the source based on the permission metadata for the nodes in the set of related nodes.
26. (New) The graph database manipulation system of claim 21, wherein an edge comprises edge weight metadata and edge display metadata, and wherein the generated ontology is further based on the edge weight metadata and the edge display metadata from the edges defining the relationships between the nodes.
1. A graph database manipulation device, comprising: a processor; and a memory configured to store a graph database manipulation application; wherein the graph database manipulation application configures the processor to: obtain a graph database, wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; determine a source node within the set of nodes; locate a set of related nodes based on the source node and the set of edges, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub-related node; generate a representation of the set of related nodes from the perspective of the source node, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and recursively update the generated representation of the set of sub- related nodes from the perspective of the source node and the set of related nodes, where the representation of a sub-related node in the set of sub-related nodes within the generated representation is recursively based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular sub-related node and its predecessor nodes.
31. (New) A method for manipulating a graph database, comprising: determining, using at least one processor, a source node within a set of nodes of a graph database stored in a memory, where the graph database comprises the set of nodes and a set of edges, and where an edge in the set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes; recursively traversing, using the at least one processor, the graph database to locate a subgraph comprising a set of related nodes and a set of related edges based on the source node, wherein the subgraph encodes attributes of any other subgraph within the graph database; determining, using the at least one processor, emergent data describing relationships between the related nodes based on the related edges; and generating, using the at least one processor, an ontology based on the perspective of the source node within the graph database, wherein the ontology describes relationships between the nodes and edges from the perspective of the source node, and wherein the ontology is determined based on the emergent data and the relationships between the nodes and edges within a local perspective of the source node.
24. A method for visualizing graph databases, comprising: obtaining a graph database using a graph database manipulation device, wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; determining a source node within the set of nodes using the graph database manipulation device; locating a set of related nodes based on the source node and the set of edges using the graph database manipulation device, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locating a set of sub-related nodes based on the set of related nodes and the set of edges using the graph database manipulation device, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub- related node; generating a representation of the set of related nodes from the perspective of the source node using the graph database manipulation device, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and recursively updating the generated representation of the set of sub-related nodes from the perspective of the source node and the set of related nodes using the graph database manipulation device, where the representation of a sub-related node in the set of sub-related nodes within the generated representation is recursively based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular sub-related node and its predecessor nodes.
35. (New) The method of claim 31, wherein a node comprises permission metadata describing a set of nodes that have access to the node, and wherein locating the set of related nodes is based on the permission metadata for the nodes in the set of related nodes.
6. The graph database manipulation device of claim 1, wherein: a node comprises permission metadata, where the permission metadata describes a set of nodes that have access to the node; and the graph database manipulation application further configures the processor to locate the set of related nodes for the source based on the permission metadata for the nodes in the set of related nodes.
36. (New) The method of claim 31, wherein an edge comprises edge weight metadata and edge display metadata, and wherein the generated ontology is further based on the edge weight metadata and the edge display metadata from the edges defining the relationships between the nodes.
24. A method for visualizing graph databases, comprising: obtaining a graph database using a graph database manipulation device, wherein the graph database comprises: a set of nodes; and a set of edges, wherein an edge in a set of edges defines a relationship between a first node in the set of nodes and a second node in the set of nodes and an edge comprises: edge weight metadata; and edge display metadata, wherein the edge display metadata describes the spatial relationship between the first node and the second node; determining a source node within the set of nodes using the graph database manipulation device; locating a set of related nodes based on the source node and the set of edges using the graph database manipulation device, where a related node in the set of related nodes has an edge in the set of edges indicating a relationship between the related node and the source node; recursively locating a set of sub-related nodes based on the set of related nodes and the set of edges using the graph database manipulation device, where a sub-related node in the set of sub-related nodes has an edge in the set of edges indicating a relationship between a related node in the set of related nodes and the sub- related node; generating a representation of the set of related nodes from the perspective of the source node using the graph database manipulation device, where the representation of a related node in the subset of the set of related nodes is based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular related node and the source node; and recursively updating the generated representation of the set of sub-related nodes from the perspective of the source node and the set of related nodes using the graph database manipulation device, where the representation of a sub-related node in the set of sub-related nodes within the generated representation is recursively based on the edge weight metadata and the edge display metadata from the edge defining the relationship between the particular sub-related node and its predecessor nodes.
Noted, it would have been obvious to a person of ordinary skill in the art at the time the invention was made to modify or to omit the additional elements of claims 1, 6 and 24 of U.S. Patent No. 9348947 to arrive at the claims 21, 25-26, 31 and 35-36 of the instant application because the person would have realized that the remaining element would perform the same functions as before. "Omission of element and its function in combination is obvious expedient if the remaining elements perform same functions as before." See In re Karlson (CCPA) 136 USPQ 184, decide Jan 16, 1963, Appl. No. 6857, U.S. Court of Customs and Patent Appeals.
The remaining claims are rejected for fully incorporating the deficiencies of the base claim(s) from which they depend.
Response to Arguments
7. Examiner withdraws the claim objections, 112(b) rejections, 102 and 103 rejections for the claims since applicant cancelled the claims 1-20.
Conclusion
8. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
ERONEN (WO 2011151500 A1) teaches finding relationships among data.
9. 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 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 mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to MOHAMMAD SOLAIMAN BHUYAN whose telephone number is (571)272-7843. The examiner can normally be reached on Monday - Friday 9:00am-5:00pm EST.
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, Charles Rones can be reached on 571-272-4085. 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.
/Mohammad S Bhuyan/Examiner, Art Unit 2168
/CHARLES RONES/Supervisory Patent Examiner, Art Unit 2168
Prosecution Insights