{"id":"W4416091488","doi":"10.1016/j.ic.2025.105378","title":"Approximation algorithms for the maximum path cover problem using long paths","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Approximation algorithm; Path (computing); Cover (algebra); Matching (statistics); Approximation theory; Stability (learning theory)","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.0003572849,0.00009827709,0.00008783622,0.0001489351,0.000441044,0.0005091534,0.0002136894,0.00004559374,0.000001574855],"category_scores_gemma":[0.00002215029,0.00007817383,0.00004412873,0.0003988551,0.00003806748,0.001672149,0.000100626,0.0000724948,0.000005138815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003535482,"about_ca_system_score_gemma":0.00006454995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002087791,"about_ca_topic_score_gemma":0.000001011495,"domain_scores_codex":[0.9992433,0.00002733033,0.00030735,0.0001194813,0.0001668329,0.0001357268],"domain_scores_gemma":[0.9993301,0.0001668558,0.000149795,0.0001397568,0.0001889088,0.00002459945],"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.000007309076,0.00001706389,0.00006373232,0.0001240273,0.00001840887,1.305611e-7,0.001005031,0.0206522,0.000005945476,0.1139829,0.0002702445,0.863853],"study_design_scores_gemma":[0.0004235187,0.00002453912,0.001389312,0.00004467266,0.000009287858,0.000006026008,0.0001071467,0.9289216,0.00004997219,0.06590571,0.003029667,0.00008853528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001132769,0.00009045679,0.9964991,0.0005664201,0.0003619785,0.0005935887,0.000006042316,0.0001044657,0.0006451308],"genre_scores_gemma":[0.3622543,0.00004245006,0.6356007,0.001728639,0.00006531214,0.0001319647,0.00009491613,0.000006507557,0.00007512736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9082694,"threshold_uncertainty_score":0.4909778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0260570322112164,"score_gpt":0.279263361594758,"score_spread":0.2532063293835415,"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."}}