{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TQRLE4S5J4H3AVGN6TF6C7FAX7","short_pith_number":"pith:TQRLE4S5","schema_version":"1.0","canonical_sha256":"9c22b2725d4f0fb054cdf4cbe17ca0bff184253844bfbd36b4f6d7fd8edc549a","source":{"kind":"arxiv","id":"2202.05491","version":1},"attestation_state":"computed","paper":{"title":"Exemplar-free Online Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fengqing Zhu, Jiangpeng He","submitted_at":"2022-02-11T08:03:22Z","abstract_excerpt":"Targeted for real world scenarios, online continual learning aims to learn new tasks from sequentially available data under the condition that each data is observed only once by the learner. Though recent works have made remarkable achievements by storing part of learned task data as exemplars for knowledge replay, the performance is greatly relied on the size of stored exemplars while the storage consumption is a significant constraint in continual learning. In addition, storing exemplars may not always be feasible for certain applications due to privacy concerns. In this work, we propose a n"},"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":"2202.05491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-02-11T08:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"f6dbbc313a46c05d73ad2418c182f3593a2e52c2359076641cc1958b6072af26","abstract_canon_sha256":"66a8e6d691a7cb9a12c83b736864119833843963c3503ca4e078813e6cde8e51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:09.010175Z","signature_b64":"+AdBjSC7IQiLtbPJgBJRRmbY3GXvX2Nippj47SY5ER/99oXkKzw4alNNut6OxyIleJusn2EEgYqQw5nAlcXYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c22b2725d4f0fb054cdf4cbe17ca0bff184253844bfbd36b4f6d7fd8edc549a","last_reissued_at":"2026-07-05T03:56:09.009757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:09.009757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exemplar-free Online Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fengqing Zhu, Jiangpeng He","submitted_at":"2022-02-11T08:03:22Z","abstract_excerpt":"Targeted for real world scenarios, online continual learning aims to learn new tasks from sequentially available data under the condition that each data is observed only once by the learner. Though recent works have made remarkable achievements by storing part of learned task data as exemplars for knowledge replay, the performance is greatly relied on the size of stored exemplars while the storage consumption is a significant constraint in continual learning. In addition, storing exemplars may not always be feasible for certain applications due to privacy concerns. In this work, we propose a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05491","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/2202.05491/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":"2202.05491","created_at":"2026-07-05T03:56:09.009812+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05491v1","created_at":"2026-07-05T03:56:09.009812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05491","created_at":"2026-07-05T03:56:09.009812+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQRLE4S5J4H3","created_at":"2026-07-05T03:56:09.009812+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQRLE4S5J4H3AVGN","created_at":"2026-07-05T03:56:09.009812+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQRLE4S5","created_at":"2026-07-05T03:56:09.009812+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.24816","citing_title":"CL-LoRA: Continual Low-Rank Adaptation for Rehearsal-Free Class-Incremental Learning","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7","json":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7.json","graph_json":"https://pith.science/api/pith-number/TQRLE4S5J4H3AVGN6TF6C7FAX7/graph.json","events_json":"https://pith.science/api/pith-number/TQRLE4S5J4H3AVGN6TF6C7FAX7/events.json","paper":"https://pith.science/paper/TQRLE4S5"},"agent_actions":{"view_html":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7","download_json":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7.json","view_paper":"https://pith.science/paper/TQRLE4S5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05491&json=true","fetch_graph":"https://pith.science/api/pith-number/TQRLE4S5J4H3AVGN6TF6C7FAX7/graph.json","fetch_events":"https://pith.science/api/pith-number/TQRLE4S5J4H3AVGN6TF6C7FAX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7/action/storage_attestation","attest_author":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7/action/author_attestation","sign_citation":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7/action/citation_signature","submit_replication":"https://pith.science/pith/TQRLE4S5J4H3AVGN6TF6C7FAX7/action/replication_record"}},"created_at":"2026-07-05T03:56:09.009812+00:00","updated_at":"2026-07-05T03:56:09.009812+00:00"}