{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QY34OTDWF2QJDE4YCNFLCURACM","short_pith_number":"pith:QY34OTDW","canonical_record":{"source":{"id":"1709.04579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-14T01:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"4f0cd73f0c2daf1403c9256ecdd706eaee11a79919e41c74df6824ec48b43d48","abstract_canon_sha256":"cd71a5017c5097536dea5198f3f13b50f4480957d4831e92018fe272a1d23b7e"},"schema_version":"1.0"},"canonical_sha256":"8637c74c762ea0919398134ab15220131d2c1c654f36b7a5e5f4c9e6b071f769","source":{"kind":"arxiv","id":"1709.04579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04579","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04579v2","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04579","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"pith_short_12","alias_value":"QY34OTDWF2QJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY34OTDWF2QJDE4Y","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY34OTDW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QY34OTDWF2QJDE4YCNFLCURACM","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-14T01:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"4f0cd73f0c2daf1403c9256ecdd706eaee11a79919e41c74df6824ec48b43d48","abstract_canon_sha256":"cd71a5017c5097536dea5198f3f13b50f4480957d4831e92018fe272a1d23b7e"},"schema_version":"1.0"},"canonical_sha256":"8637c74c762ea0919398134ab15220131d2c1c654f36b7a5e5f4c9e6b071f769","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:08.814138Z","signature_b64":"r7giwPx7HpL9vYAtC7iIPCaZtgB8tF5614fWjaQ2ktuD7Ge09uwzF1YhuT+nPWSA2gbqY/5bvJtp/1VA2rGSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8637c74c762ea0919398134ab15220131d2c1c654f36b7a5e5f4c9e6b071f769","last_reissued_at":"2026-05-18T00:35:08.813751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:08.813751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04579","source_version":2,"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:35:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtIc5Fw9GtnhQLrggvJZeCrwd4xplRCzjZoyZk+HZL3J3mfSAgm6n6Ff4nC8wo/tgU5SU8KPd2FZ4MeivxMMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:10:31.869296Z"},"content_sha256":"69b6d7557a30dc050cab2b2938ff0ed76fcdbbecb74425752f2c166fa182e730","schema_version":"1.0","event_id":"sha256:69b6d7557a30dc050cab2b2938ff0ed76fcdbbecb74425752f2c166fa182e730"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QY34OTDWF2QJDE4YCNFLCURACM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autonomous Extracting a Hierarchical Structure of Tasks in Reinforcement Learning and Multi-task Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Behzad Ghazanfari, Matthew E. Taylor","submitted_at":"2017-09-14T01:43:13Z","abstract_excerpt":"Reinforcement learning (RL), while often powerful, can suffer from slow learning speeds, particularly in high dimensional spaces. The autonomous decomposition of tasks and use of hierarchical methods hold the potential to significantly speed up learning in such domains. This paper proposes a novel practical method that can autonomously decompose tasks, by leveraging association rule mining, which discovers hidden relationship among entities in data mining. We introduce a novel method called ARM-HSTRL (Association Rule Mining to extract Hierarchical Structure of Tasks in Reinforcement Learning)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04579","kind":"arxiv","version":2},"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:35:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyEQRrhDkIxvvF6x/BMQirAjVUylGXNL84Y+YTmyOKBBjLJDYISPMNj4wHwjV91fekZHfEVb/BKLep3cLq+LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:10:31.869677Z"},"content_sha256":"c25b7c5266e9ce7a0381dca51b4b8b5f93704cca219770c952ce7f57424acb5b","schema_version":"1.0","event_id":"sha256:c25b7c5266e9ce7a0381dca51b4b8b5f93704cca219770c952ce7f57424acb5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QY34OTDWF2QJDE4YCNFLCURACM/bundle.json","state_url":"https://pith.science/pith/QY34OTDWF2QJDE4YCNFLCURACM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QY34OTDWF2QJDE4YCNFLCURACM/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-30T13:10:31Z","links":{"resolver":"https://pith.science/pith/QY34OTDWF2QJDE4YCNFLCURACM","bundle":"https://pith.science/pith/QY34OTDWF2QJDE4YCNFLCURACM/bundle.json","state":"https://pith.science/pith/QY34OTDWF2QJDE4YCNFLCURACM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QY34OTDWF2QJDE4YCNFLCURACM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QY34OTDWF2QJDE4YCNFLCURACM","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":"cd71a5017c5097536dea5198f3f13b50f4480957d4831e92018fe272a1d23b7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-14T01:43:13Z","title_canon_sha256":"4f0cd73f0c2daf1403c9256ecdd706eaee11a79919e41c74df6824ec48b43d48"},"schema_version":"1.0","source":{"id":"1709.04579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04579","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04579v2","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04579","created_at":"2026-05-18T00:35:08Z"},{"alias_kind":"pith_short_12","alias_value":"QY34OTDWF2QJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QY34OTDWF2QJDE4Y","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QY34OTDW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c25b7c5266e9ce7a0381dca51b4b8b5f93704cca219770c952ce7f57424acb5b","target":"graph","created_at":"2026-05-18T00:35:08Z","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), while often powerful, can suffer from slow learning speeds, particularly in high dimensional spaces. The autonomous decomposition of tasks and use of hierarchical methods hold the potential to significantly speed up learning in such domains. This paper proposes a novel practical method that can autonomously decompose tasks, by leveraging association rule mining, which discovers hidden relationship among entities in data mining. We introduce a novel method called ARM-HSTRL (Association Rule Mining to extract Hierarchical Structure of Tasks in Reinforcement Learning)","authors_text":"Behzad Ghazanfari, Matthew E. Taylor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-14T01:43:13Z","title":"Autonomous Extracting a Hierarchical Structure of Tasks in Reinforcement Learning and Multi-task Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04579","kind":"arxiv","version":2},"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:69b6d7557a30dc050cab2b2938ff0ed76fcdbbecb74425752f2c166fa182e730","target":"record","created_at":"2026-05-18T00:35:08Z","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":"cd71a5017c5097536dea5198f3f13b50f4480957d4831e92018fe272a1d23b7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-14T01:43:13Z","title_canon_sha256":"4f0cd73f0c2daf1403c9256ecdd706eaee11a79919e41c74df6824ec48b43d48"},"schema_version":"1.0","source":{"id":"1709.04579","kind":"arxiv","version":2}},"canonical_sha256":"8637c74c762ea0919398134ab15220131d2c1c654f36b7a5e5f4c9e6b071f769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8637c74c762ea0919398134ab15220131d2c1c654f36b7a5e5f4c9e6b071f769","first_computed_at":"2026-05-18T00:35:08.813751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:08.813751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7giwPx7HpL9vYAtC7iIPCaZtgB8tF5614fWjaQ2ktuD7Ge09uwzF1YhuT+nPWSA2gbqY/5bvJtp/1VA2rGSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:08.814138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69b6d7557a30dc050cab2b2938ff0ed76fcdbbecb74425752f2c166fa182e730","sha256:c25b7c5266e9ce7a0381dca51b4b8b5f93704cca219770c952ce7f57424acb5b"],"state_sha256":"f5367c545937ffbfbddcca42c89f7fa5beecccf810091faf08df444d14c33017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zOElj8ywj3Qjn4CY38JBTN1tBA5lPG7/cu5KMneE5m1B/VbqdmPSFHrtGGapmkjR58n0BtFzY7w4bGC0NhtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:10:31.871936Z","bundle_sha256":"44439381ebb75120e196c75225d43525629f4d506ad785123d9c2ee32c48facf"}}