{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254041,0.001567882,0.001683024,0.001744105,0.001054284,0.001540695,0.002896152,0.00166216,0.01778732],"category_scores_gemma":[0.007808297,0.0008948198,0.001111495,0.002337371,0.002085932,0.003913868,0.006238125,0.002418497,0.002939103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008517328,"about_ca_system_score_gemma":0.0009783487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001937992,"about_ca_topic_score_gemma":0.002738536,"domain_scores_codex":[0.9987581,0.0003397758,0.00005599607,0.000256275,0.0004447612,0.0001451548],"domain_scores_gemma":[0.9974375,0.001473593,0.0001547958,0.0004556119,0.000276026,0.0002025357],"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.0002899861,0.0001642562,0.0007203217,0.0002742145,0.00005460072,0.0001558107,0.0002651371,0.3622818,0.003857224,0.4527773,0.01311217,0.1660472],"study_design_scores_gemma":[0.00003255667,0.00009207825,0.0001158621,0.0000522801,0.00001749451,0.00008146307,0.00007653704,0.4932199,0.001046554,0.4995116,0.005739274,0.00001451575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02010026,0.0003816837,0.9612358,0.000291659,0.0001471488,0.0001218565,0.0002048664,0.0006217693,0.01689485],"genre_scores_gemma":[0.2760803,0.001195516,0.6917021,0.0004991594,0.0002301233,0.000356124,0.001333121,0.001028123,0.02757548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01778732,"threshold_uncertainty_score":0.05950445,"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."}}