{"id":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","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.009476398,0.002751664,0.005011038,0.002992382,0.004319698,0.01038927,0.008009379,0.007275058,0.02190818],"category_scores_gemma":[0.08348447,0.003606633,0.003630741,0.004100776,0.008424032,0.03299,0.01336482,0.01073406,0.004093016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005698424,"about_ca_system_score_gemma":0.004540442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009388904,"about_ca_topic_score_gemma":0.0009104282,"domain_scores_codex":[0.9888356,0.002841709,0.0005804352,0.002074122,0.003655915,0.002012183],"domain_scores_gemma":[0.8155756,0.1467752,0.004217352,0.02367195,0.004100025,0.005659745],"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.008554377,0.001100564,0.009308026,0.001587764,0.0005879034,0.0007259562,0.001741743,0.1029024,0.03632971,0.6835085,0.0485697,0.1050834],"study_design_scores_gemma":[0.0005335941,0.0003681698,0.001671814,0.0002035416,0.000324705,0.0007546019,0.0002381341,0.1810315,0.0125914,0.7940586,0.008037274,0.0001866223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4635905,0.007037541,0.3825158,0.03238526,0.001410551,0.000667589,0.008011056,0.005704669,0.09867699],"genre_scores_gemma":[0.8937762,0.003115647,0.07309836,0.002990487,0.002155835,0.0007192748,0.003545407,0.001676155,0.01892259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02190818,"threshold_uncertainty_score":0.07329011,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01494224395046279,"score_gpt":0.227555049188999,"score_spread":0.2126128052385362,"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."}}