{"as_of":"2026-08-19T03:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fb7b0c3f1aff9679de3f05481d63c0cf45b35aa7f27a194b4b02e02b008c80b9","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-18T06:34:40.430872+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-07-09T20:37:29.523862Z","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-09T20:46:33.687591Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.06957","last_updated":"2023-12-15T16:04:24Z","snapshot_observed_at":"2026-08-16T14:35:39.130328Z","submitted_at":"2023-12-12T03:34:09Z","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","version":2},"cited_work":{"arxiv_id":"2312.06957","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.06957","snapshot_observed_at":"2026-07-09T20:46:33.687591Z","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","venue":"cs.LG","work_id":"6839e89d-3e66-4bfd-b7b5-f0b2d773445a","year":2023},"citing_paper":{"arxiv_id":"2607.07078","last_updated":"2026-07-08T07:08:52Z","snapshot_observed_at":"2026-08-18T07:56:18.411895Z","submitted_at":"2026-07-08T07:08:52Z","title":"Forgetting-Factor Regret for Online Zero-Sum Games","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"cited_paper":"/paper/2312.06957","citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:3b2c310b3008ae30dd1971360c20c84cd14be332458d243a88db3a03ee096b03","observation_id":"0739d860-98fe-41ee-9a72-e7e73c51ff97","resolution":{"observed_at":"2026-07-09T20:46:33.688834Z","resolver_source":"local_arxiv","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/2312.06957/citation-record","integrity":"/paper/2312.06957/integrity","json":"/paper/2312.06957/citation-record.json","paper":"/paper/2312.06957"},"outbound":[],"paper":{"arxiv_id":"2312.06957","last_updated":"2023-12-15T16:04:24Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:35:39.130328Z","submitted_at":"2023-12-12T03:34:09Z","title":"Online Saddle Point Problem and Online Convex-Concave 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2312.06957."}