Prosecution Insights
Last updated: November 04, 2026
Application No. 17/764,211

THE METHOD OF SINGLE-USE PROCESSING OF DATA SAVED IN A QUICK RESPONSE (QR) CODE

Non-Final OA §103
Filed
Mar 28, 2022
Priority
Aug 21, 2019 — EU 19020488.3 +1 more
Examiner
DIROMA, SCOTT MICHAEL
Art Unit
3698
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Semble8 Limited
OA Round
7 (Non-Final)
29%
Grant Probability
At Risk
7-8
OA Rounds
0m
Est. Remaining
58%
With Interview

Examiner Intelligence

Grants only 29% of cases
29%
Career Allowance Rate
13 granted / 45 resolved
-23.1% vs TC avg
Strong +29% interview lift
Without
With
+28.9%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
17 currently pending
Career history
68
Total Applications
across all art units

Statute-Specific Performance

§101
21.7%
-18.3% vs TC avg
§103
49.4%
+9.4% vs TC avg
§102
6.7%
-33.3% vs TC avg
§112
19.7%
-20.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 45 resolved cases

Office Action

§103
DETAILED ACTION Acknowledgements This Non-Final Office Action is in reply to Applicant’s RCE filed July 21, 2026. Claims 10-14 are amended. Claims 10-14 are currently pending. Claims 10-14 have been examined. Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 7/21/2026 has been entered. Claim Objections Claim 11 is objected to because “wherein the” is repeated: The method of claim 10, Claim Rejections - 35 USC § 103 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 10-14 are rejected under 35 U.S.C. 103 as being unpatentable over Kim (KR 20150059819 A, machine translation, cited on 3/28/22 IDS, figure 2 translation cited on June 5, 2024 PTO-892) in view of Kuehnel et al. (US 20130144879 A1). Regarding claim 10 Kim teaches: A method of single-use processing of data saved in a quick response (QR) code, the method comprising: {[0001] “The present invention is a process”} obtaining an image of the QR code using a scanning module; {[0008] “The camera recognizes the QR code”; Figure 2 (translated below) 310.} decoding the obtained image using a decoding module of an IT system to extract data saved in the QR code; {[0008] “The camera recognizes [decoding] the QR code”; Figure 2 (translated below) 310.} PNG media_image1.png 939 667 media_image1.png Greyscale processing the extracted data in the IT system, including determining whether the extracted data has been used previously; {[0009] “The medium connected to the camera and the communication device recognizes the ID, matches the ID to the server”; Figure 2 320 and 330.} Matching the ID to the server reads on determining because the ID is only present in the case where the data has not been used previously. enabling processing of the extracted data only if it is determined that the extracted data has not been used previously; {[0008] “a database including all ID values”; [0013] “The server determines whether the corresponding database value exists (330), and if the value exists [data has not been used previously], deletes the value (340) and imports the sound source list [processing the extracted data] included in the prepared FIG. 2 (360). The play event is executed based on the sound source list and the process ends (380).”; Figure 2 360} Kim teaches a QR code containing an ID ([0009]), and a database containing all ID values ([0008]). Kim further teaches when reading an ID value, both deleting it from the database and using the QR code data only if the ID value is present in the database ([0013]). It is therefore implied that the data-using and ID-deleting steps only occur when the data has not been used previously. preventing further processing of the extracted data when it is determined that the data has already been used. {[0009] “When there is no ID value [already been used], a process for single-use sound source reproduction is made by ending all events [preventing further processing]”; Figure 2 350} Kim teaches deleting ID values from a database to prevent re-use (see paragraph [0013]). Kim does not teach tagging the data to prevent re-use. However, Kuehnel teaches: performing a deactivation operation that prevents subsequent processing of the extracted data, wherein the deactivation operation comprises tagging the extracted data in connection with processing of the extracted data, in a manner that enables determination, during subsequent processing of the extracted data, that the extracted data has already been used; and {[0003] “The single-use data tag in the received packet is validated by searching for the single-use data tag in a tag store maintained by the cloud service. The collected data is stored based on the validation. The tag store is updated to prevent re-use of the single-use data tag.”; [0025] “The data tags 206 are "single-use" because each data tag 206 cannot be used for more than one submission to the cloud service 104. For example, as described herein, after submission of the tagged sensor data 314 to the cloud service 104, the probe device 102 discards, deletes, alters, voids, expires, or otherwise prevents the used data tag 206 from subsequent use.”; [0055] “For example, updating the tag store 504 may include removing the used data tag 206 from the tag store 504, updating a manifest of valid data tags 206, marking the data tag 206 as used [tagging], or otherwise preventing the data tag 206 from being used to store collected data again.”} It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to substitute the deleting of data of Kim with the altering/voiding of data of Kuehnel. Kuehnel teaches [0025] “discard[ing], delet[ing], alter[ing], void[ing], expir[ing]” are equivalent methods of making data single-use. A person would be motivated to make this change because Kuehnel’s approach of altering/voiding data has the benefit of allowing retention of used data and also allows identification of a subsequent attempt to use already used data as a second attempt, as opposed to an attempt to use data which was never stored in the database to begin with. Regarding claim 11 Kim teaches: The method of claim 10, {Fig. 2, steps 330 (processing) and 340 (deactivation)} Additionally, it is noted that the above limitation merely specifies the order of the processing and deactivation steps. The order of these two steps does not appear to have any effect on the operation of the method. Either way, the data is used and deactivated. This limitation is therefore considered obvious. See MPEP 2144.04 IV C “selection of any order of performing process steps is prima facie obvious in the absence of new or unexpected results.” Regarding claim 12 Kim does not teach, however Kuehnel teaches: The method of claim 10, wherein the deactivation operation comprises removing the extracted data from the IT system. {[0038] “For example, the data tag 206 may be altered by removing the identified single-use data tag 206 from the memory area, and/or altering the expiration data 312 to indicate that the identified single-use data tag 206 has expired.”} The reasons for substituting the marking and deleting data of Kuehnel for the deleting data of Kim is the same as given above in relation to claim 10. Regarding claim 13 Kim does not teach, however Kuehnel teaches: The method of claim 10, wherein the determining, processing, and deactivation are performed by a single module or by separate modules in the IT system. {[0067] “Embodiments of the invention may be described in the general context of computer-executable instructions, such as program modules, executed by one or more computers or other devices. The computer-executable instructions may be organized into one or more computer-executable components or modules.”; [0029] “The instructions may be performed by the processor 306 or by multiple processors executing within the mobile computing device”} It would have been obvious to a person of ordinary skill in the art before the effective filing date of the claimed invention to organize Kim’s smartphone executable functionality into one or more modules, as taught by Kuehnel, in order to logically group related software functions and permit those functions to be implemented and maintained as identifiable software components. Whether the functions are grouped as a single module or divided into multiple modules would allow the software to be organized with the desired degree of functional separation. Regarding claim 14 Kim teaches: The method of claim 10, wherein when it is determined that the extracted data has already been used, the extracted data is not sent to a processing module and further processing of the extracted data is prevented. {Fig. 2; [0009] “When there is no ID value, a process for single-use sound source reproduction is made by ending all events”} This step is made contingent on it being determined that the extracted data has already been used. Therefore, this step is not necessary when the condition is not satisfied. See MPEP 2111.04 II. CONTINGENT LIMITATIONS. In the method of Kim in view of Kuehnel, as discussed above, it is not necessary that it be determined that the extracted data has already been used, and the above step is therefore not required. However, it is taught by Kim. Response to Arguments Objections The previous objections are withdrawn due to the amendments. 35 USC § 112 All 112 rejections are withdrawn due to the amendments. 35 USC § 103 Applicant argues primary reference Kim deletes an identifier and leaves no information enabling subsequent determination of prior use, and that deletion therefore is not the claimed tagging operation. However, Kim is not relied upon for tagging. Kim supplies the QR-code acquisition, extraction, checking of the ID, conditional use, and termination when the ID is unavailable. Secondary reference Kuehnel supplies the used-tag marking operation that enables subsequent determination of prior use. Applicant further argues Kuehnel does not disclose the claimed deactivation operation because the claims require that tagging be performed “in connection with processing of the extracted data” whereas the tag in Kuehnel exists independently of the processing of the extracted data and is merely updated to reflect usage. However, it is not clear how this argument distinguishes the claim from the prior art. The quoted phrase is interpreted as merely requiring that the created tag data be associated with the processed data. Physical separation of the tag and processed data does not erase the association between the two. Applicant argues Kuehnel does not teach the claimed tagging operation because Kuehnel teaches updating a pre-existing tag and does not generate a tag. However, it is not clear what claim language Applicant is relying on that specifically requires generating a tag and not updating data. Furthermore, the teaching relied upon from Kuehnel is [0055] “marking the data tag 206 as used,” which suggests generation of a mark and therefore would satisfy Applicant’s stated requirement. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to SCOTT MICHAEL DIROMA whose telephone number is (571)272-6430. The examiner can normally be reached Monday - Friday 12:30 pm - 8:30 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, Patrick McAtee can be reached at (571) 272-7575. 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. /S.M.D./Examiner, Art Unit 3698 /PATRICK MCATEE/Supervisory Patent Examiner, Art Unit 3698
Read full office action

Prosecution Timeline

Show 9 earlier events
Sep 15, 2025
Request for Continued Examination
Sep 25, 2025
Response after Non-Final Action
Oct 02, 2025
Non-Final Rejection mailed — §103
Dec 17, 2025
Response Filed
Jan 27, 2026
Final Rejection mailed — §103
Jul 21, 2026
Request for Continued Examination
Jul 23, 2026
Response after Non-Final Action
Oct 05, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12731135
Proof of Cache Using Argon2d Cryptographic Hashing in Payment Processing
3y 10m to grant Granted Sep 08, 2026
Patent 12632854
COMPUTER-IMPLEMENTED SYSTEM AND METHOD
4y 1m to grant Granted May 19, 2026
Patent 12614171
METHOD AND SYSTEM FOR CANCELLATION OF DISTRIBUTED LEDGER TRANSACTIONS
4y 6m to grant Granted Apr 28, 2026
Patent 12481981
OPERATIONAL LIFECYCLE MANAGEMENT USING A DYNAMIC NON-FUNGIBLE TOKEN
3y 4m to grant Granted Nov 25, 2025
Patent 12450592
GENERATING AND MANAGING TOKENIZED ASSETS UTILIZING BLOCKCHAIN MINTING AND A DIGITAL PASSPORT
3y 4m to grant Granted Oct 21, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

7-8
Expected OA Rounds
29%
Grant Probability
58%
With Interview (+28.9%)
3y 2m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 45 resolved cases by this examiner. Grant probability derived from career allowance 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