{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AXRLSNXQOSZVY2XDLFSZH43FGW","short_pith_number":"pith:AXRLSNXQ","schema_version":"1.0","canonical_sha256":"05e2b936f074b35c6ae3596593f36535be12cadcdc5bdb59456051a0590cef67","source":{"kind":"arxiv","id":"2210.03114","version":1},"attestation_state":"computed","paper":{"title":"CLIP model is an Efficient Continual Learner","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fahad Khan, Munawar Hayat, Salman Khan, Vishal Thengane","submitted_at":"2022-10-06T17:59:15Z","abstract_excerpt":"The continual learning setting aims to learn new tasks over time without forgetting the previous ones. The literature reports several significant efforts to tackle this problem with limited or no access to previous task data. Among such efforts, typical solutions offer sophisticated techniques involving memory replay, knowledge distillation, model regularization, and dynamic network expansion. The resulting methods have a retraining cost at each learning task, dedicated memory requirements, and setting-specific design choices. In this work, we show that a frozen CLIP (Contrastive Language-Imag"},"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.03114","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-10-06T17:59:15Z","cross_cats_sorted":[],"title_canon_sha256":"ff200efb6dbf474251939495fb37f1a29cf8c6830a208aa0a7e71855e45adfc8","abstract_canon_sha256":"767a557ae28ffc01715b64b88a549da3294190a3953ae50c1fc81d52d81bf2fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:07.763205Z","signature_b64":"Y3cX4lon61Sokb7SN7l0x4n2M1YdX0H3clRnZ3Am6+vSD8LzNAImOC0UmkHlmouwCEwPZl7acqaflrotO9+3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e2b936f074b35c6ae3596593f36535be12cadcdc5bdb59456051a0590cef67","last_reissued_at":"2026-07-05T05:04:07.762734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:07.762734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLIP model is an Efficient Continual Learner","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fahad Khan, Munawar Hayat, Salman Khan, Vishal Thengane","submitted_at":"2022-10-06T17:59:15Z","abstract_excerpt":"The continual learning setting aims to learn new tasks over time without forgetting the previous ones. The literature reports several significant efforts to tackle this problem with limited or no access to previous task data. Among such efforts, typical solutions offer sophisticated techniques involving memory replay, knowledge distillation, model regularization, and dynamic network expansion. The resulting methods have a retraining cost at each learning task, dedicated memory requirements, and setting-specific design choices. In this work, we show that a frozen CLIP (Contrastive Language-Imag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03114","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.03114/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.03114","created_at":"2026-07-05T05:04:07.762792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.03114v1","created_at":"2026-07-05T05:04:07.762792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03114","created_at":"2026-07-05T05:04:07.762792+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXRLSNXQOSZV","created_at":"2026-07-05T05:04:07.762792+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXRLSNXQOSZVY2XD","created_at":"2026-07-05T05:04:07.762792+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXRLSNXQ","created_at":"2026-07-05T05:04:07.762792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19836","citing_title":"World Engine: Towards the Era of Post-Training for Autonomous Driving","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28809","citing_title":"AREA: Attribute Extraction and Aggregation for CLIP-Based Class-Incremental Learning","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29592","citing_title":"Non-Forgetting Knowledge Allocation with Bi-level Competition for Class-Incremental Learning","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17822","citing_title":"GR4CIL: Gap-compensated Routing for CLIP-based Class Incremental Learning","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW","json":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW.json","graph_json":"https://pith.science/api/pith-number/AXRLSNXQOSZVY2XDLFSZH43FGW/graph.json","events_json":"https://pith.science/api/pith-number/AXRLSNXQOSZVY2XDLFSZH43FGW/events.json","paper":"https://pith.science/paper/AXRLSNXQ"},"agent_actions":{"view_html":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW","download_json":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW.json","view_paper":"https://pith.science/paper/AXRLSNXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.03114&json=true","fetch_graph":"https://pith.science/api/pith-number/AXRLSNXQOSZVY2XDLFSZH43FGW/graph.json","fetch_events":"https://pith.science/api/pith-number/AXRLSNXQOSZVY2XDLFSZH43FGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW/action/storage_attestation","attest_author":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW/action/author_attestation","sign_citation":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW/action/citation_signature","submit_replication":"https://pith.science/pith/AXRLSNXQOSZVY2XDLFSZH43FGW/action/replication_record"}},"created_at":"2026-07-05T05:04:07.762792+00:00","updated_at":"2026-07-05T05:04:07.762792+00:00"}