{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZTVKVH4AOOY5GNVR7MHR3NI5CM","short_pith_number":"pith:ZTVKVH4A","schema_version":"1.0","canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","source":{"kind":"arxiv","id":"1407.1746","version":2},"attestation_state":"computed","paper":{"title":"Sum-of-squares hierarchy lower bounds for symmetric formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2014-07-07T15:37:56Z","abstract_excerpt":"We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive semidefiniteness to the analysis of \"well-behaved\" univariate polynomial inequalities.\n  We illustrate the technique on two problems, one unconstrained and the other with constraints. More precisely, we give a short elementary proof of Grigoriev/Laurent lower bound for finding the integer cut polytope of the complete graph. We also show that the SoS hierarchy requ"},"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":"1407.1746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-07T15:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"3e6109714176f0b4a243664e754c5b410ca252ab85b464e245a7a6ad288cfafe","abstract_canon_sha256":"c9ba633c79a9530e2489845edfa9a6b24b4af85671571fd504654b230ec07419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:02.939492Z","signature_b64":"YJD4D7QQ85QRH6aB8R0mBefkfTIH90Z7OaqnmeMaiPX7aliQkpR4WEbkDUdAfuiEu81tIsIylm7yNHwKpGlyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","last_reissued_at":"2026-05-18T01:21:02.938880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:02.938880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sum-of-squares hierarchy lower bounds for symmetric formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2014-07-07T15:37:56Z","abstract_excerpt":"We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive semidefiniteness to the analysis of \"well-behaved\" univariate polynomial inequalities.\n  We illustrate the technique on two problems, one unconstrained and the other with constraints. More precisely, we give a short elementary proof of Grigoriev/Laurent lower bound for finding the integer cut polytope of the complete graph. We also show that the SoS hierarchy requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1746","kind":"arxiv","version":2},"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":"1407.1746","created_at":"2026-05-18T01:21:02.938971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1746v2","created_at":"2026-05-18T01:21:02.938971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1746","created_at":"2026-05-18T01:21:02.938971+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTVKVH4AOOY5","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTVKVH4AOOY5GNVR","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTVKVH4A","created_at":"2026-05-18T12:28:59.999130+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/ZTVKVH4AOOY5GNVR7MHR3NI5CM","json":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM.json","graph_json":"https://pith.science/api/pith-number/ZTVKVH4AOOY5GNVR7MHR3NI5CM/graph.json","events_json":"https://pith.science/api/pith-number/ZTVKVH4AOOY5GNVR7MHR3NI5CM/events.json","paper":"https://pith.science/paper/ZTVKVH4A"},"agent_actions":{"view_html":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM","download_json":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM.json","view_paper":"https://pith.science/paper/ZTVKVH4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1746&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTVKVH4AOOY5GNVR7MHR3NI5CM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTVKVH4AOOY5GNVR7MHR3NI5CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/action/storage_attestation","attest_author":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/action/author_attestation","sign_citation":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/action/citation_signature","submit_replication":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/action/replication_record"}},"created_at":"2026-05-18T01:21:02.938971+00:00","updated_at":"2026-05-18T01:21:02.938971+00:00"}