{"id":"W2953272544","doi":"","title":"A Bound on the Size of Separating Hash Families.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Perfect hash function; Upper and lower bounds; Collision resistance; Computer science; Mathematics; Theoretical computer science; Cryptographic hash function; Discrete mathematics; Combinatorics; Algorithm; 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.004383829,0.001255623,0.001778439,0.002143949,0.00251912,0.004077855,0.002981937,0.003007884,0.01257559],"category_scores_gemma":[0.04398572,0.001301116,0.00205005,0.002387247,0.004976057,0.01564434,0.006662153,0.006427174,0.00257376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002445132,"about_ca_system_score_gemma":0.001424403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006400091,"about_ca_topic_score_gemma":0.0004368634,"domain_scores_codex":[0.993959,0.001297944,0.0003331087,0.001358922,0.002131956,0.000919099],"domain_scores_gemma":[0.9294212,0.05059061,0.003133977,0.01199838,0.00246879,0.002387112],"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.001635417,0.0001976465,0.004833219,0.000936562,0.000213803,0.0006574867,0.001244418,0.03703419,0.03225902,0.8308809,0.01325872,0.07684871],"study_design_scores_gemma":[0.00008510936,0.0003237812,0.001626066,0.0001797327,0.0001965807,0.001436521,0.0002011652,0.06500982,0.02128364,0.8854567,0.02407394,0.0001269847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1670159,0.004254272,0.7600969,0.004168573,0.000629515,0.0004121855,0.003337507,0.001496258,0.05858878],"genre_scores_gemma":[0.8407214,0.00244977,0.1392204,0.0009822398,0.000729118,0.0005975914,0.001975535,0.0007420786,0.01258194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01257559,"threshold_uncertainty_score":0.04206955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01531099702584472,"score_gpt":0.2407312824467553,"score_spread":0.2254202854209106,"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."}}