{"id":"W2082273344","doi":"10.1016/s0304-3975(02)00577-7","title":"On the k-path partition of graphs","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Indifference graph; Longest path problem; Discrete mathematics; Bipartite graph; Cograph; Pathwidth; Hamiltonian path problem; Complete bipartite graph; Partition (number theory); Frequency partition of a graph; Hamiltonian path; Graph; 1-planar graph; Line graph; Graph power","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003219266,0.0001308041,0.0001423087,0.0001865167,0.0003943401,0.0001396819,0.002474797,0.00002944387,0.00007471521],"category_scores_gemma":[0.0004868286,0.00007990205,0.00007451651,0.00203335,0.004520906,0.000369831,0.0003677867,0.0002216363,0.0000631693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002540389,"about_ca_system_score_gemma":0.00009409711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.225612e-7,"about_ca_topic_score_gemma":8.346612e-8,"domain_scores_codex":[0.9974553,0.0003769122,0.0002184891,0.0005015952,0.0009416962,0.0005059841],"domain_scores_gemma":[0.9973496,0.0010374,0.00006610026,0.001181219,0.0002036935,0.0001619552],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005778811,0.00005568257,0.00002197551,0.000002424966,0.000001991301,0.000002917648,0.0001377267,0.0001423534,0.0008923732,0.9955205,0.00003494986,0.003181341],"study_design_scores_gemma":[0.00009776585,0.0002569827,0.0001631166,0.00001835701,0.000001052437,0.00001074957,0.000005516613,0.0457783,0.03089577,0.9226259,0.00004961868,0.00009690084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07512289,0.00001418295,0.9132496,0.0006221931,0.0002372095,0.0001721165,7.776185e-7,0.00006914843,0.01051196],"genre_scores_gemma":[0.9581968,0.000003352065,0.04132639,0.0004416036,0.00001042666,0.00000976929,9.517568e-8,0.000004922326,0.000006669708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8830739,"threshold_uncertainty_score":0.9981882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01730689189145129,"score_gpt":0.2803895109935752,"score_spread":0.2630826191021239,"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."}}