{"id":"W2788294399","doi":"10.20382/jocg.v9i1a1","title":"Computing maxmin edge length triangulations","year":2017,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Cutting-plane method; Combinatorics; Minimax; Point (geometry); Integer programming; Integer (computer science); Triangulation; Set (abstract data type); Polynomial; Discrete mathematics; Algorithm; Computer science; Mathematical optimization; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634695,0.000183604,0.0003199354,0.001361465,0.001019072,0.0004804,0.001632982,0.00009071168,0.00003814348],"category_scores_gemma":[0.0002866601,0.0002000127,0.0002683778,0.0008334113,0.0001004243,0.002004635,0.0003593169,0.0002882896,0.0000254279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001717184,"about_ca_system_score_gemma":0.0004454317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008277709,"about_ca_topic_score_gemma":0.000002805544,"domain_scores_codex":[0.9981416,0.0001319523,0.0004941697,0.0002768386,0.0007107818,0.0002446338],"domain_scores_gemma":[0.9967085,0.0004334519,0.001189042,0.0004044939,0.001051395,0.0002131932],"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.00009278509,0.0002962043,0.00325731,0.00002728578,0.0002852811,0.0003559076,0.000453792,0.6130333,0.000324425,0.2570579,0.003250563,0.1215653],"study_design_scores_gemma":[0.007803072,0.0007766191,0.28401,0.0002046849,0.0001807422,0.0009294637,0.0003427974,0.5211851,0.001029951,0.04304926,0.1393479,0.001140408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1670082,0.00009082372,0.826097,0.001553663,0.00104642,0.00009270582,0.000006114082,0.00003839079,0.004066663],"genre_scores_gemma":[0.8988393,0.00001507731,0.09958776,0.000132625,0.0004258285,7.54933e-8,0.000009200569,0.000008720469,0.0009814389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7318311,"threshold_uncertainty_score":0.815628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02080231691856677,"score_gpt":0.2499672556472148,"score_spread":0.229164938728648,"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."}}