{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O64LYPROLUOIQDDJJWT25IO4W3","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":"360a33f07fa5ada29c41be0f72e070249af79e537d81fb78473a0f17383770ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T15:32:18Z","title_canon_sha256":"d7d32e3285a7e7e03492f62dba86204c52d4fb3366ac74abad1d0e92e1f37c96"},"schema_version":"1.0","source":{"id":"1607.03791","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03791","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03791v2","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03791","created_at":"2026-05-18T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"O64LYPROLUOI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O64LYPROLUOIQDDJ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O64LYPRO","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:f0375c80f4d035df40a921984f2fe7d3945549b7f5c785ebbe3173f110953f3f","target":"graph","created_at":"2026-05-18T01:04:37Z","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 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 ","authors_text":"David Adjiashvili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T15:32:18Z","title":"Improved Approximation for Weighted Tree Augmentation with Bounded Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03791","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:02d078343e77c9937bce03f19a8a920651da6565d970613f36a8c58e1f3cf133","target":"record","created_at":"2026-05-18T01:04:37Z","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":"360a33f07fa5ada29c41be0f72e070249af79e537d81fb78473a0f17383770ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T15:32:18Z","title_canon_sha256":"d7d32e3285a7e7e03492f62dba86204c52d4fb3366ac74abad1d0e92e1f37c96"},"schema_version":"1.0","source":{"id":"1607.03791","kind":"arxiv","version":2}},"canonical_sha256":"77b8bc3e2e5d1c880c694da7aea1dcb6c55c31727a75471c6ab20aa79b1a2d8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77b8bc3e2e5d1c880c694da7aea1dcb6c55c31727a75471c6ab20aa79b1a2d8b","first_computed_at":"2026-05-18T01:04:37.106898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:37.106898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hct/pag8IOwAQnpUWi4562GBgobpHaQLgFfBUJtlnQZToQiDBudZUAVrzI2/HKMAYFnyJT5GT/srkNBHml4+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:37.107670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03791","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02d078343e77c9937bce03f19a8a920651da6565d970613f36a8c58e1f3cf133","sha256:f0375c80f4d035df40a921984f2fe7d3945549b7f5c785ebbe3173f110953f3f"],"state_sha256":"95f8037a971b4a24392a4a9200357203243c654fc56a724846954b903fa97dd5"}