{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RXYXFEVF67A6XAFTAYOTYUH7MT","short_pith_number":"pith:RXYXFEVF","schema_version":"1.0","canonical_sha256":"8df17292a5f7c1eb80b3061d3c50ff64fa347cb627540b2eca378ce501686723","source":{"kind":"arxiv","id":"1811.10866","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Neha Gupta","submitted_at":"2018-11-27T08:22:54Z","abstract_excerpt":"In this paper, we obtain improved running times for regression and top eigenvector computation for numerically sparse matrices. Given a data matrix $A \\in \\mathbb{R}^{n \\times d}$ where every row $a \\in \\mathbb{R}^d$ has $\\|a\\|_2^2 \\leq L$ and numerical sparsity at most $s$, i.e. $\\|a\\|_1^2 / \\|a\\|_2^2 \\leq s$, we provide faster algorithms for these problems in many parameter settings.\n  For top eigenvector computation, we obtain a running time of $\\tilde{O}(nd + r(s + \\sqrt{r s}) / \\mathrm{gap}^2)$ where $\\mathrm{gap} > 0$ is the relative gap between the top two eigenvectors of $A^\\top A$ and"},"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":"1811.10866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-27T08:22:54Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"aadddc9c520dafcaff407fe4d8da20c3d03d0263ae6f6f4a7b782aa71bdcca38","abstract_canon_sha256":"b7d0784a1827b024f635cb2265a009d8f68042c562632ed7aba2126fc1cfbfa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.290275Z","signature_b64":"aEGx6F+hGPDopJQ0eTemycDrRLBQCNQMGMSK3VqJHycBscHfBvnMFamrpvCPBhF698/oAdLGPgnNyptnzDglAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df17292a5f7c1eb80b3061d3c50ff64fa347cb627540b2eca378ce501686723","last_reissued_at":"2026-05-17T23:59:47.289794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.289794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Neha Gupta","submitted_at":"2018-11-27T08:22:54Z","abstract_excerpt":"In this paper, we obtain improved running times for regression and top eigenvector computation for numerically sparse matrices. Given a data matrix $A \\in \\mathbb{R}^{n \\times d}$ where every row $a \\in \\mathbb{R}^d$ has $\\|a\\|_2^2 \\leq L$ and numerical sparsity at most $s$, i.e. $\\|a\\|_1^2 / \\|a\\|_2^2 \\leq s$, we provide faster algorithms for these problems in many parameter settings.\n  For top eigenvector computation, we obtain a running time of $\\tilde{O}(nd + r(s + \\sqrt{r s}) / \\mathrm{gap}^2)$ where $\\mathrm{gap} > 0$ is the relative gap between the top two eigenvectors of $A^\\top A$ and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10866","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":"1811.10866","created_at":"2026-05-17T23:59:47.289866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10866v1","created_at":"2026-05-17T23:59:47.289866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10866","created_at":"2026-05-17T23:59:47.289866+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXYXFEVF67A6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXYXFEVF67A6XAFT","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXYXFEVF","created_at":"2026-05-18T12:32:50.500415+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/RXYXFEVF67A6XAFTAYOTYUH7MT","json":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT.json","graph_json":"https://pith.science/api/pith-number/RXYXFEVF67A6XAFTAYOTYUH7MT/graph.json","events_json":"https://pith.science/api/pith-number/RXYXFEVF67A6XAFTAYOTYUH7MT/events.json","paper":"https://pith.science/paper/RXYXFEVF"},"agent_actions":{"view_html":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT","download_json":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT.json","view_paper":"https://pith.science/paper/RXYXFEVF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10866&json=true","fetch_graph":"https://pith.science/api/pith-number/RXYXFEVF67A6XAFTAYOTYUH7MT/graph.json","fetch_events":"https://pith.science/api/pith-number/RXYXFEVF67A6XAFTAYOTYUH7MT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT/action/storage_attestation","attest_author":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT/action/author_attestation","sign_citation":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT/action/citation_signature","submit_replication":"https://pith.science/pith/RXYXFEVF67A6XAFTAYOTYUH7MT/action/replication_record"}},"created_at":"2026-05-17T23:59:47.289866+00:00","updated_at":"2026-05-17T23:59:47.289866+00:00"}