IP Library › Granted Patent US 12,505,246
Granted Patent B2
US 12,505,246 · App. 18/365,494 · Granted Dec 23, 2025

Attribute-level access control for federated queries

Inventors: Srivatsan Srinivasan (Lake Stevens, WA); Priyadarshni Natarajan (Redmond, WA); Lars F. Joreteg (Eureka, CA); John Jose Anto Gerard Arokiasamy (Chaska, MN)
Assignee: Optum, Inc.
G06F21/6227G06F21/6254G06F2221/2113G06F2221/2141
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,505,246
App. No.
18/365,494
Filed
Aug 4, 2023
Granted
Dec 23, 2025
Kind
B2
Art Unit
2491
USPC
726/27
Abstract

Various embodiments of the present disclosure provide access control for data provided by a federated query system based on attributes of a federated query. The techniques include determining a user identifier associated with a federated query, determining a set of access controls for a plurality of third-party data sources based on the user identifier, and generating an execution plan for resolving the federated query via one or more executable tasks with respect to the plurality of third-party data sources. The techniques also include generating, using a first portion of the execution plan, a result set that comprises information aggregated from the plurality of third-party data sources in accordance with the federated query. The techniques also include generating, using a second portion of the execution plan, a user result set that masks a portion of the information for the result set in accordance with the set of access controls.

Claims (81)

1 . A computer-implemented method comprising:

receiving, by one or more processors, a federated query from a user device that references one or more data segments from a plurality of third-party data sources;

determining, by the one or more processors, a user identifier associated with the federated query;

determining, by the one or more processors, one or more access controls for the plurality of third-party data sources based on the user identifier;

generating, by the one or more processors, an execution plan for resolving the federated query via one or more executable tasks with respect to the plurality of third-party data sources;

generating, by the one or more processors and using a first portion of the execution plan, result data that comprises information aggregated from the plurality of third-party data sources in accordance with the federated query; and

generating, by the one or more processors and using a second portion of the execution plan, user result data that selectively provides a visual data obfuscation for a portion of the information for the result data in accordance with the one or more access controls for the plurality of third-party data sources.

2 . The computer-implemented method of claim 1 , wherein receiving the federated query comprises:

receiving the federated query via an application programming interface (API) gateway of a federated query system communicatively coupled to the plurality of third-party data sources.

3 . The computer-implemented method of claim 1 , further comprising:

providing a query response with the user result data to the user device to render masked visual data associated with the user result data via a user interface of the user device.

4 . The computer-implemented method of claim 3 , further comprising:

configuring the masked visual data to overlay a visual mask over one or more values of the user result data.

5 . The computer-implemented method of claim 1 , further comprising:

storing the result data in a cache memory; and

based on an attribute set associated with the federated query,

generating a first version of the user result data that masks a first portion of the information for the result data in accordance with the one or more access controls, or

generating a second version of the user result data that masks a second portion of the information for the result data in accordance with the one or more access controls.

6 . The computer-implemented method of claim 1 , further comprising:

determining data policy information associated with the one or more data segments;

generating the one or more access controls based on the data policy information and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data policy information and the user identifier.

7 . The computer-implemented method of claim 1 , further comprising:

receiving data source information from an orchestration engine associated with the plurality of third-party data sources;

generating the one or more access controls based on the data source information and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data source information and the user identifier.

8 . The computer-implemented method of claim 1 , further comprising:

determining data policy information associated with the one or more data segments;

receiving data source information from an orchestration engine associated with the plurality of third-party data sources;

generating the one or more access controls based on the data policy information, the data source information, and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data policy information, the data source information, and the user identifier.

9 . The computer-implemented method of claim 1 , further comprising:

parsing the federated query into a syntax tree representing a sequence for the one or more executable tasks with respect to the plurality of third-party data sources;

configuring the syntax tree based on the one or more access controls; and

generating the execution plan based on the syntax tree associated with the one or more access controls.

10 . A system comprising:

one or more processors; and

one or more memories storing processor-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:

receiving a federated query from a user device that references one or more data segments from a plurality of third-party data sources;

determining a user identifier associated with the federated query;

determining one or more access controls for the plurality of third-party data sources based on the user identifier;

generating an execution plan for resolving the federated query via one or more executable tasks with respect to the plurality of third-party data sources;

generating, using a first portion of the execution plan, result data that comprises information aggregated from the plurality of third-party data sources in accordance with the federated query; and

generating, using a second portion of the execution plan, user result data that selectively provides a visual data obfuscation for a portion of the information for the result data in accordance with the one or more access controls for the plurality of third-party data sources.

11 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

providing a query response with the user result data to the user device to render masked visual data associated with the user result data via a user interface of the user device.

12 . The system of claim 11 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

configuring the masked visual data to overlay a visual mask over one or more values of the user result data.

13 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

storing the result data in a cache memory; and

based on an attribute set associated with the federated query,

generating a first version of the user result data that masks a first portion of the information for the result data in accordance with the one or more access controls, or

generating a second version of the user result data that masks a second portion of the information for the result data in accordance with the one or more access controls.

14 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

determining data policy information associated with the one or more data segments;

generating the one or more access controls based on the data policy information and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data policy information and the user identifier.

15 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

receiving data source information from an orchestration engine associated with the plurality of third-party data sources;

generating the one or more access controls based on the data source information and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data source information and the user identifier.

16 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

determining data policy information associated with the one or more data segments;

receiving data source information from an orchestration engine associated with the plurality of third-party data sources;

generating the one or more access controls based on the data policy information, the data source information, and the user identifier; and

generating the user result data in accordance with the one or more access controls associated with the data policy information, the data source information, and the user identifier.

17 . The system of claim 10 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

parsing the federated query into a syntax tree representing a sequence for the one or more executable tasks with respect to the plurality of third-party data sources;

configuring the syntax tree based on the one or more access controls; and

generating the execution plan based on the syntax tree associated with the one or more access controls.

18 . One or more non-transitory computer-readable storage media storing processor-executable instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

receiving a federated query from a user device that references one or more data segments from a plurality of third-party data sources;

determining a user identifier associated with the federated query;

determining a one or more access controls for the plurality of third-party data sources based on the user identifier;

generating an execution plan for resolving the federated query via one or more executable tasks with respect to the plurality of third-party data sources;

generating, using a first portion of the execution plan, result data that comprises information aggregated from the plurality of third-party data sources in accordance with the federated query; and

generating, using a second portion of the execution plan, user result data that selectively provides a visual data obfuscation for a portion of the information for the result data in accordance with the one or more access controls for the plurality of third-party data sources.

19 . The one or more non-transitory computer-readable storage media of claim 18 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

providing a query response with the user result data to the user device to render masked visual data associated with the user result data via a user interface of the user device.

20 . The one or more non-transitory computer-readable storage media of claim 19 , wherein the processor-executable instructions, when executed by the one or more processors, further cause the one or more processors to perform operations comprising:

configuring the masked visual data to overlay a visual mask over one or more values of the user result data.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 4, 2024
From: JORETEG, LARS F.; AROKIASAMY, JOHN JOSE ANTO GERARD
To: OPTUM, INC.
Reel/Frame 066021/0508 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 4, 2023
From: SRINIVASAN, SRIVATSAN; NATARAJAN, PRIYADARSHNI
To: OPTUM, INC.
Reel/Frame 064496/0446 →
Continuity (1)
Related Publication 20250045445A1 · Feb 6, 2025
References Cited (171)
US 1372871A · Droll · 1921 [cited by applicant]
US 6901403B1 · Bata et al. · 2005 [cited by applicant]
US 6950823B2 · Amiri et al. · 2005 [cited by applicant]
US 7403956B2 · Vaschillo et al. · 2008 [cited by applicant]
US 7812826B2 · Ording et al. · 2010 [cited by applicant]
US 7831594B2 · Mehta et al. · 2010 [cited by applicant]
US 7924271B2 · Christie et al. · 2011 [cited by applicant]
US 7945581B2 · Bayliss et al. · 2011 [cited by applicant]
US 8223134B1 · Forstall et al. · 2012 [cited by applicant]
US 8341104B2 · Manickam et al. · 2012 [cited by applicant]
US 8515975B1 · Federici · 2013 [cited by applicant]
US 8539345B2 · Appleyard et al. · 2013 [cited by applicant]
US 8572031B2 · Merriman et al. · 2013 [cited by applicant]
US 8762406B2 · Ho et al. · 2014 [cited by applicant]
US 8930410B2 · Alton et al. · 2015 [cited by applicant]
US 9116812B2 · Joshi et al. · 2015 [cited by applicant]
US 9246776B2 · Ellsworth et al. · 2016 [cited by applicant]
US 9390112B1 · Daly et al. · 2016 [cited by applicant]
US 9489440B2 · Stritzel et al. · 2016 [cited by applicant]
US 9558230B2 · Hollifield et al. · 2017 [cited by applicant]
US 9600504B2 · Marrelli et al. · 2017 [cited by applicant]
US 9646226B2 · Wang et al. · 2017 [cited by applicant]
US 10185728B2 · Nath et al. · 2019 [cited by applicant]
US 10229161B2 · Kakarla et al. · 2019 [cited by applicant]
US 10296524B1 · Tung et al. · 2019 [cited by applicant]
US 10409802B2 · Spitz et al. · 2019 [cited by applicant]
US 10698954B2 · Piechowicz et al. · 2020 [cited by applicant]
US 10719301B1 · Dasgupta et al. · 2020 [cited by applicant]
US 10762539B2 · Murugesan et al. · 2020 [cited by applicant]
US 10795598B1 · Vohra · 2020 [cited by applicant]
US 10817483B1 · Samdani et al. · 2020 [cited by applicant]
US 10867063B1 · Avanes et al. · 2020 [cited by applicant]
US 10872236B1 · Elor et al. · 2020 [cited by applicant]
US 10896176B1 · Creedon et al. · 2021 [cited by applicant]
US 10908926B2 · Coven et al. · 2021 [cited by applicant]
US 11074107B1 · Nandakumar · 2021 [cited by applicant]
US 11093500B2 · Gladwin et al. · 2021 [cited by applicant]
US 11094029B2 · Kalamkar et al. · 2021 [cited by applicant]
US 11100420B2 · Dirac et al. · 2021 [cited by applicant]
US 11113784B2 · Ray et al. · 2021 [cited by applicant]
US 11119980B2 · Szczepanik et al. · 2021 [cited by applicant]
US 11126632B2 · Pal et al. · 2021 [cited by applicant]
US 11157470B2 · Schuetz · 2021 [cited by applicant]
US 11204851B1 · Iyengar et al. · 2021 [cited by applicant]
US 11281673B2 · Nanda et al. · 2022 [cited by applicant]
US 11301467B2 · Slezak et al. · 2022 [cited by applicant]
US 11321330B1 · Pandis et al. · 2022 [cited by applicant]
US 11475350B2 · Mcmahan et al. · 2022 [cited by applicant]
US 11550812B2 · Liu et al. · 2023 [cited by applicant]
US 11636108B1 · Xu et al. · 2023 [cited by applicant]
US 20040153435A1 · Gudbjartsson et al. · 2004 [cited by applicant]
US 20060218117A1 · Gupta · 2006 [cited by examiner]
US 20060218149A1 · Patrick · 2006 [cited by applicant]
US 20060259977A1 · Patrick · 2006 [cited by applicant]
US 20070262964A1 · Zotov et al. · 2007 [cited by applicant]
US 20080104089A1 · Pragada et al. · 2008 [cited by applicant]
US 20090309847A1 · Russell et al. · 2009 [cited by applicant]
US 20100031202A1 · Morris et al. · 2010 [cited by applicant]
US 20100315438A1 · Horodezky et al. · 2010 [cited by applicant]
US 20110013049A1 · Thörn · 2011 [cited by applicant]
US 20110074710A1 · Weeldreyer et al. · 2011 [cited by applicant]
US 20110074824A1 · Srinivasan et al. · 2011 [cited by applicant]
US 20120084711A1 · Duarte et al. · 2012 [cited by applicant]
US 20120089950A1 · Tseng · 2012 [cited by applicant]
US 20120147050A1 · Dai et al. · 2012 [cited by applicant]
US 20120159402A1 · Nurmi et al. · 2012 [cited by applicant]
US 20120210066A1 · Joshi et al. · 2012 [cited by applicant]
US 20120290592A1 · Ishii · 2012 [cited by examiner]
US 20120317096A1 · Kaufmann et al. · 2012 [cited by applicant]
US 20130086039A1 · Salch et al. · 2013 [cited by applicant]
US 20130132360A1 · Kuznetsov et al. · 2013 [cited by applicant]
US 20130159288A1 · Nikankin · 2013 [cited by applicant]
US 20150169685A1 · Elias et al. · 2015 [cited by applicant]
US 20150193697A1 · Vasseur et al. · 2015 [cited by applicant]
US 20160147888A1 · Nguyen et al. · 2016 [cited by applicant]
US 20170013046A1 · Flynn · 2017 [cited by applicant]
US 20170220605A1 · Nivala et al. · 2017 [cited by applicant]
US 20170269921A1 · Martin Vicente et al. · 2017 [cited by applicant]
US 20170329466A1 · Krenkler et al. · 2017 [cited by applicant]
US 20180293276A1 · Bae et al. · 2018 [cited by applicant]
US 20180375720A1 · Yang et al. · 2018 [cited by applicant]
US 20190050459A1 · Griffith et al. · 2019 [cited by applicant]
US 20190065569A1 · Boutros et al. · 2019 [cited by applicant]
US 20190146978A1 · Beedgen et al. · 2019 [cited by applicant]
US 20190196890A1 · Bucchi et al. · 2019 [cited by applicant]
US 20190311372A1 · Lindner · 2019 [cited by applicant]
US 20190369969A1 · Donohoe et al. · 2019 [cited by applicant]
US 20190392296A1 · Brady et al. · 2019 [cited by applicant]
US 20200034742A1 · Dirac et al. · 2020 [cited by applicant]
US 20200050612A1 · Bhattacharjee et al. · 2020 [cited by applicant]
US 20200082010A1 · Bodziony et al. · 2020 [cited by applicant]
US 20200117434A1 · Biskup et al. · 2020 [cited by applicant]
US 20200202171A1 · Hughes et al. · 2020 [cited by applicant]
US 20200226012A1 · Pitre et al. · 2020 [cited by applicant]
US 20200250525A1 · Kumar Addepalli et al. · 2020 [cited by applicant]
US 20200319877A1 · Glazer et al. · 2020 [cited by applicant]
US 20200320379A1 · Watson et al. · 2020 [cited by applicant]
US 20200349161A1 · Siddiqui et al. · 2020 [cited by applicant]
US 20200401891A1 · Xu et al. · 2020 [cited by applicant]
US 20210019665A1 · Gur et al. · 2021 [cited by applicant]
US 20210081837A1 · Polleri et al. · 2021 [cited by applicant]
US 20210097343A1 · Goodsitt et al. · 2021 [cited by applicant]
US 20210174164A1 · Hsieh et al. · 2021 [cited by applicant]
US 20210286657A1 · Mathur et al. · 2021 [cited by applicant]
US 20210294577A1 · Dunn et al. · 2021 [cited by applicant]
US 20210304362A1 · Palmaro et al. · 2021 [cited by applicant]
US 20210334651A1 · Leng et al. · 2021 [cited by applicant]
US 20210390455A1 · Schierz et al. · 2021 [cited by applicant]
US 20220067181A1 · Carley · 2022 [cited by applicant]
US 20220078264A1 · Mathur · 2022 [cited by applicant]
US 20220086393A1 · Peters et al. · 2022 [cited by applicant]
US 20220091837A1 · Chai et al. · 2022 [cited by applicant]
US 20220108177A1 · Samek et al. · 2022 [cited by applicant]
US 20220114451A1 · Muñoz et al. · 2022 [cited by applicant]
US 20220129581A1 · Jones et al. · 2022 [cited by applicant]
US 20220138561A1 · Prendki · 2022 [cited by applicant]
US 20220172040A1 · Kazi et al. · 2022 [cited by applicant]
US 20220245176A1 · Weisman · 2022 [cited by applicant]
US 20220269691A1 · Liu et al. · 2022 [cited by applicant]
US 20220269706A1 · Balasubramanian et al. · 2022 [cited by applicant]
US 20220300850A1 · Mendez et al. · 2022 [cited by applicant]
US 20220374914A1 · Morrill et al. · 2022 [cited by applicant]
US 20220407861A1 · Beecham et al. · 2022 [cited by applicant]
US 20230152994A1 · Jiang et al. · 2023 [cited by applicant]
US 20230315731A1 · Xu et al. · 2023 [cited by applicant]
US 20230325389A1 · Fan et al. · 2023 [cited by applicant]
US 20230418468A1 · Shah et al. · 2023 [cited by applicant]
US 20240078333A1 · Lim · 2024 [cited by examiner]
US 20240134842A1 · Kim et al. · 2024 [cited by applicant]
US 20240320231A1 · Bhattacharjee et al. · 2024 [cited by applicant]
WO 2011155743A2 · 2011 [cited by applicant]
WO 2012007745A2 · 2012 [cited by applicant]
WO 2021144803A1 · 2021 [cited by applicant]
WO 2022185324A1 · 2022 [cited by applicant]
WO 2022269526A1 · 2022 [cited by applicant]
WO 2023248204A1 · 2023 [cited by applicant]
Anaissi, et al., “A Personalized Federated Learning Algorithm: An Application in Anomaly Detection”, (10 pages), Nov. 5, 2021, arXiv:2111.02627v1. [cited by applicant]
Cai, et al., “The Challenges of Data Quality and Data Quality Assessment in the Big Data Era”, Data Science Journal, vol. 14, pp. 1-10, May 15, 2015, DOI: http://dx.doi.org/10.5334/dsj-2015-002. [cited by applicant]
Cohen, Yoav, “Introducing Universal Masking”, satori, (7 pages), Nov. 11, 2020, Retrieved on https://blog.satoricyber.com/introducing-universal-masking/. [cited by applicant]
Costa, et al., “A Survey on Data-Driven Performance Tuning for Big Data Analytics Platforms”, Big Data Research, vol. 25, (17 pages), Jan. 27, 2021. [cited by applicant]
Debattista, et al., “A Methodology and Framework for Linked Data Quality Assessment”, ACM Journal of Data and Information Quality, vol. 4, (29 pages), Jan. 2016, DOI: http://dx.doi.org/10.1145/0000000.0000000. [cited by applicant]
Devarajan, et al., “Acceleration via Multi-Tiered Data Buffering and Prefetching”, Journal of Computer Science and Technology, vol. 35, pp. 92-120, Jan. 2020, DOI: 10.1007/s11390-020-9781-1. [cited by applicant]
Einziger, et al., “A Highly Efficient Cache Admission Policy”, (24 pages), Dec. 3, 2015, arXiv:1512.00727v2. [cited by applicant]
Fuhl, et al., “Explainable Online Validation of Machine Learning Models for Practical Applications”, (9 pages), Jan. 17, 2021, arXiv:2010.00821v3. [cited by applicant]
Hirano, et al., “RanSAP:An Open Dataset of Ransomware Storage Access Patterns for Training Machine Learning Models”, Forensic Science International: Digital Investigation, vol. 40, (22 pages), Dec. 16, 2021, https://www… [cited by applicant]
Immuta, “Immuta Architecture: Dive Deeper into the Platform”, (9 pages), Jan. 3, 2023, Retrieved from https://www.immuta.com/product/architecture/. [cited by applicant]
Jain et al., “Efficient Execution of Quantized Deep Learning Models: A Compiler Approach”, (12 pages), Jun. 18, 2020, arXiv:2006.10226v1. [cited by applicant]
Janardhanan, PS, “Project Repositories for Machine Learning with TensorFlow”, ScienceDirect, vol. 171, pp. 188-196, (2020). [cited by applicant]
Jin, Lei, “Software-Oriented Distributed Shared Cache Management for Chip Multiprocessors”, University of Pittsburgh, (133 pages), 2010, http://d-scholarship.pitt.edu/8834/1/Lei.Jin.08.15.2010.PhD.Thesis.pdf. [cited by applicant]
Kopp, Andreas, “Practical Federated Learning with Azure Machine Learning”, Towards Data Science, (21 pages), Aug. 17, 2022, https://towardsdatascience.com/practical-federated-learning-with-azure-machine-learning-8807f9b… [cited by applicant]
Masolo, Claudio, “Google's BigQuery Introduces col. Level Encryption Functions and Dynamic Masking of Information”, InfoQ, (6 pages), Jul. 7, 2022, Retrieved from https://www.infoq.com/news/2022/07/google-bigquery-encry… [cited by applicant]
Pollok, et al., “Open Fabric for Deep Learning Models”, IBM Research, (5 pages), 2018, Retrieved at https://openreview.net/pdf?id=SkgCTFpV2X. [cited by applicant]
Rivie′ Res, et al., “Eclipse: A Platform for Integrating Development Tools”, IBM Systems Journal, (14 pages), Jan. 2004, DOI: 10.1147/sj.432.0371. [cited by applicant]
Schwarz, et al., “Augmenting Web Pages and Search Results to Support Credibility Assessment”, CHI 2011, (10 pages), May 7, 2011, https://juliaschwarz.net/assets/web-credibility/schwarz-chi11-web-credibility. [cited by applicant]
Snowflake, “Understanding Dynamic Data Masking”, (1 page), Jan. 4, 2023, Retrieved from https://docs.snowflake.com/en/user-guide/security-column-ddm.html. [cited by applicant]
Vasilache, et al., “Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractions”, (37 pages), Jun. 29, 2018, arXiv:1802.04730v3. [cited by applicant]
Witt, et al., “Predictive Performance Modeling for Distributed Computing Using Black-Box Monitoring and Machine Learning”, Elsevier, (19 pages), May 30, 2018, arXiv:1805.11877v1. [cited by applicant]
Yates, et al., “Age-Optimal Constrained Cache Updating”, IEEE International Symposium on Information Theory, (5 pages), 2017. [cited by applicant]
Non-Final Rejection Mailed on May 28, 2024 for U.S. Appl. No. 18/365,485, 9 page(s). [cited by applicant]
Non-Final Rejection Mailed on Sep. 28, 2024 for U.S. Appl. No. 18/462,846, 12 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Oct. 2, 2024 for U.S. Appl. No. 18/242,954, 2 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Sep. 10, 2024 for U.S. Appl. No. 18/242,954, 14 page(s). [cited by applicant]
Final Rejection Mailed on Oct. 31, 2024 for U.S. Appl. No. 18/365,485, 10 page(s). [cited by applicant]
Non-Final Rejection Mailed on Dec. 19, 2024 for U.S. Appl. No. 18/465,576, 7 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Dec. 13, 2024 for U.S. Appl. No. 18/242,954, 2 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Nov. 5, 2024 for U.S. Appl. No. 18/242,954, 2 page(s). [cited by applicant]
Advisory Action (PTOL-303) Mailed on Jan. 24, 2025 for U.S. Appl. No. 18/365,485, 2 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Apr. 14, 2025 for U.S. Appl. No. 18/465,576, 8 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Mar. 7, 2025 for U.S. Appl. No. 18/365,485, 8 page(s). [cited by applicant]
Final Rejection Mailed on Jun. 10, 2025 for U.S. Appl. No. 18/462,846, 11 page(s). [cited by applicant]
Notice of Allowance and Fees Due (PTOL-85) Mailed on Jun. 10, 2025 for U.S. Appl. No. 18/365,485, 5 page(s). [cited by applicant]