{"id":"W2150574820","doi":"10.1093/comjnl/bxt070","title":"Strongly Universal String Hashing is Fast","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Computer science; Parallel computing; Byte; Dynamic perfect hashing; String (physics); Universal hashing; Theoretical computer science; Arithmetic; Double hashing; Hash table; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002755958,0.0001305388,0.0001199793,0.00007368511,0.0005619188,0.001339702,0.001961781,0.00003347539,0.0001144179],"category_scores_gemma":[0.000002734349,0.00008122753,0.00007682139,0.0001562566,0.00003581757,0.001725022,0.000962384,0.000453412,0.0001593328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004516992,"about_ca_system_score_gemma":0.00005397454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002820163,"about_ca_topic_score_gemma":3.79808e-7,"domain_scores_codex":[0.9988492,0.00009195549,0.0002053551,0.0001983268,0.0003344225,0.0003207845],"domain_scores_gemma":[0.9990627,0.00007144281,0.0001361198,0.0004835944,0.00009652217,0.0001496129],"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.000003710466,0.00005646969,0.0003604353,0.000004172046,0.0000652422,0.00005986757,0.002879739,0.003416795,0.0002822665,0.01692829,0.101212,0.8747311],"study_design_scores_gemma":[0.000456456,0.00008785933,0.003889243,0.00005484929,0.000006092694,0.0005163513,0.0001060886,0.9770632,0.0001457352,0.006383007,0.01109432,0.0001967712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0265957,0.00008510456,0.9693763,0.002414063,0.001006803,0.00007328037,0.00000127746,0.00006775995,0.0003797025],"genre_scores_gemma":[0.6443118,0.00003931348,0.3513942,0.001581958,0.002204105,0.00000236135,0.000001731549,0.0000199796,0.00044455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9736465,"threshold_uncertainty_score":0.999697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01313695057224418,"score_gpt":0.2130234500110486,"score_spread":0.1998864994388044,"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."}}