{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NAFNIDFXBSRGOYDG42OIW7VYTY","short_pith_number":"pith:NAFNIDFX","schema_version":"1.0","canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","source":{"kind":"arxiv","id":"1507.02799","version":1},"attestation_state":"computed","paper":{"title":"A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2015-07-10T08:10:40Z","abstract_excerpt":"The Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \\subseteq E$ such that $(V,{\\cal E} \\cup F)$ is $2$-edge-connected. In the conference version \\cite{EFKN-APPROX} was sketched a $1.5$-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. In the first part \\cite{EFKN-TALG} was only proved ratio $1.8$. An attempt to simplify the second part produced an error in \\cite{EKN-IPL}. Here we give a correct, different, and self cont"},"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":"1507.02799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-10T08:10:40Z","cross_cats_sorted":[],"title_canon_sha256":"6c474e1420436709d1382dd94470fb71db5038aa22f9a893cef16799942bd143","abstract_canon_sha256":"690ef3c648438260182b9df9c9ffdc91c4c0f552c231c2f983b2786d0189ab4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.187837Z","signature_b64":"O66cGj3UT56tK3snyrPvylRw5GTcg3gFlGHLj+yXkZXFsCHoFPhOPQEnhxIp2e+wzMmqymrd0q23VHgqF18xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"680ad40cb70ca2676066e69c8b7eb89e07929238e0956e94bcf18b4159ee1197","last_reissued_at":"2026-05-18T01:37:03.187270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.187270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Zeev Nutov","submitted_at":"2015-07-10T08:10:40Z","abstract_excerpt":"The Tree Augmentation Problem (TAP) is: given a connected graph $G=(V,{\\cal E})$ and an edge set $E$ on $V$ find a minimum size subset of edges $F \\subseteq E$ such that $(V,{\\cal E} \\cup F)$ is $2$-edge-connected. In the conference version \\cite{EFKN-APPROX} was sketched a $1.5$-approximation algorithm for the problem. Since a full proof was very complex and long, the journal version was cut into two parts. In the first part \\cite{EFKN-TALG} was only proved ratio $1.8$. An attempt to simplify the second part produced an error in \\cite{EKN-IPL}. Here we give a correct, different, and self cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02799","kind":"arxiv","version":1},"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":"1507.02799","created_at":"2026-05-18T01:37:03.187383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02799v1","created_at":"2026-05-18T01:37:03.187383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02799","created_at":"2026-05-18T01:37:03.187383+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAFNIDFXBSRG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAFNIDFXBSRGOYDG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAFNIDFX","created_at":"2026-05-18T12:29:32.376354+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/NAFNIDFXBSRGOYDG42OIW7VYTY","json":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY.json","graph_json":"https://pith.science/api/pith-number/NAFNIDFXBSRGOYDG42OIW7VYTY/graph.json","events_json":"https://pith.science/api/pith-number/NAFNIDFXBSRGOYDG42OIW7VYTY/events.json","paper":"https://pith.science/paper/NAFNIDFX"},"agent_actions":{"view_html":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY","download_json":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY.json","view_paper":"https://pith.science/paper/NAFNIDFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02799&json=true","fetch_graph":"https://pith.science/api/pith-number/NAFNIDFXBSRGOYDG42OIW7VYTY/graph.json","fetch_events":"https://pith.science/api/pith-number/NAFNIDFXBSRGOYDG42OIW7VYTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/action/storage_attestation","attest_author":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/action/author_attestation","sign_citation":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/action/citation_signature","submit_replication":"https://pith.science/pith/NAFNIDFXBSRGOYDG42OIW7VYTY/action/replication_record"}},"created_at":"2026-05-18T01:37:03.187383+00:00","updated_at":"2026-05-18T01:37:03.187383+00:00"}