{"id":"W2592215285","doi":"10.1007/s00454-016-9842-y","title":"Upper and Lower Bounds for Online Routing on Delaunay Triangulations","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Upper and lower bounds; Routing (electronic design automation); Constrained Delaunay triangulation; Combinatorics; Computer network; Algorithm; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0003579615,0.000211914,0.0001993469,0.0004380217,0.0003660336,0.0001990179,0.0002979665,0.00007880088,0.00003601408],"category_scores_gemma":[0.0003132168,0.0001631226,0.0001305291,0.0006678053,0.00006386035,0.0005552877,0.0001745444,0.00008095875,0.00002974351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007197136,"about_ca_system_score_gemma":0.0001160769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003105538,"about_ca_topic_score_gemma":0.000002571761,"domain_scores_codex":[0.998233,0.00005978589,0.0003901982,0.0005774189,0.000432922,0.0003067408],"domain_scores_gemma":[0.9978354,0.001331817,0.0001486787,0.0002477297,0.0002902508,0.0001461503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000101841,0.0002304553,0.001253144,0.00001897734,0.00009556877,0.000004437181,0.000160126,0.05229248,0.0006856018,0.6353212,0.001514221,0.308322],"study_design_scores_gemma":[0.00389466,0.0007234425,0.1111387,0.0001421385,0.00003701875,0.0000463392,0.00003271929,0.6592754,0.0004137538,0.20622,0.01724665,0.0008291687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1622979,0.00008980699,0.8328531,0.003522798,0.0004671448,0.0002656532,0.0001157079,0.0001115827,0.0002762882],"genre_scores_gemma":[0.8720882,0.00000573456,0.1258426,0.0008636712,0.0003151048,0.00003117583,0.0001794797,0.0000164908,0.0006575024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7097903,"threshold_uncertainty_score":0.6651947,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01888128039390763,"score_gpt":0.2841021751962053,"score_spread":0.2652208948022977,"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."}}