{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ALOWA6EWW25KGN4E4KUFPBHKF","short_pith_number":"pith:5ALOWA6E","canonical_record":{"source":{"id":"1906.05201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T15:17:47Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"1ed8c29d84ae65e72dd9258171318fa685b2db2a1a8386f9431e4d577af41ba8","abstract_canon_sha256":"d99e75d7ef12b19939309fe9c73a4c4514f8f4b8356fb2c6669c9a2f274865ba"},"schema_version":"1.0"},"canonical_sha256":"e816eb03c4b5b5d519bc271542bc275165d4992593a68ca094eb10a561d6769d","source":{"kind":"arxiv","id":"1906.05201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05201","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05201v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05201","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"5ALOWA6EWW25","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ALOWA6EWW25KGN4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ALOWA6E","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ALOWA6EWW25KGN4E4KUFPBHKF","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T15:17:47Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"1ed8c29d84ae65e72dd9258171318fa685b2db2a1a8386f9431e4d577af41ba8","abstract_canon_sha256":"d99e75d7ef12b19939309fe9c73a4c4514f8f4b8356fb2c6669c9a2f274865ba"},"schema_version":"1.0"},"canonical_sha256":"e816eb03c4b5b5d519bc271542bc275165d4992593a68ca094eb10a561d6769d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.200740Z","signature_b64":"XbrMv+IumjDWWfepjLiKKlLkvz6WrYomwmbuHt8cUKv7v+NjwpIAXkhY3UTlWhOie+B6Bk+yzTV2zZxmOMZ3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e816eb03c4b5b5d519bc271542bc275165d4992593a68ca094eb10a561d6769d","last_reissued_at":"2026-05-17T23:43:29.200155Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.200155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05201","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Aj6AWhrAGdJGAr1o9002adndePA6eWTujyp1SKybysoILFOnx3NipastFL5rsgf7YeI2LtXeoidLGjxDf5+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:21:08.808765Z"},"content_sha256":"c590c7e7ba580da159824224d75a56d56db92c6453d690b28490d6a13ee11bb6","schema_version":"1.0","event_id":"sha256:c590c7e7ba580da159824224d75a56d56db92c6453d690b28490d6a13ee11bb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ALOWA6EWW25KGN4E4KUFPBHKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task Agnostic Continual Learning via Meta Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"stat.ML","authors_text":"Alexandre Galashov, Andrei A. Rusu, Jakub Sygnowski, Razvan Pascanu, Xu He, Yee Whye Teh","submitted_at":"2019-06-12T15:17:47Z","abstract_excerpt":"While neural networks are powerful function approximators, they suffer from catastrophic forgetting when the data distribution is not stationary. One particular formalism that studies learning under non-stationary distribution is provided by continual learning, where the non-stationarity is imposed by a sequence of distinct tasks. Most methods in this space assume, however, the knowledge of task boundaries, and focus on alleviating catastrophic forgetting. In this work, we depart from this view and move the focus towards faster remembering -- i.e measuring how quickly the network recovers perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05201","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJxrribF2+FqsYsg513vllXNfjsUdqNUaI/FrVFIePXnG1w0QgH3/nt0rTrsW5pNoaqDZ5H6mds3/K8oIWfEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:21:08.809469Z"},"content_sha256":"04a27a67e234687c9fb23ef8bb1672556ac2b29aaa1a17c00b289fe49f342e78","schema_version":"1.0","event_id":"sha256:04a27a67e234687c9fb23ef8bb1672556ac2b29aaa1a17c00b289fe49f342e78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/bundle.json","state_url":"https://pith.science/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/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-27T05:21:08Z","links":{"resolver":"https://pith.science/pith/5ALOWA6EWW25KGN4E4KUFPBHKF","bundle":"https://pith.science/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/bundle.json","state":"https://pith.science/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ALOWA6EWW25KGN4E4KUFPBHKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ALOWA6EWW25KGN4E4KUFPBHKF","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":"d99e75d7ef12b19939309fe9c73a4c4514f8f4b8356fb2c6669c9a2f274865ba","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T15:17:47Z","title_canon_sha256":"1ed8c29d84ae65e72dd9258171318fa685b2db2a1a8386f9431e4d577af41ba8"},"schema_version":"1.0","source":{"id":"1906.05201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05201","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05201v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05201","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"5ALOWA6EWW25","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ALOWA6EWW25KGN4","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ALOWA6E","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:04a27a67e234687c9fb23ef8bb1672556ac2b29aaa1a17c00b289fe49f342e78","target":"graph","created_at":"2026-05-17T23:43: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":"While neural networks are powerful function approximators, they suffer from catastrophic forgetting when the data distribution is not stationary. One particular formalism that studies learning under non-stationary distribution is provided by continual learning, where the non-stationarity is imposed by a sequence of distinct tasks. Most methods in this space assume, however, the knowledge of task boundaries, and focus on alleviating catastrophic forgetting. In this work, we depart from this view and move the focus towards faster remembering -- i.e measuring how quickly the network recovers perf","authors_text":"Alexandre Galashov, Andrei A. Rusu, Jakub Sygnowski, Razvan Pascanu, Xu He, Yee Whye Teh","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T15:17:47Z","title":"Task Agnostic Continual Learning via Meta Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05201","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:c590c7e7ba580da159824224d75a56d56db92c6453d690b28490d6a13ee11bb6","target":"record","created_at":"2026-05-17T23:43: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":"d99e75d7ef12b19939309fe9c73a4c4514f8f4b8356fb2c6669c9a2f274865ba","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T15:17:47Z","title_canon_sha256":"1ed8c29d84ae65e72dd9258171318fa685b2db2a1a8386f9431e4d577af41ba8"},"schema_version":"1.0","source":{"id":"1906.05201","kind":"arxiv","version":1}},"canonical_sha256":"e816eb03c4b5b5d519bc271542bc275165d4992593a68ca094eb10a561d6769d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e816eb03c4b5b5d519bc271542bc275165d4992593a68ca094eb10a561d6769d","first_computed_at":"2026-05-17T23:43:29.200155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.200155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbrMv+IumjDWWfepjLiKKlLkvz6WrYomwmbuHt8cUKv7v+NjwpIAXkhY3UTlWhOie+B6Bk+yzTV2zZxmOMZ3Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.200740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c590c7e7ba580da159824224d75a56d56db92c6453d690b28490d6a13ee11bb6","sha256:04a27a67e234687c9fb23ef8bb1672556ac2b29aaa1a17c00b289fe49f342e78"],"state_sha256":"707578baf50b0244c8c71a8d3b23c90a46b5f0d5c1cb76e12e82d65f66a3bc61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+pqCKcpL/mYVqT6V4yhrxlWFbRL2aoPyPMxqIsAewQjwmm3ya/vX7JpeQBwvosx6mEnK6SXKld+zCp4CqsDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:21:08.814941Z","bundle_sha256":"c6850e213c65f271b78961534252ba59511de7d86a20b88f5630d2a238963279"}}