{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WCSMVHMQ356PNX5A64AVAZAMNY","short_pith_number":"pith:WCSMVHMQ","canonical_record":{"source":{"id":"1908.06059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-16T17:08:08Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"aa7d282ac68dcc9f4ffcdf717e482c616ca14dddfdd76714a7661c84a7474f8c","abstract_canon_sha256":"6eab1c8837b0058e094232e5071c8cd62dd58fcfff64f1e1e1afbc34c89d10e9"},"schema_version":"1.0"},"canonical_sha256":"b0a4ca9d90df7cf6dfa0f70150640c6e3529246ba36c3ae622085f92002d7e0c","source":{"kind":"arxiv","id":"1908.06059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06059","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06059v1","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06059","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"WCSMVHMQ356P","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_16","alias_value":"WCSMVHMQ356PNX5A","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_8","alias_value":"WCSMVHMQ","created_at":"2026-07-04T23:58:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WCSMVHMQ356PNX5A64AVAZAMNY","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-16T17:08:08Z","cross_cats_sorted":["cs.DS","cs.NA"],"title_canon_sha256":"aa7d282ac68dcc9f4ffcdf717e482c616ca14dddfdd76714a7661c84a7474f8c","abstract_canon_sha256":"6eab1c8837b0058e094232e5071c8cd62dd58fcfff64f1e1e1afbc34c89d10e9"},"schema_version":"1.0"},"canonical_sha256":"b0a4ca9d90df7cf6dfa0f70150640c6e3529246ba36c3ae622085f92002d7e0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:01.013702Z","signature_b64":"lpUitLXv1YtWRLyW4+A+RIdrU6t6AR4LutwVr3u3ztnQe+HNIt+8Ajf7guW7fguBCCJvf+Lso70iD6q8e6GYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0a4ca9d90df7cf6dfa0f70150640c6e3529246ba36c3ae622085f92002d7e0c","last_reissued_at":"2026-07-04T23:58:01.013241Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:01.013241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06059","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-07-04T23:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnZU2pdNp/2llUSdwohVn3w2NlGhvafuVecOVUrjdqGbKjkGiTbKztPsexEbxKufKUN42J5B69l2/13IpYW/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:20:33.180893Z"},"content_sha256":"b3e094ad1dcfd676465276ef86ca390a31ec7f219f2f31480816edcbf0d76216","schema_version":"1.0","event_id":"sha256:b3e094ad1dcfd676465276ef86ca390a31ec7f219f2f31480816edcbf0d76216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WCSMVHMQ356PNX5A64AVAZAMNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank approximation in the Frobenius norm by column and row subset selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Daniel Kressner","submitted_at":"2019-08-16T17:08:08Z","abstract_excerpt":"A CUR approximation of a matrix $A$ is a particular type of low-rank approximation $A \\approx C U R$, where $C$ and $R$ consist of columns and rows of $A$, respectively. One way to obtain such an approximation is to apply column subset selection to $A$ and $A^T$. In this work, we describe a numerically robust and much faster variant of the column subset selection algorithm proposed by Deshpande and Rademacher, which guarantees an error close to the best approximation error in the Frobenius norm. For cross approximation, in which $U$ is required to be the inverse of a submatrix of $A$ described"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06059","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06059/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:58:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67vk/0PsM2MDwZLG3lc5h8Rhy6RuJ++HhcqW1y4011gFngmu+eDsPTkgQSROJVbjcN0khk+4aZL13MbCVLIRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:20:33.181415Z"},"content_sha256":"63639fc0ef0a62ee3bf0070da76b7eb7df0f31f22ad3f7590db43f8798824f0c","schema_version":"1.0","event_id":"sha256:63639fc0ef0a62ee3bf0070da76b7eb7df0f31f22ad3f7590db43f8798824f0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCSMVHMQ356PNX5A64AVAZAMNY/bundle.json","state_url":"https://pith.science/pith/WCSMVHMQ356PNX5A64AVAZAMNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCSMVHMQ356PNX5A64AVAZAMNY/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-08-16T14:20:33Z","links":{"resolver":"https://pith.science/pith/WCSMVHMQ356PNX5A64AVAZAMNY","bundle":"https://pith.science/pith/WCSMVHMQ356PNX5A64AVAZAMNY/bundle.json","state":"https://pith.science/pith/WCSMVHMQ356PNX5A64AVAZAMNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCSMVHMQ356PNX5A64AVAZAMNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WCSMVHMQ356PNX5A64AVAZAMNY","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":"6eab1c8837b0058e094232e5071c8cd62dd58fcfff64f1e1e1afbc34c89d10e9","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-16T17:08:08Z","title_canon_sha256":"aa7d282ac68dcc9f4ffcdf717e482c616ca14dddfdd76714a7661c84a7474f8c"},"schema_version":"1.0","source":{"id":"1908.06059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06059","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06059v1","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06059","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_12","alias_value":"WCSMVHMQ356P","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_16","alias_value":"WCSMVHMQ356PNX5A","created_at":"2026-07-04T23:58:01Z"},{"alias_kind":"pith_short_8","alias_value":"WCSMVHMQ","created_at":"2026-07-04T23:58:01Z"}],"graph_snapshots":[{"event_id":"sha256:63639fc0ef0a62ee3bf0070da76b7eb7df0f31f22ad3f7590db43f8798824f0c","target":"graph","created_at":"2026-07-04T23:58: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A CUR approximation of a matrix $A$ is a particular type of low-rank approximation $A \\approx C U R$, where $C$ and $R$ consist of columns and rows of $A$, respectively. One way to obtain such an approximation is to apply column subset selection to $A$ and $A^T$. In this work, we describe a numerically robust and much faster variant of the column subset selection algorithm proposed by Deshpande and Rademacher, which guarantees an error close to the best approximation error in the Frobenius norm. For cross approximation, in which $U$ is required to be the inverse of a submatrix of $A$ described","authors_text":"Alice Cortinovis, Daniel Kressner","cross_cats":["cs.DS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-16T17:08:08Z","title":"Low-rank approximation in the Frobenius norm by column and row subset selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06059","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:b3e094ad1dcfd676465276ef86ca390a31ec7f219f2f31480816edcbf0d76216","target":"record","created_at":"2026-07-04T23:58: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":"6eab1c8837b0058e094232e5071c8cd62dd58fcfff64f1e1e1afbc34c89d10e9","cross_cats_sorted":["cs.DS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-08-16T17:08:08Z","title_canon_sha256":"aa7d282ac68dcc9f4ffcdf717e482c616ca14dddfdd76714a7661c84a7474f8c"},"schema_version":"1.0","source":{"id":"1908.06059","kind":"arxiv","version":1}},"canonical_sha256":"b0a4ca9d90df7cf6dfa0f70150640c6e3529246ba36c3ae622085f92002d7e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0a4ca9d90df7cf6dfa0f70150640c6e3529246ba36c3ae622085f92002d7e0c","first_computed_at":"2026-07-04T23:58:01.013241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:01.013241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpUitLXv1YtWRLyW4+A+RIdrU6t6AR4LutwVr3u3ztnQe+HNIt+8Ajf7guW7fguBCCJvf+Lso70iD6q8e6GYBw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:01.013702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3e094ad1dcfd676465276ef86ca390a31ec7f219f2f31480816edcbf0d76216","sha256:63639fc0ef0a62ee3bf0070da76b7eb7df0f31f22ad3f7590db43f8798824f0c"],"state_sha256":"a2190ba42606f814141c8cb0daa184075d099000acf06a7929a64f011d7664e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8p2/uyVh26s68qw2x8kCxnSvZwGNlHJP2mGfjG1b4RPvDpC8Gppm6vjVY1H8sqxV0TvvcP32kmDz1y1W6UivAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:20:33.185005Z","bundle_sha256":"e633c040753b7e4626d12221cd7505e8340c3f551cca305cfe7b8a9136d8de5e"}}