{"id":"W2149356828","doi":"10.1007/s00453-013-9840-x","title":"Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Universal hashing; Dynamic perfect hashing; K-independent hashing; Double hashing; Hash function; Perfect hash function; Computer science; Hash table; Mathematical proof; Constant (computer programming); Theoretical computer science; Theory of computation; Mathematics; Discrete mathematics; Combinatorics; Algorithm; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001738327,0.0002197149,0.0002275252,0.0001034465,0.0003150369,0.0005225665,0.0006387259,0.00006428602,0.00001294346],"category_scores_gemma":[0.00002732402,0.0001628778,0.00004002896,0.0002339062,0.00006541657,0.0006636007,0.0004400061,0.000126586,0.00003796723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002581537,"about_ca_system_score_gemma":0.00004987736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000272475,"about_ca_topic_score_gemma":0.000007438633,"domain_scores_codex":[0.9984183,0.00002928595,0.0002185887,0.000601639,0.0002939425,0.000438207],"domain_scores_gemma":[0.9987466,0.0002212162,0.00009361291,0.0006047796,0.0001611534,0.000172632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003758291,0.0004102129,0.0003172514,0.0001188341,0.00009975019,0.00002352618,0.002931299,0.0006512575,0.002922428,0.03071553,0.01743407,0.9443383],"study_design_scores_gemma":[0.001234776,0.000390529,0.002171648,0.00009705439,0.00001650879,0.00004702029,0.0003800493,0.9724106,0.002178218,0.001369032,0.01920193,0.000502647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07763629,0.0001980269,0.9200742,0.000752813,0.0001747706,0.0006305507,0.00002465527,0.0001986427,0.0003100209],"genre_scores_gemma":[0.3833842,0.00003090556,0.6152983,0.0004789087,0.0001802752,0.0003029624,0.00002600271,0.00003349575,0.000264916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9717593,"threshold_uncertainty_score":0.6641964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007133839550742515,"score_gpt":0.2025470687718831,"score_spread":0.1954132292211405,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}