{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MXR53TL75BZFNT2X3RPSHUG3KC","short_pith_number":"pith:MXR53TL7","canonical_record":{"source":{"id":"2011.04027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-08T17:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"b3e0d16dd10e880d61478e80d00f1eac5c0f0e5b992793beebeebf7ff1e0b0e9","abstract_canon_sha256":"80be71f9cd80cc2ff3b2c0fd87d2e967615e05296ac780ef3e3acbfc4af05652"},"schema_version":"1.0"},"canonical_sha256":"65e3ddcd7fe87256cf57dc5f23d0db50920cc1764e60bba928d7fdfca7842af6","source":{"kind":"arxiv","id":"2011.04027","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MXR53TL75BZFNT2X3RPSHUG3KC","target":"record","payload":{"canonical_record":{"source":{"id":"2011.04027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-08T17:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"b3e0d16dd10e880d61478e80d00f1eac5c0f0e5b992793beebeebf7ff1e0b0e9","abstract_canon_sha256":"80be71f9cd80cc2ff3b2c0fd87d2e967615e05296ac780ef3e3acbfc4af05652"},"schema_version":"1.0"},"canonical_sha256":"65e3ddcd7fe87256cf57dc5f23d0db50920cc1764e60bba928d7fdfca7842af6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:49:37.837080Z","signature_b64":"gx06E/bRfXgaQsVvLpt64oG0olrnZqVVkpRjmV4znLeSR7013H7sAUrCK9OadCk1E7oXwDXBWzxcjknSuWR3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e3ddcd7fe87256cf57dc5f23d0db50920cc1764e60bba928d7fdfca7842af6","last_reissued_at":"2026-07-05T03:49:37.836641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:49:37.836641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.04027","source_version":3,"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-05T03:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nK2Gzagpz8exuBXfaAKgSKLLhD289wpJOMXjii/0H+x+m29TVhCM1CfMO+lZChxU4SUjjeBr3Viy/8ypJTxbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:38:07.551750Z"},"content_sha256":"bd6e64c7f1d1318baf53ff25ad80da495f6c45ee2d7bd4d9d6c3f04bff58f03f","schema_version":"1.0","event_id":"sha256:bd6e64c7f1d1318baf53ff25ad80da495f6c45ee2d7bd4d9d6c3f04bff58f03f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MXR53TL75BZFNT2X3RPSHUG3KC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-of-squares hierarchies for binary polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lucas Slot, Monique Laurent","submitted_at":"2020-11-08T17:09:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04027","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/2011.04027/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-05T03:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Fyn5DOd7iPTOPAwMMWPJFcFNbovNe7lJKu13+X9yGv7eKrYUuFEEoY7VuBa4b+RR67QZu6UcA4ZWMl3mEjjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:38:07.552675Z"},"content_sha256":"43ae1b9d17ebfc0d9652805732bfa6e995406767021deeb9c17e7406c75bcab5","schema_version":"1.0","event_id":"sha256:43ae1b9d17ebfc0d9652805732bfa6e995406767021deeb9c17e7406c75bcab5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXR53TL75BZFNT2X3RPSHUG3KC/bundle.json","state_url":"https://pith.science/pith/MXR53TL75BZFNT2X3RPSHUG3KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXR53TL75BZFNT2X3RPSHUG3KC/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-11T17:38:07Z","links":{"resolver":"https://pith.science/pith/MXR53TL75BZFNT2X3RPSHUG3KC","bundle":"https://pith.science/pith/MXR53TL75BZFNT2X3RPSHUG3KC/bundle.json","state":"https://pith.science/pith/MXR53TL75BZFNT2X3RPSHUG3KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXR53TL75BZFNT2X3RPSHUG3KC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVyiuuAVzueqytrNNHs9I+M6s4VU+PCvnsXcrUFABDyMdHGT0pxZ18fEQ6U18yW95OVjFz2Tia+HB9TBGsV5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:38:07.557627Z","bundle_sha256":"b6bab99213f43a7d4f5e2fbb97f9b4b9156111280541dca0bccc18e3c9448a00"}}