{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689921,0.000199274,0.0002126552,0.0002566162,0.0002154876,0.0001444698,0.0004044739,0.0001529196,0.000007171409],"category_scores_gemma":[0.00009748254,0.0002299456,0.0001163258,0.0003416545,0.00005055952,0.0002389089,0.0006970919,0.000226972,0.00001024366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001554131,"about_ca_system_score_gemma":0.0002451619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001850816,"about_ca_topic_score_gemma":0.00003700305,"domain_scores_codex":[0.9987695,0.0000780636,0.0001645993,0.0007085368,0.00008648176,0.0001927717],"domain_scores_gemma":[0.9986833,0.0002616365,0.0001621242,0.0003826084,0.0003784324,0.000131862],"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.00005513059,0.0001262503,0.0002121655,0.00001634389,0.00005183944,0.00001489951,0.0001950188,0.3617434,0.00001212393,0.6351401,0.0003673436,0.002065431],"study_design_scores_gemma":[0.000834222,0.0001459213,0.001283866,0.00005718799,0.00004271646,0.000003041486,0.00006184164,0.9006988,0.00002968346,0.09399363,0.002565075,0.0002840085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2368266,0.00004250323,0.7603446,0.0002744626,0.0006629313,0.0003372602,0.00008148094,0.0000917652,0.001338471],"genre_scores_gemma":[0.9874044,0.00001664023,0.01042722,0.0001927777,0.0002108883,0.000001681847,0.0002008744,0.00001046918,0.001535055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7505778,"threshold_uncertainty_score":0.937691,"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."}}