{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:62QK4KTU2MTUQYHLCKT4FK2BWQ","short_pith_number":"pith:62QK4KTU","schema_version":"1.0","canonical_sha256":"f6a0ae2a74d3274860eb12a7c2ab41b415693c553758961bc5c3945c8767c5b8","source":{"kind":"arxiv","id":"2406.16300","version":1},"attestation_state":"computed","paper":{"title":"Landscaping Linear Mode Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Asja Fischer, Bernhard Sch\\\"olkopf, Linara Adilova, Michael Kamp, Sidak Pal Singh, Thomas Hofmann","submitted_at":"2024-06-24T03:53:30Z","abstract_excerpt":"The presence of linear paths in parameter space between two different network solutions in certain cases, i.e., linear mode connectivity (LMC), has garnered interest from both theoretical and practical fronts. There has been significant research that either practically designs algorithms catered for connecting networks by adjusting for the permutation symmetries as well as some others that more theoretically construct paths through which networks can be connected. Yet, the core reasons for the occurrence of LMC, when in fact it does occur, in the highly non-convex loss landscapes of neural net"},"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":"2406.16300","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T03:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"95599ea6d3294fd715e542ed13ddb2592fbd7931189d4279d5b1309a1db0c4d7","abstract_canon_sha256":"c94604fc5a86350301258fbac1d13a54a12951d8db88711991d3a2d3a4c7d46e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:56.250848Z","signature_b64":"ooz1SKwdQO3GnxI0NLBkc2WPy0Yg6nnmsjydXLfBEBp+YcwJZKuQRS5PDS7ikVBYpe7vwai/4X91HwGJAa6qCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a0ae2a74d3274860eb12a7c2ab41b415693c553758961bc5c3945c8767c5b8","last_reissued_at":"2026-07-05T08:35:56.250424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:56.250424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Landscaping Linear Mode Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Asja Fischer, Bernhard Sch\\\"olkopf, Linara Adilova, Michael Kamp, Sidak Pal Singh, Thomas Hofmann","submitted_at":"2024-06-24T03:53:30Z","abstract_excerpt":"The presence of linear paths in parameter space between two different network solutions in certain cases, i.e., linear mode connectivity (LMC), has garnered interest from both theoretical and practical fronts. There has been significant research that either practically designs algorithms catered for connecting networks by adjusting for the permutation symmetries as well as some others that more theoretically construct paths through which networks can be connected. Yet, the core reasons for the occurrence of LMC, when in fact it does occur, in the highly non-convex loss landscapes of neural net"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16300","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/2406.16300/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":"2406.16300","created_at":"2026-07-05T08:35:56.250485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16300v1","created_at":"2026-07-05T08:35:56.250485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16300","created_at":"2026-07-05T08:35:56.250485+00:00"},{"alias_kind":"pith_short_12","alias_value":"62QK4KTU2MTU","created_at":"2026-07-05T08:35:56.250485+00:00"},{"alias_kind":"pith_short_16","alias_value":"62QK4KTU2MTUQYHL","created_at":"2026-07-05T08:35:56.250485+00:00"},{"alias_kind":"pith_short_8","alias_value":"62QK4KTU","created_at":"2026-07-05T08:35:56.250485+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09263","citing_title":"Rethinking Weight-Averaged Model-merging","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ","json":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ.json","graph_json":"https://pith.science/api/pith-number/62QK4KTU2MTUQYHLCKT4FK2BWQ/graph.json","events_json":"https://pith.science/api/pith-number/62QK4KTU2MTUQYHLCKT4FK2BWQ/events.json","paper":"https://pith.science/paper/62QK4KTU"},"agent_actions":{"view_html":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ","download_json":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ.json","view_paper":"https://pith.science/paper/62QK4KTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16300&json=true","fetch_graph":"https://pith.science/api/pith-number/62QK4KTU2MTUQYHLCKT4FK2BWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/62QK4KTU2MTUQYHLCKT4FK2BWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ/action/storage_attestation","attest_author":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ/action/author_attestation","sign_citation":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ/action/citation_signature","submit_replication":"https://pith.science/pith/62QK4KTU2MTUQYHLCKT4FK2BWQ/action/replication_record"}},"created_at":"2026-07-05T08:35:56.250485+00:00","updated_at":"2026-07-05T08:35:56.250485+00:00"}