{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GSGEZQC7M3WG3PAXSMFGSQFDLI","short_pith_number":"pith:GSGEZQC7","schema_version":"1.0","canonical_sha256":"348c4cc05f66ec6dbc17930a6940a35a2d87590eea54d3cd72566e7273907004","source":{"kind":"arxiv","id":"1106.5736","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Solving Rubik's Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrew Winslow, Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat","submitted_at":"2011-06-28T17:35:09Z","abstract_excerpt":"The Rubik's Cube is perhaps the world's most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik's Cube also has a rich underlying algorithmic structure. Specifically, we show that the n x n x n Rubik's Cube, as well as the n x n x 1 variant, has a \"God's Number\" (diameter of the configuration space) of Theta(n^2/log n). The upper bound comes from effectively parallelizing standard Theta(n^2) solution algorithms, while the lower bound follows from a counting argument. The upper bound gives an asymptotically"},"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":"1106.5736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-28T17:35:09Z","cross_cats_sorted":["cs.CC","cs.CG","math.CO"],"title_canon_sha256":"39064a06c3c3d2851e6b115c39503c816112d66c821c9be68e367c89eb7d4111","abstract_canon_sha256":"71b4690d4d1dbf835d1efc443f9b27665e773098a6e6e31d1e0aa1d054a07836"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:12.610663Z","signature_b64":"gI1XvySxovqFcccU5lvDwYsGAIe1jZki1gqw31K6IcCH6Q+hMwaMwi3oyP3qSfOY/8O/CS2lNHvHYvluU8I6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348c4cc05f66ec6dbc17930a6940a35a2d87590eea54d3cd72566e7273907004","last_reissued_at":"2026-05-18T04:19:12.610231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:12.610231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Solving Rubik's Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Andrew Winslow, Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat","submitted_at":"2011-06-28T17:35:09Z","abstract_excerpt":"The Rubik's Cube is perhaps the world's most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik's Cube also has a rich underlying algorithmic structure. Specifically, we show that the n x n x n Rubik's Cube, as well as the n x n x 1 variant, has a \"God's Number\" (diameter of the configuration space) of Theta(n^2/log n). The upper bound comes from effectively parallelizing standard Theta(n^2) solution algorithms, while the lower bound follows from a counting argument. The upper bound gives an asymptotically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5736","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":"1106.5736","created_at":"2026-05-18T04:19:12.610298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5736v1","created_at":"2026-05-18T04:19:12.610298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5736","created_at":"2026-05-18T04:19:12.610298+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSGEZQC7M3WG","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSGEZQC7M3WG3PAX","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSGEZQC7","created_at":"2026-05-18T12:26:30.835961+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/GSGEZQC7M3WG3PAXSMFGSQFDLI","json":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI.json","graph_json":"https://pith.science/api/pith-number/GSGEZQC7M3WG3PAXSMFGSQFDLI/graph.json","events_json":"https://pith.science/api/pith-number/GSGEZQC7M3WG3PAXSMFGSQFDLI/events.json","paper":"https://pith.science/paper/GSGEZQC7"},"agent_actions":{"view_html":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI","download_json":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI.json","view_paper":"https://pith.science/paper/GSGEZQC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5736&json=true","fetch_graph":"https://pith.science/api/pith-number/GSGEZQC7M3WG3PAXSMFGSQFDLI/graph.json","fetch_events":"https://pith.science/api/pith-number/GSGEZQC7M3WG3PAXSMFGSQFDLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI/action/storage_attestation","attest_author":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI/action/author_attestation","sign_citation":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI/action/citation_signature","submit_replication":"https://pith.science/pith/GSGEZQC7M3WG3PAXSMFGSQFDLI/action/replication_record"}},"created_at":"2026-05-18T04:19:12.610298+00:00","updated_at":"2026-05-18T04:19:12.610298+00:00"}