{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:73TRJ7ZDC3M6SFT7MPQOTFBHSO","short_pith_number":"pith:73TRJ7ZD","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"},"canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","source":{"kind":"arxiv","id":"1411.4884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4884","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4884v1","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4884","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"73TRJ7ZDC3M6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"73TRJ7ZDC3M6SFT7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"73TRJ7ZD","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:73TRJ7ZDC3M6SFT7MPQOTFBHSO","target":"record","payload":{"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"},"canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","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"},"source_kind":"arxiv","source_id":"1411.4884","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyRDjF26dbxNVdM0ZTXQp1IW09fRCECXNLEwRtV5+7Hm0SH32Kjg4JdqR+LNgJm+kL/l4VcKsKO8upS0fcosBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:15:53.206271Z"},"content_sha256":"e64ae279a3f3064c7303db81aab6cb964e96dd3056b11f706fd0281ac4c14e48","schema_version":"1.0","event_id":"sha256:e64ae279a3f3064c7303db81aab6cb964e96dd3056b11f706fd0281ac4c14e48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:73TRJ7ZDC3M6SFT7MPQOTFBHSO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SE8BVaIuqfowQ0sKuVM5vKpX3Li+VlvTh2mi0uXGsdyxJvt8AbYOdTsm3Rp8BkH2Ou4W7T3u1dLIZb5oEy2NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:15:53.206643Z"},"content_sha256":"cd7df4273a559f74b3ca6fff4e1443e42238d63f5aa3dd6450625a93c3e283c7","schema_version":"1.0","event_id":"sha256:cd7df4273a559f74b3ca6fff4e1443e42238d63f5aa3dd6450625a93c3e283c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/bundle.json","state_url":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T17:15:53Z","links":{"resolver":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO","bundle":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/bundle.json","state":"https://pith.science/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73TRJ7ZDC3M6SFT7MPQOTFBHSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:73TRJ7ZDC3M6SFT7MPQOTFBHSO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f4fb6019c22154b5d838ecab8666c045d04f97529a224c69066927693778329","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T15:52:17Z","title_canon_sha256":"d45ec876eb70540a8781ddceeba61cc6af66453157cae4451c5ad15a4a2868e0"},"schema_version":"1.0","source":{"id":"1411.4884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4884","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4884v1","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4884","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"73TRJ7ZDC3M6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"73TRJ7ZDC3M6SFT7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"73TRJ7ZD","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:cd7df4273a559f74b3ca6fff4e1443e42238d63f5aa3dd6450625a93c3e283c7","target":"graph","created_at":"2026-05-18T02:34:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Florian D\\\"orfler, Iman Shames, John Lygeros, Tyler Summers","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T15:52:17Z","title":"Topology Design for Optimal Network Coherence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4884","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e64ae279a3f3064c7303db81aab6cb964e96dd3056b11f706fd0281ac4c14e48","target":"record","created_at":"2026-05-18T02:34:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9f4fb6019c22154b5d838ecab8666c045d04f97529a224c69066927693778329","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T15:52:17Z","title_canon_sha256":"d45ec876eb70540a8781ddceeba61cc6af66453157cae4451c5ad15a4a2868e0"},"schema_version":"1.0","source":{"id":"1411.4884","kind":"arxiv","version":1}},"canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fee714ff2316d9e9167f63e0e9942793b734011ce94d3ade7cf9cc920f306467","first_computed_at":"2026-05-18T02:34:51.042197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.042197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HuJy+rZDarAB9PWx9WL2VUilcCp+K/t+TBGPyMnUk7qKUC5Vvk11DfOhAiZYW9KzkkuXJT0bLmkx0vs0X4jYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.042595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e64ae279a3f3064c7303db81aab6cb964e96dd3056b11f706fd0281ac4c14e48","sha256:cd7df4273a559f74b3ca6fff4e1443e42238d63f5aa3dd6450625a93c3e283c7"],"state_sha256":"6baedcc3f6106263bdbd05d7213cc3646217451432b074526f1b490c36b649a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMLbT/vI67xc1ocvyc/NZ5/4ba0AhaShtSLrrBraXWppdTa5OFIRhxIMYzDzjrw9Rj4/bwAQ8qOTuI8K9unACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:15:53.208605Z","bundle_sha256":"dbe052bbedc4878d9801244542bf6199907bb7cebdc0c5be92aa0df9e99902f6"}}