{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SSP6BONAHFG5N6VSRPY7ZY3FGW","short_pith_number":"pith:SSP6BONA","schema_version":"1.0","canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","source":{"kind":"arxiv","id":"1510.06797","version":3},"attestation_state":"computed","paper":{"title":"Alternative SDP and SOCP Approximations for Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga, Xiaolong Kuang","submitted_at":"2015-10-23T01:31:30Z","abstract_excerpt":"In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to the computational challenge of solving SDPs, it becomes difficult to use SDP hierarchies for large-scale problems. To address this, hierarchies of second-order cone programming (SOCP) relaxations resulting from a restriction of the SOS polynomial condition have been recently proposed to approximate POPs. Here, we consider alternative ways to use this SOCP re"},"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":"1510.06797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-23T01:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"bfefa2c9e72e6defa3a1e89927ca9bf01b29b249cee82c335d74b2b454c070e9","abstract_canon_sha256":"af2cc48c0fdf93b7dc0e1a2e608491333f065bc810158dbf404c9829dff3cd56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:19.824364Z","signature_b64":"rBEBe8HoSxChnFLcTGDC/AmWOQjK0QUeCoiK0bn+zyBZ+TynhhYpV4YmKm/w1mpb2xFXcttsvVmmQo5ItNMFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"949fe0b9a0394dd6fab28bf1fce36535aa1da26067c39195c85aa0895a841476","last_reissued_at":"2026-05-17T23:57:19.823602Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:19.823602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternative SDP and SOCP Approximations for Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga, Xiaolong Kuang","submitted_at":"2015-10-23T01:31:30Z","abstract_excerpt":"In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to the computational challenge of solving SDPs, it becomes difficult to use SDP hierarchies for large-scale problems. To address this, hierarchies of second-order cone programming (SOCP) relaxations resulting from a restriction of the SOS polynomial condition have been recently proposed to approximate POPs. Here, we consider alternative ways to use this SOCP re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06797","kind":"arxiv","version":3},"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":"1510.06797","created_at":"2026-05-17T23:57:19.823716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06797v3","created_at":"2026-05-17T23:57:19.823716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06797","created_at":"2026-05-17T23:57:19.823716+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSP6BONAHFG5","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSP6BONAHFG5N6VS","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSP6BONA","created_at":"2026-05-18T12:29:42.218222+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/SSP6BONAHFG5N6VSRPY7ZY3FGW","json":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW.json","graph_json":"https://pith.science/api/pith-number/SSP6BONAHFG5N6VSRPY7ZY3FGW/graph.json","events_json":"https://pith.science/api/pith-number/SSP6BONAHFG5N6VSRPY7ZY3FGW/events.json","paper":"https://pith.science/paper/SSP6BONA"},"agent_actions":{"view_html":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW","download_json":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW.json","view_paper":"https://pith.science/paper/SSP6BONA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06797&json=true","fetch_graph":"https://pith.science/api/pith-number/SSP6BONAHFG5N6VSRPY7ZY3FGW/graph.json","fetch_events":"https://pith.science/api/pith-number/SSP6BONAHFG5N6VSRPY7ZY3FGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/action/storage_attestation","attest_author":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/action/author_attestation","sign_citation":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/action/citation_signature","submit_replication":"https://pith.science/pith/SSP6BONAHFG5N6VSRPY7ZY3FGW/action/replication_record"}},"created_at":"2026-05-17T23:57:19.823716+00:00","updated_at":"2026-05-17T23:57:19.823716+00:00"}