Prosecution Insights
Last updated: April 19, 2026
Application No. 19/224,885

ACCESSING APPLICATION CONTENT AND FEATURES USING DEEP LINKING WITH WIRELESS PROTOCOLS OR SCANNABLE CODES

Non-Final OA §DP
Filed
Jun 01, 2025
Examiner
MIKELS, MATTHEW
Art Unit
2876
Tech Center
2800 — Semiconductors & Electrical Systems
Assignee
Capital One Services LLC
OA Round
1 (Non-Final)
81%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
To Grant
99%
With Interview

Examiner Intelligence

Grants 81% — above average
81%
Career Allow Rate
1044 granted / 1292 resolved
+12.8% vs TC avg
Strong +20% interview lift
Without
With
+20.4%
Interview Lift
resolved cases with interview
Typical timeline
2y 3m
Avg Prosecution
32 currently pending
Career history
1324
Total Applications
across all art units

Statute-Specific Performance

§101
1.6%
-38.4% vs TC avg
§103
43.0%
+3.0% vs TC avg
§102
38.4%
-1.6% vs TC avg
§112
4.4%
-35.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1292 resolved cases

Office Action

§DP
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 . Claims 1-20 are pending. 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. Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-19 of U.S. Patent No. 12,260,291 (herein the ‘291 patent). Although the claims at issue are not identical, they are not patentably distinct from each other because the claims are directed to and cover the same subject matter. As shown in the claim chart below, the limitations of instant claim 1 and claim 1 of the ‘291 patent contain similar, overlapping limitations such that the instant claims are rendered obvious by the claims of the ‘291 patent. The remaining dependent claims also recite similar, overlapping subject matter that render the instant claims obvious. Instant claim 1 ‘291 patent claim 1 A system for tracking user actions using deep links written into near field communication tags, the system comprising: one or more processors and non-transitory media storing instructions that, when executed by the one or more processors, cause operations comprising: A method for tracking user actions using visually scannable codes, the method comprising: in connection with a first request to generate a near field communication payload that links a first operator and a user, generating interpretable code and a deep link for executing the interpretable code that, when executed, links the first operator and the user, wherein the first request comprises (1) first action data describing a first action (2) a first operator identifier corresponding to the first operator, and (3) a user identifier of the user; receiving a first request to generate a first visually scannable code encoding a first action associated with both a user and a first operator, wherein the first request comprises first action data describing the first action; in connection with the first request to generate the near field communication payload, writing the deep link into the near field communication payload of a near field communication tag; in response to the first request, generating the first visually scannable code and storing, in a database, the first action data and a first operator identifier of the first operator; and in connection with the first visually scannable code, wherein the first visually scannable code embeds an identifier that enables retrieving the first action data and second action data associated with the user; detecting an update request to the near field communication tag, wherein the update request comprises (1) second action data describing a second action associated with the user, and (2) a second operator identifier corresponding to a second operator; receiving a second request to generate a second visually scannable code representing a second action associated with both the user and a second operator, wherein the second request comprises the second action data describing the second action; in response to the update request, retrieving, using the deep link within the near field communication tag, the interpretable code associated with the deep link; in response to the second request, generating the second visually scannable code and storing, in a database, the second action data and a second operator identifier of the second operators-and in connection with the second visually scannable code, wherein the second visually scannable code embeds the identifier that enables retrieving the first action data and the second action data; generating, based on the second action data and the second operator identifier, updated interpretable code associated with the deep link, wherein the updated interpretable code causes a user interface comprising a first action identifier of the first action, a second action identifier of the second action, the first operator identifier, the second operator identifier, and the user identifier to be generated for display; and in response to determining that the user completed the final action, retrieving the first action data and the second action data and updating, based on the first action data and the second action data. a first record associated with the first operator and a second record associated with the second operator, wherein updating the first record and the second record comprises:adding a first flag to the first record indicating a first portion of the final action, wherein the first portion is determined based on the first action data; and adding a second flag to the second record indicating a second portion of the final action, wherein the second portion is determined based on the second action data. in response to receiving a data access request comprising the deep link, executing the updated interpretable code associated with the deep link. receiving a second request to generate a second visually scannable code representing a second action associated with both the user and a second operator, wherein the second request comprises the second action data describing the second action; Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-19 of U.S. Patent No. 12,333,375 (herein the ‘375 patent). Although the claims at issue are not identical, they are not patentably distinct from each other because the claims are directed to and cover the same subject matter. As shown in the claim chart below, the limitations of instant claim 1 and claim 1 of the ‘375 patent contain similar, overlapping limitations such that the instant claims are rendered obvious by the claims of the ‘375 patent. The remaining dependent claims also recite similar, overlapping subject matter that render the instant claims obvious. Instant claim 1 ‘375 patent claim 1 A system for tracking user actions using deep links written into near field communication tags, the system comprising: one or more processors and non-transitory media storing instructions that, when executed by the one or more processors, cause operations comprising: A system for tracking user actions using deep links written into near field communication tags, the system comprising: one or more processors; and one or more non-transitory, computer-readable storage media storing instructions, which, when executed by the one or more processors, cause the one or more processors to perform operations comprising: in connection with a first request to generate a near field communication payload that links a first operator and a user, generating interpretable code and a deep link for executing the interpretable code that, when executed, links the first operator and the user, wherein the first request comprises (1) first action data describing a first action (2) a first operator identifier corresponding to the first operator, and (3) a user identifier of the user; receiving, from a first operator, a first request to generate a near field communication payload that links the first operator and a user, wherein the first request comprises (1) first action data describing a first action (2) a first operator identifier corresponding to the first operator, and (3) a user identifier of the user; in connection with the first request to generate the near field communication payload, writing the deep link into the near field communication payload of a near field communication tag; in response to the first request, generating interpretable code and a deep link for executing the interpretable code, wherein the interpretable code links the first operator, the user, and the first action using the first operator identifier and the user identifier of the user; detecting an update request to the near field communication tag, wherein the update request comprises (1) second action data describing a second action associated with the user, and (2) a second operator identifier corresponding to a second operator; detecting an update request to the near field communication tag, wherein the update request comprises (1) second action data describing a second action associated with the user, and (2) a second operator identifier corresponding to a second operator; in response to the update request, retrieving, using the deep link within the near field communication tag, the interpretable code associated with the deep link; generating, based on the second action data and the second operator identifier, updated interpretable code associated with the deep link, wherein the updated interpretable code causes a user interface comprising a first action identifier of the first action, a second action identifier of the second action, the first operator identifier, the second operator identifier, and the user identifier to be generated for display; and generating updated interpretable code based on the second action data and the second operator identifier, wherein the updated interpretable code causes a user interface comprising a first action identifier of the first action, a second action identifier of the second action, the first operator identifier, the second operator identifier, and the user identifier to be generated for display; in response to receiving a data access request comprising the deep link, executing the updated interpretable code associated with the deep link. receiving a data access request comprising the deep link; and based on receiving the data access request comprising the deep link, executing the updated interpretable code associated with the deep link. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MATTHEW MIKELS whose telephone number is (571)270-5470. The examiner can normally be reached Monday to Thursday 7:00 AM ET - 4:30 PM ET, Friday 7:00 AM ET - 11:00 AM ET, the Examiner is on central time.1 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, Michael G Lee can be reached at 571-272-2398. 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. /MATTHEW MIKELS/Primary Examiner, Art Unit 2876 1 The Examiner can also be reached at matthew.mikels@uspto.gov.
Read full office action

Prosecution Timeline

Jun 01, 2025
Application Filed
Jan 13, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12597011
System and method to dynamically evaluate patterns in smart card operations
2y 5m to grant Granted Apr 07, 2026
Patent 12591754
SMART CONNECTED FILM AND PLATFORM
2y 5m to grant Granted Mar 31, 2026
Patent 12585908
VISUAL MARKER
2y 5m to grant Granted Mar 24, 2026
Patent 12573272
SYSTEMS AND METHODS FOR ATM SESSION CACHING
2y 5m to grant Granted Mar 10, 2026
Patent 12572767
Method for processing data from one- or two-dimensional code, and corresponding devices and program
2y 5m to grant Granted Mar 10, 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

1-2
Expected OA Rounds
81%
Grant Probability
99%
With Interview (+20.4%)
2y 3m
Median Time to Grant
Low
PTA Risk
Based on 1292 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