{"as_of":"2026-08-10T20:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad3f1c67f724beb93eed63299a0b058936b042b4e743fa7584cce356fe3076fd","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:23:25.188591Z","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-05-20T07:53:09.874591Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.12529","last_updated":"2025-06-18T16:11:36Z","snapshot_observed_at":"2026-08-07T18:10:13.864971Z","submitted_at":"2025-02-18T04:32:52Z","title":"Alternating Regret for Online Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12529","snapshot_observed_at":"2026-08-07T14:23:25.188591Z","title":"Alternating regret for online convex optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19537","last_updated":"2025-05-26T05:55:16Z","snapshot_observed_at":"2026-08-07T14:09:36.089672Z","submitted_at":"2025-05-26T05:55:16Z","title":"Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T14:23:25.188591Z"},"links":{"cited_paper":"/paper/2502.12529","citing_paper":"/paper/2505.19537"},"observation_digest":"sha256:27e9e9da336cedeccdce5b33c2c340b12cd4417e03910a30fc31f1b1c935ffd3","observation_id":"c70c3e5d-9c9b-4b85-bad7-3ea827bb22cd","resolution":{"observed_at":"2026-08-07T14:23:25.188591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12529","last_updated":"2025-06-18T16:11:36Z","snapshot_observed_at":"2026-08-07T18:10:13.864971Z","submitted_at":"2025-02-18T04:32:52Z","title":"Alternating Regret for Online Convex Optimization","version":2},"cited_work":{"arxiv_id":"2502.12529","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12529","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2502.12529 , year=","venue":null,"work_id":"34c95565-c0d7-402b-8148-2e6e7a0a92ce","year":null},"citing_paper":{"arxiv_id":"2605.19392","last_updated":"2026-05-19T05:38:47Z","snapshot_observed_at":"2026-08-02T05:39:33.489285Z","submitted_at":"2026-05-19T05:38:47Z","title":"Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach","version":1},"reference_index":201,"source":"arxiv_source","source_observed_at":"2026-05-20T07:50:52.050949Z"},"links":{"cited_paper":"/paper/2502.12529","citing_paper":"/paper/2605.19392"},"observation_digest":"sha256:bc36fb610e11c6d041c27c5904d30a0e05bd9d181a6fdc2b563b92fbb52b072c","observation_id":"bba004b4-f55a-47c8-82d2-e86e8c3cefe5","resolution":{"observed_at":"2026-05-20T07:53:09.878022Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.12529/citation-record","integrity":"/paper/2502.12529/integrity","json":"/paper/2502.12529/citation-record.json","paper":"/paper/2502.12529"},"outbound":[],"paper":{"arxiv_id":"2502.12529","last_updated":"2025-06-18T16:11:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T18:10:13.864971Z","submitted_at":"2025-02-18T04:32:52Z","title":"Alternating Regret for Online Convex Optimization"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.12529."}