{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XUYCFAQXKVHZU535Y5KT2LM4ZV","short_pith_number":"pith:XUYCFAQX","canonical_record":{"source":{"id":"1602.05409","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-02-17T13:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"31bebde7862af1efda4417519ead0df21fdece7465e7539c36c6fdd00a60d22c","abstract_canon_sha256":"57e34d452a3f605420330bdc87752de06679ea65dee9a145577bae49cf7fea7a"},"schema_version":"1.0"},"canonical_sha256":"bd30228217554f9a777dc7553d2d9ccd61c810f52db579ed0bb6879410728f34","source":{"kind":"arxiv","id":"1602.05409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05409","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05409v2","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05409","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"XUYCFAQXKVHZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUYCFAQXKVHZU535","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUYCFAQX","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XUYCFAQXKVHZU535Y5KT2LM4ZV","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05409","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-02-17T13:45:38Z","cross_cats_sorted":[],"title_canon_sha256":"31bebde7862af1efda4417519ead0df21fdece7465e7539c36c6fdd00a60d22c","abstract_canon_sha256":"57e34d452a3f605420330bdc87752de06679ea65dee9a145577bae49cf7fea7a"},"schema_version":"1.0"},"canonical_sha256":"bd30228217554f9a777dc7553d2d9ccd61c810f52db579ed0bb6879410728f34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:59.444603Z","signature_b64":"9ja6o0/3QIgfGsUkzIAxlU7y4PU9MZGg0+lkNRK4vMrsJj93TvmgjNpxB0tafvBniLVJoGhS2TRutGrqi1cSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd30228217554f9a777dc7553d2d9ccd61c810f52db579ed0bb6879410728f34","last_reissued_at":"2026-05-18T01:03:59.443839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:59.443839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05409","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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26zBbkUjQbyK5aiqnduG8FVBnhQx+GdhzP4MGu2xtIY4QlZaXUQ7E+n8JsB68b/9jw0CTQ46vv5dBi0inj+wBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:00.266766Z"},"content_sha256":"68ed23740a56392ec99f8ef3f806aee8dbe0e4ca1bf3186cb1f9559f8902ad69","schema_version":"1.0","event_id":"sha256:68ed23740a56392ec99f8ef3f806aee8dbe0e4ca1bf3186cb1f9559f8902ad69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XUYCFAQXKVHZU535Y5KT2LM4ZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lasserre Lower Bounds and Definability of Semidefinite Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Anuj Dawar, Pengming Wang","submitted_at":"2016-02-17T13:45:38Z","abstract_excerpt":"For a large class of optimization problems, namely those that can be expressed as finite-valued constraint satisfaction problems (VCSPs), we establish a dichotomy on the number of levels of the Lasserre hierarchy of semi-definite programs (SDPs) that are required to solve the problem exactly. In particular, we show that if a finite-valued constraint problem is not solved exactly by its basic linear programming relaxation, it is also not solved exactly by any sub-linear number of levels of the Lasserre hierarchy. The lower bounds are established through logical undefinability results. We show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05409","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:03:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xG4o+kR1nLDaqAMgm+K+qwaG6RaUs9g8QyXTbvDUM4id32p4u1AUvVmiqETcpynhiM25Qec9r/S/BEi3W+9dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:11:00.267114Z"},"content_sha256":"ce3dc0e3a4921b09335b229bc118800f1d6ce5c35a3e3641d687787bdc7a30a6","schema_version":"1.0","event_id":"sha256:ce3dc0e3a4921b09335b229bc118800f1d6ce5c35a3e3641d687787bdc7a30a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/bundle.json","state_url":"https://pith.science/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/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-05-30T06:11:00Z","links":{"resolver":"https://pith.science/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV","bundle":"https://pith.science/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/bundle.json","state":"https://pith.science/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUYCFAQXKVHZU535Y5KT2LM4ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XUYCFAQXKVHZU535Y5KT2LM4ZV","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":"57e34d452a3f605420330bdc87752de06679ea65dee9a145577bae49cf7fea7a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-02-17T13:45:38Z","title_canon_sha256":"31bebde7862af1efda4417519ead0df21fdece7465e7539c36c6fdd00a60d22c"},"schema_version":"1.0","source":{"id":"1602.05409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05409","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05409v2","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05409","created_at":"2026-05-18T01:03:59Z"},{"alias_kind":"pith_short_12","alias_value":"XUYCFAQXKVHZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XUYCFAQXKVHZU535","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XUYCFAQX","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ce3dc0e3a4921b09335b229bc118800f1d6ce5c35a3e3641d687787bdc7a30a6","target":"graph","created_at":"2026-05-18T01:03:59Z","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":"For a large class of optimization problems, namely those that can be expressed as finite-valued constraint satisfaction problems (VCSPs), we establish a dichotomy on the number of levels of the Lasserre hierarchy of semi-definite programs (SDPs) that are required to solve the problem exactly. In particular, we show that if a finite-valued constraint problem is not solved exactly by its basic linear programming relaxation, it is also not solved exactly by any sub-linear number of levels of the Lasserre hierarchy. The lower bounds are established through logical undefinability results. We show t","authors_text":"Anuj Dawar, Pengming Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-02-17T13:45:38Z","title":"Lasserre Lower Bounds and Definability of Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05409","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:68ed23740a56392ec99f8ef3f806aee8dbe0e4ca1bf3186cb1f9559f8902ad69","target":"record","created_at":"2026-05-18T01:03:59Z","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":"57e34d452a3f605420330bdc87752de06679ea65dee9a145577bae49cf7fea7a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-02-17T13:45:38Z","title_canon_sha256":"31bebde7862af1efda4417519ead0df21fdece7465e7539c36c6fdd00a60d22c"},"schema_version":"1.0","source":{"id":"1602.05409","kind":"arxiv","version":2}},"canonical_sha256":"bd30228217554f9a777dc7553d2d9ccd61c810f52db579ed0bb6879410728f34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd30228217554f9a777dc7553d2d9ccd61c810f52db579ed0bb6879410728f34","first_computed_at":"2026-05-18T01:03:59.443839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:59.443839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ja6o0/3QIgfGsUkzIAxlU7y4PU9MZGg0+lkNRK4vMrsJj93TvmgjNpxB0tafvBniLVJoGhS2TRutGrqi1cSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:59.444603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68ed23740a56392ec99f8ef3f806aee8dbe0e4ca1bf3186cb1f9559f8902ad69","sha256:ce3dc0e3a4921b09335b229bc118800f1d6ce5c35a3e3641d687787bdc7a30a6"],"state_sha256":"6a56a49197ad3024eca56223c9bca00ab599db4faf703f1009c0ae4fe5a75867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuVwpjycPlFTqnGdyz3PiLfyvL2Ty6Ptcw2+tBCvyhgvqR8FZKMDNXPSzEbcnbsE7n1Cw7d4YEIH72B0QtClAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:11:00.269246Z","bundle_sha256":"9f710929a115c53a5148b0c842b28dee72306995b7c794cb03bb19cc2c04b0b0"}}