{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NIQPIXGBCK7FMXRK67KFJHRMIN","short_pith_number":"pith:NIQPIXGB","schema_version":"1.0","canonical_sha256":"6a20f45cc112be565e2af7d4549e2c4365bd414ccf764ee2ebd68cc39b81575b","source":{"kind":"arxiv","id":"1104.5400","version":3},"attestation_state":"computed","paper":{"title":"A cuckoo hashing variant with improved memory utilization and insertion time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bar Shalem, Ely Porat","submitted_at":"2011-04-28T14:18:26Z","abstract_excerpt":"Cuckoo hashing [4] is a multiple choice hashing scheme in which each item can be placed in multiple locations, and collisions are resolved by moving items to their alternative locations. In the classical implementation of two-way cuckoo hashing, the memory is partitioned into contiguous disjoint fixed-size buckets. Each item is hashed to two buckets, and may be stored in any of the positions within those buckets. Ref. [2] analyzed a variation in which the buckets are contiguous and overlap. However, many systems retrieve data from secondary storage in same-size blocks called pages. Fetching a "},"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.5400","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-28T14:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"04425036aa70e08f60164ea5a83f72bef314cd1aba62da851e12eaeff7699639","abstract_canon_sha256":"a7311075b40e7d68f2997ee09b96e854ec67fc3aadb1299a2876b1565e0b9805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:22.209786Z","signature_b64":"xc1dFSj2aSVpYTSNENCjMlhwaIMHG3xJkhB67LH/mrczZVSJpzvREMkm1ffHjIh9g0n/fMxQz3RqpRxpp1/6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a20f45cc112be565e2af7d4549e2c4365bd414ccf764ee2ebd68cc39b81575b","last_reissued_at":"2026-05-18T04:08:22.209189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:22.209189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A cuckoo hashing variant with improved memory utilization and insertion time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bar Shalem, Ely Porat","submitted_at":"2011-04-28T14:18:26Z","abstract_excerpt":"Cuckoo hashing [4] is a multiple choice hashing scheme in which each item can be placed in multiple locations, and collisions are resolved by moving items to their alternative locations. In the classical implementation of two-way cuckoo hashing, the memory is partitioned into contiguous disjoint fixed-size buckets. Each item is hashed to two buckets, and may be stored in any of the positions within those buckets. Ref. [2] analyzed a variation in which the buckets are contiguous and overlap. However, many systems retrieve data from secondary storage in same-size blocks called pages. Fetching a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5400","kind":"arxiv","version":3},"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.5400","created_at":"2026-05-18T04:08:22.209282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5400v3","created_at":"2026-05-18T04:08:22.209282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5400","created_at":"2026-05-18T04:08:22.209282+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIQPIXGBCK7F","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIQPIXGBCK7FMXRK","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIQPIXGB","created_at":"2026-05-18T12:26:37.096874+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/NIQPIXGBCK7FMXRK67KFJHRMIN","json":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN.json","graph_json":"https://pith.science/api/pith-number/NIQPIXGBCK7FMXRK67KFJHRMIN/graph.json","events_json":"https://pith.science/api/pith-number/NIQPIXGBCK7FMXRK67KFJHRMIN/events.json","paper":"https://pith.science/paper/NIQPIXGB"},"agent_actions":{"view_html":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN","download_json":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN.json","view_paper":"https://pith.science/paper/NIQPIXGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5400&json=true","fetch_graph":"https://pith.science/api/pith-number/NIQPIXGBCK7FMXRK67KFJHRMIN/graph.json","fetch_events":"https://pith.science/api/pith-number/NIQPIXGBCK7FMXRK67KFJHRMIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN/action/storage_attestation","attest_author":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN/action/author_attestation","sign_citation":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN/action/citation_signature","submit_replication":"https://pith.science/pith/NIQPIXGBCK7FMXRK67KFJHRMIN/action/replication_record"}},"created_at":"2026-05-18T04:08:22.209282+00:00","updated_at":"2026-05-18T04:08:22.209282+00:00"}