{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SBTHAQATZUQ4Z7ASGH3EKURAIS","short_pith_number":"pith:SBTHAQAT","schema_version":"1.0","canonical_sha256":"9066704013cd21ccfc1231f6455220448008043f7752ad8962c3bd384fe1b6b4","source":{"kind":"arxiv","id":"2310.19594","version":3},"attestation_state":"computed","paper":{"title":"Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alex Scott, Lukas Michel","submitted_at":"2023-10-30T14:51:40Z","abstract_excerpt":"Local search algorithms for NP-hard problems such as Max-Cut frequently perform much better in practice than worst-case analysis suggests. Smoothed analysis has proved an effective approach to understanding this: a substantial literature shows that when a small amount of random noise is added to input data, local search algorithms typically run in polynomial or quasi-polynomial time. In this paper, we provide the first example where a local search algorithm for the Max-Cut problem fails to be efficient in the framework of smoothed analysis. Specifically, we construct a graph with $n$ vertices "},"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":"2310.19594","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-30T14:51:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f3e8f6ead25f3dc2fd69ee5b13b27c16b08326c9a6aca1a857d31968d64aa06e","abstract_canon_sha256":"e42771968ea4900494ba406b092dbd29e8a5125d1b80917966aec568c88375bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:01.064181Z","signature_b64":"e/nSfKxxYvhtGUF3lUk+Orgp44spvujGhH2/EKUucF9tk1jxUvwW5HmTKBiaCvlYGevKcntOKtgs83w8hltkAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9066704013cd21ccfc1231f6455220448008043f7752ad8962c3bd384fe1b6b4","last_reissued_at":"2026-07-05T09:12:01.063704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:01.063704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Alex Scott, Lukas Michel","submitted_at":"2023-10-30T14:51:40Z","abstract_excerpt":"Local search algorithms for NP-hard problems such as Max-Cut frequently perform much better in practice than worst-case analysis suggests. Smoothed analysis has proved an effective approach to understanding this: a substantial literature shows that when a small amount of random noise is added to input data, local search algorithms typically run in polynomial or quasi-polynomial time. In this paper, we provide the first example where a local search algorithm for the Max-Cut problem fails to be efficient in the framework of smoothed analysis. Specifically, we construct a graph with $n$ vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19594","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.19594/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":"2310.19594","created_at":"2026-07-05T09:12:01.063761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19594v3","created_at":"2026-07-05T09:12:01.063761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19594","created_at":"2026-07-05T09:12:01.063761+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBTHAQATZUQ4","created_at":"2026-07-05T09:12:01.063761+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBTHAQATZUQ4Z7AS","created_at":"2026-07-05T09:12:01.063761+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBTHAQAT","created_at":"2026-07-05T09:12:01.063761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.16156","citing_title":"All ascents exponential from valued constraint graphs of pathwidth three","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12425","citing_title":"Binary constraints on one additional variable can create exponential ascents for local search","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS","json":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS.json","graph_json":"https://pith.science/api/pith-number/SBTHAQATZUQ4Z7ASGH3EKURAIS/graph.json","events_json":"https://pith.science/api/pith-number/SBTHAQATZUQ4Z7ASGH3EKURAIS/events.json","paper":"https://pith.science/paper/SBTHAQAT"},"agent_actions":{"view_html":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS","download_json":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS.json","view_paper":"https://pith.science/paper/SBTHAQAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19594&json=true","fetch_graph":"https://pith.science/api/pith-number/SBTHAQATZUQ4Z7ASGH3EKURAIS/graph.json","fetch_events":"https://pith.science/api/pith-number/SBTHAQATZUQ4Z7ASGH3EKURAIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS/action/storage_attestation","attest_author":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS/action/author_attestation","sign_citation":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS/action/citation_signature","submit_replication":"https://pith.science/pith/SBTHAQATZUQ4Z7ASGH3EKURAIS/action/replication_record"}},"created_at":"2026-07-05T09:12:01.063761+00:00","updated_at":"2026-07-05T09:12:01.063761+00:00"}