{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IXVSU43ICXVXKAE46S3Q32S2UB","short_pith_number":"pith:IXVSU43I","schema_version":"1.0","canonical_sha256":"45eb2a736815eb75009cf4b70dea5aa07aad00f410846d0d325ce5749ba445a0","source":{"kind":"arxiv","id":"2508.14209","version":1},"attestation_state":"computed","paper":{"title":"A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","cs.PF"],"primary_cat":"math.NA","authors_text":"Andrew J. Higgins, Erik G. Boman, Ichitaro Yamazaki","submitted_at":"2025-08-19T18:59:38Z","abstract_excerpt":"Random sketching is a dimensionality reduction technique that approximately preserves norms and singular values up to some $O(1)$ distortion factor with high probability. The most popular sketches in literature are the Gaussian sketch and the subsampled randomized Hadamard transform, while the CountSketch has lower complexity. Combining two sketches, known as multisketching, offers an inexpensive means of quickly reducing the dimension of a matrix by combining a CountSketch and Gaussian sketch.\n  However, there has been little investigation into high performance CountSketch implementations. In"},"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.14209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2025-08-19T18:59:38Z","cross_cats_sorted":["cs.DC","cs.NA","cs.PF"],"title_canon_sha256":"31dae9c96d2c54f8c09d557a2587e89a2f3228c4419804eee207276136c34029","abstract_canon_sha256":"275bd7b67fe9d99686dcec6106f981a5a4602073c5223d1d3d98073419e93617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:28.096826Z","signature_b64":"IE4WKe5bf9zbhO28j70sfHedGOEkTFGHsBElufdx+ac8HSiSaEanDgfKQyMLCL00pdx3SUTbhRF3nNt568VNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45eb2a736815eb75009cf4b70dea5aa07aad00f410846d0d325ce5749ba445a0","last_reissued_at":"2026-07-05T11:56:28.096420Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:28.096420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A High Performance GPU CountSketch Implementation and Its Application to Multisketching and Least Squares Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","cs.PF"],"primary_cat":"math.NA","authors_text":"Andrew J. Higgins, Erik G. Boman, Ichitaro Yamazaki","submitted_at":"2025-08-19T18:59:38Z","abstract_excerpt":"Random sketching is a dimensionality reduction technique that approximately preserves norms and singular values up to some $O(1)$ distortion factor with high probability. The most popular sketches in literature are the Gaussian sketch and the subsampled randomized Hadamard transform, while the CountSketch has lower complexity. Combining two sketches, known as multisketching, offers an inexpensive means of quickly reducing the dimension of a matrix by combining a CountSketch and Gaussian sketch.\n  However, there has been little investigation into high performance CountSketch implementations. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14209","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.14209/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.14209","created_at":"2026-07-05T11:56:28.096475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14209v1","created_at":"2026-07-05T11:56:28.096475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14209","created_at":"2026-07-05T11:56:28.096475+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXVSU43ICXVX","created_at":"2026-07-05T11:56:28.096475+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXVSU43ICXVXKAE4","created_at":"2026-07-05T11:56:28.096475+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXVSU43I","created_at":"2026-07-05T11:56:28.096475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20195","citing_title":"Randomized Sketching is Robust to Low-Precision Rounding on GPUs","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB","json":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB.json","graph_json":"https://pith.science/api/pith-number/IXVSU43ICXVXKAE46S3Q32S2UB/graph.json","events_json":"https://pith.science/api/pith-number/IXVSU43ICXVXKAE46S3Q32S2UB/events.json","paper":"https://pith.science/paper/IXVSU43I"},"agent_actions":{"view_html":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB","download_json":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB.json","view_paper":"https://pith.science/paper/IXVSU43I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14209&json=true","fetch_graph":"https://pith.science/api/pith-number/IXVSU43ICXVXKAE46S3Q32S2UB/graph.json","fetch_events":"https://pith.science/api/pith-number/IXVSU43ICXVXKAE46S3Q32S2UB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB/action/storage_attestation","attest_author":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB/action/author_attestation","sign_citation":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB/action/citation_signature","submit_replication":"https://pith.science/pith/IXVSU43ICXVXKAE46S3Q32S2UB/action/replication_record"}},"created_at":"2026-07-05T11:56:28.096475+00:00","updated_at":"2026-07-05T11:56:28.096475+00:00"}