{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FKEGSKMJHR63ZYC3LNOVXAF776","short_pith_number":"pith:FKEGSKMJ","schema_version":"1.0","canonical_sha256":"2a886929893c7dbce05b5b5d5b80bfffa091132e0d35f8f79da1f546f6cea469","source":{"kind":"arxiv","id":"2509.18279","version":3},"attestation_state":"computed","paper":{"title":"Emergent Topology of Optimal Networks for Synchrony","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"nlin.AO","authors_text":"Dane Taylor, Guram Mikaberidze","submitted_at":"2025-09-22T18:06:46Z","abstract_excerpt":"Designing high-performing networks requires optimizing for functionality while respecting physical, geometric, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for collective dynamics arising from heterogeneous dynamical units. Here, we develop a gradient-based optimization framework to identify synchrony-optimal weighted networks under a constrained coupling budget. The resulting networks exhibit counterintuitive properties: they are sparse, bipartite, elongated, and extremely monophilic (i.e., the neighbors of any node are s"},"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":"2509.18279","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2025-09-22T18:06:46Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"a2361db4931e02143fd0113aef78a946f787870c1a3e9d2059903c581736f2d2","abstract_canon_sha256":"45dec535f686990bbf73c6c8f1c6de38b99f2230af578089348642a6ecb594e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.263622Z","signature_b64":"lcIDBq1r8heFSbQrAdlE2epXZM0przXIKF6I50Scy+DtDWbGXefjUAfDv/3inLdieSd2a6f8boBpRcUtlpNDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a886929893c7dbce05b5b5d5b80bfffa091132e0d35f8f79da1f546f6cea469","last_reissued_at":"2026-05-18T02:44:33.263085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.263085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Emergent Topology of Optimal Networks for Synchrony","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"nlin.AO","authors_text":"Dane Taylor, Guram Mikaberidze","submitted_at":"2025-09-22T18:06:46Z","abstract_excerpt":"Designing high-performing networks requires optimizing for functionality while respecting physical, geometric, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for collective dynamics arising from heterogeneous dynamical units. Here, we develop a gradient-based optimization framework to identify synchrony-optimal weighted networks under a constrained coupling budget. The resulting networks exhibit counterintuitive properties: they are sparse, bipartite, elongated, and extremely monophilic (i.e., the neighbors of any node are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.18279","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"2509.18279","created_at":"2026-05-18T02:44:33.263160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.18279v3","created_at":"2026-05-18T02:44:33.263160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.18279","created_at":"2026-05-18T02:44:33.263160+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKEGSKMJHR63","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKEGSKMJHR63ZYC3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKEGSKMJ","created_at":"2026-05-18T12:33:37.589309+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/FKEGSKMJHR63ZYC3LNOVXAF776","json":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776.json","graph_json":"https://pith.science/api/pith-number/FKEGSKMJHR63ZYC3LNOVXAF776/graph.json","events_json":"https://pith.science/api/pith-number/FKEGSKMJHR63ZYC3LNOVXAF776/events.json","paper":"https://pith.science/paper/FKEGSKMJ"},"agent_actions":{"view_html":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776","download_json":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776.json","view_paper":"https://pith.science/paper/FKEGSKMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.18279&json=true","fetch_graph":"https://pith.science/api/pith-number/FKEGSKMJHR63ZYC3LNOVXAF776/graph.json","fetch_events":"https://pith.science/api/pith-number/FKEGSKMJHR63ZYC3LNOVXAF776/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776/action/storage_attestation","attest_author":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776/action/author_attestation","sign_citation":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776/action/citation_signature","submit_replication":"https://pith.science/pith/FKEGSKMJHR63ZYC3LNOVXAF776/action/replication_record"}},"created_at":"2026-05-18T02:44:33.263160+00:00","updated_at":"2026-05-18T02:44:33.263160+00:00"}