{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LHIHPU533QHJ4UVAM23BLCY65K","short_pith_number":"pith:LHIHPU53","canonical_record":{"source":{"id":"1306.6419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"96ff41c4a23df7c23e417df4b37c49e642534e770d77dfe65203c8c30ffcc76e","abstract_canon_sha256":"b3591500f22359189a0043fa7bed8cb043f17033d16e37ed92e50e2450c718f9"},"schema_version":"1.0"},"canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","source":{"kind":"arxiv","id":"1306.6419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6419","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6419v1","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6419","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"LHIHPU533QHJ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHIHPU533QHJ4UVA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHIHPU53","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LHIHPU533QHJ4UVAM23BLCY65K","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"96ff41c4a23df7c23e417df4b37c49e642534e770d77dfe65203c8c30ffcc76e","abstract_canon_sha256":"b3591500f22359189a0043fa7bed8cb043f17033d16e37ed92e50e2450c718f9"},"schema_version":"1.0"},"canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:44.801142Z","signature_b64":"2CtTnkVg4CT8R3WDee6YfAqTu7St94I3eKNPEEerro4QLgUo1+2vL+rQS3XFh9B+K0GjNMOvFcwKlawc8OSTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","last_reissued_at":"2026-05-18T03:19:44.800548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:44.800548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6419","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:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xr+8g9SyZ7vgKz3AlMavkTfPO/f2bmIq04l8xHOWGlWB4HgThZb3SHODg0K3xwbdC3PRRoLN3IFSji9Z6cVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:35:34.917949Z"},"content_sha256":"23540ac81a3cccdced73ac02dae9615906c2cc0deb3cdbf1785be0dc8acf5d18","schema_version":"1.0","event_id":"sha256:23540ac81a3cccdced73ac02dae9615906c2cc0deb3cdbf1785be0dc8acf5d18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LHIHPU533QHJ4UVAM23BLCY65K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of the Lasserre Hierarchy of SDP Relaxations for Convex Polynomial Programs without Compactness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, T. S. Pham, V. Jeyakumar","submitted_at":"2013-06-27T07:11:10Z","abstract_excerpt":"The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that, for convex polynomial optimization, the Lasserre hierarchy with a slightly extended quadratic module always converges asymptotically even in the face of non-compact semi-algebraic feasible sets. We do this by exploiting a coercivity property of convex polynomials that are bounded below. We further establish that the positive definiteness of the Hessian of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6419","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:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VojZAY3yjKvymN87kAVjj9ANeyVF23zB7Rflf8xZg11rEsDtAVQKrRS2Zvl9WBWvcjCsX3WozHzaBQScKcDtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:35:34.918299Z"},"content_sha256":"1ecfc1a383aaaf9c3eb00cfc1bed5d9feac7d66a7c2935a099e49e0fbf364884","schema_version":"1.0","event_id":"sha256:1ecfc1a383aaaf9c3eb00cfc1bed5d9feac7d66a7c2935a099e49e0fbf364884"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/bundle.json","state_url":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHIHPU533QHJ4UVAM23BLCY65K/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-25T20:35:34Z","links":{"resolver":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K","bundle":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/bundle.json","state":"https://pith.science/pith/LHIHPU533QHJ4UVAM23BLCY65K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHIHPU533QHJ4UVAM23BLCY65K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LHIHPU533QHJ4UVAM23BLCY65K","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":"b3591500f22359189a0043fa7bed8cb043f17033d16e37ed92e50e2450c718f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","title_canon_sha256":"96ff41c4a23df7c23e417df4b37c49e642534e770d77dfe65203c8c30ffcc76e"},"schema_version":"1.0","source":{"id":"1306.6419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6419","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6419v1","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6419","created_at":"2026-05-18T03:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"LHIHPU533QHJ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHIHPU533QHJ4UVA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHIHPU53","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:1ecfc1a383aaaf9c3eb00cfc1bed5d9feac7d66a7c2935a099e49e0fbf364884","target":"graph","created_at":"2026-05-18T03:19:44Z","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":"The Lasserre hierarchy of semidefinite programming (SDP) relaxations is an effective scheme for finding computationally feasible SDP approximations of polynomial optimization over compact semi-algebraic sets. In this paper, we show that, for convex polynomial optimization, the Lasserre hierarchy with a slightly extended quadratic module always converges asymptotically even in the face of non-compact semi-algebraic feasible sets. We do this by exploiting a coercivity property of convex polynomials that are bounded below. We further establish that the positive definiteness of the Hessian of the ","authors_text":"G. Li, T. S. Pham, V. Jeyakumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","title":"Convergence of the Lasserre Hierarchy of SDP Relaxations for Convex Polynomial Programs without Compactness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6419","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:23540ac81a3cccdced73ac02dae9615906c2cc0deb3cdbf1785be0dc8acf5d18","target":"record","created_at":"2026-05-18T03:19:44Z","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":"b3591500f22359189a0043fa7bed8cb043f17033d16e37ed92e50e2450c718f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-27T07:11:10Z","title_canon_sha256":"96ff41c4a23df7c23e417df4b37c49e642534e770d77dfe65203c8c30ffcc76e"},"schema_version":"1.0","source":{"id":"1306.6419","kind":"arxiv","version":1}},"canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59d077d3bbdc0e9e52a066b6158b1eea9c4a7f56b0439bb681dc735592e00478","first_computed_at":"2026-05-18T03:19:44.800548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:44.800548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2CtTnkVg4CT8R3WDee6YfAqTu7St94I3eKNPEEerro4QLgUo1+2vL+rQS3XFh9B+K0GjNMOvFcwKlawc8OSTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:44.801142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23540ac81a3cccdced73ac02dae9615906c2cc0deb3cdbf1785be0dc8acf5d18","sha256:1ecfc1a383aaaf9c3eb00cfc1bed5d9feac7d66a7c2935a099e49e0fbf364884"],"state_sha256":"f20f63b6075fa9541c9cae1884de7c254710930e440459451d9b831ec9a3ffc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVfYFmV60sLbirbUaCXfNRxWwgq7XjFKUG03kWQjUS0sf+NcWTGOBG9wuT/BaiG9fuE8txWm6myPX16VqaiuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:35:34.920328Z","bundle_sha256":"074d9830c550bd7ae1a587b7c2aecf000422c9566a776e5ee6dde24ec3ba0406"}}