{"id":"W3027090837","doi":"10.1007/s00453-020-00716-4","title":"The Inverse Voronoi Problem in Graphs I: Hardness","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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; Parameterized complexity; Combinatorics; Mathematics; Pathwidth; Treewidth; Discrete mathematics; Shortest path problem; Planar graph; Chordal graph; Graph; Geometry; Line graph","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.0001750274,0.00007153048,0.00006859963,0.00004177161,0.0001266624,0.0001175807,0.0004701798,0.00002539626,0.000004814784],"category_scores_gemma":[0.00003363422,0.0000556001,0.000034092,0.0006871585,0.0000258231,0.0002495623,0.0001324556,0.00009979257,0.00006910197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657549,"about_ca_system_score_gemma":0.00006618079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001345914,"about_ca_topic_score_gemma":0.00002526098,"domain_scores_codex":[0.9992357,0.0000563668,0.0001551861,0.00022783,0.0001668629,0.0001580019],"domain_scores_gemma":[0.9996143,0.00007000098,0.00003881484,0.000157699,0.00004694702,0.00007226403],"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.00001522606,0.00007138861,0.0003413879,0.00001660896,0.00002536204,0.00003039673,0.002412329,0.00648563,0.0007890228,0.20776,0.02757907,0.7544736],"study_design_scores_gemma":[0.0004157563,0.00007303587,0.002055555,0.000006544837,0.000002620202,0.000006065799,0.00004398931,0.8633711,0.00147715,0.02739881,0.1049777,0.0001716081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01250811,0.0002526905,0.9519207,0.0322671,0.0006947701,0.0003446017,0.000002395615,0.0001622991,0.001847293],"genre_scores_gemma":[0.747198,0.0000773047,0.245532,0.005933482,0.0004213743,0.00009661835,0.00001805766,0.0000177915,0.0007054025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8568855,"threshold_uncertainty_score":0.2267306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0159190884315145,"score_gpt":0.2214472438777045,"score_spread":0.20552815544619,"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."}}