{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PH3C2NB2JQGASUPZNV3OEHJMAK","short_pith_number":"pith:PH3C2NB2","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"},"canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","source":{"kind":"arxiv","id":"1805.08539","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08539","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08539v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08539","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"PH3C2NB2JQGA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PH3C2NB2JQGASUPZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PH3C2NB2","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PH3C2NB2JQGASUPZNV3OEHJMAK","target":"record","payload":{"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"},"canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","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"},"source_kind":"arxiv","source_id":"1805.08539","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moe8bcNeibxPJqzQoCc3cNMLKfUjVzoH9ncO+Zqfy72PL7MCvRccKUSZ4tIRKOhlQAs8Gq7/bItlK6FheG5EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:38:39.788624Z"},"content_sha256":"e40764a6f1603ff2643c1326677664b5d86d639b75bec3c6fa072b5b280b8576","schema_version":"1.0","event_id":"sha256:e40764a6f1603ff2643c1326677664b5d86d639b75bec3c6fa072b5b280b8576"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PH3C2NB2JQGASUPZNV3OEHJMAK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WlJAzElXdX9IuUIxD8EnGyInlTIal2sG0OFowXO5IaxEmINRMlSl0OW4lWxeTiaxZrtC8lYepIJg3cI/a87iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:38:39.789259Z"},"content_sha256":"03c7d8b4ec47009d5bf218ad5398816bcd71e935d57e0818c55c6957f5ad59ca","schema_version":"1.0","event_id":"sha256:03c7d8b4ec47009d5bf218ad5398816bcd71e935d57e0818c55c6957f5ad59ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/bundle.json","state_url":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T06:38:39Z","links":{"resolver":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK","bundle":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/bundle.json","state":"https://pith.science/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH3C2NB2JQGASUPZNV3OEHJMAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PH3C2NB2JQGASUPZNV3OEHJMAK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"28e4ac0797a58c2c70266c216e5f4825c43843c7d463551f2e6cf6220698bf08","cross_cats_sorted":["cs.DS","math.FA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T12:23:47Z","title_canon_sha256":"e00861659154d6fe0dfe12371a1840bc5ff9c4cc1666b165381763e005f5ac99"},"schema_version":"1.0","source":{"id":"1805.08539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08539","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08539v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08539","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"PH3C2NB2JQGA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PH3C2NB2JQGASUPZ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PH3C2NB2","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:03c7d8b4ec47009d5bf218ad5398816bcd71e935d57e0818c55c6957f5ad59ca","target":"graph","created_at":"2026-05-18T00:15:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Casper Benjamin Freksen, Kasper Green Larsen, Lior Kamma","cross_cats":["cs.DS","math.FA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T12:23:47Z","title":"Fully Understanding the Hashing Trick"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08539","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e40764a6f1603ff2643c1326677664b5d86d639b75bec3c6fa072b5b280b8576","target":"record","created_at":"2026-05-18T00:15:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"28e4ac0797a58c2c70266c216e5f4825c43843c7d463551f2e6cf6220698bf08","cross_cats_sorted":["cs.DS","math.FA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T12:23:47Z","title_canon_sha256":"e00861659154d6fe0dfe12371a1840bc5ff9c4cc1666b165381763e005f5ac99"},"schema_version":"1.0","source":{"id":"1805.08539","kind":"arxiv","version":1}},"canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79f62d343a4c0c0951f96d76e21d2c02b79a063584f6bb068f9a75ff01304db9","first_computed_at":"2026-05-18T00:15:26.091332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:26.091332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jb+XAjGcdUhMyvOCabBteuu5HmBBH4pn8wbv6IWEXtIf1n6yJLJ0rMo1lUkOFnDl5CHutqJVmUUpSyQRda1xCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:26.092074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e40764a6f1603ff2643c1326677664b5d86d639b75bec3c6fa072b5b280b8576","sha256:03c7d8b4ec47009d5bf218ad5398816bcd71e935d57e0818c55c6957f5ad59ca"],"state_sha256":"f8a306df66b71b183da2c059e810a82e6abca80a2d7112627f802f8bf1c70688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGFvAYaxrisO2YytGLJib0zKFiHGfqZ4qXV8TjQNIwV3gA4vbyk7VZcesisMo6YTbkzP8Lh+MJFuqHdodvyBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:38:39.792862Z","bundle_sha256":"5797f545d59f2a73f399e2bfccf2dd7436657511a2546036054ce47890269020"}}