{"id":"W4389488492","doi":"10.1007/978-3-031-49611-0_33","title":"An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Approximation algorithm; Vertex cover; Vertex (graph theory); Algorithm; Combinatorics; Computer science; Graph; Matching (statistics); Running time; Path (computing); Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001072749,0.0005220581,0.0005019107,0.0007258885,0.0004741049,0.001026912,0.003818025,0.0003014951,0.000006650577],"category_scores_gemma":[0.00006552639,0.0005263974,0.0001649627,0.0007537206,0.0004794169,0.001321478,0.0008350256,0.0005303011,0.00002759089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001981176,"about_ca_system_score_gemma":0.000271893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002674409,"about_ca_topic_score_gemma":0.00003301604,"domain_scores_codex":[0.9959837,0.00003097635,0.0005275581,0.001738443,0.0009618901,0.0007574577],"domain_scores_gemma":[0.9973116,0.0006205369,0.0002711646,0.001349973,0.0002442393,0.0002025094],"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.000002250427,0.00003264513,0.00000272043,0.00004012352,0.000009961971,0.00001225491,0.0004179546,0.005379354,0.0001603529,0.01906727,0.00005273455,0.9748224],"study_design_scores_gemma":[0.0002085587,0.0002165869,0.00001082984,0.0001455686,0.000006170963,0.00001252084,2.714558e-7,0.7529326,0.001242823,0.2433606,0.00136689,0.0004965843],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000215033,0.0002008943,0.9953375,0.000270419,0.002602033,0.0006266085,0.00005912846,0.0004852353,0.0003966123],"genre_scores_gemma":[0.002864241,0.00005208129,0.9953383,0.0006805144,0.0005720935,0.0000523044,0.00005496575,0.00006125162,0.000324245],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9743258,"threshold_uncertainty_score":0.9997188,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02366334272043781,"score_gpt":0.2625619495429864,"score_spread":0.2388986068225486,"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."}}