{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KAXDIANQWT2VMOLYBXJRIERDMM","short_pith_number":"pith:KAXDIANQ","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"},"canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","source":{"kind":"arxiv","id":"1805.07764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07764","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07764v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07764","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"KAXDIANQWT2V","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KAXDIANQWT2VMOLY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KAXDIANQ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KAXDIANQWT2VMOLYBXJRIERDMM","target":"record","payload":{"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"},"canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","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"},"source_kind":"arxiv","source_id":"1805.07764","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-18T00:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AUszqOSasVOH0G4fBxNycAnoh3kY6m0/vhH9wjbKlo6Yalez9mpFAP/YrGFyixF6EH9+4i2MkKyBTH4Hy5mBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:36.738967Z"},"content_sha256":"e0bb9114545a0ebffe150c26c263e6c1ab3516e613bd6514a7c2dd103b380900","schema_version":"1.0","event_id":"sha256:e0bb9114545a0ebffe150c26c263e6c1ab3516e613bd6514a7c2dd103b380900"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KAXDIANQWT2VMOLYBXJRIERDMM","target":"graph","payload":{"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"},"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-18T00:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVA9KIfnOOLeFpoDoxKbSyq66m97elPoMqBt38NldYn/G5bKUzAjch/nw84628z4jyrNyappY/lzCcx/9zaLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:28:36.739308Z"},"content_sha256":"5429b89d3eab02ed795a64f69a7c488437b172eb7f85bb211dd672c9bd0f155f","schema_version":"1.0","event_id":"sha256:5429b89d3eab02ed795a64f69a7c488437b172eb7f85bb211dd672c9bd0f155f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/bundle.json","state_url":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAXDIANQWT2VMOLYBXJRIERDMM/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-02T02:28:36Z","links":{"resolver":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM","bundle":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/bundle.json","state":"https://pith.science/pith/KAXDIANQWT2VMOLYBXJRIERDMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAXDIANQWT2VMOLYBXJRIERDMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KAXDIANQWT2VMOLYBXJRIERDMM","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":"884a2f6e0835bc8fd3294080a7990f096256bd89185c01f4c5290a153b4bff49","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T12:59:17Z","title_canon_sha256":"e6d777189c992e64de08f99a42e1a680b73f1ccf5f5986136e7d68db1a6784ee"},"schema_version":"1.0","source":{"id":"1805.07764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07764","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07764v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07764","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"KAXDIANQWT2V","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KAXDIANQWT2VMOLY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KAXDIANQ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:5429b89d3eab02ed795a64f69a7c488437b172eb7f85bb211dd672c9bd0f155f","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"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})$-","authors_text":"Michal Dory","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T12:59:17Z","title":"Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07764","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:e0bb9114545a0ebffe150c26c263e6c1ab3516e613bd6514a7c2dd103b380900","target":"record","created_at":"2026-05-18T00:15:32Z","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":"884a2f6e0835bc8fd3294080a7990f096256bd89185c01f4c5290a153b4bff49","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-20T12:59:17Z","title_canon_sha256":"e6d777189c992e64de08f99a42e1a680b73f1ccf5f5986136e7d68db1a6784ee"},"schema_version":"1.0","source":{"id":"1805.07764","kind":"arxiv","version":1}},"canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"502e3401b0b4f55639780dd3141223630b1fb7624babec854ca97d8703e130ee","first_computed_at":"2026-05-18T00:15:32.611144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.611144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AZaymlCSRMJqe1TJyOu4CeKiiqtqn6c5pJxd3nTPgxQVz5SWvvl5Y9+TRQfOmRSq+ajEL6N98magoaHwVtJHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.611634Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0bb9114545a0ebffe150c26c263e6c1ab3516e613bd6514a7c2dd103b380900","sha256:5429b89d3eab02ed795a64f69a7c488437b172eb7f85bb211dd672c9bd0f155f"],"state_sha256":"829512544828867c1f43ce413c0cbbd626d521c5e2765e035334a634119f3695"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMZHx2hp2+JDOCjq1goSKBV2QX+3VUnWQsDYuPhBLCxiusPwh7SnBZhF09Qyg8jk2W4NjeLhl1qjYRfyiP+ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:28:36.741252Z","bundle_sha256":"9c69ba159b9dacfd3c97d95f51ab240761a9698998aa814f7d20cb702290802b"}}