{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3UV34X46YF5ZRDZIEWOVUUUX5W","short_pith_number":"pith:3UV34X46","canonical_record":{"source":{"id":"2506.19692","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T14:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"8d7a8ff70fb9ba75bedfbada1d71dd33a41187350d9829e55030425e028af13d","abstract_canon_sha256":"105a5f6d879a08135bf04b4dfc49466d9f1577ab37fc418c74e97a0426db9b40"},"schema_version":"1.0"},"canonical_sha256":"dd2bbe5f9ec17b988f28259d5a5297eda47a41505b1c42a9bdf9f89213260ef7","source":{"kind":"arxiv","id":"2506.19692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.19692","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"2506.19692v1","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19692","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"3UV34X46YF5Z","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"3UV34X46YF5ZRDZI","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"3UV34X46","created_at":"2026-07-05T11:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3UV34X46YF5ZRDZIEWOVUUUX5W","target":"record","payload":{"canonical_record":{"source":{"id":"2506.19692","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T14:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"8d7a8ff70fb9ba75bedfbada1d71dd33a41187350d9829e55030425e028af13d","abstract_canon_sha256":"105a5f6d879a08135bf04b4dfc49466d9f1577ab37fc418c74e97a0426db9b40"},"schema_version":"1.0"},"canonical_sha256":"dd2bbe5f9ec17b988f28259d5a5297eda47a41505b1c42a9bdf9f89213260ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:37.094117Z","signature_b64":"/KlsZFlwlTtcSd+xSDcYN/XcnRn5ijWsRhy77eoQzTpsGC6lFPOB6zO8onbR0BJpHYp3IVNlzOgtq3FE5DsrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd2bbe5f9ec17b988f28259d5a5297eda47a41505b1c42a9bdf9f89213260ef7","last_reissued_at":"2026-07-05T11:26:37.093579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:37.093579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.19692","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-07-05T11:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2uJYCfN0Y1nuWLfKqlP1/LjLQApmuFa9Gv89t4Q+jifRwF4w0BZwyi8L5dbuQehZsB6ZlUhvKyxJxwJMS/2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:43:29.182388Z"},"content_sha256":"18cba74f977c649ce69dddec5dd2702cdcb721924ff3018964d7dcdf6d1fa414","schema_version":"1.0","event_id":"sha256:18cba74f977c649ce69dddec5dd2702cdcb721924ff3018964d7dcdf6d1fa414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3UV34X46YF5ZRDZIEWOVUUUX5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Lightweight Generators for Memory Efficient Continual Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ahmed Nabil Belbachir, Christiaan Lamers, Niki van Stein, Thomas B\\\"ack","submitted_at":"2025-06-24T14:59:52Z","abstract_excerpt":"Catastrophic forgetting can be trivially alleviated by keeping all data from previous tasks in memory. Therefore, minimizing the memory footprint while maximizing the amount of relevant information is crucial to the challenge of continual learning. This paper aims to decrease required memory for memory-based continuous learning algorithms. We explore the options of extracting a minimal amount of information, while maximally alleviating forgetting. We propose the usage of lightweight generators based on Singular Value Decomposition to enhance existing continual learning methods, such as A-GEM a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19692","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.19692/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:26:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INAaP9SgMeCOGK+CKLWZLkX/MGSxSGR93hPKRGi+6cpXudF9tf2x9Chs742ivw/e7IGYcyqxE+b31Of1XO9PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:43:29.183360Z"},"content_sha256":"297cb7ff785f27df6d91b97f6d2080e0cb1c11d92a62613b1403cf5400b9b3f7","schema_version":"1.0","event_id":"sha256:297cb7ff785f27df6d91b97f6d2080e0cb1c11d92a62613b1403cf5400b9b3f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/bundle.json","state_url":"https://pith.science/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/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-08-21T01:43:29Z","links":{"resolver":"https://pith.science/pith/3UV34X46YF5ZRDZIEWOVUUUX5W","bundle":"https://pith.science/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/bundle.json","state":"https://pith.science/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UV34X46YF5ZRDZIEWOVUUUX5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3UV34X46YF5ZRDZIEWOVUUUX5W","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":"105a5f6d879a08135bf04b4dfc49466d9f1577ab37fc418c74e97a0426db9b40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T14:59:52Z","title_canon_sha256":"8d7a8ff70fb9ba75bedfbada1d71dd33a41187350d9829e55030425e028af13d"},"schema_version":"1.0","source":{"id":"2506.19692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.19692","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"arxiv_version","alias_value":"2506.19692v1","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19692","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_12","alias_value":"3UV34X46YF5Z","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"3UV34X46YF5ZRDZI","created_at":"2026-07-05T11:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"3UV34X46","created_at":"2026-07-05T11:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:297cb7ff785f27df6d91b97f6d2080e0cb1c11d92a62613b1403cf5400b9b3f7","target":"graph","created_at":"2026-07-05T11:26:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.19692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Catastrophic forgetting can be trivially alleviated by keeping all data from previous tasks in memory. Therefore, minimizing the memory footprint while maximizing the amount of relevant information is crucial to the challenge of continual learning. This paper aims to decrease required memory for memory-based continuous learning algorithms. We explore the options of extracting a minimal amount of information, while maximally alleviating forgetting. We propose the usage of lightweight generators based on Singular Value Decomposition to enhance existing continual learning methods, such as A-GEM a","authors_text":"Ahmed Nabil Belbachir, Christiaan Lamers, Niki van Stein, Thomas B\\\"ack","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T14:59:52Z","title":"Leveraging Lightweight Generators for Memory Efficient Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19692","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:18cba74f977c649ce69dddec5dd2702cdcb721924ff3018964d7dcdf6d1fa414","target":"record","created_at":"2026-07-05T11:26:37Z","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":"105a5f6d879a08135bf04b4dfc49466d9f1577ab37fc418c74e97a0426db9b40","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-24T14:59:52Z","title_canon_sha256":"8d7a8ff70fb9ba75bedfbada1d71dd33a41187350d9829e55030425e028af13d"},"schema_version":"1.0","source":{"id":"2506.19692","kind":"arxiv","version":1}},"canonical_sha256":"dd2bbe5f9ec17b988f28259d5a5297eda47a41505b1c42a9bdf9f89213260ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd2bbe5f9ec17b988f28259d5a5297eda47a41505b1c42a9bdf9f89213260ef7","first_computed_at":"2026-07-05T11:26:37.093579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:26:37.093579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KlsZFlwlTtcSd+xSDcYN/XcnRn5ijWsRhy77eoQzTpsGC6lFPOB6zO8onbR0BJpHYp3IVNlzOgtq3FE5DsrCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:26:37.094117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.19692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18cba74f977c649ce69dddec5dd2702cdcb721924ff3018964d7dcdf6d1fa414","sha256:297cb7ff785f27df6d91b97f6d2080e0cb1c11d92a62613b1403cf5400b9b3f7"],"state_sha256":"b02f54ce616e36ab9121becf77cb3f9e4704b74a2a3d70c70aa8e9f8ee399f65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VATJGo6LWxRUsfDPky+qRfVNyTl28vVjJt/NevOX6zU7L1GGGQFUNYeEHyBBwv/sc13EaUmic3V3VCniigs/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T01:43:29.197769Z","bundle_sha256":"4df4da29afcc74407bc3cf0655ce8ee02c2d3e4f387cbab68eb0e4575af0fee5"}}