{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZBFTN4PMUC3QZOVJTEJK34JV2K","short_pith_number":"pith:ZBFTN4PM","canonical_record":{"source":{"id":"1710.11253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T21:49:48Z","cross_cats_sorted":["cs.DM","cs.LG","stat.ML"],"title_canon_sha256":"b0e8e926e7d8101f5a69b2efcacbf8d26acc78c2b6e803c4d3d17aedaedfdf2e","abstract_canon_sha256":"50bedcd023d13de86567a43e6cb96ba47d2e53979f250babc5edadd651f9cdb1"},"schema_version":"1.0"},"canonical_sha256":"c84b36f1eca0b70cbaa99912adf135d2972c90278d05cbc97f6d8a38185f1b31","source":{"kind":"arxiv","id":"1710.11253","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11253","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11253v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11253","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFTN4PMUC3Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFTN4PMUC3QZOVJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFTN4PM","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZBFTN4PMUC3QZOVJTEJK34JV2K","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T21:49:48Z","cross_cats_sorted":["cs.DM","cs.LG","stat.ML"],"title_canon_sha256":"b0e8e926e7d8101f5a69b2efcacbf8d26acc78c2b6e803c4d3d17aedaedfdf2e","abstract_canon_sha256":"50bedcd023d13de86567a43e6cb96ba47d2e53979f250babc5edadd651f9cdb1"},"schema_version":"1.0"},"canonical_sha256":"c84b36f1eca0b70cbaa99912adf135d2972c90278d05cbc97f6d8a38185f1b31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:30.569613Z","signature_b64":"7RPkzGM0ICKS99Cp2h08A78cblUkr2Gq8T9C4DJWFL+t2TFIyIG29uUuRbKLNNfJ6d7OiYYkgRkMrFajCiWzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84b36f1eca0b70cbaa99912adf135d2972c90278d05cbc97f6d8a38185f1b31","last_reissued_at":"2026-05-18T00:04:30.569194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:30.569194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11253","source_version":2,"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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQ9BQXHJyFi7y89Q9BNAkqzYe62dK37LRerxB6V91QDEkcXJHo4aQfxYt6lqbuxaX6ulCMc5QxzA3/lBcMg+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:26.252743Z"},"content_sha256":"06fc2b6831d2dbdb877eea1d44371e010f0ad398a582c14e7ec835590842784b","schema_version":"1.0","event_id":"sha256:06fc2b6831d2dbdb877eea1d44371e010f0ad398a582c14e7ec835590842784b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZBFTN4PMUC3QZOVJTEJK34JV2K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for $\\ell_0$-Low Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Karl Bringmann, Pavel Kolev","submitted_at":"2017-10-30T21:49:48Z","abstract_excerpt":"We study the $\\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \\times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\\|A'-A\\|_0$ is minimized. Here, for a matrix $B$, $\\|B\\|_0$ denotes the number of its non-zero entries. This NP-hard variant of low rank approximation is natural for problems with no underlying metric, and its goal is to minimize the number of disagreeing data positions. We provide approximation algorithms which significantly improve the running time and approximation factor of previous work. For $k > 1$, we show how to find, in poly$(mn)$ time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11253","kind":"arxiv","version":2},"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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVEwxQTaiIx7vqg8ExP6F4jDmnXOlxv1+FqPsDq97RMsRhn/7lkCu3bY86cxzkwiUZOMh3taH/xEQyXnSKuMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:12:26.253382Z"},"content_sha256":"d418f84cdca213e3c5d64987e78639eacd8838461dce31f9a22d115b0c436422","schema_version":"1.0","event_id":"sha256:d418f84cdca213e3c5d64987e78639eacd8838461dce31f9a22d115b0c436422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/bundle.json","state_url":"https://pith.science/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/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-05-30T11:12:26Z","links":{"resolver":"https://pith.science/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K","bundle":"https://pith.science/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/bundle.json","state":"https://pith.science/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBFTN4PMUC3QZOVJTEJK34JV2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZBFTN4PMUC3QZOVJTEJK34JV2K","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":"50bedcd023d13de86567a43e6cb96ba47d2e53979f250babc5edadd651f9cdb1","cross_cats_sorted":["cs.DM","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T21:49:48Z","title_canon_sha256":"b0e8e926e7d8101f5a69b2efcacbf8d26acc78c2b6e803c4d3d17aedaedfdf2e"},"schema_version":"1.0","source":{"id":"1710.11253","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11253","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11253v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11253","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"ZBFTN4PMUC3Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZBFTN4PMUC3QZOVJ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZBFTN4PM","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:d418f84cdca213e3c5d64987e78639eacd8838461dce31f9a22d115b0c436422","target":"graph","created_at":"2026-05-18T00:04:30Z","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 study the $\\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \\times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\\|A'-A\\|_0$ is minimized. Here, for a matrix $B$, $\\|B\\|_0$ denotes the number of its non-zero entries. This NP-hard variant of low rank approximation is natural for problems with no underlying metric, and its goal is to minimize the number of disagreeing data positions. We provide approximation algorithms which significantly improve the running time and approximation factor of previous work. For $k > 1$, we show how to find, in poly$(mn)$ time ","authors_text":"David P. Woodruff, Karl Bringmann, Pavel Kolev","cross_cats":["cs.DM","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T21:49:48Z","title":"Approximation Algorithms for $\\ell_0$-Low Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11253","kind":"arxiv","version":2},"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:06fc2b6831d2dbdb877eea1d44371e010f0ad398a582c14e7ec835590842784b","target":"record","created_at":"2026-05-18T00:04:30Z","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":"50bedcd023d13de86567a43e6cb96ba47d2e53979f250babc5edadd651f9cdb1","cross_cats_sorted":["cs.DM","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-30T21:49:48Z","title_canon_sha256":"b0e8e926e7d8101f5a69b2efcacbf8d26acc78c2b6e803c4d3d17aedaedfdf2e"},"schema_version":"1.0","source":{"id":"1710.11253","kind":"arxiv","version":2}},"canonical_sha256":"c84b36f1eca0b70cbaa99912adf135d2972c90278d05cbc97f6d8a38185f1b31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c84b36f1eca0b70cbaa99912adf135d2972c90278d05cbc97f6d8a38185f1b31","first_computed_at":"2026-05-18T00:04:30.569194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:30.569194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7RPkzGM0ICKS99Cp2h08A78cblUkr2Gq8T9C4DJWFL+t2TFIyIG29uUuRbKLNNfJ6d7OiYYkgRkMrFajCiWzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:30.569613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11253","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06fc2b6831d2dbdb877eea1d44371e010f0ad398a582c14e7ec835590842784b","sha256:d418f84cdca213e3c5d64987e78639eacd8838461dce31f9a22d115b0c436422"],"state_sha256":"df96de1d5b84eade3fbfc10d7327d65e27c6cd9dfd3b2f10f739e53275f6535d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3C7Qc++ZupdbR1xF1kcDct5cMJZMEtzmyk6Z0M7lhwSPn1RQcVn0OMFZNFAj9gLF5m7yj3q4nTV2q7RNvrHIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:12:26.257501Z","bundle_sha256":"cdb6521f947732090eb1268a2961c66cec86a77e9fd25be0f6c13888517013cb"}}