{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X6JHD4ZSRS3N6R4ACMC7LUNFKJ","short_pith_number":"pith:X6JHD4ZS","schema_version":"1.0","canonical_sha256":"bf9271f3328cb6df47801305f5d1a5524b7dbbd805936b1df45953145bcc8cbb","source":{"kind":"arxiv","id":"2503.18496","version":1},"attestation_state":"computed","paper":{"title":"Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Laura Grigori, Zhipeng Xue","submitted_at":"2025-03-24T09:52:06Z","abstract_excerpt":"We discuss a randomized strong rank-revealing QR factorization that effectively reveals the spectrum of a matrix $\\textbf{M}$. This factorization can be used to address problems such as selecting a subset of the columns of $\\textbf{M}$, computing its low-rank approximation, estimating its rank, or approximating its null space. Given a random sketching matrix $\\pmb{\\Omega}$ that satisfies the $\\epsilon$-embedding property for a subspace within the range of $\\textbf{M}$, the factorization relies on selecting columns that allow to reveal the spectrum via a deterministic strong rank-revealing QR f"},"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":"2503.18496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-03-24T09:52:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"d396baf90d088cd5a6464d43f009a335a29a73ab495f74cbb5b2719e14acb02e","abstract_canon_sha256":"7fc399da659ee5c59ab0641000b2339d8d4c1bed1ec9abc6803d12ac7d769fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:11.909573Z","signature_b64":"gEpzBLGf2zlATbSFIjczBvc27a5S+U7Q/77QmMoXXp8AeFNvaq9fhrMsF+dMaENwbVBJn30mk2OM/gF9imxFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9271f3328cb6df47801305f5d1a5524b7dbbd805936b1df45953145bcc8cbb","last_reissued_at":"2026-07-05T10:38:11.908920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:11.908920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized strong rank-revealing QR for column subset selection and low-rank matrix approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Laura Grigori, Zhipeng Xue","submitted_at":"2025-03-24T09:52:06Z","abstract_excerpt":"We discuss a randomized strong rank-revealing QR factorization that effectively reveals the spectrum of a matrix $\\textbf{M}$. This factorization can be used to address problems such as selecting a subset of the columns of $\\textbf{M}$, computing its low-rank approximation, estimating its rank, or approximating its null space. Given a random sketching matrix $\\pmb{\\Omega}$ that satisfies the $\\epsilon$-embedding property for a subspace within the range of $\\textbf{M}$, the factorization relies on selecting columns that allow to reveal the spectrum via a deterministic strong rank-revealing QR f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18496","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/2503.18496/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":"2503.18496","created_at":"2026-07-05T10:38:11.908993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.18496v1","created_at":"2026-07-05T10:38:11.908993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18496","created_at":"2026-07-05T10:38:11.908993+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6JHD4ZSRS3N","created_at":"2026-07-05T10:38:11.908993+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6JHD4ZSRS3N6R4A","created_at":"2026-07-05T10:38:11.908993+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6JHD4ZS","created_at":"2026-07-05T10:38:11.908993+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":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ","json":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ.json","graph_json":"https://pith.science/api/pith-number/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/graph.json","events_json":"https://pith.science/api/pith-number/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/events.json","paper":"https://pith.science/paper/X6JHD4ZS"},"agent_actions":{"view_html":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ","download_json":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ.json","view_paper":"https://pith.science/paper/X6JHD4ZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.18496&json=true","fetch_graph":"https://pith.science/api/pith-number/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/action/storage_attestation","attest_author":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/action/author_attestation","sign_citation":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/action/citation_signature","submit_replication":"https://pith.science/pith/X6JHD4ZSRS3N6R4ACMC7LUNFKJ/action/replication_record"}},"created_at":"2026-07-05T10:38:11.908993+00:00","updated_at":"2026-07-05T10:38:11.908993+00:00"}