{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2EKJKPVN6EUOMXVTECGVM44RS7","short_pith_number":"pith:2EKJKPVN","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"},"canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","source":{"kind":"arxiv","id":"1605.03019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03019","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03019v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03019","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"2EKJKPVN6EUO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EKJKPVN6EUOMXVT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EKJKPVN","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2EKJKPVN6EUOMXVTECGVM44RS7","target":"record","payload":{"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"},"canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","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"},"source_kind":"arxiv","source_id":"1605.03019","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-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ucRHVvsTovt4x+ZliuKwgi7AWh/rErFEcJAccmw+fkROZp42H1V2XXxvaS3YikUq/dfz2oPISPOPma86zg9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:31:56.557765Z"},"content_sha256":"8ed1fe7556912653bc5d89726a085c54d43cc1d483b43917e20b9e89f7a8143f","schema_version":"1.0","event_id":"sha256:8ed1fe7556912653bc5d89726a085c54d43cc1d483b43917e20b9e89f7a8143f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2EKJKPVN6EUOMXVTECGVM44RS7","target":"graph","payload":{"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"},"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-18T01:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fp2TikjhafW19+L64qNQNknEYc4d0DkjP56xau/J5Zh8viTLUc4f8qGlIrPFdg6PI0ENVnagJehiKNpjM/cvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:31:56.558111Z"},"content_sha256":"cdd99700089b05430535743ea02c84d9f9807f97cf186b323e9bd25fa452f054","schema_version":"1.0","event_id":"sha256:cdd99700089b05430535743ea02c84d9f9807f97cf186b323e9bd25fa452f054"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/bundle.json","state_url":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EKJKPVN6EUOMXVTECGVM44RS7/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-26T11:31:56Z","links":{"resolver":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7","bundle":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/bundle.json","state":"https://pith.science/pith/2EKJKPVN6EUOMXVTECGVM44RS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EKJKPVN6EUOMXVTECGVM44RS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2EKJKPVN6EUOMXVTECGVM44RS7","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":"982b56ce2562f29535ad4aec5dbd485f662adaf7f89b05750dbc42a8487ced31","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T14:03:44Z","title_canon_sha256":"7fc2ab15ac8a0e47949eae7d6928958e039fa376f81c8093644ed2381826fdd4"},"schema_version":"1.0","source":{"id":"1605.03019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03019","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03019v1","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03019","created_at":"2026-05-18T01:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"2EKJKPVN6EUO","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EKJKPVN6EUOMXVT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EKJKPVN","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:cdd99700089b05430535743ea02c84d9f9807f97cf186b323e9bd25fa452f054","target":"graph","created_at":"2026-05-18T01:15:07Z","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":"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,","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T14:03:44Z","title":"Tight Sum-of-Squares lower bounds for binary polynomial optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03019","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:8ed1fe7556912653bc5d89726a085c54d43cc1d483b43917e20b9e89f7a8143f","target":"record","created_at":"2026-05-18T01:15:07Z","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":"982b56ce2562f29535ad4aec5dbd485f662adaf7f89b05750dbc42a8487ced31","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-10T14:03:44Z","title_canon_sha256":"7fc2ab15ac8a0e47949eae7d6928958e039fa376f81c8093644ed2381826fdd4"},"schema_version":"1.0","source":{"id":"1605.03019","kind":"arxiv","version":1}},"canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d114953eadf128e65eb3208d56739197f7b893127fb9c333552c56e50eda6eca","first_computed_at":"2026-05-18T01:15:07.857362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:07.857362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tSj18/I7evRfl+vP/C43B2bSomNn1X4slXg1rD4Wr6b4mm+aYK6tdvG3Y4CMl0QIsox0c/Kh9Leocyh/EBKnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:07.858058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed1fe7556912653bc5d89726a085c54d43cc1d483b43917e20b9e89f7a8143f","sha256:cdd99700089b05430535743ea02c84d9f9807f97cf186b323e9bd25fa452f054"],"state_sha256":"103f4daad205e9c9762d969f72fc4c3bd66d165f457053ce0d35a97a50f9fa8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QY4crmnC2YhUW+bkTfrRiut3dlrefH4kjHyQalkOCK95JU3op7fMmxI88ovWAsMEhJH687UUk4mOL06Yk333Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:31:56.560002Z","bundle_sha256":"9926eb4c83d64d5171eacdc19db1b7d796d7e47f152e222cd22545959815f287"}}