Prosecution Insights
Last updated: October 27, 2026
Application No. 19/088,310

TECHNIQUES FOR SUPPLEMENTING FOR WEB CONTENT

Non-Final OA §103
Filed
Mar 24, 2025
Priority
Jun 08, 2024 — provisional 63/657,846
Examiner
BATURAY, ALICIA
Art Unit
2453
Tech Center
2400 — Computer Networks
Assignee
Apple Inc.
OA Round
1 (Non-Final)
81%
Grant Probability
Favorable
1-2
OA Rounds
1y 2m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 81% — above average
81%
Career Allowance Rate
631 granted / 777 resolved
+23.2% vs TC avg
Strong +18% interview lift
Without
With
+18.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
10 currently pending
Career history
791
Total Applications
across all art units

Statute-Specific Performance

§101
13.1%
-26.9% vs TC avg
§103
54.7%
+14.7% vs TC avg
§102
18.4%
-21.6% vs TC avg
§112
6.5%
-33.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 777 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 . Claims 1-11 are presented for examination. 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, 2, and 8-11 are rejected under 35 U.S.C. 103 as being unpatentable over Jia et al. (U.S. 11,822,612) and Stolbikov et al. (U.S. 11,374,898). With respect to claim 1, Jia teaches a method, comprising: by a client computing device: receiving a first request to load a webpage associated with a uniform resource locator (URL) (Jia, Fig. 1, element 30; col. 11, lines 23-25); identifying, by comparing a domain of the URL against (Jia, col. 11, lines 41-44), that there potentially exists a respective at least one webpage supplement for the webpage (Jia, col. 7, lines 51-60; col. 11, lines 41-48; and col. 1, lines 28-44), wherein: a plurality of domains; and respective one or more webpage supplements exist for each domain of the plurality of domains (Jia, col. 9, lines 27-39); identifying, by interfacing with a management entity (Jia, col. 10, lines 7-15), that the respective at least one webpage supplement in fact exists (Jia, col. 7, line 61 – col. 9, line 26); displaying at least one affordance that corresponds to the respective at least one webpage supplement (Jia, col. 11, lines 32-40); receiving, by way of the at least one affordance, a second request to access the respective at least one webpage supplement (Jia, col. 7, lines 39-50); and causing at least a portion of the respective at least one webpage supplement to be output by way of a user interface (Jia, col. 11, lines 62-67). Jia does not explicitly teach a probabilistic data structure; and the probabilistic data structure is based on. However, Stolbikov teaches a probabilistic data structure (Stolbikov, col. 2, lines 23-30); and the probabilistic data structure is based on (Stolbikov, col. 2, lines 23-30). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify Jia in view of Stolbikov in order to enable the use of a probabilistic data structure; and the probabilistic data structure is based on. One would be motivated to do so in order to increase privacy and confidentiality (Stolbikov, col. 4, lines 3-4). With respect to claim 2, the combination of Jia and Stolbikov teaches the invention described in claim 1, including the method further comprising: prior to comparing the domain of the URL against the probabilistic data structure: referencing the domain against a group of blocked domains (Jia, col. 8, lines 31-48); and determining that the domain is not included in the group of blocked domains (Jia, col. 8, lines 17-30). The combination of references is made under the same rationale as claim 1 above. With respect to claim 8, the combination of Jia and Stolbikov teaches the invention described in claim 1, including the method wherein the respective at least one webpage supplement comprises: a summary of content included in the webpage (Jia, col. 1, lines 28-44); a table of contents of different sections included in the webpage; identifications of a person, a place, a topic, or media content included in the webpage; or some combination thereof. The combination of references is made under the same rationale as claim 1 above. With respect to claim 9, the combination of Jia and Stolbikov teaches the invention described in claim 1, including the method wherein, when the respective at least one webpage supplement includes two or more webpage supplements, the method further comprises: establishing, for each webpage supplement of the two or more webpage supplements, a respective client ranking score based on preferences associated with a user account registered on the client computing device, a respective server ranking score associated with the webpage supplement, or some combination thereof; and identifying, based on the client ranking scores, a most relevant webpage supplement of the two or more webpage supplements, wherein causing the at least a portion of the respective at least one webpage supplement to be output by way of the user interface involves displaying at least a portion of the most relevant webpage supplement (Jia, col. 13, lines 40-64). The combination of references is made under the same rationale as claim 1 above. With respect to claim 10, Jia teaches a non-transitory computer-readable storage medium storing one or more programs configured to be executed by one or more processors of a computing device, the one or more programs include instructions for: receiving a first request to load a webpage associated with a uniform resource locator (URL) (Jia, Fig. 1, element 30; col. 11, lines 23-25); identifying, by comparing a domain of the URL against (Jia, col. 11, lines 41-44), that there potentially exists a respective at least one webpage supplement for the webpage (Jia, col. 7, lines 51-60; col. 11, lines 41-48; and col. 1, lines 28-44), wherein: a plurality of domains; and respective one or more webpage supplements exist for each domain of the plurality of domains (Jia, col. 9, lines 27-39); identifying, by interfacing with a management entity (Jia, col. 10, lines 7-15), that the respective at least one webpage supplement in fact exists (Jia, col. 7, line 61 – col. 9, line 26); displaying at least one affordance that corresponds to the respective at least one webpage supplement (Jia, col. 11, lines 32-40); receiving, by way of the at least one affordance, a second request to access the respective at least one webpage supplement (Jia, col. 7, lines 39-50); and causing at least a portion of the respective at least one webpage supplement to be output by way of a user interface (Jia, col. 11, lines 62-67). Jia does not explicitly teach a probabilistic data structure; and the probabilistic data structure is based on. However, Stolbikov teaches a probabilistic data structure (Stolbikov, col. 2, lines 23-30); and the probabilistic data structure is based on (Stolbikov, col. 2, lines 23-30). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify Jia in view of Stolbikov in order to enable the use of a probabilistic data structure; and the probabilistic data structure is based on. One would be motivated to do so in order to increase privacy and confidentiality (Stolbikov, col. 4, lines 3-4). With respect to claim 11, Jia teaches a computing device, comprising: one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for: receiving a first request to load a webpage associated with a uniform resource locator (URL) (Jia, Fig. 1, element 30; col. 11, lines 23-25); identifying, by comparing a domain of the URL against (Jia, col. 11, lines 41-44), that there potentially exists a respective at least one webpage supplement for the webpage (Jia, col. 7, lines 51-60; col. 11, lines 41-48; and col. 1, lines 28-44), wherein: a plurality of domains, and respective one or more webpage supplements exist for each domain of the plurality of domains (Jia, col. 9, lines 27-39); identifying, by interfacing with a management entity (Jia, col. 10, lines 7-15), that the respective at least one webpage supplement in fact exists (Jia, col. 7, line 61 – col. 9, line 26); displaying at least one affordance that corresponds to the respective at least one webpage supplement (Jia, col. 11, lines 32-40); receiving, by way of the at least one affordance, a second request to access the respective at least one webpage supplement (Jia, col. 7, lines 39-50); and causing at least a portion of the respective at least one webpage supplement to be output by way of a user interface (Jia, col. 11, lines 62-67). Jia does not explicitly teach a probabilistic data structure; and the probabilistic data structure is based on. However, Stolbikov teaches a probabilistic data structure (Stolbikov, col. 2, lines 23-30); and the probabilistic data structure is based on (Stolbikov, col. 2, lines 23-30). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify Jia in view of Stolbikov in order to enable the use of a probabilistic data structure; and the probabilistic data structure is based on. One would be motivated to do so in order to increase privacy and confidentiality (Stolbikov, col. 4, lines 3-4). Claims 3-7 are rejected under 35 U.S.C. 103 as being unpatentable over Jia in view of Stolbikov and further in view of Abbasian et al. (U.S. 11,593,082). With respect to claim 3, Jia teaches the invention described in claim 1, including a method, comprising: by a client computing device: receiving a first request to load a webpage associated with a uniform resource locator (URL) (Jia, Fig. 1, element 30; col. 11, lines 23-25); identifying, by comparing a domain of the URL against (Jia, col. 11, lines 41-44), that there potentially exists a respective at least one webpage supplement for the webpage (Jia, col. 7, lines 51-60; col. 11, lines 41-48; and col. 1, lines 28-44), wherein: a plurality of domains; and respective one or more webpage supplements exist for each domain of the plurality of domains (Jia, col. 9, lines 27-39); identifying, by interfacing with a management entity (Jia, col. 10, lines 7-15), that the respective at least one webpage supplement in fact exists (Jia, col. 7, line 61 – col. 9, line 26); displaying at least one affordance that corresponds to the respective at least one webpage supplement (Jia, col. 11, lines 32-40); receiving, by way of the at least one affordance, a second request to access the respective at least one webpage supplement (Jia, col. 7, lines 39-50); and causing at least a portion of the respective at least one webpage supplement to be output by way of a user interface (Jia, col. 11, lines 62-67); and the method wherein identifying that the respective at least one webpage supplement in fact exists (Jia, col. 7, line 61 – col. 9, line 26) comprises: the management entity (Jia, col. 10, lines 7-15); and from the management entity (Jia, col. 10, lines 7-15). Jia does not explicitly teach a probabilistic data structure; and the probabilistic data structure is based on. However, Stolbikov teaches a probabilistic data structure (Stolbikov, col. 2, lines 23-30); and the probabilistic data structure is based on (Stolbikov, col. 2, lines 23-30). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify Jia in view of Stolbikov in order to enable the use of a probabilistic data structure; and the probabilistic data structure is based on. One would be motivated to do so in order to increase privacy and confidentiality (Stolbikov, col. 4, lines 3-4). The combination of Jia and Stolbikov does not explicitly teach identifying that the URL can be matched to a particular URL pattern definition among a plurality of URL pattern definitions; generating an updated URL based on the URL and the particular URL pattern definition; generating a hash value based on the updated URL; truncating suffix information from the hash value to produce a hash prefix value; providing the hash prefix value to; receiving, , a plurality of hash values, wherein each hash value of the plurality of hash values has a respective hash prefix value that matches the hash prefix value; and identifying that the hash value matches one of the hash values included in the plurality of hash values. However, Abbasian teaches identifying that the URL can be matched to a particular URL pattern definition among a plurality of URL pattern definitions; generating an updated URL based on the URL and the particular URL pattern definition; generating a hash value based on the updated URL; truncating suffix information from the hash value to produce a hash prefix value; providing the hash prefix value to (Abbasian, col. 6, lines 4-12 and 18-50); receiving (Abbasian, col. 6, line 56 – col. 7, line 4), , a plurality of hash values, wherein each hash value of the plurality of hash values has a respective hash prefix value that matches the hash prefix value; and identifying that the hash value matches one of the hash values included in the plurality of hash values (Abbasian, col. 6, line 56 – col. 7, line 4). 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 combination of Jia and Stolbikov in view of Abbasian in order to enable identifying that the URL can be matched to a particular URL pattern definition among a plurality of URL pattern definitions; generating an updated URL based on the URL and the particular URL pattern definition; generating a hash value based on the updated URL; truncating suffix information from the hash value to produce a hash prefix value; providing the hash prefix value to; receiving, , a plurality of hash values, wherein each hash value of the plurality of hash values has a respective hash prefix value that matches the hash prefix value; and identifying that the hash value matches one of the hash values included in the plurality of hash values. One would be motivated to do so in order to provide users of electronic devices with rapid access to new device functionality that is tailored to the user (e.g., to the current environment, actions, or location of the user) and that are high quality, secure applications (Abbasian, col. 8, lines 38-44). With respect to claim 4, the combination of Jia, Stolbikov, and Abbasian teaches the invention described in claim 1, including the method wherein identifying that the respective at least one webpage supplement in fact exists comprises: identifying that the URL cannot be matched to a particular URL pattern definition among a plurality of URL pattern definitions; removing, from the URL, any query string and fragment identifier information, to produce a filtered URL; providing the filtered URL to a hash function to produce a hash value; and truncating suffix information from the hash value to produce a hash prefix value (Abbasian, col. 6, lines 4-50). The combination of references is made under the same rationale as claim 3 above. With respect to claim 5, the combination of Jia, Stolbikov, and Abbasian teaches the invention described in claim 4, including the method further comprising: providing the hash prefix value to (Abbasian, col. 6, lines 53-56) the management entity (Jia, col. 10, lines 7-15); receiving, from the management entity (Jia, col. 10, lines 7-15), a plurality of hash values (Abbasian, col. 6, lines 56-65), wherein each hash value of the plurality of hash values: has a respective hash prefix value that matches the hash prefix value; and is associated with a respective plurality of secondary hash values, wherein each secondary hash value of the respective plurality of secondary hash values is based on a respective URL variation of a particular URL to which the hash value corresponds; generating a plurality of URL variations based on the URL; generating, for each URL variation of the plurality of URL variations, a respective hash value; and identifying, among the respective hash values for the plurality of URL variations, a particular respective hash value that matches a particular one of the secondary hash values (Abbasian, col. 19, line 34 – col. 20, line 59). The combination of references is made under the same rationale as claim 3 above. With respect to claim 6, the combination of Jia, Stolbikov, and Abbasian teaches the invention described in claim 1, including the method further comprising, prior to causing the at least a portion of the respective at least one webpage supplement to be output by way of the user interface: eliminating any path, query string, and fragment identifier information from the URL to produce a filtered URL (Abbasian, col. 6, lines 18-38); issuing, to the management entity (Jia, col. 10, lines 7-15), a third request to obtain (Abbasian, col. 20, lines 17-35) the respective at least one webpage supplement (Jia, col. 9, lines 27-39), wherein the third request includes the filtered URL and excludes identifying information associated with the client computing device (Abbasian, col. 20, lines 17-35); and receiving, from the management entity (Jia, col. 10, lines 7-15), the respective at least one webpage supplement (Jia, col. 9, lines 27-39). The combination of references is made under the same rationale as claim 3 above. With respect to claim 7, the combination of Jia, Stolbikov, and Abbasian teaches the invention described in claim 6, including the method wherein the third request is issued to (Abbasian, col. 20, lines 17-35) the management entity (Jia, col. 10, lines 7-15), and the respective at least one webpage supplement is received from (Jia, col. 9, lines 27-39) the management entity (Jia, col. 10, lines 7-15), by way of at least one independent relay server that prevents (Abbasian, col. 7, lines 21-27) the management entity (Jia, col. 10, lines 7-15) from identifying address information associated with the client computing device (Abbasian, col. 7, lines 21-27). The combination of references is made under the same rationale as claim 3 above. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Alicia Baturay whose telephone number is (571) 272-3981. The examiner can normally be reached at 7am – 4pm, Mondays – Thursdays, Eastern Time. Examiner interviews are available via telephone, in person, or video conferencing using a USPTO-supplied, web-based collaboration tool. To schedule an interview, Applicants are encouraged to use the USPTO Automated Interview Request (AIR) form at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kamal Divecha can be reached at (571) 272-5863. The fax 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. /Alicia Baturay/ Primary Examiner, Art Unit 2441 October 13, 2026
Read full office action

Prosecution Timeline

Mar 24, 2025
Application Filed
Oct 16, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12771596
SYSTEM, METHOD, AND COMPUTER PROGRAM FOR LEVERAGING NETWORK STATE INFORMATION WHEN EXPOSING CORE NETWORK CAPABILITIES
2y 5m to grant Granted Oct 20, 2026
Patent 12764182
SELECTIVE PRUNING OF CANDIDATE LOAD-BALANCING SERVERS
2y 7m to grant Granted Oct 13, 2026
Patent 12756663
IP-BASED FORWARDING OF BRIDGED AND ROUTED IP PACKETS AND UNICAST ARP
1y 9m to grant Granted Oct 06, 2026
Patent 12744707
Transfer Device and Transfer Method
2y 0m to grant Granted Sep 22, 2026
Patent 12712949
INFORMATION PROCESSING APPARATUS, CONTROL METHOD OF INFORMATION PROCESSING APPARATUS, AND RECORDING MEDIUM
2y 0m to grant Granted Aug 18, 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
81%
Grant Probability
99%
With Interview (+18.2%)
2y 9m (~1y 2m remaining)
Median Time to Grant
Low
PTA Risk
Based on 777 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