{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877823,0.0001421514,0.0003094018,0.0001015272,0.0003602147,0.00007850603,0.001058218,0.00005372113,0.0000381981],"category_scores_gemma":[0.0007263432,0.000091147,0.0002584741,0.0004421666,0.0003651017,0.0005030406,0.0001309023,0.0002920566,0.000002880271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001844944,"about_ca_system_score_gemma":0.0001332234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001245484,"about_ca_topic_score_gemma":2.468812e-7,"domain_scores_codex":[0.9982994,0.0004885188,0.0004771808,0.0001144471,0.0004393906,0.0001810219],"domain_scores_gemma":[0.9967788,0.001965481,0.0005484537,0.000394449,0.0002505934,0.00006215229],"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.0005068137,0.0001024589,0.0001013375,0.000006212364,0.00006511765,0.00002771623,0.002576081,0.00001940793,0.001383295,0.9939393,0.0006023612,0.0006698341],"study_design_scores_gemma":[0.0006305832,0.001412144,0.00036771,0.00007349633,0.00001367124,0.0002066726,0.0005687323,0.00001590851,0.01153825,0.9784373,0.006616938,0.0001185871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9843617,0.000194628,0.003216238,0.0006650588,0.003737237,0.00009455284,0.000001248275,0.00003011169,0.007699229],"genre_scores_gemma":[0.9985488,0.00006857831,0.0008129706,0.0001661127,0.0002907125,0.00000194296,4.611367e-8,0.000007446313,0.0001033667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01550206,"threshold_uncertainty_score":0.3716867,"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."}}