{"id":"W2089930092","doi":"10.1016/j.laa.2004.04.007","title":"The Moore–Penrose inverse of matrices with an acyclic bipartite graph","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Inverse; Square matrix; Complete bipartite graph; Diagonal; Matrix (chemical analysis); Moore–Penrose pseudoinverse; Diagonally dominant matrix; Block matrix; Rank (graph theory); Diagonal matrix; Graph; Discrete mathematics; Symmetric matrix; Invertible matrix; Pure mathematics; Eigenvalues and eigenvectors; Geometry","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.0001555546,0.00008716642,0.00008724019,0.00004981744,0.0003115811,0.00007325604,0.000476636,0.0000298684,0.000003413882],"category_scores_gemma":[0.000006658487,0.00005469013,0.0000248829,0.0005133614,0.0001003886,0.00031942,0.00007878472,0.0000736357,0.00002463943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003929854,"about_ca_system_score_gemma":0.00003427158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124856,"about_ca_topic_score_gemma":0.00001860604,"domain_scores_codex":[0.9993504,0.00002394986,0.0001526692,0.0002134423,0.0001179866,0.0001415724],"domain_scores_gemma":[0.9992623,0.00006700459,0.00008769133,0.0004314159,0.00006019041,0.00009141237],"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.000006734301,0.00008044006,0.00006727219,0.00001299433,0.00001300201,6.335151e-7,0.0003363475,0.0001530922,0.0008149867,0.9900208,0.00001435394,0.008479408],"study_design_scores_gemma":[0.002708547,0.000998994,0.004764698,0.00007779371,0.0001119885,0.00009604346,0.0006540983,0.05376964,0.06014189,0.8162353,0.05945869,0.0009822856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5761035,0.001313496,0.4183533,0.002234936,0.00005619675,0.0008032374,0.00002175637,0.0002056633,0.0009078854],"genre_scores_gemma":[0.9604867,0.000541122,0.03824988,0.0002334803,0.0001120535,0.0001539504,0.000008069755,0.00001230726,0.0002024544],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3843832,"threshold_uncertainty_score":0.2396462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009461010088431473,"score_gpt":0.2405848791351901,"score_spread":0.2311238690467587,"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."}}