{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008265266,0.0004596659,0.0007102375,0.0002035228,0.0001261963,0.00003240067,0.0007331971,0.0003889864,0.0001393952],"category_scores_gemma":[0.0002397164,0.000367839,0.0003487095,0.0001317594,0.0005278024,0.00002179227,0.0004715453,0.001574389,0.0001333602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005040247,"about_ca_system_score_gemma":0.00005642428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003843635,"about_ca_topic_score_gemma":0.00008893552,"domain_scores_codex":[0.9977638,0.000328808,0.0007116285,0.0004567141,0.0002312161,0.0005078815],"domain_scores_gemma":[0.9962814,0.00233209,0.0002312618,0.001018476,0.00004971235,0.00008706522],"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.00008169219,0.00005112591,0.001156459,0.000381085,0.0004867033,0.00003695108,0.005044556,0.02383112,0.005399918,0.9613779,0.0008639354,0.001288567],"study_design_scores_gemma":[0.0003467453,0.00008639833,0.005735864,0.0005164563,0.00007243894,0.00004066234,0.001343426,0.004548203,0.01010777,0.9734529,0.003159038,0.0005901469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8259743,0.0002713381,0.07101024,0.0001048368,0.001571584,0.0006824971,0.00007949772,0.0002520348,0.1000536],"genre_scores_gemma":[0.9921291,0.00009169268,0.007258983,0.000111361,0.0001822473,0.0001384631,0.00001692258,0.00006359014,0.000007669469],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1661547,"threshold_uncertainty_score":0.9998773,"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."}}