{"as_of":"2026-08-18T12:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c16335da8a934814e87aee3f8154bdfd54ce91373810462a4431ae9554137ba2","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T01:15:16.917005Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T13:33:28.476338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","snapshot_observed_at":"2026-08-16T18:45:20.392063Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07929","snapshot_observed_at":"2026-08-16T01:15:16.917005Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.02383","last_updated":"2025-06-05T03:07:12Z","snapshot_observed_at":"2026-08-16T00:50:34.011162Z","submitted_at":"2025-05-05T05:48:52Z","title":"Connecting Thompson Sampling and UCB: Towards More Efficient Trade-offs Between Privacy and Regret","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T01:15:16.917005Z"},"links":{"cited_paper":"/paper/2102.07929","citing_paper":"/paper/2505.02383"},"observation_digest":"sha256:9aaba86bc58612a864c8236d80d90682bac227a25c7f3e7ec72d651945d97e81","observation_id":"18065b58-de4b-4a8c-ae52-7913b4945d75","resolution":{"observed_at":"2026-08-16T01:15:16.917005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","snapshot_observed_at":"2026-08-16T18:45:20.392063Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07929","snapshot_observed_at":"2026-08-15T23:13:18.249708Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.05613","last_updated":"2025-05-08T19:48:58Z","snapshot_observed_at":"2026-08-16T19:43:11.838883Z","submitted_at":"2025-05-08T19:48:58Z","title":"Optimal Regret of Bernoulli Bandits under Global Differential Privacy","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T23:13:18.249708Z"},"links":{"cited_paper":"/paper/2102.07929","citing_paper":"/paper/2505.05613"},"observation_digest":"sha256:69e079ea2e3211326eb14dac3b7d97093cd120f1f481b4a10e0d119007dacce6","observation_id":"5c2164a3-6ce6-401d-98c7-fe82ab0d9a50","resolution":{"observed_at":"2026-08-15T23:13:18.249708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","snapshot_observed_at":"2026-08-16T18:45:20.392063Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07929","snapshot_observed_at":"2026-08-07T13:40:55.701327Z","title":"Optimal algorithms for private online learning in a stochastic environment","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-16T02:46:13.788217Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.701327Z"},"links":{"cited_paper":"/paper/2102.07929","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:df33b8ab278962058c6b6fb15884fdccc119845aadb7f79f707093559e41b2cc","observation_id":"988f55d8-55aa-45b5-a6ef-244f248ca594","resolution":{"observed_at":"2026-08-07T13:40:55.701327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","snapshot_observed_at":"2026-08-16T18:45:20.392063Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","version":3},"cited_work":{"arxiv_id":"2102.07929","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.07929","snapshot_observed_at":"2026-06-29T13:33:28.476338Z","title":"Mehta, and Nidhi Hegde","venue":null,"work_id":"9bb60824-b368-4981-9061-4fed3756c3ef","year":2021},"citing_paper":{"arxiv_id":"2605.29148","last_updated":"2026-05-27T22:17:00Z","snapshot_observed_at":"2026-08-04T09:52:32.369917Z","submitted_at":"2026-05-27T22:17:00Z","title":"Optimal Gap-Dependent Regret for Private Stochastic Decision-Theoretic Online Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T13:24:42.495334Z"},"links":{"cited_paper":"/paper/2102.07929","citing_paper":"/paper/2605.29148"},"observation_digest":"sha256:7fc9c9e85670edbd037247e27d2ba8dc117084d4ebfa65969640d15ea194ad4f","observation_id":"ed95d470-a110-4ad6-a0f2-7ed8d38c40b7","resolution":{"observed_at":"2026-06-29T13:33:28.477914Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.07929/citation-record","integrity":"/paper/2102.07929/integrity","json":"/paper/2102.07929/citation-record.json","paper":"/paper/2102.07929"},"outbound":[],"paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:45:20.392063Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2102.07929."}