{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BUM2NKX7JRETSRVCGIISCUXS7Q","short_pith_number":"pith:BUM2NKX7","canonical_record":{"source":{"id":"1712.00948","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-04T08:18:08Z","cross_cats_sorted":["cs.LG","cs.NE","cs.RO"],"title_canon_sha256":"fbb10d01a5dd5d055135f026fe7ffd3db0a63cd9ac5daae36b6ba68e8802d215","abstract_canon_sha256":"272203b977bd49d27e458055bb93729c3db164afea82f10525e6e95e11ff6eca"},"schema_version":"1.0"},"canonical_sha256":"0d19a6aaff4c493946a232112152f2fc038890a468ccfafb65d80bbe7ce68228","source":{"kind":"arxiv","id":"1712.00948","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00948","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00948v5","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00948","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"BUM2NKX7JRET","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"BUM2NKX7JRETSRVC","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"BUM2NKX7","created_at":"2026-07-05T00:02:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BUM2NKX7JRETSRVCGIISCUXS7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00948","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-04T08:18:08Z","cross_cats_sorted":["cs.LG","cs.NE","cs.RO"],"title_canon_sha256":"fbb10d01a5dd5d055135f026fe7ffd3db0a63cd9ac5daae36b6ba68e8802d215","abstract_canon_sha256":"272203b977bd49d27e458055bb93729c3db164afea82f10525e6e95e11ff6eca"},"schema_version":"1.0"},"canonical_sha256":"0d19a6aaff4c493946a232112152f2fc038890a468ccfafb65d80bbe7ce68228","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:10.773568Z","signature_b64":"lpq/uiqNtARs1FR6uHGkRLM/BnbZnh7ChlNazlUOe5eRKnw6fmCIWefVa2KDAsccwMXvM1d7teYNIMXlCJQIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d19a6aaff4c493946a232112152f2fc038890a468ccfafb65d80bbe7ce68228","last_reissued_at":"2026-07-05T00:02:10.773082Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:10.773082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00948","source_version":5,"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-07-05T00:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9VvWlu8qZlXpDw865HA/YxdMu4/3mW8D5ncvIUzqmMiW+0mWmWKbb4K8HhOxLmvYP/uv15LrVsjmNrWOxusDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:46:00.795164Z"},"content_sha256":"f4cb26960e98d001b79c7326f3400f894170ace0f9fd9dccd8d0bdd1c5a85615","schema_version":"1.0","event_id":"sha256:f4cb26960e98d001b79c7326f3400f894170ace0f9fd9dccd8d0bdd1c5a85615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BUM2NKX7JRETSRVCGIISCUXS7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Multi-Level Hierarchies with Hindsight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE","cs.RO"],"primary_cat":"cs.AI","authors_text":"Andrew Levy, George Konidaris, Kate Saenko, Robert Platt","submitted_at":"2017-12-04T08:18:08Z","abstract_excerpt":"Hierarchical agents have the potential to solve sequential decision making tasks with greater sample efficiency than their non-hierarchical counterparts because hierarchical agents can break down tasks into sets of subtasks that only require short sequences of decisions. In order to realize this potential of faster learning, hierarchical agents need to be able to learn their multiple levels of policies in parallel so these simpler subproblems can be solved simultaneously. Yet, learning multiple levels of policies in parallel is hard because it is inherently unstable: changes in a policy at one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00948","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.00948/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:02:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzi9kzhB2ifiemhRe89fjxlv3HAzhFY/bvDuGpUFF9RNaZwLH+ZMnecE9ITlPKw2bf2eUvWU9U/xZj7pQs8BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:46:00.795671Z"},"content_sha256":"242d74985ec6998ee7d41ac98ba774db74293ba2db7bed762465353513cdc7e5","schema_version":"1.0","event_id":"sha256:242d74985ec6998ee7d41ac98ba774db74293ba2db7bed762465353513cdc7e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/bundle.json","state_url":"https://pith.science/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/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-08-05T09:46:00Z","links":{"resolver":"https://pith.science/pith/BUM2NKX7JRETSRVCGIISCUXS7Q","bundle":"https://pith.science/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/bundle.json","state":"https://pith.science/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BUM2NKX7JRETSRVCGIISCUXS7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BUM2NKX7JRETSRVCGIISCUXS7Q","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":"272203b977bd49d27e458055bb93729c3db164afea82f10525e6e95e11ff6eca","cross_cats_sorted":["cs.LG","cs.NE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-04T08:18:08Z","title_canon_sha256":"fbb10d01a5dd5d055135f026fe7ffd3db0a63cd9ac5daae36b6ba68e8802d215"},"schema_version":"1.0","source":{"id":"1712.00948","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00948","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00948v5","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00948","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_12","alias_value":"BUM2NKX7JRET","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_16","alias_value":"BUM2NKX7JRETSRVC","created_at":"2026-07-05T00:02:10Z"},{"alias_kind":"pith_short_8","alias_value":"BUM2NKX7","created_at":"2026-07-05T00:02:10Z"}],"graph_snapshots":[{"event_id":"sha256:242d74985ec6998ee7d41ac98ba774db74293ba2db7bed762465353513cdc7e5","target":"graph","created_at":"2026-07-05T00:02:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1712.00948/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hierarchical agents have the potential to solve sequential decision making tasks with greater sample efficiency than their non-hierarchical counterparts because hierarchical agents can break down tasks into sets of subtasks that only require short sequences of decisions. In order to realize this potential of faster learning, hierarchical agents need to be able to learn their multiple levels of policies in parallel so these simpler subproblems can be solved simultaneously. Yet, learning multiple levels of policies in parallel is hard because it is inherently unstable: changes in a policy at one","authors_text":"Andrew Levy, George Konidaris, Kate Saenko, Robert Platt","cross_cats":["cs.LG","cs.NE","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-04T08:18:08Z","title":"Learning Multi-Level Hierarchies with Hindsight"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00948","kind":"arxiv","version":5},"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:f4cb26960e98d001b79c7326f3400f894170ace0f9fd9dccd8d0bdd1c5a85615","target":"record","created_at":"2026-07-05T00:02:10Z","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":"272203b977bd49d27e458055bb93729c3db164afea82f10525e6e95e11ff6eca","cross_cats_sorted":["cs.LG","cs.NE","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-04T08:18:08Z","title_canon_sha256":"fbb10d01a5dd5d055135f026fe7ffd3db0a63cd9ac5daae36b6ba68e8802d215"},"schema_version":"1.0","source":{"id":"1712.00948","kind":"arxiv","version":5}},"canonical_sha256":"0d19a6aaff4c493946a232112152f2fc038890a468ccfafb65d80bbe7ce68228","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d19a6aaff4c493946a232112152f2fc038890a468ccfafb65d80bbe7ce68228","first_computed_at":"2026-07-05T00:02:10.773082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:10.773082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpq/uiqNtARs1FR6uHGkRLM/BnbZnh7ChlNazlUOe5eRKnw6fmCIWefVa2KDAsccwMXvM1d7teYNIMXlCJQIBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:10.773568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00948","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4cb26960e98d001b79c7326f3400f894170ace0f9fd9dccd8d0bdd1c5a85615","sha256:242d74985ec6998ee7d41ac98ba774db74293ba2db7bed762465353513cdc7e5"],"state_sha256":"e1355cf05e091cf6e77b593278e5fa77f39f18d110a82ec9c0855e9ed5deaa6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2WHYL4B8qoQxncbGkdkZY4TjhIcl0ACxg1gixdN4Fm7SOyON0Ra7huIABXpIaTtb1xwa7w4aSpQklajzaavBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:46:00.800440Z","bundle_sha256":"c913bf37d3f28ff6eb6b387bd62cc68c42e3be7a5dad786280d7cd36ec96c4d8"}}