{"id":"W1966840469","doi":"10.1007/s11590-008-0109-2","title":"On the upper bounds of the minimum number of rows of disjunct matrices","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Disjunct; Column (typography); Row and column spaces; Combinatorics; Matrix (chemical analysis); Mathematics; Upper and lower bounds; Value (mathematics); Chemistry; Geometry; Computer science; Statistics; Connection (principal bundle); Population; Chromatography; 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.005021131,0.00333202,0.002457016,0.002453914,0.001542724,0.006034311,0.004284478,0.002577212,0.01500184],"category_scores_gemma":[0.04671358,0.001879127,0.001354515,0.002824569,0.003680874,0.0102214,0.004046392,0.007103232,0.002744615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002245002,"about_ca_system_score_gemma":0.001928991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001186739,"about_ca_topic_score_gemma":0.002678571,"domain_scores_codex":[0.9944555,0.001732718,0.0002489805,0.001051439,0.001643888,0.0008674592],"domain_scores_gemma":[0.9299904,0.05834629,0.002309821,0.004563676,0.003191205,0.001598603],"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.001974727,0.0004658012,0.002115272,0.001261533,0.0002436807,0.0003688631,0.0005988189,0.3466372,0.02585592,0.49253,0.02294691,0.1050013],"study_design_scores_gemma":[0.00008952892,0.0002118866,0.0009698547,0.0002223345,0.00006582362,0.0002974577,0.0001454928,0.5695942,0.00836858,0.4147731,0.005185296,0.0000764328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.087843,0.006487411,0.8324038,0.00557408,0.000681903,0.0001660041,0.002180686,0.0007993861,0.06386385],"genre_scores_gemma":[0.614494,0.005629332,0.3574716,0.001729568,0.001338871,0.0006848186,0.002435938,0.0009957099,0.01522022],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01500184,"threshold_uncertainty_score":0.05018616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005580011362657026,"score_gpt":0.1764967835750236,"score_spread":0.1709167722123665,"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."}}