{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5HLLVMRRTY6I5R7RTEELQQ2CGP","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":"74648cb9f4a4e93435e120b266211485ae8cc4247b476f6374d574d03b5bf56d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-18T20:58:04Z","title_canon_sha256":"945bf83ce864121a62bd32216764c02bb0761835cdfc8b2080b4be8405820f59"},"schema_version":"1.0","source":{"id":"1801.06237","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06237","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06237v1","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06237","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"5HLLVMRRTY6I","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5HLLVMRRTY6I5R7R","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5HLLVMRR","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:74cd83a5580cecb30e95783e5ce3fe01339ac0f776027915a0db05c08ec998ae","target":"graph","created_at":"2026-05-18T00:14:53Z","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":"Distributed network optimization algorithms, such as minimum spanning tree, minimum cut, and shortest path, are an active research area in distributed computing. This paper presents a fast distributed algorithm for such problems in the CONGEST model, on networks that exclude a fixed minor.\n  On general graphs, many optimization problems, including the ones mentioned above, require $\\tilde\\Omega(\\sqrt n)$ rounds of communication in the CONGEST model, even if the network graph has a much smaller diameter. Naturally, the next step in algorithm design is to design efficient algorithms which bypass","authors_text":"Bernhard Haeupler, Goran Zuzic, Jason Li","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-18T20:58:04Z","title":"Minor Excluded Network Families Admit Fast Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06237","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:dbecf9ba50dc54927ff62edd8b16ad3b56f676ed4ed073665da4c200c2d02be2","target":"record","created_at":"2026-05-18T00:14:53Z","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":"74648cb9f4a4e93435e120b266211485ae8cc4247b476f6374d574d03b5bf56d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-18T20:58:04Z","title_canon_sha256":"945bf83ce864121a62bd32216764c02bb0761835cdfc8b2080b4be8405820f59"},"schema_version":"1.0","source":{"id":"1801.06237","kind":"arxiv","version":1}},"canonical_sha256":"e9d6bab2319e3c8ec7f19908b8434233d58da072caad449c103721bdd158a3fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9d6bab2319e3c8ec7f19908b8434233d58da072caad449c103721bdd158a3fb","first_computed_at":"2026-05-18T00:14:53.939215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:53.939215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GFyzQbt2tYG68mU5Yc5TVZjPxuPxzO3ja5aSoqip/etGUMdP/l6Cw3eHdZHz7fy/dCndpQOoKlGRXPFRoAlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:53.939944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06237","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbecf9ba50dc54927ff62edd8b16ad3b56f676ed4ed073665da4c200c2d02be2","sha256:74cd83a5580cecb30e95783e5ce3fe01339ac0f776027915a0db05c08ec998ae"],"state_sha256":"f1b45ed9c86a173461b308edbdcb8c58394ae1cbcdb7a3cc2691ae8d535502da"}