{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZTVKVH4AOOY5GNVR7MHR3NI5CM","short_pith_number":"pith:ZTVKVH4A","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"},"canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","source":{"kind":"arxiv","id":"1407.1746","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1746","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1746v2","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1746","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVKVH4AOOY5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVKVH4AOOY5GNVR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVKVH4A","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZTVKVH4AOOY5GNVR7MHR3NI5CM","target":"record","payload":{"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"},"canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","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"},"source_kind":"arxiv","source_id":"1407.1746","source_version":2,"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:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbmBRTaHbD14F1GSf16ZBAoqppkJS/a/07nC2u/wGPzQ4h9HC3TVD5MFruj0rjLysMdFFJTuSx5YgaH7nG70Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:07:28.177693Z"},"content_sha256":"7a5cfef0b56c92144b574c2590110bd7543c40b401e5e67756297308ea42047c","schema_version":"1.0","event_id":"sha256:7a5cfef0b56c92144b574c2590110bd7543c40b401e5e67756297308ea42047c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZTVKVH4AOOY5GNVR7MHR3NI5CM","target":"graph","payload":{"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"},"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:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1+0VI4tUj5jMbc5toEFRWoSJ3NrpUPzUYvE5eStth2Sp7FQ+iwkXnUVTMnpCxbR7IIoagLdgto9LsoeA6LSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:07:28.178029Z"},"content_sha256":"2f787bdf9eda8648066fb9c92c30901967e1755e6908a99143752e84432e6a33","schema_version":"1.0","event_id":"sha256:2f787bdf9eda8648066fb9c92c30901967e1755e6908a99143752e84432e6a33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/bundle.json","state_url":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/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-26T13:07:28Z","links":{"resolver":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM","bundle":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/bundle.json","state":"https://pith.science/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTVKVH4AOOY5GNVR7MHR3NI5CM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZTVKVH4AOOY5GNVR7MHR3NI5CM","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":"c9ba633c79a9530e2489845edfa9a6b24b4af85671571fd504654b230ec07419","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-07T15:37:56Z","title_canon_sha256":"3e6109714176f0b4a243664e754c5b410ca252ab85b464e245a7a6ad288cfafe"},"schema_version":"1.0","source":{"id":"1407.1746","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1746","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1746v2","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1746","created_at":"2026-05-18T01:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZTVKVH4AOOY5","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZTVKVH4AOOY5GNVR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZTVKVH4A","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:2f787bdf9eda8648066fb9c92c30901967e1755e6908a99143752e84432e6a33","target":"graph","created_at":"2026-05-18T01:21:02Z","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 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","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-07T15:37:56Z","title":"Sum-of-squares hierarchy lower bounds for symmetric formulations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1746","kind":"arxiv","version":2},"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:7a5cfef0b56c92144b574c2590110bd7543c40b401e5e67756297308ea42047c","target":"record","created_at":"2026-05-18T01:21:02Z","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":"c9ba633c79a9530e2489845edfa9a6b24b4af85671571fd504654b230ec07419","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-07T15:37:56Z","title_canon_sha256":"3e6109714176f0b4a243664e754c5b410ca252ab85b464e245a7a6ad288cfafe"},"schema_version":"1.0","source":{"id":"1407.1746","kind":"arxiv","version":2}},"canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cceaaa9f8073b1d336b1fb0f1db51d130350b75c1034c49a503cb1ec5758bacf","first_computed_at":"2026-05-18T01:21:02.938880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:02.938880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YJD4D7QQ85QRH6aB8R0mBefkfTIH90Z7OaqnmeMaiPX7aliQkpR4WEbkDUdAfuiEu81tIsIylm7yNHwKpGlyDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:02.939492Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1746","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a5cfef0b56c92144b574c2590110bd7543c40b401e5e67756297308ea42047c","sha256:2f787bdf9eda8648066fb9c92c30901967e1755e6908a99143752e84432e6a33"],"state_sha256":"c783c41178e91dbab0dd78e7e750125662dc19f528f9e0c823acdceb5572f22e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dmrZWzLC9V9RGKRibHsixKklY04bERPSPtlredTS0GQRF8ySY90l4is0Zj2XUFxC1SPszNCf3RelXEMGJXUODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:07:28.180030Z","bundle_sha256":"045f45fba5277dfffc60438045ac3b962c9b663e2a9a3a94b9c987e182346fb4"}}