{"as_of":"2026-08-23T17:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e2f8ee3344f841fceb88738dd89c55186519ef1000f762f9b6a1a5fd11d3465","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.972327Z","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.368006Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2209.12819","last_updated":"2026-07-11T15:41:08Z","snapshot_observed_at":"2026-08-16T16:29:46.774446Z","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12819","snapshot_observed_at":"2026-08-16T12:07:01.972327Z","title":"Galliot, S","venue":null,"work_id":null,"year":2022},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-16T12:07:01.972327Z"},"links":{"cited_paper":"/paper/2209.12819","citing_paper":"/paper/2504.14256"},"observation_digest":"sha256:3ddd8a757c0943214b8f86a2513155c669ee8178a525358119c3fb42f1dc16ef","observation_id":"a0d530d0-9060-4780-b806-1de8834ba1c3","resolution":{"observed_at":"2026-08-16T12:07:01.972327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12819","last_updated":"2026-07-11T15:41:08Z","snapshot_observed_at":"2026-08-16T16:29:46.774446Z","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","version":4},"cited_work":{"arxiv_id":"2209.12819","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2209.12819","snapshot_observed_at":"2026-07-14T01:20:40.056162Z","title":"Galliot, S","venue":null,"work_id":"70b91872-6b30-4078-b009-af12b2dbfe55","year":2022},"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":9,"source":"pdf_text","source_observed_at":"2026-05-18T16:53:53.220226Z"},"links":{"cited_paper":"/paper/2209.12819","citing_paper":"/paper/2509.13819"},"observation_digest":"sha256:ada0bb38224f9dc9412605321e31c6237f2656fc82e1f09f17420032781416e6","observation_id":"618de053-6cc5-44d7-a8d2-1a485bd3ce4c","resolution":{"observed_at":"2026-07-14T01:20:40.056162Z","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":"2209.12819","last_updated":"2026-07-11T15:41:08Z","snapshot_observed_at":"2026-08-16T16:29:46.774446Z","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12819","snapshot_observed_at":"2026-08-01T15:12:55.441245Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3.CoRR, abs/2209.12819, 2025.arXiv:2209.12819","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":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.441245Z"},"links":{"cited_paper":"/paper/2209.12819","citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:37f3ea548d0f5616e9541e90d69c6742c4c71ecb535762cab81f0de03e4a8bf9","observation_id":"86f3387e-424c-476e-9d46-fbf7282c14fe","resolution":{"observed_at":"2026-08-01T15:12:55.441245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2209.12819/citation-record","integrity":"/paper/2209.12819/integrity","json":"/paper/2209.12819/citation-record.json","paper":"/paper/2209.12819"},"outbound":[],"paper":{"arxiv_id":"2209.12819","last_updated":"2026-07-11T15:41:08Z","latest_version":4,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T16:29:46.774446Z","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3"},"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:2209.12819."}