{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZVHKX4PEEYJ4ORBARHAKWKTJDQ","short_pith_number":"pith:ZVHKX4PE","canonical_record":{"source":{"id":"2111.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d3599c4a5860eb0a93ed46e68ca2dd8b8f19412c472fd420f4f6d05a6e4456e","abstract_canon_sha256":"c949da7a16a188a41ac8abb59b2a45f4f4788ed4b53ef538587f91b37d897043"},"schema_version":"1.0"},"canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","source":{"kind":"arxiv","id":"2111.00602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00602","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00602v2","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00602","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHKX4PEEYJ4","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHKX4PEEYJ4ORBA","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHKX4PE","created_at":"2026-07-05T03:29:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZVHKX4PEEYJ4ORBARHAKWKTJDQ","target":"record","payload":{"canonical_record":{"source":{"id":"2111.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d3599c4a5860eb0a93ed46e68ca2dd8b8f19412c472fd420f4f6d05a6e4456e","abstract_canon_sha256":"c949da7a16a188a41ac8abb59b2a45f4f4788ed4b53ef538587f91b37d897043"},"schema_version":"1.0"},"canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:04.542030Z","signature_b64":"QnVwk+tjH2X0SfxKAnPS4T1yvCcRPd6yZYpfv320kl1WoghVfnf18cNYF7wjtCDO8rC0T9cWBzQFX+WCnZLLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","last_reissued_at":"2026-07-05T03:29:04.541601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:04.541601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.00602","source_version":2,"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-07-05T03:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBQaucrtHegOfyKNMOEPNag25rldVvdQLFZqo+7okv7LVmPTHCQHJHT5VRjlGRsV2UHQ/jfDFHuB99QEO2vJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:08:24.079322Z"},"content_sha256":"efb91d557e51d660970825da99712e5094c8f6c239848d246c849dbf7c98ea2a","schema_version":"1.0","event_id":"sha256:efb91d557e51d660970825da99712e5094c8f6c239848d246c849dbf7c98ea2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZVHKX4PEEYJ4ORBARHAKWKTJDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimal Time/Space Tradeoff for Hash Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kuszmaul, Mart\\'in Farach-Colton, Michael A. Bender, Mingmou Liu, William Kuszmaul","submitted_at":"2021-10-31T21:58:06Z","abstract_excerpt":"For nearly six decades, the central open question in the study of hash tables has been to determine the optimal achievable tradeoff curve between time and space. State-of-the-art hash tables offer the following guarantee: If keys/values are Theta(log n) bits each, then it is possible to achieve constant-time insertions/deletions/queries while wasting only O(loglog n) bits of space per key when compared to the information-theoretic optimum. Even prior to this bound being achieved, the target of O(loglog n) wasted bits per key was known to be a natural end goal, and was proven to be optimal for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00602","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.00602/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:29:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Yc4SpH5kjfJLpP/trO/Bg1u2FMCnHqLFMOYooNPuMXsFjVuUn7H3WpI9tpMp3cNePEi2CRyJXtg6DBTarH6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:08:24.079703Z"},"content_sha256":"e1ab9ffc77a398fcda8df16e96c221b3bcf783725c3589ec6da2425faba8e682","schema_version":"1.0","event_id":"sha256:e1ab9ffc77a398fcda8df16e96c221b3bcf783725c3589ec6da2425faba8e682"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/bundle.json","state_url":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/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-07-06T18:08:24Z","links":{"resolver":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ","bundle":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/bundle.json","state":"https://pith.science/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVHKX4PEEYJ4ORBARHAKWKTJDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZVHKX4PEEYJ4ORBARHAKWKTJDQ","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":"c949da7a16a188a41ac8abb59b2a45f4f4788ed4b53ef538587f91b37d897043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","title_canon_sha256":"0d3599c4a5860eb0a93ed46e68ca2dd8b8f19412c472fd420f4f6d05a6e4456e"},"schema_version":"1.0","source":{"id":"2111.00602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.00602","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"arxiv_version","alias_value":"2111.00602v2","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00602","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZVHKX4PEEYJ4","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZVHKX4PEEYJ4ORBA","created_at":"2026-07-05T03:29:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZVHKX4PE","created_at":"2026-07-05T03:29:04Z"}],"graph_snapshots":[{"event_id":"sha256:e1ab9ffc77a398fcda8df16e96c221b3bcf783725c3589ec6da2425faba8e682","target":"graph","created_at":"2026-07-05T03:29: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.00602/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For nearly six decades, the central open question in the study of hash tables has been to determine the optimal achievable tradeoff curve between time and space. State-of-the-art hash tables offer the following guarantee: If keys/values are Theta(log n) bits each, then it is possible to achieve constant-time insertions/deletions/queries while wasting only O(loglog n) bits of space per key when compared to the information-theoretic optimum. Even prior to this bound being achieved, the target of O(loglog n) wasted bits per key was known to be a natural end goal, and was proven to be optimal for ","authors_text":"John Kuszmaul, Mart\\'in Farach-Colton, Michael A. Bender, Mingmou Liu, William Kuszmaul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","title":"On the Optimal Time/Space Tradeoff for Hash Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00602","kind":"arxiv","version":2},"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:efb91d557e51d660970825da99712e5094c8f6c239848d246c849dbf7c98ea2a","target":"record","created_at":"2026-07-05T03:29: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":"c949da7a16a188a41ac8abb59b2a45f4f4788ed4b53ef538587f91b37d897043","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-10-31T21:58:06Z","title_canon_sha256":"0d3599c4a5860eb0a93ed46e68ca2dd8b8f19412c472fd420f4f6d05a6e4456e"},"schema_version":"1.0","source":{"id":"2111.00602","kind":"arxiv","version":2}},"canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd4eabf1e42613c7442089c0ab2a691c2ab030c96540b62f8a7f27595bcf4d38","first_computed_at":"2026-07-05T03:29:04.541601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:29:04.541601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QnVwk+tjH2X0SfxKAnPS4T1yvCcRPd6yZYpfv320kl1WoghVfnf18cNYF7wjtCDO8rC0T9cWBzQFX+WCnZLLCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:29:04.542030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.00602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efb91d557e51d660970825da99712e5094c8f6c239848d246c849dbf7c98ea2a","sha256:e1ab9ffc77a398fcda8df16e96c221b3bcf783725c3589ec6da2425faba8e682"],"state_sha256":"194e3a16e5ea2b8136ffe9304bfa334f5603108c926ac318d08b28ba6a664458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJBfkKIq67m4g2Kydg/jvWlt/suy8XBhhzelfTLxKKhu7TEh9xWJ/Q+TDDt79rsZJGICq6nu7B7r8pgHBOKODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:08:24.081686Z","bundle_sha256":"acbd848913f5a641b6b886f4b888a7a59745a26fcaa613ac645fe022639ab006"}}