{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NC6SW5JFMAWIQVLQ4KD2UQLFLD","short_pith_number":"pith:NC6SW5JF","schema_version":"1.0","canonical_sha256":"68bd2b7525602c885570e287aa416558ec3e79085d8575f4ec268b9e6d35b3db","source":{"kind":"arxiv","id":"2608.00333","version":1},"attestation_state":"computed","paper":{"title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Steven Heilman","submitted_at":"2026-07-31T22:53:00Z","abstract_excerpt":"Assuming the Unique Games Conjecture, we show it is NP-hard to approximate MAX-3-CUT within a multiplicative factor of $\\alpha_3+\\epsilon$ for every $\\epsilon>0$, where $\\alpha_3\\approx.83600811464$ is the approximation ratio of Frieze-Jerrum's polynomial-time algorithm from 1995. That is, we prove sharp hardness of approximation for MAX-3-CUT. This result resolves a conjecture of Khot-Kindler-Mossel-O'Donnell from 2004 by proving the three candidate Plurality is Stablest Conjecture for correlations in $[-1/2,2/5]$ and generalizes the Majority is Stablest Theorem of Mossel-O'Donnell-Oleszkiewi"},"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":"2608.00333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-31T22:53:00Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"492fa04847d2f56ccacabb8f5cf8dcfed5b58c4ff6462a36819e8ccb6dcfe9ba","abstract_canon_sha256":"e6cdf94457effe008646180fd4cba6170526ec0582ae624af92805e629b8e79f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:35:06.928244Z","signature_b64":"P3T8cYGhW9237VT569Z2MVMukSzv0cH1JQSQt2HzSjMPoeoWeN3/ftKXGi9q36nm9GG0vcVaTCJoQd8QyCqsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68bd2b7525602c885570e287aa416558ec3e79085d8575f4ec268b9e6d35b3db","last_reissued_at":"2026-08-04T00:35:06.926844Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:35:06.926844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.CC","authors_text":"Steven Heilman","submitted_at":"2026-07-31T22:53:00Z","abstract_excerpt":"Assuming the Unique Games Conjecture, we show it is NP-hard to approximate MAX-3-CUT within a multiplicative factor of $\\alpha_3+\\epsilon$ for every $\\epsilon>0$, where $\\alpha_3\\approx.83600811464$ is the approximation ratio of Frieze-Jerrum's polynomial-time algorithm from 1995. That is, we prove sharp hardness of approximation for MAX-3-CUT. This result resolves a conjecture of Khot-Kindler-Mossel-O'Donnell from 2004 by proving the three candidate Plurality is Stablest Conjecture for correlations in $[-1/2,2/5]$ and generalizes the Majority is Stablest Theorem of Mossel-O'Donnell-Oleszkiewi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.00333/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.00333","created_at":"2026-08-04T00:35:06.927945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00333v1","created_at":"2026-08-04T00:35:06.927945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00333","created_at":"2026-08-04T00:35:06.927945+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC6SW5JFMAWI","created_at":"2026-08-04T00:35:06.927945+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC6SW5JFMAWIQVLQ","created_at":"2026-08-04T00:35:06.927945+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC6SW5JF","created_at":"2026-08-04T00:35:06.927945+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/NC6SW5JFMAWIQVLQ4KD2UQLFLD","json":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD.json","graph_json":"https://pith.science/api/pith-number/NC6SW5JFMAWIQVLQ4KD2UQLFLD/graph.json","events_json":"https://pith.science/api/pith-number/NC6SW5JFMAWIQVLQ4KD2UQLFLD/events.json","paper":"https://pith.science/paper/NC6SW5JF"},"agent_actions":{"view_html":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD","download_json":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD.json","view_paper":"https://pith.science/paper/NC6SW5JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00333&json=true","fetch_graph":"https://pith.science/api/pith-number/NC6SW5JFMAWIQVLQ4KD2UQLFLD/graph.json","fetch_events":"https://pith.science/api/pith-number/NC6SW5JFMAWIQVLQ4KD2UQLFLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD/action/storage_attestation","attest_author":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD/action/author_attestation","sign_citation":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD/action/citation_signature","submit_replication":"https://pith.science/pith/NC6SW5JFMAWIQVLQ4KD2UQLFLD/action/replication_record"}},"created_at":"2026-08-04T00:35:06.927945+00:00","updated_at":"2026-08-04T00:35:06.927945+00:00"}