{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7QQTYC2NM3DPORTERTRIT4LNXX","short_pith_number":"pith:7QQTYC2N","canonical_record":{"source":{"id":"1204.4431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-19T18:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"f14dff8dc6587694ec06f3a80feb006e0342f2fce04447ad55714bb762202be1","abstract_canon_sha256":"aed881feb36b994969b25382807e84fffc63e8cb9520ce727e1940e07a2630e2"},"schema_version":"1.0"},"canonical_sha256":"fc213c0b4d66c6f746648ce289f16dbded14be0ad651a099b43bfb8bc331883e","source":{"kind":"arxiv","id":"1204.4431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4431","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4431v1","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4431","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"7QQTYC2NM3DP","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7QQTYC2NM3DPORTE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7QQTYC2N","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7QQTYC2NM3DPORTERTRIT4LNXX","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-19T18:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"f14dff8dc6587694ec06f3a80feb006e0342f2fce04447ad55714bb762202be1","abstract_canon_sha256":"aed881feb36b994969b25382807e84fffc63e8cb9520ce727e1940e07a2630e2"},"schema_version":"1.0"},"canonical_sha256":"fc213c0b4d66c6f746648ce289f16dbded14be0ad651a099b43bfb8bc331883e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:27.539383Z","signature_b64":"Vkd+svqsWtOG6YpIvP85Vj8Xq+TWH0bwcbhkcPklO5QRBkYXgByVikdcKTyi6bKI2gogQ2h7SXOfAAKZ28/ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc213c0b4d66c6f746648ce289f16dbded14be0ad651a099b43bfb8bc331883e","last_reissued_at":"2026-05-18T03:57:27.538679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:27.538679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4431","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-18T03:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6d1Btv5eqG0Brn2O5gjzSJKgKL+oW0BMAKoyQSiEHT8h9Hy60Rb3xnpZkd9KxDwjDGys+puXY+vf3d1lcRvnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:27:06.820505Z"},"content_sha256":"ec79c1706a0b75b4caf88c35a8055baaaf874a50a9bd7ba23fb877e5cd6d8385","schema_version":"1.0","event_id":"sha256:ec79c1706a0b75b4caf88c35a8055baaaf874a50a9bd7ba23fb877e5cd6d8385"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7QQTYC2NM3DPORTERTRIT4LNXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Philipp Woelfel","submitted_at":"2012-04-19T18:40:58Z","abstract_excerpt":"It is shown that for cuckoo hashing with a stash as proposed by Kirsch, Mitzenmacher, and Wieder (2008) families of very simple hash functions can be used, maintaining the favorable performance guarantees: with stash size $s$ the probability of a rehash is $O(1/n^{s+1})$, and the evaluation time is $O(s)$. Instead of the full randomness needed for the analysis of Kirsch et al. and of Kutzelnigg (2010) (resp. $\\Theta(\\log n)$-wise independence for standard cuckoo hashing) the new approach even works with 2-wise independent hash families as building blocks. Both construction and analysis build u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4431","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-18T03:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v8Agt4TYl4KiwNDsyI1dOCIi62FqZ2EIJE2Gcqsn56Z5MFGc/dwQflkWsi0zdnE9LamS3VPaE0uqozyQ699JCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:27:06.820856Z"},"content_sha256":"6ce112916ce49bfff39a24615ea158574bdbf2807ed5014856d85596aed7c0c5","schema_version":"1.0","event_id":"sha256:6ce112916ce49bfff39a24615ea158574bdbf2807ed5014856d85596aed7c0c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QQTYC2NM3DPORTERTRIT4LNXX/bundle.json","state_url":"https://pith.science/pith/7QQTYC2NM3DPORTERTRIT4LNXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QQTYC2NM3DPORTERTRIT4LNXX/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-25T22:27:06Z","links":{"resolver":"https://pith.science/pith/7QQTYC2NM3DPORTERTRIT4LNXX","bundle":"https://pith.science/pith/7QQTYC2NM3DPORTERTRIT4LNXX/bundle.json","state":"https://pith.science/pith/7QQTYC2NM3DPORTERTRIT4LNXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QQTYC2NM3DPORTERTRIT4LNXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7QQTYC2NM3DPORTERTRIT4LNXX","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":"aed881feb36b994969b25382807e84fffc63e8cb9520ce727e1940e07a2630e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-19T18:40:58Z","title_canon_sha256":"f14dff8dc6587694ec06f3a80feb006e0342f2fce04447ad55714bb762202be1"},"schema_version":"1.0","source":{"id":"1204.4431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4431","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4431v1","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4431","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"7QQTYC2NM3DP","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7QQTYC2NM3DPORTE","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7QQTYC2N","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:6ce112916ce49bfff39a24615ea158574bdbf2807ed5014856d85596aed7c0c5","target":"graph","created_at":"2026-05-18T03:57:27Z","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":"It is shown that for cuckoo hashing with a stash as proposed by Kirsch, Mitzenmacher, and Wieder (2008) families of very simple hash functions can be used, maintaining the favorable performance guarantees: with stash size $s$ the probability of a rehash is $O(1/n^{s+1})$, and the evaluation time is $O(s)$. Instead of the full randomness needed for the analysis of Kirsch et al. and of Kutzelnigg (2010) (resp. $\\Theta(\\log n)$-wise independence for standard cuckoo hashing) the new approach even works with 2-wise independent hash families as building blocks. Both construction and analysis build u","authors_text":"Martin Aum\\\"uller, Martin Dietzfelbinger, Philipp Woelfel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-19T18:40:58Z","title":"Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4431","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:ec79c1706a0b75b4caf88c35a8055baaaf874a50a9bd7ba23fb877e5cd6d8385","target":"record","created_at":"2026-05-18T03:57:27Z","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":"aed881feb36b994969b25382807e84fffc63e8cb9520ce727e1940e07a2630e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-19T18:40:58Z","title_canon_sha256":"f14dff8dc6587694ec06f3a80feb006e0342f2fce04447ad55714bb762202be1"},"schema_version":"1.0","source":{"id":"1204.4431","kind":"arxiv","version":1}},"canonical_sha256":"fc213c0b4d66c6f746648ce289f16dbded14be0ad651a099b43bfb8bc331883e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc213c0b4d66c6f746648ce289f16dbded14be0ad651a099b43bfb8bc331883e","first_computed_at":"2026-05-18T03:57:27.538679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:27.538679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vkd+svqsWtOG6YpIvP85Vj8Xq+TWH0bwcbhkcPklO5QRBkYXgByVikdcKTyi6bKI2gogQ2h7SXOfAAKZ28/ADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:27.539383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec79c1706a0b75b4caf88c35a8055baaaf874a50a9bd7ba23fb877e5cd6d8385","sha256:6ce112916ce49bfff39a24615ea158574bdbf2807ed5014856d85596aed7c0c5"],"state_sha256":"9ac58abcd362d571398935b54714904d627fdd907a47544093bb68ffd17fab7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I19Fzlf5j5G4svckdG0AEIPjM04mqH3uPVWDy1PDiffdvvcsBdo9JflQlHkpYXbzZhBvzXkt9VVsFyuegEK8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:27:06.822844Z","bundle_sha256":"f6fe2143816f16c032bc3349f0a1513c79bb08295247aed3985a6aad63c16a5d"}}