{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OVWN6LNHGHGLRKIJW22AG6IVOH","short_pith_number":"pith:OVWN6LNH","schema_version":"1.0","canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","source":{"kind":"arxiv","id":"1107.4378","version":1},"attestation_state":"computed","paper":{"title":"Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel S. Hirschberg, Justin Thaler, Michael Mitzenmacher, Michael T. Goodrich","submitted_at":"2011-07-21T20:59:47Z","abstract_excerpt":"A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key. We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with a small or negligible probability the data structure will require a rehash operation, depending on whether we are working in the the external-memory (I/O) model or one of the well-known versions of the Random Access Machine (RAM) model. One of the main features of our cons"},"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":"1107.4378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T20:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"46432f53e73d3e53a8da1a012e5ba2f602d7c6e70f21b506f007e3359438b121","abstract_canon_sha256":"843a1bf715598da70b67a6c4df7d1c8d7258f04c09450029c6e6a91a4aedca13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:04.151722Z","signature_b64":"Pp6X/sQbrNmtuZnjI4Xw+xoQoDoM/L3t7VXszD2nddfttVj6BuAKWWhhPGTQcEVuIPYZz5+5udaC9Eip4V2tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","last_reissued_at":"2026-05-18T04:17:04.151248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:04.151248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel S. Hirschberg, Justin Thaler, Michael Mitzenmacher, Michael T. Goodrich","submitted_at":"2011-07-21T20:59:47Z","abstract_excerpt":"A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key. We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with a small or negligible probability the data structure will require a rehash operation, depending on whether we are working in the the external-memory (I/O) model or one of the well-known versions of the Random Access Machine (RAM) model. One of the main features of our cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4378","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":"1107.4378","created_at":"2026-05-18T04:17:04.151304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4378v1","created_at":"2026-05-18T04:17:04.151304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4378","created_at":"2026-05-18T04:17:04.151304+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVWN6LNHGHGL","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVWN6LNHGHGLRKIJ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVWN6LNH","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/OVWN6LNHGHGLRKIJW22AG6IVOH","json":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH.json","graph_json":"https://pith.science/api/pith-number/OVWN6LNHGHGLRKIJW22AG6IVOH/graph.json","events_json":"https://pith.science/api/pith-number/OVWN6LNHGHGLRKIJW22AG6IVOH/events.json","paper":"https://pith.science/paper/OVWN6LNH"},"agent_actions":{"view_html":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH","download_json":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH.json","view_paper":"https://pith.science/paper/OVWN6LNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4378&json=true","fetch_graph":"https://pith.science/api/pith-number/OVWN6LNHGHGLRKIJW22AG6IVOH/graph.json","fetch_events":"https://pith.science/api/pith-number/OVWN6LNHGHGLRKIJW22AG6IVOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/action/storage_attestation","attest_author":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/action/author_attestation","sign_citation":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/action/citation_signature","submit_replication":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/action/replication_record"}},"created_at":"2026-05-18T04:17:04.151304+00:00","updated_at":"2026-05-18T04:17:04.151304+00:00"}