{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GDSO2WZ2FYMKIST5BZSWWW67TE","short_pith_number":"pith:GDSO2WZ2","canonical_record":{"source":{"id":"1707.03300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T14:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"3d337179f09438967d499b7b720e555e459f4ce9858a0e46c7335f20ecb6b756","abstract_canon_sha256":"0b18f6e3d4f16bc738aa1961c456308ca729586d539ee745772694f79fedc176"},"schema_version":"1.0"},"canonical_sha256":"30e4ed5b3a2e18a44a7d0e656b5bdf9902448954fa5baec476bffd9bef8798b2","source":{"kind":"arxiv","id":"1707.03300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03300","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03300v1","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03300","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"GDSO2WZ2FYMK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDSO2WZ2FYMKIST5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDSO2WZ2","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GDSO2WZ2FYMKIST5BZSWWW67TE","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T14:30:06Z","cross_cats_sorted":[],"title_canon_sha256":"3d337179f09438967d499b7b720e555e459f4ce9858a0e46c7335f20ecb6b756","abstract_canon_sha256":"0b18f6e3d4f16bc738aa1961c456308ca729586d539ee745772694f79fedc176"},"schema_version":"1.0"},"canonical_sha256":"30e4ed5b3a2e18a44a7d0e656b5bdf9902448954fa5baec476bffd9bef8798b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:29.387031Z","signature_b64":"fhw0G3qCaAqlEn/gz0LlLlZicUhJSFfTainBvY6F1FGF0m1kR/fcMB8VQC+1Lb8J1wgCZscClbRTSiB55ottDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30e4ed5b3a2e18a44a7d0e656b5bdf9902448954fa5baec476bffd9bef8798b2","last_reissued_at":"2026-05-18T00:40:29.386448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:29.386448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03300","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:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mn9Z8YQF0zJwY6ipEB5HYJSb34DDxmuqjR1jFYQVJC5u8cV+QQvwbq+or8LYES8iJrAyKTjQNJG3LQNCWeRfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:04:03.821546Z"},"content_sha256":"f1e709bd0c81cec4a90e1908d389916ad667543c33ab7758482519681b8976ac","schema_version":"1.0","event_id":"sha256:f1e709bd0c81cec4a90e1908d389916ad667543c33ab7758482519681b8976ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GDSO2WZ2FYMKIST5BZSWWW67TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Intentional Unintentional Agent: Learning to Solve Many Continuous Control Tasks Simultaneously","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Matthew W. Hoffman, Misha Denil, Nando de Freitas, Sergio G\\'omez Colmenarejo, Serkan Cabi, Ziyu Wang","submitted_at":"2017-07-11T14:30:06Z","abstract_excerpt":"This paper introduces the Intentional Unintentional (IU) agent. This agent endows the deep deterministic policy gradients (DDPG) agent for continuous control with the ability to solve several tasks simultaneously. Learning to solve many tasks simultaneously has been a long-standing, core goal of artificial intelligence, inspired by infant development and motivated by the desire to build flexible robot manipulators capable of many diverse behaviours. We show that the IU agent not only learns to solve many tasks simultaneously but it also learns faster than agents that target a single task at-a-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03300","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:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7y4lz0eHwn84yJ8Wlkq9P5E9L+9ahW6vnS8HcAci5w3UFsjQbDUfq41XEMSQ2fP/Gy860BT8AMc/ScUlHW2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:04:03.822224Z"},"content_sha256":"75f305fe05f9e6ab66960e0b8da19cdefb5f3280907a9b2be623f203edae205e","schema_version":"1.0","event_id":"sha256:75f305fe05f9e6ab66960e0b8da19cdefb5f3280907a9b2be623f203edae205e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/bundle.json","state_url":"https://pith.science/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/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-06T18:04:03Z","links":{"resolver":"https://pith.science/pith/GDSO2WZ2FYMKIST5BZSWWW67TE","bundle":"https://pith.science/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/bundle.json","state":"https://pith.science/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDSO2WZ2FYMKIST5BZSWWW67TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GDSO2WZ2FYMKIST5BZSWWW67TE","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":"0b18f6e3d4f16bc738aa1961c456308ca729586d539ee745772694f79fedc176","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T14:30:06Z","title_canon_sha256":"3d337179f09438967d499b7b720e555e459f4ce9858a0e46c7335f20ecb6b756"},"schema_version":"1.0","source":{"id":"1707.03300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03300","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03300v1","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03300","created_at":"2026-05-18T00:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"GDSO2WZ2FYMK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GDSO2WZ2FYMKIST5","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GDSO2WZ2","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:75f305fe05f9e6ab66960e0b8da19cdefb5f3280907a9b2be623f203edae205e","target":"graph","created_at":"2026-05-18T00:40:29Z","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":"This paper introduces the Intentional Unintentional (IU) agent. This agent endows the deep deterministic policy gradients (DDPG) agent for continuous control with the ability to solve several tasks simultaneously. Learning to solve many tasks simultaneously has been a long-standing, core goal of artificial intelligence, inspired by infant development and motivated by the desire to build flexible robot manipulators capable of many diverse behaviours. We show that the IU agent not only learns to solve many tasks simultaneously but it also learns faster than agents that target a single task at-a-","authors_text":"Matthew W. Hoffman, Misha Denil, Nando de Freitas, Sergio G\\'omez Colmenarejo, Serkan Cabi, Ziyu Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T14:30:06Z","title":"The Intentional Unintentional Agent: Learning to Solve Many Continuous Control Tasks Simultaneously"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03300","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:f1e709bd0c81cec4a90e1908d389916ad667543c33ab7758482519681b8976ac","target":"record","created_at":"2026-05-18T00:40:29Z","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":"0b18f6e3d4f16bc738aa1961c456308ca729586d539ee745772694f79fedc176","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-11T14:30:06Z","title_canon_sha256":"3d337179f09438967d499b7b720e555e459f4ce9858a0e46c7335f20ecb6b756"},"schema_version":"1.0","source":{"id":"1707.03300","kind":"arxiv","version":1}},"canonical_sha256":"30e4ed5b3a2e18a44a7d0e656b5bdf9902448954fa5baec476bffd9bef8798b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30e4ed5b3a2e18a44a7d0e656b5bdf9902448954fa5baec476bffd9bef8798b2","first_computed_at":"2026-05-18T00:40:29.386448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:29.386448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fhw0G3qCaAqlEn/gz0LlLlZicUhJSFfTainBvY6F1FGF0m1kR/fcMB8VQC+1Lb8J1wgCZscClbRTSiB55ottDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:29.387031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1e709bd0c81cec4a90e1908d389916ad667543c33ab7758482519681b8976ac","sha256:75f305fe05f9e6ab66960e0b8da19cdefb5f3280907a9b2be623f203edae205e"],"state_sha256":"13ecf6da88ef7e0f1162c87dc5ecfa69c074ab8c9a986b9142303293768ac486"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/piYadsSlaCU68MQo5QuQdJEzVJyKgjZfgZeVNP3hlr1u0mcjZMPlaHtO34tjiO4YxaWc9AttGQan5Cs/GDQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:04:03.826776Z","bundle_sha256":"d1d9bb59e60e51dff1d8b245527a7e79ca63cbf025999f6203755ee6d6d0be03"}}