{"id":"W2783565018","doi":"10.20382/jocg.v9i1a15","title":"Routing on the Visibility Graph","year":2017,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Visibility graph; Equal-cost multi-path routing; Computer science; Combinatorics; Routing (electronic design automation); Static routing; Visibility; Graph; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Computer network; Routing protocol; Geography","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040769,0.0006567721,0.0009048652,0.000575473,0.0008957812,0.001632161,0.001276647,0.0008905097,0.003353286],"category_scores_gemma":[0.004198425,0.0004783192,0.0006971386,0.001020175,0.0009843882,0.003347419,0.002028511,0.001107254,0.0004707037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052387,"about_ca_system_score_gemma":0.0009262375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003587725,"about_ca_topic_score_gemma":0.003577227,"domain_scores_codex":[0.9990941,0.0002075692,0.0000409342,0.0002965151,0.0001603971,0.0002003753],"domain_scores_gemma":[0.9982168,0.0009129169,0.0002270625,0.0004387598,0.0001145906,0.00008985668],"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.0003788674,0.00007698418,0.00143316,0.0003519623,0.00009441307,0.0003285125,0.0003680449,0.6569765,0.01385951,0.1856804,0.007587892,0.1328638],"study_design_scores_gemma":[0.00004944816,0.0001188969,0.0005555242,0.00002891932,0.00004216654,0.0002130999,0.0001543768,0.7754328,0.005498437,0.2074938,0.01038839,0.0000241383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09235077,0.0006276974,0.8962857,0.000733796,0.00007300779,0.0001020176,0.0004612422,0.0007963544,0.008569422],"genre_scores_gemma":[0.7282296,0.0009593164,0.2629793,0.0001861927,0.000099629,0.0001701631,0.00125893,0.0003259602,0.005790908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003587725,"threshold_uncertainty_score":0.01121789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04137934408100575,"score_gpt":0.2961158290571426,"score_spread":0.2547364849761369,"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."}}