{"id":"W1717515755","doi":"10.1016/j.dam.2011.11.009","title":"The universality of iterated hashing over variable-length strings","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Iterated function; Hash function; Dynamic perfect hashing; Universal hashing; Double hashing; K-independent hashing; Perfect hash function; Combinatorics; Rolling hash; Discrete mathematics; Pairwise comparison; Collision resistance; Upper and lower bounds; Algorithm; Cryptographic hash function; Cryptography; Statistics; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.000392725,0.0001298761,0.0001718516,0.00003137481,0.0001860381,0.0001050061,0.001033994,0.0000522678,0.00002451682],"category_scores_gemma":[0.00002208154,0.00008368291,0.00003752997,0.0002554946,0.00007047483,0.0002933819,0.0005294694,0.0001213005,0.00000822557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001702737,"about_ca_system_score_gemma":0.00003652603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003885858,"about_ca_topic_score_gemma":0.000001257679,"domain_scores_codex":[0.9989992,0.00001631595,0.0002963603,0.0002095063,0.00026562,0.0002130214],"domain_scores_gemma":[0.998669,0.0001658804,0.0002295208,0.0008284464,0.00004886447,0.00005823915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006576716,0.00005030008,0.000008097024,0.00003835904,0.0000237462,0.000001340652,0.002990211,0.000008869994,0.001167284,0.9920532,0.0002507774,0.003401305],"study_design_scores_gemma":[0.001418778,0.0001124892,0.0007914403,0.0002610745,0.00008179104,0.00001054676,0.002429516,0.4981039,0.03131342,0.4561044,0.008563284,0.0008093589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008337749,0.00002053433,0.9628948,0.00001665473,0.00008662562,0.000176402,0.00001297745,0.00009015233,0.02836411],"genre_scores_gemma":[0.4047489,0.00002233168,0.5950089,0.00004259163,0.00002429568,0.00001093595,0.000009104901,0.00001618495,0.0001167625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5359488,"threshold_uncertainty_score":0.341249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02156783680824183,"score_gpt":0.2222121656877985,"score_spread":0.2006443288795566,"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."}}