{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I5RB7V3UBVCXTW6WR5UAWOVV4I","short_pith_number":"pith:I5RB7V3U","canonical_record":{"source":{"id":"1709.01241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-05T05:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"e3634f86f114db8b1ba6092c20a243c12c3b1b053e1bb4094bcf5218557f3297","abstract_canon_sha256":"0aaf63f9b1af7c525d235bf9584aeda0a2f8a7e51e625254acb990af05b6a23f"},"schema_version":"1.0"},"canonical_sha256":"47621fd7740d4579dbd68f680b3ab5e2034da9146c4c30f32d84fd15d66ea47a","source":{"kind":"arxiv","id":"1709.01241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01241","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01241v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01241","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5RB7V3UBVCX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I5RB7V3UBVCXTW6W","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I5RB7V3U","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I5RB7V3UBVCXTW6WR5UAWOVV4I","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-05T05:42:05Z","cross_cats_sorted":[],"title_canon_sha256":"e3634f86f114db8b1ba6092c20a243c12c3b1b053e1bb4094bcf5218557f3297","abstract_canon_sha256":"0aaf63f9b1af7c525d235bf9584aeda0a2f8a7e51e625254acb990af05b6a23f"},"schema_version":"1.0"},"canonical_sha256":"47621fd7740d4579dbd68f680b3ab5e2034da9146c4c30f32d84fd15d66ea47a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.582149Z","signature_b64":"xQWCfBcyPdyc5BR6GU5UeBCs9icFci6PxBSNQMCO3JjCbwZ83/vmPsfU5HnNfH7Pgrga+XI+jTHTT0C/hgVWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47621fd7740d4579dbd68f680b3ab5e2034da9146c4c30f32d84fd15d66ea47a","last_reissued_at":"2026-05-18T00:36:00.581683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.581683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01241","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uToWmTSvAipkYtvK2U3V37nxCV0gx2PSw9IlXuaDjGjUU0LRyq1cG2VAOUJ4x9s/SLADFzFo1nCZJfUK7g5iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:18.986448Z"},"content_sha256":"f955d8d3ce4a985093cd52806ae95814192d75c7bd8ec38d458963eaedd06978","schema_version":"1.0","event_id":"sha256:f955d8d3ce4a985093cd52806ae95814192d75c7bd8ec38d458963eaedd06978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I5RB7V3UBVCXTW6WR5UAWOVV4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Push-Pull Block Puzzles are Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Isaac Grosof, Jayson Lynch","submitted_at":"2017-09-05T05:42:05Z","abstract_excerpt":"This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question by Zubaran and Ritt. Push-pull block puzzles are a type of recreational motion planning problem, similar to Sokoban, that involve moving a `robot' on a square grid with $1 \\times 1$ obstacles. The obstacles cannot be traversed by the robot, but some can be pushed and pulled by the robot into adjacent squares. Thin walls prevent movement between two adjacent squares. This work follows in a long line of algorithms and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01241","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:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQjXWpulz/rUXZbrWRD927vez+thTBlY3A3p5BHUozqXN6c0Q4dtCrQKAzp6SNGF+nrXDzePm8HYXt+FQxQbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:07:18.987178Z"},"content_sha256":"45acec02743d745498e8ab8bdd98795a6682d60229a890e65148f3204256a355","schema_version":"1.0","event_id":"sha256:45acec02743d745498e8ab8bdd98795a6682d60229a890e65148f3204256a355"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/bundle.json","state_url":"https://pith.science/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/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-25T10:07:18Z","links":{"resolver":"https://pith.science/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I","bundle":"https://pith.science/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/bundle.json","state":"https://pith.science/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5RB7V3UBVCXTW6WR5UAWOVV4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I5RB7V3UBVCXTW6WR5UAWOVV4I","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":"0aaf63f9b1af7c525d235bf9584aeda0a2f8a7e51e625254acb990af05b6a23f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-05T05:42:05Z","title_canon_sha256":"e3634f86f114db8b1ba6092c20a243c12c3b1b053e1bb4094bcf5218557f3297"},"schema_version":"1.0","source":{"id":"1709.01241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01241","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01241v1","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01241","created_at":"2026-05-18T00:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"I5RB7V3UBVCX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I5RB7V3UBVCXTW6W","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I5RB7V3U","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:45acec02743d745498e8ab8bdd98795a6682d60229a890e65148f3204256a355","target":"graph","created_at":"2026-05-18T00:36:00Z","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":"This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question by Zubaran and Ritt. Push-pull block puzzles are a type of recreational motion planning problem, similar to Sokoban, that involve moving a `robot' on a square grid with $1 \\times 1$ obstacles. The obstacles cannot be traversed by the robot, but some can be pushed and pulled by the robot into adjacent squares. Thin walls prevent movement between two adjacent squares. This work follows in a long line of algorithms and","authors_text":"Erik D. Demaine, Isaac Grosof, Jayson Lynch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-05T05:42:05Z","title":"Push-Pull Block Puzzles are Hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01241","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:f955d8d3ce4a985093cd52806ae95814192d75c7bd8ec38d458963eaedd06978","target":"record","created_at":"2026-05-18T00:36:00Z","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":"0aaf63f9b1af7c525d235bf9584aeda0a2f8a7e51e625254acb990af05b6a23f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-09-05T05:42:05Z","title_canon_sha256":"e3634f86f114db8b1ba6092c20a243c12c3b1b053e1bb4094bcf5218557f3297"},"schema_version":"1.0","source":{"id":"1709.01241","kind":"arxiv","version":1}},"canonical_sha256":"47621fd7740d4579dbd68f680b3ab5e2034da9146c4c30f32d84fd15d66ea47a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47621fd7740d4579dbd68f680b3ab5e2034da9146c4c30f32d84fd15d66ea47a","first_computed_at":"2026-05-18T00:36:00.581683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:00.581683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xQWCfBcyPdyc5BR6GU5UeBCs9icFci6PxBSNQMCO3JjCbwZ83/vmPsfU5HnNfH7Pgrga+XI+jTHTT0C/hgVWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:00.582149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f955d8d3ce4a985093cd52806ae95814192d75c7bd8ec38d458963eaedd06978","sha256:45acec02743d745498e8ab8bdd98795a6682d60229a890e65148f3204256a355"],"state_sha256":"9126eba12e5ebb78869712563c45bd622dd93711b2aacff879b28ac258b53f28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkesL157mL3RA7kg/oLnIpeNHDeaJXDNBdLKdQsxKRawdo9QH/kqcyNf2j4ycteRGKoopg7N2eYI1X+Mn9EICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:07:18.991234Z","bundle_sha256":"c36bb6bb639aa0555a11437397f84ca6ebabe75f3029b033638793e46cc48e6f"}}