{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RZJFGXPXCQMJ5A5KLPTT3A2UML","short_pith_number":"pith:RZJFGXPX","canonical_record":{"source":{"id":"2208.13589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-08-29T13:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"b24f89030ff38cc0a1e648c03520b3adbda903b3cb9c9912ad63fb48f3552c5a","abstract_canon_sha256":"68cc00c4ff7c7c865b3335647da738e6c9e9dd4f4cdd5248614435b016a8ee1e"},"schema_version":"1.0"},"canonical_sha256":"8e52535df714189e83aa5be73d835462e9f957c5cde254efed50d0ddab465423","source":{"kind":"arxiv","id":"2208.13589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13589","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13589v1","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13589","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"RZJFGXPXCQMJ","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"RZJFGXPXCQMJ5A5K","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"RZJFGXPX","created_at":"2026-07-05T04:52:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RZJFGXPXCQMJ5A5KLPTT3A2UML","target":"record","payload":{"canonical_record":{"source":{"id":"2208.13589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-08-29T13:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"b24f89030ff38cc0a1e648c03520b3adbda903b3cb9c9912ad63fb48f3552c5a","abstract_canon_sha256":"68cc00c4ff7c7c865b3335647da738e6c9e9dd4f4cdd5248614435b016a8ee1e"},"schema_version":"1.0"},"canonical_sha256":"8e52535df714189e83aa5be73d835462e9f957c5cde254efed50d0ddab465423","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:52:19.020769Z","signature_b64":"H0Otni8jxdxcc8jEPp30tT1bDHOv6Yj7q5539q3fyAtiic+3cXq/QzdMfIbI2AyU+4VZ3bCMZsU4S3TrD8VfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e52535df714189e83aa5be73d835462e9f957c5cde254efed50d0ddab465423","last_reissued_at":"2026-07-05T04:52:19.020337Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:52:19.020337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.13589","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-05T04:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8aKGj3/v3+tLD8S1SCAK5i7EogC6FsQYwR89soG1yMPlAkDuHXAEzsy9rlGcXKjqSCZm8c9jw0DZtXlgXzDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:06:31.151033Z"},"content_sha256":"487ea5f62410033004fb57b45e69511e3494bf459f50fc6a0bfd253085f7f77d","schema_version":"1.0","event_id":"sha256:487ea5f62410033004fb57b45e69511e3494bf459f50fc6a0bfd253085f7f77d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RZJFGXPXCQMJ5A5KLPTT3A2UML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evolving the MCTS Upper Confidence Bounds for Trees Using a Semantic-inspired Evolutionary Algorithm in the Game of Carcassonne","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Edgar Galv\\'an, Fred Valdez Ameneyro, Gavin Simpson","submitted_at":"2022-08-29T13:31:06Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a sampling best-first method to search for optimal decisions. 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 (UCT). The UCT attempts to balance exploration and exploitation by considering the values stored in the statistical tree of the MCTS. However, some tuning of the MCTS UCT is necessary for this to work well. In this work, we use Evolutionary Algorithms (EAs) to evolve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13589","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/2208.13589/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-05T04:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VNpFiVUyr/iFX1DhLx5AEVK2uU/bdCn1B5pbJW5MGBg/fHR+3aRplKo/lXyrmtZ84XB9f3h6770SUhJRGhoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:06:31.151572Z"},"content_sha256":"a0f1e531fa9b0162f8e36f4c9c5c44f3a6c8fd19cb0219a46d3c3775062337c8","schema_version":"1.0","event_id":"sha256:a0f1e531fa9b0162f8e36f4c9c5c44f3a6c8fd19cb0219a46d3c3775062337c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/bundle.json","state_url":"https://pith.science/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/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-08-03T17:06:31Z","links":{"resolver":"https://pith.science/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML","bundle":"https://pith.science/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/bundle.json","state":"https://pith.science/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZJFGXPXCQMJ5A5KLPTT3A2UML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RZJFGXPXCQMJ5A5KLPTT3A2UML","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":"68cc00c4ff7c7c865b3335647da738e6c9e9dd4f4cdd5248614435b016a8ee1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-08-29T13:31:06Z","title_canon_sha256":"b24f89030ff38cc0a1e648c03520b3adbda903b3cb9c9912ad63fb48f3552c5a"},"schema_version":"1.0","source":{"id":"2208.13589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.13589","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2208.13589v1","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13589","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"RZJFGXPXCQMJ","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"RZJFGXPXCQMJ5A5K","created_at":"2026-07-05T04:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"RZJFGXPX","created_at":"2026-07-05T04:52:19Z"}],"graph_snapshots":[{"event_id":"sha256:a0f1e531fa9b0162f8e36f4c9c5c44f3a6c8fd19cb0219a46d3c3775062337c8","target":"graph","created_at":"2026-07-05T04:52:19Z","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/2208.13589/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 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 (UCT). The UCT attempts to balance exploration and exploitation by considering the values stored in the statistical tree of the MCTS. However, some tuning of the MCTS UCT is necessary for this to work well. In this work, we use Evolutionary Algorithms (EAs) to evolve","authors_text":"Edgar Galv\\'an, Fred Valdez Ameneyro, Gavin Simpson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-08-29T13:31:06Z","title":"Evolving the MCTS Upper Confidence Bounds for Trees Using a Semantic-inspired Evolutionary Algorithm in the Game of Carcassonne"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13589","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:487ea5f62410033004fb57b45e69511e3494bf459f50fc6a0bfd253085f7f77d","target":"record","created_at":"2026-07-05T04:52:19Z","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":"68cc00c4ff7c7c865b3335647da738e6c9e9dd4f4cdd5248614435b016a8ee1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2022-08-29T13:31:06Z","title_canon_sha256":"b24f89030ff38cc0a1e648c03520b3adbda903b3cb9c9912ad63fb48f3552c5a"},"schema_version":"1.0","source":{"id":"2208.13589","kind":"arxiv","version":1}},"canonical_sha256":"8e52535df714189e83aa5be73d835462e9f957c5cde254efed50d0ddab465423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e52535df714189e83aa5be73d835462e9f957c5cde254efed50d0ddab465423","first_computed_at":"2026-07-05T04:52:19.020337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:52:19.020337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H0Otni8jxdxcc8jEPp30tT1bDHOv6Yj7q5539q3fyAtiic+3cXq/QzdMfIbI2AyU+4VZ3bCMZsU4S3TrD8VfDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:52:19.020769Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.13589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:487ea5f62410033004fb57b45e69511e3494bf459f50fc6a0bfd253085f7f77d","sha256:a0f1e531fa9b0162f8e36f4c9c5c44f3a6c8fd19cb0219a46d3c3775062337c8"],"state_sha256":"15cb1dd8c47f538d56b4bc3810b9319af033827c281ff310e140cefcc0c65f66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3gjk/hlUG9i5PMrFPcwOmqKwrqsJ+HFUVZBLyRyiq5Ey/Tn6igCbQojLBZkYsaIItzJES43fm1wlD1S3UDTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:06:31.156772Z","bundle_sha256":"86de0ef20c01c1614221cda43d9b3d41acde6d61393baefd2410c7c6eb86fde6"}}