{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007167431,0.001870985,0.002145535,0.001992551,0.001197942,0.002092961,0.003880842,0.001969795,0.0169469],"category_scores_gemma":[0.00376878,0.0008626518,0.001790176,0.004334701,0.0007691984,0.002896415,0.002855264,0.002017254,0.003052797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00208872,"about_ca_system_score_gemma":0.003295325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009040045,"about_ca_topic_score_gemma":0.0132219,"domain_scores_codex":[0.9987063,0.0002096288,0.00007634348,0.0002891528,0.0004066776,0.0003118105],"domain_scores_gemma":[0.9982153,0.0007840611,0.0001011412,0.0005143781,0.0002483398,0.0001367358],"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.001201449,0.0007343306,0.001943639,0.0005259648,0.0001687625,0.0002562847,0.0002486262,0.2598298,0.0115572,0.03010735,0.03780343,0.6556232],"study_design_scores_gemma":[0.0002078929,0.0001730805,0.0004866236,0.00003841963,0.00006712168,0.0002457266,0.0001097236,0.9655574,0.003748345,0.0226941,0.00664691,0.0000247084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09863346,0.001056088,0.8697698,0.001234082,0.0004854807,0.0008220607,0.002065643,0.005774952,0.02015842],"genre_scores_gemma":[0.1459995,0.0003201012,0.8417723,0.0003147543,0.0001023512,0.0004586714,0.002917846,0.0003960824,0.007718254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0169469,"threshold_uncertainty_score":0.05669308,"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."}}