{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MJMUYITFTZG7UGWGO6NPFUIJAZ","short_pith_number":"pith:MJMUYITF","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"},"canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","source":{"kind":"arxiv","id":"1006.1231","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1231","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1231v3","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1231","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"MJMUYITFTZG7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MJMUYITFTZG7UGWG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MJMUYITF","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MJMUYITFTZG7UGWGO6NPFUIJAZ","target":"record","payload":{"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"},"canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","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"},"source_kind":"arxiv","source_id":"1006.1231","source_version":3,"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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Dd0AVJ3UsdRNbu04VEdmHMzFqzQUU8XMcuFXuMcEXzYgDtcMuyQm9PTbps95UzpjUfyZ06a0yyYctaiZtAwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:13:10.159285Z"},"content_sha256":"f7df7bffb2f58083396546fbbd39f974694816b9c9e24440c49b41a43a27517a","schema_version":"1.0","event_id":"sha256:f7df7bffb2f58083396546fbbd39f974694816b9c9e24440c49b41a43a27517a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MJMUYITFTZG7UGWGO6NPFUIJAZ","target":"graph","payload":{"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"},"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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwpC7JifzpbmmZOcGKiB0FmjK7dCZ9O3g7ZJEO5/3aZ8S6JS5BILq6p1dk4Y1qVn6JD2DAauvpGuCAFPBgxpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:13:10.159654Z"},"content_sha256":"9061942c5038dc30838cedfc415be1f10b6246f338f91d41cf47d811a49f8de2","schema_version":"1.0","event_id":"sha256:9061942c5038dc30838cedfc415be1f10b6246f338f91d41cf47d811a49f8de2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/bundle.json","state_url":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/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-24T15:13:10Z","links":{"resolver":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ","bundle":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/bundle.json","state":"https://pith.science/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJMUYITFTZG7UGWGO6NPFUIJAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MJMUYITFTZG7UGWGO6NPFUIJAZ","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":"6d83163a1e6055e0530707a367b1ccad39ca824c8b5c9d9164c7d73b15b47131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-07T11:15:01Z","title_canon_sha256":"55ae3aec1d6a84371b758bd92a3f312d8289cc3ea5fed1603a6a16cf6a5bff12"},"schema_version":"1.0","source":{"id":"1006.1231","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1231","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1231v3","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1231","created_at":"2026-05-18T03:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"MJMUYITFTZG7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MJMUYITFTZG7UGWG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MJMUYITF","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:9061942c5038dc30838cedfc415be1f10b6246f338f91d41cf47d811a49f8de2","target":"graph","created_at":"2026-05-18T03:10:56Z","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":"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","authors_text":"Angelika Steger, Konstantinos Panagiotou, Nikolaos Fountoulakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-07T11:15:01Z","title":"On the Insertion Time of Cuckoo Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1231","kind":"arxiv","version":3},"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:f7df7bffb2f58083396546fbbd39f974694816b9c9e24440c49b41a43a27517a","target":"record","created_at":"2026-05-18T03:10:56Z","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":"6d83163a1e6055e0530707a367b1ccad39ca824c8b5c9d9164c7d73b15b47131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-07T11:15:01Z","title_canon_sha256":"55ae3aec1d6a84371b758bd92a3f312d8289cc3ea5fed1603a6a16cf6a5bff12"},"schema_version":"1.0","source":{"id":"1006.1231","kind":"arxiv","version":3}},"canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62594c22659e4dfa1ac6779af2d109064ef0307f1dff38cfa3306cdc57ba0c1e","first_computed_at":"2026-05-18T03:10:56.142355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:56.142355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtdg0Fet5rPgQs+59g+KY/F/+jTs/dEAEhT0FYi+D9QLwbrTnXRlHpqZc4GZ/uFWhNrPiJ3rlMcySDm9aZHkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:56.143106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1231","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7df7bffb2f58083396546fbbd39f974694816b9c9e24440c49b41a43a27517a","sha256:9061942c5038dc30838cedfc415be1f10b6246f338f91d41cf47d811a49f8de2"],"state_sha256":"5c7d7dacdfd59e5fcf56464c788acd9cc9f6e1d0013231fb70e7b19c58719b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4zHMzlnRVEf7v9WSgpupOZt+7PvLWOo45Rj2p/IlTr6AH2lMXa/iXmZwfq1d78blsk31fTGhj8XDSDjAbnWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:13:10.161670Z","bundle_sha256":"65cb986126584d2988d063b7d79369c44cae00f609799a1c3377aba16a5208ef"}}