{"id":"W4399075280","doi":"10.1007/s00453-024-01242-3","title":"Approximation Algorithms for Covering Vertices by Long Paths","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology of the People's Republic of China","keywords":"Theory of computation; Combinatorics; Approximation algorithm; Computer science; Algorithm; Mathematics; Discrete mathematics","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.0004583895,0.0001543353,0.0001427463,0.0001450232,0.000156084,0.0004304623,0.0007386078,0.00006520467,0.00001068023],"category_scores_gemma":[0.00007147083,0.0001449346,0.0000927975,0.0005406469,0.0000601853,0.001141773,0.0001982359,0.0001668399,0.0000794151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007451811,"about_ca_system_score_gemma":0.00005704435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006501674,"about_ca_topic_score_gemma":7.23586e-7,"domain_scores_codex":[0.9984189,0.00004768547,0.0002065126,0.0005511155,0.0003363539,0.000439424],"domain_scores_gemma":[0.998956,0.0004088672,0.00003226969,0.0004141144,0.0000808921,0.0001078334],"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.00000871902,0.00004352375,0.000008603729,0.0001349539,0.00005102159,0.00002483127,0.0003290422,0.00007652154,0.004328645,0.08233606,0.002243124,0.9104149],"study_design_scores_gemma":[0.0002350067,0.0001174819,0.00001921002,0.00005468896,0.000008226085,0.00001919425,0.00002130164,0.8778918,0.02928025,0.06559467,0.02651399,0.0002441925],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008950653,0.001687196,0.9950091,0.0005209776,0.0005663073,0.0003996365,0.00003245175,0.0004621198,0.0004271441],"genre_scores_gemma":[0.2495987,0.0001576541,0.7453951,0.0003424162,0.0005816766,0.0006642406,0.00009633446,0.0001098481,0.003054038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9101707,"threshold_uncertainty_score":0.5910261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02174289278522585,"score_gpt":0.3087261305536571,"score_spread":0.2869832377684312,"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."}}