{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V3K62LZQKX5RKXZDBOZR2ZX5YS","short_pith_number":"pith:V3K62LZQ","schema_version":"1.0","canonical_sha256":"aed5ed2f3055fb155f230bb31d66fdc49da4c940b38539227122fca59b45eaef","source":{"kind":"arxiv","id":"1406.2820","version":1},"attestation_state":"computed","paper":{"title":"A CMV--based eigensolver for companion matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gianna M. Del Corso, Luca Gemignani, Roberto Bevilacqua","submitted_at":"2014-06-11T08:31:31Z","abstract_excerpt":"In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple structured QR iteration."},"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":"1406.2820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-06-11T08:31:31Z","cross_cats_sorted":[],"title_canon_sha256":"f4bd496f22ec6abd44734908c88d653697a25d102e65bcad6c15a2eeea576b7f","abstract_canon_sha256":"5c1f3cb3ce1e15fc57d493e77852f17476594f6efc2c570a42ce8b9267e44bbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:45.549667Z","signature_b64":"I3PB8TXWHDgqgaVL3tC8P723rdcoT3cY0uddN4BnRZjswJFLOHjCGfAcwBN7hJ5gfQr92n7eC5ddxEXyt5gmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aed5ed2f3055fb155f230bb31d66fdc49da4c940b38539227122fca59b45eaef","last_reissued_at":"2026-05-18T00:00:45.549248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:45.549248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A CMV--based eigensolver for companion matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gianna M. Del Corso, Luca Gemignani, Roberto Bevilacqua","submitted_at":"2014-06-11T08:31:31Z","abstract_excerpt":"In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple structured QR iteration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2820","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":"1406.2820","created_at":"2026-05-18T00:00:45.549324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2820v1","created_at":"2026-05-18T00:00:45.549324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2820","created_at":"2026-05-18T00:00:45.549324+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3K62LZQKX5R","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3K62LZQKX5RKXZD","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3K62LZQ","created_at":"2026-05-18T12:28:52.271510+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/V3K62LZQKX5RKXZDBOZR2ZX5YS","json":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS.json","graph_json":"https://pith.science/api/pith-number/V3K62LZQKX5RKXZDBOZR2ZX5YS/graph.json","events_json":"https://pith.science/api/pith-number/V3K62LZQKX5RKXZDBOZR2ZX5YS/events.json","paper":"https://pith.science/paper/V3K62LZQ"},"agent_actions":{"view_html":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS","download_json":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS.json","view_paper":"https://pith.science/paper/V3K62LZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2820&json=true","fetch_graph":"https://pith.science/api/pith-number/V3K62LZQKX5RKXZDBOZR2ZX5YS/graph.json","fetch_events":"https://pith.science/api/pith-number/V3K62LZQKX5RKXZDBOZR2ZX5YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS/action/storage_attestation","attest_author":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS/action/author_attestation","sign_citation":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS/action/citation_signature","submit_replication":"https://pith.science/pith/V3K62LZQKX5RKXZDBOZR2ZX5YS/action/replication_record"}},"created_at":"2026-05-18T00:00:45.549324+00:00","updated_at":"2026-05-18T00:00:45.549324+00:00"}