{"id":"W2119251691","doi":"10.1016/j.tcs.2004.05.019","title":"Competitive online routing in geometric graphs","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Mathematics; Routing (electronic design automation); Shortest path problem; Convex polygon; Regular polygon; Discrete mathematics; Computer science; Graph; Geometry","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.001430493,0.0001490097,0.0001866673,0.0008326683,0.0002522944,0.0003834532,0.002141365,0.00004219154,0.00002418599],"category_scores_gemma":[0.0001679681,0.0001282851,0.00004810982,0.006179221,0.001533615,0.0007845749,0.0009841003,0.0002872534,0.00005779909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001302586,"about_ca_system_score_gemma":0.0002126587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145669,"about_ca_topic_score_gemma":0.000006099002,"domain_scores_codex":[0.9975571,0.00008785476,0.0003064604,0.0006554699,0.00072674,0.0006663959],"domain_scores_gemma":[0.9987944,0.0001800256,0.00005323183,0.0005092744,0.0002024863,0.0002605336],"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.000001763143,0.0001342516,0.0001426405,0.000002404693,0.000001026986,0.00001782862,0.0003802846,0.0074677,0.00006339829,0.9810023,0.000001500529,0.01078486],"study_design_scores_gemma":[0.0008000761,0.0002354839,0.005271269,0.00006688098,0.00000103959,0.00003071594,0.00002295338,0.6282299,0.001036537,0.3639921,0.00004008141,0.0002729342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02469453,0.00001255412,0.9681175,0.001873831,0.000257678,0.0001756468,0.000001333619,0.000169112,0.00469776],"genre_scores_gemma":[0.7265413,0.000008162863,0.272785,0.0006307288,0.00002397706,0.000002672924,0.000001032949,0.000004225313,0.000002909704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7018468,"threshold_uncertainty_score":0.5650669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01431149959555006,"score_gpt":0.2694103437007924,"score_spread":0.2550988441052424,"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."}}