{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2UJUDAZA6BOQGSRX64W7LHAB43","short_pith_number":"pith:2UJUDAZA","canonical_record":{"source":{"id":"1810.13187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-31T09:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"243b707c186b1748924f13439bbcc629577e9e93d85496eeac3ab70d1f920c23","abstract_canon_sha256":"4c62ee56986896b898e051a10e06a2a0b73de07e89f1f297766db79a3b67bdeb"},"schema_version":"1.0"},"canonical_sha256":"d513418320f05d034a37f72df59c01e6db46bc5a1eba8991fa0f6d9f88ec160b","source":{"kind":"arxiv","id":"1810.13187","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13187","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13187v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13187","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"2UJUDAZA6BOQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UJUDAZA6BOQGSRX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UJUDAZA","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2UJUDAZA6BOQGSRX64W7LHAB43","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-31T09:53:50Z","cross_cats_sorted":[],"title_canon_sha256":"243b707c186b1748924f13439bbcc629577e9e93d85496eeac3ab70d1f920c23","abstract_canon_sha256":"4c62ee56986896b898e051a10e06a2a0b73de07e89f1f297766db79a3b67bdeb"},"schema_version":"1.0"},"canonical_sha256":"d513418320f05d034a37f72df59c01e6db46bc5a1eba8991fa0f6d9f88ec160b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.009432Z","signature_b64":"Pk59QEuBxHBhhWpXycx4RdbSt4+pRarlv7/m3vE2mD/44vNm10ptFQ5ufEyjnbGSrrfXjESEqki77CPuAMOgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d513418320f05d034a37f72df59c01e6db46bc5a1eba8991fa0f6d9f88ec160b","last_reissued_at":"2026-05-18T00:01:52.008754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.008754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13187","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eR52/LcLTRj62YM2oIXu4tVr1lgfW8sC+Whnf5hN+Yz9prhwCwn+XRMFirnc58UC82CPmdwMxBwukr/KALuQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:41:36.038751Z"},"content_sha256":"b6047a00eb2242057e8491025fe09e387d6954a74c5ea5f64ba9d9725b833978","schema_version":"1.0","event_id":"sha256:b6047a00eb2242057e8491025fe09e387d6954a74c5ea5f64ba9d9725b833978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2UJUDAZA6BOQGSRX64W7LHAB43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Empty Bins with Simple Tabulation Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Aamand, Mikkel Thorup","submitted_at":"2018-10-31T09:53:50Z","abstract_excerpt":"We consider the hashing of a set $X\\subseteq U$ with $|X|=m$ using a simple tabulation hash function $h:U\\to [n]=\\{0,\\dots,n-1\\}$ and analyse the number of non-empty bins, that is, the size of $h(X)$. We show that the expected size of $h(X)$ matches that with fully random hashing to within low-order terms. We also provide concentration bounds. The number of non-empty bins is a fundamental measure in the balls and bins paradigm, and it is critical in applications such as Bloom filters and Filter hashing. For example, normally Bloom filters are proportioned for a desired low false-positive proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13187","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6A9SmozqnSQkB++RBj3j2/X1rNgCHlj5SbxbMKI0s9/XlmOG6/9eIuQXBFnDd8cunFgK1ptStOkNybq3ScmICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:41:36.039096Z"},"content_sha256":"8f40e2218feb1877524e40c568ccfe7fba75244d9c3c8b2e93feb47fc1389bbf","schema_version":"1.0","event_id":"sha256:8f40e2218feb1877524e40c568ccfe7fba75244d9c3c8b2e93feb47fc1389bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UJUDAZA6BOQGSRX64W7LHAB43/bundle.json","state_url":"https://pith.science/pith/2UJUDAZA6BOQGSRX64W7LHAB43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UJUDAZA6BOQGSRX64W7LHAB43/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-27T07:41:36Z","links":{"resolver":"https://pith.science/pith/2UJUDAZA6BOQGSRX64W7LHAB43","bundle":"https://pith.science/pith/2UJUDAZA6BOQGSRX64W7LHAB43/bundle.json","state":"https://pith.science/pith/2UJUDAZA6BOQGSRX64W7LHAB43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UJUDAZA6BOQGSRX64W7LHAB43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2UJUDAZA6BOQGSRX64W7LHAB43","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":"4c62ee56986896b898e051a10e06a2a0b73de07e89f1f297766db79a3b67bdeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-31T09:53:50Z","title_canon_sha256":"243b707c186b1748924f13439bbcc629577e9e93d85496eeac3ab70d1f920c23"},"schema_version":"1.0","source":{"id":"1810.13187","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13187","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13187v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13187","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"2UJUDAZA6BOQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2UJUDAZA6BOQGSRX","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2UJUDAZA","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:8f40e2218feb1877524e40c568ccfe7fba75244d9c3c8b2e93feb47fc1389bbf","target":"graph","created_at":"2026-05-18T00:01:52Z","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 consider the hashing of a set $X\\subseteq U$ with $|X|=m$ using a simple tabulation hash function $h:U\\to [n]=\\{0,\\dots,n-1\\}$ and analyse the number of non-empty bins, that is, the size of $h(X)$. We show that the expected size of $h(X)$ matches that with fully random hashing to within low-order terms. We also provide concentration bounds. The number of non-empty bins is a fundamental measure in the balls and bins paradigm, and it is critical in applications such as Bloom filters and Filter hashing. For example, normally Bloom filters are proportioned for a desired low false-positive proba","authors_text":"Anders Aamand, Mikkel Thorup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-31T09:53:50Z","title":"Non-Empty Bins with Simple Tabulation Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13187","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:b6047a00eb2242057e8491025fe09e387d6954a74c5ea5f64ba9d9725b833978","target":"record","created_at":"2026-05-18T00:01:52Z","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":"4c62ee56986896b898e051a10e06a2a0b73de07e89f1f297766db79a3b67bdeb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-31T09:53:50Z","title_canon_sha256":"243b707c186b1748924f13439bbcc629577e9e93d85496eeac3ab70d1f920c23"},"schema_version":"1.0","source":{"id":"1810.13187","kind":"arxiv","version":1}},"canonical_sha256":"d513418320f05d034a37f72df59c01e6db46bc5a1eba8991fa0f6d9f88ec160b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d513418320f05d034a37f72df59c01e6db46bc5a1eba8991fa0f6d9f88ec160b","first_computed_at":"2026-05-18T00:01:52.008754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.008754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pk59QEuBxHBhhWpXycx4RdbSt4+pRarlv7/m3vE2mD/44vNm10ptFQ5ufEyjnbGSrrfXjESEqki77CPuAMOgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.009432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13187","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6047a00eb2242057e8491025fe09e387d6954a74c5ea5f64ba9d9725b833978","sha256:8f40e2218feb1877524e40c568ccfe7fba75244d9c3c8b2e93feb47fc1389bbf"],"state_sha256":"03de4b9a9a9bb81ba26ae5f64cd687545eb30ef7c9f947c20c483f3d491b6d61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrwyJgl9rOXwJHKbDE5kbkjw1k8oJqomN8QztlIp8l1LOhnJ9wSqYh95XcITl6gdvOhEv5FhRRvlkVCBfk1KCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:41:36.041024Z","bundle_sha256":"e1984cd95949ac877b6ea58bdcef439e71e4912831c1f27f5a102168ef89f0b1"}}