{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q4GEFYTNDBYRN5JN36HGL6PUEL","short_pith_number":"pith:Q4GEFYTN","canonical_record":{"source":{"id":"1905.03030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T12:27:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"19ab3d0571821eef536291ee6f7b29fea75f29d5266db1b4a275756a0917b22f","abstract_canon_sha256":"2bf5c92f039ce677105932759abe003d03ff3cf1fd111d1cb91595f3563a84f0"},"schema_version":"1.0"},"canonical_sha256":"870c42e26d187116f52ddf8e65f9f422e5082250da62862a64ab8fccea323f3d","source":{"kind":"arxiv","id":"1905.03030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03030","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03030v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03030","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"Q4GEFYTNDBYR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q4GEFYTNDBYRN5JN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q4GEFYTN","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q4GEFYTNDBYRN5JN36HGL6PUEL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T12:27:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"19ab3d0571821eef536291ee6f7b29fea75f29d5266db1b4a275756a0917b22f","abstract_canon_sha256":"2bf5c92f039ce677105932759abe003d03ff3cf1fd111d1cb91595f3563a84f0"},"schema_version":"1.0"},"canonical_sha256":"870c42e26d187116f52ddf8e65f9f422e5082250da62862a64ab8fccea323f3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.811056Z","signature_b64":"jYSc1gBuvU6RconMIP/Ivjw7jgU6rasPewW+0rt/+dtRohnF10t+slGMDE6dxigHJfos1Ejjl0+QkOJHf1u0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"870c42e26d187116f52ddf8e65f9f422e5082250da62862a64ab8fccea323f3d","last_reissued_at":"2026-05-17T23:40:10.810483Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.810483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03030","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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQAtxZSiREk18L+91d0z57Hci9tJ4c/TP0EsgoaarwD8ZgEi6YZXBTCl5x3Ub5O6srwwJYIOAJfXULM3WT3FBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:42:52.312015Z"},"content_sha256":"3d602ef6ea7c25178de7d85119676bde248df50a3b6d9065213c12e0b528b958","schema_version":"1.0","event_id":"sha256:3d602ef6ea7c25178de7d85119676bde248df50a3b6d9065213c12e0b528b958"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q4GEFYTNDBYRN5JN36HGL6PUEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meta-learning of Sequential Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Pritzel, Andr\\'as Gy\\\"orgy, Hado van Hasselt, Ian Osband, Jane X. Wang, Joel Veness, Kevin Miller, Mark Rowland, Matthew Botvinick, Mohammad Azar, Nando de Freitas, Neil Rabinowitz, Nicolas Heess, Pablo Sprechmann, Pedro A. Ortega, Razvan Pascanu, Shane Legg, Siddhant M. Jayakumar, Silvia Chiappa, Simon Osindero, Tim Genewein, Tom McGrath, Yee Whye Teh, Zeb Kurth-Nelson","submitted_at":"2019-05-08T12:27:20Z","abstract_excerpt":"In this report we review memory-based meta-learning as a tool for building sample-efficient strategies that learn from past experience to adapt to any task within a target class. Our goal is to equip the reader with the conceptual foundations of this tool for building new, scalable agents that operate on broad domains. To do so, we present basic algorithmic templates for building near-optimal predictors and reinforcement learners which behave as if they had a probabilistic model that allowed them to efficiently exploit task structure. Furthermore, we recast memory-based meta-learning within a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03030","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-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tv+FhOsuJQqUW6kNdZZ+Twl6GwhgM2bHQlIYFYF3s7YUA0F6P+PCFoDzzmp+I2NDS21qz7AvUxdrGsYB/uHvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:42:52.312392Z"},"content_sha256":"320f64ef9344817c8d711d7dff5555342b2ee21dde8f71f9fc3925d1182e21ea","schema_version":"1.0","event_id":"sha256:320f64ef9344817c8d711d7dff5555342b2ee21dde8f71f9fc3925d1182e21ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/bundle.json","state_url":"https://pith.science/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/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-05T11:42:52Z","links":{"resolver":"https://pith.science/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL","bundle":"https://pith.science/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/bundle.json","state":"https://pith.science/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4GEFYTNDBYRN5JN36HGL6PUEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q4GEFYTNDBYRN5JN36HGL6PUEL","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":"2bf5c92f039ce677105932759abe003d03ff3cf1fd111d1cb91595f3563a84f0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T12:27:20Z","title_canon_sha256":"19ab3d0571821eef536291ee6f7b29fea75f29d5266db1b4a275756a0917b22f"},"schema_version":"1.0","source":{"id":"1905.03030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03030","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03030v2","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03030","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"Q4GEFYTNDBYR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"Q4GEFYTNDBYRN5JN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"Q4GEFYTN","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:320f64ef9344817c8d711d7dff5555342b2ee21dde8f71f9fc3925d1182e21ea","target":"graph","created_at":"2026-05-17T23:40:10Z","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":"In this report we review memory-based meta-learning as a tool for building sample-efficient strategies that learn from past experience to adapt to any task within a target class. Our goal is to equip the reader with the conceptual foundations of this tool for building new, scalable agents that operate on broad domains. To do so, we present basic algorithmic templates for building near-optimal predictors and reinforcement learners which behave as if they had a probabilistic model that allowed them to efficiently exploit task structure. Furthermore, we recast memory-based meta-learning within a ","authors_text":"Alex Pritzel, Andr\\'as Gy\\\"orgy, Hado van Hasselt, Ian Osband, Jane X. Wang, Joel Veness, Kevin Miller, Mark Rowland, Matthew Botvinick, Mohammad Azar, Nando de Freitas, Neil Rabinowitz, Nicolas Heess, Pablo Sprechmann, Pedro A. Ortega, Razvan Pascanu, Shane Legg, Siddhant M. Jayakumar, Silvia Chiappa, Simon Osindero, Tim Genewein, Tom McGrath, Yee Whye Teh, Zeb Kurth-Nelson","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T12:27:20Z","title":"Meta-learning of Sequential Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03030","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:3d602ef6ea7c25178de7d85119676bde248df50a3b6d9065213c12e0b528b958","target":"record","created_at":"2026-05-17T23:40:10Z","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":"2bf5c92f039ce677105932759abe003d03ff3cf1fd111d1cb91595f3563a84f0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T12:27:20Z","title_canon_sha256":"19ab3d0571821eef536291ee6f7b29fea75f29d5266db1b4a275756a0917b22f"},"schema_version":"1.0","source":{"id":"1905.03030","kind":"arxiv","version":2}},"canonical_sha256":"870c42e26d187116f52ddf8e65f9f422e5082250da62862a64ab8fccea323f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"870c42e26d187116f52ddf8e65f9f422e5082250da62862a64ab8fccea323f3d","first_computed_at":"2026-05-17T23:40:10.810483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.810483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYSc1gBuvU6RconMIP/Ivjw7jgU6rasPewW+0rt/+dtRohnF10t+slGMDE6dxigHJfos1Ejjl0+QkOJHf1u0Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.811056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d602ef6ea7c25178de7d85119676bde248df50a3b6d9065213c12e0b528b958","sha256:320f64ef9344817c8d711d7dff5555342b2ee21dde8f71f9fc3925d1182e21ea"],"state_sha256":"96a96fca05157fe38ea719bbe0551d633c9ffed0d31ee4753f3e9869d4c12845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PyJzbtOltG3/oB3LdymetCT07zIo23t+K6+DbxLahJ4XMxp1TPdpuYhdHa4mdETKOZ+T07Hhs08plB4EzLnkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:42:52.314380Z","bundle_sha256":"4ef8786ec080eb18db578d3d70d087b9fc78ce38af09414ed94be3327820de4a"}}