{"as_of":"2026-08-19T04:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:59079f73e62c35c9e65454e446bb593fb92bd7ddf91858a371bb5b4b5864262c","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-08-15T16:23:34.997825Z","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-15T18:16:14.067578Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.08301","last_updated":"2020-04-05T20:11:12Z","snapshot_observed_at":"2026-08-18T23:46:08.163319Z","submitted_at":"2018-06-21T15:57:17Z","title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks","version":3},"cited_work":{"arxiv_id":"1806.08301","doi":"10.48550/arxiv.1806.08301","metadata_source":"pith","pith_arxiv_id":"1806.08301","snapshot_observed_at":"2026-08-15T18:16:14.067578Z","title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks","venue":"stat.ML","work_id":"c482693e-bcd9-4ba8-bfd0-9b31065ac1e6","year":2018},"citing_paper":{"arxiv_id":"2509.07901","last_updated":"2025-09-09T16:33:38Z","snapshot_observed_at":"2026-08-19T02:10:27.335264Z","submitted_at":"2025-09-09T16:33:38Z","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-15T16:23:34.997825Z"},"links":{"cited_paper":"/paper/1806.08301","citing_paper":"/paper/2509.07901"},"observation_digest":"sha256:aa80ff94558fadf0d0ddad6b74048e5fd0b6e990b0827d622ddd31e8d6089c04","observation_id":"31449816-fad2-4f37-9682-6a1247941982","resolution":{"observed_at":"2026-08-15T16:23:35.643713Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1806.08301/citation-record","integrity":"/paper/1806.08301/integrity","json":"/paper/1806.08301/citation-record.json","paper":"/paper/1806.08301"},"outbound":[],"paper":{"arxiv_id":"1806.08301","last_updated":"2020-04-05T20:11:12Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-18T23:46:08.163319Z","submitted_at":"2018-06-21T15:57:17Z","title":"The Online Saddle Point Problem and Online Convex Optimization with Knapsacks"},"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:1806.08301."}