{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5W5ZIR7S2UI6CLAR6QQTWBYNQY","short_pith_number":"pith:5W5ZIR7S","schema_version":"1.0","canonical_sha256":"edbb9447f2d511e12c11f4213b070d86065056513a2fdc2fdaf3f41141b91955","source":{"kind":"arxiv","id":"1501.06126","version":2},"attestation_state":"computed","paper":{"title":"A bounded degree SOS hierarchy for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (LAAS, LAAS-MAC), Toh Kim-Chuan, Yang Shouguang","submitted_at":"2015-01-25T08:07:34Z","abstract_excerpt":"We consider a  new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\\:f^{\\ast}=\\min \\{\\,f(x):x\\in K\\,\\}$ on a compact basic semi-algebraic set $K\\subset\\R^n$. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine's positivity certificate and some advantages of the standard SOS-hierarchy. In particular it has the following attractive features: (a) In contrast to the standard SOS-hierarchy, for each relaxation in the hierarchy, the size of the matrix associated with the semidefinite constraint is the same and fixe"},"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":"1501.06126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-25T08:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"11d5cbc814f5cd1293746ff82b2503dee3e53fb371e79b56f38a5314b0c31296","abstract_canon_sha256":"6d8e7868a73923de02f2dbcf399ee33e17ef4f5416213e1234efb2072bd0c840"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:49.130404Z","signature_b64":"pYMxUkRmR+PAICC/iVKgyOZQZgHpvzN/QQuKeV0s1kC3vyytm1KEYT94YR9d+83V0fog2G/tb1gWwpm3p4dSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edbb9447f2d511e12c11f4213b070d86065056513a2fdc2fdaf3f41141b91955","last_reissued_at":"2026-05-18T01:37:49.129872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:49.129872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bounded degree SOS hierarchy for polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (LAAS, LAAS-MAC), Toh Kim-Chuan, Yang Shouguang","submitted_at":"2015-01-25T08:07:34Z","abstract_excerpt":"We consider a  new hierarchy of semidefinite relaxations for the general polynomial optimization problem $(P):\\:f^{\\ast}=\\min \\{\\,f(x):x\\in K\\,\\}$ on a compact basic semi-algebraic set $K\\subset\\R^n$. This hierarchy combines some advantages of the standard LP-relaxations associated with Krivine's positivity certificate and some advantages of the standard SOS-hierarchy. In particular it has the following attractive features: (a) In contrast to the standard SOS-hierarchy, for each relaxation in the hierarchy, the size of the matrix associated with the semidefinite constraint is the same and fixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06126","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":"1501.06126","created_at":"2026-05-18T01:37:49.129963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06126v2","created_at":"2026-05-18T01:37:49.129963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06126","created_at":"2026-05-18T01:37:49.129963+00:00"},{"alias_kind":"pith_short_12","alias_value":"5W5ZIR7S2UI6","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5W5ZIR7S2UI6CLAR","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5W5ZIR7S","created_at":"2026-05-18T12:29:07.941421+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/5W5ZIR7S2UI6CLAR6QQTWBYNQY","json":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY.json","graph_json":"https://pith.science/api/pith-number/5W5ZIR7S2UI6CLAR6QQTWBYNQY/graph.json","events_json":"https://pith.science/api/pith-number/5W5ZIR7S2UI6CLAR6QQTWBYNQY/events.json","paper":"https://pith.science/paper/5W5ZIR7S"},"agent_actions":{"view_html":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY","download_json":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY.json","view_paper":"https://pith.science/paper/5W5ZIR7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06126&json=true","fetch_graph":"https://pith.science/api/pith-number/5W5ZIR7S2UI6CLAR6QQTWBYNQY/graph.json","fetch_events":"https://pith.science/api/pith-number/5W5ZIR7S2UI6CLAR6QQTWBYNQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY/action/storage_attestation","attest_author":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY/action/author_attestation","sign_citation":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY/action/citation_signature","submit_replication":"https://pith.science/pith/5W5ZIR7S2UI6CLAR6QQTWBYNQY/action/replication_record"}},"created_at":"2026-05-18T01:37:49.129963+00:00","updated_at":"2026-05-18T01:37:49.129963+00:00"}