{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R3HXOIJIYU5B3CQQEGHW7FA4ZO","short_pith_number":"pith:R3HXOIJI","canonical_record":{"source":{"id":"1009.5734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T01:46:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"12bf6996a4ad6c74ce02e813edf85298ab480c3325a2a2bd376ce639eed0b209","abstract_canon_sha256":"4014a766d93b96da7c2c819a03a4ec630975b7a51c9ec92ccba82fbe46ce891d"},"schema_version":"1.0"},"canonical_sha256":"8ecf772128c53a1d8a10218f6f941ccb91d485d4a398fce74cc23c9d1042a267","source":{"kind":"arxiv","id":"1009.5734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5734","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5734v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5734","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"R3HXOIJIYU5B","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R3HXOIJIYU5B3CQQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R3HXOIJI","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R3HXOIJIYU5B3CQQEGHW7FA4ZO","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T01:46:05Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"12bf6996a4ad6c74ce02e813edf85298ab480c3325a2a2bd376ce639eed0b209","abstract_canon_sha256":"4014a766d93b96da7c2c819a03a4ec630975b7a51c9ec92ccba82fbe46ce891d"},"schema_version":"1.0"},"canonical_sha256":"8ecf772128c53a1d8a10218f6f941ccb91d485d4a398fce74cc23c9d1042a267","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.058614Z","signature_b64":"RJSxXZ7zMeGw/JebtLEi2YWdB89Cl+EfAiuSLhzOLMLfotUG1AulDgh8cWnOxatfDTB8+8ucTfR1oVO19LsMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ecf772128c53a1d8a10218f6f941ccb91d485d4a398fce74cc23c9d1042a267","last_reissued_at":"2026-05-18T04:40:09.058180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.058180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5734","source_version":1,"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-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiOoZTnfriFfTotwXXGLRyP1gqOFf5V2Cacg3CZ9+k4MU8J0a+vwh1WmtrsbdWoJ256BwU3SLbbt0pvRBXkMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:45:34.900309Z"},"content_sha256":"739fb1b5a8583e0238f5bad3dd1ee51fbd4e4146f7a78a0104317e22832ad567","schema_version":"1.0","event_id":"sha256:739fb1b5a8583e0238f5bad3dd1ee51fbd4e4146f7a78a0104317e22832ad567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R3HXOIJIYU5B3CQQEGHW7FA4ZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability of Capacitated Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Deeparnab Chakrabarty, Nitish Korula, Sanjeev Khanna","submitted_at":"2010-09-29T01:46:05Z","abstract_excerpt":"In the {\\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimum-cut requirements. Unlike its classical special case of SNDP when all capacities are unit, the approximability of Cap-SNDP is not well understood; even in very restricted settings no known algorithm achieves a $o(m)$ approximation, where $m$ is the number of edges in the graph. In this paper, we obtain several new results and insights into the appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5734","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"},"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-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzgB9YzXyzSer1amGRVrSaqdNX6J83CB+U32Fzr6rW3YbmM6uYSkxCr5XPkEJfUtiUN7V5uGczEghnA7lEaaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:45:34.901046Z"},"content_sha256":"87ae1cdd0ed8f347926c85d794cbacd87b952a7a397c557036a1dfdfbbf3e5a0","schema_version":"1.0","event_id":"sha256:87ae1cdd0ed8f347926c85d794cbacd87b952a7a397c557036a1dfdfbbf3e5a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/bundle.json","state_url":"https://pith.science/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/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-08T04:45:34Z","links":{"resolver":"https://pith.science/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO","bundle":"https://pith.science/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/bundle.json","state":"https://pith.science/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3HXOIJIYU5B3CQQEGHW7FA4ZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R3HXOIJIYU5B3CQQEGHW7FA4ZO","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":"4014a766d93b96da7c2c819a03a4ec630975b7a51c9ec92ccba82fbe46ce891d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T01:46:05Z","title_canon_sha256":"12bf6996a4ad6c74ce02e813edf85298ab480c3325a2a2bd376ce639eed0b209"},"schema_version":"1.0","source":{"id":"1009.5734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5734","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5734v1","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5734","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"R3HXOIJIYU5B","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R3HXOIJIYU5B3CQQ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R3HXOIJI","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:87ae1cdd0ed8f347926c85d794cbacd87b952a7a397c557036a1dfdfbbf3e5a0","target":"graph","created_at":"2026-05-18T04:40:09Z","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 {\\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minimum cost subset of edges that satisfies a given set of pairwise minimum-cut requirements. Unlike its classical special case of SNDP when all capacities are unit, the approximability of Cap-SNDP is not well understood; even in very restricted settings no known algorithm achieves a $o(m)$ approximation, where $m$ is the number of edges in the graph. In this paper, we obtain several new results and insights into the appr","authors_text":"Chandra Chekuri, Deeparnab Chakrabarty, Nitish Korula, Sanjeev Khanna","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T01:46:05Z","title":"Approximability of Capacitated Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5734","kind":"arxiv","version":1},"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:739fb1b5a8583e0238f5bad3dd1ee51fbd4e4146f7a78a0104317e22832ad567","target":"record","created_at":"2026-05-18T04:40:09Z","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":"4014a766d93b96da7c2c819a03a4ec630975b7a51c9ec92ccba82fbe46ce891d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-29T01:46:05Z","title_canon_sha256":"12bf6996a4ad6c74ce02e813edf85298ab480c3325a2a2bd376ce639eed0b209"},"schema_version":"1.0","source":{"id":"1009.5734","kind":"arxiv","version":1}},"canonical_sha256":"8ecf772128c53a1d8a10218f6f941ccb91d485d4a398fce74cc23c9d1042a267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ecf772128c53a1d8a10218f6f941ccb91d485d4a398fce74cc23c9d1042a267","first_computed_at":"2026-05-18T04:40:09.058180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:09.058180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJSxXZ7zMeGw/JebtLEi2YWdB89Cl+EfAiuSLhzOLMLfotUG1AulDgh8cWnOxatfDTB8+8ucTfR1oVO19LsMCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:09.058614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:739fb1b5a8583e0238f5bad3dd1ee51fbd4e4146f7a78a0104317e22832ad567","sha256:87ae1cdd0ed8f347926c85d794cbacd87b952a7a397c557036a1dfdfbbf3e5a0"],"state_sha256":"a755b818e333ff983022917ca4e588a3cefe2117955e8efa0ca5a71842e5f241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvYQSQEV/dWiZ7YuN1NBxiN6auj8+4xJ4e1WuBw+LTc4RdKvGJhnYvhv87Urk440xZYCRMYGcRN+4k778G9mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:45:34.904961Z","bundle_sha256":"97b199628ba59f36977f849ee8eb5fa646af60218b0fc690463aebd28d4c5be5"}}