{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M4GNQ2HLFSOE5H2NFRKKQQFHBM","short_pith_number":"pith:M4GNQ2HL","canonical_record":{"source":{"id":"1905.10833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T16:37:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"60f3f660612940cab424a556ff852f99c39ab1c8821a8498be6726f3058305ea","abstract_canon_sha256":"dd1b4461c60d4af51b510cd239addb81bf3695a4923a30c7ff60e6858bf05343"},"schema_version":"1.0"},"canonical_sha256":"670cd868eb2c9c4e9f4d2c54a840a70b271935c4cc5aff20c7992fd43dc165ec","source":{"kind":"arxiv","id":"1905.10833","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M4GNQ2HLFSOE5H2NFRKKQQFHBM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T16:37:22Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"60f3f660612940cab424a556ff852f99c39ab1c8821a8498be6726f3058305ea","abstract_canon_sha256":"dd1b4461c60d4af51b510cd239addb81bf3695a4923a30c7ff60e6858bf05343"},"schema_version":"1.0"},"canonical_sha256":"670cd868eb2c9c4e9f4d2c54a840a70b271935c4cc5aff20c7992fd43dc165ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.413592Z","signature_b64":"zpLw+tqPfNtMwqTSMguvrJehKUJhPNgeSfFYeq2KhceuU0HHi6RD4e27V7qLLSweLQ1r3+X2iI9j5+7lDmRsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"670cd868eb2c9c4e9f4d2c54a840a70b271935c4cc5aff20c7992fd43dc165ec","last_reissued_at":"2026-05-17T23:44:28.413020Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.413020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10833","source_version":2,"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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvVu3Wb9L9ifq1PuX3hBSmR6ePN6X7xOopKOcrzPa5HBBBrpoVU0pNhH1FS0rHuL09iXu4/cwMqlP57lfBc+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:37:19.271353Z"},"content_sha256":"6038515f1a3bb506f97b89366c03308859d6eea6282395db70dc92e8f31eb621","schema_version":"1.0","event_id":"sha256:6038515f1a3bb506f97b89366c03308859d6eea6282395db70dc92e8f31eb621"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M4GNQ2HLFSOE5H2NFRKKQQFHBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Michal Dory, Mohsen Ghaffari","submitted_at":"2019-05-26T16:37:22Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10833","kind":"arxiv","version":2},"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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/I3YqBgCyRXJxQyOX6deSvsMqbTunR+Y73SRodteL8xOAqYEEYlhvHttbFynnXwYcceluDKCGNtUhrBNif1zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:37:19.271999Z"},"content_sha256":"db2038a67134dca55fb7476f59cbed149183d4e92b14a44ccc302a72e8687507","schema_version":"1.0","event_id":"sha256:db2038a67134dca55fb7476f59cbed149183d4e92b14a44ccc302a72e8687507"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/bundle.json","state_url":"https://pith.science/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/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-02T04:37:19Z","links":{"resolver":"https://pith.science/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM","bundle":"https://pith.science/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/bundle.json","state":"https://pith.science/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4GNQ2HLFSOE5H2NFRKKQQFHBM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cp5BaDdRjpah96p8dHjIzwBhWnoGpHUiSsj8DCqQEKDdZUhIcMXS5zMDLSLQ9KoaHz/Afb18idqze6iJeyl6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:37:19.275070Z","bundle_sha256":"8cf1580a9580116a86f4b41d32c79bf168ace5dd0009971ec2b95903022842d0"}}