{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZQVT6WRIGXVDJYSFSJU6VRFR2K","short_pith_number":"pith:ZQVT6WRI","schema_version":"1.0","canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","source":{"kind":"arxiv","id":"2311.00182","version":3},"attestation_state":"computed","paper":{"title":"Local Max-Cut on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gregory Schwartzman","submitted_at":"2023-10-31T23:00:14Z","abstract_excerpt":"We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of nodes and $\\phi$ is the smoothing parameter):\n  1) When $\\alpha = O(\\log^{1-\\delta} n)$ FLIP terminates in $\\phi poly(n)$ iterations, where $\\delta \\in (0,1]$ is an arbitrarily small constant. Previous to our results the only graph families for which FLIP was known to achieve a smoothed polynomial running time were complete graphs and graphs with logarithmi"},"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":"2311.00182","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-31T23:00:14Z","cross_cats_sorted":[],"title_canon_sha256":"8f8065c335b3aee5acb2b4ce9e196b71154f11b2897cd498c8ae224503d38458","abstract_canon_sha256":"0299942815330cf02ceb5e15e7f365c2b1e737f95aa2cd17e18b4f033207dad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:19.296583Z","signature_b64":"gtAEfl0Kjkr2iEGM4POW9HCRk3b3oQU7tz4un3rgaP3W2RJWTPLwoLC4GN2j6tih9rRz5u/7zY4QxTA21R8BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc2b3f5a2835ea34e2459269eac4b1d28b818e154f01ce470dda34570e354b4a","last_reissued_at":"2026-07-05T08:10:19.296187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:19.296187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Max-Cut on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gregory Schwartzman","submitted_at":"2023-10-31T23:00:14Z","abstract_excerpt":"We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of nodes and $\\phi$ is the smoothing parameter):\n  1) When $\\alpha = O(\\log^{1-\\delta} n)$ FLIP terminates in $\\phi poly(n)$ iterations, where $\\delta \\in (0,1]$ is an arbitrarily small constant. Previous to our results the only graph families for which FLIP was known to achieve a smoothed polynomial running time were complete graphs and graphs with logarithmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.00182","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/2311.00182/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":"2311.00182","created_at":"2026-07-05T08:10:19.296245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.00182v3","created_at":"2026-07-05T08:10:19.296245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.00182","created_at":"2026-07-05T08:10:19.296245+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQVT6WRIGXVD","created_at":"2026-07-05T08:10:19.296245+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQVT6WRIGXVDJYSF","created_at":"2026-07-05T08:10:19.296245+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQVT6WRI","created_at":"2026-07-05T08:10:19.296245+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/ZQVT6WRIGXVDJYSFSJU6VRFR2K","json":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K.json","graph_json":"https://pith.science/api/pith-number/ZQVT6WRIGXVDJYSFSJU6VRFR2K/graph.json","events_json":"https://pith.science/api/pith-number/ZQVT6WRIGXVDJYSFSJU6VRFR2K/events.json","paper":"https://pith.science/paper/ZQVT6WRI"},"agent_actions":{"view_html":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K","download_json":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K.json","view_paper":"https://pith.science/paper/ZQVT6WRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.00182&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQVT6WRIGXVDJYSFSJU6VRFR2K/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQVT6WRIGXVDJYSFSJU6VRFR2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/action/storage_attestation","attest_author":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/action/author_attestation","sign_citation":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/action/citation_signature","submit_replication":"https://pith.science/pith/ZQVT6WRIGXVDJYSFSJU6VRFR2K/action/replication_record"}},"created_at":"2026-07-05T08:10:19.296245+00:00","updated_at":"2026-07-05T08:10:19.296245+00:00"}