{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4X4GE2MHQEIOBGUI5LOGJLHRZH","short_pith_number":"pith:4X4GE2MH","canonical_record":{"source":{"id":"1709.06977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-20T17:28:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"08c4d9087d5ca55ae620511f86d8d60c3b9a71f3b8ac1454d0f6ac3be650ecba","abstract_canon_sha256":"d1b44629d4093bb1dac83fa969da3acf66a816f7f27871d5b6b2bac3ef3da376"},"schema_version":"1.0"},"canonical_sha256":"e5f86269878110e09a88eadc64acf1c9fde7c576ff4853c5874f155d9b7073d2","source":{"kind":"arxiv","id":"1709.06977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06977","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06977v1","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06977","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"pith_short_12","alias_value":"4X4GE2MHQEIO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X4GE2MHQEIOBGUI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X4GE2MH","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4X4GE2MHQEIOBGUI5LOGJLHRZH","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-20T17:28:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"08c4d9087d5ca55ae620511f86d8d60c3b9a71f3b8ac1454d0f6ac3be650ecba","abstract_canon_sha256":"d1b44629d4093bb1dac83fa969da3acf66a816f7f27871d5b6b2bac3ef3da376"},"schema_version":"1.0"},"canonical_sha256":"e5f86269878110e09a88eadc64acf1c9fde7c576ff4853c5874f155d9b7073d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:39.818744Z","signature_b64":"77afc480KlmReceBM1qIFdhTXUTSkK7SJWRTTywtuzBv3FJjGH8lCNjQ3gnO1K1SIPhZ6E9gKwQusn0hds1nCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5f86269878110e09a88eadc64acf1c9fde7c576ff4853c5874f155d9b7073d2","last_reissued_at":"2026-05-18T00:34:39.818248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:39.818248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06977","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:34:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lgs7MMEBpbiqVqDkIu6KhjWvTKeWScJ0SPZYi5rBZh5HfjVCzv6XEloYeRBtDtKyK+Zr0BpRDnVjf0YMN6B6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:52:17.280698Z"},"content_sha256":"a64f843345da856adbacd66e6a4e86dd05c902a917163608c3b902d0ef6fae56","schema_version":"1.0","event_id":"sha256:a64f843345da856adbacd66e6a4e86dd05c902a917163608c3b902d0ef6fae56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4X4GE2MHQEIOBGUI5LOGJLHRZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Dexterous Manipulation with Concept Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Aditya Gudimella, Marcos Campos, Matineh Shaker, Matthew Brown, Ross Story, Ruofan Kong, Victor Shnayder","submitted_at":"2017-09-20T17:28:13Z","abstract_excerpt":"Deep reinforcement learning yields great results for a large array of problems, but models are generally retrained anew for each new problem to be solved. Prior learning and knowledge are difficult to incorporate when training new models, requiring increasingly longer training as problems become more complex. This is especially problematic for problems with sparse rewards. We provide a solution to these problems by introducing Concept Network Reinforcement Learning (CNRL), a framework which allows us to decompose problems using a multi-level hierarchy. Concepts in a concept network are reusabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06977","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:34:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axkH0KSzrAj2KKU08ABwaWupyZIoQJKoSeU6rn7QE3SD/3o6WddeTRQ8jNOtBS7/1Ed8aB3b6NujXWyp5jysCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:52:17.281046Z"},"content_sha256":"1f667a87ba3d765b74213d0935f9f73b23a2c86974eaf66a69924d4985412432","schema_version":"1.0","event_id":"sha256:1f667a87ba3d765b74213d0935f9f73b23a2c86974eaf66a69924d4985412432"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/bundle.json","state_url":"https://pith.science/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/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-06-04T15:52:17Z","links":{"resolver":"https://pith.science/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH","bundle":"https://pith.science/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/bundle.json","state":"https://pith.science/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4X4GE2MHQEIOBGUI5LOGJLHRZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4X4GE2MHQEIOBGUI5LOGJLHRZH","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":"d1b44629d4093bb1dac83fa969da3acf66a816f7f27871d5b6b2bac3ef3da376","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-20T17:28:13Z","title_canon_sha256":"08c4d9087d5ca55ae620511f86d8d60c3b9a71f3b8ac1454d0f6ac3be650ecba"},"schema_version":"1.0","source":{"id":"1709.06977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06977","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06977v1","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06977","created_at":"2026-05-18T00:34:39Z"},{"alias_kind":"pith_short_12","alias_value":"4X4GE2MHQEIO","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X4GE2MHQEIOBGUI","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X4GE2MH","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:1f667a87ba3d765b74213d0935f9f73b23a2c86974eaf66a69924d4985412432","target":"graph","created_at":"2026-05-18T00:34:39Z","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":"Deep reinforcement learning yields great results for a large array of problems, but models are generally retrained anew for each new problem to be solved. Prior learning and knowledge are difficult to incorporate when training new models, requiring increasingly longer training as problems become more complex. This is especially problematic for problems with sparse rewards. We provide a solution to these problems by introducing Concept Network Reinforcement Learning (CNRL), a framework which allows us to decompose problems using a multi-level hierarchy. Concepts in a concept network are reusabl","authors_text":"Aditya Gudimella, Marcos Campos, Matineh Shaker, Matthew Brown, Ross Story, Ruofan Kong, Victor Shnayder","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-20T17:28:13Z","title":"Deep Reinforcement Learning for Dexterous Manipulation with Concept Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06977","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:a64f843345da856adbacd66e6a4e86dd05c902a917163608c3b902d0ef6fae56","target":"record","created_at":"2026-05-18T00:34:39Z","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":"d1b44629d4093bb1dac83fa969da3acf66a816f7f27871d5b6b2bac3ef3da376","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-20T17:28:13Z","title_canon_sha256":"08c4d9087d5ca55ae620511f86d8d60c3b9a71f3b8ac1454d0f6ac3be650ecba"},"schema_version":"1.0","source":{"id":"1709.06977","kind":"arxiv","version":1}},"canonical_sha256":"e5f86269878110e09a88eadc64acf1c9fde7c576ff4853c5874f155d9b7073d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5f86269878110e09a88eadc64acf1c9fde7c576ff4853c5874f155d9b7073d2","first_computed_at":"2026-05-18T00:34:39.818248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:39.818248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"77afc480KlmReceBM1qIFdhTXUTSkK7SJWRTTywtuzBv3FJjGH8lCNjQ3gnO1K1SIPhZ6E9gKwQusn0hds1nCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:39.818744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a64f843345da856adbacd66e6a4e86dd05c902a917163608c3b902d0ef6fae56","sha256:1f667a87ba3d765b74213d0935f9f73b23a2c86974eaf66a69924d4985412432"],"state_sha256":"ad3b38b5338f7a2b95ace914ae861f379c6a88d8701251a828a424d19987ab98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6j6iW5xrZm4rAWZz4Jh4ajpq05ASct6JBa78UhDQJ3XOYYbaoxv77J3Z31TCJsJPdgY9S5Sn1nXJPgPAtBrAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:52:17.283043Z","bundle_sha256":"cdcb643c9b63271593328b374d640022b8539da0ee13d7f513cc2615988fbd64"}}