{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:LJMO5KT7ECBIRRUZIY53T64DGU","short_pith_number":"pith:LJMO5KT7","schema_version":"1.0","canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","source":{"kind":"arxiv","id":"cs/0205051","version":2},"attestation_state":"computed","paper":{"title":"Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cliff Stein, David Karger, Mikkel Thorup, Neal E. Young, Phil Klein","submitted_at":"2002-05-19T14:40:18Z","abstract_excerpt":"The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-hard, and even NP-hard to approximate within 1+delta for some small delta > 0.\n  Calinescu, Karloff, and Rabani (1998) gave an algorithm with performance guarantee 3/2-1/k, based on a geometric relaxation of the problem. In this paper, we give improved randomized rounding schemes for their relaxation, yielding a 12/11-approximation algorithm for k=3 and a 1.3438-approximation algorithm in general.\n  Our approach hinges"},"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":"cs/0205051","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:40:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7fe53b8f9794c62636a25550f716fd0cee38f9da8a39b95aa07ccfb1d8dd50f1","abstract_canon_sha256":"896e14808ab9bbad5c5dbeb7398e4d4096a43b802cc2a1f9e4488647d8ef0a1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.876397Z","signature_b64":"F7F4JOomQL501XAYcq8ZJtxl2KAp0yA5nYfyGQ7qMQtt6fcR2juSH7og4FwF/C20WcIXc1wq0uqF2bqz1nTLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","last_reissued_at":"2026-05-18T01:59:53.875889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.875889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Cliff Stein, David Karger, Mikkel Thorup, Neal E. Young, Phil Klein","submitted_at":"2002-05-19T14:40:18Z","abstract_excerpt":"The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-hard, and even NP-hard to approximate within 1+delta for some small delta > 0.\n  Calinescu, Karloff, and Rabani (1998) gave an algorithm with performance guarantee 3/2-1/k, based on a geometric relaxation of the problem. In this paper, we give improved randomized rounding schemes for their relaxation, yielding a 12/11-approximation algorithm for k=3 and a 1.3438-approximation algorithm in general.\n  Our approach hinges"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205051","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205051","created_at":"2026-05-18T01:59:53.875959+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205051v2","created_at":"2026-05-18T01:59:53.875959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205051","created_at":"2026-05-18T01:59:53.875959+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJMO5KT7ECBI","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJMO5KT7ECBIRRUZ","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJMO5KT7","created_at":"2026-05-18T12:25:51.375804+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/LJMO5KT7ECBIRRUZIY53T64DGU","json":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU.json","graph_json":"https://pith.science/api/pith-number/LJMO5KT7ECBIRRUZIY53T64DGU/graph.json","events_json":"https://pith.science/api/pith-number/LJMO5KT7ECBIRRUZIY53T64DGU/events.json","paper":"https://pith.science/paper/LJMO5KT7"},"agent_actions":{"view_html":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU","download_json":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU.json","view_paper":"https://pith.science/paper/LJMO5KT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205051&json=true","fetch_graph":"https://pith.science/api/pith-number/LJMO5KT7ECBIRRUZIY53T64DGU/graph.json","fetch_events":"https://pith.science/api/pith-number/LJMO5KT7ECBIRRUZIY53T64DGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/action/storage_attestation","attest_author":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/action/author_attestation","sign_citation":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/action/citation_signature","submit_replication":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/action/replication_record"}},"created_at":"2026-05-18T01:59:53.875959+00:00","updated_at":"2026-05-18T01:59:53.875959+00:00"}