{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I3AXG7JYJLWSCA3MQ67LA3PI45","short_pith_number":"pith:I3AXG7JY","schema_version":"1.0","canonical_sha256":"46c1737d384aed21036c87beb06de8e74c99798b6f3d8d86430129f3a9e6d3f9","source":{"kind":"arxiv","id":"1310.4716","version":2},"attestation_state":"computed","paper":{"title":"SOSTOOLS Version 4.00 Sum of Squares Optimization Toolbox for MATLAB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Antonis Papachristodoulou, Declan Jagt, Giorgio Valmorbida, James Anderson, Matthew M. Peet, Pablo Parrilo, Pete Seiler, Stephen Prajna","submitted_at":"2013-10-17T14:30:42Z","abstract_excerpt":"The release of SOSTOOLS v4.00 comes as we approach the 20th anniversary of the original release of SOSTOOLS v1.00 back in April, 2002. SOSTOOLS was originally envisioned as a flexible tool for parsing and solving polynomial optimization problems, using the SOS tightening of polynomial positivity constraints, and capable of adapting to the ever-evolving fauna of applications of SOS. There are now a variety of SOS programming parsers beyond SOSTOOLS, including YALMIP, Gloptipoly, SumOfSquares, and others. We hope SOSTOOLS remains the most intuitive, robust and adaptable toolbox for SOS programmi"},"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":"1310.4716","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-17T14:30:42Z","cross_cats_sorted":["cs.MS","cs.SY","eess.SY"],"title_canon_sha256":"fda9c90231e30df5e342011615bbe9d5c38bceb7900b10d60f72c5b0f5f8bb90","abstract_canon_sha256":"8c1b1b32989ac96d0b9bd7967ff22d5d1200016c998fe6899f72d0592d1790d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T14:09:14.037758Z","signature_b64":"0VGx+fiIKi/639CgeM4VYJSaMPJl9ep62r+8mq0rSn5pHlDx6Sdz4GEq73Rfu9vjG1Yb4Y43d0ZU8yRSxJa5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c1737d384aed21036c87beb06de8e74c99798b6f3d8d86430129f3a9e6d3f9","last_reissued_at":"2026-06-04T14:09:14.037231Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T14:09:14.037231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SOSTOOLS Version 4.00 Sum of Squares Optimization Toolbox for MATLAB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Antonis Papachristodoulou, Declan Jagt, Giorgio Valmorbida, James Anderson, Matthew M. Peet, Pablo Parrilo, Pete Seiler, Stephen Prajna","submitted_at":"2013-10-17T14:30:42Z","abstract_excerpt":"The release of SOSTOOLS v4.00 comes as we approach the 20th anniversary of the original release of SOSTOOLS v1.00 back in April, 2002. SOSTOOLS was originally envisioned as a flexible tool for parsing and solving polynomial optimization problems, using the SOS tightening of polynomial positivity constraints, and capable of adapting to the ever-evolving fauna of applications of SOS. There are now a variety of SOS programming parsers beyond SOSTOOLS, including YALMIP, Gloptipoly, SumOfSquares, and others. We hope SOSTOOLS remains the most intuitive, robust and adaptable toolbox for SOS programmi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1310.4716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1310.4716","created_at":"2026-06-04T14:09:14.037289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4716v2","created_at":"2026-06-04T14:09:14.037289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4716","created_at":"2026-06-04T14:09:14.037289+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3AXG7JYJLWS","created_at":"2026-06-04T14:09:14.037289+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3AXG7JYJLWSCA3M","created_at":"2026-06-04T14:09:14.037289+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3AXG7JY","created_at":"2026-06-04T14:09:14.037289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"2409.10018","citing_title":"Compositional Design of Safety Controllers for Large-Scale Stochastic Hybrid Systems","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13748","citing_title":"TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03407","citing_title":"Reach-Avoid Model Predictive Control with Guaranteed Recursive Feasibility via Input Constrained Backstepping","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06575","citing_title":"Polylab: A MATLAB Toolbox for Multivariate Polynomial Modeling","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45","json":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45.json","graph_json":"https://pith.science/api/pith-number/I3AXG7JYJLWSCA3MQ67LA3PI45/graph.json","events_json":"https://pith.science/api/pith-number/I3AXG7JYJLWSCA3MQ67LA3PI45/events.json","paper":"https://pith.science/paper/I3AXG7JY"},"agent_actions":{"view_html":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45","download_json":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45.json","view_paper":"https://pith.science/paper/I3AXG7JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4716&json=true","fetch_graph":"https://pith.science/api/pith-number/I3AXG7JYJLWSCA3MQ67LA3PI45/graph.json","fetch_events":"https://pith.science/api/pith-number/I3AXG7JYJLWSCA3MQ67LA3PI45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45/action/storage_attestation","attest_author":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45/action/author_attestation","sign_citation":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45/action/citation_signature","submit_replication":"https://pith.science/pith/I3AXG7JYJLWSCA3MQ67LA3PI45/action/replication_record"}},"created_at":"2026-06-04T14:09:14.037289+00:00","updated_at":"2026-06-04T14:09:14.037289+00:00"}