{"id":"W1982352654","doi":"10.1016/j.laa.2004.09.014","title":"On the difference between the maximum multiplicity and path cover number for tree-like graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Multiplicity (mathematics); Indifference graph; Disjoint sets; Induced path; Vertex cover; Discrete mathematics; Chordal graph; Longest path problem; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004397557,0.0009739951,0.001882558,0.004635233,0.001894202,0.003738638,0.003568306,0.003198026,0.006552522],"category_scores_gemma":[0.03288324,0.0009492655,0.0009159894,0.003758168,0.006076077,0.01356482,0.003226703,0.004436148,0.0007354778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00204126,"about_ca_system_score_gemma":0.0007976293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006447103,"about_ca_topic_score_gemma":0.0007762371,"domain_scores_codex":[0.9974689,0.001029268,0.0001285502,0.0005737374,0.0005208952,0.0002785756],"domain_scores_gemma":[0.951307,0.03993811,0.003295674,0.001908718,0.001314572,0.002235953],"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.0006133103,0.0001211131,0.003417068,0.0003650684,0.00007119258,0.0002192923,0.0005688426,0.01984639,0.004121549,0.9438955,0.004827677,0.02193296],"study_design_scores_gemma":[0.0000428241,0.0000772011,0.001616563,0.0000677476,0.0000542678,0.0003890991,0.0001721966,0.06150078,0.001359351,0.9325287,0.002129201,0.00006206526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.685351,0.009413497,0.2223928,0.009610647,0.00116258,0.00006442464,0.0007033041,0.0004683585,0.07083343],"genre_scores_gemma":[0.9633545,0.002607593,0.02632608,0.000591531,0.001241602,0.00009160702,0.0003203488,0.0001921946,0.00527454],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006552522,"threshold_uncertainty_score":0.02325678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03281664505513261,"score_gpt":0.2884568871871658,"score_spread":0.2556402421320332,"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."}}