{"id":"W1806592748","doi":"10.48550/arxiv.1501.01783","title":"Upper and Lower Bounds for Competitive Online Routing on Delaunay\\n Triangulations","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Upper and lower bounds; Computer science; Combinatorics; Routing (electronic design automation); Mathematics; Computer network; Mathematical analysis","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.005249359,0.003236701,0.00275108,0.002882495,0.003525433,0.007934424,0.008434386,0.004102716,0.02433653],"category_scores_gemma":[0.03861992,0.001535805,0.00252006,0.004138399,0.003245996,0.01327195,0.007035111,0.004665273,0.006340487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007573534,"about_ca_system_score_gemma":0.003965565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007141562,"about_ca_topic_score_gemma":0.009051842,"domain_scores_codex":[0.9904982,0.001852392,0.0004174364,0.001571735,0.003162325,0.002497864],"domain_scores_gemma":[0.961601,0.02542825,0.002571153,0.004916996,0.003102998,0.002379569],"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.00204925,0.0008856223,0.003695541,0.001507033,0.0002297288,0.0004739267,0.0006472644,0.4397719,0.01114106,0.3564378,0.03600499,0.1471559],"study_design_scores_gemma":[0.0001435773,0.0002217211,0.0005585675,0.0001450747,0.0001138039,0.0004355826,0.0001801961,0.862464,0.004263404,0.11957,0.01183234,0.00007168394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08393648,0.006461772,0.7721072,0.004804915,0.000634263,0.0008056113,0.002155928,0.004830382,0.1242634],"genre_scores_gemma":[0.5845473,0.004151711,0.3760922,0.002038017,0.001246931,0.001328375,0.003772091,0.002826486,0.02399698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02433653,"threshold_uncertainty_score":0.08141375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1012692610730367,"score_gpt":0.2269404376367928,"score_spread":0.1256711765637561,"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."}}