{"id":"W3112211311","doi":"10.4230/lipics.esa.2025.75","title":"An Improved Bound for Plane Covering Paths","year":2020,"lang":"en","type":"preprint","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":"Carleton University; University of Windsor","funders":"Agence Nationale de la Recherche","keywords":"Kernelization; Randomized algorithm; Algorithm; Set cover problem; Upper and lower bounds; Mathematics; Deterministic algorithm; Line (geometry); Cover (algebra); Computational geometry; Monte Carlo method; Combinatorics; Time complexity; Set (abstract data type); Parameterized complexity; Computer science; Geometry; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"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.001847076,0.00185909,0.001593047,0.003012931,0.001683876,0.003670595,0.003240362,0.002003001,0.02086045],"category_scores_gemma":[0.01500074,0.0009233694,0.002187304,0.004095627,0.002106017,0.009285096,0.005379912,0.004703013,0.004811791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002710401,"about_ca_system_score_gemma":0.001427934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004556354,"about_ca_topic_score_gemma":0.004264653,"domain_scores_codex":[0.9960409,0.0004513787,0.0001768992,0.000741877,0.001566123,0.001022724],"domain_scores_gemma":[0.9927206,0.0040417,0.0003465702,0.001580513,0.0009278984,0.0003826408],"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.001721481,0.0004266621,0.006606558,0.001349637,0.0002178534,0.0008329178,0.0009978117,0.198915,0.03720726,0.2883492,0.061681,0.4016947],"study_design_scores_gemma":[0.000117863,0.0004202352,0.003042166,0.000305674,0.0002464296,0.001215337,0.0003100456,0.6031232,0.01675585,0.2956488,0.07869613,0.0001182356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09562945,0.007164585,0.8061525,0.003127381,0.0006645863,0.0003351654,0.002430324,0.004504127,0.07999189],"genre_scores_gemma":[0.4417218,0.004609021,0.5260697,0.001010693,0.0006996507,0.0005875927,0.00390327,0.001672442,0.01972586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02086045,"threshold_uncertainty_score":0.06978518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02555340797288808,"score_gpt":0.2810816493010732,"score_spread":0.2555282413281851,"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."}}