{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DH4SXAKTPWHLDCLPWJI7JW2LSK","short_pith_number":"pith:DH4SXAKT","schema_version":"1.0","canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","source":{"kind":"arxiv","id":"1705.06730","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for $\\ell_p$ Low Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Flavio Chierichetti, Ravi Kumar, Rina Panigrahy, Silvio Lattanzi, Sreenivas Gollapudi","submitted_at":"2017-05-18T19:01:33Z","abstract_excerpt":"We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\\ell_p$-approximation error, for any $p \\geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good approximation algorithms for this version of low-rank approximation that work for every value of $p \\geq 1$, including $p = \\infty$. Our algorithms are simple, easy to implement, work well in practice, and illustrate interesting tradeoffs between the approximation quality, the running time, and the rank of the approximating matrix."},"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":"1705.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T19:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"2df5c818c7eddc698698098af1178dee65aef85d85bfedaa4009e9fe7c8d6a83","abstract_canon_sha256":"1f8a9e033310be5ea51dbb2c08e8fcf1b2fd70704f7424d50851187fbd3bb04a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:14.079291Z","signature_b64":"/r26GXeYr9Q0KPCnJNQ3JDiBY/O3MCh+lg9FsPGfg3ZJoW9YnhBa3pt4T1NZVcoqJxTKp4+A3Ye0fnNeTKPXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","last_reissued_at":"2026-05-18T00:44:14.078796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:14.078796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for $\\ell_p$ Low Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Flavio Chierichetti, Ravi Kumar, Rina Panigrahy, Silvio Lattanzi, Sreenivas Gollapudi","submitted_at":"2017-05-18T19:01:33Z","abstract_excerpt":"We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\\ell_p$-approximation error, for any $p \\geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good approximation algorithms for this version of low-rank approximation that work for every value of $p \\geq 1$, including $p = \\infty$. Our algorithms are simple, easy to implement, work well in practice, and illustrate interesting tradeoffs between the approximation quality, the running time, and the rank of the approximating matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06730","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":"1705.06730","created_at":"2026-05-18T00:44:14.078868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06730v1","created_at":"2026-05-18T00:44:14.078868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06730","created_at":"2026-05-18T00:44:14.078868+00:00"},{"alias_kind":"pith_short_12","alias_value":"DH4SXAKTPWHL","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DH4SXAKTPWHLDCLP","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DH4SXAKT","created_at":"2026-05-18T12:31:10.602751+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/DH4SXAKTPWHLDCLPWJI7JW2LSK","json":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK.json","graph_json":"https://pith.science/api/pith-number/DH4SXAKTPWHLDCLPWJI7JW2LSK/graph.json","events_json":"https://pith.science/api/pith-number/DH4SXAKTPWHLDCLPWJI7JW2LSK/events.json","paper":"https://pith.science/paper/DH4SXAKT"},"agent_actions":{"view_html":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK","download_json":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK.json","view_paper":"https://pith.science/paper/DH4SXAKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06730&json=true","fetch_graph":"https://pith.science/api/pith-number/DH4SXAKTPWHLDCLPWJI7JW2LSK/graph.json","fetch_events":"https://pith.science/api/pith-number/DH4SXAKTPWHLDCLPWJI7JW2LSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/action/storage_attestation","attest_author":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/action/author_attestation","sign_citation":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/action/citation_signature","submit_replication":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/action/replication_record"}},"created_at":"2026-05-18T00:44:14.078868+00:00","updated_at":"2026-05-18T00:44:14.078868+00:00"}