{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2F74ITYBZSI47DG5EPYDJRNWUH","short_pith_number":"pith:2F74ITYB","canonical_record":{"source":{"id":"2607.13007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T17:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"2a7b0bbd7ee05817ac08cfd1d463c71793f7d8bcf47927a09f6eaf645b5e9b3c","abstract_canon_sha256":"7d1da5985ea809b3f07706fe1b590a45596739dcb915cf673684cb468637321f"},"schema_version":"1.0"},"canonical_sha256":"d17fc44f01cc91cf8cdd23f034c5b6a1e010b6859ea44c105c709cdeb8d61286","source":{"kind":"arxiv","id":"2607.13007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13007","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13007v1","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13007","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"2F74ITYBZSI4","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"2F74ITYBZSI47DG5","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"2F74ITYB","created_at":"2026-07-15T01:22:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2F74ITYBZSI47DG5EPYDJRNWUH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T17:51:15Z","cross_cats_sorted":[],"title_canon_sha256":"2a7b0bbd7ee05817ac08cfd1d463c71793f7d8bcf47927a09f6eaf645b5e9b3c","abstract_canon_sha256":"7d1da5985ea809b3f07706fe1b590a45596739dcb915cf673684cb468637321f"},"schema_version":"1.0"},"canonical_sha256":"d17fc44f01cc91cf8cdd23f034c5b6a1e010b6859ea44c105c709cdeb8d61286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T01:22:30.973905Z","signature_b64":"mu09+09Sd7D3qs63Ui85K3SgHBkq9Y5gLZ2LWJoZ7VryTus+xUQsoubytxs2p6CwCl8zKQZ766rcUlcMl5KNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d17fc44f01cc91cf8cdd23f034c5b6a1e010b6859ea44c105c709cdeb8d61286","last_reissued_at":"2026-07-15T01:22:30.973077Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T01:22:30.973077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13007","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-15T01:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"geZZY6vRPP8uTyD/s+DbcvFcnlmXsXmTQMcuOvY23KFRAzB92GxcmsGQfLk3enSJCN2GhOdjkb02IKM/X7gcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:25:42.930040Z"},"content_sha256":"8634920f18adaed058523cc1b1edb6e3da0bb25edb16271bbc10caa34dbb562b","schema_version":"1.0","event_id":"sha256:8634920f18adaed058523cc1b1edb6e3da0bb25edb16271bbc10caa34dbb562b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2F74ITYBZSI47DG5EPYDJRNWUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Resource Allocation for Ensemble Determinization MCTS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adam Ci\\k{e}\\.zkowski, Artur Krzy\\.zy\\'nski, Jakub Kowalski, Mark H. M. Winands","submitted_at":"2026-07-14T17:51:15Z","abstract_excerpt":"Simulation-based algorithms are especially suited for high-uncertainty environments such as adversarial board games with significant elements of randomness and hidden information. In particular, several Monte Carlo Tree Search (MCTS) variants are commonly used in such domains. In this paper, we propose a series of enhancements for Ensemble Determinization MCTS, introducing two axes for dynamic resource allocation. First, Dynamic Number of Determinizations, increases or decreases the number of currently used determinization trees depending on the behavior of so-far search. Second, Dynamic Simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13007","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/2607.13007/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-15T01:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sERMP0xik4xCfPAcXBnH9YtBm85f2ESBhMVGH9a+6TYAVxAOxcElQmGvu6Zq9SF6XxPhDQUAbY6ESi3LX3iSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:25:42.930709Z"},"content_sha256":"0fb4ad5dcf83c0036b7e00c9f41cd35c58744c8bcb93ccad921cb0c6fa54b803","schema_version":"1.0","event_id":"sha256:0fb4ad5dcf83c0036b7e00c9f41cd35c58744c8bcb93ccad921cb0c6fa54b803"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2F74ITYBZSI47DG5EPYDJRNWUH/bundle.json","state_url":"https://pith.science/pith/2F74ITYBZSI47DG5EPYDJRNWUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2F74ITYBZSI47DG5EPYDJRNWUH/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:25:42Z","links":{"resolver":"https://pith.science/pith/2F74ITYBZSI47DG5EPYDJRNWUH","bundle":"https://pith.science/pith/2F74ITYBZSI47DG5EPYDJRNWUH/bundle.json","state":"https://pith.science/pith/2F74ITYBZSI47DG5EPYDJRNWUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2F74ITYBZSI47DG5EPYDJRNWUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2F74ITYBZSI47DG5EPYDJRNWUH","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":"7d1da5985ea809b3f07706fe1b590a45596739dcb915cf673684cb468637321f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T17:51:15Z","title_canon_sha256":"2a7b0bbd7ee05817ac08cfd1d463c71793f7d8bcf47927a09f6eaf645b5e9b3c"},"schema_version":"1.0","source":{"id":"2607.13007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13007","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13007v1","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13007","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"2F74ITYBZSI4","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_16","alias_value":"2F74ITYBZSI47DG5","created_at":"2026-07-15T01:22:30Z"},{"alias_kind":"pith_short_8","alias_value":"2F74ITYB","created_at":"2026-07-15T01:22:30Z"}],"graph_snapshots":[{"event_id":"sha256:0fb4ad5dcf83c0036b7e00c9f41cd35c58744c8bcb93ccad921cb0c6fa54b803","target":"graph","created_at":"2026-07-15T01:22:30Z","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/2607.13007/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Simulation-based algorithms are especially suited for high-uncertainty environments such as adversarial board games with significant elements of randomness and hidden information. In particular, several Monte Carlo Tree Search (MCTS) variants are commonly used in such domains. In this paper, we propose a series of enhancements for Ensemble Determinization MCTS, introducing two axes for dynamic resource allocation. First, Dynamic Number of Determinizations, increases or decreases the number of currently used determinization trees depending on the behavior of so-far search. Second, Dynamic Simul","authors_text":"Adam Ci\\k{e}\\.zkowski, Artur Krzy\\.zy\\'nski, Jakub Kowalski, Mark H. M. Winands","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T17:51:15Z","title":"Dynamic Resource Allocation for Ensemble Determinization MCTS"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13007","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:8634920f18adaed058523cc1b1edb6e3da0bb25edb16271bbc10caa34dbb562b","target":"record","created_at":"2026-07-15T01:22:30Z","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":"7d1da5985ea809b3f07706fe1b590a45596739dcb915cf673684cb468637321f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T17:51:15Z","title_canon_sha256":"2a7b0bbd7ee05817ac08cfd1d463c71793f7d8bcf47927a09f6eaf645b5e9b3c"},"schema_version":"1.0","source":{"id":"2607.13007","kind":"arxiv","version":1}},"canonical_sha256":"d17fc44f01cc91cf8cdd23f034c5b6a1e010b6859ea44c105c709cdeb8d61286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d17fc44f01cc91cf8cdd23f034c5b6a1e010b6859ea44c105c709cdeb8d61286","first_computed_at":"2026-07-15T01:22:30.973077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-15T01:22:30.973077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mu09+09Sd7D3qs63Ui85K3SgHBkq9Y5gLZ2LWJoZ7VryTus+xUQsoubytxs2p6CwCl8zKQZ766rcUlcMl5KNBQ==","signature_status":"signed_v1","signed_at":"2026-07-15T01:22:30.973905Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8634920f18adaed058523cc1b1edb6e3da0bb25edb16271bbc10caa34dbb562b","sha256:0fb4ad5dcf83c0036b7e00c9f41cd35c58744c8bcb93ccad921cb0c6fa54b803"],"state_sha256":"6450032ced0021edfc5e12af3904a97d4d1fecc20f06c5892056c30693117708"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5gNQMjzz9l5wbRK6EY1j4zp5n55l3inJnrP5hDu4RNW2MwEFfJHp9YQdzEsp5iRD9HOOIqlN43H0XMNHyhFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:25:42.935699Z","bundle_sha256":"d7c71687318870aead5833b0fa83741b2fbd48f7277d4db8e9ca9ea3911fdaa0"}}