{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002221532,0.002719491,0.002779927,0.002308966,0.001538128,0.003948875,0.00509314,0.003134302,0.0139667],"category_scores_gemma":[0.0156655,0.001684422,0.002019129,0.006647052,0.001954124,0.008704428,0.003744086,0.005235612,0.002368684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00332993,"about_ca_system_score_gemma":0.002065977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005442903,"about_ca_topic_score_gemma":0.006324263,"domain_scores_codex":[0.9979727,0.0006217753,0.00009058938,0.0004879767,0.0004541911,0.0003728496],"domain_scores_gemma":[0.9912279,0.006231081,0.0004565221,0.001338628,0.0003530045,0.0003929532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008690566,0.0006356096,0.001664548,0.0008489969,0.0002123947,0.000134046,0.0004730876,0.5722913,0.002363321,0.1490997,0.03792199,0.233486],"study_design_scores_gemma":[0.0001416387,0.00007742087,0.0002570575,0.00006910901,0.00006242044,0.0001108943,0.0001125179,0.766519,0.0008885391,0.2265624,0.005179043,0.00001993495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04729226,0.002966209,0.9291726,0.001852472,0.0002694286,0.000219009,0.001062126,0.001575281,0.01559069],"genre_scores_gemma":[0.2789962,0.002741593,0.6962556,0.0006476988,0.0004510832,0.0005744519,0.003188137,0.001138612,0.0160067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0139667,"threshold_uncertainty_score":0.04672331,"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."}}