{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7KOY2NNJL7LODNIMSIXKN4ZVFQ","short_pith_number":"pith:7KOY2NNJ","schema_version":"1.0","canonical_sha256":"fa9d8d35a95fd6e1b50c922ea6f3352c26e3df5a3eb0e8c785299c4cea30ccb1","source":{"kind":"arxiv","id":"1112.5052","version":1},"attestation_state":"computed","paper":{"title":"A method to rigorously enclose eigendecompositions of interval matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.SP"],"primary_cat":"math.DS","authors_text":"Jean-Philippe Lessard, Roberto Castelli","submitted_at":"2011-12-21T15:15:14Z","abstract_excerpt":"In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(\\lambda,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument. The set-up of the method relies on the notion of radii polynomials, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable."},"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":"1112.5052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-12-21T15:15:14Z","cross_cats_sorted":["math.NA","math.SP"],"title_canon_sha256":"acb034ffec2f21d5d14fa99133ce2a91c728c2314da63b4813f9dda656ff0c9e","abstract_canon_sha256":"8f526d01e478e49bdd2e1592b79bca5d9126af05c60831738cb57c251c3d3855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:47.192278Z","signature_b64":"pS10jE5fRc2fC9tzmPim+/9+Y1i+PzB3P/Z+YbQQsVPbzjs5F2WVNC1xR+b3kcPcaUlRgbt/CZvUSq1+UswZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9d8d35a95fd6e1b50c922ea6f3352c26e3df5a3eb0e8c785299c4cea30ccb1","last_reissued_at":"2026-05-18T03:51:47.191781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:47.191781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A method to rigorously enclose eigendecompositions of interval matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.SP"],"primary_cat":"math.DS","authors_text":"Jean-Philippe Lessard, Roberto Castelli","submitted_at":"2011-12-21T15:15:14Z","abstract_excerpt":"In this paper, a rigorous computational method to enclose eigendecompositions of complex interval matrices is proposed. Each eigenpair $x=(\\lambda,v)$ is found by solving a nonlinear equation of the form $f(x)=0$ via a contraction argument. The set-up of the method relies on the notion of radii polynomials, which provide an efficient mean of determining a domain on which the contraction mapping theorem is applicable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5052","kind":"arxiv","version":1},"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":"1112.5052","created_at":"2026-05-18T03:51:47.191846+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5052v1","created_at":"2026-05-18T03:51:47.191846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5052","created_at":"2026-05-18T03:51:47.191846+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KOY2NNJL7LO","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KOY2NNJL7LODNIM","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KOY2NNJ","created_at":"2026-05-18T12:26:22.705136+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/7KOY2NNJL7LODNIMSIXKN4ZVFQ","json":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ.json","graph_json":"https://pith.science/api/pith-number/7KOY2NNJL7LODNIMSIXKN4ZVFQ/graph.json","events_json":"https://pith.science/api/pith-number/7KOY2NNJL7LODNIMSIXKN4ZVFQ/events.json","paper":"https://pith.science/paper/7KOY2NNJ"},"agent_actions":{"view_html":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ","download_json":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ.json","view_paper":"https://pith.science/paper/7KOY2NNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5052&json=true","fetch_graph":"https://pith.science/api/pith-number/7KOY2NNJL7LODNIMSIXKN4ZVFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7KOY2NNJL7LODNIMSIXKN4ZVFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ/action/storage_attestation","attest_author":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ/action/author_attestation","sign_citation":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ/action/citation_signature","submit_replication":"https://pith.science/pith/7KOY2NNJL7LODNIMSIXKN4ZVFQ/action/replication_record"}},"created_at":"2026-05-18T03:51:47.191846+00:00","updated_at":"2026-05-18T03:51:47.191846+00:00"}