{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O","short_pith_number":"pith:PS4YDYQL","schema_version":"1.0","canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","source":{"kind":"arxiv","id":"1612.04790","version":2},"attestation_state":"computed","paper":{"title":"A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vishnu V. Narayan","submitted_at":"2016-12-14T20:07:40Z","abstract_excerpt":"We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Seb\\H{o} and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17/12-approximation algorithm for this problem, and by Seb\\H{o} and Vygen (Combinatorica 2014), who improved the approximation ratio to 4/3."},"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":"1612.04790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-14T20:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0","abstract_canon_sha256":"f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:37.221481Z","signature_b64":"oZJWG51S2T1BrH3x4EQ+eIXR3zTle7XS/jRPg+mbe2TU7mczBCVn2/AM90FsIFOkLNDhyCxO6FH+QQAq4Q09DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121","last_reissued_at":"2026-05-18T00:52:37.221002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:37.221002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Vishnu V. Narayan","submitted_at":"2016-12-14T20:07:40Z","abstract_excerpt":"We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for approximating connectivity problems, which was previously used in algorithms for finding the smallest 2-edge-connected spanning subgraph by Cheriyan, Seb\\H{o} and Szigeti (SIAM J.Discrete Math. 2001) who gave a 17/12-approximation algorithm for this problem, and by Seb\\H{o} and Vygen (Combinatorica 2014), who improved the approximation ratio to 4/3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04790","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":"1612.04790","created_at":"2026-05-18T00:52:37.221077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04790v2","created_at":"2026-05-18T00:52:37.221077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04790","created_at":"2026-05-18T00:52:37.221077+00:00"},{"alias_kind":"pith_short_12","alias_value":"PS4YDYQL4RKV","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PS4YDYQL4RKVBN3H","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PS4YDYQL","created_at":"2026-05-18T12:30:39.010887+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/PS4YDYQL4RKVBN3HRWHT4VDF7O","json":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O.json","graph_json":"https://pith.science/api/pith-number/PS4YDYQL4RKVBN3HRWHT4VDF7O/graph.json","events_json":"https://pith.science/api/pith-number/PS4YDYQL4RKVBN3HRWHT4VDF7O/events.json","paper":"https://pith.science/paper/PS4YDYQL"},"agent_actions":{"view_html":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O","download_json":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O.json","view_paper":"https://pith.science/paper/PS4YDYQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04790&json=true","fetch_graph":"https://pith.science/api/pith-number/PS4YDYQL4RKVBN3HRWHT4VDF7O/graph.json","fetch_events":"https://pith.science/api/pith-number/PS4YDYQL4RKVBN3HRWHT4VDF7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/action/storage_attestation","attest_author":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/action/author_attestation","sign_citation":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/action/citation_signature","submit_replication":"https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O/action/replication_record"}},"created_at":"2026-05-18T00:52:37.221077+00:00","updated_at":"2026-05-18T00:52:37.221077+00:00"}