{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PMLFED6NMW7RGKEMNJ5MV3SNQJ","short_pith_number":"pith:PMLFED6N","schema_version":"1.0","canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","source":{"kind":"arxiv","id":"1810.07311","version":3},"attestation_state":"computed","paper":{"title":"Finding Options that Minimize Planning Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Abel, D Ellis Hershkowitz, George Konidaris, Michael Littman, Yuu Jinnai","submitted_at":"2018-10-16T23:24:18Z","abstract_excerpt":"We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem is NP-hard, even if the task is constrained to be deterministic---the first such complexity result for option discovery. We then present the first polynomial-time boundedly suboptimal approximation algorithm for this setting, and empirically evaluate it against both the optimal options and a representative collection of heuristic approaches in simple grid-b"},"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":"1810.07311","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-16T23:24:18Z","cross_cats_sorted":[],"title_canon_sha256":"e701455a4513b08cff33d69aef065c056f712a7907c95f1b2ed647056e19a0cd","abstract_canon_sha256":"1d2af2246ecd0846eb435258126a43e8684114260c879dfd6db914dd91653e6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:09.550928Z","signature_b64":"y3gh0+sMZb0tPfQRgavKdIfT/rGz2sb8LS/M67E0O3MrYVQk3Hs7c8j86wEOS4g2AcXB0ejCLlRhlpuYYAI7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","last_reissued_at":"2026-05-17T23:51:09.550218Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:09.550218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Options that Minimize Planning Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Abel, D Ellis Hershkowitz, George Konidaris, Michael Littman, Yuu Jinnai","submitted_at":"2018-10-16T23:24:18Z","abstract_excerpt":"We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem is NP-hard, even if the task is constrained to be deterministic---the first such complexity result for option discovery. We then present the first polynomial-time boundedly suboptimal approximation algorithm for this setting, and empirically evaluate it against both the optimal options and a representative collection of heuristic approaches in simple grid-b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07311","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":""},"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":"1810.07311","created_at":"2026-05-17T23:51:09.550330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07311v3","created_at":"2026-05-17T23:51:09.550330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07311","created_at":"2026-05-17T23:51:09.550330+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMLFED6NMW7R","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMLFED6NMW7RGKEM","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMLFED6N","created_at":"2026-05-18T12:32:46.962924+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/PMLFED6NMW7RGKEMNJ5MV3SNQJ","json":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ.json","graph_json":"https://pith.science/api/pith-number/PMLFED6NMW7RGKEMNJ5MV3SNQJ/graph.json","events_json":"https://pith.science/api/pith-number/PMLFED6NMW7RGKEMNJ5MV3SNQJ/events.json","paper":"https://pith.science/paper/PMLFED6N"},"agent_actions":{"view_html":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ","download_json":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ.json","view_paper":"https://pith.science/paper/PMLFED6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07311&json=true","fetch_graph":"https://pith.science/api/pith-number/PMLFED6NMW7RGKEMNJ5MV3SNQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PMLFED6NMW7RGKEMNJ5MV3SNQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/action/storage_attestation","attest_author":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/action/author_attestation","sign_citation":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/action/citation_signature","submit_replication":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/action/replication_record"}},"created_at":"2026-05-17T23:51:09.550330+00:00","updated_at":"2026-05-17T23:51:09.550330+00:00"}