{"id":"W4396945166","doi":"10.1145/3618260.3649642","title":"Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters","year":2024,"lang":"en","type":"preprint","venue":"","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Pseudorandomness; Hash function; Orthogonal array; Constructive; Discrete mathematics; K-independent hashing; Upper and lower bounds; Perfect hash function; Theoretical computer science; Algorithm; Computer science; Cryptography","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.001669962,0.0006679408,0.0008239324,0.0007529477,0.001159016,0.002487683,0.001159715,0.001402135,0.005334829],"category_scores_gemma":[0.01168192,0.0007032382,0.0009524721,0.00147333,0.003588932,0.007585367,0.005281379,0.003245282,0.001807507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135663,"about_ca_system_score_gemma":0.00101136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002933049,"about_ca_topic_score_gemma":0.0002604649,"domain_scores_codex":[0.9970509,0.000892492,0.0002008665,0.0006753215,0.0007754696,0.0004049639],"domain_scores_gemma":[0.9930207,0.003639678,0.0005934408,0.002234063,0.0003604641,0.0001516725],"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.0001095088,0.00003430378,0.0003972564,0.0001004601,0.00001227459,0.00006743908,0.0001611601,0.0105837,0.002826015,0.9621992,0.001087287,0.02242141],"study_design_scores_gemma":[0.00004488651,0.00009088127,0.0001650277,0.00005102452,0.00001849363,0.0002286207,0.00006031269,0.04339487,0.008902502,0.9367661,0.01023549,0.00004182714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04249943,0.0009337925,0.9398098,0.0008138802,0.0001386334,0.0001018714,0.000266995,0.0005736075,0.01486191],"genre_scores_gemma":[0.7163271,0.001131169,0.2671747,0.0007814025,0.0002883108,0.0004719683,0.0005103401,0.0003170889,0.01299796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005334829,"threshold_uncertainty_score":0.01784676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008962190122907913,"score_gpt":0.1766746204094409,"score_spread":0.167712430286533,"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."}}