{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4HQ2SNNE6QNRSQI5P4IZNMPCBN","short_pith_number":"pith:4HQ2SNNE","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"},"canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","source":{"kind":"arxiv","id":"1205.1262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1262","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1262v2","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1262","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"4HQ2SNNE6QNR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4HQ2SNNE6QNRSQI5","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4HQ2SNNE","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4HQ2SNNE6QNRSQI5P4IZNMPCBN","target":"record","payload":{"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"},"canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","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"},"source_kind":"arxiv","source_id":"1205.1262","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltg5937yPD+yzXZlTH9eX+80O+jV+QxLmV5j5nTLCB6kIYnJmDD6Mf6yEzMBxBB83GDSVZ5aaP2KEB5M+tZMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:43:36.028114Z"},"content_sha256":"46db28a69c8d139cc275bf5b33bc454832950a02d60846bfd4c0803ed90a153b","schema_version":"1.0","event_id":"sha256:46db28a69c8d139cc275bf5b33bc454832950a02d60846bfd4c0803ed90a153b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4HQ2SNNE6QNRSQI5P4IZNMPCBN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbeTMphD0aXSlqn6kWZL5OIbD/lEHUZB5/lzF6MTZip2TmiegLOndCdCqDvuRuea/r8NCoTNjKH9SrEPOuIxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:43:36.028477Z"},"content_sha256":"5020b86581d1e937ccf92f996de02d1094f1bb9db71d4aebe85d18a43d98d5e4","schema_version":"1.0","event_id":"sha256:5020b86581d1e937ccf92f996de02d1094f1bb9db71d4aebe85d18a43d98d5e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/bundle.json","state_url":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T02:43:36Z","links":{"resolver":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN","bundle":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/bundle.json","state":"https://pith.science/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HQ2SNNE6QNRSQI5P4IZNMPCBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4HQ2SNNE6QNRSQI5P4IZNMPCBN","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":"75f0f4f1098cc98141492a8711a4f5fbb9e663e1845ab20a8a6c78e1d9070c54","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T00:53:53Z","title_canon_sha256":"25244b9495b0cfa7d0e21a080b10abe589c040e5b0c089fec723b7e39738f88b"},"schema_version":"1.0","source":{"id":"1205.1262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1262","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1262v2","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1262","created_at":"2026-05-18T03:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"4HQ2SNNE6QNR","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4HQ2SNNE6QNRSQI5","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4HQ2SNNE","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:5020b86581d1e937ccf92f996de02d1094f1bb9db71d4aebe85d18a43d98d5e4","target":"graph","created_at":"2026-05-18T03:56:10Z","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":"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","authors_text":"Bundit Laekhanukit, Mohit Singh, Shayan Oveis Gharan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T00:53:53Z","title":"A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1262","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:46db28a69c8d139cc275bf5b33bc454832950a02d60846bfd4c0803ed90a153b","target":"record","created_at":"2026-05-18T03:56:10Z","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":"75f0f4f1098cc98141492a8711a4f5fbb9e663e1845ab20a8a6c78e1d9070c54","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-07T00:53:53Z","title_canon_sha256":"25244b9495b0cfa7d0e21a080b10abe589c040e5b0c089fec723b7e39738f88b"},"schema_version":"1.0","source":{"id":"1205.1262","kind":"arxiv","version":2}},"canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1e1a935a4f41b19411d7f1196b1e20b78b445015b95e51258cf9bb1556330be","first_computed_at":"2026-05-18T03:56:10.102427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:10.102427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNgrW56tdIDxtFKTdWfqkB/A3GNG9Tyuwjx0QiUpMqZHncwvDQGW0vLayr7qdBNqqRao2d0nyEjLJ30XdylbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:10.103193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46db28a69c8d139cc275bf5b33bc454832950a02d60846bfd4c0803ed90a153b","sha256:5020b86581d1e937ccf92f996de02d1094f1bb9db71d4aebe85d18a43d98d5e4"],"state_sha256":"166ef8fe4c37ae7646c844260d923b06968ec4f1970dd1b30eb6d56f8f313b86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MH2GBQ21PneXc8/JphbV8azNZ815V6vLDoXM/rWmRzAfHpLg0dkYaWQZNdUrbhAUSNUp4r1XJzomd6yd2wBvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:43:36.030420Z","bundle_sha256":"8ae2b851639a443dee73151f3f1c9a1c6d6624f8f45db83c037b9adaf221f0d4"}}