{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WQXMSE4LDUDDQ5ZMZKYJVIKVZ2","short_pith_number":"pith:WQXMSE4L","canonical_record":{"source":{"id":"1211.1958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-08T19:59:30Z","cross_cats_sorted":[],"title_canon_sha256":"fd4ded2d8c6810171df9c5c4a18411af66161ef9e44e915a325403d1c32c200f","abstract_canon_sha256":"6aa53479605142bed4bfbda104b730e19a05da8a41b042fe12e5c054dbdbc296"},"schema_version":"1.0"},"canonical_sha256":"b42ec9138b1d0638772ccab09aa155cea7038b96d0134d51af24cb58908cdfcc","source":{"kind":"arxiv","id":"1211.1958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1958","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1958v1","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1958","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"WQXMSE4LDUDD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WQXMSE4LDUDDQ5ZM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WQXMSE4L","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WQXMSE4LDUDDQ5ZMZKYJVIKVZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-08T19:59:30Z","cross_cats_sorted":[],"title_canon_sha256":"fd4ded2d8c6810171df9c5c4a18411af66161ef9e44e915a325403d1c32c200f","abstract_canon_sha256":"6aa53479605142bed4bfbda104b730e19a05da8a41b042fe12e5c054dbdbc296"},"schema_version":"1.0"},"canonical_sha256":"b42ec9138b1d0638772ccab09aa155cea7038b96d0134d51af24cb58908cdfcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:13.155470Z","signature_b64":"LT6h95m9Gl7R1m0brp2eV37NIqL6hgDOY8S6kpi9bUGkiOmJbRjjAFCfHNZNQw43mN2x4eEcKe3NlC9YaY/OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42ec9138b1d0638772ccab09aa155cea7038b96d0134d51af24cb58908cdfcc","last_reissued_at":"2026-05-18T03:41:13.154910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:13.154910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1958","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-18T03:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s/+ieXXC+SKUNqmLHvbTE/J1aWfqdWNVg2/ZVjqGI15GeYCgr5Jd/LTAfCMBQu/Hrr5nUABXxERr9wTSfa1YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:04:03.903097Z"},"content_sha256":"494477a60459cc5825a7c178abbe59fd026f3bd050f04f268ea4573a72f8ed1b","schema_version":"1.0","event_id":"sha256:494477a60459cc5825a7c178abbe59fd026f3bd050f04f268ea4573a72f8ed1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WQXMSE4LDUDDQ5ZMZKYJVIKVZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability and proof complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ryan O'Donnell, Yuan Zhou","submitted_at":"2012-11-08T19:59:30Z","abstract_excerpt":"This work is concerned with the proof-complexity of certifying that optimization problems do \\emph{not} have good solutions. Specifically we consider bounded-degree \"Sum of Squares\" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by Grigoriev and Vorobjov. Work of Shor, Lasserre, and Parrilo shows that this proof system is automatizable using semidefinite programming (SDP), meaning that any $n$-variable degree-$d$ proof can be found in time $n^{O(d)}$. Furthermore, the SDP is dual to the well-known Lasserre SDP hierarchy, meaning that the \"$d/2$-round Lasserre value\" of an o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1958","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-18T03:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQOTue2hF/U25dmLGnVMRj/1A0ndHX9+b12DVxNj/lPqJrOscP+ea7IE1h84osR3HFeDN583lmEgHG+AopLfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:04:03.903617Z"},"content_sha256":"335787d0adb645d43730d6d73229d5b396357529a6789b71cb081824355e7221","schema_version":"1.0","event_id":"sha256:335787d0adb645d43730d6d73229d5b396357529a6789b71cb081824355e7221"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/bundle.json","state_url":"https://pith.science/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/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-06T19:04:03Z","links":{"resolver":"https://pith.science/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2","bundle":"https://pith.science/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/bundle.json","state":"https://pith.science/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQXMSE4LDUDDQ5ZMZKYJVIKVZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WQXMSE4LDUDDQ5ZMZKYJVIKVZ2","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":"6aa53479605142bed4bfbda104b730e19a05da8a41b042fe12e5c054dbdbc296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-08T19:59:30Z","title_canon_sha256":"fd4ded2d8c6810171df9c5c4a18411af66161ef9e44e915a325403d1c32c200f"},"schema_version":"1.0","source":{"id":"1211.1958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1958","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1958v1","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1958","created_at":"2026-05-18T03:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"WQXMSE4LDUDD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WQXMSE4LDUDDQ5ZM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WQXMSE4L","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:335787d0adb645d43730d6d73229d5b396357529a6789b71cb081824355e7221","target":"graph","created_at":"2026-05-18T03:41:13Z","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":"This work is concerned with the proof-complexity of certifying that optimization problems do \\emph{not} have good solutions. Specifically we consider bounded-degree \"Sum of Squares\" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by Grigoriev and Vorobjov. Work of Shor, Lasserre, and Parrilo shows that this proof system is automatizable using semidefinite programming (SDP), meaning that any $n$-variable degree-$d$ proof can be found in time $n^{O(d)}$. Furthermore, the SDP is dual to the well-known Lasserre SDP hierarchy, meaning that the \"$d/2$-round Lasserre value\" of an o","authors_text":"Ryan O'Donnell, Yuan Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-08T19:59:30Z","title":"Approximability and proof complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1958","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:494477a60459cc5825a7c178abbe59fd026f3bd050f04f268ea4573a72f8ed1b","target":"record","created_at":"2026-05-18T03:41:13Z","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":"6aa53479605142bed4bfbda104b730e19a05da8a41b042fe12e5c054dbdbc296","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-08T19:59:30Z","title_canon_sha256":"fd4ded2d8c6810171df9c5c4a18411af66161ef9e44e915a325403d1c32c200f"},"schema_version":"1.0","source":{"id":"1211.1958","kind":"arxiv","version":1}},"canonical_sha256":"b42ec9138b1d0638772ccab09aa155cea7038b96d0134d51af24cb58908cdfcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b42ec9138b1d0638772ccab09aa155cea7038b96d0134d51af24cb58908cdfcc","first_computed_at":"2026-05-18T03:41:13.154910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:13.154910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LT6h95m9Gl7R1m0brp2eV37NIqL6hgDOY8S6kpi9bUGkiOmJbRjjAFCfHNZNQw43mN2x4eEcKe3NlC9YaY/OCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:13.155470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:494477a60459cc5825a7c178abbe59fd026f3bd050f04f268ea4573a72f8ed1b","sha256:335787d0adb645d43730d6d73229d5b396357529a6789b71cb081824355e7221"],"state_sha256":"d87cae935ee8ea1b66cadce9618fe0d624ac4b379be0ccd1028acdec5134df7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7rTsm4AKCXX7Ums5mSc2mZfUoVISxol8wd/mpbxh+4hUIFWAJ4B94w8q36V2cqk594CbLXPNZ76waBbJekXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:04:03.906165Z","bundle_sha256":"9d7412ae9470a58f1df83739fbce77894d6c7ce11e92940f9cb8d0d6fded2a27"}}