{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:73TRJ7ZDC3M6SFT7MPQOTFBHSO","short_pith_number":"pith:73TRJ7ZD","schema_version":"1.0","canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","source":{"kind":"arxiv","id":"1411.4884","version":1},"attestation_state":"computed","paper":{"title":"Topology Design for Optimal Network Coherence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Florian D\\\"orfler, Iman Shames, John Lygeros, Tyler Summers","submitted_at":"2014-11-18T15:52:17Z","abstract_excerpt":"We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show that network coherence is a submodular function of the network topology. As a consequence, a simple greedy algorithm is guaranteed to produce near optimal edge set selections. We also show that fast rank one updates of the Laplacian pseudoinverse using generalizations of the Sherman-Morrison formula and an accelerated variant of the greedy algorithm can spe"},"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":"1411.4884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T15:52:17Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d45ec876eb70540a8781ddceeba61cc6af66453157cae4451c5ad15a4a2868e0","abstract_canon_sha256":"9f4fb6019c22154b5d838ecab8666c045d04f97529a224c69066927693778329"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.042595Z","signature_b64":"HuJy+rZDarAB9PWx9WL2VUilcCp+K/t+TBGPyMnUk7qKUC5Vvk11DfOhAiZYW9KzkkuXJT0bLmkx0vs0X4jYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","last_reissued_at":"2026-05-18T02:34:51.042197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.042197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topology Design for Optimal Network Coherence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Florian D\\\"orfler, Iman Shames, John Lygeros, Tyler Summers","submitted_at":"2014-11-18T15:52:17Z","abstract_excerpt":"We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show that network coherence is a submodular function of the network topology. As a consequence, a simple greedy algorithm is guaranteed to produce near optimal edge set selections. We also show that fast rank one updates of the Laplacian pseudoinverse using generalizations of the Sherman-Morrison formula and an accelerated variant of the greedy algorithm can spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4884","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":""},"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":"1411.4884","created_at":"2026-05-18T02:34:51.042257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4884v1","created_at":"2026-05-18T02:34:51.042257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4884","created_at":"2026-05-18T02:34:51.042257+00:00"},{"alias_kind":"pith_short_12","alias_value":"73TRJ7ZDC3M6","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"73TRJ7ZDC3M6SFT7","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"73TRJ7ZD","created_at":"2026-05-18T12:28:16.859392+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/73TRJ7ZDC3M6SFT7MPQOTFBHSO","json":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO.json","graph_json":"https://pith.science/api/pith-number/73TRJ7ZDC3M6SFT7MPQOTFBHSO/graph.json","events_json":"https://pith.science/api/pith-number/73TRJ7ZDC3M6SFT7MPQOTFBHSO/events.json","paper":"https://pith.science/paper/73TRJ7ZD"},"agent_actions":{"view_html":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO","download_json":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO.json","view_paper":"https://pith.science/paper/73TRJ7ZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4884&json=true","fetch_graph":"https://pith.science/api/pith-number/73TRJ7ZDC3M6SFT7MPQOTFBHSO/graph.json","fetch_events":"https://pith.science/api/pith-number/73TRJ7ZDC3M6SFT7MPQOTFBHSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/action/storage_attestation","attest_author":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/action/author_attestation","sign_citation":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/action/citation_signature","submit_replication":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/action/replication_record"}},"created_at":"2026-05-18T02:34:51.042257+00:00","updated_at":"2026-05-18T02:34:51.042257+00:00"}