{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ZK3KXNK2HHXKUQ6K3SADQ55NN","short_pith_number":"pith:2ZK3KXNK","canonical_record":{"source":{"id":"1609.09840","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-30T18:01:25Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"163c21c53a1a70c2150531e8b547697ba21a68ee340e71b6118b55c175fe369d","abstract_canon_sha256":"8f01860ef1382a93c180eb09c9e3b704d6cb4bafe78d6ddc70c92fe26a4fe741"},"schema_version":"1.0"},"canonical_sha256":"d655b55daad1cf75521e56e401c3bd6b5ca3b9f41cb4dcf661a776d837336bd0","source":{"kind":"arxiv","id":"1609.09840","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09840","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09840v2","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09840","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"2ZK3KXNK2HHX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZK3KXNK2HHXKUQ6","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZK3KXNK","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ZK3KXNK2HHXKUQ6K3SADQ55NN","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09840","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-30T18:01:25Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"163c21c53a1a70c2150531e8b547697ba21a68ee340e71b6118b55c175fe369d","abstract_canon_sha256":"8f01860ef1382a93c180eb09c9e3b704d6cb4bafe78d6ddc70c92fe26a4fe741"},"schema_version":"1.0"},"canonical_sha256":"d655b55daad1cf75521e56e401c3bd6b5ca3b9f41cb4dcf661a776d837336bd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:29.771250Z","signature_b64":"4qLnAKcpDTkMvGMK6sRNKojQSgi9dMxlRRoMJOXGGMPc9zbgS3ueHOsDR/ZQdMvQk788v68YY10ifwf8yymIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d655b55daad1cf75521e56e401c3bd6b5ca3b9f41cb4dcf661a776d837336bd0","last_reissued_at":"2026-05-18T00:03:29.770769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:29.770769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09840","source_version":2,"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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lbJhPkAyrbcRR+jyLSbq3yol9ntxfgR/sF9pACCtFf6QI7StUSm/7ozr4/9TlQLLUIICCvec9wMfAqHT0fWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:43:11.801103Z"},"content_sha256":"6fc62dad1a0ea7fe2f0f39fcb2104fa4f85c4ef01c2e0178daf1418508fcb034","schema_version":"1.0","event_id":"sha256:6fc62dad1a0ea7fe2f0f39fcb2104fa4f85c4ef01c2e0178daf1418508fcb034"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ZK3KXNK2HHXKUQ6K3SADQ55NN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regular and almost universal hashing: an efficient implementation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Daniel Lemire, Dmytro Ivanchykhin, Sergey Ignatchenko","submitted_at":"2016-09-30T18:01:25Z","abstract_excerpt":"Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. However, universality fails to ensure that all hash functions are well behaved. We further require regularity: when picking data objects at random they should have a low probability of having the same hash value, for any fixed hash function. We present the efficient implementatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09840","kind":"arxiv","version":2},"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:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crCNo+IsfrvhBX4ynsWkb0maWRTEdKChkADJljzJZLQbbCnNYR4P2uuL9PjsIp5b7PvOwSGZyQM/oS4ua357BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:43:11.801481Z"},"content_sha256":"e85568d4af60f3d10169cd4b5bc8ff3acb235ed1ac81f233701ea692c5baf986","schema_version":"1.0","event_id":"sha256:e85568d4af60f3d10169cd4b5bc8ff3acb235ed1ac81f233701ea692c5baf986"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/bundle.json","state_url":"https://pith.science/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/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-05-26T19:43:11Z","links":{"resolver":"https://pith.science/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN","bundle":"https://pith.science/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/bundle.json","state":"https://pith.science/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZK3KXNK2HHXKUQ6K3SADQ55NN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ZK3KXNK2HHXKUQ6K3SADQ55NN","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":"8f01860ef1382a93c180eb09c9e3b704d6cb4bafe78d6ddc70c92fe26a4fe741","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-30T18:01:25Z","title_canon_sha256":"163c21c53a1a70c2150531e8b547697ba21a68ee340e71b6118b55c175fe369d"},"schema_version":"1.0","source":{"id":"1609.09840","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09840","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09840v2","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09840","created_at":"2026-05-18T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"2ZK3KXNK2HHX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ZK3KXNK2HHXKUQ6","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ZK3KXNK","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:e85568d4af60f3d10169cd4b5bc8ff3acb235ed1ac81f233701ea692c5baf986","target":"graph","created_at":"2026-05-18T00:03:29Z","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":"Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. However, universality fails to ensure that all hash functions are well behaved. We further require regularity: when picking data objects at random they should have a low probability of having the same hash value, for any fixed hash function. We present the efficient implementatio","authors_text":"Daniel Lemire, Dmytro Ivanchykhin, Sergey Ignatchenko","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-30T18:01:25Z","title":"Regular and almost universal hashing: an efficient implementation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09840","kind":"arxiv","version":2},"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:6fc62dad1a0ea7fe2f0f39fcb2104fa4f85c4ef01c2e0178daf1418508fcb034","target":"record","created_at":"2026-05-18T00:03:29Z","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":"8f01860ef1382a93c180eb09c9e3b704d6cb4bafe78d6ddc70c92fe26a4fe741","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-30T18:01:25Z","title_canon_sha256":"163c21c53a1a70c2150531e8b547697ba21a68ee340e71b6118b55c175fe369d"},"schema_version":"1.0","source":{"id":"1609.09840","kind":"arxiv","version":2}},"canonical_sha256":"d655b55daad1cf75521e56e401c3bd6b5ca3b9f41cb4dcf661a776d837336bd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d655b55daad1cf75521e56e401c3bd6b5ca3b9f41cb4dcf661a776d837336bd0","first_computed_at":"2026-05-18T00:03:29.770769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:29.770769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4qLnAKcpDTkMvGMK6sRNKojQSgi9dMxlRRoMJOXGGMPc9zbgS3ueHOsDR/ZQdMvQk788v68YY10ifwf8yymIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:29.771250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09840","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fc62dad1a0ea7fe2f0f39fcb2104fa4f85c4ef01c2e0178daf1418508fcb034","sha256:e85568d4af60f3d10169cd4b5bc8ff3acb235ed1ac81f233701ea692c5baf986"],"state_sha256":"0a1d962f9d445249e9de3cafd3747d8a237383f5560fc02cb4f69c7fa4fdb904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rD9nZATcsEyvque9PQ18ANEUjaMEng331InIcq58mLu0TVmaLdDE1QSVeFSJt/ahldacyTRWuIAszAMeJD+jBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:43:11.803953Z","bundle_sha256":"44e0a015946cabcfc5dcdae93ec9209ec147d11e91a5877afa0b792943c75487"}}