{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BXE5JGD4ITA4CTXWNZR5IAKFXT","short_pith_number":"pith:BXE5JGD4","schema_version":"1.0","canonical_sha256":"0dc9d4987c44c1c14ef66e63d40145bcf8a20470a14eb769e6674c475920cc5f","source":{"kind":"arxiv","id":"1705.08961","version":1},"attestation_state":"computed","paper":{"title":"Efficient, Safe, and Probably Approximately Complete Learning of Action Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brendan Juba, Roni Stern","submitted_at":"2017-05-24T20:38:52Z","abstract_excerpt":"In this paper we explore the theoretical boundaries of planning in a setting where no model of the agent's actions is given. Instead of an action model, a set of successfully executed plans are given and the task is to generate a plan that is safe, i.e., guaranteed to achieve the goal without failing.\nTo this end, we show how to learn a conservative model of the world in which actions are guaranteed to be applicable. This conservative model is then given to an off-the-shelf classical planner, resulting in a plan that is guaranteed to achieve the goal. However, this reduction from a model-free "},"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":"1705.08961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T20:38:52Z","cross_cats_sorted":[],"title_canon_sha256":"eefef79f39fa6498d701b5345c65647cc91f17288611eb0c9cda64946446a011","abstract_canon_sha256":"8b97e156b465663082c561a1af9ddca88734fa24bb9d63fea8fbb1631ff048bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:40.850599Z","signature_b64":"uMtSraFI1D2LE4giGkAZArSjocdQyXmagqGjjtMvrnd5zc2Va6Ih8SzJyYzbn+GISxAOBsRR7vSPpCXn7U7EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc9d4987c44c1c14ef66e63d40145bcf8a20470a14eb769e6674c475920cc5f","last_reissued_at":"2026-05-18T00:43:40.849974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:40.849974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient, Safe, and Probably Approximately Complete Learning of Action Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Brendan Juba, Roni Stern","submitted_at":"2017-05-24T20:38:52Z","abstract_excerpt":"In this paper we explore the theoretical boundaries of planning in a setting where no model of the agent's actions is given. Instead of an action model, a set of successfully executed plans are given and the task is to generate a plan that is safe, i.e., guaranteed to achieve the goal without failing.\nTo this end, we show how to learn a conservative model of the world in which actions are guaranteed to be applicable. This conservative model is then given to an off-the-shelf classical planner, resulting in a plan that is guaranteed to achieve the goal. However, this reduction from a model-free "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08961","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":"1705.08961","created_at":"2026-05-18T00:43:40.850066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08961v1","created_at":"2026-05-18T00:43:40.850066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08961","created_at":"2026-05-18T00:43:40.850066+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXE5JGD4ITA4","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXE5JGD4ITA4CTXW","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXE5JGD4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.16922","citing_title":"Agential AI for Integrated Continual Learning, Deliberative Behavior, and Comprehensible Models","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT","json":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT.json","graph_json":"https://pith.science/api/pith-number/BXE5JGD4ITA4CTXWNZR5IAKFXT/graph.json","events_json":"https://pith.science/api/pith-number/BXE5JGD4ITA4CTXWNZR5IAKFXT/events.json","paper":"https://pith.science/paper/BXE5JGD4"},"agent_actions":{"view_html":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT","download_json":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT.json","view_paper":"https://pith.science/paper/BXE5JGD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08961&json=true","fetch_graph":"https://pith.science/api/pith-number/BXE5JGD4ITA4CTXWNZR5IAKFXT/graph.json","fetch_events":"https://pith.science/api/pith-number/BXE5JGD4ITA4CTXWNZR5IAKFXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT/action/storage_attestation","attest_author":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT/action/author_attestation","sign_citation":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT/action/citation_signature","submit_replication":"https://pith.science/pith/BXE5JGD4ITA4CTXWNZR5IAKFXT/action/replication_record"}},"created_at":"2026-05-18T00:43:40.850066+00:00","updated_at":"2026-05-18T00:43:40.850066+00:00"}