{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7TGTXFEGCY4YHLTMLUYOY635CU","short_pith_number":"pith:7TGTXFEG","schema_version":"1.0","canonical_sha256":"fccd3b9486163983ae6c5d30ec7b7d15044c17e1e7a2d40d0eced48b3b43917e","source":{"kind":"arxiv","id":"1511.00984","version":1},"attestation_state":"computed","paper":{"title":"Undirected Cat-and-Mouse is P-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arefin Huq","submitted_at":"2015-11-03T16:59:06Z","abstract_excerpt":"Cat-and-mouse is a two-player game on a finite graph. Chandra and Stockmeyer showed cat-and-mouse is P-complete on directed graphs. We show cat-and-mouse is P-complete on undirected graphs. To our knowledge, no proof of the directed case was ever published. To fill this gap we give a proof for directed graphs and extend it to undirected graphs. The proof is a reduction from a variant of the circuit value problem."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.00984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-03T16:59:06Z","cross_cats_sorted":[],"title_canon_sha256":"82d0885928e5c0aec99a53f965585cea40c4d1cc94aadbb211ff070ce18438d4","abstract_canon_sha256":"e734349ef3d6233ffcc6b0b1f5aee674cff45efe29219d08924e107da8522620"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:55.607470Z","signature_b64":"FCRowDfrZ7IjcjG0fMUuJR2icmzGRS0KupOJzbI+S25MiIKt/7gy/H0RxeBjYcvvPGFiGO4GgZnQN1yuPFXgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fccd3b9486163983ae6c5d30ec7b7d15044c17e1e7a2d40d0eced48b3b43917e","last_reissued_at":"2026-05-18T01:27:55.606564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:55.606564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Undirected Cat-and-Mouse is P-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arefin Huq","submitted_at":"2015-11-03T16:59:06Z","abstract_excerpt":"Cat-and-mouse is a two-player game on a finite graph. Chandra and Stockmeyer showed cat-and-mouse is P-complete on directed graphs. We show cat-and-mouse is P-complete on undirected graphs. To our knowledge, no proof of the directed case was ever published. To fill this gap we give a proof for directed graphs and extend it to undirected graphs. The proof is a reduction from a variant of the circuit value problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00984","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.00984","created_at":"2026-05-18T01:27:55.606707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00984v1","created_at":"2026-05-18T01:27:55.606707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00984","created_at":"2026-05-18T01:27:55.606707+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TGTXFEGCY4Y","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TGTXFEGCY4YHLTM","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TGTXFEG","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU","json":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU.json","graph_json":"https://pith.science/api/pith-number/7TGTXFEGCY4YHLTMLUYOY635CU/graph.json","events_json":"https://pith.science/api/pith-number/7TGTXFEGCY4YHLTMLUYOY635CU/events.json","paper":"https://pith.science/paper/7TGTXFEG"},"agent_actions":{"view_html":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU","download_json":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU.json","view_paper":"https://pith.science/paper/7TGTXFEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00984&json=true","fetch_graph":"https://pith.science/api/pith-number/7TGTXFEGCY4YHLTMLUYOY635CU/graph.json","fetch_events":"https://pith.science/api/pith-number/7TGTXFEGCY4YHLTMLUYOY635CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU/action/storage_attestation","attest_author":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU/action/author_attestation","sign_citation":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU/action/citation_signature","submit_replication":"https://pith.science/pith/7TGTXFEGCY4YHLTMLUYOY635CU/action/replication_record"}},"created_at":"2026-05-18T01:27:55.606707+00:00","updated_at":"2026-05-18T01:27:55.606707+00:00"}