{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:TM2QHSQVONZUCOX4B3LMCS2LLA","short_pith_number":"pith:TM2QHSQV","schema_version":"1.0","canonical_sha256":"9b3503ca157373413afc0ed6c14b4b582967346a2e365cd9270d6b30148e57a1","source":{"kind":"arxiv","id":"0908.0364","version":2},"attestation_state":"computed","paper":{"title":"Polynomial Matrix Inequality and Semidefinite Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie","submitted_at":"2009-08-03T23:06:39Z","abstract_excerpt":"Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a higher dimensional set which is defined by a linear matrix inequality (LMI). This paper studies sufficient conditions guaranteeing semidefinite representability of S. We prove that S is semidefinite representable in the following cases: (i) the domain is the whole space and the matrix polynomial is matrix sos-concave; (ii) the domain is compact convex and th"},"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":"0908.0364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-08-03T23:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"0d96b1392fc917e3590e02e804af77806895638ebcdae884b6393edcfacedbc3","abstract_canon_sha256":"5699bf92477d9c33aad891cadb0c8472acda4936902cf8f9aff0b5b8523de76a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.952541Z","signature_b64":"7SevMc7T7NkhmEirsL1LFXw1rC/FnKdQqkTQb+8Bas1K82yPWGevxDuYkgNYxsfN3cmKi9ElhvWopXvvDhCjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3503ca157373413afc0ed6c14b4b582967346a2e365cd9270d6b30148e57a1","last_reissued_at":"2026-05-18T04:25:37.952085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.952085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Matrix Inequality and Semidefinite Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiawang Nie","submitted_at":"2009-08-03T23:06:39Z","abstract_excerpt":"Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a higher dimensional set which is defined by a linear matrix inequality (LMI). This paper studies sufficient conditions guaranteeing semidefinite representability of S. We prove that S is semidefinite representable in the following cases: (i) the domain is the whole space and the matrix polynomial is matrix sos-concave; (ii) the domain is compact convex and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0364","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":"0908.0364","created_at":"2026-05-18T04:25:37.952155+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.0364v2","created_at":"2026-05-18T04:25:37.952155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0364","created_at":"2026-05-18T04:25:37.952155+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM2QHSQVONZU","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM2QHSQVONZUCOX4","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM2QHSQV","created_at":"2026-05-18T12:26:01.383474+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/TM2QHSQVONZUCOX4B3LMCS2LLA","json":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA.json","graph_json":"https://pith.science/api/pith-number/TM2QHSQVONZUCOX4B3LMCS2LLA/graph.json","events_json":"https://pith.science/api/pith-number/TM2QHSQVONZUCOX4B3LMCS2LLA/events.json","paper":"https://pith.science/paper/TM2QHSQV"},"agent_actions":{"view_html":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA","download_json":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA.json","view_paper":"https://pith.science/paper/TM2QHSQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.0364&json=true","fetch_graph":"https://pith.science/api/pith-number/TM2QHSQVONZUCOX4B3LMCS2LLA/graph.json","fetch_events":"https://pith.science/api/pith-number/TM2QHSQVONZUCOX4B3LMCS2LLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA/action/storage_attestation","attest_author":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA/action/author_attestation","sign_citation":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA/action/citation_signature","submit_replication":"https://pith.science/pith/TM2QHSQVONZUCOX4B3LMCS2LLA/action/replication_record"}},"created_at":"2026-05-18T04:25:37.952155+00:00","updated_at":"2026-05-18T04:25:37.952155+00:00"}