{"id":"W4401422447","doi":"10.1145/3677608","title":"Tight Bounds for Monotone Minimal Perfect Hashing","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Air Force Research Laboratory; Hertz Foundation","keywords":"Combinatorics; Upper and lower bounds; Bounded function; Mathematics; Hash function; Perfect hash function; Monotone polygon; Omega; Binary logarithm; Discrete mathematics; Chromatic scale; Hash table; Physics; Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009705191,0.002659004,0.004084955,0.002282458,0.003279954,0.007495543,0.00741771,0.004005285,0.01987747],"category_scores_gemma":[0.06003015,0.002038074,0.002797973,0.004924697,0.005637921,0.03345823,0.01264314,0.009349816,0.005579566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006432535,"about_ca_system_score_gemma":0.004915357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002642794,"about_ca_topic_score_gemma":0.003110643,"domain_scores_codex":[0.980723,0.00426303,0.001110909,0.003402254,0.006650661,0.003850236],"domain_scores_gemma":[0.9455616,0.03497571,0.002136316,0.01276831,0.002704335,0.001853688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003756509,0.0007277122,0.003533212,0.001976656,0.0002793249,0.0003926195,0.001140142,0.07967494,0.01357287,0.6939943,0.04772032,0.1532314],"study_design_scores_gemma":[0.0002655968,0.0003702893,0.0007029215,0.0002112647,0.000174427,0.0003813495,0.0002382796,0.1889864,0.006365209,0.7884351,0.01376855,0.0001006943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1296021,0.0151562,0.7353678,0.0194197,0.001341579,0.0007808574,0.005173301,0.00873135,0.08442711],"genre_scores_gemma":[0.7459487,0.004641063,0.2123833,0.005416271,0.002081086,0.001413275,0.005720172,0.002355538,0.02004056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01987747,"threshold_uncertainty_score":0.06649673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02788054483978671,"score_gpt":0.2948910520184365,"score_spread":0.2670105071786498,"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."}}