{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O64LYPROLUOIQDDJJWT25IO4W3","short_pith_number":"pith:O64LYPRO","schema_version":"1.0","canonical_sha256":"77b8bc3e2e5d1c880c694da7aea1dcb6c55c31727a75471c6ab20aa79b1a2d8b","source":{"kind":"arxiv","id":"1607.03791","version":2},"attestation_state":"computed","paper":{"title":"Improved Approximation for Weighted Tree Augmentation with Bounded Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Adjiashvili","submitted_at":"2016-07-13T15:32:18Z","abstract_excerpt":"The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \\subseteq V\\times V$ disjoint from $E$ called \\textit{links}, and a cost vector $c\\in \\mathbb{R}_{\\geq 0}^L$, WTAP asks to find a minimum-cost set $F\\subseteq L$ with the property that $(V,E\\cup F)$ is $2$-edge connected. The special case where $c_\\ell = 1$ for all $\\ell\\in L$ is called the Tree Augmentation Problem (TAP). Both problems are known to be NP-hard.\n  For the class of bounded cost vectors, we present a "},"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":"1607.03791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T15:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"d7d32e3285a7e7e03492f62dba86204c52d4fb3366ac74abad1d0e92e1f37c96","abstract_canon_sha256":"360a33f07fa5ada29c41be0f72e070249af79e537d81fb78473a0f17383770ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:37.107670Z","signature_b64":"hct/pag8IOwAQnpUWi4562GBgobpHaQLgFfBUJtlnQZToQiDBudZUAVrzI2/HKMAYFnyJT5GT/srkNBHml4+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77b8bc3e2e5d1c880c694da7aea1dcb6c55c31727a75471c6ab20aa79b1a2d8b","last_reissued_at":"2026-05-18T01:04:37.106898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:37.106898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation for Weighted Tree Augmentation with Bounded Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Adjiashvili","submitted_at":"2016-07-13T15:32:18Z","abstract_excerpt":"The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \\subseteq V\\times V$ disjoint from $E$ called \\textit{links}, and a cost vector $c\\in \\mathbb{R}_{\\geq 0}^L$, WTAP asks to find a minimum-cost set $F\\subseteq L$ with the property that $(V,E\\cup F)$ is $2$-edge connected. The special case where $c_\\ell = 1$ for all $\\ell\\in L$ is called the Tree Augmentation Problem (TAP). Both problems are known to be NP-hard.\n  For the class of bounded cost vectors, we present a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03791","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":"1607.03791","created_at":"2026-05-18T01:04:37.107019+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03791v2","created_at":"2026-05-18T01:04:37.107019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03791","created_at":"2026-05-18T01:04:37.107019+00:00"},{"alias_kind":"pith_short_12","alias_value":"O64LYPROLUOI","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O64LYPROLUOIQDDJ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O64LYPRO","created_at":"2026-05-18T12:30:36.002864+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/O64LYPROLUOIQDDJJWT25IO4W3","json":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3.json","graph_json":"https://pith.science/api/pith-number/O64LYPROLUOIQDDJJWT25IO4W3/graph.json","events_json":"https://pith.science/api/pith-number/O64LYPROLUOIQDDJJWT25IO4W3/events.json","paper":"https://pith.science/paper/O64LYPRO"},"agent_actions":{"view_html":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3","download_json":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3.json","view_paper":"https://pith.science/paper/O64LYPRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03791&json=true","fetch_graph":"https://pith.science/api/pith-number/O64LYPROLUOIQDDJJWT25IO4W3/graph.json","fetch_events":"https://pith.science/api/pith-number/O64LYPROLUOIQDDJJWT25IO4W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3/action/storage_attestation","attest_author":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3/action/author_attestation","sign_citation":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3/action/citation_signature","submit_replication":"https://pith.science/pith/O64LYPROLUOIQDDJJWT25IO4W3/action/replication_record"}},"created_at":"2026-05-18T01:04:37.107019+00:00","updated_at":"2026-05-18T01:04:37.107019+00:00"}