{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3A3HOSEDZKHMLAWPA357HLICJZ","short_pith_number":"pith:3A3HOSED","canonical_record":{"source":{"id":"2112.09697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-12-17T18:06:21Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"609c30b09880f32acc61376f0948395d4a66bc697784c9c9752f167ce560b3fa","abstract_canon_sha256":"034692cb8d0731f6c2a91948330b14e526b929536ab47fda23858213b24b9842"},"schema_version":"1.0"},"canonical_sha256":"d836774883ca8ec582cf06fbf3ad024e5ebb3903785be4428a9130be6a66914c","source":{"kind":"arxiv","id":"2112.09697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09697","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09697v1","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09697","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"3A3HOSEDZKHM","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"3A3HOSEDZKHMLAWP","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"3A3HOSED","created_at":"2026-07-05T03:41:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3A3HOSEDZKHMLAWPA357HLICJZ","target":"record","payload":{"canonical_record":{"source":{"id":"2112.09697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-12-17T18:06:21Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"609c30b09880f32acc61376f0948395d4a66bc697784c9c9752f167ce560b3fa","abstract_canon_sha256":"034692cb8d0731f6c2a91948330b14e526b929536ab47fda23858213b24b9842"},"schema_version":"1.0"},"canonical_sha256":"d836774883ca8ec582cf06fbf3ad024e5ebb3903785be4428a9130be6a66914c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:50.300861Z","signature_b64":"NNbYhbv1+GJIA41QwjvqUrkBhU4aafGh4puny+X1mSck+7HgN1SkWo/3FN9GrUZQPacD9mXcL272LUANYObXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d836774883ca8ec582cf06fbf3ad024e5ebb3903785be4428a9130be6a66914c","last_reissued_at":"2026-07-05T03:41:50.300442Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:50.300442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.09697","source_version":1,"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-07-05T03:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8icV5d3RglVAtUwCPQjT0wmCZpA59BwJLgy957UplWF8ikMc3P1cEQgwfTa456YcvMCiMAYRWlmP6Vr4rxt9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:06:20.948869Z"},"content_sha256":"5cd602a2feee12743e6cf6fb9abfc600c0553270b88b7f61ad81b11421159e8d","schema_version":"1.0","event_id":"sha256:5cd602a2feee12743e6cf6fb9abfc600c0553270b88b7f61ad81b11421159e8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3A3HOSEDZKHMLAWPA357HLICJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Evolution of the MCTS Upper Confidence Bounds for Trees by Means of Evolutionary Algorithms in the Game of Carcassonne","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Edgar Galv\\'an, Gavin Simpson","submitted_at":"2021-12-17T18:06:21Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a sampling best-first method to search for optimal decisions. The MCTS's popularity is based on its extraordinary results in the challenging two-player based game Go, a game considered much harder than Chess and that until very recently was considered infeasible for Artificial Intelligence methods. The success of MCTS depends heavily on how the tree is built and the selection process plays a fundamental role in this. One particular selection mechanism that has proved to be reliable is based on the Upper Confidence Bounds for Trees, commonly referred as UCT. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09697","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/2112.09697/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"},"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-07-05T03:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lsT8G8IjIFpGHReCMDqG/BJPeS4QhP3IwF+GMuBxOBuxMqRt8PEC1xrR4T6NILk6MPlDjWCDzTh1oiq6yQGjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:06:20.949233Z"},"content_sha256":"2595ef0406b34bc917fda836064d5eeb76730ffc8b1efd8f73c11d4825fdf53c","schema_version":"1.0","event_id":"sha256:2595ef0406b34bc917fda836064d5eeb76730ffc8b1efd8f73c11d4825fdf53c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3A3HOSEDZKHMLAWPA357HLICJZ/bundle.json","state_url":"https://pith.science/pith/3A3HOSEDZKHMLAWPA357HLICJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3A3HOSEDZKHMLAWPA357HLICJZ/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-07-08T16:06:20Z","links":{"resolver":"https://pith.science/pith/3A3HOSEDZKHMLAWPA357HLICJZ","bundle":"https://pith.science/pith/3A3HOSEDZKHMLAWPA357HLICJZ/bundle.json","state":"https://pith.science/pith/3A3HOSEDZKHMLAWPA357HLICJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3A3HOSEDZKHMLAWPA357HLICJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3A3HOSEDZKHMLAWPA357HLICJZ","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":"034692cb8d0731f6c2a91948330b14e526b929536ab47fda23858213b24b9842","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-12-17T18:06:21Z","title_canon_sha256":"609c30b09880f32acc61376f0948395d4a66bc697784c9c9752f167ce560b3fa"},"schema_version":"1.0","source":{"id":"2112.09697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09697","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09697v1","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09697","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"3A3HOSEDZKHM","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"3A3HOSEDZKHMLAWP","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"3A3HOSED","created_at":"2026-07-05T03:41:50Z"}],"graph_snapshots":[{"event_id":"sha256:2595ef0406b34bc917fda836064d5eeb76730ffc8b1efd8f73c11d4825fdf53c","target":"graph","created_at":"2026-07-05T03:41:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.09697/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a sampling best-first method to search for optimal decisions. The MCTS's popularity is based on its extraordinary results in the challenging two-player based game Go, a game considered much harder than Chess and that until very recently was considered infeasible for Artificial Intelligence methods. The success of MCTS depends heavily on how the tree is built and the selection process plays a fundamental role in this. One particular selection mechanism that has proved to be reliable is based on the Upper Confidence Bounds for Trees, commonly referred as UCT. Th","authors_text":"Edgar Galv\\'an, Gavin Simpson","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-12-17T18:06:21Z","title":"On the Evolution of the MCTS Upper Confidence Bounds for Trees by Means of Evolutionary Algorithms in the Game of Carcassonne"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09697","kind":"arxiv","version":1},"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:5cd602a2feee12743e6cf6fb9abfc600c0553270b88b7f61ad81b11421159e8d","target":"record","created_at":"2026-07-05T03:41:50Z","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":"034692cb8d0731f6c2a91948330b14e526b929536ab47fda23858213b24b9842","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-12-17T18:06:21Z","title_canon_sha256":"609c30b09880f32acc61376f0948395d4a66bc697784c9c9752f167ce560b3fa"},"schema_version":"1.0","source":{"id":"2112.09697","kind":"arxiv","version":1}},"canonical_sha256":"d836774883ca8ec582cf06fbf3ad024e5ebb3903785be4428a9130be6a66914c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d836774883ca8ec582cf06fbf3ad024e5ebb3903785be4428a9130be6a66914c","first_computed_at":"2026-07-05T03:41:50.300442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:50.300442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NNbYhbv1+GJIA41QwjvqUrkBhU4aafGh4puny+X1mSck+7HgN1SkWo/3FN9GrUZQPacD9mXcL272LUANYObXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:50.300861Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.09697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cd602a2feee12743e6cf6fb9abfc600c0553270b88b7f61ad81b11421159e8d","sha256:2595ef0406b34bc917fda836064d5eeb76730ffc8b1efd8f73c11d4825fdf53c"],"state_sha256":"b60415c2f0b56788740f964305ea507391bb51fee6419292cbaa8a9b03f33257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+q0/0mnoLYfrEdBugVBGcVQrG6ry+GzDol1QyR/aG+QpneCceoKBg7shyRr4RIi2E6FsTn/a3gut/bAQIBw/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T16:06:20.951151Z","bundle_sha256":"e0a9ba0c12d95028e26da8c2e986be6211f34144711e4cf551f3bf6447557849"}}