{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DH4SXAKTPWHLDCLPWJI7JW2LSK","short_pith_number":"pith:DH4SXAKT","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"},"canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","source":{"kind":"arxiv","id":"1705.06730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06730","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06730v1","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06730","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"DH4SXAKTPWHL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DH4SXAKTPWHLDCLP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DH4SXAKT","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DH4SXAKTPWHLDCLPWJI7JW2LSK","target":"record","payload":{"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"},"canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","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"},"source_kind":"arxiv","source_id":"1705.06730","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01NBrAtG/SQRPIw87p175+DCjiJqREGi4GFQ0aeqtuqv/oHcvUvy8k3Sa14E+fGDy05bCbNu5TvkHyDlgEvhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:18:56.199696Z"},"content_sha256":"546c1a9ba6516297238581fcebca507b96e404ce5cdafbb6030d1e67eec79d2e","schema_version":"1.0","event_id":"sha256:546c1a9ba6516297238581fcebca507b96e404ce5cdafbb6030d1e67eec79d2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DH4SXAKTPWHLDCLPWJI7JW2LSK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8BQGmrO0XT8KMtZWpqqUUDtHrdC/0zkO/otX3c/bZiBX4xnMSO0Rs4xDF+YblkLO+oy9rW42pTdTKzY6wlqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:18:56.200357Z"},"content_sha256":"426aa6bfc1ef1d9fe72f82c67dd0ed7dbafd04008611cae996a38c9515fca3ce","schema_version":"1.0","event_id":"sha256:426aa6bfc1ef1d9fe72f82c67dd0ed7dbafd04008611cae996a38c9515fca3ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/bundle.json","state_url":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T21:18:56Z","links":{"resolver":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK","bundle":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/bundle.json","state":"https://pith.science/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DH4SXAKTPWHLDCLPWJI7JW2LSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DH4SXAKTPWHLDCLPWJI7JW2LSK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f8a9e033310be5ea51dbb2c08e8fcf1b2fd70704f7424d50851187fbd3bb04a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T19:01:33Z","title_canon_sha256":"2df5c818c7eddc698698098af1178dee65aef85d85bfedaa4009e9fe7c8d6a83"},"schema_version":"1.0","source":{"id":"1705.06730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06730","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06730v1","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06730","created_at":"2026-05-18T00:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"DH4SXAKTPWHL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DH4SXAKTPWHLDCLP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DH4SXAKT","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:426aa6bfc1ef1d9fe72f82c67dd0ed7dbafd04008611cae996a38c9515fca3ce","target":"graph","created_at":"2026-05-18T00:44:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"David P. Woodruff, Flavio Chierichetti, Ravi Kumar, Rina Panigrahy, Silvio Lattanzi, Sreenivas Gollapudi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T19:01:33Z","title":"Algorithms for $\\ell_p$ Low Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06730","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:546c1a9ba6516297238581fcebca507b96e404ce5cdafbb6030d1e67eec79d2e","target":"record","created_at":"2026-05-18T00:44:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f8a9e033310be5ea51dbb2c08e8fcf1b2fd70704f7424d50851187fbd3bb04a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-18T19:01:33Z","title_canon_sha256":"2df5c818c7eddc698698098af1178dee65aef85d85bfedaa4009e9fe7c8d6a83"},"schema_version":"1.0","source":{"id":"1705.06730","kind":"arxiv","version":1}},"canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19f92b81537d8eb1896fb251f4db4b929c7be0c70e9c937adc591cc780d49808","first_computed_at":"2026-05-18T00:44:14.078796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:14.078796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/r26GXeYr9Q0KPCnJNQ3JDiBY/O3MCh+lg9FsPGfg3ZJoW9YnhBa3pt4T1NZVcoqJxTKp4+A3Ye0fnNeTKPXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:14.079291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:546c1a9ba6516297238581fcebca507b96e404ce5cdafbb6030d1e67eec79d2e","sha256:426aa6bfc1ef1d9fe72f82c67dd0ed7dbafd04008611cae996a38c9515fca3ce"],"state_sha256":"e75d735aafd28f01f8ce280a2c608481323576275da0cfc53274925393d44bf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JphXq+9qCL18EBgxTp8F64IJKqhmz0AjsKySX8R05wDo1PO9csX7Krv005taiZuBuO3mrHb7GH+OimJdvEvWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:18:56.204095Z","bundle_sha256":"879a22f07bf60d36948249a68359e99f7fcd43a0541d6969e39375f33bccf802"}}