{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004031915,0.0005259073,0.001618668,0.002155683,0.001643127,0.004233676,0.002640321,0.001588989,0.002081998],"category_scores_gemma":[0.02964122,0.001075128,0.001380378,0.002054401,0.008944965,0.01127038,0.006553154,0.003746214,0.000418045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001698097,"about_ca_system_score_gemma":0.001334853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009460881,"about_ca_topic_score_gemma":0.0004871647,"domain_scores_codex":[0.9947484,0.001151382,0.0004449971,0.001353396,0.001476651,0.0008251665],"domain_scores_gemma":[0.9621612,0.0231335,0.002508844,0.009485071,0.001793464,0.0009180221],"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.0002681629,0.00005348369,0.002029845,0.0001760419,0.00005561413,0.0002376652,0.0009421863,0.01799837,0.004226206,0.9382081,0.0008582575,0.034946],"study_design_scores_gemma":[0.00003332839,0.00007035235,0.000489311,0.00005152372,0.0000366967,0.0002573858,0.00008242486,0.05367447,0.002727145,0.9408962,0.001634372,0.00004682384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4095341,0.003557018,0.5665072,0.001453886,0.000202244,0.00006715464,0.0003063933,0.001015559,0.0173563],"genre_scores_gemma":[0.9609123,0.0008802697,0.03414026,0.0002953983,0.0003909747,0.00007349688,0.000185529,0.0001986419,0.002923059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004233676,"threshold_uncertainty_score":0.02132303,"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."}}