{"id":"W1988353915","doi":"10.1016/j.laa.2004.06.019","title":"Computation of minimal rank and path cover number for certain graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Cover (algebra); Disjoint sets; Vertex (graph theory); Path (computing); Vertex cover; Discrete mathematics; Graph; Computer science","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.0001332555,0.0001017327,0.0001566517,0.00004035481,0.0001695672,0.00001325798,0.00006436109,0.0000640462,0.00001268679],"category_scores_gemma":[0.0000380294,0.00009567421,0.00005057985,0.0001763733,0.00008061339,0.00006333958,0.000021625,0.00005397146,0.00001006286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000489575,"about_ca_system_score_gemma":0.00001844725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003309506,"about_ca_topic_score_gemma":0.000001762985,"domain_scores_codex":[0.999364,0.00001377078,0.0002447803,0.0001950034,0.00006995309,0.000112453],"domain_scores_gemma":[0.9993324,0.0002595461,0.0001111653,0.0001362038,0.00009845686,0.00006221018],"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.00001407917,0.0001311132,0.00009763869,0.0001104114,0.00002163195,4.438648e-8,0.0002815726,0.00001215256,0.001865567,0.996446,0.0001433416,0.0008764362],"study_design_scores_gemma":[0.0008377607,0.00003793665,0.0005332395,0.00002087275,0.00007062,0.000006455542,0.0001282015,0.0007691705,0.002914108,0.9920221,0.002539766,0.0001197631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8452337,0.0001645511,0.1517942,0.000584557,0.00001205713,0.001284637,0.0001538794,0.00005782416,0.0007145879],"genre_scores_gemma":[0.9736887,0.00005621766,0.02555738,0.00007169908,0.00003477511,0.0004411854,0.00004393825,0.00001650908,0.00008954286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.128455,"threshold_uncertainty_score":0.3901481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02397068020351504,"score_gpt":0.3067599322323091,"score_spread":0.282789252028794,"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."}}