{"as_of":"2026-08-23T17:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af199005e118f8ff0fe37ea0ef8180749fe024ffcd90b2076de507f446a45134","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-23T06:30:58.430688+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-08-16T12:07:01.996869Z","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-18T16:56:38.372045Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.20271","last_updated":"2025-02-27T16:57:05Z","snapshot_observed_at":"2026-08-16T12:54:34.095856Z","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20271","snapshot_observed_at":"2026-08-16T12:07:01.996869Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.14256","last_updated":"2025-04-19T10:20:40Z","snapshot_observed_at":"2026-08-16T11:50:53.467001Z","submitted_at":"2025-04-19T10:20:40Z","title":"Maker-Maker games of rank 4 are PSPACE-complete","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T12:07:01.996869Z"},"links":{"cited_paper":"/paper/2502.20271","citing_paper":"/paper/2504.14256"},"observation_digest":"sha256:f76b49e5a3963ce3d97e507153d4fc8fa2a6f5f7d7d9a20f4ddfd0d87bf44cbc","observation_id":"cd2c339b-13e2-4d42-96fb-3fe6b5561ae8","resolution":{"observed_at":"2026-08-16T12:07:01.996869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20271","last_updated":"2025-02-27T16:57:05Z","snapshot_observed_at":"2026-08-16T12:54:34.095856Z","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","version":1},"cited_work":{"arxiv_id":"2502.20271","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20271","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9c6f51f5-646c-469a-b7f7-655eac4e3f7c","year":2025},"citing_paper":{"arxiv_id":"2509.13819","last_updated":"2026-04-12T07:47:47Z","snapshot_observed_at":"2026-08-16T20:37:11.821065Z","submitted_at":"2025-09-17T08:36:11Z","title":"4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T16:53:53.220226Z"},"links":{"cited_paper":"/paper/2502.20271","citing_paper":"/paper/2509.13819"},"observation_digest":"sha256:d5a4077c16d7a70fcca633fdfeb1f166022c606d395ee0cd5ae0a603484778e4","observation_id":"17a911de-45e8-41db-a0c9-53a475cc54a1","resolution":{"observed_at":"2026-05-18T16:56:38.374246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20271","last_updated":"2025-02-27T16:57:05Z","snapshot_observed_at":"2026-08-16T12:54:34.095856Z","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20271","snapshot_observed_at":"2026-08-01T15:12:56.751500Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete.CoRR, abs/2502.20271, 2025.arXiv:2502.20271","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.751500Z"},"links":{"cited_paper":"/paper/2502.20271","citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:128719b90a246d790aec380535bad5982503fde7255cb0b7ab881ee29827e836","observation_id":"da6a2a39-c039-4fcc-b63f-039178809727","resolution":{"observed_at":"2026-08-01T15:12:56.751500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.20271/citation-record","integrity":"/paper/2502.20271/integrity","json":"/paper/2502.20271/citation-record.json","paper":"/paper/2502.20271"},"outbound":[],"paper":{"arxiv_id":"2502.20271","last_updated":"2025-02-27T16:57:05Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T12:54:34.095856Z","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.20271."}