{"id":"W2980862352","doi":"10.1137/1.9781611976007.14","title":"RecSplit: Minimal Perfect Hashing via Recursive Splitting","year":2019,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec","funders":"","keywords":"Perfect hash function; Hash function; Computer science; Hash table; Key (lock); Data structure; Theoretical computer science; Dynamic perfect hashing; Function (biology); Algorithm; Discrete mathematics; Double hashing; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001009349,0.0005806594,0.0008750846,0.00007202031,0.000370884,0.0004446509,0.001608326,0.001273718,0.000001670526],"category_scores_gemma":[0.0002050629,0.0005472758,0.0005019972,0.0000899607,0.0002554102,0.0001269124,0.003908827,0.001567583,0.000008105062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001683836,"about_ca_system_score_gemma":0.0002137431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000437049,"about_ca_topic_score_gemma":5.60305e-7,"domain_scores_codex":[0.9971645,0.00001344837,0.0006938545,0.001133,0.0003713448,0.000623835],"domain_scores_gemma":[0.9968717,0.0007668523,0.0008195459,0.00134919,0.00009197354,0.0001008008],"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.00005000695,0.0001281381,0.000003859286,0.002235746,0.0005930185,0.000003609853,0.01338592,0.0003484134,0.0047298,0.6769741,0.008056503,0.2934909],"study_design_scores_gemma":[0.002121843,0.0001982912,6.160965e-7,0.0007936588,0.0002266823,0.00002030468,0.003092869,0.0295551,0.01506712,0.941022,0.006434541,0.001466959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01407605,0.000128443,0.9760399,0.0002907806,0.0008608524,0.003159975,0.0001697584,0.0009365023,0.00433771],"genre_scores_gemma":[0.02598197,0.00001970332,0.9720917,0.0001221959,0.000525311,0.0005446085,0.00006213837,0.00007485058,0.0005774887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2920239,"threshold_uncertainty_score":0.9996979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06309495751379852,"score_gpt":0.2719137941852763,"score_spread":0.2088188366714778,"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."}}