{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GKTXPXDJCPGS4HLL3QH7XBJD7K","short_pith_number":"pith:GKTXPXDJ","schema_version":"1.0","canonical_sha256":"32a777dc6913cd2e1d6bdc0ffb8523fab242981a1d25d2d211faa5f979722a80","source":{"kind":"arxiv","id":"1105.1436","version":1},"attestation_state":"computed","paper":{"title":"Solving Rubik's Cube Using SAT Solvers","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jingchao Chen","submitted_at":"2011-05-07T12:07:49Z","abstract_excerpt":"Rubik's Cube is an easily-understood puzzle, which is originally called the \"magic cube\". It is a well-known planning problem, which has been studied for a long time. Yet many simple properties remain unknown. This paper studies whether modern SAT solvers are applicable to this puzzle. To our best knowledge, we are the first to translate Rubik's Cube to a SAT problem. To reduce the number of variables and clauses needed for the encoding, we replace a naive approach of 6 Boolean variables to represent each color on each facelet with a new approach of 3 or 2 Boolean variables. In order to be abl"},"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":"1105.1436","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.AI","submitted_at":"2011-05-07T12:07:49Z","cross_cats_sorted":[],"title_canon_sha256":"cd0b96157a7a3994f2f01a34ac514673e67c6e680357697edc6a4343c8851fc5","abstract_canon_sha256":"591c4bcf7b4b546b3368595067960dbf8fc5fbf04c68eea3e6016eaf7b429577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:39.450821Z","signature_b64":"NO2NiL5Xozy3XcoupaJmsdpdF9ZHCXjkZm7Jdyoz2KQqJ52UM3yU7RrxHlUVwMyzHbF8u/YAB+pYwMfai2EQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a777dc6913cd2e1d6bdc0ffb8523fab242981a1d25d2d211faa5f979722a80","last_reissued_at":"2026-05-18T04:22:39.450408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:39.450408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Rubik's Cube Using SAT Solvers","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jingchao Chen","submitted_at":"2011-05-07T12:07:49Z","abstract_excerpt":"Rubik's Cube is an easily-understood puzzle, which is originally called the \"magic cube\". It is a well-known planning problem, which has been studied for a long time. Yet many simple properties remain unknown. This paper studies whether modern SAT solvers are applicable to this puzzle. To our best knowledge, we are the first to translate Rubik's Cube to a SAT problem. To reduce the number of variables and clauses needed for the encoding, we replace a naive approach of 6 Boolean variables to represent each color on each facelet with a new approach of 3 or 2 Boolean variables. In order to be abl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1436","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":"1105.1436","created_at":"2026-05-18T04:22:39.450482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1436v1","created_at":"2026-05-18T04:22:39.450482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1436","created_at":"2026-05-18T04:22:39.450482+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKTXPXDJCPGS","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKTXPXDJCPGS4HLL","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKTXPXDJ","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/GKTXPXDJCPGS4HLL3QH7XBJD7K","json":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K.json","graph_json":"https://pith.science/api/pith-number/GKTXPXDJCPGS4HLL3QH7XBJD7K/graph.json","events_json":"https://pith.science/api/pith-number/GKTXPXDJCPGS4HLL3QH7XBJD7K/events.json","paper":"https://pith.science/paper/GKTXPXDJ"},"agent_actions":{"view_html":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K","download_json":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K.json","view_paper":"https://pith.science/paper/GKTXPXDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1436&json=true","fetch_graph":"https://pith.science/api/pith-number/GKTXPXDJCPGS4HLL3QH7XBJD7K/graph.json","fetch_events":"https://pith.science/api/pith-number/GKTXPXDJCPGS4HLL3QH7XBJD7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K/action/storage_attestation","attest_author":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K/action/author_attestation","sign_citation":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K/action/citation_signature","submit_replication":"https://pith.science/pith/GKTXPXDJCPGS4HLL3QH7XBJD7K/action/replication_record"}},"created_at":"2026-05-18T04:22:39.450482+00:00","updated_at":"2026-05-18T04:22:39.450482+00:00"}