{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:X222S3XUNHHNILBDWLSJKSW6PM","short_pith_number":"pith:X222S3XU","canonical_record":{"source":{"id":"1410.5105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T19:23:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8cb0971db569034b04e416dccf3347e3c59a6deb8c4be6313c93237e22ba4c8d","abstract_canon_sha256":"26afba7c699f3fcf37ef9bfad0e6f202c1a41fcd11904ea352cd2bd232c4b79f"},"schema_version":"1.0"},"canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","source":{"kind":"arxiv","id":"1410.5105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5105","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5105v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5105","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"X222S3XUNHHN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"X222S3XUNHHNILBD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"X222S3XU","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:X222S3XUNHHNILBDWLSJKSW6PM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T19:23:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8cb0971db569034b04e416dccf3347e3c59a6deb8c4be6313c93237e22ba4c8d","abstract_canon_sha256":"26afba7c699f3fcf37ef9bfad0e6f202c1a41fcd11904ea352cd2bd232c4b79f"},"schema_version":"1.0"},"canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.908425Z","signature_b64":"gY7jR5k7Q5LxOPIEMxbXVd0l6TiANxwru640IjpxKAZibk8qJ8fO08jJLw8QuFkDXW+cmk6FTn8GZYF+VYSoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","last_reissued_at":"2026-05-18T02:39:46.908018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.908018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5105","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-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPidxIySuuF4SDf3XTasYsZS1Nt/0eSSnEsHh++9qUHiOnur3f/ivJg3tqTNMmLfVXovdM/Hzgm2Rkd64hT+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:42.352880Z"},"content_sha256":"4cf226d13d6c0fa0eb0115a1b3c94c3380f062b9bfce4ba2c728b9bb20ab85a3","schema_version":"1.0","event_id":"sha256:4cf226d13d6c0fa0eb0115a1b3c94c3380f062b9bfce4ba2c728b9bb20ab85a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:X222S3XUNHHNILBDWLSJKSW6PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Guru Guruganesh, Laura Sanita","submitted_at":"2014-10-19T19:23:24Z","abstract_excerpt":"We study the {\\em $k$-route} generalizations of various cut problems, the most general of which is \\emph{$k$-route multicut} ($k$-MC) problem, wherein we have $r$ source-sink pairs and the goal is to delete a minimum-cost set of edges to reduce the edge-connectivity of every source-sink pair to below $k$. The $k$-route extensions of multiway cut ($k$-MWC), and the minimum $s$-$t$ cut problem ($k$-$(s,t)$-cut), are similarly defined. We present various approximation and hardness results for these $k$-route cut problems that improve the state-of-the-art for these problems in several cases. (i) F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5105","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-18T02:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oI05BQuTc1b2G65Fj12QSMQcMS88Zzf62nqE27IZ28J7rt59kioUrHObB6IvOG5Y8D2DWvhgcp7FK1bnf9V7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:42.353259Z"},"content_sha256":"7b9181de3d88687e82c2a74fb77fbf610229f1c1757ecd7b5ec3e63b0ce4f4e9","schema_version":"1.0","event_id":"sha256:7b9181de3d88687e82c2a74fb77fbf610229f1c1757ecd7b5ec3e63b0ce4f4e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/bundle.json","state_url":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X222S3XUNHHNILBDWLSJKSW6PM/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-02T12:15:42Z","links":{"resolver":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM","bundle":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/bundle.json","state":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X222S3XUNHHNILBDWLSJKSW6PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:X222S3XUNHHNILBDWLSJKSW6PM","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":"26afba7c699f3fcf37ef9bfad0e6f202c1a41fcd11904ea352cd2bd232c4b79f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T19:23:24Z","title_canon_sha256":"8cb0971db569034b04e416dccf3347e3c59a6deb8c4be6313c93237e22ba4c8d"},"schema_version":"1.0","source":{"id":"1410.5105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5105","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5105v1","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5105","created_at":"2026-05-18T02:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"X222S3XUNHHN","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"X222S3XUNHHNILBD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"X222S3XU","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:7b9181de3d88687e82c2a74fb77fbf610229f1c1757ecd7b5ec3e63b0ce4f4e9","target":"graph","created_at":"2026-05-18T02:39:46Z","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 {\\em $k$-route} generalizations of various cut problems, the most general of which is \\emph{$k$-route multicut} ($k$-MC) problem, wherein we have $r$ source-sink pairs and the goal is to delete a minimum-cost set of edges to reduce the edge-connectivity of every source-sink pair to below $k$. The $k$-route extensions of multiway cut ($k$-MWC), and the minimum $s$-$t$ cut problem ($k$-$(s,t)$-cut), are similarly defined. We present various approximation and hardness results for these $k$-route cut problems that improve the state-of-the-art for these problems in several cases. (i) F","authors_text":"Chaitanya Swamy, Guru Guruganesh, Laura Sanita","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T19:23:24Z","title":"Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5105","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:4cf226d13d6c0fa0eb0115a1b3c94c3380f062b9bfce4ba2c728b9bb20ab85a3","target":"record","created_at":"2026-05-18T02:39:46Z","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":"26afba7c699f3fcf37ef9bfad0e6f202c1a41fcd11904ea352cd2bd232c4b79f","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-19T19:23:24Z","title_canon_sha256":"8cb0971db569034b04e416dccf3347e3c59a6deb8c4be6313c93237e22ba4c8d"},"schema_version":"1.0","source":{"id":"1410.5105","kind":"arxiv","version":1}},"canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","first_computed_at":"2026-05-18T02:39:46.908018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:46.908018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gY7jR5k7Q5LxOPIEMxbXVd0l6TiANxwru640IjpxKAZibk8qJ8fO08jJLw8QuFkDXW+cmk6FTn8GZYF+VYSoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:46.908425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cf226d13d6c0fa0eb0115a1b3c94c3380f062b9bfce4ba2c728b9bb20ab85a3","sha256:7b9181de3d88687e82c2a74fb77fbf610229f1c1757ecd7b5ec3e63b0ce4f4e9"],"state_sha256":"af297a45787a39ab48cfa02afc80cd89ba0d9a0dbeef07a1baa1d81b32f5f4c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YU8gTQr20nJRV5a6ZNndku8+ffTqdyIAZzGErJzjoyzAS9MmyCQ087VMKtedeTDnaY/KMQOseUlVy54re3sCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:15:42.355283Z","bundle_sha256":"79da024548245f1712e9d449e03061203cede8a392ad2a80ce25fa41a65c6725"}}