{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NOKEL7F7EXHRGSQX6XXXDLNHIA","short_pith_number":"pith:NOKEL7F7","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"},"canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","source":{"kind":"arxiv","id":"1903.01747","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01747","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01747v2","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01747","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOKEL7F7EXHR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NOKEL7F7EXHRGSQX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NOKEL7F7","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NOKEL7F7EXHRGSQX6XXXDLNHIA","target":"record","payload":{"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"},"canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","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"},"source_kind":"arxiv","source_id":"1903.01747","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1FrR4CqUGAV9YS4xCH4wrl5wSXD71Z3Iz4zbUQQ9LbkSLZ4fDZUsVTEn63m817xTwHJY2CUOWqoibPb/Gr6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:06.106876Z"},"content_sha256":"879ab1b955a037c85708690e0fdb5859295edec7c31f594b506ba8cf16b1e40a","schema_version":"1.0","event_id":"sha256:879ab1b955a037c85708690e0fdb5859295edec7c31f594b506ba8cf16b1e40a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NOKEL7F7EXHRGSQX6XXXDLNHIA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmSSocRZCVfG3wralyrbor/44K7Z6GNp21bGHKI5ya7t1SdQiiBXLmS094R8G+AMSKGZEzuO0KovlrhKe+gYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:06.107267Z"},"content_sha256":"10cf8940abd79b20df9b8949403fa17525bcbba25317656aab08a9d4d4437000","schema_version":"1.0","event_id":"sha256:10cf8940abd79b20df9b8949403fa17525bcbba25317656aab08a9d4d4437000"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/bundle.json","state_url":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T02:20:06Z","links":{"resolver":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA","bundle":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/bundle.json","state":"https://pith.science/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOKEL7F7EXHRGSQX6XXXDLNHIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NOKEL7F7EXHRGSQX6XXXDLNHIA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ff3423248fe0e23451f10308094054857ea27e84668f9bcef47792f9bf60ed81","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-05T09:44:22Z","title_canon_sha256":"1ecc37822d4e9c356c11f509d686fada8249989093505a4f5365e5a64a7d2234"},"schema_version":"1.0","source":{"id":"1903.01747","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01747","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01747v2","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01747","created_at":"2026-05-17T23:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"NOKEL7F7EXHR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NOKEL7F7EXHRGSQX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NOKEL7F7","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:10cf8940abd79b20df9b8949403fa17525bcbba25317656aab08a9d4d4437000","target":"graph","created_at":"2026-05-17T23:51:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Henry Wing Fung Yeung, Meng Zhou, Qiang Qu, Vera Yuk Ying Chung, Weiqing Cao, Ziyu Liu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-05T09:44:22Z","title":"Towards Understanding Chinese Checkers with Heuristics, Monte Carlo Tree Search, and Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01747","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:879ab1b955a037c85708690e0fdb5859295edec7c31f594b506ba8cf16b1e40a","target":"record","created_at":"2026-05-17T23:51:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ff3423248fe0e23451f10308094054857ea27e84668f9bcef47792f9bf60ed81","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-05T09:44:22Z","title_canon_sha256":"1ecc37822d4e9c356c11f509d686fada8249989093505a4f5365e5a64a7d2234"},"schema_version":"1.0","source":{"id":"1903.01747","kind":"arxiv","version":2}},"canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b9445fcbf25cf134a17f5ef71ada7401633f2a9fe278d6aef1a5fb385179024","first_computed_at":"2026-05-17T23:51:46.445629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:46.445629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyqGHtdaGbS78L9WnbWn2iKUOXme+v7Gw+/9AwVBkBl6clS/E3kIW7UN36ks0nEj3UraKbtwwzMeBP6Hq58JCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:46.446229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01747","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:879ab1b955a037c85708690e0fdb5859295edec7c31f594b506ba8cf16b1e40a","sha256:10cf8940abd79b20df9b8949403fa17525bcbba25317656aab08a9d4d4437000"],"state_sha256":"3468f3e290f31ef10d691e0e9403ff2c95e04b6e909ba61bbbe151396050db94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38OolScouembolwsj1JAsCF9NS3DibcNqtXpFlHrNlqgOa9VJdaH3IjR/XZMqprwSr5YXJgDbTRocb8jORXOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:20:06.110145Z","bundle_sha256":"ec08c818d7ef1d07e24415e617f22c629a4440dd679c6e2861ed99a0241780ba"}}