{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PH3C2NB2JQGASUPZNV3OEHJMAK","short_pith_number":"pith:PH3C2NB2","schema_version":"1.0","canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","source":{"kind":"arxiv","id":"1805.08539","version":1},"attestation_state":"computed","paper":{"title":"Fully Understanding the Hashing Trick","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma","submitted_at":"2018-05-22T12:23:47Z","abstract_excerpt":"Feature hashing, also known as {\\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely speaking, feature hashing uses a random sparse projection matrix $A : \\mathbb{R}^n \\to \\mathbb{R}^m$ (where $m \\ll n$) in order to reduce the dimension of the data from $n$ to $m$ while approximately preserving the Euclidean norm. Every column of $A$ contains exactly one non-zero entry, equals to either $-1$ or $1$.\n  Weinberger et al. showed tail bounds on $\\|Ax\\|_2^2$. Specifically they showed that for every $\\var"},"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":"1805.08539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T12:23:47Z","cross_cats_sorted":["cs.DS","math.FA","stat.ML"],"title_canon_sha256":"e00861659154d6fe0dfe12371a1840bc5ff9c4cc1666b165381763e005f5ac99","abstract_canon_sha256":"28e4ac0797a58c2c70266c216e5f4825c43843c7d463551f2e6cf6220698bf08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:26.092074Z","signature_b64":"jb+XAjGcdUhMyvOCabBteuu5HmBBH4pn8wbv6IWEXtIf1n6yJLJ0rMo1lUkOFnDl5CHutqJVmUUpSyQRda1xCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","last_reissued_at":"2026-05-18T00:15:26.091332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:26.091332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Understanding the Hashing Trick","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma","submitted_at":"2018-05-22T12:23:47Z","abstract_excerpt":"Feature hashing, also known as {\\em the hashing trick}, introduced by Weinberger et al. (2009), is one of the key techniques used in scaling-up machine learning algorithms. Loosely speaking, feature hashing uses a random sparse projection matrix $A : \\mathbb{R}^n \\to \\mathbb{R}^m$ (where $m \\ll n$) in order to reduce the dimension of the data from $n$ to $m$ while approximately preserving the Euclidean norm. Every column of $A$ contains exactly one non-zero entry, equals to either $-1$ or $1$.\n  Weinberger et al. showed tail bounds on $\\|Ax\\|_2^2$. Specifically they showed that for every $\\var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08539","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":""},"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":"1805.08539","created_at":"2026-05-18T00:15:26.091455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08539v1","created_at":"2026-05-18T00:15:26.091455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08539","created_at":"2026-05-18T00:15:26.091455+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH3C2NB2JQGA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH3C2NB2JQGASUPZ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH3C2NB2","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK","json":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK.json","graph_json":"https://pith.science/api/pith-number/PH3C2NB2JQGASUPZNV3OEHJMAK/graph.json","events_json":"https://pith.science/api/pith-number/PH3C2NB2JQGASUPZNV3OEHJMAK/events.json","paper":"https://pith.science/paper/PH3C2NB2"},"agent_actions":{"view_html":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK","download_json":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK.json","view_paper":"https://pith.science/paper/PH3C2NB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08539&json=true","fetch_graph":"https://pith.science/api/pith-number/PH3C2NB2JQGASUPZNV3OEHJMAK/graph.json","fetch_events":"https://pith.science/api/pith-number/PH3C2NB2JQGASUPZNV3OEHJMAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/action/storage_attestation","attest_author":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/action/author_attestation","sign_citation":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/action/citation_signature","submit_replication":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/action/replication_record"}},"created_at":"2026-05-18T00:15:26.091455+00:00","updated_at":"2026-05-18T00:15:26.091455+00:00"}