{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:X222S3XUNHHNILBDWLSJKSW6PM","short_pith_number":"pith:X222S3XU","schema_version":"1.0","canonical_sha256":"beb5a96ef469ced42c23b2e4954ade7b3b6e18902a67a0297265c4443a6c59ae","source":{"kind":"arxiv","id":"1410.5105","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5105","created_at":"2026-05-18T02:39:46.908085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5105v1","created_at":"2026-05-18T02:39:46.908085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5105","created_at":"2026-05-18T02:39:46.908085+00:00"},{"alias_kind":"pith_short_12","alias_value":"X222S3XUNHHN","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"X222S3XUNHHNILBD","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"X222S3XU","created_at":"2026-05-18T12:28:54.890064+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/X222S3XUNHHNILBDWLSJKSW6PM","json":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM.json","graph_json":"https://pith.science/api/pith-number/X222S3XUNHHNILBDWLSJKSW6PM/graph.json","events_json":"https://pith.science/api/pith-number/X222S3XUNHHNILBDWLSJKSW6PM/events.json","paper":"https://pith.science/paper/X222S3XU"},"agent_actions":{"view_html":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM","download_json":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM.json","view_paper":"https://pith.science/paper/X222S3XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5105&json=true","fetch_graph":"https://pith.science/api/pith-number/X222S3XUNHHNILBDWLSJKSW6PM/graph.json","fetch_events":"https://pith.science/api/pith-number/X222S3XUNHHNILBDWLSJKSW6PM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/action/storage_attestation","attest_author":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/action/author_attestation","sign_citation":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/action/citation_signature","submit_replication":"https://pith.science/pith/X222S3XUNHHNILBDWLSJKSW6PM/action/replication_record"}},"created_at":"2026-05-18T02:39:46.908085+00:00","updated_at":"2026-05-18T02:39:46.908085+00:00"}