{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L6WO2NEC6225DQ3DVMK5W4EDQS","short_pith_number":"pith:L6WO2NEC","schema_version":"1.0","canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","source":{"kind":"arxiv","id":"1704.03371","version":3},"attestation_state":"computed","paper":{"title":"Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, David P. Woodruff","submitted_at":"2017-04-11T15:44:49Z","abstract_excerpt":"We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any $n \\times n$ PSD matrix $A$, in $\\tilde O(n \\cdot poly(k/\\epsilon))$ time we output a rank-$k$ matrix $B$, in factored form, for which $\\|A-B\\|_F^2 \\leq (1+\\epsilon)\\|A-A_k\\|_F^2$, where $A_k$ is the best rank-$k$ approximation to $A$. When $k$ and $1/\\epsilon$ are not too large compared to the sparsity of $A$, our algorithm does not need to read all entries of the matrix. Hence, we significantly improve upon previous $nnz(A)$ time algorithms based on oblivi"},"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":"1704.03371","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T15:44:49Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5b62ecf020ade6d70ee22b9a3f0adb701bc9300b8338b02be8810927cad31a59","abstract_canon_sha256":"1828c57654acdeacb7c532291eecce5333a46bac670b6a534bb1f6fb432cdc1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:03.390147Z","signature_b64":"g194jLvttG7jYI8FRXNcP9B3mKVWI9ds4GfK6At3atsXDUSRbLMzIAE5eDQKmxXGC7x+uSK7abnkJXBpuTcTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5faced3482f6b5d1c363ab15db708384b909bac7276a303db56516d48c527849","last_reissued_at":"2026-05-17T23:57:03.389576Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:03.389576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Cameron Musco, David P. Woodruff","submitted_at":"2017-04-11T15:44:49Z","abstract_excerpt":"We show how to compute a relative-error low-rank approximation to any positive semidefinite (PSD) matrix in sublinear time, i.e., for any $n \\times n$ PSD matrix $A$, in $\\tilde O(n \\cdot poly(k/\\epsilon))$ time we output a rank-$k$ matrix $B$, in factored form, for which $\\|A-B\\|_F^2 \\leq (1+\\epsilon)\\|A-A_k\\|_F^2$, where $A_k$ is the best rank-$k$ approximation to $A$. When $k$ and $1/\\epsilon$ are not too large compared to the sparsity of $A$, our algorithm does not need to read all entries of the matrix. Hence, we significantly improve upon previous $nnz(A)$ time algorithms based on oblivi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03371","kind":"arxiv","version":3},"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":"1704.03371","created_at":"2026-05-17T23:57:03.389678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03371v3","created_at":"2026-05-17T23:57:03.389678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03371","created_at":"2026-05-17T23:57:03.389678+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6WO2NEC6225","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6WO2NEC6225DQ3D","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6WO2NEC","created_at":"2026-05-18T12:31:28.150371+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/L6WO2NEC6225DQ3DVMK5W4EDQS","json":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS.json","graph_json":"https://pith.science/api/pith-number/L6WO2NEC6225DQ3DVMK5W4EDQS/graph.json","events_json":"https://pith.science/api/pith-number/L6WO2NEC6225DQ3DVMK5W4EDQS/events.json","paper":"https://pith.science/paper/L6WO2NEC"},"agent_actions":{"view_html":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS","download_json":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS.json","view_paper":"https://pith.science/paper/L6WO2NEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03371&json=true","fetch_graph":"https://pith.science/api/pith-number/L6WO2NEC6225DQ3DVMK5W4EDQS/graph.json","fetch_events":"https://pith.science/api/pith-number/L6WO2NEC6225DQ3DVMK5W4EDQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/action/storage_attestation","attest_author":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/action/author_attestation","sign_citation":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/action/citation_signature","submit_replication":"https://pith.science/pith/L6WO2NEC6225DQ3DVMK5W4EDQS/action/replication_record"}},"created_at":"2026-05-17T23:57:03.389678+00:00","updated_at":"2026-05-17T23:57:03.389678+00:00"}