{"as_of":"2026-08-11T17:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b9138509045ab6b3c8bf84447b8b918058a2d3d5b57cbfc769c05cb5f0972ae3","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-11T06:34:44.6726+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-10T12:06:30.142236Z","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-05T22:01:35.375194Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.11256","last_updated":"2025-03-18T08:31:00Z","snapshot_observed_at":"2026-07-30T19:55:33.956318Z","submitted_at":"2023-08-22T07:59:49Z","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.11256","snapshot_observed_at":"2026-08-10T12:06:30.142236Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.16600","last_updated":"2025-08-03T09:26:20Z","snapshot_observed_at":"2026-08-10T11:58:08.593946Z","submitted_at":"2025-01-28T00:29:38Z","title":"On the Power of Perturbation under Sampling in Solving Extensive-Form Games","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T12:06:30.142236Z"},"links":{"cited_paper":"/paper/2308.11256","citing_paper":"/paper/2501.16600"},"observation_digest":"sha256:f5a79b78d6529d42e3b4c13ae0459b62006236bd10738e6b301443b50d060ca0","observation_id":"1dab411d-20b4-4d41-8e0a-690373dcc248","resolution":{"observed_at":"2026-08-10T12:06:30.142236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.11256","last_updated":"2025-03-18T08:31:00Z","snapshot_observed_at":"2026-07-30T19:55:33.956318Z","submitted_at":"2023-08-22T07:59:49Z","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","version":2},"cited_work":{"arxiv_id":"2308.11256","doi":null,"metadata_source":"pith","pith_arxiv_id":"2308.11256","snapshot_observed_at":"2026-08-05T22:01:35.375194Z","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","venue":"cs.GT","work_id":"a593e1b5-9c20-49db-9f70-be17705a421a","year":2023},"citing_paper":{"arxiv_id":"2508.07699","last_updated":"2025-08-11T07:22:54Z","snapshot_observed_at":"2026-08-07T10:27:57.626746Z","submitted_at":"2025-08-11T07:22:54Z","title":"Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T22:01:33.432030Z"},"links":{"cited_paper":"/paper/2308.11256","citing_paper":"/paper/2508.07699"},"observation_digest":"sha256:1db8559ce8006dd3c8155e9c3bc0c54518dffa7dd631337bdd303f78e26488c5","observation_id":"e37cdedc-6bb0-4913-886e-ba91cb05fcb7","resolution":{"observed_at":"2026-08-05T22:01:35.429701Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2308.11256/citation-record","integrity":"/paper/2308.11256/integrity","json":"/paper/2308.11256/citation-record.json","paper":"/paper/2308.11256"},"outbound":[],"paper":{"arxiv_id":"2308.11256","last_updated":"2025-03-18T08:31:00Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-07-30T19:55:33.956318Z","submitted_at":"2023-08-22T07:59:49Z","title":"Efficient Last-iterate Convergence Algorithms in Solving 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2308.11256."}