{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RAQIMIEUEBTRFXWYT6L5JSAJ6V","short_pith_number":"pith:RAQIMIEU","schema_version":"1.0","canonical_sha256":"8820862094206712ded89f97d4c809f5573fbde6893ccab3edf8ce1dae50ab52","source":{"kind":"arxiv","id":"2307.10845","version":1},"attestation_state":"computed","paper":{"title":"Self-paced Weight Consolidation for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Gan Sun, Jiahua Dong, Wei Cong, Yang Cong, Yuyang Liu","submitted_at":"2023-07-20T13:07:41Z","abstract_excerpt":"Continual learning algorithms which keep the parameters of new tasks close to that of previous tasks, are popular in preventing catastrophic forgetting in sequential task learning settings. However, 1) the performance for the new continual learner will be degraded without distinguishing the contributions of previously learned tasks; 2) the computational cost will be greatly increased with the number of tasks, since most existing algorithms need to regularize all previous tasks when learning new tasks. To address the above challenges, we propose a self-paced Weight Consolidation (spWC) framewor"},"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":"2307.10845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-20T13:07:41Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"9a7caf3f0bcb97689e637c1936e813f002891ee73ca8e4bc0382ddc13e6a656b","abstract_canon_sha256":"738f70ca3cf0bb98e85711ce70041d2a5db49f7f1bd946859c9fb868a37a16fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:12.298203Z","signature_b64":"V2p8NDpELkEyMWcmjBLWzWwZ3XIySU3wiDCYEJ49y1TTnMG71IEviXrv7/Apex3LdSmMoLdml/A1GLtgXt5ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8820862094206712ded89f97d4c809f5573fbde6893ccab3edf8ce1dae50ab52","last_reissued_at":"2026-07-05T06:33:12.297854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:12.297854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-paced Weight Consolidation for Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Gan Sun, Jiahua Dong, Wei Cong, Yang Cong, Yuyang Liu","submitted_at":"2023-07-20T13:07:41Z","abstract_excerpt":"Continual learning algorithms which keep the parameters of new tasks close to that of previous tasks, are popular in preventing catastrophic forgetting in sequential task learning settings. However, 1) the performance for the new continual learner will be degraded without distinguishing the contributions of previously learned tasks; 2) the computational cost will be greatly increased with the number of tasks, since most existing algorithms need to regularize all previous tasks when learning new tasks. To address the above challenges, we propose a self-paced Weight Consolidation (spWC) framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10845","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/2307.10845/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":"2307.10845","created_at":"2026-07-05T06:33:12.297914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.10845v1","created_at":"2026-07-05T06:33:12.297914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10845","created_at":"2026-07-05T06:33:12.297914+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAQIMIEUEBTR","created_at":"2026-07-05T06:33:12.297914+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAQIMIEUEBTRFXWY","created_at":"2026-07-05T06:33:12.297914+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAQIMIEU","created_at":"2026-07-05T06:33:12.297914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V","json":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V.json","graph_json":"https://pith.science/api/pith-number/RAQIMIEUEBTRFXWYT6L5JSAJ6V/graph.json","events_json":"https://pith.science/api/pith-number/RAQIMIEUEBTRFXWYT6L5JSAJ6V/events.json","paper":"https://pith.science/paper/RAQIMIEU"},"agent_actions":{"view_html":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V","download_json":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V.json","view_paper":"https://pith.science/paper/RAQIMIEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.10845&json=true","fetch_graph":"https://pith.science/api/pith-number/RAQIMIEUEBTRFXWYT6L5JSAJ6V/graph.json","fetch_events":"https://pith.science/api/pith-number/RAQIMIEUEBTRFXWYT6L5JSAJ6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V/action/storage_attestation","attest_author":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V/action/author_attestation","sign_citation":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V/action/citation_signature","submit_replication":"https://pith.science/pith/RAQIMIEUEBTRFXWYT6L5JSAJ6V/action/replication_record"}},"created_at":"2026-07-05T06:33:12.297914+00:00","updated_at":"2026-07-05T06:33:12.297914+00:00"}