{"id":"W4304127965","doi":"10.1016/j.comgeo.2022.101948","title":"On path-greedy geometric spanners","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spanner; Planarity testing; Path (computing); Path graph; Shortest path problem; Line segment; Greedy algorithm; Distance; Graph; Discrete mathematics; Computer science; Algorithm; Line graph; Geometry; Graph power","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006753884,0.0002317278,0.000212714,0.001865448,0.0008676472,0.0001776256,0.001045731,0.00004291513,0.0005175326],"category_scores_gemma":[0.0001804682,0.0002620493,0.0001514156,0.005946114,0.00003753035,0.0003604076,0.0006509061,0.0003773693,0.0003130471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002555559,"about_ca_system_score_gemma":0.0002311771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006836024,"about_ca_topic_score_gemma":2.545633e-7,"domain_scores_codex":[0.9968798,0.0001818118,0.0003933073,0.0006912832,0.00146905,0.000384816],"domain_scores_gemma":[0.9982134,0.0008139435,0.0001856356,0.0004191396,0.0001989659,0.0001689177],"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.00001421763,0.0002097082,0.0001491112,0.000005634346,0.00002591698,0.00002596215,0.00008222261,0.76693,0.00002065571,0.1917247,0.01425441,0.02655745],"study_design_scores_gemma":[0.001443204,0.0009169886,0.02263457,0.00000946849,0.00001335029,0.0002089079,0.00007939315,0.7750059,0.0001184191,0.1535685,0.04521475,0.0007865236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1072543,0.0003355974,0.8857601,0.001347409,0.001585447,0.0002440273,0.00003863223,0.0002982047,0.003136274],"genre_scores_gemma":[0.9619417,0.000003316917,0.03385334,0.002760194,0.0001618292,0.00007848925,0.0002136159,0.00001880499,0.000968677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8546874,"threshold_uncertainty_score":0.9999832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01421161799262394,"score_gpt":0.2364928301784987,"score_spread":0.2222812121858747,"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."}}