{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002223588,0.0001591677,0.0001509754,0.00002210763,0.0007594974,0.00004776926,0.000229207,0.00007503872,0.00001956789],"category_scores_gemma":[0.0000794376,0.00009071944,0.00006961753,0.0002060681,0.0001609802,0.00003776103,0.0000561495,0.0001691458,0.00003853972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007425077,"about_ca_system_score_gemma":0.00001411175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006179507,"about_ca_topic_score_gemma":0.000007748706,"domain_scores_codex":[0.999202,0.00003287737,0.0002049314,0.0002715512,0.0001076342,0.0001809947],"domain_scores_gemma":[0.9977219,0.001619932,0.00009437965,0.0004331376,0.00005731311,0.00007332842],"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.000006435065,0.00008649869,0.0003712306,0.00001939102,0.000027408,3.104433e-8,0.0002576847,9.081578e-7,0.0003099842,0.9970471,0.0002484057,0.001624965],"study_design_scores_gemma":[0.0003690221,0.00002646466,0.005752645,0.00001367617,0.00007526284,0.000002464543,0.00009361973,0.0001286774,0.001209273,0.987914,0.004287987,0.0001269093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9363593,0.00005348228,0.05714161,0.003311828,0.00001412757,0.001998083,0.0002347475,0.00007748498,0.0008093794],"genre_scores_gemma":[0.9956512,0.00006125336,0.001805309,0.0005753438,0.00007644816,0.001527136,0.00002429935,0.00002131457,0.0002576668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05929197,"threshold_uncertainty_score":0.5841517,"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."}}