{"id":"W7133049612","doi":"","title":"Refinement methods for reach control on a simplex","year":2008,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Toronto","keywords":"Simplex; Affine transformation; Simplex algorithm; Iterative method; Vertex (graph theory); Minification; Optimization problem","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001693357,0.001005162,0.001558362,0.0006190758,0.0007441585,0.0001116133,0.000672622,0.0008172602,0.001830189],"category_scores_gemma":[0.006787544,0.001028296,0.0005723873,0.0006626747,0.0001291741,0.0001126959,0.00006380886,0.001055967,0.0001740963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007015967,"about_ca_system_score_gemma":0.000648126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004256249,"about_ca_topic_score_gemma":0.00002469063,"domain_scores_codex":[0.9942286,0.0008037274,0.001328266,0.001299302,0.001106273,0.001233833],"domain_scores_gemma":[0.9895923,0.00569052,0.001152989,0.001435045,0.001719162,0.0004099772],"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.01131461,0.004356484,0.000005042536,0.006650766,0.002762757,0.00007396157,0.05573251,0.03656654,0.006284728,0.05193214,0.08763635,0.7366841],"study_design_scores_gemma":[0.01312827,0.002412192,0.00001863858,0.0008279823,0.0006566009,0.00002290271,0.01369476,0.5374234,0.01178441,0.01222324,0.4055682,0.002239454],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001903633,0.0006612334,0.9719926,0.001190418,0.0005604412,0.006380887,0.0001102342,0.0001797468,0.01873413],"genre_scores_gemma":[0.0002247307,0.001221095,0.7976375,0.0003447442,0.0003366429,0.001891055,0.001028785,0.0003539066,0.1969616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7344447,"threshold_uncertainty_score":0.9992167,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1274294337251623,"score_gpt":0.558572395259424,"score_spread":0.4311429615342617,"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."}}