{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L3UTBITWXAUREAWS2TQEKBA5YX","short_pith_number":"pith:L3UTBITW","schema_version":"1.0","canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","source":{"kind":"arxiv","id":"1304.0065","version":2},"attestation_state":"computed","paper":{"title":"A Perturbed Sums of Squares Theorem for Polynomial Optimization and its Applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hayato Waki, Levent Tuncel, Masakazu Muramatsu","submitted_at":"2013-03-30T03:59:23Z","abstract_excerpt":"We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming (SDP) relaxation with sufficiently large relaxation order is bounded from below by $(f^\\ast - \\epsilon)$ and from above by $f^\\ast + \\epsilon (n+1)$, where $f^\\ast$ is the optimal value of the POP. We propose new SDP relaxations for POP based on modifications of existing sums-of-squares representation theorems. An advantage of our SDP relaxations is that in ma"},"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":"1304.0065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.OC","submitted_at":"2013-03-30T03:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"0d1bd4c8d0ece2e232e27600fbeeae10bf1d172a726e2091ab51d71aebeb584f","abstract_canon_sha256":"4f21a154274f14ad7bc2891efe01d0d8540426613d239420c20363a25f7a4a0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.603700Z","signature_b64":"dE7Okg8XQTtklzsErTOOfjmY6Jn01pEkAI8n3c0uvTADOgqfwQ5OC5j+zaZgLlYmcdmKmegyPL08pbaenc8wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee930a276b8291202d2d4e045041dc5c959769ac51c1cb6cd0f82e71cd73532","last_reissued_at":"2026-05-18T01:14:53.603157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.603157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Perturbed Sums of Squares Theorem for Polynomial Optimization and its Applications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hayato Waki, Levent Tuncel, Masakazu Muramatsu","submitted_at":"2013-03-30T03:59:23Z","abstract_excerpt":"We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming (SDP) relaxation with sufficiently large relaxation order is bounded from below by $(f^\\ast - \\epsilon)$ and from above by $f^\\ast + \\epsilon (n+1)$, where $f^\\ast$ is the optimal value of the POP. We propose new SDP relaxations for POP based on modifications of existing sums-of-squares representation theorems. An advantage of our SDP relaxations is that in ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0065","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":"1304.0065","created_at":"2026-05-18T01:14:53.603254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.0065v2","created_at":"2026-05-18T01:14:53.603254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0065","created_at":"2026-05-18T01:14:53.603254+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3UTBITWXAUR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3UTBITWXAUREAWS","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3UTBITW","created_at":"2026-05-18T12:27:51.066281+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/L3UTBITWXAUREAWS2TQEKBA5YX","json":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX.json","graph_json":"https://pith.science/api/pith-number/L3UTBITWXAUREAWS2TQEKBA5YX/graph.json","events_json":"https://pith.science/api/pith-number/L3UTBITWXAUREAWS2TQEKBA5YX/events.json","paper":"https://pith.science/paper/L3UTBITW"},"agent_actions":{"view_html":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX","download_json":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX.json","view_paper":"https://pith.science/paper/L3UTBITW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.0065&json=true","fetch_graph":"https://pith.science/api/pith-number/L3UTBITWXAUREAWS2TQEKBA5YX/graph.json","fetch_events":"https://pith.science/api/pith-number/L3UTBITWXAUREAWS2TQEKBA5YX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/action/storage_attestation","attest_author":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/action/author_attestation","sign_citation":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/action/citation_signature","submit_replication":"https://pith.science/pith/L3UTBITWXAUREAWS2TQEKBA5YX/action/replication_record"}},"created_at":"2026-05-18T01:14:53.603254+00:00","updated_at":"2026-05-18T01:14:53.603254+00:00"}