{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HOQL2627LLS7WM46IATX3544PJ","short_pith_number":"pith:HOQL2627","schema_version":"1.0","canonical_sha256":"3ba0bd7b5f5ae5fb339e40277df79c7a4ca77a4c77d332504ca31ed27edf35d2","source":{"kind":"arxiv","id":"1307.5386","version":2},"attestation_state":"computed","paper":{"title":"Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, J. Vicente-Perez, V. Jeyakumar","submitted_at":"2013-07-20T07:54:08Z","abstract_excerpt":"This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial programs in the face of data uncertainty. The class of convex programs, called robust SOS-convex programs, includes robust quadratically constrained convex programs and robust separable convex polynomial programs. It establishes sums of squares polynomial representations characterizing robust solutions and exact SDP-relaxations of robust SOS-convex programs under various commonly used uncertainty sets. In particular, the results show that the polytopic and ellipsoidal uncer"},"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":"1307.5386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-20T07:54:08Z","cross_cats_sorted":[],"title_canon_sha256":"20ca604c115ad35040d4cede4767543d19d64be9ed7a5d6bc6b3ba0c66af3e1e","abstract_canon_sha256":"e1ca467622d86db5408739729638ba54fb2f0f3e1cc401af160bb9cf7bfd515e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:23.717751Z","signature_b64":"NXMtYKwLhMgF+wybjhLC3PxTBSPLV75sjbrX8/ofduaLD3rwRyS7XU/3dmUh6AJySelLd3HxcNXlPKiN5fiCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ba0bd7b5f5ae5fb339e40277df79c7a4ca77a4c77d332504ca31ed27edf35d2","last_reissued_at":"2026-05-18T02:57:23.717122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:23.717122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust SOS-Convex Polynomial Programs: Exact SDP Relaxations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"G. Li, J. Vicente-Perez, V. Jeyakumar","submitted_at":"2013-07-20T07:54:08Z","abstract_excerpt":"This paper studies robust solutions and semidefinite linear programming (SDP) relaxations of a class of convex polynomial programs in the face of data uncertainty. The class of convex programs, called robust SOS-convex programs, includes robust quadratically constrained convex programs and robust separable convex polynomial programs. It establishes sums of squares polynomial representations characterizing robust solutions and exact SDP-relaxations of robust SOS-convex programs under various commonly used uncertainty sets. In particular, the results show that the polytopic and ellipsoidal uncer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5386","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":"1307.5386","created_at":"2026-05-18T02:57:23.717197+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5386v2","created_at":"2026-05-18T02:57:23.717197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5386","created_at":"2026-05-18T02:57:23.717197+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOQL2627LLS7","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOQL2627LLS7WM46","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOQL2627","created_at":"2026-05-18T12:27:46.883200+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/HOQL2627LLS7WM46IATX3544PJ","json":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ.json","graph_json":"https://pith.science/api/pith-number/HOQL2627LLS7WM46IATX3544PJ/graph.json","events_json":"https://pith.science/api/pith-number/HOQL2627LLS7WM46IATX3544PJ/events.json","paper":"https://pith.science/paper/HOQL2627"},"agent_actions":{"view_html":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ","download_json":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ.json","view_paper":"https://pith.science/paper/HOQL2627","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5386&json=true","fetch_graph":"https://pith.science/api/pith-number/HOQL2627LLS7WM46IATX3544PJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HOQL2627LLS7WM46IATX3544PJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ/action/storage_attestation","attest_author":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ/action/author_attestation","sign_citation":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ/action/citation_signature","submit_replication":"https://pith.science/pith/HOQL2627LLS7WM46IATX3544PJ/action/replication_record"}},"created_at":"2026-05-18T02:57:23.717197+00:00","updated_at":"2026-05-18T02:57:23.717197+00:00"}