{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIHFO6GUZXYPK35AMYJYAPWCR4","short_pith_number":"pith:CIHFO6GU","schema_version":"1.0","canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","source":{"kind":"arxiv","id":"1807.09735","version":2},"attestation_state":"computed","paper":{"title":"Improving the Integrality Gap for Multiway Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly, Vivek Madan","submitted_at":"2018-07-25T17:28:44Z","abstract_excerpt":"In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal so that the total weight of the edges crossing the partition is minimized. The multiway cut problem for $k\\ge 3$ is APX-hard. For arbitrary $k$, the best-known approximation factor is $1.2965$ due to [Sharma and Vondr\\'{a}k, 2014] while the best known inapproximability factor is $1.2$ due to [Angelidakis, Makarychev and Manurangsi, 2017]. In this w"},"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":"1807.09735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-25T17:28:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d3236791dcbb6698c1b0e50d9784bfa73615f267b8918093519f06834046a339","abstract_canon_sha256":"7cf86f4eca71583864fee13d02bbde7e2b8fc1e755645c3bce339989b5e8e498"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.986017Z","signature_b64":"MmU9iDt5IWQqf8v+CQlbxBQcsfHc5nJ4TmgFdZkpKB6oQrlbBKY8Tjwc6Iq5UuTlkvPuvpDwilLtikROj30cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120e5778d4cdf0f56fa06613803ec28f2156ba354e55c7fe197ca4839c7fdeff","last_reissued_at":"2026-05-18T00:00:12.985389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.985389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Integrality Gap for Multiway Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Karthekeyan Chandrasekaran, Krist\\'of B\\'erczi, Tam\\'as Kir\\'aly, Vivek Madan","submitted_at":"2018-07-25T17:28:44Z","abstract_excerpt":"In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one terminal so that the total weight of the edges crossing the partition is minimized. The multiway cut problem for $k\\ge 3$ is APX-hard. For arbitrary $k$, the best-known approximation factor is $1.2965$ due to [Sharma and Vondr\\'{a}k, 2014] while the best known inapproximability factor is $1.2$ due to [Angelidakis, Makarychev and Manurangsi, 2017]. In this w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09735","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":"1807.09735","created_at":"2026-05-18T00:00:12.985486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09735v2","created_at":"2026-05-18T00:00:12.985486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09735","created_at":"2026-05-18T00:00:12.985486+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIHFO6GUZXYP","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIHFO6GUZXYPK35A","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIHFO6GU","created_at":"2026-05-18T12:32:16.446611+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/CIHFO6GUZXYPK35AMYJYAPWCR4","json":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4.json","graph_json":"https://pith.science/api/pith-number/CIHFO6GUZXYPK35AMYJYAPWCR4/graph.json","events_json":"https://pith.science/api/pith-number/CIHFO6GUZXYPK35AMYJYAPWCR4/events.json","paper":"https://pith.science/paper/CIHFO6GU"},"agent_actions":{"view_html":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4","download_json":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4.json","view_paper":"https://pith.science/paper/CIHFO6GU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09735&json=true","fetch_graph":"https://pith.science/api/pith-number/CIHFO6GUZXYPK35AMYJYAPWCR4/graph.json","fetch_events":"https://pith.science/api/pith-number/CIHFO6GUZXYPK35AMYJYAPWCR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/action/storage_attestation","attest_author":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/action/author_attestation","sign_citation":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/action/citation_signature","submit_replication":"https://pith.science/pith/CIHFO6GUZXYPK35AMYJYAPWCR4/action/replication_record"}},"created_at":"2026-05-18T00:00:12.985486+00:00","updated_at":"2026-05-18T00:00:12.985486+00:00"}