{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XDJUCDKEMZZDWTR5VFPPLC4YME","short_pith_number":"pith:XDJUCDKE","schema_version":"1.0","canonical_sha256":"b8d3410d4466723b4e3da95ef58b98612cc465292dc7e653c843fe41cec3ff82","source":{"kind":"arxiv","id":"2010.04495","version":1},"attestation_state":"computed","paper":{"title":"Linear Mode Connectivity in Multitask and Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Dilan Gorur, Hassan Ghasemzadeh, Mehrdad Farajtabar, Razvan Pascanu, Seyed Iman Mirzadeh","submitted_at":"2020-10-09T10:53:25Z","abstract_excerpt":"Continual (sequential) training and multitask (simultaneous) training are often attempting to solve the same overall objective: to find a solution that performs well on all considered tasks. The main difference is in the training regimes, where continual learning can only have access to one task at a time, which for neural networks typically leads to catastrophic forgetting. That is, the solution found for a subsequent task does not perform well on the previous ones anymore. However, the relationship between the different minima that the two training regimes arrive at is not well understood. W"},"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":"2010.04495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T10:53:25Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"d5d055156c60f6f3091044bcd302e55eeb1a0ff8f7fceb4aa4a323d823654272","abstract_canon_sha256":"181deab46377461b5bfa691d072724059154a5c1f5fdbf16e45aa73ec1fbfa9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:38.691289Z","signature_b64":"aKacgzIJPaFYgxBC41sjisvypLN88CD8wOB4cg2ZEWdI1paFzXYj0o2cTv3wIycZq77h37vAFd3urO8WtDK3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d3410d4466723b4e3da95ef58b98612cc465292dc7e653c843fe41cec3ff82","last_reissued_at":"2026-07-05T01:41:38.690828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:38.690828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Mode Connectivity in Multitask and Continual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Dilan Gorur, Hassan Ghasemzadeh, Mehrdad Farajtabar, Razvan Pascanu, Seyed Iman Mirzadeh","submitted_at":"2020-10-09T10:53:25Z","abstract_excerpt":"Continual (sequential) training and multitask (simultaneous) training are often attempting to solve the same overall objective: to find a solution that performs well on all considered tasks. The main difference is in the training regimes, where continual learning can only have access to one task at a time, which for neural networks typically leads to catastrophic forgetting. That is, the solution found for a subsequent task does not perform well on the previous ones anymore. However, the relationship between the different minima that the two training regimes arrive at is not well understood. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04495","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/2010.04495/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":"2010.04495","created_at":"2026-07-05T01:41:38.690887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04495v1","created_at":"2026-07-05T01:41:38.690887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04495","created_at":"2026-07-05T01:41:38.690887+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDJUCDKEMZZD","created_at":"2026-07-05T01:41:38.690887+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDJUCDKEMZZDWTR5","created_at":"2026-07-05T01:41:38.690887+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDJUCDKE","created_at":"2026-07-05T01:41:38.690887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28998","citing_title":"Reward-Free Code Alignment from Pretrained or Fine-Tuned LLM: Unpacking the Trade-offs for Code Generation","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2506.14951","citing_title":"Flat Channels to Infinity in Neural Loss Landscapes","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2603.18113","citing_title":"VC-Soup: Value-Consistency Guided Multi-Value Alignment for Large Language Models","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09664","citing_title":"FreeMOCA: Memory-Free Continual Learning for Malicious Code Analysis","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09664","citing_title":"FreeMOCA: Memory-Free Continual Learning for Malicious Code Analysis","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME","json":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME.json","graph_json":"https://pith.science/api/pith-number/XDJUCDKEMZZDWTR5VFPPLC4YME/graph.json","events_json":"https://pith.science/api/pith-number/XDJUCDKEMZZDWTR5VFPPLC4YME/events.json","paper":"https://pith.science/paper/XDJUCDKE"},"agent_actions":{"view_html":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME","download_json":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME.json","view_paper":"https://pith.science/paper/XDJUCDKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04495&json=true","fetch_graph":"https://pith.science/api/pith-number/XDJUCDKEMZZDWTR5VFPPLC4YME/graph.json","fetch_events":"https://pith.science/api/pith-number/XDJUCDKEMZZDWTR5VFPPLC4YME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME/action/storage_attestation","attest_author":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME/action/author_attestation","sign_citation":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME/action/citation_signature","submit_replication":"https://pith.science/pith/XDJUCDKEMZZDWTR5VFPPLC4YME/action/replication_record"}},"created_at":"2026-07-05T01:41:38.690887+00:00","updated_at":"2026-07-05T01:41:38.690887+00:00"}