{"id":"W4409350685","doi":"10.1007/s10878-025-01279-2","title":"An improved approximation algorithm for covering vertices by $$4^+$$-paths","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Approximation algorithm; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Computer science","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.0005053507,0.0001158104,0.0002127648,0.0001536991,0.0001600249,0.0003354349,0.0006214704,0.00009202527,0.000002716424],"category_scores_gemma":[0.00009529393,0.0001034665,0.0000707893,0.0002966058,0.00001436042,0.002373243,0.00007481955,0.0001098347,2.867904e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008443047,"about_ca_system_score_gemma":0.0001553917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005480426,"about_ca_topic_score_gemma":4.303077e-8,"domain_scores_codex":[0.9988939,0.00006609914,0.0004711946,0.0001768772,0.000242386,0.0001495221],"domain_scores_gemma":[0.9985905,0.00009828796,0.0004479827,0.000250694,0.000536849,0.00007562981],"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.0003154212,0.001434544,0.00005383405,0.000113136,0.0001703883,0.000004888488,0.0005713715,0.225487,0.01356864,0.05729539,0.01178517,0.6892002],"study_design_scores_gemma":[0.001868342,0.0003978321,0.00000962682,0.00004696386,0.00002189723,0.000003109744,0.00001681585,0.9833885,0.005148797,0.006401235,0.002592137,0.0001047864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002819979,0.0001721579,0.9943567,0.0001625905,0.004697895,0.0002153209,0.000008229757,0.00003705039,0.00006807202],"genre_scores_gemma":[0.01885777,0.00006035373,0.9806039,0.00009553284,0.0003008085,0.00001081214,0.00003462205,0.0000101256,0.00002606995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7579015,"threshold_uncertainty_score":0.4219242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00530167464961042,"score_gpt":0.2531190343717903,"score_spread":0.2478173597221799,"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."}}