{"as_of":"2026-08-13T01:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:820ab5c13f9860b5d473a218b7830f66484c347a880b829c1aefb7de9f0f72a8","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-12T06:34:41.77262+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-07-31T20:47:04.258222Z","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-08T09:54:50.946446Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1702.01953","last_updated":"2017-04-24T08:26:37Z","snapshot_observed_at":"2026-07-06T05:29:05.528612Z","submitted_at":"2017-02-07T10:49:57Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","version":4},"cited_work":{"arxiv_id":"1702.01953","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.01953","snapshot_observed_at":"2026-07-08T09:54:50.946446Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","venue":"cs.FL","work_id":"0a72a81d-20dd-4bb1-b290-e143263d158b","year":2017},"citing_paper":{"arxiv_id":"2605.19954","last_updated":"2026-05-19T15:05:52Z","snapshot_observed_at":"2026-08-02T02:17:26.475664Z","submitted_at":"2026-05-19T15:05:52Z","title":"Equilibria in Multiplayer Graph Games: An Algorithmic Study","version":1},"reference_index":145,"source":"arxiv_source","source_observed_at":"2026-05-20T04:20:42.459576Z"},"links":{"cited_paper":"/paper/1702.01953","citing_paper":"/paper/2605.19954"},"observation_digest":"sha256:9203cc764ee893af55b44cc8f291e2b20d115bb7cf7ba02bbc450bba389932ee","observation_id":"63cef1fd-4c1b-41ed-a390-3065a5af4934","resolution":{"observed_at":"2026-05-20T04:23:03.611225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.01953","last_updated":"2017-04-24T08:26:37Z","snapshot_observed_at":"2026-07-06T05:29:05.528612Z","submitted_at":"2017-02-07T10:49:57Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","version":4},"cited_work":{"arxiv_id":"1702.01953","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.01953","snapshot_observed_at":"2026-07-08T09:54:50.946446Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","venue":"cs.FL","work_id":"0a72a81d-20dd-4bb1-b290-e143263d158b","year":2017},"citing_paper":{"arxiv_id":"2607.06334","last_updated":"2026-07-07T14:29:47Z","snapshot_observed_at":"2026-07-10T23:18:24.304622Z","submitted_at":"2026-07-07T14:29:47Z","title":"Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T09:50:23.876950Z"},"links":{"cited_paper":"/paper/1702.01953","citing_paper":"/paper/2607.06334"},"observation_digest":"sha256:6b1fb5dac51b1f1a2aa88eed29703eb81e5aeea901fa00b397fdf8c3e028ab61","observation_id":"6e358343-e26d-4565-b2e1-8e3e230b0208","resolution":{"observed_at":"2026-07-08T09:54:50.948504Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.01953","last_updated":"2017-04-24T08:26:37Z","snapshot_observed_at":"2026-07-06T05:29:05.528612Z","submitted_at":"2017-02-07T10:49:57Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1702.01953","snapshot_observed_at":"2026-07-31T20:47:04.258222Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games , journal =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.24219","last_updated":"2026-07-27T09:50:25Z","snapshot_observed_at":"2026-08-07T22:41:20.132377Z","submitted_at":"2026-07-27T09:50:25Z","title":"Algorithms for Equilibria in Concurrent Stopping Games","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-07-31T20:47:04.258222Z"},"links":{"cited_paper":"/paper/1702.01953","citing_paper":"/paper/2607.24219"},"observation_digest":"sha256:5fc36669fafbde78132ede94ec03115779c6e2faa416ee3ad7a7fe2122726a66","observation_id":"23cde679-f09d-4c9d-bb38-481509d5781d","resolution":{"observed_at":"2026-07-31T20:47:04.258222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1702.01953/citation-record","integrity":"/paper/1702.01953/integrity","json":"/paper/1702.01953/citation-record.json","paper":"/paper/1702.01953"},"outbound":[],"paper":{"arxiv_id":"1702.01953","last_updated":"2017-04-24T08:26:37Z","latest_version":4,"primary_category":"cs.FL","snapshot_observed_at":"2026-07-06T05:29:05.528612Z","submitted_at":"2017-02-07T10:49:57Z","title":"A short proof of correctness of the quasi-polynomial time algorithm for parity 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1702.01953."}