{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EDJGSKOJPRCAVKO7IM2RJEGLOQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be9597d8a30ed25d4fbe5243ad32b60b2fa4c9367696f655dc225037ba86a70e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T15:11:43Z","title_canon_sha256":"dab47253c1640caefb0e9c4bb4adbbc5c21c9a56bca3c3f67f0eeeb0cc0c2b5a"},"schema_version":"1.0","source":{"id":"1604.02031","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02031","created_at":"2026-05-18T00:13:08Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02031v3","created_at":"2026-05-18T00:13:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02031","created_at":"2026-05-18T00:13:08Z"},{"alias_kind":"pith_short_12","alias_value":"EDJGSKOJPRCA","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDJGSKOJPRCAVKO7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDJGSKOJ","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3a85b47dbf4dd4345322100e7f97b19e853ac4163905e491096f31c87b665daa","target":"graph","created_at":"2026-05-18T00:13:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alessio Benavoli, Dario Piga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T15:11:43Z","title":"A unified framework for deterministic and probabilistic D-stability analysis of uncertain polynomial matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02031","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:66401c4b62699b877535de4eca61a83b835c3a29be1a545e75d83af92fb50ecc","target":"record","created_at":"2026-05-18T00:13:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be9597d8a30ed25d4fbe5243ad32b60b2fa4c9367696f655dc225037ba86a70e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T15:11:43Z","title_canon_sha256":"dab47253c1640caefb0e9c4bb4adbbc5c21c9a56bca3c3f67f0eeeb0cc0c2b5a"},"schema_version":"1.0","source":{"id":"1604.02031","kind":"arxiv","version":3}},"canonical_sha256":"20d26929c97c440aa9df43351490cb7402f9c99656d211e65b7525c4fb7887b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d26929c97c440aa9df43351490cb7402f9c99656d211e65b7525c4fb7887b1","first_computed_at":"2026-05-18T00:13:08.096254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:08.096254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hY90V6BkoT0aHkvyyrtrbO64LxeKrUpGl8WMd3TmMCPv6+ikYhsFylMRbLCO8b0IgGhadFaFdTZ17egmXYIRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:08.097009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02031","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66401c4b62699b877535de4eca61a83b835c3a29be1a545e75d83af92fb50ecc","sha256:3a85b47dbf4dd4345322100e7f97b19e853ac4163905e491096f31c87b665daa"],"state_sha256":"fe869429f7fe9d0d482020b5a4a7ad6ed33867df524f19b5736d56b9e3b74a78"}