{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4GVCFSXXY4ZKFYUMBTPEOYENOS","short_pith_number":"pith:4GVCFSXX","schema_version":"1.0","canonical_sha256":"e1aa22caf7c732a2e28c0cde47608d74a94e62904fc5268063490f25bc8592c3","source":{"kind":"arxiv","id":"2501.18035","version":1},"attestation_state":"computed","paper":{"title":"Collect, Commit, Expand: Efficient CPQR-Based Column Selection for Extremely Wide Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anil Damle, Robin Armstrong","submitted_at":"2025-01-29T22:50:51Z","abstract_excerpt":"Column-pivoted QR (CPQR) factorization is a computational primitive used in numerous applications that require selecting a small set of ``representative'' columns from a much larger matrix. These include applications in spectral clustering, model-order reduction, low-rank approximation, and computational quantum chemistry, where the matrix being factorized has a moderate number of rows but an extremely large number of columns. We describe a modification of the Golub-Businger algorithm which, for many matrices of this type, can perform CPQR-based column selection much more efficiently. This alg"},"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":"2501.18035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-01-29T22:50:51Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6d5287ab333a7dbe64eba3b1b0c629df1046da8a4d1a5bf7e0e6ff6e52d30614","abstract_canon_sha256":"c006d968888377790d4dd6b6713960635ea12cbde43413d7281740ccb56a34c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:06.159991Z","signature_b64":"6bBeUptSKIFuzGJFScvrLuLQV+YDlaLT4hAQe5HLaB1F2CZR+pTumHV3dhMJvhDlHLQk23W6drUssT6LQ7Y3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1aa22caf7c732a2e28c0cde47608d74a94e62904fc5268063490f25bc8592c3","last_reissued_at":"2026-07-05T10:07:06.159523Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:06.159523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collect, Commit, Expand: Efficient CPQR-Based Column Selection for Extremely Wide Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anil Damle, Robin Armstrong","submitted_at":"2025-01-29T22:50:51Z","abstract_excerpt":"Column-pivoted QR (CPQR) factorization is a computational primitive used in numerous applications that require selecting a small set of ``representative'' columns from a much larger matrix. These include applications in spectral clustering, model-order reduction, low-rank approximation, and computational quantum chemistry, where the matrix being factorized has a moderate number of rows but an extremely large number of columns. We describe a modification of the Golub-Businger algorithm which, for many matrices of this type, can perform CPQR-based column selection much more efficiently. This alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18035","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/2501.18035/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":"2501.18035","created_at":"2026-07-05T10:07:06.159581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18035v1","created_at":"2026-07-05T10:07:06.159581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18035","created_at":"2026-07-05T10:07:06.159581+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GVCFSXXY4ZK","created_at":"2026-07-05T10:07:06.159581+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GVCFSXXY4ZKFYUM","created_at":"2026-07-05T10:07:06.159581+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GVCFSXX","created_at":"2026-07-05T10:07:06.159581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.02740","citing_title":"Many (most?) column subset selection criteria are NP hard for a few columns","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS","json":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS.json","graph_json":"https://pith.science/api/pith-number/4GVCFSXXY4ZKFYUMBTPEOYENOS/graph.json","events_json":"https://pith.science/api/pith-number/4GVCFSXXY4ZKFYUMBTPEOYENOS/events.json","paper":"https://pith.science/paper/4GVCFSXX"},"agent_actions":{"view_html":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS","download_json":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS.json","view_paper":"https://pith.science/paper/4GVCFSXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18035&json=true","fetch_graph":"https://pith.science/api/pith-number/4GVCFSXXY4ZKFYUMBTPEOYENOS/graph.json","fetch_events":"https://pith.science/api/pith-number/4GVCFSXXY4ZKFYUMBTPEOYENOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS/action/storage_attestation","attest_author":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS/action/author_attestation","sign_citation":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS/action/citation_signature","submit_replication":"https://pith.science/pith/4GVCFSXXY4ZKFYUMBTPEOYENOS/action/replication_record"}},"created_at":"2026-07-05T10:07:06.159581+00:00","updated_at":"2026-07-05T10:07:06.159581+00:00"}