{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5QDXT5PCJHXR24CBWXNN7LOLSV","short_pith_number":"pith:5QDXT5PC","schema_version":"1.0","canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","source":{"kind":"arxiv","id":"1803.03708","version":1},"attestation_state":"computed","paper":{"title":"Computational Complexity of Generalized Push Fight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Jeffrey Bosboom, Mikhail Rudoy","submitted_at":"2018-03-09T22:10:17Z","abstract_excerpt":"We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position, even for simple (almost rectangular) hole-free boards. We also analyze the mate-in-1 problem: can the player win in a single turn? One turn in Push Fight consists of up to two \"moves\" followed by a mandatory \"push\". With these rules, or generalizing the number of allowed moves to any constant, we show mate-in-1 can be solved in polynomial time. If, however, t"},"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":"1803.03708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T22:10:17Z","cross_cats_sorted":[],"title_canon_sha256":"b68dbaac35493c74d0394373b055e7f7a8c2ed8db130fa902a77617ac7a21bb3","abstract_canon_sha256":"f801b9bf70ab7a74b7afd64eff07133a7472cfd5bbf9bf359e37a7e2411aaf94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.397106Z","signature_b64":"FzHocfqUuecZL9Wl5W3fgpqBD+bVBxLuBH4DAdPRJE/uqalt2I1hK0NEsWWY+yXWousasnRWLaSQo1nmpOPvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","last_reissued_at":"2026-05-18T00:21:38.396382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.396382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Complexity of Generalized Push Fight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Jeffrey Bosboom, Mikhail Rudoy","submitted_at":"2018-03-09T22:10:17Z","abstract_excerpt":"We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position, even for simple (almost rectangular) hole-free boards. We also analyze the mate-in-1 problem: can the player win in a single turn? One turn in Push Fight consists of up to two \"moves\" followed by a mandatory \"push\". With these rules, or generalizing the number of allowed moves to any constant, we show mate-in-1 can be solved in polynomial time. If, however, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03708","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":"1803.03708","created_at":"2026-05-18T00:21:38.396497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03708v1","created_at":"2026-05-18T00:21:38.396497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03708","created_at":"2026-05-18T00:21:38.396497+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QDXT5PCJHXR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QDXT5PCJHXR24CB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QDXT5PC","created_at":"2026-05-18T12:32:08.215937+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/5QDXT5PCJHXR24CBWXNN7LOLSV","json":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV.json","graph_json":"https://pith.science/api/pith-number/5QDXT5PCJHXR24CBWXNN7LOLSV/graph.json","events_json":"https://pith.science/api/pith-number/5QDXT5PCJHXR24CBWXNN7LOLSV/events.json","paper":"https://pith.science/paper/5QDXT5PC"},"agent_actions":{"view_html":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV","download_json":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV.json","view_paper":"https://pith.science/paper/5QDXT5PC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03708&json=true","fetch_graph":"https://pith.science/api/pith-number/5QDXT5PCJHXR24CBWXNN7LOLSV/graph.json","fetch_events":"https://pith.science/api/pith-number/5QDXT5PCJHXR24CBWXNN7LOLSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/action/storage_attestation","attest_author":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/action/author_attestation","sign_citation":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/action/citation_signature","submit_replication":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/action/replication_record"}},"created_at":"2026-05-18T00:21:38.396497+00:00","updated_at":"2026-05-18T00:21:38.396497+00:00"}