{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XBKGHM7VOF2G7DISQAB36UUIJS","short_pith_number":"pith:XBKGHM7V","schema_version":"1.0","canonical_sha256":"b85463b3f571746f8d128003bf52884c9b92d206a1f61c1e415d8923916fbe75","source":{"kind":"arxiv","id":"1905.11490","version":1},"attestation_state":"computed","paper":{"title":"The low-rank eigenvalue problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Yuji Nakatsukasa","submitted_at":"2019-05-27T20:31:44Z","abstract_excerpt":"The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and eigenvectors of a low-rank matrix $X= AB$ with $A,B^T\\in\\mathbb{C}^{N\\times r}, N\\gg r$: form the small $r\\times r$ matrix $BA$ and find its eigenvalues and eigenvectors. For nonzero eigenvalues, the eigenvectors are related by $ ABv = \\lambda v \\Leftrightarrow BAw = \\lambda w $ with $w=Bv$, and the same holds for Jordan vectors. For zero eigenvalues, the Jordan b"},"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":"1905.11490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-05-27T20:31:44Z","cross_cats_sorted":[],"title_canon_sha256":"d9ee25971e4d0d25231e33f51fef5a2b87e01e213f7e8addd0a8c9cebbf37fd7","abstract_canon_sha256":"689dc66726c316e3ba34cbd6123918aa237692ca42ed1ec129f7555e022dbf41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:53.273630Z","signature_b64":"nE56d1w+XgHsKCtfWTuI8LwW5gJcuUkHQAFASDJvaWxtZ6jMt33r5xO8sMCdeGwkdeeMW9e823W9k9umui0nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b85463b3f571746f8d128003bf52884c9b92d206a1f61c1e415d8923916fbe75","last_reissued_at":"2026-05-17T23:44:53.272807Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:53.272807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The low-rank eigenvalue problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Yuji Nakatsukasa","submitted_at":"2019-05-27T20:31:44Z","abstract_excerpt":"The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and eigenvectors of a low-rank matrix $X= AB$ with $A,B^T\\in\\mathbb{C}^{N\\times r}, N\\gg r$: form the small $r\\times r$ matrix $BA$ and find its eigenvalues and eigenvectors. For nonzero eigenvalues, the eigenvectors are related by $ ABv = \\lambda v \\Leftrightarrow BAw = \\lambda w $ with $w=Bv$, and the same holds for Jordan vectors. For zero eigenvalues, the Jordan b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11490","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":"1905.11490","created_at":"2026-05-17T23:44:53.272959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11490v1","created_at":"2026-05-17T23:44:53.272959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11490","created_at":"2026-05-17T23:44:53.272959+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBKGHM7VOF2G","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBKGHM7VOF2G7DIS","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBKGHM7V","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.25202","citing_title":"The dual Burnside process","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS","json":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS.json","graph_json":"https://pith.science/api/pith-number/XBKGHM7VOF2G7DISQAB36UUIJS/graph.json","events_json":"https://pith.science/api/pith-number/XBKGHM7VOF2G7DISQAB36UUIJS/events.json","paper":"https://pith.science/paper/XBKGHM7V"},"agent_actions":{"view_html":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS","download_json":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS.json","view_paper":"https://pith.science/paper/XBKGHM7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11490&json=true","fetch_graph":"https://pith.science/api/pith-number/XBKGHM7VOF2G7DISQAB36UUIJS/graph.json","fetch_events":"https://pith.science/api/pith-number/XBKGHM7VOF2G7DISQAB36UUIJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS/action/storage_attestation","attest_author":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS/action/author_attestation","sign_citation":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS/action/citation_signature","submit_replication":"https://pith.science/pith/XBKGHM7VOF2G7DISQAB36UUIJS/action/replication_record"}},"created_at":"2026-05-17T23:44:53.272959+00:00","updated_at":"2026-05-17T23:44:53.272959+00:00"}