{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XNJAPNZBYXTH3H2AKX4IKZLJOX","short_pith_number":"pith:XNJAPNZB","schema_version":"1.0","canonical_sha256":"bb5207b721c5e67d9f4055f885656975c3a4c89c88f6c5584c88c5db0365b131","source":{"kind":"arxiv","id":"1405.7910","version":2},"attestation_state":"computed","paper":{"title":"Optimal CUR Matrix Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, David P. Woodruff","submitted_at":"2014-05-30T16:44:06Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.7910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-30T16:44:06Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5dfcd4c8f4b105ac96822a86e16f2f536c74cd50be8b20daca67d111f128554d","abstract_canon_sha256":"b0d16eeccfaf9fd498f68ea269504a4b1005e5db0e0bd9d99ebaf6fba45dc599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:31.115230Z","signature_b64":"mQl9mjulCGnvE0nE4TErH4Oh+IQiMcmQX1L14snEIba07TDdOHZ6zuuI4hrhPe6WTV/J6jeg7RlBP7chBfpLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb5207b721c5e67d9f4055f885656975c3a4c89c88f6c5584c88c5db0365b131","last_reissued_at":"2026-05-18T02:47:31.114711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:31.114711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal CUR Matrix Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Christos Boutsidis, David P. Woodruff","submitted_at":"2014-05-30T16:44:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7910","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.7910","created_at":"2026-05-18T02:47:31.114787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7910v2","created_at":"2026-05-18T02:47:31.114787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7910","created_at":"2026-05-18T02:47:31.114787+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNJAPNZBYXTH","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNJAPNZBYXTH3H2A","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNJAPNZB","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.13971","citing_title":"Prompt2Effect: Training-Free Image-to-Video Model Specialization via LoRA Generation","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX","json":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX.json","graph_json":"https://pith.science/api/pith-number/XNJAPNZBYXTH3H2AKX4IKZLJOX/graph.json","events_json":"https://pith.science/api/pith-number/XNJAPNZBYXTH3H2AKX4IKZLJOX/events.json","paper":"https://pith.science/paper/XNJAPNZB"},"agent_actions":{"view_html":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX","download_json":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX.json","view_paper":"https://pith.science/paper/XNJAPNZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7910&json=true","fetch_graph":"https://pith.science/api/pith-number/XNJAPNZBYXTH3H2AKX4IKZLJOX/graph.json","fetch_events":"https://pith.science/api/pith-number/XNJAPNZBYXTH3H2AKX4IKZLJOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX/action/storage_attestation","attest_author":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX/action/author_attestation","sign_citation":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX/action/citation_signature","submit_replication":"https://pith.science/pith/XNJAPNZBYXTH3H2AKX4IKZLJOX/action/replication_record"}},"created_at":"2026-05-18T02:47:31.114787+00:00","updated_at":"2026-05-18T02:47:31.114787+00:00"}