{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JSUBGPZLRT4AD2FEO264ZE4XEB","short_pith_number":"pith:JSUBGPZL","canonical_record":{"source":{"id":"1706.06708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-21T00:02:45Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"13bd803bf6ae7fecde66329951617062d919ffcc5ae25a950fd1c63c20cc4079","abstract_canon_sha256":"883f18627f6f6591819d83b0115abfb3fb3696676dadab5ce3aa8edadde3d52d"},"schema_version":"1.0"},"canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","source":{"kind":"arxiv","id":"1706.06708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06708","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06708v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06708","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"JSUBGPZLRT4A","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JSUBGPZLRT4AD2FE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JSUBGPZL","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JSUBGPZLRT4AD2FEO264ZE4XEB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-21T00:02:45Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"13bd803bf6ae7fecde66329951617062d919ffcc5ae25a950fd1c63c20cc4079","abstract_canon_sha256":"883f18627f6f6591819d83b0115abfb3fb3696676dadab5ce3aa8edadde3d52d"},"schema_version":"1.0"},"canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:24.311492Z","signature_b64":"5a/Z0ASm/PP9O99A/AZNnUf45x85NimGKbqza5co7l0fMhI6RSX/GkxPUhAqWdTzqoLMtzq3Tn/i7ddNUSUZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","last_reissued_at":"2026-05-18T00:17:24.310878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:24.310878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06708","source_version":2,"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbYpjDhxmtYOEXxGv9a1+y9gt70vRoYiQXCbL5pxJ57OmHTTTEfrifZk7+BAm9DNAY14qMK+kdS0rl8LR9jQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:39:08.109413Z"},"content_sha256":"af5cdf70467429199f2d7302527ed548f5917a90ea0d7bf8c6eb606406f1ec9c","schema_version":"1.0","event_id":"sha256:af5cdf70467429199f2d7302527ed548f5917a90ea0d7bf8c6eb606406f1ec9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JSUBGPZLRT4AD2FEO264ZE4XEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Rubik's Cube Optimally is NP-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.CC","authors_text":"Erik D. Demaine, Mikhail Rudoy, Sarah Eisenstat","submitted_at":"2017-06-21T00:02:45Z","abstract_excerpt":"In this paper, we prove that optimally solving an $n \\times n \\times n$ Rubik's Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs. This improves the previous result that optimally solving an $n \\times n \\times n$ Rubik's Cube with missing stickers is NP-complete. We prove this result first for the simpler case of the Rubik's Square---an $n \\times n \\times 1$ generalization of the Rubik's Cube---and then proceed with a similar but more complicated proof for the Rubik's Cube case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06708","kind":"arxiv","version":2},"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9FTewi4QITlAzEP+VnJk5lt2hvd3e5Gq5GLCz5tqHnGXD0b/KUG7pRHBNKGsyeSL7ewtkTq0/d5cABwDG/gVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:39:08.110064Z"},"content_sha256":"95b74c2bfb7205d45fb58daa236ce46abd8c04a1f9859164d166181f31c68d5b","schema_version":"1.0","event_id":"sha256:95b74c2bfb7205d45fb58daa236ce46abd8c04a1f9859164d166181f31c68d5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/bundle.json","state_url":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/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-31T19:39:08Z","links":{"resolver":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB","bundle":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/bundle.json","state":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JSUBGPZLRT4AD2FEO264ZE4XEB","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":"883f18627f6f6591819d83b0115abfb3fb3696676dadab5ce3aa8edadde3d52d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-21T00:02:45Z","title_canon_sha256":"13bd803bf6ae7fecde66329951617062d919ffcc5ae25a950fd1c63c20cc4079"},"schema_version":"1.0","source":{"id":"1706.06708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06708","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06708v2","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06708","created_at":"2026-05-18T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"JSUBGPZLRT4A","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JSUBGPZLRT4AD2FE","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JSUBGPZL","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:95b74c2bfb7205d45fb58daa236ce46abd8c04a1f9859164d166181f31c68d5b","target":"graph","created_at":"2026-05-18T00:17:24Z","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":"In this paper, we prove that optimally solving an $n \\times n \\times n$ Rubik's Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs. This improves the previous result that optimally solving an $n \\times n \\times n$ Rubik's Cube with missing stickers is NP-complete. We prove this result first for the simpler case of the Rubik's Square---an $n \\times n \\times 1$ generalization of the Rubik's Cube---and then proceed with a similar but more complicated proof for the Rubik's Cube case.","authors_text":"Erik D. Demaine, Mikhail Rudoy, Sarah Eisenstat","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-21T00:02:45Z","title":"Solving the Rubik's Cube Optimally is NP-complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06708","kind":"arxiv","version":2},"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:af5cdf70467429199f2d7302527ed548f5917a90ea0d7bf8c6eb606406f1ec9c","target":"record","created_at":"2026-05-18T00:17:24Z","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":"883f18627f6f6591819d83b0115abfb3fb3696676dadab5ce3aa8edadde3d52d","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-06-21T00:02:45Z","title_canon_sha256":"13bd803bf6ae7fecde66329951617062d919ffcc5ae25a950fd1c63c20cc4079"},"schema_version":"1.0","source":{"id":"1706.06708","kind":"arxiv","version":2}},"canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","first_computed_at":"2026-05-18T00:17:24.310878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:24.310878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5a/Z0ASm/PP9O99A/AZNnUf45x85NimGKbqza5co7l0fMhI6RSX/GkxPUhAqWdTzqoLMtzq3Tn/i7ddNUSUZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:24.311492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af5cdf70467429199f2d7302527ed548f5917a90ea0d7bf8c6eb606406f1ec9c","sha256:95b74c2bfb7205d45fb58daa236ce46abd8c04a1f9859164d166181f31c68d5b"],"state_sha256":"b6ddd7ccfb6c2f4e5389ab4c81dd2d7ebd5b1771ff23b6542a2ffc1c58292ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTVAydTcCB7QG+H3tpIVIirr+mcW2oJ6roy8DABOfr/QHAXGRlEAWQp2JPWMuMcn4D9cqH3lD+vk9f1+vhiyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:39:08.115282Z","bundle_sha256":"b31b7d4beea9caaca084753de2d05acc845701bfe5bb366e35cdbfe7e545c221"}}