{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SYKLH5SMEP3Z2E64WAWIK75KO7","short_pith_number":"pith:SYKLH5SM","schema_version":"1.0","canonical_sha256":"9614b3f64c23f79d13dcb02c857faa77ecc9b6ea8c042c2ecbcaefdad7256c87","source":{"kind":"arxiv","id":"1609.05524","version":3},"attestation_state":"computed","paper":{"title":"Principled Option Learning in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michal Moshkovitz, Naftali Tishby, Roy Fox","submitted_at":"2016-09-18T18:19:02Z","abstract_excerpt":"It is well known that options can make planning more efficient, among their many benefits. Thus far, algorithms for autonomously discovering a set of useful options were heuristic. Naturally, a principled way of finding a set of useful options may be more promising and insightful. In this paper we suggest a mathematical characterization of good sets of options using tools from information theory. This characterization enables us to find conditions for a set of options to be optimal and an algorithm that outputs a useful set of options and illustrate the proposed algorithm in simulation."},"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":"1609.05524","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-18T18:19:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e8df9732f7e791166b3b975e6b0b33d1bd157a26ba4ecc7bf70f1d6cf210f566","abstract_canon_sha256":"b2a6d6f8d471e2dd79d2f199d144b4859686c2e6e57b36b7609c0aad2d79b933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:45.258643Z","signature_b64":"kxCMY1sUqICdjrjEg3egu3yVYJ+eALcUBDWHnxHZGVEpI5wxN6rYU1zsWx8j99klCvkc2fDjX7nJN1i9aNZVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9614b3f64c23f79d13dcb02c857faa77ecc9b6ea8c042c2ecbcaefdad7256c87","last_reissued_at":"2026-05-18T00:24:45.257967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:45.257967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Principled Option Learning in Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michal Moshkovitz, Naftali Tishby, Roy Fox","submitted_at":"2016-09-18T18:19:02Z","abstract_excerpt":"It is well known that options can make planning more efficient, among their many benefits. Thus far, algorithms for autonomously discovering a set of useful options were heuristic. Naturally, a principled way of finding a set of useful options may be more promising and insightful. In this paper we suggest a mathematical characterization of good sets of options using tools from information theory. This characterization enables us to find conditions for a set of options to be optimal and an algorithm that outputs a useful set of options and illustrate the proposed algorithm in simulation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05524","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":"1609.05524","created_at":"2026-05-18T00:24:45.258065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05524v3","created_at":"2026-05-18T00:24:45.258065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05524","created_at":"2026-05-18T00:24:45.258065+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYKLH5SMEP3Z","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYKLH5SMEP3Z2E64","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYKLH5SM","created_at":"2026-05-18T12:30:44.179134+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/SYKLH5SMEP3Z2E64WAWIK75KO7","json":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7.json","graph_json":"https://pith.science/api/pith-number/SYKLH5SMEP3Z2E64WAWIK75KO7/graph.json","events_json":"https://pith.science/api/pith-number/SYKLH5SMEP3Z2E64WAWIK75KO7/events.json","paper":"https://pith.science/paper/SYKLH5SM"},"agent_actions":{"view_html":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7","download_json":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7.json","view_paper":"https://pith.science/paper/SYKLH5SM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05524&json=true","fetch_graph":"https://pith.science/api/pith-number/SYKLH5SMEP3Z2E64WAWIK75KO7/graph.json","fetch_events":"https://pith.science/api/pith-number/SYKLH5SMEP3Z2E64WAWIK75KO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7/action/storage_attestation","attest_author":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7/action/author_attestation","sign_citation":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7/action/citation_signature","submit_replication":"https://pith.science/pith/SYKLH5SMEP3Z2E64WAWIK75KO7/action/replication_record"}},"created_at":"2026-05-18T00:24:45.258065+00:00","updated_at":"2026-05-18T00:24:45.258065+00:00"}