{"as_of":"2026-08-18T11:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ecb48de68d6f17e5c38cff05b5d3b158223a257f90560ca297c9747344602565","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-10T22:58:10.121476Z","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-10T22:58:10.468136Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.00676","last_updated":"2025-03-04T18:13:47Z","snapshot_observed_at":"2026-08-16T14:46:47.796502Z","submitted_at":"2023-11-01T17:34:58Z","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","version":2},"cited_work":{"arxiv_id":"2311.00676","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.00676","snapshot_observed_at":"2026-08-10T22:58:10.468136Z","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","venue":"cs.GT","work_id":"0dfe25f6-d397-4b42-b8ac-5ce03f9b3c64","year":2023},"citing_paper":{"arxiv_id":"2501.00533","last_updated":"2024-12-31T16:32:51Z","snapshot_observed_at":"2026-08-18T03:48:23.867888Z","submitted_at":"2024-12-31T16:32:51Z","title":"Rapid Learning in Constrained Minimax Games with Negative Momentum","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T22:58:10.121476Z"},"links":{"cited_paper":"/paper/2311.00676","citing_paper":"/paper/2501.00533"},"observation_digest":"sha256:8bba82c2112a5dae00a6b3463d2ba50da6feaf0fb1790186617fbfc18e89bf5a","observation_id":"a1f1ee02-0f81-4540-91e4-aa4efd0a1574","resolution":{"observed_at":"2026-08-10T22:58:10.472296Z","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/2311.00676/citation-record","integrity":"/paper/2311.00676/integrity","json":"/paper/2311.00676/citation-record.json","paper":"/paper/2311.00676"},"outbound":[],"paper":{"arxiv_id":"2311.00676","last_updated":"2025-03-04T18:13:47Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T14:46:47.796502Z","submitted_at":"2023-11-01T17:34:58Z","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games"},"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 1 inbound Pith citation observation for arXiv:2311.00676."}