{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MYA4G52B424YCBDYWU3OQ6KTP6","short_pith_number":"pith:MYA4G52B","canonical_record":{"source":{"id":"1811.08275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-17T02:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"f2334e83ff9cb8f86f2965fb6dcf162eb6a0f95ca5c96c766b6b35be9f09b349","abstract_canon_sha256":"785d72e4285ef690dc105e164e8ed22c56a4513c1c22cbb94f222a71c263a9c6"},"schema_version":"1.0"},"canonical_sha256":"6601c37741e6b9810478b536e879537f8b552e532df85d182e839ae5e9b66111","source":{"kind":"arxiv","id":"1811.08275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08275","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08275v1","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08275","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"MYA4G52B424Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYA4G52B424YCBDY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYA4G52B","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MYA4G52B424YCBDYWU3OQ6KTP6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-17T02:09:35Z","cross_cats_sorted":[],"title_canon_sha256":"f2334e83ff9cb8f86f2965fb6dcf162eb6a0f95ca5c96c766b6b35be9f09b349","abstract_canon_sha256":"785d72e4285ef690dc105e164e8ed22c56a4513c1c22cbb94f222a71c263a9c6"},"schema_version":"1.0"},"canonical_sha256":"6601c37741e6b9810478b536e879537f8b552e532df85d182e839ae5e9b66111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:14.443091Z","signature_b64":"lgyrC4ciLXs8ABmCIuN1LIHFmRt6lyM8+wMIY7tUoWNW4uLP8fAxyWr/9hmICXRCnFPv/3RYQUOzHqOMCqd3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6601c37741e6b9810478b536e879537f8b552e532df85d182e839ae5e9b66111","last_reissued_at":"2026-05-18T00:00:14.442641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:14.442641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08275","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-18T00:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cgr3IVvZYDDACGqpLK3S+rhpIG5SaQqJwy9Ov/pT3EoBOygjok4gLbv0m12jhwHUZqRR6P193sAPlLYyPqXNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:32:46.771441Z"},"content_sha256":"a24f0a632885984397133518af48094f4260a68bcd5f6fceb09674a58d46ec6f","schema_version":"1.0","event_id":"sha256:a24f0a632885984397133518af48094f4260a68bcd5f6fceb09674a58d46ec6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MYA4G52B424YCBDYWU3OQ6KTP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autonomous Extraction of a Hierarchical Structure of Tasks in Reinforcement Learning, A Sequential Associate Rule Mining Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Behzad Ghazanfari, Fatemeh Afghah, Matthew E. Taylor","submitted_at":"2018-11-17T02:09:35Z","abstract_excerpt":"Reinforcement learning (RL) techniques, while often powerful, can suffer from slow learning speeds, particularly in high dimensional spaces. Decomposition of tasks into a hierarchical structure holds the potential to significantly speed up learning, generalization, and transfer learning. However, the current task decomposition techniques often rely on high-level knowledge provided by an expert (e.g. using dynamic Bayesian networks) to extract a hierarchical task structure; which is not necessarily available in autonomous systems. In this paper, we propose a novel method based on Sequential Ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08275","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-18T00:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5Yl6+o00UL9jszxayIHjvCXxGcAM6VtNLjcCtkpvoTxt6WgH62zFlz+iS8DRTGLYoGKrWPK6pVCTqFD8lC+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:32:46.772172Z"},"content_sha256":"2bf44f8504535dab76987e07a227452e56bf0931d921cff7981c3fc7c9c258aa","schema_version":"1.0","event_id":"sha256:2bf44f8504535dab76987e07a227452e56bf0931d921cff7981c3fc7c9c258aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYA4G52B424YCBDYWU3OQ6KTP6/bundle.json","state_url":"https://pith.science/pith/MYA4G52B424YCBDYWU3OQ6KTP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYA4G52B424YCBDYWU3OQ6KTP6/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-30T09:32:46Z","links":{"resolver":"https://pith.science/pith/MYA4G52B424YCBDYWU3OQ6KTP6","bundle":"https://pith.science/pith/MYA4G52B424YCBDYWU3OQ6KTP6/bundle.json","state":"https://pith.science/pith/MYA4G52B424YCBDYWU3OQ6KTP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYA4G52B424YCBDYWU3OQ6KTP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MYA4G52B424YCBDYWU3OQ6KTP6","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":"785d72e4285ef690dc105e164e8ed22c56a4513c1c22cbb94f222a71c263a9c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-17T02:09:35Z","title_canon_sha256":"f2334e83ff9cb8f86f2965fb6dcf162eb6a0f95ca5c96c766b6b35be9f09b349"},"schema_version":"1.0","source":{"id":"1811.08275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08275","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08275v1","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08275","created_at":"2026-05-18T00:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"MYA4G52B424Y","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MYA4G52B424YCBDY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MYA4G52B","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2bf44f8504535dab76987e07a227452e56bf0931d921cff7981c3fc7c9c258aa","target":"graph","created_at":"2026-05-18T00:00:14Z","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":"Reinforcement learning (RL) techniques, while often powerful, can suffer from slow learning speeds, particularly in high dimensional spaces. Decomposition of tasks into a hierarchical structure holds the potential to significantly speed up learning, generalization, and transfer learning. However, the current task decomposition techniques often rely on high-level knowledge provided by an expert (e.g. using dynamic Bayesian networks) to extract a hierarchical task structure; which is not necessarily available in autonomous systems. In this paper, we propose a novel method based on Sequential Ass","authors_text":"Behzad Ghazanfari, Fatemeh Afghah, Matthew E. Taylor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-17T02:09:35Z","title":"Autonomous Extraction of a Hierarchical Structure of Tasks in Reinforcement Learning, A Sequential Associate Rule Mining Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08275","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:a24f0a632885984397133518af48094f4260a68bcd5f6fceb09674a58d46ec6f","target":"record","created_at":"2026-05-18T00:00:14Z","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":"785d72e4285ef690dc105e164e8ed22c56a4513c1c22cbb94f222a71c263a9c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-17T02:09:35Z","title_canon_sha256":"f2334e83ff9cb8f86f2965fb6dcf162eb6a0f95ca5c96c766b6b35be9f09b349"},"schema_version":"1.0","source":{"id":"1811.08275","kind":"arxiv","version":1}},"canonical_sha256":"6601c37741e6b9810478b536e879537f8b552e532df85d182e839ae5e9b66111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6601c37741e6b9810478b536e879537f8b552e532df85d182e839ae5e9b66111","first_computed_at":"2026-05-18T00:00:14.442641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:14.442641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lgyrC4ciLXs8ABmCIuN1LIHFmRt6lyM8+wMIY7tUoWNW4uLP8fAxyWr/9hmICXRCnFPv/3RYQUOzHqOMCqd3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:14.443091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a24f0a632885984397133518af48094f4260a68bcd5f6fceb09674a58d46ec6f","sha256:2bf44f8504535dab76987e07a227452e56bf0931d921cff7981c3fc7c9c258aa"],"state_sha256":"f9a4bb0e46a1820c18d39e299bff29da51f9e8da0ec3fee0a0da9b0ec9ba6256"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irhcshgyj8gTNWEk+SkcUNyVP0Olb/nmNVGc1f4CppbRZEHqkFmT/KqNf0SVQz+eubHWxHKcukv8qA//dfAFDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:32:46.776260Z","bundle_sha256":"01abfa66b7357e0090acd758d13fd222af11d00947bcfee61051b78ca65937b9"}}