{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M4GNQ2HLFSOE5H2NFRKKQQFHBM","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":"dd1b4461c60d4af51b510cd239addb81bf3695a4923a30c7ff60e6858bf05343","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T16:37:22Z","title_canon_sha256":"60f3f660612940cab424a556ff852f99c39ab1c8821a8498be6726f3058305ea"},"schema_version":"1.0","source":{"id":"1905.10833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10833","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10833v2","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10833","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"M4GNQ2HLFSOE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M4GNQ2HLFSOE5H2N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M4GNQ2HL","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:db2038a67134dca55fb7476f59cbed149183d4e92b14a44ccc302a72e8687507","target":"graph","created_at":"2026-05-17T23:44:28Z","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":"The minimum-weight $2$-edge-connected spanning subgraph (2-ECSS) problem is a natural generalization of the well-studied minimum-weight spanning tree (MST) problem, and it has received considerable attention in the area of network design. The latter problem asks for a minimum-weight subgraph with an edge connectivity of $1$ between each pair of vertices while the former strengthens this edge-connectivity requirement to $2$. Despite this resemblance, the 2-ECSS problem is considerably more complex than MST. While MST admits a linear-time centralized exact algorithm, 2-ECSS is NP-hard and the be","authors_text":"Michal Dory, Mohsen Ghaffari","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T16:37:22Z","title":"Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10833","kind":"arxiv","version":2},"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:6038515f1a3bb506f97b89366c03308859d6eea6282395db70dc92e8f31eb621","target":"record","created_at":"2026-05-17T23:44:28Z","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":"dd1b4461c60d4af51b510cd239addb81bf3695a4923a30c7ff60e6858bf05343","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T16:37:22Z","title_canon_sha256":"60f3f660612940cab424a556ff852f99c39ab1c8821a8498be6726f3058305ea"},"schema_version":"1.0","source":{"id":"1905.10833","kind":"arxiv","version":2}},"canonical_sha256":"670cd868eb2c9c4e9f4d2c54a840a70b271935c4cc5aff20c7992fd43dc165ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"670cd868eb2c9c4e9f4d2c54a840a70b271935c4cc5aff20c7992fd43dc165ec","first_computed_at":"2026-05-17T23:44:28.413020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.413020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpLw+tqPfNtMwqTSMguvrJehKUJhPNgeSfFYeq2KhceuU0HHi6RD4e27V7qLLSweLQ1r3+X2iI9j5+7lDmRsBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.413592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6038515f1a3bb506f97b89366c03308859d6eea6282395db70dc92e8f31eb621","sha256:db2038a67134dca55fb7476f59cbed149183d4e92b14a44ccc302a72e8687507"],"state_sha256":"722d638e72fe7723ce13ad72d63239f4378a17acd8a8b6deac41c731c50a10bf"}