{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JY2O3FQOWVTJDSI7NFBHDZ4DDU","short_pith_number":"pith:JY2O3FQO","schema_version":"1.0","canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","source":{"kind":"arxiv","id":"2505.18580","version":4},"attestation_state":"computed","paper":{"title":"Convergence rates for polynomial optimization on set products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Victor Magron","submitted_at":"2025-05-24T08:09:17Z","abstract_excerpt":"We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schm\\\"udgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schm\\\"udgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proo"},"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":"2505.18580","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-24T08:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"a655543d7616f4e801e8ef5cc9c1715b7aa42d77609929257dfb4c9255182b7a","abstract_canon_sha256":"09aaeb50cb49720d43706fec8cc16b22c93012e8fa34f638182dfa0a3858339d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:26.957731Z","signature_b64":"EeALF/jvomqY80XTjS2yiJYOQeNjpPR4obgha0cYQdiZfocYvII5O7L6uLU+a8Bd9tzrrjK62p0RbEtymuu0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e34ed960eb56691c91f694271e7831d3c4d83c5cd53aeef65d3b909735e983a","last_reissued_at":"2026-06-05T01:14:26.957147Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:26.957147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convergence rates for polynomial optimization on set products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Victor Magron","submitted_at":"2025-05-24T08:09:17Z","abstract_excerpt":"We consider polynomial optimization problems on Cartesian products of basic compact semialgebraic sets. The solution of such problems can be approximated as closely as desired by hierarchies of semidefinite programming relaxations, based on classical sums of squares certificates due to Putinar and Schm\\\"udgen. When the feasible set is the bi-sphere, i.e., the Cartesian product of two unit spheres, we show that the hierarchies based on the Schm\\\"udgen-type certificates converge to the global minimum of the objective polynomial at a rate in $O(1/t^2)$, where $t$ is the relaxation order. Our proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18580","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.18580/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.18580","created_at":"2026-06-05T01:14:26.957218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18580v4","created_at":"2026-06-05T01:14:26.957218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18580","created_at":"2026-06-05T01:14:26.957218+00:00"},{"alias_kind":"pith_short_12","alias_value":"JY2O3FQOWVTJ","created_at":"2026-06-05T01:14:26.957218+00:00"},{"alias_kind":"pith_short_16","alias_value":"JY2O3FQOWVTJDSI7","created_at":"2026-06-05T01:14:26.957218+00:00"},{"alias_kind":"pith_short_8","alias_value":"JY2O3FQO","created_at":"2026-06-05T01:14:26.957218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.15821","citing_title":"Degree Bounds for Positivstellens\\\"atze of general semialgebraic sets","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15821","citing_title":"Degree Bounds for Positivstellens\\\"atze of general semialgebraic sets","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU","json":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU.json","graph_json":"https://pith.science/api/pith-number/JY2O3FQOWVTJDSI7NFBHDZ4DDU/graph.json","events_json":"https://pith.science/api/pith-number/JY2O3FQOWVTJDSI7NFBHDZ4DDU/events.json","paper":"https://pith.science/paper/JY2O3FQO"},"agent_actions":{"view_html":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU","download_json":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU.json","view_paper":"https://pith.science/paper/JY2O3FQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18580&json=true","fetch_graph":"https://pith.science/api/pith-number/JY2O3FQOWVTJDSI7NFBHDZ4DDU/graph.json","fetch_events":"https://pith.science/api/pith-number/JY2O3FQOWVTJDSI7NFBHDZ4DDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/action/storage_attestation","attest_author":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/action/author_attestation","sign_citation":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/action/citation_signature","submit_replication":"https://pith.science/pith/JY2O3FQOWVTJDSI7NFBHDZ4DDU/action/replication_record"}},"created_at":"2026-06-05T01:14:26.957218+00:00","updated_at":"2026-06-05T01:14:26.957218+00:00"}