{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GN45PBBO5F532GY7FN7G4RKFNZ","short_pith_number":"pith:GN45PBBO","schema_version":"1.0","canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","source":{"kind":"arxiv","id":"1309.2729","version":3},"attestation_state":"computed","paper":{"title":"Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Jan Vondr\\'ak","submitted_at":"2013-09-11T04:15:30Z","abstract_excerpt":"We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013].\n  We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds.\n  Then, we pr"},"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":"1309.2729","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-11T04:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"52fe4d23184bdc475cb750ddbeb1fdf150c018f3cc5c236554636c0a506a560b","abstract_canon_sha256":"b78efd306622ed39f4d94db3aaefd9f3253ffb41bba03f7ee083fc41202ba5b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:12.445356Z","signature_b64":"abBi4luMF6QBbgTB2IodSjpA/p0BjR0hjcL5w4s3vC1/1RAgzbQhW84ntuFzdxbKQMtNk3uRppUR594irCWACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3379d7842ee97bbd1b1f2b7e6e45456e7127cf5487f60433bdbbc1c3b5042887","last_reissued_at":"2026-05-18T02:52:12.444856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:12.444856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Jan Vondr\\'ak","submitted_at":"2013-09-11T04:15:30Z","abstract_excerpt":"We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013].\n  We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds.\n  Then, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2729","kind":"arxiv","version":3},"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":"1309.2729","created_at":"2026-05-18T02:52:12.444931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2729v3","created_at":"2026-05-18T02:52:12.444931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2729","created_at":"2026-05-18T02:52:12.444931+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN45PBBO5F53","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN45PBBO5F532GY7","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN45PBBO","created_at":"2026-05-18T12:27:45.050594+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/GN45PBBO5F532GY7FN7G4RKFNZ","json":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ.json","graph_json":"https://pith.science/api/pith-number/GN45PBBO5F532GY7FN7G4RKFNZ/graph.json","events_json":"https://pith.science/api/pith-number/GN45PBBO5F532GY7FN7G4RKFNZ/events.json","paper":"https://pith.science/paper/GN45PBBO"},"agent_actions":{"view_html":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ","download_json":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ.json","view_paper":"https://pith.science/paper/GN45PBBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2729&json=true","fetch_graph":"https://pith.science/api/pith-number/GN45PBBO5F532GY7FN7G4RKFNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GN45PBBO5F532GY7FN7G4RKFNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/action/storage_attestation","attest_author":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/action/author_attestation","sign_citation":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/action/citation_signature","submit_replication":"https://pith.science/pith/GN45PBBO5F532GY7FN7G4RKFNZ/action/replication_record"}},"created_at":"2026-05-18T02:52:12.444931+00:00","updated_at":"2026-05-18T02:52:12.444931+00:00"}