{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002442857,0.0003551933,0.0004875185,0.00009962379,0.0001213066,0.0001034705,0.0001043759,0.0003669587,0.004678338],"category_scores_gemma":[0.0001587369,0.0002744609,0.0001686613,0.00002046071,0.00008916041,0.00008449747,0.00002503697,0.0002251244,0.00007670638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002787345,"about_ca_system_score_gemma":0.00005460444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001310627,"about_ca_topic_score_gemma":0.00002818367,"domain_scores_codex":[0.9985543,0.00000854336,0.0005933162,0.0003486992,0.0002740351,0.0002211097],"domain_scores_gemma":[0.9989591,0.0003097551,0.0002071669,0.0002594951,0.000152831,0.0001116011],"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.00002338746,0.0000438283,1.574614e-7,0.0003761366,0.00004927542,7.15139e-7,0.000121297,6.505783e-8,0.000003441118,0.9669888,0.005159589,0.02723329],"study_design_scores_gemma":[0.0002434033,0.00008294426,1.023329e-7,0.0001381575,0.00005551867,0.00001023132,0.00001273824,0.002764648,0.00002679869,0.6504121,0.3460293,0.0002239988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00007191635,0.00004893656,0.143044,0.0003695837,0.00005310034,0.001435521,0.00003966766,0.0002173612,0.8547199],"genre_scores_gemma":[0.00007038247,0.0000385077,0.423084,0.0001911699,0.0001643615,0.0001142533,0.0001541478,0.00008414133,0.576099],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3408697,"threshold_uncertainty_score":0.9999707,"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."}}