{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:S2S5JSVGCIB7TNDPQSPJ6H5J2I","short_pith_number":"pith:S2S5JSVG","schema_version":"1.0","canonical_sha256":"96a5d4caa61203f9b46f849e9f1fa9d237a7d76287c856faf6ae82660b6df91e","source":{"kind":"arxiv","id":"2210.06401","version":1},"attestation_state":"computed","paper":{"title":"Improving information retention in large scale online continual learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ozan Sener, Vladlen Koltun, Zhipeng Cai","submitted_at":"2022-10-12T16:59:43Z","abstract_excerpt":"Given a stream of data sampled from non-stationary distributions, online continual learning (OCL) aims to adapt efficiently to new data while retaining existing knowledge. The typical approach to address information retention (the ability to retain previous knowledge) is keeping a replay buffer of a fixed size and computing gradients using a mixture of new data and the replay buffer. Surprisingly, the recent work (Cai et al., 2021) suggests that information retention remains a problem in large scale OCL even when the replay buffer is unlimited, i.e., the gradients are computed using all past d"},"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":"2210.06401","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2022-10-12T16:59:43Z","cross_cats_sorted":[],"title_canon_sha256":"907c47ed5ecc473520d1308749a121f1691f1eeb71a9959e2d843aa73e0076d1","abstract_canon_sha256":"c93647d260cb18034f85345d8b3fafa26e7eee497042f6cfc1db5413b245ae6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:00.162053Z","signature_b64":"Uw1dZ7KK+9fNUE1ZMUVWqDB+XR+W08BbwBlw+DDaWg1UV+cPqUJN/qVgg3riKLukBNs3gOXMxCLSw/zf/fLwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a5d4caa61203f9b46f849e9f1fa9d237a7d76287c856faf6ae82660b6df91e","last_reissued_at":"2026-07-05T05:06:00.161645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:00.161645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving information retention in large scale online continual learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ozan Sener, Vladlen Koltun, Zhipeng Cai","submitted_at":"2022-10-12T16:59:43Z","abstract_excerpt":"Given a stream of data sampled from non-stationary distributions, online continual learning (OCL) aims to adapt efficiently to new data while retaining existing knowledge. The typical approach to address information retention (the ability to retain previous knowledge) is keeping a replay buffer of a fixed size and computing gradients using a mixture of new data and the replay buffer. Surprisingly, the recent work (Cai et al., 2021) suggests that information retention remains a problem in large scale OCL even when the replay buffer is unlimited, i.e., the gradients are computed using all past d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06401","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.06401/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":"2210.06401","created_at":"2026-07-05T05:06:00.161702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06401v1","created_at":"2026-07-05T05:06:00.161702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06401","created_at":"2026-07-05T05:06:00.161702+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2S5JSVGCIB7","created_at":"2026-07-05T05:06:00.161702+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2S5JSVGCIB7TNDP","created_at":"2026-07-05T05:06:00.161702+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2S5JSVG","created_at":"2026-07-05T05:06:00.161702+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15756","citing_title":"TTL: Test-time Textual Learning for OOD Detection with Pretrained Vision-Language Models","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I","json":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I.json","graph_json":"https://pith.science/api/pith-number/S2S5JSVGCIB7TNDPQSPJ6H5J2I/graph.json","events_json":"https://pith.science/api/pith-number/S2S5JSVGCIB7TNDPQSPJ6H5J2I/events.json","paper":"https://pith.science/paper/S2S5JSVG"},"agent_actions":{"view_html":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I","download_json":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I.json","view_paper":"https://pith.science/paper/S2S5JSVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06401&json=true","fetch_graph":"https://pith.science/api/pith-number/S2S5JSVGCIB7TNDPQSPJ6H5J2I/graph.json","fetch_events":"https://pith.science/api/pith-number/S2S5JSVGCIB7TNDPQSPJ6H5J2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I/action/storage_attestation","attest_author":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I/action/author_attestation","sign_citation":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I/action/citation_signature","submit_replication":"https://pith.science/pith/S2S5JSVGCIB7TNDPQSPJ6H5J2I/action/replication_record"}},"created_at":"2026-07-05T05:06:00.161702+00:00","updated_at":"2026-07-05T05:06:00.161702+00:00"}