{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EDJGSKOJPRCAVKO7IM2RJEGLOQ","short_pith_number":"pith:EDJGSKOJ","schema_version":"1.0","canonical_sha256":"20d26929c97c440aa9df43351490cb7402f9c99656d211e65b7525c4fb7887b1","source":{"kind":"arxiv","id":"1604.02031","version":3},"attestation_state":"computed","paper":{"title":"A unified framework for deterministic and probabilistic D-stability analysis of uncertain polynomial matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessio Benavoli, Dario Piga","submitted_at":"2016-04-07T15:11:43Z","abstract_excerpt":"Many problems in systems and control theory can be formulated in terms of robust D-stability analysis, which aims at verifying if all the eigenvalues of an uncertain matrix lie in a given region D of the complex plane. Robust D-stability analysis is an NP-hard problem and many polynomial-time algorithms providing either sufficient or necessary conditions for an uncertain matrix to be robustly D-stable have been developed in the past decades. Despite the vast literature on the subject, most of the contributions consider specific families of uncertain matrices, mainly with interval or polytopic "},"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":"1604.02031","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T15:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"dab47253c1640caefb0e9c4bb4adbbc5c21c9a56bca3c3f67f0eeeb0cc0c2b5a","abstract_canon_sha256":"be9597d8a30ed25d4fbe5243ad32b60b2fa4c9367696f655dc225037ba86a70e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:08.097009Z","signature_b64":"hY90V6BkoT0aHkvyyrtrbO64LxeKrUpGl8WMd3TmMCPv6+ikYhsFylMRbLCO8b0IgGhadFaFdTZ17egmXYIRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d26929c97c440aa9df43351490cb7402f9c99656d211e65b7525c4fb7887b1","last_reissued_at":"2026-05-18T00:13:08.096254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:08.096254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified framework for deterministic and probabilistic D-stability analysis of uncertain polynomial matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessio Benavoli, Dario Piga","submitted_at":"2016-04-07T15:11:43Z","abstract_excerpt":"Many problems in systems and control theory can be formulated in terms of robust D-stability analysis, which aims at verifying if all the eigenvalues of an uncertain matrix lie in a given region D of the complex plane. Robust D-stability analysis is an NP-hard problem and many polynomial-time algorithms providing either sufficient or necessary conditions for an uncertain matrix to be robustly D-stable have been developed in the past decades. Despite the vast literature on the subject, most of the contributions consider specific families of uncertain matrices, mainly with interval or polytopic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02031","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":""},"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":"1604.02031","created_at":"2026-05-18T00:13:08.096388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02031v3","created_at":"2026-05-18T00:13:08.096388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02031","created_at":"2026-05-18T00:13:08.096388+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDJGSKOJPRCA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDJGSKOJPRCAVKO7","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDJGSKOJ","created_at":"2026-05-18T12:30:12.583610+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/EDJGSKOJPRCAVKO7IM2RJEGLOQ","json":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ.json","graph_json":"https://pith.science/api/pith-number/EDJGSKOJPRCAVKO7IM2RJEGLOQ/graph.json","events_json":"https://pith.science/api/pith-number/EDJGSKOJPRCAVKO7IM2RJEGLOQ/events.json","paper":"https://pith.science/paper/EDJGSKOJ"},"agent_actions":{"view_html":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ","download_json":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ.json","view_paper":"https://pith.science/paper/EDJGSKOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02031&json=true","fetch_graph":"https://pith.science/api/pith-number/EDJGSKOJPRCAVKO7IM2RJEGLOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EDJGSKOJPRCAVKO7IM2RJEGLOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ/action/storage_attestation","attest_author":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ/action/author_attestation","sign_citation":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ/action/citation_signature","submit_replication":"https://pith.science/pith/EDJGSKOJPRCAVKO7IM2RJEGLOQ/action/replication_record"}},"created_at":"2026-05-18T00:13:08.096388+00:00","updated_at":"2026-05-18T00:13:08.096388+00:00"}