{"id":"W7110338092","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche; National Science Foundation","keywords":"Path (computing); Plane (geometry); Upper and lower bounds; Point (geometry); Set (abstract data type); Simple (philosophy)","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.001930194,0.002025324,0.001634084,0.003096829,0.001762324,0.003797979,0.003388628,0.002025985,0.02236641],"category_scores_gemma":[0.01558164,0.0009756316,0.0023182,0.00420204,0.002228369,0.01017032,0.005511657,0.004869164,0.005398398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002945814,"about_ca_system_score_gemma":0.001611329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005257579,"about_ca_topic_score_gemma":0.004900374,"domain_scores_codex":[0.9956663,0.0004738443,0.0001924095,0.0008167487,0.001696546,0.001154157],"domain_scores_gemma":[0.9922667,0.004273487,0.0003719859,0.001628002,0.001037661,0.0004222002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001861247,0.0004693352,0.006383753,0.001451494,0.0002322804,0.0008621868,0.00103873,0.200211,0.03843392,0.2677536,0.06851052,0.412792],"study_design_scores_gemma":[0.0001361673,0.0005116923,0.003201548,0.0003449795,0.0002869102,0.001331181,0.0003417332,0.6005782,0.01708257,0.2918651,0.08418187,0.0001380535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08899309,0.007434247,0.8105661,0.003073843,0.0007114247,0.0003627813,0.002475569,0.004944452,0.08143848],"genre_scores_gemma":[0.4304154,0.004853092,0.5357825,0.001114047,0.0007558268,0.0006434918,0.004088277,0.001741118,0.02060638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02236641,"threshold_uncertainty_score":0.07482308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009719720804736804,"score_gpt":0.2711440292397116,"score_spread":0.2614243084349748,"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."}}