{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009502671,0.00007129686,0.0001125854,0.0000324584,0.00004262697,0.000003620224,0.0001528368,0.00003057425,0.0001492703],"category_scores_gemma":[0.00001693084,0.00004231566,0.00008293911,0.0002335796,0.00009829839,0.0000492449,0.0000106048,0.00004827432,0.000003752042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007233428,"about_ca_system_score_gemma":0.000004315953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006616439,"about_ca_topic_score_gemma":3.480895e-7,"domain_scores_codex":[0.9994694,0.0000529446,0.0002090166,0.00005491391,0.0001412962,0.00007245704],"domain_scores_gemma":[0.999563,0.00008780546,0.0000918115,0.0002235439,0.00002371878,0.00001013066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001012418,0.00001636018,0.004216289,0.00004995397,0.00003981538,2.489959e-7,0.0006901121,0.9814302,0.004501031,0.003162664,0.005870314,0.00001292609],"study_design_scores_gemma":[0.003483469,0.0001971822,0.03874171,0.001216533,0.0003679486,0.000101165,0.002101355,0.7341002,0.2103496,0.001365868,0.006472086,0.001502806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876629,0.00003567542,0.006580151,0.000357463,0.000243291,0.0001179139,0.000008957823,0.00001797993,0.00497568],"genre_scores_gemma":[0.9994324,0.0000176254,0.0002927209,0.0001333392,0.00001647784,0.000005668863,0.000002147923,0.00001241798,0.00008723149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2473299,"threshold_uncertainty_score":0.1725582,"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."}}