{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:M4S3XKMZIAAQ3SMGVSOHT44X4X","short_pith_number":"pith:M4S3XKMZ","schema_version":"1.0","canonical_sha256":"6725bba99940010dc986ac9c79f397e5d8969164d073529d8b61fb17725ea940","source":{"kind":"arxiv","id":"1805.01367","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.01367","created_at":"2026-05-17T23:54:07.354202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01367v2","created_at":"2026-05-17T23:54:07.354202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01367","created_at":"2026-05-17T23:54:07.354202+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4S3XKMZIAAQ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4S3XKMZIAAQ3SMG","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4S3XKMZ","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.09860","citing_title":"When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09860","citing_title":"When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09860","citing_title":"When to Re-Commit: Temporal Abstraction Discovery for Long-Horizon Vision-Language Reasoning","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X","json":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X.json","graph_json":"https://pith.science/api/pith-number/M4S3XKMZIAAQ3SMGVSOHT44X4X/graph.json","events_json":"https://pith.science/api/pith-number/M4S3XKMZIAAQ3SMGVSOHT44X4X/events.json","paper":"https://pith.science/paper/M4S3XKMZ"},"agent_actions":{"view_html":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X","download_json":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X.json","view_paper":"https://pith.science/paper/M4S3XKMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01367&json=true","fetch_graph":"https://pith.science/api/pith-number/M4S3XKMZIAAQ3SMGVSOHT44X4X/graph.json","fetch_events":"https://pith.science/api/pith-number/M4S3XKMZIAAQ3SMGVSOHT44X4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/action/storage_attestation","attest_author":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/action/author_attestation","sign_citation":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/action/citation_signature","submit_replication":"https://pith.science/pith/M4S3XKMZIAAQ3SMGVSOHT44X4X/action/replication_record"}},"created_at":"2026-05-17T23:54:07.354202+00:00","updated_at":"2026-05-17T23:54:07.354202+00:00"}