{"as_of":"2026-08-12T20:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c2065dd5c78048c64c4bb633b263844e6d0682ee45a6a4619e04309842617a73","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:37:21.684333Z","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-08-11T17:37:22.282463Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.13595","last_updated":"2024-11-12T21:17:48Z","snapshot_observed_at":"2026-08-12T13:03:17.757332Z","submitted_at":"2021-09-28T10:11:06Z","title":"The Fragility of Optimized Bandit Algorithms","version":8},"cited_work":{"arxiv_id":"2109.13595","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.13595","snapshot_observed_at":"2026-08-11T17:37:22.282463Z","title":"The Fragility of Optimized Bandit Algorithms","venue":"cs.LG","work_id":"ebd47499-228b-4f45-adf4-cdaf4fd7adb9","year":2021},"citing_paper":{"arxiv_id":"2412.08843","last_updated":"2025-02-16T06:55:38Z","snapshot_observed_at":"2026-08-12T02:53:12.901098Z","submitted_at":"2024-12-12T00:44:43Z","title":"Precise Asymptotics and Refined Regret of Variance-Aware UCB","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T17:37:21.684333Z"},"links":{"cited_paper":"/paper/2109.13595","citing_paper":"/paper/2412.08843"},"observation_digest":"sha256:444b9c7b3634943764943dc9f61cc8cfbc09dc3ab55b5cd71a4910a94a61da1c","observation_id":"746c7001-c126-4f00-868b-22b09e42d1d8","resolution":{"observed_at":"2026-08-11T17:37:22.294527Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.13595/citation-record","integrity":"/paper/2109.13595/integrity","json":"/paper/2109.13595/citation-record.json","paper":"/paper/2109.13595"},"outbound":[],"paper":{"arxiv_id":"2109.13595","last_updated":"2024-11-12T21:17:48Z","latest_version":8,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:03:17.757332Z","submitted_at":"2021-09-28T10:11:06Z","title":"The Fragility of Optimized Bandit Algorithms"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2109.13595."}