{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:L2YT7VTDBJT3CKJFCFPLRISEZN","short_pith_number":"pith:L2YT7VTD","schema_version":"1.0","canonical_sha256":"5eb13fd6630a67b12925115eb8a244cb5ba398995ea43ca00c2da924b9c3dda5","source":{"kind":"arxiv","id":"1603.03329","version":2},"attestation_state":"computed","paper":{"title":"Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained 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, Roxana Hess","submitted_at":"2016-03-10T16:56:42Z","abstract_excerpt":"We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given degree $r$) that minimizes the expectation $\\int_{[-1,1]^n} f(x)h(x)d\\mu(x)$, where $d\\mu(x)$ is a fixed, finite Borel measure supported on $[-1,1]^n$. It is known that, for the Lebesgue measure $d\\mu(x) = dx$, one may show an error bound $O(1/\\sqrt{r})$ if $h$ is a sum-of-squares density, and an $O(1/r)$ error bound if $h$ is the density of a beta distribution. "},"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":"1603.03329","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-10T16:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"1295e41868104d222a50b78f02e76afb8185c6f16c2ce8d2d4be2809af69bed4","abstract_canon_sha256":"cbd0e1aefba0c9bb402b9bba05f5e5abdf9e225f3de830fd4eca47aba84cccbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:13.082620Z","signature_b64":"EGn02e0mbrfZNzEkVRVB2T+MraWNvyxrD7bWxMrbVEGdXhHYUPI3ZPHbZHD3YCx+6y1p9Kplk3UBjg2+Xg4fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eb13fd6630a67b12925115eb8a244cb5ba398995ea43ca00c2da924b9c3dda5","last_reissued_at":"2026-05-18T00:41:13.081894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:13.081894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained 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, Roxana Hess","submitted_at":"2016-03-10T16:56:42Z","abstract_excerpt":"We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given degree $r$) that minimizes the expectation $\\int_{[-1,1]^n} f(x)h(x)d\\mu(x)$, where $d\\mu(x)$ is a fixed, finite Borel measure supported on $[-1,1]^n$. It is known that, for the Lebesgue measure $d\\mu(x) = dx$, one may show an error bound $O(1/\\sqrt{r})$ if $h$ is a sum-of-squares density, and an $O(1/r)$ error bound if $h$ is the density of a beta distribution. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03329","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.03329","created_at":"2026-05-18T00:41:13.082012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03329v2","created_at":"2026-05-18T00:41:13.082012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03329","created_at":"2026-05-18T00:41:13.082012+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2YT7VTDBJT3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2YT7VTDBJT3CKJF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2YT7VTD","created_at":"2026-05-18T12:30:29.479603+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/L2YT7VTDBJT3CKJFCFPLRISEZN","json":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN.json","graph_json":"https://pith.science/api/pith-number/L2YT7VTDBJT3CKJFCFPLRISEZN/graph.json","events_json":"https://pith.science/api/pith-number/L2YT7VTDBJT3CKJFCFPLRISEZN/events.json","paper":"https://pith.science/paper/L2YT7VTD"},"agent_actions":{"view_html":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN","download_json":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN.json","view_paper":"https://pith.science/paper/L2YT7VTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03329&json=true","fetch_graph":"https://pith.science/api/pith-number/L2YT7VTDBJT3CKJFCFPLRISEZN/graph.json","fetch_events":"https://pith.science/api/pith-number/L2YT7VTDBJT3CKJFCFPLRISEZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN/action/storage_attestation","attest_author":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN/action/author_attestation","sign_citation":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN/action/citation_signature","submit_replication":"https://pith.science/pith/L2YT7VTDBJT3CKJFCFPLRISEZN/action/replication_record"}},"created_at":"2026-05-18T00:41:13.082012+00:00","updated_at":"2026-05-18T00:41:13.082012+00:00"}