{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:33EPPU2ZOMZ6DZ2EUHJXDNEGDU","short_pith_number":"pith:33EPPU2Z","schema_version":"1.0","canonical_sha256":"dec8f7d3597333e1e744a1d371b4861d3ab710ea9f7101e177daba0bb765e4f8","source":{"kind":"arxiv","id":"1104.5111","version":1},"attestation_state":"computed","paper":{"title":"Cuckoo Hashing with Pages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink","submitted_at":"2011-04-27T10:32:34Z","abstract_excerpt":"Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimen"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1104.5111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-27T10:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"dab515b6428e533c7ce09d50bfc247e05c42ccfad3df0cf7a44b37814eea5f54","abstract_canon_sha256":"85cb82185088e535c68fe53236b7c2b47474105a5c0110eb25709d6084ee6d9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.617506Z","signature_b64":"NiQKn2FvIQfZqmEsC8RQ6gZQPYld2FG2mliMJAnFQGdP737fzG97BrwsZuDQB8OfC7H8RNmUuPX6gVsWG9zhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dec8f7d3597333e1e744a1d371b4861d3ab710ea9f7101e177daba0bb765e4f8","last_reissued_at":"2026-05-18T04:23:22.616934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.616934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cuckoo Hashing with Pages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink","submitted_at":"2011-04-27T10:32:34Z","abstract_excerpt":"Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are expensive, cuckoo hashing becomes a less compelling alternative. One such standard setting is when memory is arranged in large pages, and a major cost is the number of page accesses. We propose the study of cuckoo hashing with pages, advocating approaches where each key has several possible locations, or cells, on a single page, and additional choices on a second backup page. We show experimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5111","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.5111","created_at":"2026-05-18T04:23:22.617025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5111v1","created_at":"2026-05-18T04:23:22.617025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5111","created_at":"2026-05-18T04:23:22.617025+00:00"},{"alias_kind":"pith_short_12","alias_value":"33EPPU2ZOMZ6","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"33EPPU2ZOMZ6DZ2E","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"33EPPU2Z","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU","json":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU.json","graph_json":"https://pith.science/api/pith-number/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/graph.json","events_json":"https://pith.science/api/pith-number/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/events.json","paper":"https://pith.science/paper/33EPPU2Z"},"agent_actions":{"view_html":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU","download_json":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU.json","view_paper":"https://pith.science/paper/33EPPU2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5111&json=true","fetch_graph":"https://pith.science/api/pith-number/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/graph.json","fetch_events":"https://pith.science/api/pith-number/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/action/storage_attestation","attest_author":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/action/author_attestation","sign_citation":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/action/citation_signature","submit_replication":"https://pith.science/pith/33EPPU2ZOMZ6DZ2EUHJXDNEGDU/action/replication_record"}},"created_at":"2026-05-18T04:23:22.617025+00:00","updated_at":"2026-05-18T04:23:22.617025+00:00"}