{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GH5JH3SWTH6HUP4OFSDWIQDN5V","short_pith_number":"pith:GH5JH3SW","schema_version":"1.0","canonical_sha256":"31fa93ee5699fc7a3f8e2c8764406ded745ba31941d9bb904dded26d9d50a215","source":{"kind":"arxiv","id":"2105.11815","version":1},"attestation_state":"computed","paper":{"title":"Hashing embeddings of optimal dimension, with applications to linear least squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Coralia Cartis, Jan Fiala, Zhen Shao","submitted_at":"2021-05-25T10:35:13Z","abstract_excerpt":"The aim of this paper is two-fold: firstly, to present subspace embedding properties for $s$-hashing sketching matrices, with $s\\geq 1$, that are optimal in the projection dimension $m$ of the sketch, namely, $m=\\mathcal{O}(d)$, where $d$ is the dimension of the subspace. A diverse set of results are presented that address the case when the input matrix has sufficiently low coherence (thus removing the $\\log^2 d$ factor dependence in $m$, in the low-coherence result of Bourgain et al (2015) at the expense of a smaller coherence requirement); how this coherence changes with the number $s$ of co"},"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":"2105.11815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2021-05-25T10:35:13Z","cross_cats_sorted":["cs.NA","math.OC","stat.ML"],"title_canon_sha256":"6b1419b154a40d1a0ba3bf65da3f946e76d727b833b67f2a1c595522533507ab","abstract_canon_sha256":"95e069df03faf7be4f6118d774fedd410d4bf79b28ffd7e7efef82ee0f8ca869"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:56.833575Z","signature_b64":"SoONwXP4BPQYoAD5a5cJxlNiaQAO0wba6QkI+9cXDwpJ4d0WficAibw7xvk0nG4ZQNXPgKpAuwsQfwThnr7vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31fa93ee5699fc7a3f8e2c8764406ded745ba31941d9bb904dded26d9d50a215","last_reissued_at":"2026-07-05T02:42:56.833189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:56.833189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hashing embeddings of optimal dimension, with applications to linear least squares","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Coralia Cartis, Jan Fiala, Zhen Shao","submitted_at":"2021-05-25T10:35:13Z","abstract_excerpt":"The aim of this paper is two-fold: firstly, to present subspace embedding properties for $s$-hashing sketching matrices, with $s\\geq 1$, that are optimal in the projection dimension $m$ of the sketch, namely, $m=\\mathcal{O}(d)$, where $d$ is the dimension of the subspace. A diverse set of results are presented that address the case when the input matrix has sufficiently low coherence (thus removing the $\\log^2 d$ factor dependence in $m$, in the low-coherence result of Bourgain et al (2015) at the expense of a smaller coherence requirement); how this coherence changes with the number $s$ of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11815","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/2105.11815/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":"2105.11815","created_at":"2026-07-05T02:42:56.833255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11815v1","created_at":"2026-07-05T02:42:56.833255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11815","created_at":"2026-07-05T02:42:56.833255+00:00"},{"alias_kind":"pith_short_12","alias_value":"GH5JH3SWTH6H","created_at":"2026-07-05T02:42:56.833255+00:00"},{"alias_kind":"pith_short_16","alias_value":"GH5JH3SWTH6HUP4O","created_at":"2026-07-05T02:42:56.833255+00:00"},{"alias_kind":"pith_short_8","alias_value":"GH5JH3SW","created_at":"2026-07-05T02:42:56.833255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05065","citing_title":"Adaptive LSQR Preconditioning from One Small Sketch","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V","json":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V.json","graph_json":"https://pith.science/api/pith-number/GH5JH3SWTH6HUP4OFSDWIQDN5V/graph.json","events_json":"https://pith.science/api/pith-number/GH5JH3SWTH6HUP4OFSDWIQDN5V/events.json","paper":"https://pith.science/paper/GH5JH3SW"},"agent_actions":{"view_html":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V","download_json":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V.json","view_paper":"https://pith.science/paper/GH5JH3SW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11815&json=true","fetch_graph":"https://pith.science/api/pith-number/GH5JH3SWTH6HUP4OFSDWIQDN5V/graph.json","fetch_events":"https://pith.science/api/pith-number/GH5JH3SWTH6HUP4OFSDWIQDN5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V/action/storage_attestation","attest_author":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V/action/author_attestation","sign_citation":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V/action/citation_signature","submit_replication":"https://pith.science/pith/GH5JH3SWTH6HUP4OFSDWIQDN5V/action/replication_record"}},"created_at":"2026-07-05T02:42:56.833255+00:00","updated_at":"2026-07-05T02:42:56.833255+00:00"}