{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4HQ2SNNE6QNRSQI5P4IZNMPCBN","short_pith_number":"pith:4HQ2SNNE","schema_version":"1.0","canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","source":{"kind":"arxiv","id":"1205.1262","version":2},"attestation_state":"computed","paper":{"title":"A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Mohit Singh, Shayan Oveis Gharan","submitted_at":"2012-05-07T00:53:53Z","abstract_excerpt":"In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc disjoint paths between any pair of vertices. We give a simple (1 + 1/k)-approximation to the unweighted variant of the problem, where all arcs of G have the same cost. This improves on the 1 + 2/k approximation of Gabow et al. [GGTW09].\n  Similar to the 2-approximation algorithm for this problem [FJ81], our algorithm simply takes the union of a k in-arborescence and a k out-arborescence. The main difference is in the se"},"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":"1205.1262","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T00:53:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"25244b9495b0cfa7d0e21a080b10abe589c040e5b0c089fec723b7e39738f88b","abstract_canon_sha256":"75f0f4f1098cc98141492a8711a4f5fbb9e663e1845ab20a8a6c78e1d9070c54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:10.103193Z","signature_b64":"mNgrW56tdIDxtFKTdWfqkB/A3GNG9Tyuwjx0QiUpMqZHncwvDQGW0vLayr7qdBNqqRao2d0nyEjLJ30XdylbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","last_reissued_at":"2026-05-18T03:56:10.102427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:10.102427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Mohit Singh, Shayan Oveis Gharan","submitted_at":"2012-05-07T00:53:53Z","abstract_excerpt":"In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc disjoint paths between any pair of vertices. We give a simple (1 + 1/k)-approximation to the unweighted variant of the problem, where all arcs of G have the same cost. This improves on the 1 + 2/k approximation of Gabow et al. [GGTW09].\n  Similar to the 2-approximation algorithm for this problem [FJ81], our algorithm simply takes the union of a k in-arborescence and a k out-arborescence. The main difference is in the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1262","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":"1205.1262","created_at":"2026-05-18T03:56:10.102559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1262v2","created_at":"2026-05-18T03:56:10.102559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1262","created_at":"2026-05-18T03:56:10.102559+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HQ2SNNE6QNR","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HQ2SNNE6QNRSQI5","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HQ2SNNE","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/4HQ2SNNE6QNRSQI5P4IZNMPCBN","json":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN.json","graph_json":"https://pith.science/api/pith-number/4HQ2SNNE6QNRSQI5P4IZNMPCBN/graph.json","events_json":"https://pith.science/api/pith-number/4HQ2SNNE6QNRSQI5P4IZNMPCBN/events.json","paper":"https://pith.science/paper/4HQ2SNNE"},"agent_actions":{"view_html":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN","download_json":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN.json","view_paper":"https://pith.science/paper/4HQ2SNNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1262&json=true","fetch_graph":"https://pith.science/api/pith-number/4HQ2SNNE6QNRSQI5P4IZNMPCBN/graph.json","fetch_events":"https://pith.science/api/pith-number/4HQ2SNNE6QNRSQI5P4IZNMPCBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/action/storage_attestation","attest_author":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/action/author_attestation","sign_citation":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/action/citation_signature","submit_replication":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/action/replication_record"}},"created_at":"2026-05-18T03:56:10.102559+00:00","updated_at":"2026-05-18T03:56:10.102559+00:00"}