{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEFKWYEKTVRPA6D2YSPRHBDJWJ","short_pith_number":"pith:SEFKWYEK","schema_version":"1.0","canonical_sha256":"910aab608a9d62f0787ac49f138469b2495761f1f059aeb0a46e23922db37a39","source":{"kind":"arxiv","id":"1504.01656","version":1},"attestation_state":"computed","paper":{"title":"Tight Size-Degree Bounds for Sums-of-Squares Proofs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jakob Nordstr\\\"om, Massimo Lauria","submitted_at":"2015-04-07T16:15:22Z","abstract_excerpt":"We exhibit families of $4$-CNF formulas over $n$ variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) $d$ but require SOS proofs of size $n^{\\Omega(d)}$ for values of $d = d(n)$ from constant all the way up to $n^{\\delta}$ for some universal constant$\\delta$. This shows that the $n^{O(d)}$ running time obtained by using the Lasserre semidefinite programming relaxations to find degree-$d$ SOS proofs is optimal up to constant factors in the exponent. We establish this result by combining $\\mathsf{NP}$-reductions expressible as low-degree SOS derivations wi"},"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":"1504.01656","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-04-07T16:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"dd6e5c99dc0885fd6dcdc21aef5375654a5c526fa411efce0e2562e9e8d55d16","abstract_canon_sha256":"56b32598c5cd04b3595d20c2d4a164405732692359f3bb501a1d95272e00b0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:26.545340Z","signature_b64":"coM73SxoiQzGiPu4+6XDZjwJEdMCqmMKGXK1ZnY3mKNW8GWmhf/FcTNOmA0ptSYH1C1TUxfYXtQixZUEwThlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910aab608a9d62f0787ac49f138469b2495761f1f059aeb0a46e23922db37a39","last_reissued_at":"2026-05-18T02:19:26.544725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:26.544725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Size-Degree Bounds for Sums-of-Squares Proofs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jakob Nordstr\\\"om, Massimo Lauria","submitted_at":"2015-04-07T16:15:22Z","abstract_excerpt":"We exhibit families of $4$-CNF formulas over $n$ variables that have sums-of-squares (SOS) proofs of unsatisfiability of degree (a.k.a. rank) $d$ but require SOS proofs of size $n^{\\Omega(d)}$ for values of $d = d(n)$ from constant all the way up to $n^{\\delta}$ for some universal constant$\\delta$. This shows that the $n^{O(d)}$ running time obtained by using the Lasserre semidefinite programming relaxations to find degree-$d$ SOS proofs is optimal up to constant factors in the exponent. We establish this result by combining $\\mathsf{NP}$-reductions expressible as low-degree SOS derivations wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01656","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":"1504.01656","created_at":"2026-05-18T02:19:26.544825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01656v1","created_at":"2026-05-18T02:19:26.544825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01656","created_at":"2026-05-18T02:19:26.544825+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEFKWYEKTVRP","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEFKWYEKTVRPA6D2","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEFKWYEK","created_at":"2026-05-18T12:29:39.896362+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/SEFKWYEKTVRPA6D2YSPRHBDJWJ","json":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ.json","graph_json":"https://pith.science/api/pith-number/SEFKWYEKTVRPA6D2YSPRHBDJWJ/graph.json","events_json":"https://pith.science/api/pith-number/SEFKWYEKTVRPA6D2YSPRHBDJWJ/events.json","paper":"https://pith.science/paper/SEFKWYEK"},"agent_actions":{"view_html":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ","download_json":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ.json","view_paper":"https://pith.science/paper/SEFKWYEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01656&json=true","fetch_graph":"https://pith.science/api/pith-number/SEFKWYEKTVRPA6D2YSPRHBDJWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SEFKWYEKTVRPA6D2YSPRHBDJWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ/action/storage_attestation","attest_author":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ/action/author_attestation","sign_citation":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ/action/citation_signature","submit_replication":"https://pith.science/pith/SEFKWYEKTVRPA6D2YSPRHBDJWJ/action/replication_record"}},"created_at":"2026-05-18T02:19:26.544825+00:00","updated_at":"2026-05-18T02:19:26.544825+00:00"}