{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5QDXT5PCJHXR24CBWXNN7LOLSV","short_pith_number":"pith:5QDXT5PC","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"},"canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","source":{"kind":"arxiv","id":"1803.03708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03708","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03708v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03708","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"5QDXT5PCJHXR","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QDXT5PCJHXR24CB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QDXT5PC","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5QDXT5PCJHXR24CBWXNN7LOLSV","target":"record","payload":{"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"},"canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","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"},"source_kind":"arxiv","source_id":"1803.03708","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecS1SnpZ/Qk0J8YbEcECVy8L6vPhIoVYIfd+uNwq/hsUGaagd7E7dTbLQnRjN9n/LJdqGmo0ExgXovgJY1BLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:34:48.522735Z"},"content_sha256":"c40e21e0f4f5dab8d6742a62a7266ac00f4500536fe378ea048b1e7b36f2c249","schema_version":"1.0","event_id":"sha256:c40e21e0f4f5dab8d6742a62a7266ac00f4500536fe378ea048b1e7b36f2c249"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5QDXT5PCJHXR24CBWXNN7LOLSV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+18vCM/YKA/tevE3Dk7skDu/nC+78ZjzpVt4K35kXosDgAlclSFc8vSjIPhTeIFAR1qe0gYM17XLKGmPbJC0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:34:48.523073Z"},"content_sha256":"76c59b8705daff9ae6375323d02034b56ce97ffacd1e3f3edafc404dabdba87e","schema_version":"1.0","event_id":"sha256:76c59b8705daff9ae6375323d02034b56ce97ffacd1e3f3edafc404dabdba87e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/bundle.json","state_url":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T00:34:48Z","links":{"resolver":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV","bundle":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/bundle.json","state":"https://pith.science/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QDXT5PCJHXR24CBWXNN7LOLSV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5QDXT5PCJHXR24CBWXNN7LOLSV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f801b9bf70ab7a74b7afd64eff07133a7472cfd5bbf9bf359e37a7e2411aaf94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T22:10:17Z","title_canon_sha256":"b68dbaac35493c74d0394373b055e7f7a8c2ed8db130fa902a77617ac7a21bb3"},"schema_version":"1.0","source":{"id":"1803.03708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03708","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03708v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03708","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"5QDXT5PCJHXR","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QDXT5PCJHXR24CB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QDXT5PC","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:76c59b8705daff9ae6375323d02034b56ce97ffacd1e3f3edafc404dabdba87e","target":"graph","created_at":"2026-05-18T00:21:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Erik D. Demaine, Jeffrey Bosboom, Mikhail Rudoy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T22:10:17Z","title":"Computational Complexity of Generalized Push Fight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03708","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c40e21e0f4f5dab8d6742a62a7266ac00f4500536fe378ea048b1e7b36f2c249","target":"record","created_at":"2026-05-18T00:21:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f801b9bf70ab7a74b7afd64eff07133a7472cfd5bbf9bf359e37a7e2411aaf94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-09T22:10:17Z","title_canon_sha256":"b68dbaac35493c74d0394373b055e7f7a8c2ed8db130fa902a77617ac7a21bb3"},"schema_version":"1.0","source":{"id":"1803.03708","kind":"arxiv","version":1}},"canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec0779f5e249ef1d7041b5dadfadcb954c86f59c25ab2a2f7ad7adb8edfe0c4c","first_computed_at":"2026-05-18T00:21:38.396382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.396382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzHocfqUuecZL9Wl5W3fgpqBD+bVBxLuBH4DAdPRJE/uqalt2I1hK0NEsWWY+yXWousasnRWLaSQo1nmpOPvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.397106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c40e21e0f4f5dab8d6742a62a7266ac00f4500536fe378ea048b1e7b36f2c249","sha256:76c59b8705daff9ae6375323d02034b56ce97ffacd1e3f3edafc404dabdba87e"],"state_sha256":"f7480b1334b407d86b119037817aa3ff1d7efec86074485c874a642c9a5bca03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6vEk0PRCuGHYWCF0kRkUAhxckUWLcvI1VMaIMpB4vgZJ6CpeJgnWkARio+/NxxqUoRnaoScsBQ8H3BElGKfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:34:48.525053Z","bundle_sha256":"7373e9cd25d1fc4d7630a169961f1ede515d6e604672a7c4ae41509301c55a7d"}}