{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KVM6ZJAOMBF5PTAKDEIR7OXZU5","short_pith_number":"pith:KVM6ZJAO","canonical_record":{"source":{"id":"2210.08442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fa2504e384a1c92851918dd219bfe534a491e8419750c0c2e9359eced1712475","abstract_canon_sha256":"ec31b7d09a235629c506681d3639a73ae4b9056d51b6d72ec5220628a91fee4f"},"schema_version":"1.0"},"canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","source":{"kind":"arxiv","id":"2210.08442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.08442","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"2210.08442v1","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08442","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"KVM6ZJAOMBF5","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"KVM6ZJAOMBF5PTAK","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"KVM6ZJAO","created_at":"2026-07-05T05:07:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KVM6ZJAOMBF5PTAKDEIR7OXZU5","target":"record","payload":{"canonical_record":{"source":{"id":"2210.08442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"fa2504e384a1c92851918dd219bfe534a491e8419750c0c2e9359eced1712475","abstract_canon_sha256":"ec31b7d09a235629c506681d3639a73ae4b9056d51b6d72ec5220628a91fee4f"},"schema_version":"1.0"},"canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:10.938249Z","signature_b64":"VXzOvPIQOodh4HuWy1K1CAY62boAa3SXBtXZMLx8Q9LX3+KLAL5uV07H+jYQ1sutWZUm10DZitLbuBA7506eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","last_reissued_at":"2026-07-05T05:07:10.937605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:10.937605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.08442","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-05T05:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qomg1kEhBIs65mtm2ocEfbUzBT0VoNXkysLQnVFten0+X2bjkmhO5rWuupHv7u2719jNVZJC5v2Cqdeh8Os1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:18:14.701567Z"},"content_sha256":"587e3535b1732cb0d899a94216eaefe71831e29d75f0383ebfeacb153bb3e712","schema_version":"1.0","event_id":"sha256:587e3535b1732cb0d899a94216eaefe71831e29d75f0383ebfeacb153bb3e712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KVM6ZJAOMBF5PTAKDEIR7OXZU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Shaolei Ren, Wang Zhu, Yejia Liu","submitted_at":"2022-10-16T04:32:01Z","abstract_excerpt":"Continual learning faces a crucial challenge of catastrophic forgetting. To address this challenge, experience replay (ER) that maintains a tiny subset of samples from previous tasks has been commonly used. Existing ER works usually focus on refining the learning objective for each task with a static memory construction policy. In this paper, we formulate the dynamic memory construction in ER as a combinatorial optimization problem, which aims at directly minimizing the global loss across all experienced tasks. We first apply three tactics to solve the problem in the offline setting as a start"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08442","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/2210.08442/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-05T05:07:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QhWDNiwZAzahPJfvwLknCHjwKolemkdyiNArQ4DeOHsSfD91W198rB8SADr1jMTT2k/7mJv+zAljz8jR4GlADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T10:18:14.702107Z"},"content_sha256":"0f2a0552a3bc47eea55490ab4246fdf9e79358e9c779aedaf034619eadedf68a","schema_version":"1.0","event_id":"sha256:0f2a0552a3bc47eea55490ab4246fdf9e79358e9c779aedaf034619eadedf68a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/bundle.json","state_url":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/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-10T10:18:14Z","links":{"resolver":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5","bundle":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/bundle.json","state":"https://pith.science/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KVM6ZJAOMBF5PTAKDEIR7OXZU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KVM6ZJAOMBF5PTAKDEIR7OXZU5","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":"ec31b7d09a235629c506681d3639a73ae4b9056d51b6d72ec5220628a91fee4f","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","title_canon_sha256":"fa2504e384a1c92851918dd219bfe534a491e8419750c0c2e9359eced1712475"},"schema_version":"1.0","source":{"id":"2210.08442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.08442","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"arxiv_version","alias_value":"2210.08442v1","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08442","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_12","alias_value":"KVM6ZJAOMBF5","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_16","alias_value":"KVM6ZJAOMBF5PTAK","created_at":"2026-07-05T05:07:10Z"},{"alias_kind":"pith_short_8","alias_value":"KVM6ZJAO","created_at":"2026-07-05T05:07:10Z"}],"graph_snapshots":[{"event_id":"sha256:0f2a0552a3bc47eea55490ab4246fdf9e79358e9c779aedaf034619eadedf68a","target":"graph","created_at":"2026-07-05T05:07: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.08442/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Continual learning faces a crucial challenge of catastrophic forgetting. To address this challenge, experience replay (ER) that maintains a tiny subset of samples from previous tasks has been commonly used. Existing ER works usually focus on refining the learning objective for each task with a static memory construction policy. In this paper, we formulate the dynamic memory construction in ER as a combinatorial optimization problem, which aims at directly minimizing the global loss across all experienced tasks. We first apply three tactics to solve the problem in the offline setting as a start","authors_text":"Shaolei Ren, Wang Zhu, Yejia Liu","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","title":"Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08442","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:587e3535b1732cb0d899a94216eaefe71831e29d75f0383ebfeacb153bb3e712","target":"record","created_at":"2026-07-05T05:07: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":"ec31b7d09a235629c506681d3639a73ae4b9056d51b6d72ec5220628a91fee4f","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-16T04:32:01Z","title_canon_sha256":"fa2504e384a1c92851918dd219bfe534a491e8419750c0c2e9359eced1712475"},"schema_version":"1.0","source":{"id":"2210.08442","kind":"arxiv","version":1}},"canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5559eca40e604bd7cc0a19111fbaf9a74d89cad5cb22fa4c80b337b0a233aa44","first_computed_at":"2026-07-05T05:07:10.937605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:07:10.937605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXzOvPIQOodh4HuWy1K1CAY62boAa3SXBtXZMLx8Q9LX3+KLAL5uV07H+jYQ1sutWZUm10DZitLbuBA7506eDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:07:10.938249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.08442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:587e3535b1732cb0d899a94216eaefe71831e29d75f0383ebfeacb153bb3e712","sha256:0f2a0552a3bc47eea55490ab4246fdf9e79358e9c779aedaf034619eadedf68a"],"state_sha256":"f8592c27dc10964797d7256572eface7e6f94255d86ab61b2564b18b1a9615f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jLXqfuW3I3/CBh8W4hvMso6NpLDRM37ftjJ6OoyBioNvTHfnbqH2XCZ6P9sif4D+GFO3s4aRM2hhASGQ0VlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T10:18:14.707448Z","bundle_sha256":"f1eb8642ca896f548b0ad2b2c7e4ac7160b4040d6ff7f9ba2b019fac90e22718"}}