{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QXZRDGPPLXPHPE6XAP6UX5ER4T","short_pith_number":"pith:QXZRDGPP","schema_version":"1.0","canonical_sha256":"85f31199ef5dde7793d703fd4bf491e4c51b06c54e329438ac860a6101c05559","source":{"kind":"arxiv","id":"0912.5424","version":3},"attestation_state":"computed","paper":{"title":"Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Segev, Moni Naor, Yuriy Arbitman","submitted_at":"2009-12-30T07:55:20Z","abstract_excerpt":"The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst case with high probability, and in terms of space consumption there are known constructions that use essentially optimal space. However, although the first analysis of a dynamic dictionary dates back more than 45 years ago (when Knuth analyzed linear probing in 1963), the trade-off between these aspects of performance is still not completely understood. In thi"},"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":"0912.5424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-30T07:55:20Z","cross_cats_sorted":[],"title_canon_sha256":"d7013e7bb05239010ef0502711e0a7546fc0455fa35eaa3bf3db449de76a45f4","abstract_canon_sha256":"4898a64150b580659c74641ec1ca107b31a09d3625828dbd9bb715cd12e99ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:45.304808Z","signature_b64":"YlDUq54b2Rrz18uySB7zewkQsUmpj4ffzVo4X+cLH3lzI2QdQryLpGYRJgC9h+gf+Wl6HB0FiSMh9G+C8lLoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f31199ef5dde7793d703fd4bf491e4c51b06c54e329438ac860a6101c05559","last_reissued_at":"2026-05-18T02:24:45.304226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:45.304226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Segev, Moni Naor, Yuriy Arbitman","submitted_at":"2009-12-30T07:55:20Z","abstract_excerpt":"The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst case with high probability, and in terms of space consumption there are known constructions that use essentially optimal space. However, although the first analysis of a dynamic dictionary dates back more than 45 years ago (when Knuth analyzed linear probing in 1963), the trade-off between these aspects of performance is still not completely understood. In thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5424","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":"0912.5424","created_at":"2026-05-18T02:24:45.304333+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.5424v3","created_at":"2026-05-18T02:24:45.304333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5424","created_at":"2026-05-18T02:24:45.304333+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXZRDGPPLXPH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXZRDGPPLXPHPE6X","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXZRDGPP","created_at":"2026-05-18T12:26:01.383474+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/QXZRDGPPLXPHPE6XAP6UX5ER4T","json":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T.json","graph_json":"https://pith.science/api/pith-number/QXZRDGPPLXPHPE6XAP6UX5ER4T/graph.json","events_json":"https://pith.science/api/pith-number/QXZRDGPPLXPHPE6XAP6UX5ER4T/events.json","paper":"https://pith.science/paper/QXZRDGPP"},"agent_actions":{"view_html":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T","download_json":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T.json","view_paper":"https://pith.science/paper/QXZRDGPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.5424&json=true","fetch_graph":"https://pith.science/api/pith-number/QXZRDGPPLXPHPE6XAP6UX5ER4T/graph.json","fetch_events":"https://pith.science/api/pith-number/QXZRDGPPLXPHPE6XAP6UX5ER4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T/action/storage_attestation","attest_author":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T/action/author_attestation","sign_citation":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T/action/citation_signature","submit_replication":"https://pith.science/pith/QXZRDGPPLXPHPE6XAP6UX5ER4T/action/replication_record"}},"created_at":"2026-05-18T02:24:45.304333+00:00","updated_at":"2026-05-18T02:24:45.304333+00:00"}