{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009264397,0.004569496,0.004344644,0.003127782,0.00528059,0.008270612,0.008327426,0.00450869,0.04761175],"category_scores_gemma":[0.05628968,0.002220386,0.004441731,0.005799142,0.004918674,0.03752693,0.01221091,0.009773497,0.0173185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007991056,"about_ca_system_score_gemma":0.005921086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003757614,"about_ca_topic_score_gemma":0.005397853,"domain_scores_codex":[0.982509,0.003253397,0.0009359554,0.00353222,0.005238968,0.004530463],"domain_scores_gemma":[0.8861449,0.09101685,0.003548507,0.01249233,0.003840007,0.002957325],"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.004204891,0.0013686,0.007955834,0.0032847,0.0004861932,0.001155485,0.002169057,0.1103242,0.02837774,0.4847441,0.1197232,0.2362061],"study_design_scores_gemma":[0.0003224729,0.0003917261,0.001603688,0.0004975402,0.0004168408,0.0015125,0.0004721099,0.2543012,0.02726984,0.664818,0.04813095,0.0002630013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1284421,0.01221441,0.6659974,0.01684191,0.00102496,0.0009814643,0.01015609,0.01235485,0.1519868],"genre_scores_gemma":[0.5689831,0.009987773,0.3325653,0.006557404,0.002598705,0.002588826,0.01422832,0.007784233,0.05470628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04761175,"threshold_uncertainty_score":0.1592771,"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."}}