{"as_of":"2026-08-18T13:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6cbdba515ed5f506baa04be1a0908855c2a9e115b8a91f5fe26c441239a1c3f","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-18T06:34:40.430872+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-15T16:23:35.045711Z","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.692340Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-08-05T21:19:39.044671Z","title":"Online and bandit algorithms for nonstationary stochastic saddle-po int optimiza- tion,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2508.09411","last_updated":"2025-08-13T01:03:08Z","snapshot_observed_at":"2026-08-11T20:40:07.855605Z","submitted_at":"2025-08-13T01:03:08Z","title":"Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T21:19:39.044671Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2508.09411"},"observation_digest":"sha256:25a8ee2098a8d7971d0b92ee32b046dbc90049ad7dc88e0790568cbe8e3c384c","observation_id":"9c9eb0e8-c011-471c-bbcb-e9ff7e7f7168","resolution":{"observed_at":"2026-08-05T21:19:39.044671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-08-15T16:23:35.045711Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-18T08:36:35.640182Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:35.045711Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:9448cdc99249417e62ba1b79a6cf2ffefc6281cc1e2262bf1aada42c9186136c","observation_id":"7f887d52-b9a7-4077-8634-efadbd719be3","resolution":{"observed_at":"2026-08-15T16:23:35.045711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","version":1},"cited_work":{"arxiv_id":"1912.01698","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.01698","snapshot_observed_at":"2026-07-09T20:46:33.692340Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization","venue":"math.OC","work_id":"e7deeec8-eefd-4c40-a148-c57bcce1b5ea","year":2019},"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":39,"source":"pdf_text","source_observed_at":"2026-07-09T20:37:29.523862Z"},"links":{"cited_paper":"/paper/1912.01698","citing_paper":"/paper/2607.07078"},"observation_digest":"sha256:54e83f17a76a2606316d62315a79814d416aced930a81e9c059953acf0688605","observation_id":"f46aeb6f-5868-4a84-9993-2b69eb34babb","resolution":{"observed_at":"2026-07-09T20:46:33.693661Z","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/1912.01698/citation-record","integrity":"/paper/1912.01698/integrity","json":"/paper/1912.01698/citation-record.json","paper":"/paper/1912.01698"},"outbound":[],"paper":{"arxiv_id":"1912.01698","last_updated":"2019-12-03T21:52:38Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T12:15:51.800780Z","submitted_at":"2019-12-03T21:52:38Z","title":"Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point 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 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1912.01698."}