Prosecution Insights
Last updated: October 02, 2026
Application No. 19/364,521

SYSTEM AND METHOD FOR IMPROVING WORK LOAD MANAGEMENT IN ACR TELEVISION MONITORING SYSTEM

Non-Final OA §102§DOUBLEPATENT
Filed
Oct 21, 2025
Priority
Jul 16, 2015 — provisional 62/193,345 +3 more
Examiner
HERSHLEY, MARK E
Art Unit
2164
Tech Center
2100 — Computer Architecture & Software
Assignee
Inscape Data Inc.
OA Round
1 (Non-Final)
78%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
Est. Remaining
97%
With Interview

Examiner Intelligence

Grants 78% — above average
78%
Career Allowance Rate
440 granted / 562 resolved
+23.3% vs TC avg
Strong +19% interview lift
Without
With
+18.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
13 currently pending
Career history
581
Total Applications
across all art units

Statute-Specific Performance

§101
13.8%
-26.2% vs TC avg
§103
48.2%
+8.2% vs TC avg
§102
22.0%
-18.0% vs TC avg
§112
7.8%
-32.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 562 resolved cases

Office Action

§102 §DOUBLEPATENT
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 2 – 21 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 2 – 21 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1 – 7 of U.S. Patent No. 10,949,458. Although the claims at issue are not identical, they are not patentably distinct from each other because of the mapping below: Current Application 19/364,521 US Patent No. 10,949,458 2. (New) A system comprising: one or more processors; and one or more non-transitory machine-readable storage media storing instructions that when executed by the one or more processors, cause the one or more processors to perform operations including: receiving an unknown content identifiers corresponding to unknown media segment being displayed by a media system; searching a real-time database using the unknown content identifiers, wherein the real-time database stores a first set of known content identifiers associated with a first set of known media segments, and wherein the first set of known media segments is associated with contextually-related data; identifying the unknown media segment in response to determining that the unknown content identifiers corresponds to known content identifiers associated with a particular known media segment of the real-time database; facilitating a presentation, by the media system, of contextually-related data associated with the particular known media segment of the real-time database; searching a non-real-time database using the unknown content identifiers in response to determining that the unknown content identifiers do not correspond to known content identifiers in the real-time database; and identifying the unknown media segment in response to determining that the unknown content identifiers corresponds to known content identifiers associated with a particular known media segment of the non-real-time database. 1. A system comprising: one or more processors; and one or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: receiving a plurality of known media content, wherein the plurality of known media content has associated known content identifiers; storing the known content identifiers associated with the plurality of known media content in a non-real-time database; determining a subset of the plurality of known media content, the known media content in the determined subset having associated contextually-related data; storing known content identifiers associated with the subset of the plurality of known media content in a real-time database, wherein the known content identifiers associated with the determined subset are stored in the real-time database based on the known media content in the determined subset having the associated contextually-related data, and wherein the real-time database is searched for matching unknown content identifiers before the non-real-time database is searched; receiving unknown content identifiers corresponding to unknown media content being displayed by a media system; searching the real-time database using the unknown content identifiers to determine whether the unknown content identifiers correspond to known content identifiers associated with the subset of the plurality of known media content in the real-time database; selecting known media content associated with the corresponding known content identifiers from the real-time database and identifying the unknown media content as the selected known media content from the real-time database, when the unknown content identifiers correspond to known content identifiers in the real-time database; searching the non-real-time database using the unknown content identifiers when the unknown content identifiers do not correspond to known content identifiers in the real-time database; and selecting known media content associated with known content identifiers from the non-real-time database corresponding to the unknown content identifiers and identifying the unknown media content as the selected known media content from the non-real-time database. 3. (New) The system of claim 2, wherein the real-time database is searched before the non-real-time database. 1. A system comprising: one or more processors; and one or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: receiving a plurality of known media content, wherein the plurality of known media content has associated known content identifiers; storing the known content identifiers associated with the plurality of known media content in a non-real-time database; determining a subset of the plurality of known media content, the known media content in the determined subset having associated contextually-related data; storing known content identifiers associated with the subset of the plurality of known media content in a real-time database, wherein the known content identifiers associated with the determined subset are stored in the real-time database based on the known media content in the determined subset having the associated contextually-related data, and wherein the real-time database is searched for matching unknown content identifiers before the non-real-time database is searched; receiving unknown content identifiers corresponding to unknown media content being displayed by a media system; searching the real-time database using the unknown content identifiers to determine whether the unknown content identifiers correspond to known content identifiers associated with the subset of the plurality of known media content in the real-time database; selecting known media content associated with the corresponding known content identifiers from the real-time database and identifying the unknown media content as the selected known media content from the real-time database, when the unknown content identifiers correspond to known content identifiers in the real-time database; searching the non-real-time database using the unknown content identifiers when the unknown content identifiers do not correspond to known content identifiers in the real-time database; and selecting known media content associated with known content identifiers from the non-real-time database corresponding to the unknown content identifiers and identifying the unknown media content as the selected known media content from the non-real-time database. 4. (New) The system of claim 2, wherein the operations further include: calculating statistics using the particular known media segment from the non-real-time database, when the unknown content identifiers do not correspond to known content identifiers in the real-time database. 3. The system of claim 1, wherein the operations further include: calculating statistics using the selected known media content from the non-real-time database, when the unknown content identifiers do not correspond to known content identifiers in the real-time database. 5. (New) The system of claim 2, wherein the unknown content identifiers comprise at least one of a sample of pixel data or a sample of audio data of the unknown media segment. 4. The system of claim 1, wherein the unknown content identifiers comprise at least one of a sample of pixel data or a sample of audio data of the unknown media content being displayed by the media system. 6. (New) The system of claim 2, wherein the operations further include: determining an offset time associated with the unknown media segment using the unknown content identifiers and the known content identifiers associated with the particular known media segment of the real-time database. 5. The system of claim 1, wherein the operations further include: determining an offset time associated with the unknown media content using the unknown content identifiers and the known content identifiers associated with the selected known media content. 7. (New) The system of claim 2, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in the media system. 6. The system of claim 1, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in the media system. 8. (New) The system of claim 2, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in a server located remotely from the media system. 7. The system of claim 1, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in a server located remotely from the media system. Claims 9 – 15 are rejected using similar mapping to the rejection of claims 2 – 8 above. Claims 16 – 21 are rejected using similar mapping to the rejection of claims 2 – 7 above. Claims 2, 3, 7, 9, 10, 14, 16, 17 and 21 rejected on the ground of nonstatutory double patenting as being unpatentable over claim 4 of U.S. Patent No. 12,321,377. Although the claims at issue are not identical, they are not patentably distinct from each other because of the mapping below: Current Application 19/364,521 US Patent No. 12,321,377 2. (New) A system comprising: one or more processors; and one or more non-transitory machine-readable storage media storing instructions that when executed by the one or more processors, cause the one or more processors to perform operations including: receiving an unknown content identifiers corresponding to unknown media segment being displayed by a media system; searching a real-time database using the unknown content identifiers, wherein the real-time database stores a first set of known content identifiers associated with a first set of known media segments, and wherein the first set of known media segments is associated with contextually-related data; identifying the unknown media segment in response to determining that the unknown content identifiers corresponds to known content identifiers associated with a particular known media segment of the real-time database; facilitating a presentation, by the media system, of contextually-related data associated with the particular known media segment of the real-time database; searching a non-real-time database using the unknown content identifiers in response to determining that the unknown content identifiers do not correspond to known content identifiers in the real-time database; and identifying the unknown media segment in response to determining that the unknown content identifiers corresponds to known content identifiers associated with a particular known media segment of the non-real-time database. 1. A system comprising: one or more processors; and one or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: storing a first set of known content identifiers associated with a first subset of known media content in a non-real-time database; storing a second set of known content identifiers associated with a second subset of known media content in a real-time database, wherein the second set of known content identifiers are stored in the real-time database based on the second subset of known media content having associated contextually-related data; receiving unknown content identifiers corresponding to unknown media content being displayed by a media system; searching the real-time database using the unknown content identifiers to determine whether the unknown content identifiers correspond to known content identifiers associated with the second subset of known media content of the real-time database, wherein the real-time database is searched for matching unknown content identifiers before the non-real-time database is searched; selecting known media content associated with known content identifiers of the real-time database based on the unknown content identifiers corresponding to the known content identifiers in the real-time database; and facilitating substitution of the unknown media content using contextually-related data associated with the selected known media content. 4. The system of claim 1, wherein the operations further comprise: receiving additional unknown content identifiers corresponding to additional unknown media content being displayed by a media system; searching the real-time database using the additional unknown content identifiers to determine whether the additional unknown content identifiers correspond to known content identifiers associated with the second subset of known media content in the real-time database; searching the non-real-time database using the additional unknown content identifiers when the additional unknown content identifiers do not correspond to known content identifiers of the second set of known content identifiers of the real-time database; selecting additional known media content associated with known content identifiers of the first set of known content identifiers of the non-real-time database; and identifying the additional unknown media content as the selected additional known media content from the non-real-time database. 3. (New) The system of claim 2, wherein the real-time database is searched before the non-real-time database. 1. A system comprising: one or more processors; and one or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: storing a first set of known content identifiers associated with a first subset of known media content in a non-real-time database; storing a second set of known content identifiers associated with a second subset of known media content in a real-time database, wherein the second set of known content identifiers are stored in the real-time database based on the second subset of known media content having associated contextually-related data; receiving unknown content identifiers corresponding to unknown media content being displayed by a media system; searching the real-time database using the unknown content identifiers to determine whether the unknown content identifiers correspond to known content identifiers associated with the second subset of known media content of the real-time database, wherein the real-time database is searched for matching unknown content identifiers before the non-real-time database is searched; selecting known media content associated with known content identifiers of the real-time database based on the unknown content identifiers corresponding to the known content identifiers in the real-time database; and facilitating substitution of the unknown media content using contextually-related data associated with the selected known media content. 4. The system of claim 1, wherein the operations further comprise: receiving additional unknown content identifiers corresponding to additional unknown media content being displayed by a media system; searching the real-time database using the additional unknown content identifiers to determine whether the additional unknown content identifiers correspond to known content identifiers associated with the second subset of known media content in the real-time database; searching the non-real-time database using the additional unknown content identifiers when the additional unknown content identifiers do not correspond to known content identifiers of the second set of known content identifiers of the real-time database; selecting additional known media content associated with known content identifiers of the first set of known content identifiers of the non-real-time database; and identifying the additional unknown media content as the selected additional known media content from the non-real-time database. 7. (New) The system of claim 2, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in the media system. 1. A system comprising: one or more processors; and one or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: storing a first set of known content identifiers associated with a first subset of known media content in a non-real-time database; storing a second set of known content identifiers associated with a second subset of known media content in a real-time database, wherein the second set of known content identifiers are stored in the real-time database based on the second subset of known media content having associated contextually-related data; receiving unknown content identifiers corresponding to unknown media content being displayed by a media system; searching the real-time database using the unknown content identifiers to determine whether the unknown content identifiers correspond to known content identifiers associated with the second subset of known media content of the real-time database, wherein the real-time database is searched for matching unknown content identifiers before the non-real-time database is searched; selecting known media content associated with known content identifiers of the real-time database based on the unknown content identifiers corresponding to the known content identifiers in the real-time database; and facilitating substitution of the unknown media content using contextually-related data associated with the selected known media content. 4. The system of claim 1, wherein the operations further comprise: receiving additional unknown content identifiers corresponding to additional unknown media content being displayed by a media system; searching the real-time database using the additional unknown content identifiers to determine whether the additional unknown content identifiers correspond to known content identifiers associated with the second subset of known media content in the real-time database; searching the non-real-time database using the additional unknown content identifiers when the additional unknown content identifiers do not correspond to known content identifiers of the second set of known content identifiers of the real-time database; selecting additional known media content associated with known content identifiers of the first set of known content identifiers of the non-real-time database; and identifying the additional unknown media content as the selected additional known media content from the non-real-time database. Claims 9, 10 and 14 are rejected using similar mapping to claims 2, 3 and 7 above. Claims 16, 17 and 21 are rejected using similar mapping to claims 2, 3 and 7 above. Claim Rejections - 35 USC § 102 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 the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 2 – 21 are is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by US 7,346,512 B2 issued to Wang et al (hereinafter Wang). As to claim 2, Wang discloses a system comprising: one or more processors (processors, see Wang: Col. 7 lines 16 - 63); and one or more non-transitory machine-readable storage media storing instructions that when executed by the one or more processors (computer memory storing instructions, see Wang: Col. 7 lines 16 - 63), cause the one or more processors to perform operations including: receiving an unknown content identifiers corresponding to unknown media segment being displayed by a media system (unknown media sample fingerprints are received, see Wang: Col. 3 lines 50 – 60); searching a real-time database using the unknown content identifiers, wherein the real-time database stores a first set of known content identifiers associated with a first set of known media segments, and wherein the first set of known media segments is associated with contextually-related data (searching for fingerprints of the unknown media sample in the database index stored in ram, see Wang: Col. 7 line 16 – Col. 8 line 28, and Col. 16 line 9 – 38, and fingerprints are stored with landmark and sound_ID for the audio samples, see Wang: Col. 14 line 47 – Col. 15 line 27); identifying the unknown media segment in response to determining that the unknown content identifiers correspond to known content identifiers associated with a particular known media segment of the real-time database (matching the unknown media sample’s fingerprints to known fingerprints in the database index, see Wang: Col. 16 lines 9 – 38); facilitating a presentation, by the media system, of contextually-related data associated with the particular known media segment of the real-time database (presenting a candidate list for identification with exogenous sound sample, see Wang: Col. 16 lines 9 - 38); searching a non-real-time database using the unknown content identifiers in response to determining that the unknown content identifiers do not correspond to known content identifiers in the real-time database (if no match is found, additional index search is performed and then all files are diagonal line scanned for matches, see Wang: Col. 18 line 58 – Col. 19 line 44); and identifying the unknown media segment in response to determining that the unknown content identifiers corresponds to known content identifiers associated with a particular known media segment of the non-real-time database (identifying matches after the full diagonal line scan, see Wang: Col. 18 line 58 – Col. 19 line 44). As to claim 3, Wang discloses the system of claim 2, wherein the real-time database is searched before the non-real-time database (first segment of database index is searched, then the rest of the segments and then full diagonal line scan on all files of database, see Wang: Col. 18 line 58 – Col. 19 line 44). As to claim 4, Wang discloses the system of claim 2, wherein the operations further include: calculating statistics using the particular known media segment from the non-real-time database, when the unknown content identifiers do not correspond to known content identifiers in the real-time database (use of fingerprints, landmarks and determination of time evolutions to determine similar but not identical matches and additional use of time stretching and diagonal line scan of scatter plot of sample data, see Wang: Col. 16 line 39 – Col. 18 line 38). As to claim 5, Wang discloses the system of claim 2, wherein the unknown content identifiers comprise at least one of a sample of pixel data or a sample of audio data of the unknown media segment (fingerprints are computed by analysis of audio samples, see Wang: Col. 4 lines 26 – 36). As to claim 6, Wang discloses the system of claim 2, wherein the operations further include: determining an offset time associated with the unknown media segment using the unknown content identifiers and the known content identifiers associated with the particular known media segment of the real-time database (determination of time offset for the unknown sample and use in comparison to landmarks of known samples, see Wang: Col. 16 line 39 – Col. 18 line 38). As to claim 7, Wang discloses the system of claim 2, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in the media system (processors and computer memory storing instructions of the media recognition system, see Wang: Col. 7 lines 16 - 63). As to claim 8, Wang discloses the system of claim 2, wherein the one or more processors and the one or more non-transitory machine-readable storage media are comprised in a server located remotely from the media system (processing devices can be a remote terminal, see Wang: Col. 7 line 64 – Col. 8 line 28). Claims 9 – 15 are rejected using similar rationale to the rejection of claims 2 – 8 above. Claims 16 – 21 are rejected using similar rationale to the rejection of claims 2 – 7 above. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MARK E HERSHLEY whose telephone number is (571)270-7774. The examiner can normally be reached M-F: 9am-6pm. 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, Amy Ng can be reached at (571) 270-1698. 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. /MARK E HERSHLEY/Primary Examiner, Art Unit 2164
Read full office action

Prosecution Timeline

Oct 21, 2025
Application Filed
Aug 12, 2026
Non-Final Rejection mailed — §102, §DOUBLEPATENT (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12724794
DATA MANAGEMENT
4y 2m to grant Granted Sep 01, 2026
Patent 12724760
METHODS AND RELATED DEVICES FOR STORING AND ACCESSING DATA USING MULTI-LEVEL FRACTAL GRIDS
2y 11m to grant Granted Sep 01, 2026
Patent 12717854
SYSTEMS AND METHODS FOR DETERMINING SEARCH TOKEN IMPORTANCE USING MACHINE LEARNING ARCHITECTURES
2y 2m to grant Granted Aug 25, 2026
Patent 12705215
HYBRID DATA-COMPUTE PLATFORM
2y 10m to grant Granted Aug 11, 2026
Patent 12688244
SYSTEM AND METHOD FOR USING GRAPH THEORY TO RANK CHARACTERISTICS
2y 3m to grant Granted Jul 21, 2026
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

1-2
Expected OA Rounds
78%
Grant Probability
97%
With Interview (+18.7%)
3y 2m (~2y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 562 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