{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KURCTIWYFB57EI4N3ECCGI26EF","short_pith_number":"pith:KURCTIWY","canonical_record":{"source":{"id":"2511.14220","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-18T07:54:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a022f017bd8f61592edd22aaa32691dbd4074b09947d7722b8f9e5752a630367","abstract_canon_sha256":"33ccd4f8e91b74a06a6f2d53e1bb66166de5ea48e46c110b21bdb1fffe623d7f"},"schema_version":"1.0"},"canonical_sha256":"552229a2d8287bf2238dd90423235e2140f6ad0a6c85426aa68c2970d466e5f0","source":{"kind":"arxiv","id":"2511.14220","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.14220","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"2511.14220v3","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14220","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"KURCTIWYFB57","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_16","alias_value":"KURCTIWYFB57EI4N","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_8","alias_value":"KURCTIWY","created_at":"2026-05-22T01:03:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KURCTIWYFB57EI4N3ECCGI26EF","target":"record","payload":{"canonical_record":{"source":{"id":"2511.14220","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-18T07:54:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a022f017bd8f61592edd22aaa32691dbd4074b09947d7722b8f9e5752a630367","abstract_canon_sha256":"33ccd4f8e91b74a06a6f2d53e1bb66166de5ea48e46c110b21bdb1fffe623d7f"},"schema_version":"1.0"},"canonical_sha256":"552229a2d8287bf2238dd90423235e2140f6ad0a6c85426aa68c2970d466e5f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:50.643804Z","signature_b64":"vYScBqGlUa+4RZcs6hAO7rGg4nesBQe4yRZiyo4CpvqejEqYy0YRXXKH1OujcQrYRES+HrZqZnNskvHlsPKtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552229a2d8287bf2238dd90423235e2140f6ad0a6c85426aa68c2970d466e5f0","last_reissued_at":"2026-05-22T01:03:50.643081Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:50.643081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.14220","source_version":3,"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-05-22T01:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXEI0eF8nf0uO00D8gE5IWY/lJE/fUeXGuwEkeTxrDs17ygCnZFXdtyolahv3LQbSOwTxInnqX+fbBzT2gOCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:09:47.609780Z"},"content_sha256":"41413d2e1326da45047976c3c5d101227c2aeac1bf3e1af5a8d6da415cd2a442","schema_version":"1.0","event_id":"sha256:41413d2e1326da45047976c3c5d101227c2aeac1bf3e1af5a8d6da415cd2a442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KURCTIWYFB57EI4N3ECCGI26EF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Twice Sequential Monte Carlo for Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Joery A. de Vries, Matthijs T. J. Spaan, Pascal R. van der Vaart, Wendelin B\\\"ohmer, Yaniv Oren","submitted_at":"2025-11-18T07:54:29Z","abstract_excerpt":"Model-based reinforcement learning (RL) methods that leverage search are responsible for many milestone breakthroughs in RL. Sequential Monte Carlo (SMC) recently emerged as an alternative to the Monte Carlo Tree Search (MCTS) algorithm which drove these breakthroughs. SMC is easier to parallelize and more suitable to GPU acceleration. However, it also suffers from large variance and path degeneracy which prevent it from scaling well with increased search depth, i.e., increased sequential compute. To address these problems, we introduce Twice Sequential Monte Carlo Tree Search (TSMCTS). Across"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.14220","kind":"arxiv","version":3},"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/2511.14220/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-05-22T01:03:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G++8aWdIkPvvogiQE4klyxcglwbEtZQUjmm/yXBTjKgemjRgVuaEknxlXzN0SZXni5W01EymRN/ycQnOgbs+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:09:47.610560Z"},"content_sha256":"4ad1d377aa58de58cd43a0592ba1c7688b61cca6364da2334441e052fc487a7b","schema_version":"1.0","event_id":"sha256:4ad1d377aa58de58cd43a0592ba1c7688b61cca6364da2334441e052fc487a7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KURCTIWYFB57EI4N3ECCGI26EF/bundle.json","state_url":"https://pith.science/pith/KURCTIWYFB57EI4N3ECCGI26EF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KURCTIWYFB57EI4N3ECCGI26EF/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-05-26T17:09:47Z","links":{"resolver":"https://pith.science/pith/KURCTIWYFB57EI4N3ECCGI26EF","bundle":"https://pith.science/pith/KURCTIWYFB57EI4N3ECCGI26EF/bundle.json","state":"https://pith.science/pith/KURCTIWYFB57EI4N3ECCGI26EF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KURCTIWYFB57EI4N3ECCGI26EF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KURCTIWYFB57EI4N3ECCGI26EF","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":"33ccd4f8e91b74a06a6f2d53e1bb66166de5ea48e46c110b21bdb1fffe623d7f","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-18T07:54:29Z","title_canon_sha256":"a022f017bd8f61592edd22aaa32691dbd4074b09947d7722b8f9e5752a630367"},"schema_version":"1.0","source":{"id":"2511.14220","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.14220","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"arxiv_version","alias_value":"2511.14220v3","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.14220","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_12","alias_value":"KURCTIWYFB57","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_16","alias_value":"KURCTIWYFB57EI4N","created_at":"2026-05-22T01:03:50Z"},{"alias_kind":"pith_short_8","alias_value":"KURCTIWY","created_at":"2026-05-22T01:03:50Z"}],"graph_snapshots":[{"event_id":"sha256:4ad1d377aa58de58cd43a0592ba1c7688b61cca6364da2334441e052fc487a7b","target":"graph","created_at":"2026-05-22T01:03: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/2511.14220/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Model-based reinforcement learning (RL) methods that leverage search are responsible for many milestone breakthroughs in RL. Sequential Monte Carlo (SMC) recently emerged as an alternative to the Monte Carlo Tree Search (MCTS) algorithm which drove these breakthroughs. SMC is easier to parallelize and more suitable to GPU acceleration. However, it also suffers from large variance and path degeneracy which prevent it from scaling well with increased search depth, i.e., increased sequential compute. To address these problems, we introduce Twice Sequential Monte Carlo Tree Search (TSMCTS). Across","authors_text":"Joery A. de Vries, Matthijs T. J. Spaan, Pascal R. van der Vaart, Wendelin B\\\"ohmer, Yaniv Oren","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-18T07:54:29Z","title":"Twice Sequential Monte Carlo for Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.14220","kind":"arxiv","version":3},"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:41413d2e1326da45047976c3c5d101227c2aeac1bf3e1af5a8d6da415cd2a442","target":"record","created_at":"2026-05-22T01:03: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":"33ccd4f8e91b74a06a6f2d53e1bb66166de5ea48e46c110b21bdb1fffe623d7f","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-11-18T07:54:29Z","title_canon_sha256":"a022f017bd8f61592edd22aaa32691dbd4074b09947d7722b8f9e5752a630367"},"schema_version":"1.0","source":{"id":"2511.14220","kind":"arxiv","version":3}},"canonical_sha256":"552229a2d8287bf2238dd90423235e2140f6ad0a6c85426aa68c2970d466e5f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"552229a2d8287bf2238dd90423235e2140f6ad0a6c85426aa68c2970d466e5f0","first_computed_at":"2026-05-22T01:03:50.643081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:03:50.643081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vYScBqGlUa+4RZcs6hAO7rGg4nesBQe4yRZiyo4CpvqejEqYy0YRXXKH1OujcQrYRES+HrZqZnNskvHlsPKtAg==","signature_status":"signed_v1","signed_at":"2026-05-22T01:03:50.643804Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.14220","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41413d2e1326da45047976c3c5d101227c2aeac1bf3e1af5a8d6da415cd2a442","sha256:4ad1d377aa58de58cd43a0592ba1c7688b61cca6364da2334441e052fc487a7b"],"state_sha256":"5791fd336de57bc10d425e35148f1cac30c4d6270622e2c7b09831a3173b58a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHfS1FjKuuoWlnIvlClSlwNLhazfnGgdq0l+mFcJ+E7ujZnzPyh9VdJU1kqPCnazxnd8BV4nYhEJMpHb6plhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:09:47.614884Z","bundle_sha256":"a0e76ef6b5bdb2dec3a926c9b5e013d3bb29821b432d3570dc733506e37702ef"}}