{"id":"W4399330943","doi":"10.52933/jdssv.v4i3.83","title":"An Efficient Way to Find Optimal Crossover Designs Using CVX for Precision Medicine","year":2024,"lang":"en","type":"article","venue":"Journal of Data Science Statistics and Visualisation","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; Ontario Medical Association","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute of General Medical Sciences; National Human Genome Research Institute","keywords":"Crossover; Crossover study; Optimal design; Mathematical optimization; Regular polygon; Construct (python library); Computer science; Convex optimization; Algorithm; Mathematics; Medicine; Artificial intelligence; Machine learning","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.01579125,0.001455001,0.002610023,0.002942055,0.0007282267,0.001658202,0.001521641,0.002105377,0.00829729],"category_scores_gemma":[0.05039488,0.001500198,0.002023713,0.002281315,0.001910637,0.001701265,0.002224942,0.003335463,0.001022521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001296359,"about_ca_system_score_gemma":0.002425543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009503251,"about_ca_topic_score_gemma":0.0008754235,"domain_scores_codex":[0.9912562,0.006241431,0.0003881961,0.0007344217,0.001205469,0.0001743193],"domain_scores_gemma":[0.9794487,0.01683147,0.001092617,0.001399707,0.001043749,0.0001838039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007040307,0.0002635786,0.001503729,0.001232184,0.0003642366,0.0002270461,0.0003905013,0.3264148,0.008739108,0.2669497,0.005136738,0.3880743],"study_design_scores_gemma":[0.0005366297,0.000789929,0.0008194586,0.0004295998,0.000160546,0.0002844857,0.00009903607,0.6668191,0.006105386,0.3116364,0.01223562,0.00008375692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002260014,0.0003421883,0.9960444,0.0001507395,0.00003209209,0.0001380787,0.00003801614,0.0001278597,0.0008666881],"genre_scores_gemma":[0.04799136,0.0003675532,0.9496778,0.0001461683,0.00004042058,0.0008193298,0.0001020384,0.0001182914,0.0007370435],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01579125,"threshold_uncertainty_score":0.08351314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.5004361897846052,"score_gpt":0.6208016945122043,"score_spread":0.1203655047275991,"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."}}