{"id":"W3092815978","doi":"10.1007/s00453-020-00774-8","title":"The Inverse Voronoi Problem in Graphs II: Trees","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Combinatorics; Mathematics; Shortest path problem; Inverse; Omega; Metric (unit); Binary logarithm; Tree (set theory); Upper and lower bounds; Path (computing); Discrete mathematics; Graph; Physics; Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0002846339,0.0001879108,0.0001902488,0.00008363782,0.0004694979,0.0001873101,0.001750529,0.00006190611,0.00001500257],"category_scores_gemma":[0.00004998327,0.0001438528,0.000120634,0.001132408,0.000178116,0.0003876017,0.0007537436,0.000327423,0.00006558223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002685187,"about_ca_system_score_gemma":0.00007077555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009691664,"about_ca_topic_score_gemma":0.0002978679,"domain_scores_codex":[0.9983307,0.0001002757,0.0003221137,0.0004886517,0.0003023759,0.0004558758],"domain_scores_gemma":[0.9990094,0.0001698196,0.0000798027,0.0005262385,0.00004599336,0.0001686888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001842387,0.0001612779,0.0004631107,0.00001612594,0.00005084892,0.00007975096,0.005020981,0.0001727279,0.000249521,0.3209757,0.01892741,0.6538641],"study_design_scores_gemma":[0.001120434,0.0004274282,0.002687221,0.00003444766,0.000009675967,0.00002116885,0.0002542605,0.5610643,0.001046199,0.1963883,0.2363396,0.0006069208],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05576105,0.003081914,0.6426828,0.2588414,0.003439073,0.003044508,0.00004953427,0.00272912,0.03037063],"genre_scores_gemma":[0.4927835,0.0004306979,0.4963008,0.008681867,0.0006253158,0.0002149241,0.00001267397,0.00006442124,0.0008858269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6532572,"threshold_uncertainty_score":0.5866147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02106676303063337,"score_gpt":0.2254103665867705,"score_spread":0.2043436035561371,"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."}}