{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XUXQD7IZLVDFXUJILOQYRUYASK","short_pith_number":"pith:XUXQD7IZ","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"},"canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","source":{"kind":"arxiv","id":"2111.06813","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06813","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06813v2","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06813","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"XUXQD7IZLVDF","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_16","alias_value":"XUXQD7IZLVDFXUJI","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_8","alias_value":"XUXQD7IZ","created_at":"2026-07-05T05:38:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XUXQD7IZLVDFXUJILOQYRUYASK","target":"record","payload":{"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"},"canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","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"},"source_kind":"arxiv","source_id":"2111.06813","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r94MN12vJHdDGIcp0K6NZTP9SjwxIPiCz1cRN2iYm8UBqjke/IjFAj6CbGgFQTokFLrr7bOfvf9yrOhthGd4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T01:05:46.460752Z"},"content_sha256":"1ee8b5dd85b5a034e5ae2a015b328411fc2e7cce0c65b005de1b5d24b57942dd","schema_version":"1.0","event_id":"sha256:1ee8b5dd85b5a034e5ae2a015b328411fc2e7cce0c65b005de1b5d24b57942dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XUXQD7IZLVDFXUJILOQYRUYASK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCMWP7QSK1tAYdY/CruQ7VE6vdE6D2zcg6ycrWt9/bApksowiE/Y9WeFQRwpm2MZyFdGPo2j0nfVTSl7h67eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T01:05:46.461321Z"},"content_sha256":"4d67bb3ad3202601c3ec4a28d08ee36d6ac684dfdc09b9722d4005cee3227ad4","schema_version":"1.0","event_id":"sha256:4d67bb3ad3202601c3ec4a28d08ee36d6ac684dfdc09b9722d4005cee3227ad4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/bundle.json","state_url":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUXQD7IZLVDFXUJILOQYRUYASK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T01:05:46Z","links":{"resolver":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK","bundle":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/bundle.json","state":"https://pith.science/pith/XUXQD7IZLVDFXUJILOQYRUYASK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUXQD7IZLVDFXUJILOQYRUYASK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XUXQD7IZLVDFXUJILOQYRUYASK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d4df3e8eb318000ffb125ed54891bf2a250ecaf388150fe6abcd3794c8f1c378","cross_cats_sorted":["cs.DM","math-ph","math.CO","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-11-12T16:50:24Z","title_canon_sha256":"0d9c3fad83d9c871a035ed08720b394e8d7380118483dc8c9a20ef2327cdd4de"},"schema_version":"1.0","source":{"id":"2111.06813","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06813","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06813v2","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06813","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"XUXQD7IZLVDF","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_16","alias_value":"XUXQD7IZLVDFXUJI","created_at":"2026-07-05T05:38:26Z"},{"alias_kind":"pith_short_8","alias_value":"XUXQD7IZ","created_at":"2026-07-05T05:38:26Z"}],"graph_snapshots":[{"event_id":"sha256:4d67bb3ad3202601c3ec4a28d08ee36d6ac684dfdc09b9722d4005cee3227ad4","target":"graph","created_at":"2026-07-05T05:38:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.06813/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ahmed El Alaoui, Andrea Montanari, Mark Sellke","cross_cats":["cs.DM","math-ph","math.CO","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-11-12T16:50:24Z","title":"Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06813","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1ee8b5dd85b5a034e5ae2a015b328411fc2e7cce0c65b005de1b5d24b57942dd","target":"record","created_at":"2026-07-05T05:38:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d4df3e8eb318000ffb125ed54891bf2a250ecaf388150fe6abcd3794c8f1c378","cross_cats_sorted":["cs.DM","math-ph","math.CO","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2021-11-12T16:50:24Z","title_canon_sha256":"0d9c3fad83d9c871a035ed08720b394e8d7380118483dc8c9a20ef2327cdd4de"},"schema_version":"1.0","source":{"id":"2111.06813","kind":"arxiv","version":2}},"canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd2f01fd195d465bd1285ba188d30092a1b4255dbdb8b939537d8aed6f7485db","first_computed_at":"2026-07-05T05:38:26.431659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:26.431659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HKbW5DTgcVtfrj72KNb4/7kJoUQ+U5ht8xGNIejzLhAqlKoLUhwsGcpfIVrWVPaz+UcaRVXm3gja4euPpWZXDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:26.432071Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.06813","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ee8b5dd85b5a034e5ae2a015b328411fc2e7cce0c65b005de1b5d24b57942dd","sha256:4d67bb3ad3202601c3ec4a28d08ee36d6ac684dfdc09b9722d4005cee3227ad4"],"state_sha256":"2b36e9bb3240f096c8788545ac79c5954216a06ef8796448f77d8f4727bdcf02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7ut6EVc9dQ+dYZdDFKQQW/2WiiwYAaBiCBSQBhhdNarmvu4f5xG8w96U4cLK2TD2XbiJAw23TM+3eKgSSIMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T01:05:46.465078Z","bundle_sha256":"9b070011f502df02b0485e51529f069bbb9d84026cb5beace6d52f8f8f83b5bc"}}