{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4UABJSPAF7KIVAC37AUEGWYDYG","short_pith_number":"pith:4UABJSPA","schema_version":"1.0","canonical_sha256":"e50014c9e02fd48a805bf828435b03c1b06b6e8ffebec44c80a0535ae28677f4","source":{"kind":"arxiv","id":"1212.3981","version":1},"attestation_state":"computed","paper":{"title":"Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Joseph Cheriyan, Laszlo A. Vegh","submitted_at":"2012-12-17T13:14:03Z","abstract_excerpt":"We present a 6-approximation algorithm for the minimum-cost $k$-node connected spanning subgraph problem, assuming that the number of nodes is at least $k^3(k-1)+k$. We apply a combinatorial preprocessing, based on the Frank-Tardos algorithm for $k$-outconnectivity, to transform any input into an instance such that the iterative rounding method gives a 2-approximation guarantee. This is the first constant-factor approximation algorithm even in the asymptotic setting of the problem, that is, the restriction to instances where the number of nodes is lower bounded by a function of $k$."},"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":"1212.3981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-12-17T13:14:03Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"4dc1f4121161f8d37b52473438ff99c5933a17f33db98969e14663f380dd4641","abstract_canon_sha256":"e1dc0d3f1dd6d4f015393813b39dc15dbe9e4a9b6b8c83d6225739813807da57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:21.821355Z","signature_b64":"QntMLT7cGnAHy931j7i0XzcoDFhyAaJ48apxvU2P65K5sLWkBa2be7JoJRrRV7Iy6ZR1fOrsNqTbsjivZLWLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e50014c9e02fd48a805bf828435b03c1b06b6e8ffebec44c80a0535ae28677f4","last_reissued_at":"2026-05-18T03:38:21.820822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:21.820822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Joseph Cheriyan, Laszlo A. Vegh","submitted_at":"2012-12-17T13:14:03Z","abstract_excerpt":"We present a 6-approximation algorithm for the minimum-cost $k$-node connected spanning subgraph problem, assuming that the number of nodes is at least $k^3(k-1)+k$. We apply a combinatorial preprocessing, based on the Frank-Tardos algorithm for $k$-outconnectivity, to transform any input into an instance such that the iterative rounding method gives a 2-approximation guarantee. This is the first constant-factor approximation algorithm even in the asymptotic setting of the problem, that is, the restriction to instances where the number of nodes is lower bounded by a function of $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3981","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":"1212.3981","created_at":"2026-05-18T03:38:21.820907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3981v1","created_at":"2026-05-18T03:38:21.820907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3981","created_at":"2026-05-18T03:38:21.820907+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UABJSPAF7KI","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UABJSPAF7KIVAC3","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UABJSPA","created_at":"2026-05-18T12:26:53.410803+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/4UABJSPAF7KIVAC37AUEGWYDYG","json":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG.json","graph_json":"https://pith.science/api/pith-number/4UABJSPAF7KIVAC37AUEGWYDYG/graph.json","events_json":"https://pith.science/api/pith-number/4UABJSPAF7KIVAC37AUEGWYDYG/events.json","paper":"https://pith.science/paper/4UABJSPA"},"agent_actions":{"view_html":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG","download_json":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG.json","view_paper":"https://pith.science/paper/4UABJSPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3981&json=true","fetch_graph":"https://pith.science/api/pith-number/4UABJSPAF7KIVAC37AUEGWYDYG/graph.json","fetch_events":"https://pith.science/api/pith-number/4UABJSPAF7KIVAC37AUEGWYDYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG/action/storage_attestation","attest_author":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG/action/author_attestation","sign_citation":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG/action/citation_signature","submit_replication":"https://pith.science/pith/4UABJSPAF7KIVAC37AUEGWYDYG/action/replication_record"}},"created_at":"2026-05-18T03:38:21.820907+00:00","updated_at":"2026-05-18T03:38:21.820907+00:00"}