{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MJMUYITFTZG7UGWGO6NPFUIJAZ","short_pith_number":"pith:MJMUYITF","schema_version":"1.0","canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","source":{"kind":"arxiv","id":"1006.1231","version":3},"attestation_state":"computed","paper":{"title":"On the Insertion Time of Cuckoo Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Angelika Steger, Konstantinos Panagiotou, Nikolaos Fountoulakis","submitted_at":"2010-06-07T11:15:01Z","abstract_excerpt":"Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k > 2 and that the number of items in the table is below (but arbitrarily close) to the theoretically achievable load threshold, we show a polylogarithmic bound for the maximum insertion time that holds with high probabili"},"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":"1006.1231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-07T11:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"55ae3aec1d6a84371b758bd92a3f312d8289cc3ea5fed1603a6a16cf6a5bff12","abstract_canon_sha256":"6d83163a1e6055e0530707a367b1ccad39ca824c8b5c9d9164c7d73b15b47131"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:56.143106Z","signature_b64":"mtdg0Fet5rPgQs+59g+KY/F/+jTs/dEAEhT0FYi+D9QLwbrTnXRlHpqZc4GZ/uFWhNrPiJ3rlMcySDm9aZHkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","last_reissued_at":"2026-05-18T03:10:56.142355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:56.142355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Insertion Time of Cuckoo Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Angelika Steger, Konstantinos Panagiotou, Nikolaos Fountoulakis","submitted_at":"2010-06-07T11:15:01Z","abstract_excerpt":"Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions. In this paper we investigate further the random walk heuristic for inserting in an online fashion new items into the hash table. Provided that k > 2 and that the number of items in the table is below (but arbitrarily close) to the theoretically achievable load threshold, we show a polylogarithmic bound for the maximum insertion time that holds with high probabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1231","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":"1006.1231","created_at":"2026-05-18T03:10:56.142484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.1231v3","created_at":"2026-05-18T03:10:56.142484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1231","created_at":"2026-05-18T03:10:56.142484+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJMUYITFTZG7","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJMUYITFTZG7UGWG","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJMUYITF","created_at":"2026-05-18T12:26:10.704358+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/MJMUYITFTZG7UGWGO6NPFUIJAZ","json":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ.json","graph_json":"https://pith.science/api/pith-number/MJMUYITFTZG7UGWGO6NPFUIJAZ/graph.json","events_json":"https://pith.science/api/pith-number/MJMUYITFTZG7UGWGO6NPFUIJAZ/events.json","paper":"https://pith.science/paper/MJMUYITF"},"agent_actions":{"view_html":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ","download_json":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ.json","view_paper":"https://pith.science/paper/MJMUYITF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.1231&json=true","fetch_graph":"https://pith.science/api/pith-number/MJMUYITFTZG7UGWGO6NPFUIJAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MJMUYITFTZG7UGWGO6NPFUIJAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/action/storage_attestation","attest_author":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/action/author_attestation","sign_citation":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/action/citation_signature","submit_replication":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/action/replication_record"}},"created_at":"2026-05-18T03:10:56.142484+00:00","updated_at":"2026-05-18T03:10:56.142484+00:00"}