{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2YT4EYGQSIPKM5ROKG47CE22LC","short_pith_number":"pith:2YT4EYGQ","schema_version":"1.0","canonical_sha256":"d627c260d0921ea6762e51b9f1135a58b8a76298f9e26fc0e0dd5b28225a9c8f","source":{"kind":"arxiv","id":"1410.0116","version":1},"attestation_state":"computed","paper":{"title":"A stable, polynomial-time algorithm for the eigenpair problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Felipe Cucker, Peter B\\\"urgisser","submitted_at":"2014-10-01T06:17:49Z","abstract_excerpt":"We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not believe they outperform in practice the algorithms currently used for this computational problem. The merit of our paper is to give a positive answer to a long-standing open problem in numerical linear algebra."},"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":"1410.0116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-10-01T06:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"2b309c73723af2853dfeecaacc6fd726d7f0d1a084db4fdd26c72e64ef3d7856","abstract_canon_sha256":"b6451ec02dab77c9b52174a5f7d7e6b4139c7fe99253df30df427dfe4f12d225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.989661Z","signature_b64":"/8TB6bBD2R4s3SyGw0l/+fXnccEMQoqKIYygOs/ZC4iSH7DXiLwctF3QIkiiUSO3vJ4lA3WdQiA7B8WX0vBuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d627c260d0921ea6762e51b9f1135a58b8a76298f9e26fc0e0dd5b28225a9c8f","last_reissued_at":"2026-05-18T02:41:17.989240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.989240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A stable, polynomial-time algorithm for the eigenpair problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Felipe Cucker, Peter B\\\"urgisser","submitted_at":"2014-10-01T06:17:49Z","abstract_excerpt":"We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not believe they outperform in practice the algorithms currently used for this computational problem. The merit of our paper is to give a positive answer to a long-standing open problem in numerical linear algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0116","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":"1410.0116","created_at":"2026-05-18T02:41:17.989304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0116v1","created_at":"2026-05-18T02:41:17.989304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0116","created_at":"2026-05-18T02:41:17.989304+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YT4EYGQSIPK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YT4EYGQSIPKM5RO","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YT4EYGQ","created_at":"2026-05-18T12:28:11.866339+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/2YT4EYGQSIPKM5ROKG47CE22LC","json":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC.json","graph_json":"https://pith.science/api/pith-number/2YT4EYGQSIPKM5ROKG47CE22LC/graph.json","events_json":"https://pith.science/api/pith-number/2YT4EYGQSIPKM5ROKG47CE22LC/events.json","paper":"https://pith.science/paper/2YT4EYGQ"},"agent_actions":{"view_html":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC","download_json":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC.json","view_paper":"https://pith.science/paper/2YT4EYGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0116&json=true","fetch_graph":"https://pith.science/api/pith-number/2YT4EYGQSIPKM5ROKG47CE22LC/graph.json","fetch_events":"https://pith.science/api/pith-number/2YT4EYGQSIPKM5ROKG47CE22LC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC/action/storage_attestation","attest_author":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC/action/author_attestation","sign_citation":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC/action/citation_signature","submit_replication":"https://pith.science/pith/2YT4EYGQSIPKM5ROKG47CE22LC/action/replication_record"}},"created_at":"2026-05-18T02:41:17.989304+00:00","updated_at":"2026-05-18T02:41:17.989304+00:00"}