{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7I2JKVIPYOW5H3CZKCWEL6XF7B","short_pith_number":"pith:7I2JKVIP","schema_version":"1.0","canonical_sha256":"fa3495550fc3add3ec5950ac45fae5f86911ea9bedc966eb5d7b9e8404995594","source":{"kind":"arxiv","id":"1411.6867","version":4},"attestation_state":"computed","paper":{"title":"Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent, Zhao Sun","submitted_at":"2014-11-25T13:44:21Z","abstract_excerpt":"We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so that the expectation $\\int_{K}f(x)h(x)dx$ is minimized. We show that the rate of convergence is no worse than $O(1/\\sqrt{r})$, where 2r is the degree bound on the density function. This analysis applies to the case when f is Lipschitz continuous and K is a full-dimensional compact set sati"},"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":"1411.6867","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-25T13:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"52a8373a8c7ab5ded73faf7bb236bd326e946a16321a2334e811ad0d758e8f26","abstract_canon_sha256":"d3099542a50cd26813db9bd403c8bee8564d23c8923be796c1b332e0411419d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:48.997996Z","signature_b64":"E01tYyh0+ByHqpXuqtSfcbwfD17aZKGI31SnbdktJqXfmSj5xtr+74nJKqTUO1PQmfBbcNT6sbGTT7I+zOKDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3495550fc3add3ec5950ac45fae5f86911ea9bedc966eb5d7b9e8404995594","last_reissued_at":"2026-05-18T01:33:48.997480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:48.997480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent, Zhao Sun","submitted_at":"2014-11-25T13:44:21Z","abstract_excerpt":"We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so that the expectation $\\int_{K}f(x)h(x)dx$ is minimized. We show that the rate of convergence is no worse than $O(1/\\sqrt{r})$, where 2r is the degree bound on the density function. This analysis applies to the case when f is Lipschitz continuous and K is a full-dimensional compact set sati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6867","kind":"arxiv","version":4},"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":"1411.6867","created_at":"2026-05-18T01:33:48.997566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6867v4","created_at":"2026-05-18T01:33:48.997566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6867","created_at":"2026-05-18T01:33:48.997566+00:00"},{"alias_kind":"pith_short_12","alias_value":"7I2JKVIPYOW5","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7I2JKVIPYOW5H3CZ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7I2JKVIP","created_at":"2026-05-18T12:28:16.859392+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/7I2JKVIPYOW5H3CZKCWEL6XF7B","json":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B.json","graph_json":"https://pith.science/api/pith-number/7I2JKVIPYOW5H3CZKCWEL6XF7B/graph.json","events_json":"https://pith.science/api/pith-number/7I2JKVIPYOW5H3CZKCWEL6XF7B/events.json","paper":"https://pith.science/paper/7I2JKVIP"},"agent_actions":{"view_html":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B","download_json":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B.json","view_paper":"https://pith.science/paper/7I2JKVIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6867&json=true","fetch_graph":"https://pith.science/api/pith-number/7I2JKVIPYOW5H3CZKCWEL6XF7B/graph.json","fetch_events":"https://pith.science/api/pith-number/7I2JKVIPYOW5H3CZKCWEL6XF7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B/action/storage_attestation","attest_author":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B/action/author_attestation","sign_citation":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B/action/citation_signature","submit_replication":"https://pith.science/pith/7I2JKVIPYOW5H3CZKCWEL6XF7B/action/replication_record"}},"created_at":"2026-05-18T01:33:48.997566+00:00","updated_at":"2026-05-18T01:33:48.997566+00:00"}