{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NOKEL7F7EXHRGSQX6XXXDLNHIA","short_pith_number":"pith:NOKEL7F7","schema_version":"1.0","canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","source":{"kind":"arxiv","id":"1903.01747","version":2},"attestation_state":"computed","paper":{"title":"Towards Understanding Chinese Checkers with Heuristics, Monte Carlo Tree Search, and Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Henry Wing Fung Yeung, Meng Zhou, Qiang Qu, Vera Yuk Ying Chung, Weiqing Cao, Ziyu Liu","submitted_at":"2019-03-05T09:44:22Z","abstract_excerpt":"The game of Chinese Checkers is a challenging traditional board game of perfect information that differs from other traditional games in two main aspects: first, unlike Chess, all checkers remain indefinitely in the game and hence the branching factor of the search tree does not decrease as the game progresses; second, unlike Go, there are also no upper bounds on the depth of the search tree since repetitions and backward movements are allowed. Therefore, even in a restricted game instance, the state-space of the game can still be unbounded, making it challenging for a computer program to exce"},"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":"1903.01747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-05T09:44:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1ecc37822d4e9c356c11f509d686fada8249989093505a4f5365e5a64a7d2234","abstract_canon_sha256":"ff3423248fe0e23451f10308094054857ea27e84668f9bcef47792f9bf60ed81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:46.446229Z","signature_b64":"FyqGHtdaGbS78L9WnbWn2iKUOXme+v7Gw+/9AwVBkBl6clS/E3kIW7UN36ks0nEj3UraKbtwwzMeBP6Hq58JCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","last_reissued_at":"2026-05-17T23:51:46.445629Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:46.445629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Understanding Chinese Checkers with Heuristics, Monte Carlo Tree Search, and Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Henry Wing Fung Yeung, Meng Zhou, Qiang Qu, Vera Yuk Ying Chung, Weiqing Cao, Ziyu Liu","submitted_at":"2019-03-05T09:44:22Z","abstract_excerpt":"The game of Chinese Checkers is a challenging traditional board game of perfect information that differs from other traditional games in two main aspects: first, unlike Chess, all checkers remain indefinitely in the game and hence the branching factor of the search tree does not decrease as the game progresses; second, unlike Go, there are also no upper bounds on the depth of the search tree since repetitions and backward movements are allowed. Therefore, even in a restricted game instance, the state-space of the game can still be unbounded, making it challenging for a computer program to exce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01747","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":"1903.01747","created_at":"2026-05-17T23:51:46.445733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01747v2","created_at":"2026-05-17T23:51:46.445733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01747","created_at":"2026-05-17T23:51:46.445733+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOKEL7F7EXHR","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOKEL7F7EXHRGSQX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOKEL7F7","created_at":"2026-05-18T12:33:24.271573+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/NOKEL7F7EXHRGSQX6XXXDLNHIA","json":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA.json","graph_json":"https://pith.science/api/pith-number/NOKEL7F7EXHRGSQX6XXXDLNHIA/graph.json","events_json":"https://pith.science/api/pith-number/NOKEL7F7EXHRGSQX6XXXDLNHIA/events.json","paper":"https://pith.science/paper/NOKEL7F7"},"agent_actions":{"view_html":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA","download_json":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA.json","view_paper":"https://pith.science/paper/NOKEL7F7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01747&json=true","fetch_graph":"https://pith.science/api/pith-number/NOKEL7F7EXHRGSQX6XXXDLNHIA/graph.json","fetch_events":"https://pith.science/api/pith-number/NOKEL7F7EXHRGSQX6XXXDLNHIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/action/storage_attestation","attest_author":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/action/author_attestation","sign_citation":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/action/citation_signature","submit_replication":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/action/replication_record"}},"created_at":"2026-05-17T23:51:46.445733+00:00","updated_at":"2026-05-17T23:51:46.445733+00:00"}