{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UFH7QYARFWX6OSOTQGZ7DJU7MC","short_pith_number":"pith:UFH7QYAR","canonical_record":{"source":{"id":"1810.10612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T20:41:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8c1da6c7780821e379952d4443d37790fd21f59d598a4d5e427d6c2e0c71c35d","abstract_canon_sha256":"b957faaf0be87045bea943986cf8655e3cc22f6a3ad2cdf5b417af460f40fd6d"},"schema_version":"1.0"},"canonical_sha256":"a14ff860112dafe749d381b3f1a69f609594360582385e6f224c7febaf3412c8","source":{"kind":"arxiv","id":"1810.10612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10612","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10612v1","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10612","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"UFH7QYARFWX6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UFH7QYARFWX6OSOT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UFH7QYAR","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UFH7QYARFWX6OSOTQGZ7DJU7MC","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T20:41:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8c1da6c7780821e379952d4443d37790fd21f59d598a4d5e427d6c2e0c71c35d","abstract_canon_sha256":"b957faaf0be87045bea943986cf8655e3cc22f6a3ad2cdf5b417af460f40fd6d"},"schema_version":"1.0"},"canonical_sha256":"a14ff860112dafe749d381b3f1a69f609594360582385e6f224c7febaf3412c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:20.073670Z","signature_b64":"kHg7GbmgXoMyimD5HseK4NtYY9zlNRY4kBrGWjtdOuJ0LXgj/KL0PdgOb/BxEJZ/3VqSvVV60b71BJU0Rt7TCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14ff860112dafe749d381b3f1a69f609594360582385e6f224c7febaf3412c8","last_reissued_at":"2026-05-18T00:02:20.073245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:20.073245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10612","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ari00BfaO0fuKzP7/DtJttMW7BWP6obm0mfFSlGGX+kfQfDs3uycdI3V6b+HZ5gyH0Y9nFvjxYkFHV3IxsvQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:01:45.048241Z"},"content_sha256":"bb321643f827bb54a45e9f4696abd0a17967cc093599c26df70bcbb9303bef94","schema_version":"1.0","event_id":"sha256:bb321643f827bb54a45e9f4696abd0a17967cc093599c26df70bcbb9303bef94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UFH7QYARFWX6OSOTQGZ7DJU7MC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continual Classification Learning Using Generative Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Kalousis, Frantzeska Lavda, Jason Ramapuram, Magda Gregorova","submitted_at":"2018-10-24T20:41:13Z","abstract_excerpt":"Continual learning is the ability to sequentially learn over time by accommodating knowledge while retaining previously learned experiences. Neural networks can learn multiple tasks when trained on them jointly, but cannot maintain performance on previously learned tasks when tasks are presented one at a time. This problem is called catastrophic forgetting. In this work, we propose a classification model that learns continuously from sequentially observed tasks, while preventing catastrophic forgetting. We build on the lifelong generative capabilities of [10] and extend it to the classificatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10612","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:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8OUSuCQ7t3+XLLPvR5NfaQXFYkq2xO+IHnCNNcV1DnA2NsRqrkZ0HBYK+/J8HVYZFXvLjC0rZphPX/4BzbhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:01:45.048613Z"},"content_sha256":"4f99a6f8e0e053aaaedaf46af6df8c4d91a6188b294a248aaa1998852ef1e063","schema_version":"1.0","event_id":"sha256:4f99a6f8e0e053aaaedaf46af6df8c4d91a6188b294a248aaa1998852ef1e063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/bundle.json","state_url":"https://pith.science/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/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-08T15:01:45Z","links":{"resolver":"https://pith.science/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC","bundle":"https://pith.science/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/bundle.json","state":"https://pith.science/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFH7QYARFWX6OSOTQGZ7DJU7MC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UFH7QYARFWX6OSOTQGZ7DJU7MC","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":"b957faaf0be87045bea943986cf8655e3cc22f6a3ad2cdf5b417af460f40fd6d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T20:41:13Z","title_canon_sha256":"8c1da6c7780821e379952d4443d37790fd21f59d598a4d5e427d6c2e0c71c35d"},"schema_version":"1.0","source":{"id":"1810.10612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10612","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10612v1","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10612","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"UFH7QYARFWX6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UFH7QYARFWX6OSOT","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UFH7QYAR","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4f99a6f8e0e053aaaedaf46af6df8c4d91a6188b294a248aaa1998852ef1e063","target":"graph","created_at":"2026-05-18T00:02:20Z","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":"Continual learning is the ability to sequentially learn over time by accommodating knowledge while retaining previously learned experiences. Neural networks can learn multiple tasks when trained on them jointly, but cannot maintain performance on previously learned tasks when tasks are presented one at a time. This problem is called catastrophic forgetting. In this work, we propose a classification model that learns continuously from sequentially observed tasks, while preventing catastrophic forgetting. We build on the lifelong generative capabilities of [10] and extend it to the classificatio","authors_text":"Alexandros Kalousis, Frantzeska Lavda, Jason Ramapuram, Magda Gregorova","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T20:41:13Z","title":"Continual Classification Learning Using Generative Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10612","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:bb321643f827bb54a45e9f4696abd0a17967cc093599c26df70bcbb9303bef94","target":"record","created_at":"2026-05-18T00:02:20Z","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":"b957faaf0be87045bea943986cf8655e3cc22f6a3ad2cdf5b417af460f40fd6d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-24T20:41:13Z","title_canon_sha256":"8c1da6c7780821e379952d4443d37790fd21f59d598a4d5e427d6c2e0c71c35d"},"schema_version":"1.0","source":{"id":"1810.10612","kind":"arxiv","version":1}},"canonical_sha256":"a14ff860112dafe749d381b3f1a69f609594360582385e6f224c7febaf3412c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a14ff860112dafe749d381b3f1a69f609594360582385e6f224c7febaf3412c8","first_computed_at":"2026-05-18T00:02:20.073245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:20.073245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kHg7GbmgXoMyimD5HseK4NtYY9zlNRY4kBrGWjtdOuJ0LXgj/KL0PdgOb/BxEJZ/3VqSvVV60b71BJU0Rt7TCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:20.073670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb321643f827bb54a45e9f4696abd0a17967cc093599c26df70bcbb9303bef94","sha256:4f99a6f8e0e053aaaedaf46af6df8c4d91a6188b294a248aaa1998852ef1e063"],"state_sha256":"6052aa63d9ddc3bfa234d43a9ccd819d77094cda1b3e3e65218d7ec9b24a0031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/74qoX5C41vG6IhdoqypLWM/FMKVyAdRDhWrunQkSSPSpnJXxFSqcMnrak6XA3W6dd3OhbCJpQF6+TJZNqmSCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:01:45.050488Z","bundle_sha256":"299513861345d43abc2aa3c2b32e48d2c7b6a088dea362e6444d094161a49715"}}