{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PUSVUI4AST2SCZUOADJJBHQFW3","short_pith_number":"pith:PUSVUI4A","schema_version":"1.0","canonical_sha256":"7d255a238094f521668e00d2909e05b6dd451bf500f8f165c5a3ee5d7064fde7","source":{"kind":"arxiv","id":"2508.21189","version":1},"attestation_state":"computed","paper":{"title":"Faster Linear Algebra Algorithms with Structured Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Chris Cama\\~no, Ethan N. Epperly, Joel A. Tropp, Raphael A. Meyer","submitted_at":"2025-08-28T20:02:15Z","abstract_excerpt":"To achieve the greatest possible speed, practitioners regularly implement randomized algorithms for low-rank approximation and least-squares regression with structured dimension reduction maps. Despite significant research effort, basic questions remain about the design and analysis of randomized linear algebra algorithms that employ structured random matrices.\n  This paper develops a new perspective on structured dimension reduction, based on the oblivious subspace injection (OSI) property. The OSI property is a relatively weak assumption on a random matrix that holds when the matrix preserve"},"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":"2508.21189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-28T20:02:15Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"db753edab03ffe908856a9a866b2938c1653a16d0f677d161ed8ee0977c5f67f","abstract_canon_sha256":"c4caab57b4edcec162197f2908b286acfe81ee3281a4ad69afb95f6ea5a13a98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:01:29.713498Z","signature_b64":"G1LQ1wbKQokIbzw2Gx91WRuGbf5u6rSKVco4XqBNdQR9W0RBpECQnWubF+gJn8cqdrFhVssLbanXHrXygG3YDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d255a238094f521668e00d2909e05b6dd451bf500f8f165c5a3ee5d7064fde7","last_reissued_at":"2026-07-05T12:01:29.712995Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:01:29.712995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Linear Algebra Algorithms with Structured Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Chris Cama\\~no, Ethan N. Epperly, Joel A. Tropp, Raphael A. Meyer","submitted_at":"2025-08-28T20:02:15Z","abstract_excerpt":"To achieve the greatest possible speed, practitioners regularly implement randomized algorithms for low-rank approximation and least-squares regression with structured dimension reduction maps. Despite significant research effort, basic questions remain about the design and analysis of randomized linear algebra algorithms that employ structured random matrices.\n  This paper develops a new perspective on structured dimension reduction, based on the oblivious subspace injection (OSI) property. The OSI property is a relatively weak assumption on a random matrix that holds when the matrix preserve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21189","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/2508.21189/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":"2508.21189","created_at":"2026-07-05T12:01:29.713057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21189v1","created_at":"2026-07-05T12:01:29.713057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21189","created_at":"2026-07-05T12:01:29.713057+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUSVUI4AST2S","created_at":"2026-07-05T12:01:29.713057+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUSVUI4AST2SCZUO","created_at":"2026-07-05T12:01:29.713057+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUSVUI4A","created_at":"2026-07-05T12:01:29.713057+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05384","citing_title":"Well-invertible column subsets of sparse matrices are rare","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20195","citing_title":"Randomized Sketching is Robust to Low-Precision Rounding on GPUs","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19096","citing_title":"Sharp analysis of sketched least squares and randomized low-rank approximation","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10215","citing_title":"Oblivious Subspace Injection Is Not Enough for Relative Error","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3","json":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3.json","graph_json":"https://pith.science/api/pith-number/PUSVUI4AST2SCZUOADJJBHQFW3/graph.json","events_json":"https://pith.science/api/pith-number/PUSVUI4AST2SCZUOADJJBHQFW3/events.json","paper":"https://pith.science/paper/PUSVUI4A"},"agent_actions":{"view_html":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3","download_json":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3.json","view_paper":"https://pith.science/paper/PUSVUI4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21189&json=true","fetch_graph":"https://pith.science/api/pith-number/PUSVUI4AST2SCZUOADJJBHQFW3/graph.json","fetch_events":"https://pith.science/api/pith-number/PUSVUI4AST2SCZUOADJJBHQFW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3/action/storage_attestation","attest_author":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3/action/author_attestation","sign_citation":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3/action/citation_signature","submit_replication":"https://pith.science/pith/PUSVUI4AST2SCZUOADJJBHQFW3/action/replication_record"}},"created_at":"2026-07-05T12:01:29.713057+00:00","updated_at":"2026-07-05T12:01:29.713057+00:00"}