{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PMLFED6NMW7RGKEMNJ5MV3SNQJ","short_pith_number":"pith:PMLFED6N","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"},"canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","source":{"kind":"arxiv","id":"1810.07311","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07311","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07311v3","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07311","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"PMLFED6NMW7R","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PMLFED6NMW7RGKEM","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PMLFED6N","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PMLFED6NMW7RGKEMNJ5MV3SNQJ","target":"record","payload":{"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"},"canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","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"},"source_kind":"arxiv","source_id":"1810.07311","source_version":3,"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:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fMyAH9Joel5w/Gd7MEBVyO3b5aSlRkYsxBsordMPwsch1bLe+dbcFEELgsK0+ZVxAN05/NLTwMivdtnqTE5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:23:34.997897Z"},"content_sha256":"92932165d196a7d551b19ed5ace24865879a6cb8656136c4ed25672583539a66","schema_version":"1.0","event_id":"sha256:92932165d196a7d551b19ed5ace24865879a6cb8656136c4ed25672583539a66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PMLFED6NMW7RGKEMNJ5MV3SNQJ","target":"graph","payload":{"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"},"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:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHuZrgG12/vko44Tq8T5sS5CLXtuKkM5U7MeMx2xFCSRDZ0lJdX3m5bU9/qL8u/UJL3imjT1j7pxK1MFd6zvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:23:34.998250Z"},"content_sha256":"0b76137cd7c9373c93afcf1c0901a975a1beafeeda7102314942ff93f012168c","schema_version":"1.0","event_id":"sha256:0b76137cd7c9373c93afcf1c0901a975a1beafeeda7102314942ff93f012168c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/bundle.json","state_url":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/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-28T07:23:34Z","links":{"resolver":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ","bundle":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/bundle.json","state":"https://pith.science/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMLFED6NMW7RGKEMNJ5MV3SNQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PMLFED6NMW7RGKEMNJ5MV3SNQJ","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":"1d2af2246ecd0846eb435258126a43e8684114260c879dfd6db914dd91653e6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-16T23:24:18Z","title_canon_sha256":"e701455a4513b08cff33d69aef065c056f712a7907c95f1b2ed647056e19a0cd"},"schema_version":"1.0","source":{"id":"1810.07311","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07311","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07311v3","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07311","created_at":"2026-05-17T23:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"PMLFED6NMW7R","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PMLFED6NMW7RGKEM","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PMLFED6N","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:0b76137cd7c9373c93afcf1c0901a975a1beafeeda7102314942ff93f012168c","target":"graph","created_at":"2026-05-17T23:51:09Z","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":"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","authors_text":"David Abel, D Ellis Hershkowitz, George Konidaris, Michael Littman, Yuu Jinnai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-16T23:24:18Z","title":"Finding Options that Minimize Planning Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07311","kind":"arxiv","version":3},"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:92932165d196a7d551b19ed5ace24865879a6cb8656136c4ed25672583539a66","target":"record","created_at":"2026-05-17T23:51:09Z","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":"1d2af2246ecd0846eb435258126a43e8684114260c879dfd6db914dd91653e6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-10-16T23:24:18Z","title_canon_sha256":"e701455a4513b08cff33d69aef065c056f712a7907c95f1b2ed647056e19a0cd"},"schema_version":"1.0","source":{"id":"1810.07311","kind":"arxiv","version":3}},"canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b16520fcd65bf13288c6a7acaee4d82718f62183f91cf6903ca679f26288192","first_computed_at":"2026-05-17T23:51:09.550218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:09.550218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3gh0+sMZb0tPfQRgavKdIfT/rGz2sb8LS/M67E0O3MrYVQk3Hs7c8j86wEOS4g2AcXB0ejCLlRhlpuYYAI7Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:09.550928Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07311","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92932165d196a7d551b19ed5ace24865879a6cb8656136c4ed25672583539a66","sha256:0b76137cd7c9373c93afcf1c0901a975a1beafeeda7102314942ff93f012168c"],"state_sha256":"f064a0cd01da4caf9700e00df22c8798c67fdbbac48f4708955200372299f75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHt8QJGBPv0RIcUWNuuHI2yiRnoGxk6cTHqrhdIPCUqNKJhyfs2b14kxAM2jkHRNtVyNP//IjYpFOoO4lfKvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:23:35.000375Z","bundle_sha256":"bf7b2b4f91cf12be2f57b6624bcef1734ca2016c55ea55200c407ed817804298"}}