{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000295415,0.0002464296,0.0002071011,0.0002599991,0.0005081929,0.0007574212,0.001136447,0.0001208565,0.00007756583],"category_scores_gemma":[0.00002165927,0.0002123235,0.0002253101,0.0004895686,0.00005005726,0.001156509,0.00003836103,0.0003260701,0.0001509861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000870143,"about_ca_system_score_gemma":0.0001136158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004256565,"about_ca_topic_score_gemma":0.000005454016,"domain_scores_codex":[0.9982151,0.00003950316,0.0002743769,0.0007306785,0.0003294903,0.0004108915],"domain_scores_gemma":[0.9983145,0.000417926,0.00003308113,0.001022776,0.00006241529,0.0001492955],"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.00001688186,0.0001370346,0.000001032138,0.00004567843,0.00006840654,0.00002883251,0.0004916894,0.0004440214,0.0008617094,0.002732237,0.002194293,0.9929782],"study_design_scores_gemma":[0.0004954411,0.0004343038,0.00008670036,0.0001367552,0.00004089818,0.00006769974,0.00003903545,0.839474,0.006944994,0.005420551,0.1464509,0.0004087593],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006518721,0.0005447164,0.9929111,0.002286359,0.00223158,0.0003319941,0.0001135871,0.000667288,0.0002615197],"genre_scores_gemma":[0.159721,0.0001432721,0.8364787,0.0003808172,0.0004646771,0.0003351787,0.0000333381,0.00006141005,0.002381604],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9925694,"threshold_uncertainty_score":0.8658302,"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."}}