{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LG5M4LK5LKH3UTRS4N2HUBHBGN","short_pith_number":"pith:LG5M4LK5","schema_version":"1.0","canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","source":{"kind":"arxiv","id":"1510.08896","version":2},"attestation_state":"computed","paper":{"title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","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, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2015-10-29T20:47:27Z","abstract_excerpt":"We provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix.\n  Offline Setting: Given an $n \\times d$ matrix $A$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O ( [nnz(A) + \\frac{d \\cdot sr(A)}{gap^2}]\\cdot \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d \\cdot sr(A))^{1/4}}{\\sqrt{gap}}]\\cdot \\log1/\\epsilon )$. Here $sr(A)$ is the stable rank and $gap$ is the multiplicative eigenvalue gap. By separating the $gap$ dependence from $nnz(A)$ we improve on the classic power and Lanczos methods. We also im"},"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":"1510.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:47:27Z","cross_cats_sorted":["cs.LG","math.NA","math.OC"],"title_canon_sha256":"b912cddcc9f6b818f7f8b101d39a84bdc8b41cd70b136672e6099ca302e39c64","abstract_canon_sha256":"12c04b2b6d4a467d15b7b4d7a798ebb8176b1a7a7b2aabec7e23465514c057e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:23.977011Z","signature_b64":"I3lP1bIeJVpIjn7wgRTsbM7+ocsxWUk/Z0ql15fBR+8vH75UJRiTP7GlmQTmqg7H/5630kCt/dEORl1AdPWSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bace2d5d5a8fba4e32e3747a04e1335fd0a22c794903165305d6a4acfa0747","last_reissued_at":"2026-05-18T01:13:23.976486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:23.976486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","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, Praneeth Netrapalli, Sham M. Kakade","submitted_at":"2015-10-29T20:47:27Z","abstract_excerpt":"We provide faster algorithms and improved sample complexities for approximating the top eigenvector of a matrix.\n  Offline Setting: Given an $n \\times d$ matrix $A$, we show how to compute an $\\epsilon$ approximate top eigenvector in time $\\tilde O ( [nnz(A) + \\frac{d \\cdot sr(A)}{gap^2}]\\cdot \\log 1/\\epsilon )$ and $\\tilde O([\\frac{nnz(A)^{3/4} (d \\cdot sr(A))^{1/4}}{\\sqrt{gap}}]\\cdot \\log1/\\epsilon )$. Here $sr(A)$ is the stable rank and $gap$ is the multiplicative eigenvalue gap. By separating the $gap$ dependence from $nnz(A)$ we improve on the classic power and Lanczos methods. We also im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08896","kind":"arxiv","version":2},"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":"1510.08896","created_at":"2026-05-18T01:13:23.976575+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08896v2","created_at":"2026-05-18T01:13:23.976575+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08896","created_at":"2026-05-18T01:13:23.976575+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG5M4LK5LKH3","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG5M4LK5LKH3UTRS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG5M4LK5","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2003.00295","citing_title":"Adaptive Federated Optimization","ref_index":159,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN","json":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN.json","graph_json":"https://pith.science/api/pith-number/LG5M4LK5LKH3UTRS4N2HUBHBGN/graph.json","events_json":"https://pith.science/api/pith-number/LG5M4LK5LKH3UTRS4N2HUBHBGN/events.json","paper":"https://pith.science/paper/LG5M4LK5"},"agent_actions":{"view_html":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN","download_json":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN.json","view_paper":"https://pith.science/paper/LG5M4LK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08896&json=true","fetch_graph":"https://pith.science/api/pith-number/LG5M4LK5LKH3UTRS4N2HUBHBGN/graph.json","fetch_events":"https://pith.science/api/pith-number/LG5M4LK5LKH3UTRS4N2HUBHBGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/action/storage_attestation","attest_author":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/action/author_attestation","sign_citation":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/action/citation_signature","submit_replication":"https://pith.science/pith/LG5M4LK5LKH3UTRS4N2HUBHBGN/action/replication_record"}},"created_at":"2026-05-18T01:13:23.976575+00:00","updated_at":"2026-05-18T01:13:23.976575+00:00"}