{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3GFEWOIW67UQDZRLMNPTOTJ4ZP","short_pith_number":"pith:3GFEWOIW","schema_version":"1.0","canonical_sha256":"d98a4b3916f7e901e62b635f374d3ccbf31115bcea93282a4d10701d95d83caa","source":{"kind":"arxiv","id":"1711.03359","version":2},"attestation_state":"computed","paper":{"title":"Fast Distributed Approximation for TAP and 2-Edge-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Keren Censor-Hillel, Michal Dory","submitted_at":"2017-11-09T12:58:12Z","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 "},"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":"1711.03359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-09T12:58:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9c37167d5a0f3a72693aa6f0cea46c4e5719985bc846c3dd6d299516be4b0ac2","abstract_canon_sha256":"1efca56c4a375fa431c76200e771908bb16e180dcfc85c1b889ef217e0b99323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.477482Z","signature_b64":"vS6DAHyZ7DVTIRHaD079LuHrSsNFNydjw9fuQ1mtgW9G4bDhf8+nQc11hUL3ZHCMQUua5fC7mjv9njmh/yqhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98a4b3916f7e901e62b635f374d3ccbf31115bcea93282a4d10701d95d83caa","last_reissued_at":"2026-05-17T23:46:36.476804Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.476804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Distributed Approximation for TAP and 2-Edge-Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Keren Censor-Hillel, Michal Dory","submitted_at":"2017-11-09T12:58:12Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03359","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03359","created_at":"2026-05-17T23:46:36.476907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03359v2","created_at":"2026-05-17T23:46:36.476907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03359","created_at":"2026-05-17T23:46:36.476907+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GFEWOIW67UQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GFEWOIW67UQDZRL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GFEWOIW","created_at":"2026-05-18T12:30:58.224056+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/3GFEWOIW67UQDZRLMNPTOTJ4ZP","json":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP.json","graph_json":"https://pith.science/api/pith-number/3GFEWOIW67UQDZRLMNPTOTJ4ZP/graph.json","events_json":"https://pith.science/api/pith-number/3GFEWOIW67UQDZRLMNPTOTJ4ZP/events.json","paper":"https://pith.science/paper/3GFEWOIW"},"agent_actions":{"view_html":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP","download_json":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP.json","view_paper":"https://pith.science/paper/3GFEWOIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03359&json=true","fetch_graph":"https://pith.science/api/pith-number/3GFEWOIW67UQDZRLMNPTOTJ4ZP/graph.json","fetch_events":"https://pith.science/api/pith-number/3GFEWOIW67UQDZRLMNPTOTJ4ZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP/action/storage_attestation","attest_author":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP/action/author_attestation","sign_citation":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP/action/citation_signature","submit_replication":"https://pith.science/pith/3GFEWOIW67UQDZRLMNPTOTJ4ZP/action/replication_record"}},"created_at":"2026-05-17T23:46:36.476907+00:00","updated_at":"2026-05-17T23:46:36.476907+00:00"}