{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021201,0.0005914498,0.0008782558,0.0008868572,0.0008238963,0.001533563,0.002357861,0.0007544017,0.006393941],"category_scores_gemma":[0.003974502,0.0005399339,0.0008116207,0.001445069,0.001515434,0.003603358,0.005124164,0.001066022,0.003614192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009784461,"about_ca_system_score_gemma":0.001556071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001172501,"about_ca_topic_score_gemma":0.001348323,"domain_scores_codex":[0.9984556,0.0002715725,0.000110062,0.0003060911,0.0006441501,0.0002124384],"domain_scores_gemma":[0.9980715,0.0003077873,0.0001093824,0.001199801,0.0002370538,0.00007455644],"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.000684766,0.0001514642,0.001383516,0.0006830194,0.00009208389,0.0003154576,0.0008563217,0.0394175,0.0326927,0.3768845,0.02968511,0.5171536],"study_design_scores_gemma":[0.000190108,0.000448821,0.0008752349,0.0001267365,0.00008054449,0.0007436328,0.0003150676,0.2774324,0.06383822,0.5866794,0.0691291,0.0001408302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03058037,0.0005264321,0.9512008,0.0002282587,0.0001080732,0.0001589577,0.0007785186,0.007428868,0.008989724],"genre_scores_gemma":[0.4587507,0.0003754286,0.5234498,0.0003326838,0.0001063983,0.000365111,0.002989003,0.001495182,0.01213557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006393941,"threshold_uncertainty_score":0.02138984,"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."}}