{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5HLLVMRRTY6I5R7RTEELQQ2CGP","short_pith_number":"pith:5HLLVMRR","schema_version":"1.0","canonical_sha256":"e9d6bab2319e3c8ec7f19908b8434233d58da072caad449c103721bdd158a3fb","source":{"kind":"arxiv","id":"1801.06237","version":1},"attestation_state":"computed","paper":{"title":"Minor Excluded Network Families Admit Fast Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Jason Li","submitted_at":"2018-01-18T20:58:04Z","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"},"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":"1801.06237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-18T20:58:04Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"945bf83ce864121a62bd32216764c02bb0761835cdfc8b2080b4be8405820f59","abstract_canon_sha256":"74648cb9f4a4e93435e120b266211485ae8cc4247b476f6374d574d03b5bf56d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:53.939944Z","signature_b64":"1GFyzQbt2tYG68mU5Yc5TVZjPxuPxzO3ja5aSoqip/etGUMdP/l6Cw3eHdZHz7fy/dCndpQOoKlGRXPFRoAlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9d6bab2319e3c8ec7f19908b8434233d58da072caad449c103721bdd158a3fb","last_reissued_at":"2026-05-18T00:14:53.939215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:53.939215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minor Excluded Network Families Admit Fast Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Jason Li","submitted_at":"2018-01-18T20:58:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06237","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":"1801.06237","created_at":"2026-05-18T00:14:53.939333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.06237v1","created_at":"2026-05-18T00:14:53.939333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06237","created_at":"2026-05-18T00:14:53.939333+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HLLVMRRTY6I","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HLLVMRRTY6I5R7R","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HLLVMRR","created_at":"2026-05-18T12:32:08.215937+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/5HLLVMRRTY6I5R7RTEELQQ2CGP","json":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP.json","graph_json":"https://pith.science/api/pith-number/5HLLVMRRTY6I5R7RTEELQQ2CGP/graph.json","events_json":"https://pith.science/api/pith-number/5HLLVMRRTY6I5R7RTEELQQ2CGP/events.json","paper":"https://pith.science/paper/5HLLVMRR"},"agent_actions":{"view_html":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP","download_json":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP.json","view_paper":"https://pith.science/paper/5HLLVMRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.06237&json=true","fetch_graph":"https://pith.science/api/pith-number/5HLLVMRRTY6I5R7RTEELQQ2CGP/graph.json","fetch_events":"https://pith.science/api/pith-number/5HLLVMRRTY6I5R7RTEELQQ2CGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP/action/storage_attestation","attest_author":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP/action/author_attestation","sign_citation":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP/action/citation_signature","submit_replication":"https://pith.science/pith/5HLLVMRRTY6I5R7RTEELQQ2CGP/action/replication_record"}},"created_at":"2026-05-18T00:14:53.939333+00:00","updated_at":"2026-05-18T00:14:53.939333+00:00"}