{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002057989,0.0005670968,0.0005192966,0.0003001338,0.001315513,0.002188115,0.003604947,0.0003953965,0.00001777686],"category_scores_gemma":[0.000526572,0.0004230889,0.0005404454,0.0002180954,0.000138824,0.001012232,0.002429922,0.001165166,0.0001375035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001697863,"about_ca_system_score_gemma":0.0002785207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002146661,"about_ca_topic_score_gemma":0.00001354315,"domain_scores_codex":[0.9966007,0.0001076046,0.001186812,0.0005943717,0.0008596185,0.0006508334],"domain_scores_gemma":[0.9948198,0.0004967154,0.001214619,0.002765628,0.0005331089,0.0001701387],"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.000236903,0.001277555,0.003093904,0.00214659,0.001056233,0.00001588425,0.02475779,0.05235258,0.00005728999,0.7002091,0.04069944,0.1740967],"study_design_scores_gemma":[0.001690306,0.0003143666,0.004142673,0.0006839953,0.00007057456,0.00003341974,0.0002830709,0.8474855,0.001304436,0.09579783,0.04682556,0.001368276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1025239,0.00006323653,0.8759494,0.003228275,0.004968219,0.002409152,0.0004823249,0.0003365427,0.01003885],"genre_scores_gemma":[0.973402,0.00003459713,0.0225355,0.002085591,0.0005612815,0.0002670363,0.0006586078,0.00003432812,0.0004210215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8708781,"threshold_uncertainty_score":0.9999846,"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."}}