{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3GFEWOIW67UQDZRLMNPTOTJ4ZP","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":"1efca56c4a375fa431c76200e771908bb16e180dcfc85c1b889ef217e0b99323","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T12:58:12Z","title_canon_sha256":"9c37167d5a0f3a72693aa6f0cea46c4e5719985bc846c3dd6d299516be4b0ac2"},"schema_version":"1.0","source":{"id":"1711.03359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03359","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03359v2","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03359","created_at":"2026-05-17T23:46:36Z"},{"alias_kind":"pith_short_12","alias_value":"3GFEWOIW67UQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GFEWOIW67UQDZRL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GFEWOIW","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:bcda98f32a72a1261cf754737675b1cb942165e4d849b8c90c3a24eff5f792fb","target":"graph","created_at":"2026-05-17T23:46:36Z","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 tree augmentation problem (TAP) is a fundamental network design problem, in which the input is a graph $G$ and a spanning tree $T$ for it, and the goal is to augment $T$ with a minimum set of edges $Aug$ from $G$, such that $T \\cup Aug$ is 2-edge-connected.\n  TAP has been widely studied in the sequential setting. The best known approximation ratio of 2 for the weighted case dates back to the work of Frederickson and J\\'{a}J\\'{a}, SICOMP 1981. Recently, a 3/2-approximation was given for unweighted TAP by Kortsarz and Nutov, TALG 2016. Recent breakthroughs give an approximation of 1.458 for ","authors_text":"Keren Censor-Hillel, Michal Dory","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T12:58:12Z","title":"Fast Distributed Approximation for TAP and 2-Edge-Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03359","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:e590086c29deec9c0f1d1046c859dcf057f41cc5a925f1008a66cd083f3e80df","target":"record","created_at":"2026-05-17T23:46:36Z","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":"1efca56c4a375fa431c76200e771908bb16e180dcfc85c1b889ef217e0b99323","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T12:58:12Z","title_canon_sha256":"9c37167d5a0f3a72693aa6f0cea46c4e5719985bc846c3dd6d299516be4b0ac2"},"schema_version":"1.0","source":{"id":"1711.03359","kind":"arxiv","version":2}},"canonical_sha256":"d98a4b3916f7e901e62b635f374d3ccbf31115bcea93282a4d10701d95d83caa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d98a4b3916f7e901e62b635f374d3ccbf31115bcea93282a4d10701d95d83caa","first_computed_at":"2026-05-17T23:46:36.476804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:36.476804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vS6DAHyZ7DVTIRHaD079LuHrSsNFNydjw9fuQ1mtgW9G4bDhf8+nQc11hUL3ZHCMQUua5fC7mjv9njmh/yqhBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:36.477482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e590086c29deec9c0f1d1046c859dcf057f41cc5a925f1008a66cd083f3e80df","sha256:bcda98f32a72a1261cf754737675b1cb942165e4d849b8c90c3a24eff5f792fb"],"state_sha256":"0a0689a68eb38327fbcbad932e2b25cba5fecc5b6faccb7057e9522e531f731b"}