{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CS3YSJLJHNGIMQHRIOIDAPOY6V","short_pith_number":"pith:CS3YSJLJ","schema_version":"1.0","canonical_sha256":"14b78925693b4c8640f14390303dd8f55c81044a7460bc8ae4d7f88602c31e50","source":{"kind":"arxiv","id":"1308.1889","version":1},"attestation_state":"computed","paper":{"title":"SOSOPT: A Toolbox for Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Peter Seiler","submitted_at":"2013-08-08T16:08:31Z","abstract_excerpt":"SOSOPT is a Matlab toolbox for formulating and solving Sum-of-Squares (SOS) polynomial optimizations. This document briefly describes the use and functionality of this toolbox. Section 1 introduces the problem formulations for SOS tests, SOS feasibility problems, SOS optimizations, and generalized SOS problems. Section 2 reviews the SOSOPT toolbox for solving these optimizations. This section includes information on toolbox installation, formulating constraints, solving SOS optimizations, and setting optimization options. Finally, Section 3 briefly reviews the connections between SOS optimizat"},"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":"1308.1889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-08T16:08:31Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"20564455fb65bf84e6abad7a8d03e584bd2c41e8e432087d206cb7e9fb731504","abstract_canon_sha256":"a9f4b33d4d214291c6ab8f36dbdd219fc820957099c7decce146f14431e49c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:51.599182Z","signature_b64":"7COJND1wjOIQNsxyvHa6HbOOoS9o8KkzTIWX5BVaJM+nVpiXspXTWaB9bB7ht8UfAobwLPF2pDxh8+JbC+XTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14b78925693b4c8640f14390303dd8f55c81044a7460bc8ae4d7f88602c31e50","last_reissued_at":"2026-05-18T00:56:51.598713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:51.598713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOSOPT: A Toolbox for Polynomial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Peter Seiler","submitted_at":"2013-08-08T16:08:31Z","abstract_excerpt":"SOSOPT is a Matlab toolbox for formulating and solving Sum-of-Squares (SOS) polynomial optimizations. This document briefly describes the use and functionality of this toolbox. Section 1 introduces the problem formulations for SOS tests, SOS feasibility problems, SOS optimizations, and generalized SOS problems. Section 2 reviews the SOSOPT toolbox for solving these optimizations. This section includes information on toolbox installation, formulating constraints, solving SOS optimizations, and setting optimization options. Finally, Section 3 briefly reviews the connections between SOS optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1889","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":"1308.1889","created_at":"2026-05-18T00:56:51.598787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1889v1","created_at":"2026-05-18T00:56:51.598787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1889","created_at":"2026-05-18T00:56:51.598787+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS3YSJLJHNGI","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS3YSJLJHNGIMQHR","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS3YSJLJ","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03225","citing_title":"Backward Reachability for Polynomial Systems on A Finite Horizon","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V","json":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V.json","graph_json":"https://pith.science/api/pith-number/CS3YSJLJHNGIMQHRIOIDAPOY6V/graph.json","events_json":"https://pith.science/api/pith-number/CS3YSJLJHNGIMQHRIOIDAPOY6V/events.json","paper":"https://pith.science/paper/CS3YSJLJ"},"agent_actions":{"view_html":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V","download_json":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V.json","view_paper":"https://pith.science/paper/CS3YSJLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1889&json=true","fetch_graph":"https://pith.science/api/pith-number/CS3YSJLJHNGIMQHRIOIDAPOY6V/graph.json","fetch_events":"https://pith.science/api/pith-number/CS3YSJLJHNGIMQHRIOIDAPOY6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V/action/storage_attestation","attest_author":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V/action/author_attestation","sign_citation":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V/action/citation_signature","submit_replication":"https://pith.science/pith/CS3YSJLJHNGIMQHRIOIDAPOY6V/action/replication_record"}},"created_at":"2026-05-18T00:56:51.598787+00:00","updated_at":"2026-05-18T00:56:51.598787+00:00"}