{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XPLE23FOM2WHJJ3LMPLSSYKFUT","short_pith_number":"pith:XPLE23FO","schema_version":"1.0","canonical_sha256":"bbd64d6cae66ac74a76b63d7296145a4ded6bf421a41e4f7ca70b7112fb3c430","source":{"kind":"arxiv","id":"2009.12974","version":2},"attestation_state":"computed","paper":{"title":"Playing Carcassonne with Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anger Fernando Kuri Morales, Edgar Galvan, Fred Valdez Ameneyro","submitted_at":"2020-09-27T22:35:53Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a relatively new sampling method with multiple variants in the literature. They can be applied to a wide variety of challenging domains including board games, video games, and energy-based problems to mention a few. In this work, we explore the use of the vanilla MCTS and the MCTS with Rapid Action Value Estimation (MCTS-RAVE) in the game of Carcassonne, a stochastic game with a deceptive scoring system where limited research has been conducted. We compare the strengths of the MCTS-based methods with the Star2.5 algorithm, previously reported to yield competit"},"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":"2009.12974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-09-27T22:35:53Z","cross_cats_sorted":[],"title_canon_sha256":"5893f1e221fbe50a5836a3ba94206eea265d75dcacff0c83351b6c4117e29771","abstract_canon_sha256":"017a0a5ab021e887db5fe14c3d31053d78c3e7d37db307b03fb7535e9ecdc117"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:01.837476Z","signature_b64":"nL8ZHdhVmBTjTlxwZMG8b35VbtEObcC+lE9uk73nLVoZk/nCsCuMHqp8nxxJYPBhl5BcrFlrPgWZe2xHnJwfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd64d6cae66ac74a76b63d7296145a4ded6bf421a41e4f7ca70b7112fb3c430","last_reissued_at":"2026-07-05T01:40:01.837015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:01.837015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing Carcassonne with Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anger Fernando Kuri Morales, Edgar Galvan, Fred Valdez Ameneyro","submitted_at":"2020-09-27T22:35:53Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a relatively new sampling method with multiple variants in the literature. They can be applied to a wide variety of challenging domains including board games, video games, and energy-based problems to mention a few. In this work, we explore the use of the vanilla MCTS and the MCTS with Rapid Action Value Estimation (MCTS-RAVE) in the game of Carcassonne, a stochastic game with a deceptive scoring system where limited research has been conducted. We compare the strengths of the MCTS-based methods with the Star2.5 algorithm, previously reported to yield competit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12974","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.12974/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":"2009.12974","created_at":"2026-07-05T01:40:01.837093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.12974v2","created_at":"2026-07-05T01:40:01.837093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12974","created_at":"2026-07-05T01:40:01.837093+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPLE23FOM2WH","created_at":"2026-07-05T01:40:01.837093+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPLE23FOM2WHJJ3L","created_at":"2026-07-05T01:40:01.837093+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPLE23FO","created_at":"2026-07-05T01:40:01.837093+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/XPLE23FOM2WHJJ3LMPLSSYKFUT","json":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT.json","graph_json":"https://pith.science/api/pith-number/XPLE23FOM2WHJJ3LMPLSSYKFUT/graph.json","events_json":"https://pith.science/api/pith-number/XPLE23FOM2WHJJ3LMPLSSYKFUT/events.json","paper":"https://pith.science/paper/XPLE23FO"},"agent_actions":{"view_html":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT","download_json":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT.json","view_paper":"https://pith.science/paper/XPLE23FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.12974&json=true","fetch_graph":"https://pith.science/api/pith-number/XPLE23FOM2WHJJ3LMPLSSYKFUT/graph.json","fetch_events":"https://pith.science/api/pith-number/XPLE23FOM2WHJJ3LMPLSSYKFUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT/action/storage_attestation","attest_author":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT/action/author_attestation","sign_citation":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT/action/citation_signature","submit_replication":"https://pith.science/pith/XPLE23FOM2WHJJ3LMPLSSYKFUT/action/replication_record"}},"created_at":"2026-07-05T01:40:01.837093+00:00","updated_at":"2026-07-05T01:40:01.837093+00:00"}