{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5GRIMGFNUMPGW53H46IIGOHCLJ","short_pith_number":"pith:5GRIMGFN","schema_version":"1.0","canonical_sha256":"e9a28618ada31e6b7767e7908338e25a66d8e91c24a7c963ee567ec144446281","source":{"kind":"arxiv","id":"2509.03198","version":2},"attestation_state":"computed","paper":{"title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Israa Fakih, Laura Grigori","submitted_at":"2025-09-03T10:34:28Z","abstract_excerpt":"In this paper, we introduce an efficient algorithm for column subset selection that combines the column-pivoted QR factorization with sparse subspace embeddings. The proposed method, SE-QRSC, is particularly effective for wide matrices with significantly more columns than rows. Starting from a matrix $A$, the algorithm selects $k$ columns from the sketched matrix $B = A \\Omega^T$, where $\\Omega$ is a sparse subspace embedding of $\\mathrm{range}(A^T)$. The sparsity structure of $\\Omega$ is then exploited to map the selected pivots back to the corresponding columns of $A$, which are then used to"},"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":"2509.03198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-09-03T10:34:28Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ddd9c38cc34f54b7d11b4e60778620df2d80d9980c596a584b0103367cfe777b","abstract_canon_sha256":"cfbb57c844f3c2ba4e84a071362335cf38c8cf7ac8a833a570ca60788a88adf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:41.424774Z","signature_b64":"dFoUb/1lB0w9HCUdPfCq24A1+uneA84IxN/HR4VtnT0rFNm4IMekVykVUKTbaeWSijU1pu9GR6NvOJPAyvOLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a28618ada31e6b7767e7908338e25a66d8e91c24a7c963ee567ec144446281","last_reissued_at":"2026-07-05T12:04:41.424366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:41.424366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient QR-based Column Subset Selection through Randomized Sparse Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Israa Fakih, Laura Grigori","submitted_at":"2025-09-03T10:34:28Z","abstract_excerpt":"In this paper, we introduce an efficient algorithm for column subset selection that combines the column-pivoted QR factorization with sparse subspace embeddings. The proposed method, SE-QRSC, is particularly effective for wide matrices with significantly more columns than rows. Starting from a matrix $A$, the algorithm selects $k$ columns from the sketched matrix $B = A \\Omega^T$, where $\\Omega$ is a sparse subspace embedding of $\\mathrm{range}(A^T)$. The sparsity structure of $\\Omega$ is then exploited to map the selected pivots back to the corresponding columns of $A$, which are then used to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03198","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.03198/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":"2509.03198","created_at":"2026-07-05T12:04:41.424422+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.03198v2","created_at":"2026-07-05T12:04:41.424422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03198","created_at":"2026-07-05T12:04:41.424422+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GRIMGFNUMPG","created_at":"2026-07-05T12:04:41.424422+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GRIMGFNUMPGW53H","created_at":"2026-07-05T12:04:41.424422+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GRIMGFN","created_at":"2026-07-05T12:04:41.424422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ","json":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ.json","graph_json":"https://pith.science/api/pith-number/5GRIMGFNUMPGW53H46IIGOHCLJ/graph.json","events_json":"https://pith.science/api/pith-number/5GRIMGFNUMPGW53H46IIGOHCLJ/events.json","paper":"https://pith.science/paper/5GRIMGFN"},"agent_actions":{"view_html":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ","download_json":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ.json","view_paper":"https://pith.science/paper/5GRIMGFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.03198&json=true","fetch_graph":"https://pith.science/api/pith-number/5GRIMGFNUMPGW53H46IIGOHCLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5GRIMGFNUMPGW53H46IIGOHCLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ/action/storage_attestation","attest_author":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ/action/author_attestation","sign_citation":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ/action/citation_signature","submit_replication":"https://pith.science/pith/5GRIMGFNUMPGW53H46IIGOHCLJ/action/replication_record"}},"created_at":"2026-07-05T12:04:41.424422+00:00","updated_at":"2026-07-05T12:04:41.424422+00:00"}