{"as_of":"2026-08-13T02:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a7027a2c9646f1d1992993bb3dcdc7b037cead9a56f676706c225dba164daebe","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-12T06:34:41.77262+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-07-31T20:47:02.484483Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T04:23:03.623552Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2007.08387","last_updated":"2020-07-16T15:05:51Z","snapshot_observed_at":"2026-08-13T01:39:45.513555Z","submitted_at":"2020-07-16T15:05:51Z","title":"Solving Random Parity Games in Polynomial Time","version":1},"cited_work":{"arxiv_id":"2007.08387","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.08387","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"CoRR , volume =","venue":null,"work_id":"c48800b9-f797-4f2f-924e-72323537a30c","year":2020},"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":117,"source":"arxiv_source","source_observed_at":"2026-05-20T04:20:42.459576Z"},"links":{"cited_paper":"/paper/2007.08387","citing_paper":"/paper/2605.19954"},"observation_digest":"sha256:65cc74d20a0e05cec50d25696ee25ddf650ebd0021ebcaaf715d3959cbe30a7e","observation_id":"8ef5e046-f5fd-49e2-8c80-f31a2b51e2b9","resolution":{"observed_at":"2026-05-20T04:23:03.626143Z","resolver_source":"arxiv_id","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":"2007.08387","last_updated":"2020-07-16T15:05:51Z","snapshot_observed_at":"2026-08-13T01:39:45.513555Z","submitted_at":"2020-07-16T15:05:51Z","title":"Solving Random Parity Games in Polynomial Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08387","snapshot_observed_at":"2026-07-31T20:47:02.484483Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2020},"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":49,"source":"arxiv_source","source_observed_at":"2026-07-31T20:47:02.484483Z"},"links":{"cited_paper":"/paper/2007.08387","citing_paper":"/paper/2607.24219"},"observation_digest":"sha256:23d4695029d46e0d855df1206aec1199c1d9fffd0bd94477f1e6cb88955f3819","observation_id":"7d6e65a2-df5d-4156-a306-13977380d800","resolution":{"observed_at":"2026-07-31T20:47:02.484483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2007.08387/citation-record","integrity":"/paper/2007.08387/integrity","json":"/paper/2007.08387/citation-record.json","paper":"/paper/2007.08387"},"outbound":[],"paper":{"arxiv_id":"2007.08387","last_updated":"2020-07-16T15:05:51Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-13T01:39:45.513555Z","submitted_at":"2020-07-16T15:05:51Z","title":"Solving Random Parity Games in Polynomial Time"},"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 2 inbound Pith citation observations for arXiv:2007.08387."}