{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853852,0.0005911613,0.001437187,0.001457408,0.001245146,0.005745805,0.002050847,0.002315668,0.006265806],"category_scores_gemma":[0.01096213,0.0007074572,0.0008957304,0.002742008,0.003098074,0.008536704,0.002430296,0.003516473,0.0009417349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001534439,"about_ca_system_score_gemma":0.001219176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001877521,"about_ca_topic_score_gemma":0.001678655,"domain_scores_codex":[0.9982521,0.0006100775,0.00007231827,0.0004177648,0.0004427733,0.0002049151],"domain_scores_gemma":[0.9932854,0.004942992,0.0004985574,0.0004946715,0.0004128845,0.000365516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008718199,0.0000562718,0.001089641,0.0002624821,0.00003376181,0.00008392209,0.0003212502,0.03334029,0.0008666434,0.9291422,0.007911411,0.02680497],"study_design_scores_gemma":[0.00001185145,0.000008417288,0.0002521437,0.00002379556,0.00001039696,0.0001322404,0.000131811,0.03815602,0.0003643532,0.9559444,0.004955317,0.000009238448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1594681,0.008349291,0.7533525,0.006022147,0.0006042343,0.0001390491,0.0009735702,0.0002826195,0.07080857],"genre_scores_gemma":[0.8173441,0.005650925,0.1510791,0.0007121937,0.001272591,0.0001711305,0.001306212,0.0003033631,0.02216054],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006265806,"threshold_uncertainty_score":0.02096123,"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."}}