{"id":"W2763773774","doi":"10.1016/j.jcss.2015.06.011","title":"The complexity of minimum-length path decompositions","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Pathwidth; Discrete mathematics; Path (computing); Time complexity; Graph; Generalization; Longest path problem; Chordal graph; Line graph; Computer science","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.003450248,0.00008419988,0.0002360796,0.0001586676,0.0003826215,0.0002613543,0.001442751,0.00002093567,3.009587e-7],"category_scores_gemma":[0.0000288373,0.00004654361,0.00007727106,0.0004917415,0.001016159,0.0005836302,0.0002621365,0.0001189524,0.000001550344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000275565,"about_ca_system_score_gemma":0.0001969063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004162877,"about_ca_topic_score_gemma":0.000001993612,"domain_scores_codex":[0.9980801,0.0003364386,0.0004809021,0.0001462578,0.0007452578,0.0002110568],"domain_scores_gemma":[0.9982823,0.0004437181,0.000386684,0.0002249049,0.0004704482,0.0001919961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002869388,0.00006009045,0.001322343,0.00003476277,0.00003494353,0.00002751222,0.001651455,0.0008186145,0.0001702281,0.9777994,0.001110715,0.01694127],"study_design_scores_gemma":[0.002169237,0.004636428,0.01055904,0.0006729768,0.00002673995,0.004260204,0.005099404,0.6870642,0.001104548,0.2806751,0.003260238,0.0004719287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1179129,0.001399058,0.8768971,0.001185743,0.0009504835,0.0001071315,0.00000172672,0.00001823931,0.001527644],"genre_scores_gemma":[0.921352,0.00002005686,0.07849257,0.00002225739,0.0001004807,7.329951e-7,3.852379e-8,0.00000184942,0.00001006293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8034391,"threshold_uncertainty_score":0.374408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08791787131458557,"score_gpt":0.3316694274632337,"score_spread":0.2437515561486482,"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."}}