{"id":"W4319923645","doi":"10.21203/rs.3.rs-2561563/v1","title":"Approximation algorithms for covering vertices by long paths","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada; Shanghai Polytechnic University","keywords":"Approximation algorithm; Mathematics; Disjoint sets; Vertex cover; Combinatorics; Vertex (graph theory); Maximum cut; Algorithm; Discrete mathematics; Graph","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.001046331,0.0002005495,0.0002248703,0.0002895131,0.0001550922,0.0003473593,0.0003106896,0.0003030306,0.00004859138],"category_scores_gemma":[0.0002397585,0.0002184594,0.00009838837,0.000316344,0.00003565172,0.0001186163,0.000262925,0.0007190741,0.0001125465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002070751,"about_ca_system_score_gemma":0.00006191159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006323361,"about_ca_topic_score_gemma":0.00002132796,"domain_scores_codex":[0.9981618,0.00007956281,0.0002770019,0.0003665423,0.000584188,0.0005309052],"domain_scores_gemma":[0.9988554,0.0003250178,0.00003622764,0.0003801391,0.0002854145,0.0001178599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001438199,0.00003636032,0.0004519753,0.008555402,0.000108823,0.000005202775,0.00079906,0.9493092,0.0003191333,0.000227349,0.02334764,0.01682543],"study_design_scores_gemma":[0.0002861666,0.00004469879,0.0002605284,0.000772965,0.000009393908,5.188733e-7,0.0001144955,0.9825366,0.001506575,0.001195256,0.01297252,0.0003002522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005853297,0.002787351,0.9775431,0.0004096366,0.002116388,0.004044703,0.001141425,0.002520459,0.003583624],"genre_scores_gemma":[0.9167555,0.007395236,0.0405045,0.00005059086,0.001821889,0.006828933,0.01184307,0.001167316,0.01363296],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9370386,"threshold_uncertainty_score":0.8908517,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1127129879599328,"score_gpt":0.3832666093484806,"score_spread":0.2705536213885478,"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."}}