{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2EKJKPVN6EUOMXVTECGVM44RS7","short_pith_number":"pith:2EKJKPVN","schema_version":"1.0","canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","source":{"kind":"arxiv","id":"1605.03019","version":1},"attestation_state":"computed","paper":{"title":"Tight Sum-of-Squares lower bounds for binary polynomial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2016-05-10T14:03:44Z","abstract_excerpt":"We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\\frac{n+2d-1}{2}$ levels of the SoS/Lasserre hierarchy are necessary to provide the exact optimal value. This matches the recent upper bound result by Sakaue, Takeda, Kim and Ito.\n  Additionally, we study a conjecture by Laurent, who considered the linear representation of a set with no integral points. She showed that the Sherali-Adams hierarchy requires $n$ levels to detect the empty integer hull,"},"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":"1605.03019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T14:03:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7fc2ab15ac8a0e47949eae7d6928958e039fa376f81c8093644ed2381826fdd4","abstract_canon_sha256":"982b56ce2562f29535ad4aec5dbd485f662adaf7f89b05750dbc42a8487ced31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:07.858058Z","signature_b64":"tSj18/I7evRfl+vP/C43B2bSomNn1X4slXg1rD4Wr6b4mm+aYK6tdvG3Y4CMl0QIsox0c/Kh9Leocyh/EBKnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","last_reissued_at":"2026-05-18T01:15:07.857362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:07.857362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Sum-of-Squares lower bounds for binary polynomial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2016-05-10T14:03:44Z","abstract_excerpt":"We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\\frac{n+2d-1}{2}$ levels of the SoS/Lasserre hierarchy are necessary to provide the exact optimal value. This matches the recent upper bound result by Sakaue, Takeda, Kim and Ito.\n  Additionally, we study a conjecture by Laurent, who considered the linear representation of a set with no integral points. She showed that the Sherali-Adams hierarchy requires $n$ levels to detect the empty integer hull,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.03019","created_at":"2026-05-18T01:15:07.857473+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03019v1","created_at":"2026-05-18T01:15:07.857473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03019","created_at":"2026-05-18T01:15:07.857473+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EKJKPVN6EUO","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EKJKPVN6EUOMXVT","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EKJKPVN","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7","json":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7.json","graph_json":"https://pith.science/api/pith-number/2EKJKPVN6EUOMXVTECGVM44RS7/graph.json","events_json":"https://pith.science/api/pith-number/2EKJKPVN6EUOMXVTECGVM44RS7/events.json","paper":"https://pith.science/paper/2EKJKPVN"},"agent_actions":{"view_html":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7","download_json":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7.json","view_paper":"https://pith.science/paper/2EKJKPVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03019&json=true","fetch_graph":"https://pith.science/api/pith-number/2EKJKPVN6EUOMXVTECGVM44RS7/graph.json","fetch_events":"https://pith.science/api/pith-number/2EKJKPVN6EUOMXVTECGVM44RS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/action/storage_attestation","attest_author":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/action/author_attestation","sign_citation":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/action/citation_signature","submit_replication":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/action/replication_record"}},"created_at":"2026-05-18T01:15:07.857473+00:00","updated_at":"2026-05-18T01:15:07.857473+00:00"}