{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6VIB6KTD5BCU7QALNKL3XOBTJ2","short_pith_number":"pith:6VIB6KTD","canonical_record":{"source":{"id":"1206.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"c36a8ed735c5c8d38c7ae3da7edde922754048fa10c48c093908cf6949485d79","abstract_canon_sha256":"e0c6ee865755b6ff40a55b695c280a2499fb05618470d587d741a9a5ad319224"},"schema_version":"1.0"},"canonical_sha256":"f5501f2a63e8454fc00b6a97bbb8334e9c8d435ceb30b8c5bf5ad3bb3708d6ed","source":{"kind":"arxiv","id":"1206.3291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3291","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3291v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3291","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"6VIB6KTD5BCU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6VIB6KTD5BCU7QAL","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6VIB6KTD","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6VIB6KTD5BCU7QALNKL3XOBTJ2","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:51:21Z","cross_cats_sorted":[],"title_canon_sha256":"c36a8ed735c5c8d38c7ae3da7edde922754048fa10c48c093908cf6949485d79","abstract_canon_sha256":"e0c6ee865755b6ff40a55b695c280a2499fb05618470d587d741a9a5ad319224"},"schema_version":"1.0"},"canonical_sha256":"f5501f2a63e8454fc00b6a97bbb8334e9c8d435ceb30b8c5bf5ad3bb3708d6ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.701105Z","signature_b64":"B4vZYxG0PcE2P3R/OuKEX9WCLP0gm6r6cxL5tBVmz/qgX9ouxKXQqwuaqUsySlK//s2Wv258Neg2PytTJsOMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5501f2a63e8454fc00b6a97bbb8334e9c8d435ceb30b8c5bf5ad3bb3708d6ed","last_reissued_at":"2026-05-18T03:53:30.700431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.700431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3291","source_version":1,"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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOllTPhk39xjHkqn4aWVGHJ/T2nyCgC5ju0MX4Ov1QWPjYmlMu40YSjjxfYCytE7g1ditgzt1mM08INNLZLTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:34.541715Z"},"content_sha256":"a223fa15185025cae66640db90485ec6789de60919db39da02f2f923ee51cc6e","schema_version":"1.0","event_id":"sha256:a223fa15185025cae66640db90485ec6789de60919db39da02f2f923ee51cc6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6VIB6KTD5BCU7QALNKL3XOBTJ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical POMDP Controller Optimization by Likelihood Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Laurent Charlin, Marc Toussaint, Pascal Poupart","submitted_at":"2012-06-13T15:51:21Z","abstract_excerpt":"Planning can often be simpli ed by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be framed as a non-convex optimization problem. However, the inherent computational di culty of solving such an optimization problem makes it hard to scale to realworld problems. In another line of research, Toussaint et al. [18] developed a method to solve planning problems by maximumlikelihood estimation. In this paper, we show how the hierarchy discovery problem in partially observable domains can be tackled using a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3291","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"},"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-18T03:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGpEz+00iABrCjtB0FuPBnk6ixk8ECIUcqdLhDWS5RTmrDOpr0qaPk0TisI27arwwgQdXSrsHA7rLsNVJxy+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:30:34.542069Z"},"content_sha256":"ad36c1f933770c040b4a55e7ab1f0d20295711119757b466392758143cfda3ad","schema_version":"1.0","event_id":"sha256:ad36c1f933770c040b4a55e7ab1f0d20295711119757b466392758143cfda3ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/bundle.json","state_url":"https://pith.science/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/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-27T08:30:34Z","links":{"resolver":"https://pith.science/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2","bundle":"https://pith.science/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/bundle.json","state":"https://pith.science/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VIB6KTD5BCU7QALNKL3XOBTJ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6VIB6KTD5BCU7QALNKL3XOBTJ2","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":"e0c6ee865755b6ff40a55b695c280a2499fb05618470d587d741a9a5ad319224","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:51:21Z","title_canon_sha256":"c36a8ed735c5c8d38c7ae3da7edde922754048fa10c48c093908cf6949485d79"},"schema_version":"1.0","source":{"id":"1206.3291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3291","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3291v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3291","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"6VIB6KTD5BCU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6VIB6KTD5BCU7QAL","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6VIB6KTD","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:ad36c1f933770c040b4a55e7ab1f0d20295711119757b466392758143cfda3ad","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"Planning can often be simpli ed by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be framed as a non-convex optimization problem. However, the inherent computational di culty of solving such an optimization problem makes it hard to scale to realworld problems. In another line of research, Toussaint et al. [18] developed a method to solve planning problems by maximumlikelihood estimation. In this paper, we show how the hierarchy discovery problem in partially observable domains can be tackled using a s","authors_text":"Laurent Charlin, Marc Toussaint, Pascal Poupart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:51:21Z","title":"Hierarchical POMDP Controller Optimization by Likelihood Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3291","kind":"arxiv","version":1},"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:a223fa15185025cae66640db90485ec6789de60919db39da02f2f923ee51cc6e","target":"record","created_at":"2026-05-18T03:53:30Z","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":"e0c6ee865755b6ff40a55b695c280a2499fb05618470d587d741a9a5ad319224","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:51:21Z","title_canon_sha256":"c36a8ed735c5c8d38c7ae3da7edde922754048fa10c48c093908cf6949485d79"},"schema_version":"1.0","source":{"id":"1206.3291","kind":"arxiv","version":1}},"canonical_sha256":"f5501f2a63e8454fc00b6a97bbb8334e9c8d435ceb30b8c5bf5ad3bb3708d6ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5501f2a63e8454fc00b6a97bbb8334e9c8d435ceb30b8c5bf5ad3bb3708d6ed","first_computed_at":"2026-05-18T03:53:30.700431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.700431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4vZYxG0PcE2P3R/OuKEX9WCLP0gm6r6cxL5tBVmz/qgX9ouxKXQqwuaqUsySlK//s2Wv258Neg2PytTJsOMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.701105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a223fa15185025cae66640db90485ec6789de60919db39da02f2f923ee51cc6e","sha256:ad36c1f933770c040b4a55e7ab1f0d20295711119757b466392758143cfda3ad"],"state_sha256":"d846511f999f58d63e25610142ab21503b6a2e8f5ab64125f58856068a1d6265"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGSXB07tlelErcjkrm3YawYciWLCObBA3W67BomFUTCfxFWYUYpYIEjRb3hFzRMcNqaWjMrgF9P169jsf7APBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:30:34.544177Z","bundle_sha256":"dac1d779cb7a3b7f63711ce21852334c03d64a603f1cd926bfac7b3b607a47ae"}}