{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A6LVSO6OB6KA2NK6FHJ5HLNE4Q","short_pith_number":"pith:A6LVSO6O","schema_version":"1.0","canonical_sha256":"0797593bce0f940d355e29d3d3ada4e405566455ef7603cecdbee90d32a2bdff","source":{"kind":"arxiv","id":"1808.05913","version":1},"attestation_state":"computed","paper":{"title":"Regularizing algorithm for mixed matrix pencils","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Tetiana Klymchuk","submitted_at":"2018-08-17T16:01:28Z","abstract_excerpt":"P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van Dooren's algorithm to square complex matrices with respect to consimilarity transformations and to pairs of m-by-n complex matrices."},"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":"1808.05913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2018-08-17T16:01:28Z","cross_cats_sorted":[],"title_canon_sha256":"eeb38614b8f5ec665abe1496bf8499bfd362951260cee42d505734bf41658e0f","abstract_canon_sha256":"59bca1ea518044526406b906191d05c33cd4e249d9d06fb4c6b9fdfc80320fc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:51.671180Z","signature_b64":"T9ywBilMMAkEEu1vDjmzsfjefvgPVI1eg8X9OqYrwNZFGRuNuXmvQ2gSQz8/D+mnSaUAFZTfaTSolHp97PhrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0797593bce0f940d355e29d3d3ada4e405566455ef7603cecdbee90d32a2bdff","last_reissued_at":"2026-05-18T00:07:51.670408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:51.670408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularizing algorithm for mixed matrix pencils","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"Tetiana Klymchuk","submitted_at":"2018-08-17T16:01:28Z","abstract_excerpt":"P. Van Dooren (1979) constructed an algorithm for computing all singular summands of Kronecker's canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van Dooren's algorithm to square complex matrices with respect to consimilarity transformations and to pairs of m-by-n complex matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05913","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":"1808.05913","created_at":"2026-05-18T00:07:51.670532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05913v1","created_at":"2026-05-18T00:07:51.670532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05913","created_at":"2026-05-18T00:07:51.670532+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6LVSO6OB6KA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6LVSO6OB6KA2NK6","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6LVSO6O","created_at":"2026-05-18T12:32:13.499390+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/A6LVSO6OB6KA2NK6FHJ5HLNE4Q","json":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q.json","graph_json":"https://pith.science/api/pith-number/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/graph.json","events_json":"https://pith.science/api/pith-number/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/events.json","paper":"https://pith.science/paper/A6LVSO6O"},"agent_actions":{"view_html":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q","download_json":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q.json","view_paper":"https://pith.science/paper/A6LVSO6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05913&json=true","fetch_graph":"https://pith.science/api/pith-number/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/action/storage_attestation","attest_author":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/action/author_attestation","sign_citation":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/action/citation_signature","submit_replication":"https://pith.science/pith/A6LVSO6OB6KA2NK6FHJ5HLNE4Q/action/replication_record"}},"created_at":"2026-05-18T00:07:51.670532+00:00","updated_at":"2026-05-18T00:07:51.670532+00:00"}