{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UA3X2RP2D3FPTSZRJ47TUD5TOL","short_pith_number":"pith:UA3X2RP2","schema_version":"1.0","canonical_sha256":"a0377d45fa1ecaf9cb314f3f3a0fb372f889f418996a7e711816f77cefcd7146","source":{"kind":"arxiv","id":"2104.05025","version":3},"attestation_state":"computed","paper":{"title":"New Insights on Reducing Abrupt Representation Change in Online Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eugene Belilovsky, Joelle Pineau, Lucas Caccia, Nader Asadi, Rahaf Aljundi, Tinne Tuytelaars","submitted_at":"2021-04-11T15:19:30Z","abstract_excerpt":"In the online continual learning paradigm, agents must learn from a changing distribution while respecting memory and compute constraints. Experience Replay (ER), where a small subset of past data is stored and replayed alongside new data, has emerged as a simple and effective learning strategy. In this work, we focus on the change in representations of observed data that arises when previously unobserved classes appear in the incoming data stream, and new classes must be distinguished from previous ones. We shed new light on this question by showing that applying ER causes the newly added cla"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.05025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-04-11T15:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"ddb0fe2c2c23232a7bddd5f0990c4ec1c4e05020a47488e1da87384527fabbf7","abstract_canon_sha256":"b63073507e08f99b9ca64ddaf390f13746d4a79020f56029a7e3b04b289f4279"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:21.887197Z","signature_b64":"4PIE6YA41gWWJDfI3ADRZHb2tsJo6bpUqEYRXz9Qw9afj/F1rWAzf3oQGcKHFT2P+kCzxaFSwtFI+PHk9VGSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0377d45fa1ecaf9cb314f3f3a0fb372f889f418996a7e711816f77cefcd7146","last_reissued_at":"2026-07-05T04:19:21.886721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:21.886721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Insights on Reducing Abrupt Representation Change in Online Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eugene Belilovsky, Joelle Pineau, Lucas Caccia, Nader Asadi, Rahaf Aljundi, Tinne Tuytelaars","submitted_at":"2021-04-11T15:19:30Z","abstract_excerpt":"In the online continual learning paradigm, agents must learn from a changing distribution while respecting memory and compute constraints. Experience Replay (ER), where a small subset of past data is stored and replayed alongside new data, has emerged as a simple and effective learning strategy. In this work, we focus on the change in representations of observed data that arises when previously unobserved classes appear in the incoming data stream, and new classes must be distinguished from previous ones. We shed new light on this question by showing that applying ER causes the newly added cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.05025","kind":"arxiv","version":3},"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/2104.05025/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.05025","created_at":"2026-07-05T04:19:21.886779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.05025v3","created_at":"2026-07-05T04:19:21.886779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.05025","created_at":"2026-07-05T04:19:21.886779+00:00"},{"alias_kind":"pith_short_12","alias_value":"UA3X2RP2D3FP","created_at":"2026-07-05T04:19:21.886779+00:00"},{"alias_kind":"pith_short_16","alias_value":"UA3X2RP2D3FPTSZR","created_at":"2026-07-05T04:19:21.886779+00:00"},{"alias_kind":"pith_short_8","alias_value":"UA3X2RP2","created_at":"2026-07-05T04:19:21.886779+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05626","citing_title":"When New Generators Arrive: Lifelong Machine-Generated Text Attribution via Ridge Feature Transfer","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15775","citing_title":"Continual Learning of Domain-Invariant Representations","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12686","citing_title":"BID-LoRA: A Parameter-Efficient Framework for Continual Learning and Unlearning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04420","citing_title":"Is Prompt Selection Necessary for Task-Free Online Continual Learning?","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15414","citing_title":"Beyond Single-Model Optimization: Preserving Plasticity in Continual Reinforcement Learning","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL","json":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL.json","graph_json":"https://pith.science/api/pith-number/UA3X2RP2D3FPTSZRJ47TUD5TOL/graph.json","events_json":"https://pith.science/api/pith-number/UA3X2RP2D3FPTSZRJ47TUD5TOL/events.json","paper":"https://pith.science/paper/UA3X2RP2"},"agent_actions":{"view_html":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL","download_json":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL.json","view_paper":"https://pith.science/paper/UA3X2RP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.05025&json=true","fetch_graph":"https://pith.science/api/pith-number/UA3X2RP2D3FPTSZRJ47TUD5TOL/graph.json","fetch_events":"https://pith.science/api/pith-number/UA3X2RP2D3FPTSZRJ47TUD5TOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL/action/storage_attestation","attest_author":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL/action/author_attestation","sign_citation":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL/action/citation_signature","submit_replication":"https://pith.science/pith/UA3X2RP2D3FPTSZRJ47TUD5TOL/action/replication_record"}},"created_at":"2026-07-05T04:19:21.886779+00:00","updated_at":"2026-07-05T04:19:21.886779+00:00"}