{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HDJVEZJNXQ7Y5E7XO2P2ATIEZB","short_pith_number":"pith:HDJVEZJN","schema_version":"1.0","canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","source":{"kind":"arxiv","id":"1410.8802","version":1},"attestation_state":"computed","paper":{"title":"Low Rank Matrix Approximation in Linear Time","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2014-10-31T16:46:36Z","abstract_excerpt":"$\\newcommand{\\MatA}{\\mathcal{M}}$ $\\newcommand{\\eps}{\\varepsilon}$ $\\newcommand{\\NSize}{\\mathsf{N}{}}$ $\\newcommand{\\MatB}{\\mathcal{B}}$ $\\newcommand{\\Fnorm}[1]{\\left\\| {#1} \\right\\|_F}$ $\\newcommand{\\PrcOpt}[2]{\\mu_{\\mathrm{opt}}\\pth{#1, #2}}$ $\\newcommand{\\pth}[1]{\\left(#1\\right)}$\n  Given a matrix $\\MatA$ with $n$ rows and $d$ columns, and fixed $k$ and $\\eps$, we present an algorithm that in linear time (i.e., $O(\\NSize )$) computes a $k$-rank matrix $\\MatB$ with approximation error $\\Fnorm{\\MatA - \\MatB}^2 \\leq (1+\\eps) \\PrcOpt{\\MatA}{k}$, where $\\NSize = n d$ is the input size, and $\\Prc"},"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.8802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2014-10-31T16:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"579813b1fe1500daf42f9dcffd32477a7664328804499a34a822af2fdba6f2b6","abstract_canon_sha256":"29db4f79aa236a8eecc85b9badc97152782cb1455896e00d8492a0f2ad71b599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.666285Z","signature_b64":"815mBmzFf9qbiWzBk5NSPvIWWrxdnykb2vzZ/xr8Sh5qlCW+58yAZTsi1hjRg9R8Qcdu3k48iu96oYF/mjdlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38d352652dbc3f8e93f7769fa04d04c84a1ec3f4f327c74205047ac7954aa514","last_reissued_at":"2026-05-18T02:38:53.665896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.665896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Matrix Approximation in Linear Time","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sariel Har-Peled","submitted_at":"2014-10-31T16:46:36Z","abstract_excerpt":"$\\newcommand{\\MatA}{\\mathcal{M}}$ $\\newcommand{\\eps}{\\varepsilon}$ $\\newcommand{\\NSize}{\\mathsf{N}{}}$ $\\newcommand{\\MatB}{\\mathcal{B}}$ $\\newcommand{\\Fnorm}[1]{\\left\\| {#1} \\right\\|_F}$ $\\newcommand{\\PrcOpt}[2]{\\mu_{\\mathrm{opt}}\\pth{#1, #2}}$ $\\newcommand{\\pth}[1]{\\left(#1\\right)}$\n  Given a matrix $\\MatA$ with $n$ rows and $d$ columns, and fixed $k$ and $\\eps$, we present an algorithm that in linear time (i.e., $O(\\NSize )$) computes a $k$-rank matrix $\\MatB$ with approximation error $\\Fnorm{\\MatA - \\MatB}^2 \\leq (1+\\eps) \\PrcOpt{\\MatA}{k}$, where $\\NSize = n d$ is the input size, and $\\Prc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8802","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.8802","created_at":"2026-05-18T02:38:53.665954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8802v1","created_at":"2026-05-18T02:38:53.665954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8802","created_at":"2026-05-18T02:38:53.665954+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDJVEZJNXQ7Y","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDJVEZJNXQ7Y5E7X","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDJVEZJN","created_at":"2026-05-18T12:28:30.664211+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/HDJVEZJNXQ7Y5E7XO2P2ATIEZB","json":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB.json","graph_json":"https://pith.science/api/pith-number/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/graph.json","events_json":"https://pith.science/api/pith-number/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/events.json","paper":"https://pith.science/paper/HDJVEZJN"},"agent_actions":{"view_html":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB","download_json":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB.json","view_paper":"https://pith.science/paper/HDJVEZJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8802&json=true","fetch_graph":"https://pith.science/api/pith-number/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/graph.json","fetch_events":"https://pith.science/api/pith-number/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/action/storage_attestation","attest_author":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/action/author_attestation","sign_citation":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/action/citation_signature","submit_replication":"https://pith.science/pith/HDJVEZJNXQ7Y5E7XO2P2ATIEZB/action/replication_record"}},"created_at":"2026-05-18T02:38:53.665954+00:00","updated_at":"2026-05-18T02:38:53.665954+00:00"}