{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WXSIMCFPHPJ2CXB3OTEBJOYYGU","short_pith_number":"pith:WXSIMCFP","schema_version":"1.0","canonical_sha256":"b5e48608af3bd3a15c3b74c814bb18351a39957aeb714f8bb79f109e1106dd1f","source":{"kind":"arxiv","id":"1703.00744","version":1},"attestation_state":"computed","paper":{"title":"Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent","submitted_at":"2017-03-02T12:10:28Z","abstract_excerpt":"Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing. We consider the problem of minimizing a continuous function $f$ over a compact set $\\mathbf{K}$. We compare the hierarchy of upper bounds proposed by Lasserre in [{\\em SIAM J. Optim.} $21(3)$ $(2011)$, pp. $864-885$] to bounds that may be obtained from simulated annealing.\n  We show that, when $f$ is a polynomial and $\\mathbf{K}$ a convex body, this comparison yields a faster rate of convergence of the Lasserre hierarchy than what was previously known in the literature."},"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":"1703.00744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-02T12:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"bdb082a4419eb846bd8ce0b7b65f439e827f76fc428087016005f40a1ca06d91","abstract_canon_sha256":"d26929010278b5b560fbba064ca97890fdda40ec00f4b652ac289ccbc5608ece"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:40.901933Z","signature_b64":"5v+U57jU7rhJpTqSmmQbJxeUNk6kt5sZgA7Xv+V6n76asqMdS5W680XsQtpvqlFUgYN5JEBV9qm3c8y+4qE3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e48608af3bd3a15c3b74c814bb18351a39957aeb714f8bb79f109e1106dd1f","last_reissued_at":"2026-05-18T00:49:40.901237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:40.901237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Etienne de Klerk, Monique Laurent","submitted_at":"2017-03-02T12:10:28Z","abstract_excerpt":"Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing. We consider the problem of minimizing a continuous function $f$ over a compact set $\\mathbf{K}$. We compare the hierarchy of upper bounds proposed by Lasserre in [{\\em SIAM J. Optim.} $21(3)$ $(2011)$, pp. $864-885$] to bounds that may be obtained from simulated annealing.\n  We show that, when $f$ is a polynomial and $\\mathbf{K}$ a convex body, this comparison yields a faster rate of convergence of the Lasserre hierarchy than what was previously known in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00744","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.00744","created_at":"2026-05-18T00:49:40.901360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00744v1","created_at":"2026-05-18T00:49:40.901360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00744","created_at":"2026-05-18T00:49:40.901360+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXSIMCFPHPJ2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXSIMCFPHPJ2CXB3","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXSIMCFP","created_at":"2026-05-18T12:31:53.515858+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/WXSIMCFPHPJ2CXB3OTEBJOYYGU","json":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU.json","graph_json":"https://pith.science/api/pith-number/WXSIMCFPHPJ2CXB3OTEBJOYYGU/graph.json","events_json":"https://pith.science/api/pith-number/WXSIMCFPHPJ2CXB3OTEBJOYYGU/events.json","paper":"https://pith.science/paper/WXSIMCFP"},"agent_actions":{"view_html":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU","download_json":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU.json","view_paper":"https://pith.science/paper/WXSIMCFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00744&json=true","fetch_graph":"https://pith.science/api/pith-number/WXSIMCFPHPJ2CXB3OTEBJOYYGU/graph.json","fetch_events":"https://pith.science/api/pith-number/WXSIMCFPHPJ2CXB3OTEBJOYYGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU/action/storage_attestation","attest_author":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU/action/author_attestation","sign_citation":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU/action/citation_signature","submit_replication":"https://pith.science/pith/WXSIMCFPHPJ2CXB3OTEBJOYYGU/action/replication_record"}},"created_at":"2026-05-18T00:49:40.901360+00:00","updated_at":"2026-05-18T00:49:40.901360+00:00"}