{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:CVBS6SG5SXL4K776IUAMFWCQNP","short_pith_number":"pith:CVBS6SG5","canonical_record":{"source":{"id":"2003.13741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T18:43:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f8cdbc06c9592d62000dd034a42a8a2bc099940d3199a070d01b25288c812fb6","abstract_canon_sha256":"69e041dd6f1c443f43cb07498a591f88c60c270926d2a0f6095e33f2c9cdc086"},"schema_version":"1.0"},"canonical_sha256":"15432f48dd95d7c57ffe4500c2d8506be1b3c4d88d7067b06c4d177599ffcaed","source":{"kind":"arxiv","id":"2003.13741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13741","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13741v1","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13741","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"CVBS6SG5SXL4","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_16","alias_value":"CVBS6SG5SXL4K776","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_8","alias_value":"CVBS6SG5","created_at":"2026-07-05T00:51:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:CVBS6SG5SXL4K776IUAMFWCQNP","target":"record","payload":{"canonical_record":{"source":{"id":"2003.13741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T18:43:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"f8cdbc06c9592d62000dd034a42a8a2bc099940d3199a070d01b25288c812fb6","abstract_canon_sha256":"69e041dd6f1c443f43cb07498a591f88c60c270926d2a0f6095e33f2c9cdc086"},"schema_version":"1.0"},"canonical_sha256":"15432f48dd95d7c57ffe4500c2d8506be1b3c4d88d7067b06c4d177599ffcaed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:45.173707Z","signature_b64":"vSsuPxhqNvka0R/p5SLEjOgjGJtw/yZM46I4co8jSFMzZZClZAMzCkVTw3oJ+FUulDjJQkt1q60QDWFMjEqLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15432f48dd95d7c57ffe4500c2d8506be1b3c4d88d7067b06c4d177599ffcaed","last_reissued_at":"2026-07-05T00:51:45.173330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:45.173330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.13741","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-05T00:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtTL8/socfQBPHwlSC0pv1xirBWT50JH2w8n/qUYVdWnxfisuXECZo4YDvvsxyJpknp96Pq4DTXPkr+nV521Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:38:45.434376Z"},"content_sha256":"342c57587809867c120d8ae0e433a61451da25fdb148c64fed3c288867285120","schema_version":"1.0","event_id":"sha256:342c57587809867c120d8ae0e433a61451da25fdb148c64fed3c288867285120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:CVBS6SG5SXL4K776IUAMFWCQNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelization of Monte Carlo Tree Search in Continuous Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Christoph H\\\"ortnagl, J. Marius Z\\\"ollner, Karl Kurzer","submitted_at":"2020-03-30T18:43:59Z","abstract_excerpt":"Monte Carlo Tree Search (MCTS) has proven to be capable of solving challenging tasks in domains such as Go, chess and Atari. Previous research has developed parallel versions of MCTS, exploiting today's multiprocessing architectures. These studies focused on versions of MCTS for the discrete case. Our work builds upon existing parallelization strategies and extends them to continuous domains. In particular, leaf parallelization and root parallelization are studied and two final selection strategies that are required to handle continuous states in root parallelization are proposed. The evaluati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13741","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/2003.13741/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-05T00:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJoWxaYBFZB8R15Z1leXg2Ueu3dqzLQesszVb5a7zTMi3KuT9njxcx4leHEeRuJsHo56eQJ1I6AfGimtJOQ1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T10:38:45.434940Z"},"content_sha256":"426a2c444c244dcdf18938597a83aed5bd892a242668d06239128223f629d604","schema_version":"1.0","event_id":"sha256:426a2c444c244dcdf18938597a83aed5bd892a242668d06239128223f629d604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVBS6SG5SXL4K776IUAMFWCQNP/bundle.json","state_url":"https://pith.science/pith/CVBS6SG5SXL4K776IUAMFWCQNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVBS6SG5SXL4K776IUAMFWCQNP/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-05T10:38:45Z","links":{"resolver":"https://pith.science/pith/CVBS6SG5SXL4K776IUAMFWCQNP","bundle":"https://pith.science/pith/CVBS6SG5SXL4K776IUAMFWCQNP/bundle.json","state":"https://pith.science/pith/CVBS6SG5SXL4K776IUAMFWCQNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVBS6SG5SXL4K776IUAMFWCQNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:CVBS6SG5SXL4K776IUAMFWCQNP","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":"69e041dd6f1c443f43cb07498a591f88c60c270926d2a0f6095e33f2c9cdc086","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T18:43:59Z","title_canon_sha256":"f8cdbc06c9592d62000dd034a42a8a2bc099940d3199a070d01b25288c812fb6"},"schema_version":"1.0","source":{"id":"2003.13741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13741","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13741v1","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13741","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"CVBS6SG5SXL4","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_16","alias_value":"CVBS6SG5SXL4K776","created_at":"2026-07-05T00:51:45Z"},{"alias_kind":"pith_short_8","alias_value":"CVBS6SG5","created_at":"2026-07-05T00:51:45Z"}],"graph_snapshots":[{"event_id":"sha256:426a2c444c244dcdf18938597a83aed5bd892a242668d06239128223f629d604","target":"graph","created_at":"2026-07-05T00:51:45Z","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/2003.13741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Monte Carlo Tree Search (MCTS) has proven to be capable of solving challenging tasks in domains such as Go, chess and Atari. Previous research has developed parallel versions of MCTS, exploiting today's multiprocessing architectures. These studies focused on versions of MCTS for the discrete case. Our work builds upon existing parallelization strategies and extends them to continuous domains. In particular, leaf parallelization and root parallelization are studied and two final selection strategies that are required to handle continuous states in root parallelization are proposed. The evaluati","authors_text":"Christoph H\\\"ortnagl, J. Marius Z\\\"ollner, Karl Kurzer","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T18:43:59Z","title":"Parallelization of Monte Carlo Tree Search in Continuous Domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13741","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:342c57587809867c120d8ae0e433a61451da25fdb148c64fed3c288867285120","target":"record","created_at":"2026-07-05T00:51:45Z","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":"69e041dd6f1c443f43cb07498a591f88c60c270926d2a0f6095e33f2c9cdc086","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-30T18:43:59Z","title_canon_sha256":"f8cdbc06c9592d62000dd034a42a8a2bc099940d3199a070d01b25288c812fb6"},"schema_version":"1.0","source":{"id":"2003.13741","kind":"arxiv","version":1}},"canonical_sha256":"15432f48dd95d7c57ffe4500c2d8506be1b3c4d88d7067b06c4d177599ffcaed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15432f48dd95d7c57ffe4500c2d8506be1b3c4d88d7067b06c4d177599ffcaed","first_computed_at":"2026-07-05T00:51:45.173330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:51:45.173330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vSsuPxhqNvka0R/p5SLEjOgjGJtw/yZM46I4co8jSFMzZZClZAMzCkVTw3oJ+FUulDjJQkt1q60QDWFMjEqLBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:51:45.173707Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.13741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:342c57587809867c120d8ae0e433a61451da25fdb148c64fed3c288867285120","sha256:426a2c444c244dcdf18938597a83aed5bd892a242668d06239128223f629d604"],"state_sha256":"21abd77fe8c3cd6b3aa965309bbe0227942e43a00a2436d106bc1687aff1a0df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWe3zxWm389p9WnPVcqY6IKrxPTmlcBO27JMjeM7GMaCFTAGkwWrZ9sx504jc3BtMW1kxTuSYPk1R80zQ36yCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T10:38:45.438394Z","bundle_sha256":"c16af339957d1ccfcdf186ec0f4c1cce24ad55c9c22b48d983b6b17097ba1553"}}