{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3TSGKDWIUSUVEIBW4ERPTPKOMQ","short_pith_number":"pith:3TSGKDWI","canonical_record":{"source":{"id":"2201.09653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T13:18:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"283e4c9ab6dc1eb0af0e59ff563ecc39fe25302f5702c44495d12d4e25959458","abstract_canon_sha256":"c65ab61e76248744fb77f5a57d5a8bd5a12831bdd19c160a37ac51b5a708ea05"},"schema_version":"1.0"},"canonical_sha256":"dce4650ec8a4a9522036e122f9bd4e6413d1e08827c0c04e5231f3710ee288bb","source":{"kind":"arxiv","id":"2201.09653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09653","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09653v1","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09653","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"3TSGKDWIUSUV","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_16","alias_value":"3TSGKDWIUSUVEIBW","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_8","alias_value":"3TSGKDWI","created_at":"2026-07-05T03:50:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3TSGKDWIUSUVEIBW4ERPTPKOMQ","target":"record","payload":{"canonical_record":{"source":{"id":"2201.09653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T13:18:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"283e4c9ab6dc1eb0af0e59ff563ecc39fe25302f5702c44495d12d4e25959458","abstract_canon_sha256":"c65ab61e76248744fb77f5a57d5a8bd5a12831bdd19c160a37ac51b5a708ea05"},"schema_version":"1.0"},"canonical_sha256":"dce4650ec8a4a9522036e122f9bd4e6413d1e08827c0c04e5231f3710ee288bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:59.645389Z","signature_b64":"SoR/ZdOBqSO6Bkwp2ZayaaAJmrG0tmkUPE8/ud/DPYdeJDYsNSxUp7oLSmFiqir4X0IMY0OoJH8d1QyEi9OyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dce4650ec8a4a9522036e122f9bd4e6413d1e08827c0c04e5231f3710ee288bb","last_reissued_at":"2026-07-05T03:50:59.644988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:59.644988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.09653","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-07-05T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWfOeXvti6+5RQFVZdLN/Jx/re3cGWdqdjDOPj7NJSZxKNqf4RZZYvn6J7j0DmuHW9FIvRoU+jysiXyZ5Bi/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:45:06.794353Z"},"content_sha256":"79b84d34351cae22cb1a57ce8658c640436cf8dc28e5f9af533651c6be75e82e","schema_version":"1.0","event_id":"sha256:79b84d34351cae22cb1a57ce8658c640436cf8dc28e5f9af533651c6be75e82e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3TSGKDWIUSUVEIBW4ERPTPKOMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Paradox of Choice: Using Attention in Hierarchical Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrei Nica, Doina Precup, Khimya Khetarpal","submitted_at":"2022-01-24T13:18:02Z","abstract_excerpt":"Decision-making AI agents are often faced with two important challenges: the depth of the planning horizon, and the branching factor due to having many choices. Hierarchical reinforcement learning methods aim to solve the first problem, by providing shortcuts that skip over multiple time steps. To cope with the breadth, it is desirable to restrict the agent's attention at each step to a reasonable number of possible choices. The concept of affordances (Gibson, 1977) suggests that only certain actions are feasible in certain states. In this work, we model \"affordances\" through an attention mech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09653","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.09653/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-05T03:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxh/CjbkqxeR9/TtbEuKshDi7iI6nZuF2z0c1JvnKP+upVXmKKYq9CJgdpyWUXHRDq32NGpHXDsZtexIkNSCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T06:45:06.794865Z"},"content_sha256":"c653d60029a450c25545b489ed685aa153bbae2b5c39bd4f41b1eb2fbacb51d9","schema_version":"1.0","event_id":"sha256:c653d60029a450c25545b489ed685aa153bbae2b5c39bd4f41b1eb2fbacb51d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/bundle.json","state_url":"https://pith.science/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/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-06T06:45:06Z","links":{"resolver":"https://pith.science/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ","bundle":"https://pith.science/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/bundle.json","state":"https://pith.science/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TSGKDWIUSUVEIBW4ERPTPKOMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3TSGKDWIUSUVEIBW4ERPTPKOMQ","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":"c65ab61e76248744fb77f5a57d5a8bd5a12831bdd19c160a37ac51b5a708ea05","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T13:18:02Z","title_canon_sha256":"283e4c9ab6dc1eb0af0e59ff563ecc39fe25302f5702c44495d12d4e25959458"},"schema_version":"1.0","source":{"id":"2201.09653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.09653","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"2201.09653v1","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09653","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"3TSGKDWIUSUV","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_16","alias_value":"3TSGKDWIUSUVEIBW","created_at":"2026-07-05T03:50:59Z"},{"alias_kind":"pith_short_8","alias_value":"3TSGKDWI","created_at":"2026-07-05T03:50:59Z"}],"graph_snapshots":[{"event_id":"sha256:c653d60029a450c25545b489ed685aa153bbae2b5c39bd4f41b1eb2fbacb51d9","target":"graph","created_at":"2026-07-05T03:50:59Z","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/2201.09653/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision-making AI agents are often faced with two important challenges: the depth of the planning horizon, and the branching factor due to having many choices. Hierarchical reinforcement learning methods aim to solve the first problem, by providing shortcuts that skip over multiple time steps. To cope with the breadth, it is desirable to restrict the agent's attention at each step to a reasonable number of possible choices. The concept of affordances (Gibson, 1977) suggests that only certain actions are feasible in certain states. In this work, we model \"affordances\" through an attention mech","authors_text":"Andrei Nica, Doina Precup, Khimya Khetarpal","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T13:18:02Z","title":"The Paradox of Choice: Using Attention in Hierarchical Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09653","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:79b84d34351cae22cb1a57ce8658c640436cf8dc28e5f9af533651c6be75e82e","target":"record","created_at":"2026-07-05T03:50:59Z","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":"c65ab61e76248744fb77f5a57d5a8bd5a12831bdd19c160a37ac51b5a708ea05","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-24T13:18:02Z","title_canon_sha256":"283e4c9ab6dc1eb0af0e59ff563ecc39fe25302f5702c44495d12d4e25959458"},"schema_version":"1.0","source":{"id":"2201.09653","kind":"arxiv","version":1}},"canonical_sha256":"dce4650ec8a4a9522036e122f9bd4e6413d1e08827c0c04e5231f3710ee288bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dce4650ec8a4a9522036e122f9bd4e6413d1e08827c0c04e5231f3710ee288bb","first_computed_at":"2026-07-05T03:50:59.644988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:59.644988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SoR/ZdOBqSO6Bkwp2ZayaaAJmrG0tmkUPE8/ud/DPYdeJDYsNSxUp7oLSmFiqir4X0IMY0OoJH8d1QyEi9OyAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:59.645389Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.09653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79b84d34351cae22cb1a57ce8658c640436cf8dc28e5f9af533651c6be75e82e","sha256:c653d60029a450c25545b489ed685aa153bbae2b5c39bd4f41b1eb2fbacb51d9"],"state_sha256":"35f3139de208cf9097055b61cdeda7dccfb3983a6e2308ab1911f73086ff729c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJMTMPO8QMo52wTFaAwo117Bwk7yxBOQutVgdJ/ed1GkX9CNYZZ86omM1juhhchEd6JFq134h9I4nonixgVAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T06:45:06.799347Z","bundle_sha256":"7b16a38d99545d8b6affb17686020547658c37e08cdf88875336507bc32b0ce0"}}