{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XNJAPNZBYXTH3H2AKX4IKZLJOX","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":"b0d16eeccfaf9fd498f68ea269504a4b1005e5db0e0bd9d99ebaf6fba45dc599","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-30T16:44:06Z","title_canon_sha256":"5dfcd4c8f4b105ac96822a86e16f2f536c74cd50be8b20daca67d111f128554d"},"schema_version":"1.0","source":{"id":"1405.7910","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7910","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7910v2","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7910","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"XNJAPNZBYXTH","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XNJAPNZBYXTH3H2A","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XNJAPNZB","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:95b20416a760ed3a9b426b382473537a38d53d267ce2d86985f337b380005f30","target":"graph","created_at":"2026-05-18T02:47:31Z","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":"The CUR decomposition of an $m \\times n$ matrix $A$ finds an $m \\times c$ matrix $C$ with a subset of $c < n$ columns of $A,$ together with an $r \\times n$ matrix $R$ with a subset of $r < m$ rows of $A,$ as well as a $c \\times r$ low-rank matrix $U$ such that the matrix $C U R$ approximates the matrix $A,$ that is, $ || A - CUR ||_F^2 \\le (1+\\epsilon) || A - A_k||_F^2$, where $||.||_F$ denotes the Frobenius norm and $A_k$ is the best $m \\times n$ matrix of rank $k$ constructed via the SVD. We present input-sparsity-time and deterministic algorithms for constructing such a CUR decomposition wh","authors_text":"Christos Boutsidis, David P. Woodruff","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-30T16:44:06Z","title":"Optimal CUR Matrix Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7910","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:38c711596e5ea4dfebe15ac0dfc6f24f336b23c86b0183d073dba70f0aa7a9a6","target":"record","created_at":"2026-05-18T02:47:31Z","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":"b0d16eeccfaf9fd498f68ea269504a4b1005e5db0e0bd9d99ebaf6fba45dc599","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-30T16:44:06Z","title_canon_sha256":"5dfcd4c8f4b105ac96822a86e16f2f536c74cd50be8b20daca67d111f128554d"},"schema_version":"1.0","source":{"id":"1405.7910","kind":"arxiv","version":2}},"canonical_sha256":"bb5207b721c5e67d9f4055f885656975c3a4c89c88f6c5584c88c5db0365b131","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb5207b721c5e67d9f4055f885656975c3a4c89c88f6c5584c88c5db0365b131","first_computed_at":"2026-05-18T02:47:31.114711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:31.114711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mQl9mjulCGnvE0nE4TErH4Oh+IQiMcmQX1L14snEIba07TDdOHZ6zuuI4hrhPe6WTV/J6jeg7RlBP7chBfpLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:31.115230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7910","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38c711596e5ea4dfebe15ac0dfc6f24f336b23c86b0183d073dba70f0aa7a9a6","sha256:95b20416a760ed3a9b426b382473537a38d53d267ce2d86985f337b380005f30"],"state_sha256":"ec67e692fc1cbec30afe3720b8a05d74c54b4e81e562c32e5d1b02883090f3be"}