Prosecution Insights
Last updated: April 19, 2026
Application No. 17/932,845

METHODS, MEDIUMS, AND SYSTEMS FOR ESTABLISHING A QUALITY CONTROL RECORD CHAIN FOR LABORATORY ANALYTICAL INSTRUMENTS

Non-Final OA §103
Filed
Sep 16, 2022
Examiner
LESNIEWSKI, VICTOR D
Art Unit
2493
Tech Center
2400 — Computer Networks
Assignee
Waters Technologies Ireland Limited
OA Round
5 (Non-Final)
58%
Grant Probability
Moderate
5-6
OA Rounds
3y 4m
To Grant
99%
With Interview

Examiner Intelligence

Grants 58% of resolved cases
58%
Career Allow Rate
275 granted / 476 resolved
At TC average
Strong +56% interview lift
Without
With
+55.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
26 currently pending
Career history
502
Total Applications
across all art units

Statute-Specific Performance

§101
7.8%
-32.2% vs TC avg
§103
54.5%
+14.5% vs TC avg
§102
18.1%
-21.9% vs TC avg
§112
11.3%
-28.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 476 resolved cases

Office Action

§103
DETAILED ACTION The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . The amendment filed 2/17/2026 has been placed of record in the file. Claims 1, 8, and 15 have been amended. Claims 5, 12, and 19 have been canceled. Claims 1-4, 7-11, 14-18, and 20 are now pending. The applicant’s arguments with respect to claims 1-4, 7-11, 14-18, and 20 have been fully considered but they are not persuasive as discussed below. 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 2/17/2026 has been entered. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1-4, 7-11, 14-18, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Young et al. (U.S. Patent Application Publication Number 2020/0021444), hereinafter referred to as Young, in view of Pagani et al. (U.S. Patent Application Publication Number 2023/0224174), hereinafter referred to as Pagani. Young disclosed techniques for managing analytical information using distributed ledgers. In an analogous art, Pagani disclosed techniques for file verification using a blockchain. Both systems are directed toward data storage and retrieval via blockchain records. Regarding claim 1, Young discloses a computer implemented method, comprising: receiving analytical data from a laboratory analytical instrument, wherein the analytical data is generated based on an auditable parameter (paragraphs 37-39, device receives generated analytical information); accessing a record for the auditable parameter, wherein the record is in the form of a node of a sequence representing a chain of authority tracing the auditable parameter backwards to a previous auditable parameter (paragraph 46, distributed ledger application facilitates chain), the sequence having nodes secured by a cryptographic hash based on respective content of one or more preceding nodes (paragraph 71, Merkel tree), wherein the auditable parameter and a previous auditable parameter from one of the one or more preceding nodes are each associated with a quality gate that triggers a respective record to be created, the quality gate representing a transition in an analytical workflow where responsibility for the data being analyzed passes from one user to a different user (paragraph 44, generates record for event in audit trail, and paragraph 38, audit trail includes changes in users); cryptographically securing the record based on the chain of authority to generate a cryptographically secured record (paragraph 46, generates record in distributed ledger, and paragraph 30, distributed ledger uses cryptography); and associating the cryptographically secured record with the data (paragraph 46, distributed ledger is for data generated by particular instrument). Young does not explicitly state that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive. However, using a tree structure overlaid on a blockchain was well known in the art as evidenced by Pagani. Since the inventions encompass the same field of endeavor, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the system of Young by adding the ability that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive as provided by Pagani (see paragraph 13, tree structure where each node is different transaction and one parent node is root node). One of ordinary skill in the art would have recognized the benefit that utilizing a tree structure in this way would assist in ensuring software security and data integrity (see Pagani, paragraph 12). Regarding claim 2, the combination of Young and Pagani discloses wherein the auditable parameter comprises an identification of at least one of a reagent, an instrument, a method, a calibration, or a quality control action (Young, paragraph 37, component information, operating methods, etc.). Regarding claim 3, the combination of Young and Pagani discloses wherein the record is compliant with an audit requirement defined by a regulatory or scientific authority (Young, paragraph 52, regulatory approval). Regarding claim 4, the combination of Young and Pagani discloses wherein the record traces back to a root comprising a standard, a pharmacopeia, a scientific paper, a regulation, or design data for a reagent or a part of the laboratory analytical instrument (Young, paragraph 51, implements verification against standard protocols). Regarding claim 7, the combination of Young and Pagani discloses wherein at least one record along the chain of authority is maintained by a third party, and further comprising: receiving a request to access the at least one record; transmitting the request to the third party; receiving the at least one record in response to the request, the at least one record secured by a cryptographic hash; and validating the at least one record using the cryptographic hash (Young, paragraph 45, accesses records via APIs, and paragraph 30, hash provides assurance as to integrity). Regarding claim 8, Young discloses a non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to: receive analytical data from a laboratory analytical instrument, wherein the analytical data is generated based on an auditable parameter (paragraphs 37-39, device receives generated analytical information); access a record for the auditable parameter, wherein the record is in the form of a node of a sequence representing a chain of authority tracing the auditable parameter backwards to a previous auditable parameter (paragraph 46, distributed ledger application facilitates chain), the sequence having nodes secured by a cryptographic hash based on respective content of one or more preceding nodes (paragraph 71, Merkel tree), wherein the auditable parameter and a previous auditable parameter from one of the one or more preceding nodes are each associated with a quality gate that triggers a respective record to be created, the quality gate representing a transition in an analytical workflow where responsibility for the data being analyzed passes from one user to a different user (paragraph 44, generates record for event in audit trail, and paragraph 38, audit trail includes changes in users); cryptographically secure the record based on the chain of authority to generate a cryptographically secured record (paragraph 46, generates record in distributed ledger, and paragraph 30, distributed ledger uses cryptography); and associate the cryptographically secured record with the data (paragraph 46, distributed ledger is for data generated by particular instrument). Young does not explicitly state that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive. However, using a tree structure overlaid on a blockchain was well known in the art as evidenced by Pagani. Since the inventions encompass the same field of endeavor, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the system of Young by adding the ability that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive as provided by Pagani (see paragraph 13, tree structure where each node is different transaction and one parent node is root node). One of ordinary skill in the art would have recognized the benefit that utilizing a tree structure in this way would assist in ensuring software security and data integrity (see Pagani, paragraph 12). Regarding claim 9, the combination of Young and Pagani discloses wherein the auditable parameter comprises an identification of at least one of a reagent, an instrument, a method, a calibration, or a quality control action (Young, paragraph 37, component information, operating methods, etc.). Regarding claim 10, the combination of Young and Pagani discloses wherein the record is compliant with an audit requirement defined by a regulatory or scientific authority (Young, paragraph 52, regulatory approval). Regarding claim 11, the combination of Young and Pagani discloses wherein the record traces back to a root comprising a standard, a pharmacopeia, a scientific paper, a regulation, or design data for a reagent or a part of the laboratory analytical instrument (Young, paragraph 51, implements verification against standard protocols). Regarding claim 14, the combination of Young and Pagani discloses wherein at least one record along the chain of authority is maintained by a third party, and wherein the instruction further configure the computer to: receive a request to access the at least one record; transmit the request to the third party; receive the at least one record in response to the request, the at least one record secured by a cryptographic hash; and validate the at least one record using the cryptographic hash (Young, paragraph 45, accesses records via APIs, and paragraph 30, hash provides assurance as to integrity). Regarding claim 15, Young discloses a computing apparatus comprising: a processor; and a memory storing instructions that, when executed by the processor, configure the apparatus to: receive analytical data from a laboratory analytical instrument, wherein the analytical data is generated based on an auditable parameter (paragraphs 37-39, device receives generated analytical information); access a record for the auditable parameter, wherein the record is in the form of a node of a sequence representing a chain of authority tracing the auditable parameter backwards to a previous auditable parameter (paragraph 46, distributed ledger application facilitates chain), the sequence having nodes secured by a cryptographic hash based on respective content of one or more preceding nodes (paragraph 71, Merkel tree), wherein the auditable parameter and a previous auditable parameter from one of the one or more preceding nodes are each associated with a quality gate that triggers a respective record to be created, the quality gate representing a transition in an analytical workflow where responsibility for the data being analyzed passes from one user to a different user (paragraph 44, generates record for event in audit trail, and paragraph 38, audit trail includes changes in users); cryptographically secure the record based on the chain of authority to generate a cryptographically secured record (paragraph 46, generates record in distributed ledger, and paragraph 30, distributed ledger uses cryptography); and associate the cryptographically secured record with the data (paragraph 46, distributed ledger is for data generated by particular instrument). Young does not explicitly state that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive. However, using a tree structure overlaid on a blockchain was well known in the art as evidenced by Pagani. Since the inventions encompass the same field of endeavor, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the system of Young by adding the ability that the sequence is a tree with each of the one or more preceding nodes representing a record of a different auditable parameter and at least one of the nodes of the tree serving as a parent node from which multiple branches derive as provided by Pagani (see paragraph 13, tree structure where each node is different transaction and one parent node is root node). One of ordinary skill in the art would have recognized the benefit that utilizing a tree structure in this way would assist in ensuring software security and data integrity (see Pagani, paragraph 12). Regarding claim 16, the combination of Young and Pagani discloses wherein the auditable parameter comprises an identification of at least one of a reagent, an instrument, a method, a calibration, or a quality control action (Young, paragraph 37, component information, operating methods, etc.). Regarding claim 17, the combination of Young and Pagani discloses wherein the record is compliant with an audit requirement defined by a regulatory or scientific authority (Young, paragraph 52, regulatory approval). Regarding claim 18, the combination of Young and Pagani discloses wherein the record traces back to a root comprising a standard, a pharmacopeia, a scientific paper, a regulation, or design data for a reagent or a part of the laboratory analytical instrument (Young, paragraph 51, implements verification against standard protocols). Regarding claim 20, the combination of Young and Pagani discloses wherein at least one record along the chain of authority is maintained by a third party, and wherein the instructions further configure the apparatus to: receive a request to access the at least one record; transmit the request to the third party; receive the at least one record in response to the request, the at least one record secured by a cryptographic hash; and validate the at least one record using the cryptographic hash (Young, paragraph 45, accesses records via APIs, and paragraph 30, hash provides assurance as to integrity). Response to Arguments In the remarks, the applicant has argued that the combination of Young and Pagani does not disclose the newly added features of the independent claims. However, Young is seen to teach these features. The applicant is directed to the newly added citations in the above rejection. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Victor Lesniewski whose telephone number is (571)272-2812. The examiner can normally be reached Monday thru Friday, 9am to 5pm. 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, Carl Colin can be reached at 571-272-3862. 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. /Victor Lesniewski/Primary Examiner, Art Unit 2493
Read full office action

Prosecution Timeline

Sep 16, 2022
Application Filed
Aug 08, 2024
Non-Final Rejection — §103
Nov 13, 2024
Response Filed
Dec 17, 2024
Final Rejection — §103
Mar 21, 2025
Request for Continued Examination
Mar 29, 2025
Response after Non-Final Action
May 29, 2025
Non-Final Rejection — §103
Sep 02, 2025
Response Filed
Oct 10, 2025
Final Rejection — §103
Dec 17, 2025
Interview Requested
Feb 17, 2026
Request for Continued Examination
Feb 26, 2026
Response after Non-Final Action
Mar 19, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12579276
Application Vulnerability Score Based on Stack Traces
2y 5m to grant Granted Mar 17, 2026
Patent 12580945
SIMULATION AND VISUALIZATION OF MALWARE SPREAD THROUGH SHARING OF DATA OBJECTS IN CLOUD APPLICATIONS
2y 5m to grant Granted Mar 17, 2026
Patent 12568378
SYSTEM AND METHOD FOR VALIDATING AUTHORITY OF DEVICE BASED ON IP ADDRESS
2y 5m to grant Granted Mar 03, 2026
Patent 12567970
METHOD FOR MANAGING A ONE-TIME-PASSWORD
2y 5m to grant Granted Mar 03, 2026
Patent 12566854
METHOD FOR DETECTING MOBILE MALICIOUS APPLICATION BASED ON IMPLEMENTATION FEATURES, RECORDING MEDIUM, AND DEVICE FOR PERFORMING THE METHOD
2y 5m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

5-6
Expected OA Rounds
58%
Grant Probability
99%
With Interview (+55.7%)
3y 4m
Median Time to Grant
High
PTA Risk
Based on 476 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month