{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DANYG4SU62WHISB7WJW22WHEV2","short_pith_number":"pith:DANYG4SU","schema_version":"1.0","canonical_sha256":"181b837254f6ac74483fb26dad58e4ae91f47e9ba997a13fc341c194ed8c37e0","source":{"kind":"arxiv","id":"1710.01358","version":1},"attestation_state":"computed","paper":{"title":"Improving Efficiency and Scalability of Sum of Squares Optimization: Recent Advances and Limitations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir Ali Ahmadi, Antonis Papachristodoulou, Georgina Hall, James Saunderson, Yang Zheng","submitted_at":"2017-10-03T19:36:11Z","abstract_excerpt":"It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are large and costly to solve when the polynomials involved in the SOS programs have a large number of variables and degree. In this paper, we review SOS optimization techniques and present two new methods for improving their computational efficiency. The first method leverages the sparsity of the underlying SDP to obtain computational speed-ups. Further improveme"},"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":"1710.01358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-03T19:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"718fa193fa291c7c666cd91a6a8059228cf71f7b7fb93d2f57f685229668f3d5","abstract_canon_sha256":"6a95c38934cd55195cff3ea00dedfbc54af82cd6c970497b60a48b823c1412b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:43.016390Z","signature_b64":"Tmh2RtlAKT7jw58mofZU/53OmYXfsxwabjXSfkfcIKt2/1vJS0eO8yi2zvk6SaeWy3rLstKI3NUcllpdrh3yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181b837254f6ac74483fb26dad58e4ae91f47e9ba997a13fc341c194ed8c37e0","last_reissued_at":"2026-05-18T00:33:43.015554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:43.015554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Efficiency and Scalability of Sum of Squares Optimization: Recent Advances and Limitations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amir Ali Ahmadi, Antonis Papachristodoulou, Georgina Hall, James Saunderson, Yang Zheng","submitted_at":"2017-10-03T19:36:11Z","abstract_excerpt":"It is well-known that any sum of squares (SOS) program can be cast as a semidefinite program (SDP) of a particular structure and that therein lies the computational bottleneck for SOS programs, as the SDPs generated by this procedure are large and costly to solve when the polynomials involved in the SOS programs have a large number of variables and degree. In this paper, we review SOS optimization techniques and present two new methods for improving their computational efficiency. The first method leverages the sparsity of the underlying SDP to obtain computational speed-ups. Further improveme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01358","kind":"arxiv","version":1},"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":"1710.01358","created_at":"2026-05-18T00:33:43.015701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01358v1","created_at":"2026-05-18T00:33:43.015701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01358","created_at":"2026-05-18T00:33:43.015701+00:00"},{"alias_kind":"pith_short_12","alias_value":"DANYG4SU62WH","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DANYG4SU62WHISB7","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DANYG4SU","created_at":"2026-05-18T12:31:10.602751+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/DANYG4SU62WHISB7WJW22WHEV2","json":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2.json","graph_json":"https://pith.science/api/pith-number/DANYG4SU62WHISB7WJW22WHEV2/graph.json","events_json":"https://pith.science/api/pith-number/DANYG4SU62WHISB7WJW22WHEV2/events.json","paper":"https://pith.science/paper/DANYG4SU"},"agent_actions":{"view_html":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2","download_json":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2.json","view_paper":"https://pith.science/paper/DANYG4SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01358&json=true","fetch_graph":"https://pith.science/api/pith-number/DANYG4SU62WHISB7WJW22WHEV2/graph.json","fetch_events":"https://pith.science/api/pith-number/DANYG4SU62WHISB7WJW22WHEV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2/action/storage_attestation","attest_author":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2/action/author_attestation","sign_citation":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2/action/citation_signature","submit_replication":"https://pith.science/pith/DANYG4SU62WHISB7WJW22WHEV2/action/replication_record"}},"created_at":"2026-05-18T00:33:43.015701+00:00","updated_at":"2026-05-18T00:33:43.015701+00:00"}