{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XVXSLRSI7CQMREQ5CC7WIBEIUZ","short_pith_number":"pith:XVXSLRSI","schema_version":"1.0","canonical_sha256":"bd6f25c648f8a0c8921d10bf640488a664138af130c44853545c0b27cc124579","source":{"kind":"arxiv","id":"2411.15479","version":3},"attestation_state":"computed","paper":{"title":"Sparse Polynomial Matrix Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Feng Guo, Jared Miller, Jie Wang","submitted_at":"2024-11-23T07:23:17Z","abstract_excerpt":"A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of polynomial matrix inequalities. This work explores the use of sparsity methods in reducing the complexity of sum-of-squares based methods in verifying polynomial matrix inequalities or solving polynomial matrix optimization. In the unconstrained setting, Newton polytopes can be employed to sparsify the monomial basis, resulting in smaller semidefinite programs. I"},"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":"2411.15479","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-23T07:23:17Z","cross_cats_sorted":[],"title_canon_sha256":"00448d1426e11b6a70cb1a54d839effa0bb4f206160fdf1a4d0ec4edf03c553d","abstract_canon_sha256":"5b68080f4004401cb084eeace62eb7c4fd0ef69af85ac10aea7307dfa01b8df2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:30.705887Z","signature_b64":"oU6hYzYmXY+CzBAFHBc8e0WmFMCMJaU/hIG9pwITxQOEsEZ4mpUMpOd1XI4EXzcLNNO+sBlwu6stEK2A/1l8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd6f25c648f8a0c8921d10bf640488a664138af130c44853545c0b27cc124579","last_reissued_at":"2026-07-05T11:16:30.705327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:30.705327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Polynomial Matrix Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Feng Guo, Jared Miller, Jie Wang","submitted_at":"2024-11-23T07:23:17Z","abstract_excerpt":"A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of polynomial matrix inequalities. This work explores the use of sparsity methods in reducing the complexity of sum-of-squares based methods in verifying polynomial matrix inequalities or solving polynomial matrix optimization. In the unconstrained setting, Newton polytopes can be employed to sparsify the monomial basis, resulting in smaller semidefinite programs. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15479","kind":"arxiv","version":3},"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/2411.15479/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":"2411.15479","created_at":"2026-07-05T11:16:30.705392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15479v3","created_at":"2026-07-05T11:16:30.705392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15479","created_at":"2026-07-05T11:16:30.705392+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVXSLRSI7CQM","created_at":"2026-07-05T11:16:30.705392+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVXSLRSI7CQMREQ5","created_at":"2026-07-05T11:16:30.705392+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVXSLRSI","created_at":"2026-07-05T11:16:30.705392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.02849","citing_title":"Moment-SOS hierarchies for arrow-type polynomial matrix inequalities with applications to structural optimization","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ","json":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ.json","graph_json":"https://pith.science/api/pith-number/XVXSLRSI7CQMREQ5CC7WIBEIUZ/graph.json","events_json":"https://pith.science/api/pith-number/XVXSLRSI7CQMREQ5CC7WIBEIUZ/events.json","paper":"https://pith.science/paper/XVXSLRSI"},"agent_actions":{"view_html":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ","download_json":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ.json","view_paper":"https://pith.science/paper/XVXSLRSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15479&json=true","fetch_graph":"https://pith.science/api/pith-number/XVXSLRSI7CQMREQ5CC7WIBEIUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/XVXSLRSI7CQMREQ5CC7WIBEIUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ/action/storage_attestation","attest_author":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ/action/author_attestation","sign_citation":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ/action/citation_signature","submit_replication":"https://pith.science/pith/XVXSLRSI7CQMREQ5CC7WIBEIUZ/action/replication_record"}},"created_at":"2026-07-05T11:16:30.705392+00:00","updated_at":"2026-07-05T11:16:30.705392+00:00"}