{"as_of":"2026-08-11T22:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1eb1a32e48be5d6c08146015fbe1b1f906ab879a0daaa43528c4ec9e131a3536","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:44:33.487535Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T23:56:38.467308Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.06802","last_updated":"2025-06-29T21:03:28Z","snapshot_observed_at":"2026-07-06T18:28:33.795339Z","submitted_at":"2024-06-10T21:15:28Z","title":"Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06802","snapshot_observed_at":"2026-08-10T21:44:33.487535Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.03999","last_updated":"2025-08-21T00:57:44Z","snapshot_observed_at":"2026-08-10T21:39:53.371637Z","submitted_at":"2025-01-07T18:55:02Z","title":"Adaptive Experiments Under Data Sparse Settings: Applications for Educational Platforms","version":4},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T21:44:33.487535Z"},"links":{"cited_paper":"/paper/2406.06802","citing_paper":"/paper/2501.03999"},"observation_digest":"sha256:b50ad2117e2a8a4a73805587da38c97cc1e99cd9276b71aa706c23a8be04228b","observation_id":"35cd8569-4a9d-4bcf-b49a-565ab5fb0580","resolution":{"observed_at":"2026-08-10T21:44:33.487535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06802","last_updated":"2025-06-29T21:03:28Z","snapshot_observed_at":"2026-07-06T18:28:33.795339Z","submitted_at":"2024-06-10T21:15:28Z","title":"Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution","version":3},"cited_work":{"arxiv_id":"2406.06802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06802","snapshot_observed_at":"2026-07-09T23:56:38.467308Z","title":"Satisficing exploration in bandit optimization","venue":"stat.ML","work_id":"b556f250-d8aa-4845-9a51-e89c7da84cbc","year":2024},"citing_paper":{"arxiv_id":"2502.05145","last_updated":"2026-04-06T16:56:11Z","snapshot_observed_at":"2026-07-06T20:33:01.960703Z","submitted_at":"2025-02-07T18:23:43Z","title":"From Restless to Contextual: A Thresholding Bandit Reformulation For Finite-horizon Improvement","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-23T03:20:22.327966Z"},"links":{"cited_paper":"/paper/2406.06802","citing_paper":"/paper/2502.05145"},"observation_digest":"sha256:c775ec9ae9572e910dc20cfd3bde837166754fd0ace9dae8f2270c289aa2cc31","observation_id":"8d4e52a0-ace0-4e3b-bec5-1e3b829ca2b3","resolution":{"observed_at":"2026-05-23T03:22:28.015294Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06802","last_updated":"2025-06-29T21:03:28Z","snapshot_observed_at":"2026-07-06T18:28:33.795339Z","submitted_at":"2024-06-10T21:15:28Z","title":"Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution","version":3},"cited_work":{"arxiv_id":"2406.06802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.06802","snapshot_observed_at":"2026-07-09T23:56:38.467308Z","title":"Satisficing exploration in bandit optimization","venue":"stat.ML","work_id":"b556f250-d8aa-4845-9a51-e89c7da84cbc","year":2024},"citing_paper":{"arxiv_id":"2607.06879","last_updated":"2026-07-08T00:41:43Z","snapshot_observed_at":"2026-08-01T14:47:04.386997Z","submitted_at":"2026-07-08T00:41:43Z","title":"Best-Arm Identification with Generative Proxy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T23:48:10.425756Z"},"links":{"cited_paper":"/paper/2406.06802","citing_paper":"/paper/2607.06879"},"observation_digest":"sha256:3da5096d18bbc1ce64b1d846cc411057beff8df0ca6fec981f795d3797d03767","observation_id":"b75cd26b-029c-475f-9870-0e4f96389049","resolution":{"observed_at":"2026-07-09T23:56:38.468730Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.06802/citation-record","integrity":"/paper/2406.06802/integrity","json":"/paper/2406.06802/citation-record.json","paper":"/paper/2406.06802"},"outbound":[],"paper":{"arxiv_id":"2406.06802","last_updated":"2025-06-29T21:03:28Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T18:28:33.795339Z","submitted_at":"2024-06-10T21:15:28Z","title":"Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.06802."}