{"as_of":"2026-08-11T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d556c1250175fa1a1155a8fa904f802ceda66dafc6724544576e8a9f3e0d1a89","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-11T06:34:44.6726+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-07T15:31:58.941485Z","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-07T15:31:59.094867Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.13939","last_updated":"2021-06-04T14:38:53Z","snapshot_observed_at":"2026-07-06T11:13:44.890922Z","submitted_at":"2021-05-28T16:01:42Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","version":2},"cited_work":{"arxiv_id":"2105.13939","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.13939","snapshot_observed_at":"2026-08-07T15:31:59.094867Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems","venue":"cs.LG","work_id":"ec846b71-034f-49d4-a360-48465bd049ad","year":2021},"citing_paper":{"arxiv_id":"2505.15212","last_updated":"2025-05-21T07:41:16Z","snapshot_observed_at":"2026-08-10T23:24:40.669818Z","submitted_at":"2025-05-21T07:41:16Z","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:31:58.941485Z"},"links":{"cited_paper":"/paper/2105.13939","citing_paper":"/paper/2505.15212"},"observation_digest":"sha256:71d46f200c618b29dbd24d00805bcad890c39669d07e90b03e2c667d1f9f769b","observation_id":"443b5c99-d015-4f14-9720-3d2560f69c93","resolution":{"observed_at":"2026-08-07T15:31:59.099279Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2105.13939/citation-record","integrity":"/paper/2105.13939/integrity","json":"/paper/2105.13939/citation-record.json","paper":"/paper/2105.13939"},"outbound":[],"paper":{"arxiv_id":"2105.13939","last_updated":"2021-06-04T14:38:53Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T11:13:44.890922Z","submitted_at":"2021-05-28T16:01:42Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems"},"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 1 inbound Pith citation observation for arXiv:2105.13939."}