{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7GZGW2YD5Z5QCY6SFO7ZOXOUQZ","short_pith_number":"pith:7GZGW2YD","canonical_record":{"source":{"id":"1511.01598","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2015-11-05T03:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"12e14b58b7c73d58babfa733ccfedbcbcd0f4256fc7529b0c2191f03c0c4bc45","abstract_canon_sha256":"dd275096c5c4de576706635b684addc368ace1dc5c4bb5230e81bd62c7d364ec"},"schema_version":"1.0"},"canonical_sha256":"f9b26b6b03ee7b0163d22bbf975dd48677c3a818a6c7195f192cb46ea988a305","source":{"kind":"arxiv","id":"1511.01598","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01598","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01598v4","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01598","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"7GZGW2YD5Z5Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7GZGW2YD5Z5QCY6S","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7GZGW2YD","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7GZGW2YD5Z5QCY6SFO7ZOXOUQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01598","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2015-11-05T03:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"12e14b58b7c73d58babfa733ccfedbcbcd0f4256fc7529b0c2191f03c0c4bc45","abstract_canon_sha256":"dd275096c5c4de576706635b684addc368ace1dc5c4bb5230e81bd62c7d364ec"},"schema_version":"1.0"},"canonical_sha256":"f9b26b6b03ee7b0163d22bbf975dd48677c3a818a6c7195f192cb46ea988a305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.801651Z","signature_b64":"BtXVadHWDgM8sMyINE/q/V4LbtTaGTKXvesvdh+VxJTm+bjrtd3p1bmJjOgRBeL2yr1aH0eRxl9EchMg1cUpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9b26b6b03ee7b0163d22bbf975dd48677c3a818a6c7195f192cb46ea988a305","last_reissued_at":"2026-05-18T00:50:01.800950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.800950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01598","source_version":4,"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:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jsg34GH1qYFQI6hmN+M5fCmX5hC3Mi5Y/Z60nRoW433xAZOb8cym5i4KfAjIVZT/InUoytMIcDUYgptDwq4ICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:54:16.813810Z"},"content_sha256":"b0cf2ad469394d8ac5a01b7092f35ca76cddf6e8d2343adfbf17e3ea94a74b51","schema_version":"1.0","event_id":"sha256:b0cf2ad469394d8ac5a01b7092f35ca76cddf6e8d2343adfbf17e3ea94a74b51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7GZGW2YD5Z5QCY6SFO7ZOXOUQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Approach to Optimal CUR Decomposition","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Haishan Ye, Yujun Li, Zhihua Zhang","submitted_at":"2015-11-05T03:48:28Z","abstract_excerpt":"Prior optimal CUR decomposition and near optimal column reconstruction methods have been established by combining BSS sampling and adaptive sampling. In this paper, we propose a new approach to the optimal CUR decomposition and near optimal column reconstruction by just using leverage score sampling. In our approach, both the BSS sampling and adaptive sampling are not needed. Moreover, our approach is the first $O(\\mathrm{nnz}(\\A))$ optimal CUR algorithm where $\\A$ is a data matrix in question. We also extend our approach to the Nystr{\\\"o}m method, obtaining a fast algorithm which runs $\\tilde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01598","kind":"arxiv","version":4},"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:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71NSJJYTILMDAfmYwYyC1oVbZXySF5e7tVRlKtoilSj1FBAgYXIL3PNbu03cKQo4WEWU0NvRipRRNDeJ6BcgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:54:16.814483Z"},"content_sha256":"80bd8e31a1282ebbec87aa61e576f7fb87eee9982d13e2872d31aecd4814b49f","schema_version":"1.0","event_id":"sha256:80bd8e31a1282ebbec87aa61e576f7fb87eee9982d13e2872d31aecd4814b49f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/bundle.json","state_url":"https://pith.science/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/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-11T19:54:16Z","links":{"resolver":"https://pith.science/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ","bundle":"https://pith.science/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/bundle.json","state":"https://pith.science/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GZGW2YD5Z5QCY6SFO7ZOXOUQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7GZGW2YD5Z5QCY6SFO7ZOXOUQZ","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":"dd275096c5c4de576706635b684addc368ace1dc5c4bb5230e81bd62c7d364ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2015-11-05T03:48:28Z","title_canon_sha256":"12e14b58b7c73d58babfa733ccfedbcbcd0f4256fc7529b0c2191f03c0c4bc45"},"schema_version":"1.0","source":{"id":"1511.01598","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01598","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01598v4","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01598","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"7GZGW2YD5Z5Q","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7GZGW2YD5Z5QCY6S","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7GZGW2YD","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:80bd8e31a1282ebbec87aa61e576f7fb87eee9982d13e2872d31aecd4814b49f","target":"graph","created_at":"2026-05-18T00:50:01Z","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":"Prior optimal CUR decomposition and near optimal column reconstruction methods have been established by combining BSS sampling and adaptive sampling. In this paper, we propose a new approach to the optimal CUR decomposition and near optimal column reconstruction by just using leverage score sampling. In our approach, both the BSS sampling and adaptive sampling are not needed. Moreover, our approach is the first $O(\\mathrm{nnz}(\\A))$ optimal CUR algorithm where $\\A$ is a data matrix in question. We also extend our approach to the Nystr{\\\"o}m method, obtaining a fast algorithm which runs $\\tilde","authors_text":"Haishan Ye, Yujun Li, Zhihua Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2015-11-05T03:48:28Z","title":"A Simple Approach to Optimal CUR Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01598","kind":"arxiv","version":4},"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:b0cf2ad469394d8ac5a01b7092f35ca76cddf6e8d2343adfbf17e3ea94a74b51","target":"record","created_at":"2026-05-18T00:50:01Z","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":"dd275096c5c4de576706635b684addc368ace1dc5c4bb5230e81bd62c7d364ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NA","submitted_at":"2015-11-05T03:48:28Z","title_canon_sha256":"12e14b58b7c73d58babfa733ccfedbcbcd0f4256fc7529b0c2191f03c0c4bc45"},"schema_version":"1.0","source":{"id":"1511.01598","kind":"arxiv","version":4}},"canonical_sha256":"f9b26b6b03ee7b0163d22bbf975dd48677c3a818a6c7195f192cb46ea988a305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9b26b6b03ee7b0163d22bbf975dd48677c3a818a6c7195f192cb46ea988a305","first_computed_at":"2026-05-18T00:50:01.800950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.800950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtXVadHWDgM8sMyINE/q/V4LbtTaGTKXvesvdh+VxJTm+bjrtd3p1bmJjOgRBeL2yr1aH0eRxl9EchMg1cUpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.801651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01598","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0cf2ad469394d8ac5a01b7092f35ca76cddf6e8d2343adfbf17e3ea94a74b51","sha256:80bd8e31a1282ebbec87aa61e576f7fb87eee9982d13e2872d31aecd4814b49f"],"state_sha256":"b35f6c6ac43d16d1e63003cef71c83c0ceaa736eb6d08b65898e3b64e9986d11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ht2GLenqvAFFUWOJE+n5PR9NA9Z8VkLh2f3R+vxFfMxP6QcIlc7JIeI806vwGATJjbIgKlG0IRZWA2V8Hyy8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:54:16.818226Z","bundle_sha256":"874a51b2fa4e78a0d1ddf444aa959fddd551bc3b4abe455a1cf380cd8a79e1d9"}}