IP Library › Granted Patent US 12,197,451
Granted Patent B1
US 12,197,451 · App. 17/816,361 · Granted Jan 14, 2025

Appending time ranges to distinct statements of a data processing package

Inventors: Thomas Haggie (Victoria, CA); Barbara Janczer (San Francisco, CA); Justin Lew (Burnaby, CA); Clark Eugene Mullen (San Mateo, CA); Ioan Popa (Fremont, CA); Jacob Sebastian Stark (San Jose, CA); Keng-Ming Sheu (Port Coquitlam, CA)
Assignee: Splunk Inc.
G06F16/2477G06F16/2428G06F16/248
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,197,451
App. No.
17/816,361
Filed
Jul 29, 2022
Granted
Jan 14, 2025
Kind
B1
Art Unit
2153
USPC
707/769
Abstract

A system generates a user interface that enables a user to modify time ranges associated with search-related statements of a data processing package. Via one or more user interactions with the user interface, the system may receive a modified time range for the statement. The modified time range may be appended to the data processing package to form an enriched data processing package. The system may communicate the enriched data processing package to a search service for execution. The system may display the results in the user interface.

Claims (43)

1. A method, comprising:

displaying, via a graphical user interface, a plurality of search-related statements of a data processing package, wherein each search-related statement of the plurality of search-related statements comprises one or more executable query commands of a query language identifying a respective set of data and a manner of processing the respective set of data;

receiving, via the graphical user interface, an indication to associate a first time range with a first search-related statement of the plurality of search-related statements of the data processing package;

receiving an indication to execute the data processing package;

based on the indication to execute the data processing package and the indication to associate the first time range with the first search-related statement, appending the first time range to the data processing package in association with the first search-related statement and appending a second time range to the data processing package in association with a second search-related statement of the plurality of search-related statements to form an enriched data processing package;

communicating the enriched data processing package to a search service, wherein the search service uses at least the first time range to identify the respective set of data of the first search-related statement for processing and uses at least the second time range to identify the respective set of data of the second search-related statement for processing;

receiving results from the search service; and

displaying, via the graphical user interface, at least a portion of the results.

2. The method of claim 1 , wherein receiving an indication to execute the data processing package comprises receiving an indication that a user interacted with a display object associated with executing a search.

3. The method of claim 1 , wherein the second time range is different than the first time range and the second time range corresponds to a time range of the data processing package.

4. The method of claim 1 , wherein the first search-related statement in included in the plurality of search-related statements displayed via the graphical user interface.

5. The method of claim 1 , further comprising based on the indication to execute the data processing package, generating the first search-related statement based on the second search-related statement.

6. The method of claim 1 , further comprising based on the indication to execute the data processing package, generating the first search-related statement using the second search-related statement and a plurality of search parameters received via the graphical user interface.

7. The method of claim 1 , wherein the first time range is the same as the second time range.

8. The method of claim 1 , wherein the first time range is larger than the second time range.

9. The method of claim 1 further comprising associating the second time range with a third search-related statement of the data processing package to form the enriched data processing package.

10. The method of claim 1 , further comprising, in response to communicating the enriched data processing package to the search service, discarding the enriched data processing package.

11. A computing system, comprising:

memory; and

one or more processing devices coupled to the memory and configured to:

display, via a graphical user interface, a plurality of search-related statements of a data processing package, wherein each search-related statement of the plurality of search-related statements comprises one or more executable query commands of a query language identifying a respective set of data and a manner of processing the respective set of data;

receive, via the graphical user interface, an indication to associate a first time range with a first search-related statement of the plurality of search-related statements of the data processing package;

receive an indication to execute the data processing package;

based on the indication to execute the data processing package and the indication to associate the first time range with the first search-related statement, append the first time range to the data processing package in association with the first search-related statement and append a second time range to the data processing package in association with a second search-related statement of the plurality of search-related statements to form an enriched data processing package;

communicate the enriched data processing package to a search service, wherein the search service uses at least the first time range to identify the respective set of data of the first search-related statement for processing and uses at least the second time range to identify the respective set of data of the second search-related statement for processing;

receive results from the search service; and

display, via the graphical user interface, at least a portion of the results.

12. The computing system of claim 11 , wherein the second time range is different than the first time range and the second time range corresponds to a time range of the data processing package.

13. The computing system of claim 11 , wherein the first search-related statement in included in the plurality of search-related statements displayed via the graphical user interface.

14. The computing system of claim 11 , wherein the one or more processing devices are further configured to, based on the indication to execute the data processing package, generate the first search-related statement based on the second search-related statement.

15. The computing system of claim 11 , wherein the one or more processing devices are further configured to, based on the indication to execute the data processing package, generate the first search-related statement using the second search-related statement and a plurality of search parameters received via the graphical user interface.

16. The computing system of claim 11 , wherein the first time range is the same as the second time range.

17. The computing system of claim 11 , wherein the first time range is larger than the second time range.

18. The computing system of claim 11 , wherein the one or more processing devices are further configured to associate the second time range with a third search-related statement of the data processing package to form the enriched data processing package.

19. The computing system of claim 11 , wherein the one or more processing devices are further configured to, in response to communicating the enriched data processing package to the search service, discard the enriched data processing package.

20. Non-transitory computer-readable media comprising computer-executable instructions that, when executed by a computing system, cause the computing system to:

display, via a graphical user interface, a plurality of search-related statements of a data processing package, wherein each search-related statement of the plurality of search-related statements comprises one or more executable query commands of a query language identifying a respective set of data and a manner of processing the respective set of data;

receive, via the graphical user interface, an indication to associate a first time range with a first search-related statement of the plurality of search-related statements of the data processing package;

receive an indication to execute the data processing package;

based on the indication to execute the data processing package and the indication to associate the first time range with the first search-related statement, append the first time range to the data processing package in association with the first search-related statement and append a second time range to the data processing package in association with a second search-related statement of the plurality of search-related statements to form an enriched data processing package;

communicate the enriched data processing package to a search service, wherein the search service uses at least the first time range to identify the respective set of data of the first search-related statement for processing and uses at least the second time range to identify the respective set of data of the second search-related statement for processing;

receive results from the search service; and

display, via the graphical user interface, at least a portion of the results.

Assignments (3)
CHANGE OF NAME Recorded Jul 22, 2025
From: SPLUNK INC.
To: SPLUNK LLC
Reel/Frame 072170/0599 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2025
From: SPLUNK LLC
To: CISCO TECHNOLOGY, INC.
Reel/Frame 072173/0058 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 29, 2022
From: HAGGIE, THOMAS; JANCZER, BARBARA; LEW, JUSTIN; MULLEN, CLARK EUGENE; POPA, IOAN; STARK, JACOB SEBASTIAN; SHEU, KENG-MING
To: SPLUNK INC.
Reel/Frame 061914/0068 →
Continuity (1)
Provisional Application 63366323 · Jun 13, 2022
References Cited (228)
US 6473503B1 · Karau et al. · 2002 [cited by applicant]
US 6707476B1 · Hochstedler · 2004 [cited by applicant]
US 7822707B1 · Yehuda et al. · 2010 [cited by applicant]
US 7937344B2 · Baum et al. · 2011 [cited by applicant]
US 7953730B1 · Bleckner · 2011 [cited by examiner]
US 8112425B2 · Baum et al. · 2012 [cited by applicant]
US 8166071B1 · Korablev et al. · 2012 [cited by applicant]
US 8364460B2 · Ostermeyer et al. · 2013 [cited by applicant]
US 8751529B2 · Zhang et al. · 2014 [cited by applicant]
US 8788525B2 · Neels et al. · 2014 [cited by applicant]
US 9215240B2 · Merza et al. · 2015 [cited by applicant]
US 9286413B1 · Coates et al. · 2016 [cited by applicant]
US 9576007B1 · Sivathanu et al. · 2017 [cited by applicant]
US 9576046B2 · Bullotta · 2017 [cited by examiner]
US 9641334B2 · Faitelson et al. · 2017 [cited by applicant]
US 9667676B1 · Lo et al. · 2017 [cited by applicant]
US 9690858B1 · Diliberto et al. · 2017 [cited by applicant]
US 9916367B2 · Lin et al. · 2018 [cited by applicant]
US 10120914B2 · Vogt · 2018 [cited by applicant]
US 10127258B2 · Lamas et al. · 2018 [cited by applicant]
US 10409440B2 · Blinn et al. · 2019 [cited by applicant]
US 10452650B1 · Monaharan et al. · 2019 [cited by applicant]
US 10509794B2 · Filippi et al. · 2019 [cited by applicant]
US 10776366B1 · Astretsov et al. · 2020 [cited by applicant]
US 10871878B1 · Mody et al. · 2020 [cited by applicant]
US 10909130B1 · Scott et al. · 2021 [cited by applicant]
US 10929415B1 · Shcherbakov et al. · 2021 [cited by applicant]
US 10936585B1 · Echeverria et al. · 2021 [cited by applicant]
US 11113294B1 · Bourbie et al. · 2021 [cited by applicant]
US 11120087B2 · Dhillon et al. · 2021 [cited by applicant]
US 11216511B1 · Bigdelu et al. · 2022 [cited by applicant]
US 11263268B1 · Bourbie et al. · 2022 [cited by applicant]
US 11269871B1 · Bigdelu et al. · 2022 [cited by applicant]
US 11386158B1 · Bourbie et al. · 2022 [cited by applicant]
US 11409756B1 · Park et al. · 2022 [cited by applicant]
US 11500952B1 · Gupta et al. · 2022 [cited by applicant]
US 11537627B1 · Baskaran et al. · 2022 [cited by applicant]
US 11604789B1 · Cannon et al. · 2023 [cited by applicant]
US 11604799B1 · Bigdelu et al. · 2023 [cited by applicant]
US 11620300B2 · Burnett et al. · 2023 [cited by applicant]
US 11620303B1 · Roy et al. · 2023 [cited by applicant]
US 11636128B1 · Bigdelu et al. · 2023 [cited by applicant]
US 11644955B1 · Singamneni et al. · 2023 [cited by applicant]
US 11676345B1 · Bhushan et al. · 2023 [cited by applicant]
US 11695643B1 · Cawley et al. · 2023 [cited by applicant]
US 11727016B1 · Agarwal et al. · 2023 [cited by applicant]
US 11743285B2 · Luger · 2023 [cited by examiner]
US 11899670B1 · Bhagat et al. · 2024 [cited by applicant]
US 11947528B1 · Bhagat et al. · 2024 [cited by applicant]
US 20010055017A1 · Ording · 2001 [cited by applicant]
US 20020169764A1 · Kincaid et al. · 2002 [cited by applicant]
US 20030058280A1 · Molinari et al. · 2003 [cited by applicant]
US 20040030682A1 · Porter et al. · 2004 [cited by applicant]
US 20050004911A1 · Goldberg et al. · 2005 [cited by applicant]
US 20050015361A1 · Payton et al. · 2005 [cited by applicant]
US 20050015368A1 · Payton et al. · 2005 [cited by applicant]
US 20050022207A1 · Grabarnik et al. · 2005 [cited by applicant]
US 20050076305A1 · Hintermeister et al. · 2005 [cited by applicant]
US 20050228788A1 · Dahn · 2005 [cited by examiner]
US 20060004707A1 · Dettinger · 2006 [cited by applicant]
US 20060064674A1 · Olson, Jr. et al. · 2006 [cited by applicant]
US 20060218479A1 · Torres · 2006 [cited by applicant]
US 20070022125A1 · Salam et al. · 2007 [cited by applicant]
US 20070043702A1 · Lakshminarayanan et al. · 2007 [cited by applicant]
US 20070088723A1 · Fish · 2007 [cited by applicant]
US 20070118491A1 · Baum et al. · 2007 [cited by applicant]
US 20070174188A1 · Fish · 2007 [cited by applicant]
US 20070282797A1 · Wang et al. · 2007 [cited by applicant]
US 20080025616A1 · Bryll · 2008 [cited by applicant]
US 20080114730A1 · Larimore et al. · 2008 [cited by applicant]
US 20080195649A1 · Lefebvre · 2008 [cited by applicant]
US 20080215546A1 · Baum · 2008 [cited by examiner]
US 20080243784A1 · Stading · 2008 [cited by applicant]
US 20080243807A1 · Caucas et al. · 2008 [cited by applicant]
US 20090019020A1 · Dhillon et al. · 2009 [cited by applicant]
US 20090228464A1 · Jones et al. · 2009 [cited by applicant]
US 20090276421A1 · Qiu · 2009 [cited by applicant]
US 20090319518A1 · Koudas et al. · 2009 [cited by applicant]
US 20090327240A1 · Meehan et al. · 2009 [cited by applicant]
US 20100049692A1 · Astito et al. · 2010 [cited by applicant]
US 20100135582A1 · Gokturk et al. · 2010 [cited by applicant]
US 20100299458A1 · Marking et al. · 2010 [cited by applicant]
US 20100306590A1 · Anand et al. · 2010 [cited by applicant]
US 20110066629A1 · Escalante et al. · 2011 [cited by applicant]
US 20110078055A1 · Faribault et al. · 2011 [cited by applicant]
US 20110126232A1 · Lee et al. · 2011 [cited by applicant]
US 20110179024A1 · Stiver et al. · 2011 [cited by applicant]
US 20120005044A1 · Coleman · 2012 [cited by applicant]
US 20120023429A1 · Medhi · 2012 [cited by applicant]
US 20120102024A1 · Campbell · 2012 [cited by examiner]
US 20120110474A1 · Chen et al. · 2012 [cited by applicant]
US 20120221553A1 · Wittmer et al. · 2012 [cited by applicant]
US 20120246165A1 · Batraski et al. · 2012 [cited by applicant]
US 20120246173A1 · Wittmer et al. · 2012 [cited by applicant]
US 20120254805A1 · Pic et al. · 2012 [cited by applicant]
US 20120271741A1 · Leonard · 2012 [cited by applicant]
US 20120284713A1 · Ostermeyer et al. · 2012 [cited by applicant]
US 20130073542A1 · Zhang et al. · 2013 [cited by applicant]
US 20130080460A1 · Tomko et al. · 2013 [cited by applicant]
US 20130086107A1 · Genochio et al. · 2013 [cited by applicant]
US 20130124542A1 · Lee et al. · 2013 [cited by applicant]
US 20130159832A1 · Ingargiola et al. · 2013 [cited by applicant]
US 20130238747A1 · Albouze et al. · 2013 [cited by applicant]
US 20130290291A1 · Loffbourrow et al. · 2013 [cited by applicant]
US 20130304760A1 · Torii · 2013 [cited by applicant]
US 20130326620A1 · Merza et al. · 2013 [cited by applicant]
US 20140019909A1 · Leonard et al. · 2014 [cited by applicant]
US 20140074887A1 · Neels et al. · 2014 [cited by applicant]
US 20140082013A1 · Wolf et al. · 2014 [cited by applicant]
US 20140188862A1 · Campbell et al. · 2014 [cited by applicant]
US 20140214976A1 · Zhou et al. · 2014 [cited by applicant]
US 20140222798A1 · Want et al. · 2014 [cited by applicant]
US 20140281868A1 · Vogel et al. · 2014 [cited by applicant]
US 20140324825A1 · Gopinath et al. · 2014 [cited by applicant]
US 20140344304A1 · Topatan et al. · 2014 [cited by applicant]
US 20150120745A1 · James · 2015 [cited by applicant]
US 20150212663A1 · Papale et al. · 2015 [cited by applicant]
US 20150213127A1 · Chang et al. · 2015 [cited by applicant]
US 20150254369A1 · Hou et al. · 2015 [cited by applicant]
US 20150302051A1 · Baumgartner et al. · 2015 [cited by applicant]
US 20150309689A1 · Jin et al. · 2015 [cited by applicant]
US 20160004736A1 · Tsuchida et al. · 2016 [cited by applicant]
US 20160004741A1 · Johnson et al. · 2016 [cited by applicant]
US 20160012045A1 · Franceschini et al. · 2016 [cited by applicant]
US 20160062555A1 · Ward et al. · 2016 [cited by applicant]
US 20160085785A1 · Hoffmann · 2016 [cited by applicant]
US 20160092485A1 · Lamas et al. · 2016 [cited by applicant]
US 20160098464A1 · Burke et al. · 2016 [cited by applicant]
US 20160103592A1 · Prophete et al. · 2016 [cited by applicant]
US 20160103883A1 · Ramani et al. · 2016 [cited by applicant]
US 20160119388A1 · Sitrick et al. · 2016 [cited by applicant]
US 20160210300A1 · Plakhov et al. · 2016 [cited by applicant]
US 20160216873A1 · Filippi et al. · 2016 [cited by applicant]
US 20160224532A1 · Miller et al. · 2016 [cited by applicant]
US 20160246840A1 · Masiero et al. · 2016 [cited by applicant]
US 20160292285A1 · Lee et al. · 2016 [cited by applicant]
US 20160328443A1 · Abraham et al. · 2016 [cited by applicant]
US 20160373423A1 · Naibo · 2016 [cited by applicant]
US 20170052654A1 · Cervelli et al. · 2017 [cited by applicant]
US 20170140011A1 · Kuefer et al. · 2017 [cited by applicant]
US 20170228711A1 · Chawla et al. · 2017 [cited by applicant]
US 20170235799A1 · Miller et al. · 2017 [cited by applicant]
US 20170262754A1 · Mizuno et al. · 2017 [cited by applicant]
US 20170308610A1 · Mullins et al. · 2017 [cited by applicant]
US 20170315677A1 · Rice et al. · 2017 [cited by applicant]
US 20170315749A1 · Valine · 2017 [cited by examiner]
US 20170351951A1 · Santos et al. · 2017 [cited by applicant]
US 20170352380A1 · Douombouya et al. · 2017 [cited by applicant]
US 20170364506A1 · Stern et al. · 2017 [cited by applicant]
US 20180004364A1 · Wu · 2018 [cited by applicant]
US 20180024701A1 · Sanches et al. · 2018 [cited by applicant]
US 20180025041A1 · Gray et al. · 2018 [cited by applicant]
US 20180039399A1 · Kaltegaertner et al. · 2018 [cited by applicant]
US 20180113945A1 · Dhillon et al. · 2018 [cited by applicant]
US 20180124031A1 · Krishnaprasad et al. · 2018 [cited by applicant]
US 20180157767A1 · Balyan · 2018 [cited by applicant]
US 20180165310A1 · Coll et al. · 2018 [cited by applicant]
US 20180173390A1 · Dunne et al. · 2018 [cited by applicant]
US 20180173477A1 · Porwal et al. · 2018 [cited by applicant]
US 20180189328A1 · Frazier et al. · 2018 [cited by applicant]
US 20180232394A1 · Danziger et al. · 2018 [cited by applicant]
US 20180246983A1 · Rathod · 2018 [cited by applicant]
US 20180285445A1 · Lu · 2018 [cited by applicant]
US 20180322169A1 · Kaufman et al. · 2018 [cited by applicant]
US 20180329965A1 · Nishino et al. · 2018 [cited by applicant]
US 20180357320A1 · Li et al. · 2018 [cited by applicant]
US 20190034528A1 · Lintz · 2019 [cited by applicant]
US 20190065567A1 · Griffith et al. · 2019 [cited by applicant]
US 20190073610A1 · Rousselot · 2019 [cited by applicant]
US 20190095508A1 · Porath et al. · 2019 [cited by applicant]
US 20190098106A1 · Mungel et al. · 2019 [cited by applicant]
US 20190138640A1 · Pal et al. · 2019 [cited by applicant]
US 20190146970A1 · Chameih et al. · 2019 [cited by applicant]
US 20190163756A1 · Bull et al. · 2019 [cited by applicant]
US 20190272271A1 · Bhattacharjee · 2019 [cited by examiner]
US 20190303409A1 · Nishino et al. · 2019 [cited by applicant]
US 20190342380A1 · Thota et al. · 2019 [cited by applicant]
US 20190370369A1 · Kulkarni · 2019 [cited by applicant]
US 20200050612A1 · Bhattacharjee et al. · 2020 [cited by applicant]
US 20200089794A1 · Frantz et al. · 2020 [cited by applicant]
US 20200110842A1 · Teo et al. · 2020 [cited by applicant]
US 20200134683A1 · Boren et al. · 2020 [cited by applicant]
US 20200167433A1 · Karayev et al. · 2020 [cited by applicant]
US 20200257680A1 · Danyi et al. · 2020 [cited by applicant]
US 20200387390A1 · Pat Ulzii et al. · 2020 [cited by applicant]
US 20210089601A1 · Osann, Jr. · 2021 [cited by examiner]
US 20210256019A1 · Prophete et al. · 2021 [cited by applicant]
US 20210286633A1 · Bar-On · 2021 [cited by examiner]
US 20220138606A1 · Pasour et al. · 2022 [cited by applicant]
US 20220188306A1 · Bigdelu et al. · 2022 [cited by applicant]
US 20220197926A1 · Passey et al. · 2022 [cited by applicant]
US 20220300711A1 · Elisco · 2022 [cited by examiner]
US 20220309248A1 · Liu et al. · 2022 [cited by applicant]
US 20220309411A1 · Ramaswamy et al. · 2022 [cited by applicant]
US 20230031327A1 · Bourbie · 2023 [cited by applicant]
US 20230185818A1 · Oattes et al. · 2023 [cited by applicant]
US 20230297213A1 · Coffey et al. · 2023 [cited by applicant]
US 20240013271A1 · Nunziata · 2024 [cited by applicant]
US 20240039802A1 · Avetoom · 2024 [cited by examiner]
Bitincka, Ledion et al., “Optimizing Data Analysis with a Semi-structured Time Series Database,” self-published, first presented at “Workshop on Managing Systems via Log Analysis and Machine Learning Techniques (SLAML)”… [cited by applicant]
Carraso, David, “Exploring Splunk,” published by CITO Research, New York, NY, Apr. 2012. [cited by applicant]
Chitu, Alex, Google Tests New Site Search Box (2014). [cited by applicant]
Hoque, et al., “Applying Pragmatic Principles for Interaction with Visual Analytics,” IEEE Transactions on Visualization and Computer Graphics, vol. 24, No. 1, Jan. 2018. [cited by applicant]
SLAML 10 Reports, Workshop On Managing Systems via Log Analysis and Machine Learning Techniques. ;login: Feb. 2011—Conference Reports—vol. 36, No. 1, pp. 104-110. [cited by applicant]
Splunk Enterprise Overview 8.0.0—splunk > turn data into doing—copyright 2020 Splunk Inc.—in 17 pages—retrieved May 20, 2020. [cited by applicant]
Splunk Cloud User Manual 8.0.2004—splunk> turn data in doing—copyright 2020 Splunk Inc.—in 66 pages—retrieved May 20, 2020. [cited by applicant]
Splunk Quick Reference Guide, updated 2019, available online at https://www.splunk.com/pdfs/solution-guides/splunk-quick-reference-guide.pdf, retrieved May 20, 2020. [cited by applicant]
U.S. Appl. No. 16/513,584, filed Jul. 16, 2019. [cited by applicant]
U.S. Appl. No. 16/513,571, filed Jul. 16, 2019. [cited by applicant]
U.S. Appl. No. 16/513,556, filed Jul. 16, 2019. [cited by applicant]
U.S. Appl. No. 16/513,544, filed Jul. 16, 2019. [cited by applicant]
U.S. Appl. No. 16/657,988, filed Oct. 18, 2019. [cited by applicant]
U.S. Appl. No. 17/444,152, filed Jul. 30, 2021. [cited by applicant]
U.S. Appl. No. 17/444,161, filed Jul. 30, 2021. [cited by applicant]
U.S. Appl. No. 17/589,558, filed Jan. 31, 2022. [cited by applicant]
U.S. Appl. No. 17/589,677, filed Jan. 31, 2022. [cited by applicant]
U.S. Appl. No. 17/589,796, filed Jan. 31, 2022. [cited by applicant]
U.S. Appl. No. 17/652,888, filed Feb. 28, 2022. [cited by applicant]
U.S. Appl. No. 17/811,821, filed Jul. 11, 2022. [cited by applicant]
U.S. Appl. No. 17/816,337, filed Jul. 29, 2022. [cited by applicant]
U.S. Appl. No. 17/816,357, filed Jul. 29, 2022. [cited by applicant]
U.S. Appl. No. 17/816,359, filed Jul. 29, 2022. [cited by applicant]
Zhang, et al., “Coupling Browse and Search in Highly Interactive User Interfaces: A Study of the Relation Browser,” Published in UNC.Edu; 2004. [cited by applicant]
U.S. Appl. No. 18/051,440, filed Oct. 31, 2022. [cited by applicant]
U.S. Appl. No. 18/051,458, filed Oct. 31, 2022. [cited by applicant]
U.S. Appl. No. 18/162,503, filed Jan. 31, 2023. [cited by applicant]
U.S. Appl. No. 18/144,094, filed May 5, 2023. [cited by applicant]
U.S. Appl. No. 18/441,788, filed Feb. 14, 2024. [cited by applicant]
Cited By (2)
US 12,417,074 US 12,730,834