{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FUDCUKT7HQSDOML3GYNOPQ422A","short_pith_number":"pith:FUDCUKT7","canonical_record":{"source":{"id":"2311.13609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-11-21T20:40:34Z","cross_cats_sorted":[],"title_canon_sha256":"5e1405241023798a69cb964896d18531b99b1c9d0b277fb251e0ed1f2350e146","abstract_canon_sha256":"608a59d889b3576578b8fecf418a09b614c354aa9b112b6aeb681d9579448d2a"},"schema_version":"1.0"},"canonical_sha256":"2d062a2a7f3c2437317b361ae7c39ad0382f76f87b5a787c84784775b4a5a7a2","source":{"kind":"arxiv","id":"2311.13609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13609","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13609v1","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13609","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"FUDCUKT7HQSD","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_16","alias_value":"FUDCUKT7HQSDOML3","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_8","alias_value":"FUDCUKT7","created_at":"2026-07-05T07:16:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FUDCUKT7HQSDOML3GYNOPQ422A","target":"record","payload":{"canonical_record":{"source":{"id":"2311.13609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-11-21T20:40:34Z","cross_cats_sorted":[],"title_canon_sha256":"5e1405241023798a69cb964896d18531b99b1c9d0b277fb251e0ed1f2350e146","abstract_canon_sha256":"608a59d889b3576578b8fecf418a09b614c354aa9b112b6aeb681d9579448d2a"},"schema_version":"1.0"},"canonical_sha256":"2d062a2a7f3c2437317b361ae7c39ad0382f76f87b5a787c84784775b4a5a7a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:05.301895Z","signature_b64":"+NXoti24d6JWS1uF2ZtunX1ImCFZ0NgNR2xFKCuLC8WiIa81gsUOKojDtczHpYLu0He5oZMOwoVMMYoVmst8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d062a2a7f3c2437317b361ae7c39ad0382f76f87b5a787c84784775b4a5a7a2","last_reissued_at":"2026-07-05T07:16:05.301486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:05.301486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.13609","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-05T07:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"92z0/azZ5R2ltcPGYB7Ne5Y3b6Z5Bb+GKGa7/6cEoDTAfxJTlq4SG8WCSfyTlfwkeWUseMjpOMVx6SFuJSTaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:31:45.557672Z"},"content_sha256":"9a4cbfea33bfd3ecf78da135231a3a5e3cef03d49e397b11576a1e03f8a91286","schema_version":"1.0","event_id":"sha256:9a4cbfea33bfd3ecf78da135231a3a5e3cef03d49e397b11576a1e03f8a91286"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FUDCUKT7HQSDOML3GYNOPQ422A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Analysis on the Effects of Evolving the Monte Carlo Tree Search Upper Confidence for Trees Selection Policy on Unimodal, Multimodal and Deceptive Landscapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Edgar Galvan, Fred Valdez Ameneyro","submitted_at":"2023-11-21T20:40:34Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) is a best-first sampling method employed in the search for optimal decisions. The effectiveness of MCTS relies on the construction of its statistical tree, with the selection policy playing a crucial role. A selection policy that works particularly well in MCTS is the Upper Confidence Bounds for Trees, referred to as UCT. The research community has also put forth more sophisticated bounds aimed at enhancing MCTS performance on specific problem domains. Thus, while MCTS UCT generally performs well, there may be variants that outperform it. This has led to various "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13609","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/2311.13609/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-05T07:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg49jQJ8BznrBQWOPpIuFKZxQZs+W75r01A9a/zFs64Jvn8mktj0NitLKSY1UyxdmR8LTF6TIUHKcWgA1Q4RBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:31:45.558167Z"},"content_sha256":"51c1d8b3763a031a3f423c02856dd27d1e6ecc2ed3cdf2f3927d04b700456c98","schema_version":"1.0","event_id":"sha256:51c1d8b3763a031a3f423c02856dd27d1e6ecc2ed3cdf2f3927d04b700456c98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUDCUKT7HQSDOML3GYNOPQ422A/bundle.json","state_url":"https://pith.science/pith/FUDCUKT7HQSDOML3GYNOPQ422A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUDCUKT7HQSDOML3GYNOPQ422A/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-03T15:31:45Z","links":{"resolver":"https://pith.science/pith/FUDCUKT7HQSDOML3GYNOPQ422A","bundle":"https://pith.science/pith/FUDCUKT7HQSDOML3GYNOPQ422A/bundle.json","state":"https://pith.science/pith/FUDCUKT7HQSDOML3GYNOPQ422A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUDCUKT7HQSDOML3GYNOPQ422A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FUDCUKT7HQSDOML3GYNOPQ422A","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":"608a59d889b3576578b8fecf418a09b614c354aa9b112b6aeb681d9579448d2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-11-21T20:40:34Z","title_canon_sha256":"5e1405241023798a69cb964896d18531b99b1c9d0b277fb251e0ed1f2350e146"},"schema_version":"1.0","source":{"id":"2311.13609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.13609","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"2311.13609v1","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13609","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"FUDCUKT7HQSD","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_16","alias_value":"FUDCUKT7HQSDOML3","created_at":"2026-07-05T07:16:05Z"},{"alias_kind":"pith_short_8","alias_value":"FUDCUKT7","created_at":"2026-07-05T07:16:05Z"}],"graph_snapshots":[{"event_id":"sha256:51c1d8b3763a031a3f423c02856dd27d1e6ecc2ed3cdf2f3927d04b700456c98","target":"graph","created_at":"2026-07-05T07:16:05Z","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/2311.13609/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 best-first sampling method employed in the search for optimal decisions. The effectiveness of MCTS relies on the construction of its statistical tree, with the selection policy playing a crucial role. A selection policy that works particularly well in MCTS is the Upper Confidence Bounds for Trees, referred to as UCT. The research community has also put forth more sophisticated bounds aimed at enhancing MCTS performance on specific problem domains. Thus, while MCTS UCT generally performs well, there may be variants that outperform it. This has led to various ","authors_text":"Edgar Galvan, Fred Valdez Ameneyro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-11-21T20:40:34Z","title":"An Analysis on the Effects of Evolving the Monte Carlo Tree Search Upper Confidence for Trees Selection Policy on Unimodal, Multimodal and Deceptive Landscapes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13609","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:9a4cbfea33bfd3ecf78da135231a3a5e3cef03d49e397b11576a1e03f8a91286","target":"record","created_at":"2026-07-05T07:16:05Z","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":"608a59d889b3576578b8fecf418a09b614c354aa9b112b6aeb681d9579448d2a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-11-21T20:40:34Z","title_canon_sha256":"5e1405241023798a69cb964896d18531b99b1c9d0b277fb251e0ed1f2350e146"},"schema_version":"1.0","source":{"id":"2311.13609","kind":"arxiv","version":1}},"canonical_sha256":"2d062a2a7f3c2437317b361ae7c39ad0382f76f87b5a787c84784775b4a5a7a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d062a2a7f3c2437317b361ae7c39ad0382f76f87b5a787c84784775b4a5a7a2","first_computed_at":"2026-07-05T07:16:05.301486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:05.301486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+NXoti24d6JWS1uF2ZtunX1ImCFZ0NgNR2xFKCuLC8WiIa81gsUOKojDtczHpYLu0He5oZMOwoVMMYoVmst8Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:05.301895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.13609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a4cbfea33bfd3ecf78da135231a3a5e3cef03d49e397b11576a1e03f8a91286","sha256:51c1d8b3763a031a3f423c02856dd27d1e6ecc2ed3cdf2f3927d04b700456c98"],"state_sha256":"653796d47c4b7b132970f0359fc2ded5713de12cd8663f553bb851e7b6d23ebc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhb0nYpq+I+eVyu8b9Jz1e4JC27vZazkZqB6ozkqGBj3Z8SK4YhaZl8G8ZqJUBFQCwQwIYrVp+jy6ejIzrf/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:31:45.561837Z","bundle_sha256":"84bbeba40ae0250aa58bbc555f5339a9ffe4abb5b9669b05f913c2a809862e09"}}