{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TUHTJWPSP5JMOA6YZQWA2VA2ZR","short_pith_number":"pith:TUHTJWPS","schema_version":"1.0","canonical_sha256":"9d0f34d9f27f52c703d8cc2c0d541acc7370e4cbf52ba3beca943cdc61a100b8","source":{"kind":"arxiv","id":"2404.06391","version":1},"attestation_state":"computed","paper":{"title":"Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lei Wu, Puheng Li, Zhanran Lin","submitted_at":"2024-04-09T15:35:02Z","abstract_excerpt":"One of the most intriguing findings in the structure of neural network landscape is the phenomenon of mode connectivity: For two typical global minima, there exists a path connecting them without barrier. This concept of mode connectivity has played a crucial role in understanding important phenomena in deep learning.\n  In this paper, we conduct a fine-grained analysis of this connectivity phenomenon. First, we demonstrate that in the overparameterized case, the connecting path can be as simple as a two-piece linear path, and the path length can be nearly equal to the Euclidean distance. This "},"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":"2404.06391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-09T15:35:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3addec1d792f8c788f705b6df16d072eccea80014119a1f2a9bc4f80e3c06b62","abstract_canon_sha256":"1386f9142acc6352cab7c71def4efd98153dd2526ff899f93898d313d4066d1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:08.546465Z","signature_b64":"Bw0B1oZk7C2A48rskfo/hGW9MMZYZb8zYGAya24gAMeTMZ4VPKy4bwCKhc5nThHDlQG0ZMKagoR0l61lwTNjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d0f34d9f27f52c703d8cc2c0d541acc7370e4cbf52ba3beca943cdc61a100b8","last_reissued_at":"2026-07-05T08:06:08.546029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:08.546029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lei Wu, Puheng Li, Zhanran Lin","submitted_at":"2024-04-09T15:35:02Z","abstract_excerpt":"One of the most intriguing findings in the structure of neural network landscape is the phenomenon of mode connectivity: For two typical global minima, there exists a path connecting them without barrier. This concept of mode connectivity has played a crucial role in understanding important phenomena in deep learning.\n  In this paper, we conduct a fine-grained analysis of this connectivity phenomenon. First, we demonstrate that in the overparameterized case, the connecting path can be as simple as a two-piece linear path, and the path length can be nearly equal to the Euclidean distance. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06391","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/2404.06391/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":"2404.06391","created_at":"2026-07-05T08:06:08.546088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06391v1","created_at":"2026-07-05T08:06:08.546088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06391","created_at":"2026-07-05T08:06:08.546088+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUHTJWPSP5JM","created_at":"2026-07-05T08:06:08.546088+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUHTJWPSP5JMOA6Y","created_at":"2026-07-05T08:06:08.546088+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUHTJWPS","created_at":"2026-07-05T08:06:08.546088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04327","citing_title":"A Geometric Characterization of the Stationary Plateau for Two-Layer Neural Networks","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2506.14951","citing_title":"Flat Channels to Infinity in Neural Loss Landscapes","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09209","citing_title":"Select-then-differentiate: Solving Bilevel Optimization with Manifold Lower-level Solution Sets","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR","json":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR.json","graph_json":"https://pith.science/api/pith-number/TUHTJWPSP5JMOA6YZQWA2VA2ZR/graph.json","events_json":"https://pith.science/api/pith-number/TUHTJWPSP5JMOA6YZQWA2VA2ZR/events.json","paper":"https://pith.science/paper/TUHTJWPS"},"agent_actions":{"view_html":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR","download_json":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR.json","view_paper":"https://pith.science/paper/TUHTJWPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06391&json=true","fetch_graph":"https://pith.science/api/pith-number/TUHTJWPSP5JMOA6YZQWA2VA2ZR/graph.json","fetch_events":"https://pith.science/api/pith-number/TUHTJWPSP5JMOA6YZQWA2VA2ZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR/action/storage_attestation","attest_author":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR/action/author_attestation","sign_citation":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR/action/citation_signature","submit_replication":"https://pith.science/pith/TUHTJWPSP5JMOA6YZQWA2VA2ZR/action/replication_record"}},"created_at":"2026-07-05T08:06:08.546088+00:00","updated_at":"2026-07-05T08:06:08.546088+00:00"}