{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UVVNU2ZXDDYE43LRAL7D37V5PV","short_pith_number":"pith:UVVNU2ZX","schema_version":"1.0","canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","source":{"kind":"arxiv","id":"1605.08754","version":1},"attestation_state":"computed","paper":{"title":"Faster Eigenvector Computation via Shift-and-Invert Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Chi Jin, Dan Garber, Elad Hazan, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2016-05-26T03:53:00Z","abstract_excerpt":"We give faster algorithms and improved sample complexities for estimating the top eigenvector of a matrix $\\Sigma$ -- i.e. computing a unit vector $x$ such that $x^T \\Sigma x \\ge (1-\\epsilon)\\lambda_1(\\Sigma)$:\n  Offline Eigenvector Estimation: Given an explicit $A \\in \\mathbb{R}^{n \\times d}$ with $\\Sigma = A^TA$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O([nnz(A) + \\frac{d*sr(A)}{gap^2} ]* \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d*sr(A))^{1/4}}{\\sqrt{gap}} ] * \\log 1/\\epsilon )$. Here $nnz(A)$ is the number of nonzeros in $A$, $sr(A)$ is "},"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":"1605.08754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-26T03:53:00Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"8417b9cd9d12c90efb0006a7d3147315077a6ce2aa0c861bd0816712ef0f71ec","abstract_canon_sha256":"c4a16c35490bea80d69cc670d4ae97ddeb61d998b3161a173f96113b1f2352b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.156202Z","signature_b64":"G/uWhXVUuWqDvjC0SaIC//NyhTydTeKe7m9XUQJ8JBm5X4HYQ3qtIrLvtFjMEuRCL3WshnuTmcKWmiWExgJrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a56ada6b3718f04e6d7102fe3dfebd7d631ecfff4255028d40a3000a65d78955","last_reissued_at":"2026-05-18T01:13:29.155435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.155435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Eigenvector Computation via Shift-and-Invert Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Chi Jin, Dan Garber, Elad Hazan, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2016-05-26T03:53:00Z","abstract_excerpt":"We give faster algorithms and improved sample complexities for estimating the top eigenvector of a matrix $\\Sigma$ -- i.e. computing a unit vector $x$ such that $x^T \\Sigma x \\ge (1-\\epsilon)\\lambda_1(\\Sigma)$:\n  Offline Eigenvector Estimation: Given an explicit $A \\in \\mathbb{R}^{n \\times d}$ with $\\Sigma = A^TA$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O([nnz(A) + \\frac{d*sr(A)}{gap^2} ]* \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d*sr(A))^{1/4}}{\\sqrt{gap}} ] * \\log 1/\\epsilon )$. Here $nnz(A)$ is the number of nonzeros in $A$, $sr(A)$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08754","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":"1605.08754","created_at":"2026-05-18T01:13:29.155571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08754v1","created_at":"2026-05-18T01:13:29.155571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08754","created_at":"2026-05-18T01:13:29.155571+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVVNU2ZXDDYE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVVNU2ZXDDYE43LR","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVVNU2ZX","created_at":"2026-05-18T12:30:46.583412+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/UVVNU2ZXDDYE43LRAL7D37V5PV","json":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV.json","graph_json":"https://pith.science/api/pith-number/UVVNU2ZXDDYE43LRAL7D37V5PV/graph.json","events_json":"https://pith.science/api/pith-number/UVVNU2ZXDDYE43LRAL7D37V5PV/events.json","paper":"https://pith.science/paper/UVVNU2ZX"},"agent_actions":{"view_html":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV","download_json":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV.json","view_paper":"https://pith.science/paper/UVVNU2ZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08754&json=true","fetch_graph":"https://pith.science/api/pith-number/UVVNU2ZXDDYE43LRAL7D37V5PV/graph.json","fetch_events":"https://pith.science/api/pith-number/UVVNU2ZXDDYE43LRAL7D37V5PV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/action/storage_attestation","attest_author":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/action/author_attestation","sign_citation":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/action/citation_signature","submit_replication":"https://pith.science/pith/UVVNU2ZXDDYE43LRAL7D37V5PV/action/replication_record"}},"created_at":"2026-05-18T01:13:29.155571+00:00","updated_at":"2026-05-18T01:13:29.155571+00:00"}