{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M4S3XKMZIAAQ3SMGVSOHT44X4X","short_pith_number":"pith:M4S3XKMZ","canonical_record":{"source":{"id":"1805.01367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-03T15:20:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7544beda9e92b9703d1b9dc177ed48f1838ae3a6ac69a9de9855d0424c265a5a","abstract_canon_sha256":"eb2643f10a500d653617c3d9b64f963e535a32a15ee472e80213085bd029e184"},"schema_version":"1.0"},"canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","source":{"kind":"arxiv","id":"1805.01367","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01367","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01367v2","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01367","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"M4S3XKMZIAAQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M4S3XKMZIAAQ3SMG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M4S3XKMZ","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M4S3XKMZIAAQ3SMGVSOHT44X4X","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01367","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-03T15:20:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7544beda9e92b9703d1b9dc177ed48f1838ae3a6ac69a9de9855d0424c265a5a","abstract_canon_sha256":"eb2643f10a500d653617c3d9b64f963e535a32a15ee472e80213085bd029e184"},"schema_version":"1.0"},"canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:07.354642Z","signature_b64":"yhwnovrh0ozf/YSrmB9hVLQgP6KlYkt65/OLtBZrzEqW62LsNEwyzhQ/8UFtCmB3DecvQIKlmfVw2BIFcj5iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","last_reissued_at":"2026-05-17T23:54:07.354124Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:07.354124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01367","source_version":2,"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-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+5aWwOPmGJhWbUWq+Xt7s69nM4uSqOcMV/lPAdSUgo55kvgCAhLm1Dt58ygIO0YYzMBj/ROfetlLEieGVQpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:48.698785Z"},"content_sha256":"dc061b94b042dc47f352db1cd477dd395192f39fa8466da124e9f50f87eb962d","schema_version":"1.0","event_id":"sha256:dc061b94b042dc47f352db1cd477dd395192f39fa8466da124e9f50f87eb962d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M4S3XKMZIAAQ3SMGVSOHT44X4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Open Loop Execution of Tree-Search Algorithms, extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Charles Lesire, Emmanuel Rachelson, Erwan Lecarpentier, Guillaume Infantes","submitted_at":"2018-05-03T15:20:10Z","abstract_excerpt":"In the context of tree-search stochastic planning algorithms where a generative model is available, we consider on-line planning algorithms building trees in order to recommend an action. We investigate the question of avoiding re-planning in subsequent decision steps by directly using sub-trees as action recommender. Firstly, we propose a method for open loop control via a new algorithm taking the decision of re-planning or not at each time step based on an analysis of the statistics of the sub-tree. Secondly, we show that the probability of selecting a suboptimal action at any depth of the t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01367","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-17T23:54:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FkiVn5CE+bafN0hyVyUAlPnDmPRbmwEZL6KbrfUPvtMMpnoF1CNSVI557DYWu+AX8eKyGQkGl7lCSIPK8MwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:48.699177Z"},"content_sha256":"55a92e21029b35c2af4164218337717c24ffbdbe279b82b530df2d484552ecd9","schema_version":"1.0","event_id":"sha256:55a92e21029b35c2af4164218337717c24ffbdbe279b82b530df2d484552ecd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/bundle.json","state_url":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/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-27T15:50:48Z","links":{"resolver":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X","bundle":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/bundle.json","state":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M4S3XKMZIAAQ3SMGVSOHT44X4X","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":"eb2643f10a500d653617c3d9b64f963e535a32a15ee472e80213085bd029e184","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-03T15:20:10Z","title_canon_sha256":"7544beda9e92b9703d1b9dc177ed48f1838ae3a6ac69a9de9855d0424c265a5a"},"schema_version":"1.0","source":{"id":"1805.01367","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01367","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01367v2","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01367","created_at":"2026-05-17T23:54:07Z"},{"alias_kind":"pith_short_12","alias_value":"M4S3XKMZIAAQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M4S3XKMZIAAQ3SMG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M4S3XKMZ","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:55a92e21029b35c2af4164218337717c24ffbdbe279b82b530df2d484552ecd9","target":"graph","created_at":"2026-05-17T23:54:07Z","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"},"paper":{"abstract_excerpt":"In the context of tree-search stochastic planning algorithms where a generative model is available, we consider on-line planning algorithms building trees in order to recommend an action. We investigate the question of avoiding re-planning in subsequent decision steps by directly using sub-trees as action recommender. Firstly, we propose a method for open loop control via a new algorithm taking the decision of re-planning or not at each time step based on an analysis of the statistics of the sub-tree. Secondly, we show that the probability of selecting a suboptimal action at any depth of the t","authors_text":"Charles Lesire, Emmanuel Rachelson, Erwan Lecarpentier, Guillaume Infantes","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-03T15:20:10Z","title":"Open Loop Execution of Tree-Search Algorithms, extended version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01367","kind":"arxiv","version":2},"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:dc061b94b042dc47f352db1cd477dd395192f39fa8466da124e9f50f87eb962d","target":"record","created_at":"2026-05-17T23:54:07Z","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":"eb2643f10a500d653617c3d9b64f963e535a32a15ee472e80213085bd029e184","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-03T15:20:10Z","title_canon_sha256":"7544beda9e92b9703d1b9dc177ed48f1838ae3a6ac69a9de9855d0424c265a5a"},"schema_version":"1.0","source":{"id":"1805.01367","kind":"arxiv","version":2}},"canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","first_computed_at":"2026-05-17T23:54:07.354124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:07.354124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yhwnovrh0ozf/YSrmB9hVLQgP6KlYkt65/OLtBZrzEqW62LsNEwyzhQ/8UFtCmB3DecvQIKlmfVw2BIFcj5iDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:07.354642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01367","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc061b94b042dc47f352db1cd477dd395192f39fa8466da124e9f50f87eb962d","sha256:55a92e21029b35c2af4164218337717c24ffbdbe279b82b530df2d484552ecd9"],"state_sha256":"47ce1fdea97f96b817706b5b3cf76ecf97487fb7d9dc92f64bc87518ae3c0092"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWNkL4UV2dFA7SGmae9FW/NDb/OnGNZ0Z76kzfEb1VMaEuTa9NB4saL7MJdBe0uxrQz6ceJgNlY7lDYUvC99Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:50:48.701545Z","bundle_sha256":"5ac3d44d8116aa684c1f52730279a380250c32eaa9186ca200086dc8197fdfa5"}}