{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MXR53TL75BZFNT2X3RPSHUG3KC","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":"80be71f9cd80cc2ff3b2c0fd87d2e967615e05296ac780ef3e3acbfc4af05652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-08T17:09:48Z","title_canon_sha256":"b3e0d16dd10e880d61478e80d00f1eac5c0f0e5b992793beebeebf7ff1e0b0e9"},"schema_version":"1.0","source":{"id":"2011.04027","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04027","created_at":"2026-07-05T03:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04027v3","created_at":"2026-07-05T03:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04027","created_at":"2026-07-05T03:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"MXR53TL75BZF","created_at":"2026-07-05T03:49:37Z"},{"alias_kind":"pith_short_16","alias_value":"MXR53TL75BZFNT2X","created_at":"2026-07-05T03:49:37Z"},{"alias_kind":"pith_short_8","alias_value":"MXR53TL7","created_at":"2026-07-05T03:49:37Z"}],"graph_snapshots":[{"event_id":"sha256:43ae1b9d17ebfc0d9652805732bfa6e995406767021deeb9c17e7406c75bcab5","target":"graph","created_at":"2026-07-05T03:49:37Z","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/2011.04027/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the sum-of-squares hierarchy of approximations for the problem of minimizing a polynomial $f$ over the boolean hypercube $\\mathbb{B}^{n}=\\{0,1\\}^n$. This hierarchy provides for each integer $r \\in \\mathbb{N}$ a lower bound $f_{(r)}$ on the minimum $f_{\\min}$ of $f$, given by the largest scalar $\\lambda$ for which the polynomial $f - \\lambda$ is a sum-of-squares on $\\mathbb{B}^{n}$ with degree at most $2r$. We analyze the quality of these bounds by estimating the worst-case error $f_{\\min} - f_{(r)}$ in terms of the least roots of the Krawtchouk polynomials. As a consequence, for fi","authors_text":"Lucas Slot, Monique Laurent","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-08T17:09:48Z","title":"Sum-of-squares hierarchies for binary polynomial optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04027","kind":"arxiv","version":3},"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:bd6e64c7f1d1318baf53ff25ad80da495f6c45ee2d7bd4d9d6c3f04bff58f03f","target":"record","created_at":"2026-07-05T03:49:37Z","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":"80be71f9cd80cc2ff3b2c0fd87d2e967615e05296ac780ef3e3acbfc4af05652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-08T17:09:48Z","title_canon_sha256":"b3e0d16dd10e880d61478e80d00f1eac5c0f0e5b992793beebeebf7ff1e0b0e9"},"schema_version":"1.0","source":{"id":"2011.04027","kind":"arxiv","version":3}},"canonical_sha256":"65e3ddcd7fe87256cf57dc5f23d0db50920cc1764e60bba928d7fdfca7842af6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65e3ddcd7fe87256cf57dc5f23d0db50920cc1764e60bba928d7fdfca7842af6","first_computed_at":"2026-07-05T03:49:37.836641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:49:37.836641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gx06E/bRfXgaQsVvLpt64oG0olrnZqVVkpRjmV4znLeSR7013H7sAUrCK9OadCk1E7oXwDXBWzxcjknSuWR3DA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:49:37.837080Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04027","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd6e64c7f1d1318baf53ff25ad80da495f6c45ee2d7bd4d9d6c3f04bff58f03f","sha256:43ae1b9d17ebfc0d9652805732bfa6e995406767021deeb9c17e7406c75bcab5"],"state_sha256":"3ed04aa6ee6a607c1e5cb9cd0345419784bc0a6846630624ca6d75ffd0f357be"}