{"id":"W250596942","doi":"10.1007/978-3-642-59657-5_25","title":"Linear Programming Bounds for Ordered Orthogonal Arrays and (T, M, S)-nets","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Equivalence (formal languages); Orthogonal array; Mathematics; Computation; Row; Row and column spaces; Combinatorics; Discrete mathematics; Linear programming; Upper and lower bounds; Algorithm; Computer science; 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.003085172,0.001804476,0.001526979,0.0018568,0.001307717,0.006175497,0.002925538,0.001412168,0.01440012],"category_scores_gemma":[0.0125155,0.001034875,0.001895727,0.00409121,0.002950127,0.01152664,0.002887242,0.007871209,0.003349324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005570929,"about_ca_system_score_gemma":0.00203802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00491955,"about_ca_topic_score_gemma":0.008094458,"domain_scores_codex":[0.9978969,0.0005533716,0.0001058066,0.000369916,0.0007116845,0.0003623236],"domain_scores_gemma":[0.9898444,0.007994554,0.0003820612,0.0007718173,0.0007534666,0.0002536327],"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.000131342,0.00008534207,0.0002813946,0.000195239,0.00003974229,0.00003957029,0.0001275146,0.04367977,0.000789379,0.8769917,0.01362852,0.06401052],"study_design_scores_gemma":[0.00001226692,0.00002071146,0.0001196987,0.00006913784,0.00002823676,0.00003265697,0.0000404923,0.1132253,0.0008391236,0.8796672,0.005930209,0.00001504276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01112315,0.005060432,0.8790541,0.002888128,0.000442751,0.00004708976,0.0003812996,0.0009023498,0.1001005],"genre_scores_gemma":[0.3163547,0.008614791,0.5790608,0.002230137,0.001469393,0.000689227,0.001455549,0.001726765,0.08839858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01440012,"threshold_uncertainty_score":0.04817319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06933794994824286,"score_gpt":0.316355889408642,"score_spread":0.2470179394603991,"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."}}