{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OVWN6LNHGHGLRKIJW22AG6IVOH","short_pith_number":"pith:OVWN6LNH","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"},"canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","source":{"kind":"arxiv","id":"1107.4378","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4378","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4378v1","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4378","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"OVWN6LNHGHGL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OVWN6LNHGHGLRKIJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OVWN6LNH","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OVWN6LNHGHGLRKIJW22AG6IVOH","target":"record","payload":{"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"},"canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","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"},"source_kind":"arxiv","source_id":"1107.4378","source_version":1,"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-18T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"een+WwWwCbHI5huYb+86GQxCwnBEg9Bfb3PgO1UxmgWE2x9uStWj2DV20sM3fHDD8fgA2ZT32ulregUPlZuyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:44:26.978942Z"},"content_sha256":"80806549920c64dd1251c4a53831d38b603289f7d3b4ec8022d76239afb8b527","schema_version":"1.0","event_id":"sha256:80806549920c64dd1251c4a53831d38b603289f7d3b4ec8022d76239afb8b527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OVWN6LNHGHGLRKIJW22AG6IVOH","target":"graph","payload":{"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"},"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-18T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJnJ905T66oduSdegAQa65L1eVWB7KbeRRUkpuqixiJSoTC1Mrq6Nm98bR/xUNdk5tzUCenfa32RB+9hOpkDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:44:26.979284Z"},"content_sha256":"29ae9269b8188ff0c006efb6bd9666d0d635d617caf56367c1493410b3e28c2e","schema_version":"1.0","event_id":"sha256:29ae9269b8188ff0c006efb6bd9666d0d635d617caf56367c1493410b3e28c2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/bundle.json","state_url":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/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-05-20T08:44:26Z","links":{"resolver":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH","bundle":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/bundle.json","state":"https://pith.science/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVWN6LNHGHGLRKIJW22AG6IVOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OVWN6LNHGHGLRKIJW22AG6IVOH","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":"843a1bf715598da70b67a6c4df7d1c8d7258f04c09450029c6e6a91a4aedca13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T20:59:47Z","title_canon_sha256":"46432f53e73d3e53a8da1a012e5ba2f602d7c6e70f21b506f007e3359438b121"},"schema_version":"1.0","source":{"id":"1107.4378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4378","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4378v1","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4378","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"OVWN6LNHGHGL","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OVWN6LNHGHGLRKIJ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OVWN6LNH","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:29ae9269b8188ff0c006efb6bd9666d0d635d617caf56367c1493410b3e28c2e","target":"graph","created_at":"2026-05-18T04:17:04Z","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":"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","authors_text":"Daniel S. Hirschberg, Justin Thaler, Michael Mitzenmacher, Michael T. Goodrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T20:59:47Z","title":"Fully De-Amortized Cuckoo Hashing for Cache-Oblivious Dictionaries and Multimaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4378","kind":"arxiv","version":1},"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:80806549920c64dd1251c4a53831d38b603289f7d3b4ec8022d76239afb8b527","target":"record","created_at":"2026-05-18T04:17:04Z","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":"843a1bf715598da70b67a6c4df7d1c8d7258f04c09450029c6e6a91a4aedca13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-21T20:59:47Z","title_canon_sha256":"46432f53e73d3e53a8da1a012e5ba2f602d7c6e70f21b506f007e3359438b121"},"schema_version":"1.0","source":{"id":"1107.4378","kind":"arxiv","version":1}},"canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"756cdf2da731ccb8a909b6b403791571f671f624bdbe1efe43f84a6bf028c73e","first_computed_at":"2026-05-18T04:17:04.151248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:04.151248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pp6X/sQbrNmtuZnjI4Xw+xoQoDoM/L3t7VXszD2nddfttVj6BuAKWWhhPGTQcEVuIPYZz5+5udaC9Eip4V2tCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:04.151722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80806549920c64dd1251c4a53831d38b603289f7d3b4ec8022d76239afb8b527","sha256:29ae9269b8188ff0c006efb6bd9666d0d635d617caf56367c1493410b3e28c2e"],"state_sha256":"c2d21bb8db80729e067c7b048ca87b7828de3294c766cb0120c0aa7fcada67b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CEKOHR+00TT4KiiBjMCPKLQrgebaGD07vYzrr9QNXd/+R3ORopCATWy/xFUZSOVwMvVsM0yWQmj/X5j1Y9LzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T08:44:26.981181Z","bundle_sha256":"2634f49d6e71b137beb40dd1ffd9b7b355b1ed7892f61fbf8b84ae56f6a06869"}}