{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JSUBGPZLRT4AD2FEO264ZE4XEB","short_pith_number":"pith:JSUBGPZL","schema_version":"1.0","canonical_sha256":"4ca8133f2b8cf801e8a476bdcc9397207ed7e65d2cc6e697ecdb42d78c89311f","source":{"kind":"arxiv","id":"1706.06708","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.06708","created_at":"2026-05-18T00:17:24.310967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06708v2","created_at":"2026-05-18T00:17:24.310967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06708","created_at":"2026-05-18T00:17:24.310967+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSUBGPZLRT4A","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSUBGPZLRT4AD2FE","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSUBGPZL","created_at":"2026-05-18T12:31:24.725408+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/JSUBGPZLRT4AD2FEO264ZE4XEB","json":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB.json","graph_json":"https://pith.science/api/pith-number/JSUBGPZLRT4AD2FEO264ZE4XEB/graph.json","events_json":"https://pith.science/api/pith-number/JSUBGPZLRT4AD2FEO264ZE4XEB/events.json","paper":"https://pith.science/paper/JSUBGPZL"},"agent_actions":{"view_html":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB","download_json":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB.json","view_paper":"https://pith.science/paper/JSUBGPZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06708&json=true","fetch_graph":"https://pith.science/api/pith-number/JSUBGPZLRT4AD2FEO264ZE4XEB/graph.json","fetch_events":"https://pith.science/api/pith-number/JSUBGPZLRT4AD2FEO264ZE4XEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/action/storage_attestation","attest_author":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/action/author_attestation","sign_citation":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/action/citation_signature","submit_replication":"https://pith.science/pith/JSUBGPZLRT4AD2FEO264ZE4XEB/action/replication_record"}},"created_at":"2026-05-18T00:17:24.310967+00:00","updated_at":"2026-05-18T00:17:24.310967+00:00"}