{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FSN32OESE7QWAZ6FP4EQILUSAW","short_pith_number":"pith:FSN32OES","schema_version":"1.0","canonical_sha256":"2c9bbd389227e16067c57f09042e92059cc336a2a42435a87632173f6a28583e","source":{"kind":"arxiv","id":"1211.0535","version":1},"attestation_state":"computed","paper":{"title":"The calculation of the distance to a nearby defective matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alastair Spence, Melina A. Freitag","submitted_at":"2012-11-02T19:55:11Z","abstract_excerpt":"In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to finding when a parameter-dependent matrix is singular subject to a constraint. The solution is achieved by an extension of the Implicit Determinant Method introduced by Spence & Poulton (J. Comput. Phys., 204 (2005), pp.~65--81). Numerical results for several examples illustrate the performance of the algorithm."},"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":"1211.0535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-11-02T19:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"212ddee17f2c7d81d0d3e9fe8db46a95d49ab21add52377579ac4c4c2dc2a7a3","abstract_canon_sha256":"a8e8e64ccba1d1ae6d62866cea0ab7ab92b8d63995a7d0ebf916307b240945f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:40.680134Z","signature_b64":"EVzTzgG9cGT7nKYiPuNgOjtu/n35d4ZKzbgvbZJb8OGQgRmKpq4NI42FZ61EqpdnCxZkEGi+CxnPGWqOQsyMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c9bbd389227e16067c57f09042e92059cc336a2a42435a87632173f6a28583e","last_reissued_at":"2026-05-18T03:41:40.679383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:40.679383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The calculation of the distance to a nearby defective matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alastair Spence, Melina A. Freitag","submitted_at":"2012-11-02T19:55:11Z","abstract_excerpt":"In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to finding when a parameter-dependent matrix is singular subject to a constraint. The solution is achieved by an extension of the Implicit Determinant Method introduced by Spence & Poulton (J. Comput. Phys., 204 (2005), pp.~65--81). Numerical results for several examples illustrate the performance of the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0535","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":"1211.0535","created_at":"2026-05-18T03:41:40.679524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0535v1","created_at":"2026-05-18T03:41:40.679524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0535","created_at":"2026-05-18T03:41:40.679524+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSN32OESE7QW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSN32OESE7QWAZ6F","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSN32OES","created_at":"2026-05-18T12:27:06.952714+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/FSN32OESE7QWAZ6FP4EQILUSAW","json":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW.json","graph_json":"https://pith.science/api/pith-number/FSN32OESE7QWAZ6FP4EQILUSAW/graph.json","events_json":"https://pith.science/api/pith-number/FSN32OESE7QWAZ6FP4EQILUSAW/events.json","paper":"https://pith.science/paper/FSN32OES"},"agent_actions":{"view_html":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW","download_json":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW.json","view_paper":"https://pith.science/paper/FSN32OES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0535&json=true","fetch_graph":"https://pith.science/api/pith-number/FSN32OESE7QWAZ6FP4EQILUSAW/graph.json","fetch_events":"https://pith.science/api/pith-number/FSN32OESE7QWAZ6FP4EQILUSAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW/action/storage_attestation","attest_author":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW/action/author_attestation","sign_citation":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW/action/citation_signature","submit_replication":"https://pith.science/pith/FSN32OESE7QWAZ6FP4EQILUSAW/action/replication_record"}},"created_at":"2026-05-18T03:41:40.679524+00:00","updated_at":"2026-05-18T03:41:40.679524+00:00"}