{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SF7DUR37J4CYEJRCBUXVXKXLDB","short_pith_number":"pith:SF7DUR37","canonical_record":{"source":{"id":"1202.4961","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2012-02-22T16:34:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d0dfd938cac9362cce8c8b78f572b098ccdc15ea1315c632669bdb5a2114ef49","abstract_canon_sha256":"88a75bdbdad5cea11ec3bba499e093dccd7a329817cab3033afaa59deb532a45"},"schema_version":"1.0"},"canonical_sha256":"917e3a477f4f058226220d2f5baaeb187914abbe5ebde2c291c0c2b399cd7834","source":{"kind":"arxiv","id":"1202.4961","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4961","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4961v6","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4961","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"SF7DUR37J4CY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SF7DUR37J4CYEJRC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SF7DUR37","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SF7DUR37J4CYEJRCBUXVXKXLDB","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4961","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2012-02-22T16:34:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d0dfd938cac9362cce8c8b78f572b098ccdc15ea1315c632669bdb5a2114ef49","abstract_canon_sha256":"88a75bdbdad5cea11ec3bba499e093dccd7a329817cab3033afaa59deb532a45"},"schema_version":"1.0"},"canonical_sha256":"917e3a477f4f058226220d2f5baaeb187914abbe5ebde2c291c0c2b399cd7834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.061739Z","signature_b64":"vGy+EWg6jX00TGUE4gUIj6j0oEKs3ZFLNacvtrqtryO07RT92j5jCXxlNqi5vzS7APXLeObeFkHlPnnrjLEaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917e3a477f4f058226220d2f5baaeb187914abbe5ebde2c291c0c2b399cd7834","last_reissued_at":"2026-05-18T00:05:15.061175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.061175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4961","source_version":6,"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:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6JhSGxWSSHej0SB2GhypeLCtUD2XR3qS+QBGfwVPLLVt5vOO+H5Ze5mmOglPjNI4Ev5vRfkgovYlpnGNFOLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:45:32.475255Z"},"content_sha256":"493fdc97568ca4268cc19833c922e7dc6f86d44b540aee24cd616b23c8259c76","schema_version":"1.0","event_id":"sha256:493fdc97568ca4268cc19833c922e7dc6f86d44b540aee24cd616b23c8259c76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SF7DUR37J4CYEJRCBUXVXKXLDB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly universal string hashing is fast","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Daniel Lemire, Owen Kaser","submitted_at":"2012-02-22T16:34:24Z","abstract_excerpt":"We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees. Moreover, conventional wisdom is that hash functions with fewer multiplications are faster. Yet we find that they may fail to be faster due to operation pipelining. We present experimental results on several processors including low-powered processors. Our tests include hash functions designed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4961","kind":"arxiv","version":6},"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:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZcViZmrj/A0QUvt9U/isAOw74sbpRfm2+LuSRlOEFIrKJ3sfDEsqTzluedfGExf6p9kLvhTfATDbRa8+Nn/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:45:32.475618Z"},"content_sha256":"0e7dc594b6e67e154fa7bc8db4bb05b79083e351824aa26339ba563cd0f026da","schema_version":"1.0","event_id":"sha256:0e7dc594b6e67e154fa7bc8db4bb05b79083e351824aa26339ba563cd0f026da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/bundle.json","state_url":"https://pith.science/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/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-03T10:45:32Z","links":{"resolver":"https://pith.science/pith/SF7DUR37J4CYEJRCBUXVXKXLDB","bundle":"https://pith.science/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/bundle.json","state":"https://pith.science/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SF7DUR37J4CYEJRCBUXVXKXLDB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SF7DUR37J4CYEJRCBUXVXKXLDB","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":"88a75bdbdad5cea11ec3bba499e093dccd7a329817cab3033afaa59deb532a45","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2012-02-22T16:34:24Z","title_canon_sha256":"d0dfd938cac9362cce8c8b78f572b098ccdc15ea1315c632669bdb5a2114ef49"},"schema_version":"1.0","source":{"id":"1202.4961","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4961","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4961v6","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4961","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"SF7DUR37J4CY","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SF7DUR37J4CYEJRC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SF7DUR37","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:0e7dc594b6e67e154fa7bc8db4bb05b79083e351824aa26339ba563cd0f026da","target":"graph","created_at":"2026-05-18T00:05:15Z","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":"We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees. Moreover, conventional wisdom is that hash functions with fewer multiplications are faster. Yet we find that they may fail to be faster due to operation pipelining. We present experimental results on several processors including low-powered processors. Our tests include hash functions designed ","authors_text":"Daniel Lemire, Owen Kaser","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2012-02-22T16:34:24Z","title":"Strongly universal string hashing is fast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4961","kind":"arxiv","version":6},"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:493fdc97568ca4268cc19833c922e7dc6f86d44b540aee24cd616b23c8259c76","target":"record","created_at":"2026-05-18T00:05:15Z","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":"88a75bdbdad5cea11ec3bba499e093dccd7a329817cab3033afaa59deb532a45","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2012-02-22T16:34:24Z","title_canon_sha256":"d0dfd938cac9362cce8c8b78f572b098ccdc15ea1315c632669bdb5a2114ef49"},"schema_version":"1.0","source":{"id":"1202.4961","kind":"arxiv","version":6}},"canonical_sha256":"917e3a477f4f058226220d2f5baaeb187914abbe5ebde2c291c0c2b399cd7834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917e3a477f4f058226220d2f5baaeb187914abbe5ebde2c291c0c2b399cd7834","first_computed_at":"2026-05-18T00:05:15.061175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:15.061175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vGy+EWg6jX00TGUE4gUIj6j0oEKs3ZFLNacvtrqtryO07RT92j5jCXxlNqi5vzS7APXLeObeFkHlPnnrjLEaCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:15.061739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4961","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:493fdc97568ca4268cc19833c922e7dc6f86d44b540aee24cd616b23c8259c76","sha256:0e7dc594b6e67e154fa7bc8db4bb05b79083e351824aa26339ba563cd0f026da"],"state_sha256":"31eb57c18a17dc535fced82fc7c7b6d9899d790e881f3caf7ab42ae978469fc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOzBqD9rxEvQXaFlyyIrbc2JKk9qOD5g/YwrfQ1co40sPjtL0UZlhnTJ/td4jW3EApEl0rxLvCCO+YGsZx5YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:45:32.477693Z","bundle_sha256":"7bbaa395ccc61bc9f5e4fb83de6125b6ccbc2fe1855828fad318fd379dd01e9d"}}