{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XUXQD7IZLVDFXUJILOQYRUYASK","short_pith_number":"pith:XUXQD7IZ","schema_version":"1.0","canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","source":{"kind":"arxiv","id":"2111.06813","version":2},"attestation_state":"computed","paper":{"title":"Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Ahmed El Alaoui, Andrea Montanari, Mark Sellke","submitted_at":"2021-11-12T16:50:24Z","abstract_excerpt":"Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose complexity is $O(nkL)$, and that achieves near optimal cut values among all $L$-local algorithms. Focusing on max-cut, the algorithm constructs a cut of value $nk/4+ n\\mathsf{P}_\\star\\sqrt{k/4}+\\mathsf{err}(n,k,L)$, where $\\mathsf{P}_\\star\\approx 0.763166$ is the value of the Parisi formula from spin glass theory, and $\\mathsf{err}(n,k,L)=o_n(n)+no_k(\\sqrt{k})+n \\sq"},"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":"2111.06813","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-11-12T16:50:24Z","cross_cats_sorted":["cs.DM","math-ph","math.CO","math.MP"],"title_canon_sha256":"0d9c3fad83d9c871a035ed08720b394e8d7380118483dc8c9a20ef2327cdd4de","abstract_canon_sha256":"d4df3e8eb318000ffb125ed54891bf2a250ecaf388150fe6abcd3794c8f1c378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:26.432071Z","signature_b64":"HKbW5DTgcVtfrj72KNb4/7kJoUQ+U5ht8xGNIejzLhAqlKoLUhwsGcpfIVrWVPaz+UcaRVXm3gja4euPpWZXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","last_reissued_at":"2026-07-05T05:38:26.431659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:26.431659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Ahmed El Alaoui, Andrea Montanari, Mark Sellke","submitted_at":"2021-11-12T16:50:24Z","abstract_excerpt":"Given a graph $G$ of degree $k$ over $n$ vertices, we consider the problem of computing a near maximum cut or a near minimum bisection in polynomial time. For graphs of girth $2L$, we develop a local message passing algorithm whose complexity is $O(nkL)$, and that achieves near optimal cut values among all $L$-local algorithms. Focusing on max-cut, the algorithm constructs a cut of value $nk/4+ n\\mathsf{P}_\\star\\sqrt{k/4}+\\mathsf{err}(n,k,L)$, where $\\mathsf{P}_\\star\\approx 0.763166$ is the value of the Parisi formula from spin glass theory, and $\\mathsf{err}(n,k,L)=o_n(n)+no_k(\\sqrt{k})+n \\sq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06813","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.06813/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":"2111.06813","created_at":"2026-07-05T05:38:26.431721+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06813v2","created_at":"2026-07-05T05:38:26.431721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06813","created_at":"2026-07-05T05:38:26.431721+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUXQD7IZLVDF","created_at":"2026-07-05T05:38:26.431721+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUXQD7IZLVDFXUJI","created_at":"2026-07-05T05:38:26.431721+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUXQD7IZ","created_at":"2026-07-05T05:38:26.431721+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08160","citing_title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","ref_index":86,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13570","citing_title":"Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2408.02360","citing_title":"Potential Hessian Ascent: The Sherrington-Kirkpatrick Model","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2505.07929","citing_title":"Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK","json":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK.json","graph_json":"https://pith.science/api/pith-number/XUXQD7IZLVDFXUJILOQYRUYASK/graph.json","events_json":"https://pith.science/api/pith-number/XUXQD7IZLVDFXUJILOQYRUYASK/events.json","paper":"https://pith.science/paper/XUXQD7IZ"},"agent_actions":{"view_html":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK","download_json":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK.json","view_paper":"https://pith.science/paper/XUXQD7IZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06813&json=true","fetch_graph":"https://pith.science/api/pith-number/XUXQD7IZLVDFXUJILOQYRUYASK/graph.json","fetch_events":"https://pith.science/api/pith-number/XUXQD7IZLVDFXUJILOQYRUYASK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/action/storage_attestation","attest_author":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/action/author_attestation","sign_citation":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/action/citation_signature","submit_replication":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/action/replication_record"}},"created_at":"2026-07-05T05:38:26.431721+00:00","updated_at":"2026-07-05T05:38:26.431721+00:00"}