{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:35NHARPYWHZHZZJ7AC7QA5BSRN","short_pith_number":"pith:35NHARPY","schema_version":"1.0","canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","source":{"kind":"arxiv","id":"2402.13975","version":1},"attestation_state":"computed","paper":{"title":"A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Lexing Ying","submitted_at":"2024-02-21T18:01:14Z","abstract_excerpt":"In this work, we analyze a sublinear-time algorithm for selecting a few rows and columns of a matrix for low-rank approximation purposes. The algorithm is based on an initial uniformly random selection of rows and columns, followed by a refinement of this choice using a strong rank-revealing QR factorization. We prove bounds on the error of the corresponding low-rank approximation (more precisely, the CUR approximation error) when the matrix is a perturbation of a low-rank matrix that can be factorized into the product of matrices with suitable incoherence and/or sparsity assumptions."},"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":"2402.13975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-02-21T18:01:14Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c351a4a7c64b4be2b170dc6cc86236de91615ec30cbbf28bf3c5939df9cf5d8c","abstract_canon_sha256":"663f17bdb249c8c3f7445b2c5c47acbd5e10502cefe939a496520383e5d5b5d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:50.920627Z","signature_b64":"k6VZwaO+jtEx9l0oCZ2rRZFtlxKKwSmGlEZ16suv/vIr7EBj82KbJOItZDW8X/6Mjx0qicFNtvQhV4ig66FhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5a7045f8b1f27ce53f00bf0074328b57181241118a5c655c6102229391ae29","last_reissued_at":"2026-07-05T07:47:50.920160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:50.920160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sublinear-time randomized algorithm for column and row subset selection based on strong rank-revealing QR factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alice Cortinovis, Lexing Ying","submitted_at":"2024-02-21T18:01:14Z","abstract_excerpt":"In this work, we analyze a sublinear-time algorithm for selecting a few rows and columns of a matrix for low-rank approximation purposes. The algorithm is based on an initial uniformly random selection of rows and columns, followed by a refinement of this choice using a strong rank-revealing QR factorization. We prove bounds on the error of the corresponding low-rank approximation (more precisely, the CUR approximation error) when the matrix is a perturbation of a low-rank matrix that can be factorized into the product of matrices with suitable incoherence and/or sparsity assumptions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13975","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/2402.13975/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.13975","created_at":"2026-07-05T07:47:50.920213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13975v1","created_at":"2026-07-05T07:47:50.920213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13975","created_at":"2026-07-05T07:47:50.920213+00:00"},{"alias_kind":"pith_short_12","alias_value":"35NHARPYWHZH","created_at":"2026-07-05T07:47:50.920213+00:00"},{"alias_kind":"pith_short_16","alias_value":"35NHARPYWHZHZZJ7","created_at":"2026-07-05T07:47:50.920213+00:00"},{"alias_kind":"pith_short_8","alias_value":"35NHARPY","created_at":"2026-07-05T07:47:50.920213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17963","citing_title":"A Semi-Lagrangian Adaptive-Rank (SLAR) Method for Linear Advection and Nonlinear Vlasov-Poisson System","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN","json":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN.json","graph_json":"https://pith.science/api/pith-number/35NHARPYWHZHZZJ7AC7QA5BSRN/graph.json","events_json":"https://pith.science/api/pith-number/35NHARPYWHZHZZJ7AC7QA5BSRN/events.json","paper":"https://pith.science/paper/35NHARPY"},"agent_actions":{"view_html":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN","download_json":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN.json","view_paper":"https://pith.science/paper/35NHARPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13975&json=true","fetch_graph":"https://pith.science/api/pith-number/35NHARPYWHZHZZJ7AC7QA5BSRN/graph.json","fetch_events":"https://pith.science/api/pith-number/35NHARPYWHZHZZJ7AC7QA5BSRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/action/storage_attestation","attest_author":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/action/author_attestation","sign_citation":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/action/citation_signature","submit_replication":"https://pith.science/pith/35NHARPYWHZHZZJ7AC7QA5BSRN/action/replication_record"}},"created_at":"2026-07-05T07:47:50.920213+00:00","updated_at":"2026-07-05T07:47:50.920213+00:00"}