{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QWHB7TUJPI5RAZH2NHHKJ4VZR6","short_pith_number":"pith:QWHB7TUJ","canonical_record":{"source":{"id":"1812.09967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T19:23:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a1141eab935692dd1db21b5b60a522fb63be3f00fb05cbaab80d4d13f6a8f256","abstract_canon_sha256":"bec1ec7467a212d4de7351bb02f579c36d5613963cdfb8f65eec2e9b1e5908b2"},"schema_version":"1.0"},"canonical_sha256":"858e1fce897a3b1064fa69cea4f2b98f98a490932a127ed75af0a51abf8da8e3","source":{"kind":"arxiv","id":"1812.09967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09967","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09967v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09967","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"QWHB7TUJPI5R","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWHB7TUJPI5RAZH2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWHB7TUJ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QWHB7TUJPI5RAZH2NHHKJ4VZR6","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T19:23:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a1141eab935692dd1db21b5b60a522fb63be3f00fb05cbaab80d4d13f6a8f256","abstract_canon_sha256":"bec1ec7467a212d4de7351bb02f579c36d5613963cdfb8f65eec2e9b1e5908b2"},"schema_version":"1.0"},"canonical_sha256":"858e1fce897a3b1064fa69cea4f2b98f98a490932a127ed75af0a51abf8da8e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.248488Z","signature_b64":"LdC+lwZGO4oUTCRWUXRUP2+FFMflvCBJgrtrKDlJSeIsjZuflg/zFEdM1OrYFemoSDpasPEtWLyp1T13NtfDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858e1fce897a3b1064fa69cea4f2b98f98a490932a127ed75af0a51abf8da8e3","last_reissued_at":"2026-05-17T23:57:26.247996Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.247996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09967","source_version":1,"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-05-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPzS/g0vjn1vA3pLrux3IORiIbHKE5ZrqGsb6TkW52LURX8FJ0srah78aQz/4qq1+PVXgkO490qjr4WVEFd6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:47.717300Z"},"content_sha256":"017b2bc58627061c1ef119a2333cf180f74bd624bf9b2a1760cc946ae219312c","schema_version":"1.0","event_id":"sha256:017b2bc58627061c1ef119a2333cf180f74bd624bf9b2a1760cc946ae219312c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QWHB7TUJPI5RAZH2NHHKJ4VZR6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sherali--Adams Strikes Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ryan O'Donnell, Tselil Schramm","submitted_at":"2018-12-24T19:23:52Z","abstract_excerpt":"Let $G$ be any $n$-vertex graph whose random walk matrix has its nontrivial eigenvalues bounded in magnitude by $1/\\sqrt{\\Delta}$ (for example, a random graph $G$ of average degree~$\\Theta(\\Delta)$ typically has this property). We show that the $\\exp\\Big(c \\frac{\\log n}{\\log \\Delta}\\Big)$-round Sherali--Adams linear programming hierarchy certifies that the maximum cut in such a~$G$ is at most $50.1\\%$ (in fact, at most $\\tfrac12 + 2^{-\\Omega(c)}$). For example, in random graphs with $n^{1.01}$ edges, $O(1)$ rounds suffice; in random graphs with $n \\cdot \\text{polylog}(n)$ edges, $n^{O(1/\\log \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09967","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":""},"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-05-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhOyWxfwCZVkiF/LjbmuvChlaFytevC3qr8UQgeN/Rki/E0a+Hoemtc5Q7HO/R+El41c9vQYbfRRJivXTeo0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:47.717711Z"},"content_sha256":"9d9528de057742d521862bb84dfe2a78c54831c80cabb7c72ebd0dc531d7565f","schema_version":"1.0","event_id":"sha256:9d9528de057742d521862bb84dfe2a78c54831c80cabb7c72ebd0dc531d7565f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/bundle.json","state_url":"https://pith.science/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/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-06-04T20:26:47Z","links":{"resolver":"https://pith.science/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6","bundle":"https://pith.science/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/bundle.json","state":"https://pith.science/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWHB7TUJPI5RAZH2NHHKJ4VZR6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QWHB7TUJPI5RAZH2NHHKJ4VZR6","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":"bec1ec7467a212d4de7351bb02f579c36d5613963cdfb8f65eec2e9b1e5908b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T19:23:52Z","title_canon_sha256":"a1141eab935692dd1db21b5b60a522fb63be3f00fb05cbaab80d4d13f6a8f256"},"schema_version":"1.0","source":{"id":"1812.09967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09967","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09967v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09967","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"QWHB7TUJPI5R","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QWHB7TUJPI5RAZH2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QWHB7TUJ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:9d9528de057742d521862bb84dfe2a78c54831c80cabb7c72ebd0dc531d7565f","target":"graph","created_at":"2026-05-17T23:57: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"},"paper":{"abstract_excerpt":"Let $G$ be any $n$-vertex graph whose random walk matrix has its nontrivial eigenvalues bounded in magnitude by $1/\\sqrt{\\Delta}$ (for example, a random graph $G$ of average degree~$\\Theta(\\Delta)$ typically has this property). We show that the $\\exp\\Big(c \\frac{\\log n}{\\log \\Delta}\\Big)$-round Sherali--Adams linear programming hierarchy certifies that the maximum cut in such a~$G$ is at most $50.1\\%$ (in fact, at most $\\tfrac12 + 2^{-\\Omega(c)}$). For example, in random graphs with $n^{1.01}$ edges, $O(1)$ rounds suffice; in random graphs with $n \\cdot \\text{polylog}(n)$ edges, $n^{O(1/\\log \\","authors_text":"Ryan O'Donnell, Tselil Schramm","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T19:23:52Z","title":"Sherali--Adams Strikes Back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09967","kind":"arxiv","version":1},"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:017b2bc58627061c1ef119a2333cf180f74bd624bf9b2a1760cc946ae219312c","target":"record","created_at":"2026-05-17T23:57: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":"bec1ec7467a212d4de7351bb02f579c36d5613963cdfb8f65eec2e9b1e5908b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-24T19:23:52Z","title_canon_sha256":"a1141eab935692dd1db21b5b60a522fb63be3f00fb05cbaab80d4d13f6a8f256"},"schema_version":"1.0","source":{"id":"1812.09967","kind":"arxiv","version":1}},"canonical_sha256":"858e1fce897a3b1064fa69cea4f2b98f98a490932a127ed75af0a51abf8da8e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858e1fce897a3b1064fa69cea4f2b98f98a490932a127ed75af0a51abf8da8e3","first_computed_at":"2026-05-17T23:57:26.247996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:26.247996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdC+lwZGO4oUTCRWUXRUP2+FFMflvCBJgrtrKDlJSeIsjZuflg/zFEdM1OrYFemoSDpasPEtWLyp1T13NtfDDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:26.248488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:017b2bc58627061c1ef119a2333cf180f74bd624bf9b2a1760cc946ae219312c","sha256:9d9528de057742d521862bb84dfe2a78c54831c80cabb7c72ebd0dc531d7565f"],"state_sha256":"73b9745ac2cdb85509dab1c15bcf4bd85bbba0ac0f8135273f44925e2f5bf143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vV5O2lp/0OkmSw4TqOEzf3CWfHuGqxV1wxGpAut6FUDKDemP8XzRS6wir3wHHQLyV1wdhH+uplx902nEc8HBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:26:47.719658Z","bundle_sha256":"dbb5c985757564cb35feeb6bcaaaa101cee520b145964d12e3ef0bfca13c45f2"}}