{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QUS2DFPIXO4RM3IHRMJXQD3CDK","short_pith_number":"pith:QUS2DFPI","schema_version":"1.0","canonical_sha256":"8525a195e8bbb9166d078b13780f621ab0737409233e801d0a9aadde76578bb6","source":{"kind":"arxiv","id":"2403.10720","version":1},"attestation_state":"computed","paper":{"title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haozhan Sun, Jiayue Yu, Kailin Gui, Mengran Zhu, Ye Zhang, Yong Hao","submitted_at":"2024-03-15T22:43:37Z","abstract_excerpt":"In this study, we explore the efficiency of the Monte Carlo Tree Search (MCTS), a prominent decision-making algorithm renowned for its effectiveness in complex decision environments, contingent upon the volume of simulations conducted. Notwithstanding its broad applicability, the algorithm's performance can be adversely impacted in certain scenarios, particularly within the domain of game strategy development. This research posits that the inherent branch divergence within the Da Vinci Code board game significantly impedes parallelism when executed on Graphics Processing Units (GPUs). To inves"},"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":"2403.10720","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-15T22:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"fa8e177abe1de374bb4b44de0807ce9bc012b48d1edbd6b16279ae6c1956f32a","abstract_canon_sha256":"8720062e4448f0531bec9914f4c6ab9103dbc0d8c116bae8d6321e349b0d40c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:05.589551Z","signature_b64":"2fD/DMqIqAgh8KjhPhktorAfOEUNHVs23fzC6jW+0MvOXWX4FBkZ0xF7disezE7u9eV6CtJno81vZrlnaQU/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8525a195e8bbb9166d078b13780f621ab0737409233e801d0a9aadde76578bb6","last_reissued_at":"2026-07-05T07:57:05.589071Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:05.589071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Development and Application of a Monte Carlo Tree Search Algorithm for Simulating Da Vinci Code Game Strategies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haozhan Sun, Jiayue Yu, Kailin Gui, Mengran Zhu, Ye Zhang, Yong Hao","submitted_at":"2024-03-15T22:43:37Z","abstract_excerpt":"In this study, we explore the efficiency of the Monte Carlo Tree Search (MCTS), a prominent decision-making algorithm renowned for its effectiveness in complex decision environments, contingent upon the volume of simulations conducted. Notwithstanding its broad applicability, the algorithm's performance can be adversely impacted in certain scenarios, particularly within the domain of game strategy development. This research posits that the inherent branch divergence within the Da Vinci Code board game significantly impedes parallelism when executed on Graphics Processing Units (GPUs). To inves"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10720","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.10720/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.10720","created_at":"2026-07-05T07:57:05.589131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10720v1","created_at":"2026-07-05T07:57:05.589131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10720","created_at":"2026-07-05T07:57:05.589131+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUS2DFPIXO4R","created_at":"2026-07-05T07:57:05.589131+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUS2DFPIXO4RM3IH","created_at":"2026-07-05T07:57:05.589131+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUS2DFPI","created_at":"2026-07-05T07:57:05.589131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09877","citing_title":"Optimized Coordination Strategy for Multi-Aerospace Systems in Pick-and-Place Tasks By Deep Neural Network","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK","json":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK.json","graph_json":"https://pith.science/api/pith-number/QUS2DFPIXO4RM3IHRMJXQD3CDK/graph.json","events_json":"https://pith.science/api/pith-number/QUS2DFPIXO4RM3IHRMJXQD3CDK/events.json","paper":"https://pith.science/paper/QUS2DFPI"},"agent_actions":{"view_html":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK","download_json":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK.json","view_paper":"https://pith.science/paper/QUS2DFPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10720&json=true","fetch_graph":"https://pith.science/api/pith-number/QUS2DFPIXO4RM3IHRMJXQD3CDK/graph.json","fetch_events":"https://pith.science/api/pith-number/QUS2DFPIXO4RM3IHRMJXQD3CDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK/action/storage_attestation","attest_author":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK/action/author_attestation","sign_citation":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK/action/citation_signature","submit_replication":"https://pith.science/pith/QUS2DFPIXO4RM3IHRMJXQD3CDK/action/replication_record"}},"created_at":"2026-07-05T07:57:05.589131+00:00","updated_at":"2026-07-05T07:57:05.589131+00:00"}