{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MNQNFJL2CBMV2NYU6SK7GCTGWY","short_pith_number":"pith:MNQNFJL2","schema_version":"1.0","canonical_sha256":"6360d2a57a10595d3714f495f30a66b6396a418395ada4eb99da3ef9a608aa4e","source":{"kind":"arxiv","id":"1702.05567","version":2},"attestation_state":"computed","paper":{"title":"A $\\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chv\\'atal-Gomory Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Martin Gro{\\ss}, Samuel Fiorini","submitted_at":"2017-02-18T03:46:55Z","abstract_excerpt":"The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$, an additional set of edges $L$ called links and a cost vector $c \\in \\mathbb{R}^L_{\\geq 1}$. The goal is to choose a minimum cost subset $S \\subseteq L$ such that $G = (V, E \\cup S)$ is $2$-edge-connected. In the unweighted case, that is, when we have $c_\\ell = 1$ for all $\\ell \\in L$, the problem is called the tree augmentation problem (TAP).\n  Both problems are known to be APX-hard, and the best known approximation factors are $2$ for WTAP by (Frederickson and J"},"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":"1702.05567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-02-18T03:46:55Z","cross_cats_sorted":[],"title_canon_sha256":"f7e6c03e8c6456ea870aa68fb8df65fb91b0c916db1e0cfeb84cce07f62f1845","abstract_canon_sha256":"f3ca64be22758db72c16a2cb14639b6c89074773ce8e08cdf4ac3fbc759f73d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.706181Z","signature_b64":"MintH8OwxYtcRsiDQEUS/gZFjLePOS80GYJA4rlFI/ECZlE6VpFg1EZ9TFUHAtj9oBkXxIDHkVztjGsUMs/ABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6360d2a57a10595d3714f495f30a66b6396a418395ada4eb99da3ef9a608aa4e","last_reissued_at":"2026-05-18T00:50:03.705569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.705569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $\\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chv\\'atal-Gomory Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Martin Gro{\\ss}, Samuel Fiorini","submitted_at":"2017-02-18T03:46:55Z","abstract_excerpt":"The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree $G = (V,E)$, an additional set of edges $L$ called links and a cost vector $c \\in \\mathbb{R}^L_{\\geq 1}$. The goal is to choose a minimum cost subset $S \\subseteq L$ such that $G = (V, E \\cup S)$ is $2$-edge-connected. In the unweighted case, that is, when we have $c_\\ell = 1$ for all $\\ell \\in L$, the problem is called the tree augmentation problem (TAP).\n  Both problems are known to be APX-hard, and the best known approximation factors are $2$ for WTAP by (Frederickson and J"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05567","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":"1702.05567","created_at":"2026-05-18T00:50:03.705668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05567v2","created_at":"2026-05-18T00:50:03.705668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05567","created_at":"2026-05-18T00:50:03.705668+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNQNFJL2CBMV","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNQNFJL2CBMV2NYU","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNQNFJL2","created_at":"2026-05-18T12:31:31.346846+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/MNQNFJL2CBMV2NYU6SK7GCTGWY","json":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY.json","graph_json":"https://pith.science/api/pith-number/MNQNFJL2CBMV2NYU6SK7GCTGWY/graph.json","events_json":"https://pith.science/api/pith-number/MNQNFJL2CBMV2NYU6SK7GCTGWY/events.json","paper":"https://pith.science/paper/MNQNFJL2"},"agent_actions":{"view_html":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY","download_json":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY.json","view_paper":"https://pith.science/paper/MNQNFJL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05567&json=true","fetch_graph":"https://pith.science/api/pith-number/MNQNFJL2CBMV2NYU6SK7GCTGWY/graph.json","fetch_events":"https://pith.science/api/pith-number/MNQNFJL2CBMV2NYU6SK7GCTGWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY/action/storage_attestation","attest_author":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY/action/author_attestation","sign_citation":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY/action/citation_signature","submit_replication":"https://pith.science/pith/MNQNFJL2CBMV2NYU6SK7GCTGWY/action/replication_record"}},"created_at":"2026-05-18T00:50:03.705668+00:00","updated_at":"2026-05-18T00:50:03.705668+00:00"}