{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ILX4XTOHJK7R2MFJ2USUTQZ4JY","short_pith_number":"pith:ILX4XTOH","schema_version":"1.0","canonical_sha256":"42efcbcdc74abf1d30a9d52549c33c4e07dbe61cca91ec98c89666a60547c4d6","source":{"kind":"arxiv","id":"1307.4543","version":1},"attestation_state":"computed","paper":{"title":"Complete Solutions for a Combinatorial Puzzle in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2013-07-17T08:59:38Z","abstract_excerpt":"In this paper we study a single player game consisting of $n$ black checkers and $m$ white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general $n$ and $m$ is $nm + n + m$. We have also presented an optimal algorithm to generate an optimal move sequence of the game consisting of $n$ black checkers and $m$ white checkers, and finally, we present an explicit solution for the general game."},"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":"1307.4543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-17T08:59:38Z","cross_cats_sorted":[],"title_canon_sha256":"977bec8a3f8c5fedfa0193dd4099204dd38e26f507da9c623877bd9224435c29","abstract_canon_sha256":"2d822fc8afa2a838c5f8e65f90ac0212f1d9bfb098329bebe644b94548cdfda1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.681301Z","signature_b64":"l/+GqtpiIMtkkKpigshRYFGEKoNyPbKWb5n5bUOMPaUSBBA5x7N0uWNIB5MvTq+A3nzjTJwl8ahOdpaYT13EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42efcbcdc74abf1d30a9d52549c33c4e07dbe61cca91ec98c89666a60547c4d6","last_reissued_at":"2026-05-18T03:18:17.680438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.680438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Solutions for a Combinatorial Puzzle in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2013-07-17T08:59:38Z","abstract_excerpt":"In this paper we study a single player game consisting of $n$ black checkers and $m$ white checkers, called shifting the checkers. We have proved that the minimum number of steps needed to play the game for general $n$ and $m$ is $nm + n + m$. We have also presented an optimal algorithm to generate an optimal move sequence of the game consisting of $n$ black checkers and $m$ white checkers, and finally, we present an explicit solution for the general game."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4543","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":"1307.4543","created_at":"2026-05-18T03:18:17.680519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4543v1","created_at":"2026-05-18T03:18:17.680519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4543","created_at":"2026-05-18T03:18:17.680519+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILX4XTOHJK7R","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILX4XTOHJK7R2MFJ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILX4XTOH","created_at":"2026-05-18T12:27:46.883200+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/ILX4XTOHJK7R2MFJ2USUTQZ4JY","json":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY.json","graph_json":"https://pith.science/api/pith-number/ILX4XTOHJK7R2MFJ2USUTQZ4JY/graph.json","events_json":"https://pith.science/api/pith-number/ILX4XTOHJK7R2MFJ2USUTQZ4JY/events.json","paper":"https://pith.science/paper/ILX4XTOH"},"agent_actions":{"view_html":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY","download_json":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY.json","view_paper":"https://pith.science/paper/ILX4XTOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4543&json=true","fetch_graph":"https://pith.science/api/pith-number/ILX4XTOHJK7R2MFJ2USUTQZ4JY/graph.json","fetch_events":"https://pith.science/api/pith-number/ILX4XTOHJK7R2MFJ2USUTQZ4JY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY/action/storage_attestation","attest_author":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY/action/author_attestation","sign_citation":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY/action/citation_signature","submit_replication":"https://pith.science/pith/ILX4XTOHJK7R2MFJ2USUTQZ4JY/action/replication_record"}},"created_at":"2026-05-18T03:18:17.680519+00:00","updated_at":"2026-05-18T03:18:17.680519+00:00"}