{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CV5T7JD7V4PNHTFJFKFFKFTJ5L","short_pith_number":"pith:CV5T7JD7","canonical_record":{"source":{"id":"1112.3611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T19:11:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dfcd164cd2f9203eda86092a2cc50f4034c36388154e6cd69dff042eb0832110","abstract_canon_sha256":"e10b4608e87e4401af4cc3fcdd1b1ad8b254a33f7022b9629950cbb71fc7b451"},"schema_version":"1.0"},"canonical_sha256":"157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822","source":{"kind":"arxiv","id":"1112.3611","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3611","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3611v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3611","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"CV5T7JD7V4PN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CV5T7JD7V4PNHTFJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CV5T7JD7","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CV5T7JD7V4PNHTFJFKFFKFTJ5L","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3611","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T19:11:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"dfcd164cd2f9203eda86092a2cc50f4034c36388154e6cd69dff042eb0832110","abstract_canon_sha256":"e10b4608e87e4401af4cc3fcdd1b1ad8b254a33f7022b9629950cbb71fc7b451"},"schema_version":"1.0"},"canonical_sha256":"157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.196173Z","signature_b64":"wTc2dLYkRA6DMBiNbvc0MXD0K4UTlwo2AA0DXcV7ls5DxfjcSEt/FecYebcBOnw3rURQdc86+HJrO7wfB3e0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822","last_reissued_at":"2026-05-18T02:21:27.195444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.195444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3611","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZgQXIuFJzxYKs53kX9NduZH3fYOxvSfxPEuvOTT/dB7CPO2u0Hre/R86zjh3hSvzz52teyX6uTdUGQ9H4JnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:48.384845Z"},"content_sha256":"1d36bd97deaa983100e4df83d3f344784b9a97a037e5118abd6c2e40693dd21b","schema_version":"1.0","event_id":"sha256:1d36bd97deaa983100e4df83d3f344784b9a97a037e5118abd6c2e40693dd21b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CV5T7JD7V4PNHTFJFKFFKFTJ5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms and Hardness of the k-Route Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aravindan Vijayaraghavan, Julia Chuzhoy, Yuan Zhou, Yury Makarychev","submitted_at":"2011-12-15T19:11:56Z","abstract_excerpt":"We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset E' of edges to remove, such that the connectivity of every pair (s_i, t_i) falls below k. Specifically, in the edge-connectivity version, EC-kRC, the requirement is that there are at most (k-1) edge-disjoint paths connecting s_i to t_i in G \\ E', while in the vertex-connectivity version, NC-kRC, the same requirement is for vertex-disjoint paths. Prior to ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3611","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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XFXDlXReFny2WpDpIxQ30ddXnM5Nbov/TbNT3XLJj4b/PdmHMg0cfIWV5fFo1GYy1sONdzaN4irB9HhdPwOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:37:48.385192Z"},"content_sha256":"f3c9520b82fa8f4459fdb03c5b2decdf2cd0a6c2c76d134df84c376e8776d740","schema_version":"1.0","event_id":"sha256:f3c9520b82fa8f4459fdb03c5b2decdf2cd0a6c2c76d134df84c376e8776d740"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/bundle.json","state_url":"https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/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-03T02:37:48Z","links":{"resolver":"https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L","bundle":"https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/bundle.json","state":"https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CV5T7JD7V4PNHTFJFKFFKFTJ5L","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":"e10b4608e87e4401af4cc3fcdd1b1ad8b254a33f7022b9629950cbb71fc7b451","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T19:11:56Z","title_canon_sha256":"dfcd164cd2f9203eda86092a2cc50f4034c36388154e6cd69dff042eb0832110"},"schema_version":"1.0","source":{"id":"1112.3611","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3611","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3611v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3611","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"CV5T7JD7V4PN","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CV5T7JD7V4PNHTFJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CV5T7JD7","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:f3c9520b82fa8f4459fdb03c5b2decdf2cd0a6c2c76d134df84c376e8776d740","target":"graph","created_at":"2026-05-18T02:21:27Z","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":"We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset E' of edges to remove, such that the connectivity of every pair (s_i, t_i) falls below k. Specifically, in the edge-connectivity version, EC-kRC, the requirement is that there are at most (k-1) edge-disjoint paths connecting s_i to t_i in G \\ E', while in the vertex-connectivity version, NC-kRC, the same requirement is for vertex-disjoint paths. Prior to ou","authors_text":"Aravindan Vijayaraghavan, Julia Chuzhoy, Yuan Zhou, Yury Makarychev","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T19:11:56Z","title":"Approximation Algorithms and Hardness of the k-Route Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3611","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:1d36bd97deaa983100e4df83d3f344784b9a97a037e5118abd6c2e40693dd21b","target":"record","created_at":"2026-05-18T02:21:27Z","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":"e10b4608e87e4401af4cc3fcdd1b1ad8b254a33f7022b9629950cbb71fc7b451","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-15T19:11:56Z","title_canon_sha256":"dfcd164cd2f9203eda86092a2cc50f4034c36388154e6cd69dff042eb0832110"},"schema_version":"1.0","source":{"id":"1112.3611","kind":"arxiv","version":2}},"canonical_sha256":"157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822","first_computed_at":"2026-05-18T02:21:27.195444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.195444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wTc2dLYkRA6DMBiNbvc0MXD0K4UTlwo2AA0DXcV7ls5DxfjcSEt/FecYebcBOnw3rURQdc86+HJrO7wfB3e0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.196173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3611","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d36bd97deaa983100e4df83d3f344784b9a97a037e5118abd6c2e40693dd21b","sha256:f3c9520b82fa8f4459fdb03c5b2decdf2cd0a6c2c76d134df84c376e8776d740"],"state_sha256":"ea72607512b7ac6e76c2cd92724a74820c2e9d69237864e38ed99b7aefbff158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYmfBDflTVaVHf4mKWqLvQ53AFkGppph8yDzLfqo4/Ppc5faLfQzDGXqD3r0vcIFHcMP2Es+YFBb7spkZtg7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:37:48.387211Z","bundle_sha256":"0e01f81c2b840ad9589413167c8b16ab65553d3ac4285860ea4b6efd1ce40827"}}