{"id":"W2126750116","doi":"10.1016/j.tcs.2006.06.008","title":"A construction method for optimally universal hash families and its consequences for the existence of RBIBDs","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hash function; Prime (order theory); Corollary; Discrete mathematics; Combinatorics; Time complexity; Computer science","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.003461382,0.0005932002,0.001105135,0.001618555,0.003143381,0.003127868,0.002072387,0.002379753,0.009190337],"category_scores_gemma":[0.01441947,0.001406119,0.001343529,0.001968528,0.004064084,0.008574907,0.008028861,0.004016923,0.001668715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902392,"about_ca_system_score_gemma":0.001847481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000635544,"about_ca_topic_score_gemma":0.0006664146,"domain_scores_codex":[0.996927,0.000757721,0.0002339546,0.0007735884,0.0007645532,0.0005431674],"domain_scores_gemma":[0.9846109,0.007829029,0.0005973837,0.005245426,0.0009925414,0.0007246737],"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.0003284769,0.00009221878,0.00107405,0.0001558724,0.00002741261,0.00009940711,0.0004997767,0.006337016,0.007791066,0.9271138,0.003341224,0.05313981],"study_design_scores_gemma":[0.0001891251,0.0001593427,0.0005424945,0.00009262109,0.00009976635,0.000766986,0.0003148916,0.07310575,0.02476231,0.8851718,0.01466831,0.0001265949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05364364,0.0003069783,0.9302945,0.001164245,0.00008494136,0.0001332021,0.0002922892,0.0009626995,0.01311743],"genre_scores_gemma":[0.561717,0.0004694827,0.4251458,0.0004693175,0.0001554536,0.0005777517,0.000473633,0.0004559193,0.01053559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009190337,"threshold_uncertainty_score":0.03074479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00984109463461909,"score_gpt":0.2334235269196561,"score_spread":0.223582432285037,"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."}}