{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:LJMO5KT7ECBIRRUZIY53T64DGU","short_pith_number":"pith:LJMO5KT7","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"},"canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","source":{"kind":"arxiv","id":"cs/0205051","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205051","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205051v2","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205051","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"LJMO5KT7ECBI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJMO5KT7ECBIRRUZ","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJMO5KT7","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:LJMO5KT7ECBIRRUZIY53T64DGU","target":"record","payload":{"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"},"canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","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"},"source_kind":"arxiv","source_id":"cs/0205051","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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07VWQssfWg4NkQGm0A3dTySwFpO/SgDTjnfs7MRDvoAxj4YW/RqZqP5A9tEt5PQpFeBj5Bb6FQDhxR7tdTcZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:01:38.480094Z"},"content_sha256":"9081df83c360d7f142edc2b755f8e2b5cb78667acacb74fddec21c608723b673","schema_version":"1.0","event_id":"sha256:9081df83c360d7f142edc2b755f8e2b5cb78667acacb74fddec21c608723b673"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:LJMO5KT7ECBIRRUZIY53T64DGU","target":"graph","payload":{"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"},"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-18T01:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfYTQtlUv1CY8V73YfjTCnzEjTQcdQKDI/SzmD1piZkUBOt5gwwzltw0YyM/cuTKgfLqvBQmGfpmmOSN/OLTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:01:38.480815Z"},"content_sha256":"103d1e0b5e22ad24dd1b5eea3219ca17d0c7d303e85429f062930562d7d8c4e8","schema_version":"1.0","event_id":"sha256:103d1e0b5e22ad24dd1b5eea3219ca17d0c7d303e85429f062930562d7d8c4e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/bundle.json","state_url":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJMO5KT7ECBIRRUZIY53T64DGU/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-05-27T19:01:38Z","links":{"resolver":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU","bundle":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/bundle.json","state":"https://pith.science/pith/LJMO5KT7ECBIRRUZIY53T64DGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJMO5KT7ECBIRRUZIY53T64DGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:LJMO5KT7ECBIRRUZIY53T64DGU","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":"896e14808ab9bbad5c5dbeb7398e4d4096a43b802cc2a1f9e4488647d8ef0a1f","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:40:18Z","title_canon_sha256":"7fe53b8f9794c62636a25550f716fd0cee38f9da8a39b95aa07ccfb1d8dd50f1"},"schema_version":"1.0","source":{"id":"cs/0205051","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205051","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205051v2","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205051","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"LJMO5KT7ECBI","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJMO5KT7ECBIRRUZ","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJMO5KT7","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:103d1e0b5e22ad24dd1b5eea3219ca17d0c7d303e85429f062930562d7d8c4e8","target":"graph","created_at":"2026-05-18T01:59:53Z","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":"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","authors_text":"Cliff Stein, David Karger, Mikkel Thorup, Neal E. Young, Phil Klein","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:40:18Z","title":"Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205051","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:9081df83c360d7f142edc2b755f8e2b5cb78667acacb74fddec21c608723b673","target":"record","created_at":"2026-05-18T01:59:53Z","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":"896e14808ab9bbad5c5dbeb7398e4d4096a43b802cc2a1f9e4488647d8ef0a1f","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:40:18Z","title_canon_sha256":"7fe53b8f9794c62636a25550f716fd0cee38f9da8a39b95aa07ccfb1d8dd50f1"},"schema_version":"1.0","source":{"id":"cs/0205051","kind":"arxiv","version":2}},"canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a58eeaa7f208288c699463bb9fb833518fa3708b6f23eedc80f8887b984b049","first_computed_at":"2026-05-18T01:59:53.875889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.875889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F7F4JOomQL501XAYcq8ZJtxl2KAp0yA5nYfyGQ7qMQtt6fcR2juSH7og4FwF/C20WcIXc1wq0uqF2bqz1nTLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.876397Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205051","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9081df83c360d7f142edc2b755f8e2b5cb78667acacb74fddec21c608723b673","sha256:103d1e0b5e22ad24dd1b5eea3219ca17d0c7d303e85429f062930562d7d8c4e8"],"state_sha256":"eed599a8e729954d99445deee93fe1c974b65e3b0f040958816e86c41ca42049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0H8WcQtEK04Mm3bbXj0FFeRU91NqYu1nNFg/eQWkyzOE4DJUr3C3vh4/Cp2siV+eZb+PMdpTQK5/3QqTKNuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:01:38.484625Z","bundle_sha256":"303dcae31504709579d14a17f5133507960d06ac31e410d3ebc5340aa7c64422"}}