{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UKUSNKLQ5Z52IBC56DXABA66FZ","short_pith_number":"pith:UKUSNKLQ","schema_version":"1.0","canonical_sha256":"a2a926a970ee7ba4045df0ee0083de2e7c3f0fa9c94444c6b038bfa9522a18d7","source":{"kind":"arxiv","id":"1106.2384","version":2},"attestation_state":"computed","paper":{"title":"Certifying Convergence of Lasserre's Hierarchy via Flat Truncation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie","submitted_at":"2011-06-13T05:51:29Z","abstract_excerpt":"This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume the set of global minimizers is nonempty and finite. Our main results are: i) Putinar type Lasserre's hierarchy has finite convergence if and only if flat truncation holds, under some general assumptions, and this is also true for the Schmudgen type one; ii) under the archimedean condition, flat truncation is asymptotically satisfied for Putinar type Lasser"},"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":"1106.2384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-06-13T05:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"71a520cde0ddeb971fa07dbb2b87467fcd20c730debee82ef69830087219ac1d","abstract_canon_sha256":"96ffc1ca100ffb0d7158cec1bd9b07612d4fcaa151acfa8b8703e31839d2285a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:19.980453Z","signature_b64":"cEI/Hv2q5YFYGWqwRcT9uS68t4DH4PuecWzEgSKw54h7lNz4rzewn+vJHSiTpWnb6q+g+a+MOxszIQvLhRN6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2a926a970ee7ba4045df0ee0083de2e7c3f0fa9c94444c6b038bfa9522a18d7","last_reissued_at":"2026-05-18T03:49:19.979273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:19.979273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certifying Convergence of Lasserre's Hierarchy via Flat Truncation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie","submitted_at":"2011-06-13T05:51:29Z","abstract_excerpt":"This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume the set of global minimizers is nonempty and finite. Our main results are: i) Putinar type Lasserre's hierarchy has finite convergence if and only if flat truncation holds, under some general assumptions, and this is also true for the Schmudgen type one; ii) under the archimedean condition, flat truncation is asymptotically satisfied for Putinar type Lasser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2384","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":"1106.2384","created_at":"2026-05-18T03:49:19.979438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2384v2","created_at":"2026-05-18T03:49:19.979438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2384","created_at":"2026-05-18T03:49:19.979438+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKUSNKLQ5Z52","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKUSNKLQ5Z52IBC5","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKUSNKLQ","created_at":"2026-05-18T12:26:42.757692+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/UKUSNKLQ5Z52IBC56DXABA66FZ","json":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ.json","graph_json":"https://pith.science/api/pith-number/UKUSNKLQ5Z52IBC56DXABA66FZ/graph.json","events_json":"https://pith.science/api/pith-number/UKUSNKLQ5Z52IBC56DXABA66FZ/events.json","paper":"https://pith.science/paper/UKUSNKLQ"},"agent_actions":{"view_html":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ","download_json":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ.json","view_paper":"https://pith.science/paper/UKUSNKLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2384&json=true","fetch_graph":"https://pith.science/api/pith-number/UKUSNKLQ5Z52IBC56DXABA66FZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UKUSNKLQ5Z52IBC56DXABA66FZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ/action/storage_attestation","attest_author":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ/action/author_attestation","sign_citation":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ/action/citation_signature","submit_replication":"https://pith.science/pith/UKUSNKLQ5Z52IBC56DXABA66FZ/action/replication_record"}},"created_at":"2026-05-18T03:49:19.979438+00:00","updated_at":"2026-05-18T03:49:19.979438+00:00"}