{"id":"W2137543927","doi":"10.1109/tit.2013.2257918","title":"Upper Bounds on Matching Families in <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\BBZ_{pq}^{n}$</tex></formula>","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Matching (statistics); Combinatorics; Upper and lower bounds; Modulo; Discrete mathematics; Mathematics; Statistics; Mathematical analysis","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","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001865069,0.0008151079,0.0006406841,0.002228248,0.001287076,0.001043167,0.00147922,0.000460441,0.0005231418],"category_scores_gemma":[0.00005761516,0.0007710358,0.0005845213,0.001877705,0.0002609833,0.009099512,0.00003719064,0.0009125042,0.002267841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003517858,"about_ca_system_score_gemma":0.0002125095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003902943,"about_ca_topic_score_gemma":0.0001102239,"domain_scores_codex":[0.9950798,0.0003415225,0.001685792,0.0006573658,0.001153937,0.001081544],"domain_scores_gemma":[0.9963425,0.0008644821,0.0005546305,0.001470711,0.000432742,0.0003349461],"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.0003690422,0.0004408694,0.00001703684,0.000147813,0.0001480158,0.000004428863,0.01549795,0.03729755,0.002390211,0.7646264,0.0005852876,0.1784753],"study_design_scores_gemma":[0.009448272,0.002236527,0.005046586,0.001264061,0.0002571734,0.0002123214,0.00425926,0.3119991,0.02558521,0.5343647,0.1002819,0.005044879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2005128,0.00006637433,0.7747341,0.000529135,0.001719788,0.001105674,0.00007517786,0.0007816816,0.02047526],"genre_scores_gemma":[0.990476,0.0001555109,0.005907709,0.001983808,0.0001181883,0.0003804702,0.00007117502,0.0000609187,0.0008462703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7899632,"threshold_uncertainty_score":0.9999939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007942866790031734,"score_gpt":0.2192346133793862,"score_spread":0.2112917465893544,"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."}}