{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SDKDORBIDXH5U37MGD236XTFQ7","short_pith_number":"pith:SDKDORBI","canonical_record":{"source":{"id":"1602.05950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-18T20:58:20Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3d03e0cd0416c27932a394a70c6ebf25c433a8ad3e3e8b63ee90ff8193b1647b","abstract_canon_sha256":"39160ec038f7397eeeb9c29f8358d6228799c35877c50ab24cef687b33731e81"},"schema_version":"1.0"},"canonical_sha256":"90d43744281dcfda6fec30f5bf5e6587ccdce45975186e673093b0b3e0633c7e","source":{"kind":"arxiv","id":"1602.05950","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05950","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05950v2","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05950","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"SDKDORBIDXH5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SDKDORBIDXH5U37M","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SDKDORBI","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SDKDORBIDXH5U37MGD236XTFQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-18T20:58:20Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3d03e0cd0416c27932a394a70c6ebf25c433a8ad3e3e8b63ee90ff8193b1647b","abstract_canon_sha256":"39160ec038f7397eeeb9c29f8358d6228799c35877c50ab24cef687b33731e81"},"schema_version":"1.0"},"canonical_sha256":"90d43744281dcfda6fec30f5bf5e6587ccdce45975186e673093b0b3e0633c7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:52.910763Z","signature_b64":"ob8EMLKp3F837kcWaXe2Yh3caWN4BDviYj23Crrr6mWlE2hCkgKm9QP5GMMFG7Q19xXdyA6TIwgb/D7t9hMTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d43744281dcfda6fec30f5bf5e6587ccdce45975186e673093b0b3e0633c7e","last_reissued_at":"2026-05-18T00:37:52.910152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:52.910152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05950","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:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wT9FKF4Q4qMzX/cmoGpAMAtWeqHQeC+HRJZk7GpqLBjsyEatyvhPYY2vweOIDugMN/Nut5R5KvANlx9tSGX3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:58:42.762369Z"},"content_sha256":"1879e3aef60d771bec6cf03399fd38ded3c8134c5511fbff41980ccbebd6b740","schema_version":"1.0","event_id":"sha256:1879e3aef60d771bec6cf03399fd38ded3c8134c5511fbff41980ccbebd6b740"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SDKDORBIDXH5U37MGD236XTFQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"David G. Anderson, Ming Gu","submitted_at":"2016-02-18T20:58:20Z","abstract_excerpt":"Low-rank matrix approximation is a fundamental tool in data analysis for processing large datasets, reducing noise, and finding important signals. In this work, we present a novel truncated LU factorization called Spectrum-Revealing LU (SRLU) for effective low-rank matrix approximation, and develop a fast algorithm to compute an SRLU factorization. We provide both matrix and singular value approximation error bounds for the SRLU approximation computed by our algorithm. Our analysis suggests that SRLU is competitive with the best low-rank matrix approximation methods, deterministic or randomize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05950","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:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8no/lCiLUNMctl+Tw3v4Hgc/jET/Aexi18JjxdzVglrquBpJPikJ72gMq7qKfSivtwa6cBNuGuYDigN3oI5mDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:58:42.763016Z"},"content_sha256":"87fdc476e04ae736b9a765d66d693fbe2c3fa2f5db23ab8232d0f7f6f419ff59","schema_version":"1.0","event_id":"sha256:87fdc476e04ae736b9a765d66d693fbe2c3fa2f5db23ab8232d0f7f6f419ff59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDKDORBIDXH5U37MGD236XTFQ7/bundle.json","state_url":"https://pith.science/pith/SDKDORBIDXH5U37MGD236XTFQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDKDORBIDXH5U37MGD236XTFQ7/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-26T16:58:42Z","links":{"resolver":"https://pith.science/pith/SDKDORBIDXH5U37MGD236XTFQ7","bundle":"https://pith.science/pith/SDKDORBIDXH5U37MGD236XTFQ7/bundle.json","state":"https://pith.science/pith/SDKDORBIDXH5U37MGD236XTFQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDKDORBIDXH5U37MGD236XTFQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SDKDORBIDXH5U37MGD236XTFQ7","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":"39160ec038f7397eeeb9c29f8358d6228799c35877c50ab24cef687b33731e81","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-18T20:58:20Z","title_canon_sha256":"3d03e0cd0416c27932a394a70c6ebf25c433a8ad3e3e8b63ee90ff8193b1647b"},"schema_version":"1.0","source":{"id":"1602.05950","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05950","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05950v2","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05950","created_at":"2026-05-18T00:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"SDKDORBIDXH5","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SDKDORBIDXH5U37M","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SDKDORBI","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:87fdc476e04ae736b9a765d66d693fbe2c3fa2f5db23ab8232d0f7f6f419ff59","target":"graph","created_at":"2026-05-18T00:37:52Z","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":"Low-rank matrix approximation is a fundamental tool in data analysis for processing large datasets, reducing noise, and finding important signals. In this work, we present a novel truncated LU factorization called Spectrum-Revealing LU (SRLU) for effective low-rank matrix approximation, and develop a fast algorithm to compute an SRLU factorization. We provide both matrix and singular value approximation error bounds for the SRLU approximation computed by our algorithm. Our analysis suggests that SRLU is competitive with the best low-rank matrix approximation methods, deterministic or randomize","authors_text":"David G. Anderson, Ming Gu","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-18T20:58:20Z","title":"An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05950","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:1879e3aef60d771bec6cf03399fd38ded3c8134c5511fbff41980ccbebd6b740","target":"record","created_at":"2026-05-18T00:37:52Z","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":"39160ec038f7397eeeb9c29f8358d6228799c35877c50ab24cef687b33731e81","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-02-18T20:58:20Z","title_canon_sha256":"3d03e0cd0416c27932a394a70c6ebf25c433a8ad3e3e8b63ee90ff8193b1647b"},"schema_version":"1.0","source":{"id":"1602.05950","kind":"arxiv","version":2}},"canonical_sha256":"90d43744281dcfda6fec30f5bf5e6587ccdce45975186e673093b0b3e0633c7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90d43744281dcfda6fec30f5bf5e6587ccdce45975186e673093b0b3e0633c7e","first_computed_at":"2026-05-18T00:37:52.910152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:52.910152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ob8EMLKp3F837kcWaXe2Yh3caWN4BDviYj23Crrr6mWlE2hCkgKm9QP5GMMFG7Q19xXdyA6TIwgb/D7t9hMTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:52.910763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05950","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1879e3aef60d771bec6cf03399fd38ded3c8134c5511fbff41980ccbebd6b740","sha256:87fdc476e04ae736b9a765d66d693fbe2c3fa2f5db23ab8232d0f7f6f419ff59"],"state_sha256":"1182231e4c7a4b5b664d862fc29de7775809afdfb01e188391d8b852e669bcbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SFKKZtO55CrAu1kKaZPskI8uEON9JvPhRluMgD3X8JcjT20uHydwV6F30WBKFs14iNF/00s4a6YMOutBKkptDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:58:42.766056Z","bundle_sha256":"b19248f458fffb573ed2a1af6f5797eacb2ea07132057faeb755f3dea9f17590"}}