{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KAXDIANQWT2VMOLYBXJRIERDMM","short_pith_number":"pith:KAXDIANQ","schema_version":"1.0","canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","source":{"kind":"arxiv","id":"1805.07764","version":1},"attestation_state":"computed","paper":{"title":"Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Michal Dory","submitted_at":"2018-05-20T12:59:17Z","abstract_excerpt":"In the minimum $k$-edge-connected spanning subgraph ($k$-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to $k-1$ edge failures. This is a central problem in network design, and a natural generalization of the minimum spanning tree (MST) problem. While the MST problem has been studied extensively by the distributed computing community, for $k \\geq 2$ less is known in the distributed setting.\n  In this paper, we present fast randomized distributed approximation algorithms for $k$-ECSS in the CONGEST model. Our first contribution is an $\\widetilde{O}(D + \\sqrt{n})$-"},"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":"1805.07764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T12:59:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e6d777189c992e64de08f99a42e1a680b73f1ccf5f5986136e7d68db1a6784ee","abstract_canon_sha256":"884a2f6e0835bc8fd3294080a7990f096256bd89185c01f4c5290a153b4bff49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.611634Z","signature_b64":"AZaymlCSRMJqe1TJyOu4CeKiiqtqn6c5pJxd3nTPgxQVz5SWvvl5Y9+TRQfOmRSq+ajEL6N98magoaHwVtJHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","last_reissued_at":"2026-05-18T00:15:32.611144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.611144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Michal Dory","submitted_at":"2018-05-20T12:59:17Z","abstract_excerpt":"In the minimum $k$-edge-connected spanning subgraph ($k$-ECSS) problem the goal is to find the minimum weight subgraph resistant to up to $k-1$ edge failures. This is a central problem in network design, and a natural generalization of the minimum spanning tree (MST) problem. While the MST problem has been studied extensively by the distributed computing community, for $k \\geq 2$ less is known in the distributed setting.\n  In this paper, we present fast randomized distributed approximation algorithms for $k$-ECSS in the CONGEST model. Our first contribution is an $\\widetilde{O}(D + \\sqrt{n})$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07764","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":"1805.07764","created_at":"2026-05-18T00:15:32.611216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07764v1","created_at":"2026-05-18T00:15:32.611216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07764","created_at":"2026-05-18T00:15:32.611216+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAXDIANQWT2V","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAXDIANQWT2VMOLY","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAXDIANQ","created_at":"2026-05-18T12:32:33.847187+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/KAXDIANQWT2VMOLYBXJRIERDMM","json":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM.json","graph_json":"https://pith.science/api/pith-number/KAXDIANQWT2VMOLYBXJRIERDMM/graph.json","events_json":"https://pith.science/api/pith-number/KAXDIANQWT2VMOLYBXJRIERDMM/events.json","paper":"https://pith.science/paper/KAXDIANQ"},"agent_actions":{"view_html":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM","download_json":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM.json","view_paper":"https://pith.science/paper/KAXDIANQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07764&json=true","fetch_graph":"https://pith.science/api/pith-number/KAXDIANQWT2VMOLYBXJRIERDMM/graph.json","fetch_events":"https://pith.science/api/pith-number/KAXDIANQWT2VMOLYBXJRIERDMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/action/storage_attestation","attest_author":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/action/author_attestation","sign_citation":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/action/citation_signature","submit_replication":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/action/replication_record"}},"created_at":"2026-05-18T00:15:32.611216+00:00","updated_at":"2026-05-18T00:15:32.611216+00:00"}