{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3F3V6KMQ4NSANF5HQIHUZUO2V4","short_pith_number":"pith:3F3V6KMQ","schema_version":"1.0","canonical_sha256":"d9775f2990e3640697a7820f4cd1daaf1a6d0de2b40d7e26565cd36990abfe73","source":{"kind":"arxiv","id":"1302.6810","version":1},"attestation_state":"computed","paper":{"title":"Epsilon-Safe Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark S. Boddy, Robert P. Goldman","submitted_at":"2013-02-27T14:16:19Z","abstract_excerpt":"We introduce an approach to high-level conditional planning we call epsilon-safe planning.  This probabilistic approach commits us to planning to meet some specified goal with a probability of success of at least 1-epsilon for some user-supplied epsilon.  We describe several algorithms for epsilon-safe planning based on conditional planners. The two conditional planners we discuss are Peot and Smith's nonlinear conditional planner, CNLP, and our own linear conditional planner, PLINTH.  We present a straightforward extension to conditional planners for which computing the necessary probabilitie"},"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":"1302.6810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:16:19Z","cross_cats_sorted":[],"title_canon_sha256":"c7d875d172959ac3eaacb168d4f8fafd45fbde701144af1c4db11b59a2bc9d29","abstract_canon_sha256":"65244523dec6146ac570fec58fb9d0ff56831e83ce8360aaa0234498bc1d043d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:18.639038Z","signature_b64":"JUDgEP145Ng1F1sq0uQOzGAt+77W9J1Bbv/Avr5Vdt6eVkWewFJ2m2nm51/C3RXviZgoqt3Jd6d45gbd7H0eBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9775f2990e3640697a7820f4cd1daaf1a6d0de2b40d7e26565cd36990abfe73","last_reissued_at":"2026-05-18T03:32:18.638598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:18.638598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Epsilon-Safe Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark S. Boddy, Robert P. Goldman","submitted_at":"2013-02-27T14:16:19Z","abstract_excerpt":"We introduce an approach to high-level conditional planning we call epsilon-safe planning.  This probabilistic approach commits us to planning to meet some specified goal with a probability of success of at least 1-epsilon for some user-supplied epsilon.  We describe several algorithms for epsilon-safe planning based on conditional planners. The two conditional planners we discuss are Peot and Smith's nonlinear conditional planner, CNLP, and our own linear conditional planner, PLINTH.  We present a straightforward extension to conditional planners for which computing the necessary probabilitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6810","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":""},"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":"1302.6810","created_at":"2026-05-18T03:32:18.638655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6810v1","created_at":"2026-05-18T03:32:18.638655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6810","created_at":"2026-05-18T03:32:18.638655+00:00"},{"alias_kind":"pith_short_12","alias_value":"3F3V6KMQ4NSA","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3F3V6KMQ4NSANF5H","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3F3V6KMQ","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4","json":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4.json","graph_json":"https://pith.science/api/pith-number/3F3V6KMQ4NSANF5HQIHUZUO2V4/graph.json","events_json":"https://pith.science/api/pith-number/3F3V6KMQ4NSANF5HQIHUZUO2V4/events.json","paper":"https://pith.science/paper/3F3V6KMQ"},"agent_actions":{"view_html":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4","download_json":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4.json","view_paper":"https://pith.science/paper/3F3V6KMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6810&json=true","fetch_graph":"https://pith.science/api/pith-number/3F3V6KMQ4NSANF5HQIHUZUO2V4/graph.json","fetch_events":"https://pith.science/api/pith-number/3F3V6KMQ4NSANF5HQIHUZUO2V4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4/action/storage_attestation","attest_author":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4/action/author_attestation","sign_citation":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4/action/citation_signature","submit_replication":"https://pith.science/pith/3F3V6KMQ4NSANF5HQIHUZUO2V4/action/replication_record"}},"created_at":"2026-05-18T03:32:18.638655+00:00","updated_at":"2026-05-18T03:32:18.638655+00:00"}