{"id":"W2990814010","doi":"10.4230/lipics.isaac.2019.46","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Combinatorics; Partition (number theory); Partition problem; Mathematics; Graph partition; Greedy algorithm; Discrete mathematics; Graph; Algorithm","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.002040576,0.002802852,0.002116435,0.001264049,0.001719576,0.0033338,0.003648435,0.002878772,0.0111605],"category_scores_gemma":[0.01009529,0.001065811,0.002572316,0.003045848,0.00157873,0.007747937,0.004435871,0.004932189,0.003530811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003438434,"about_ca_system_score_gemma":0.003991639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003010399,"about_ca_topic_score_gemma":0.003930849,"domain_scores_codex":[0.9974256,0.0005009015,0.0001195849,0.0007446724,0.0006501141,0.0005589799],"domain_scores_gemma":[0.996473,0.001826661,0.0003380679,0.000820634,0.0002414425,0.0003001401],"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.003309834,0.001709548,0.003881171,0.001754828,0.0003719124,0.0005771399,0.0009477215,0.3921585,0.02131805,0.1292226,0.08295203,0.3617967],"study_design_scores_gemma":[0.0003839076,0.0004054803,0.0009475661,0.0001401856,0.0001458026,0.0007808681,0.0002690279,0.7731145,0.005691837,0.2053926,0.01266898,0.00005916982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1244061,0.002962451,0.8297431,0.004940476,0.0005149971,0.0006793878,0.002302,0.004557821,0.02989368],"genre_scores_gemma":[0.3829511,0.0014679,0.5961637,0.001477204,0.0003563232,0.0008440699,0.004811336,0.001432992,0.01049542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0111605,"threshold_uncertainty_score":0.03733557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01753998775502832,"score_gpt":0.274830090119716,"score_spread":0.2572901023646877,"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."}}