{"id":"W1997126628","doi":"10.1016/j.laa.2012.05.033","title":"The minimum rank of universal adjacency matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Natural Science Foundation of Anhui Province; Natural Sciences and Engineering Research Council of Canada; Anhui Provincial Department of Education; University of Regina; Anhui University; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Mathematics; Rank (graph theory); Combinatorics; Adjacency matrix; Adjacency list; Discrete mathematics; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132533,0.001089751,0.001522394,0.002040322,0.001310397,0.003595386,0.001857406,0.001889731,0.007361678],"category_scores_gemma":[0.01489002,0.0008384866,0.0006654144,0.001772843,0.002819567,0.006486739,0.001977115,0.002144896,0.00124497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00068798,"about_ca_system_score_gemma":0.0009299993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006348701,"about_ca_topic_score_gemma":0.0007229638,"domain_scores_codex":[0.9981681,0.0006669341,0.00009637988,0.0004928972,0.0003362619,0.0002394024],"domain_scores_gemma":[0.9894365,0.005841005,0.001510215,0.001228428,0.001031173,0.0009526517],"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.0002316776,0.00007586276,0.0009126685,0.0002553801,0.00004131145,0.0001098425,0.000386832,0.01113005,0.004247171,0.940863,0.007571991,0.03417437],"study_design_scores_gemma":[0.00001500763,0.00002907422,0.0002893016,0.0000240748,0.00001099651,0.0001089583,0.0000882528,0.01823778,0.001203898,0.9784361,0.001533997,0.00002268797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4763959,0.002752926,0.4554099,0.003772943,0.0005050398,0.00008257028,0.002094089,0.0009417559,0.05804485],"genre_scores_gemma":[0.9412574,0.001086161,0.04565354,0.0004225871,0.0007674039,0.0001099986,0.0008573085,0.0002615284,0.009584146],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007361678,"threshold_uncertainty_score":0.02462727,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0231223655651145,"score_gpt":0.2862443355944397,"score_spread":0.2631219700293252,"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."}}