{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002472881,0.00008513624,0.0001047942,0.0000358477,0.0003345801,0.00001091278,0.0001850574,0.00004897379,0.00003696934],"category_scores_gemma":[0.0000469632,0.00006083085,0.00004844668,0.0002691601,0.00009597242,0.00009549558,0.0000464049,0.00007930917,0.0000427071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004572858,"about_ca_system_score_gemma":0.0000131725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000174798,"about_ca_topic_score_gemma":0.000001565629,"domain_scores_codex":[0.9993963,0.00003230989,0.0002069238,0.000104598,0.00008951255,0.0001703419],"domain_scores_gemma":[0.9988346,0.0006139732,0.0001200607,0.0002861508,0.000065314,0.00007990959],"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.000004689631,0.00009173373,0.000145136,0.00002490405,0.00001856454,1.489723e-8,0.0002693209,1.55946e-7,0.00143942,0.9956523,0.0006744439,0.001679301],"study_design_scores_gemma":[0.0004592591,0.00003541183,0.001256796,0.00001965596,0.0002031763,0.000009427884,0.001595525,0.0002956784,0.01048839,0.7103285,0.2750437,0.0002644792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.957918,0.007184503,0.01363232,0.002267462,0.00009394176,0.001714161,0.0001105045,0.0001796716,0.01689941],"genre_scores_gemma":[0.995957,0.0005945797,0.002205526,0.00002793829,0.0001321764,0.0001568222,0.000007416316,0.00001304685,0.0009055294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2853239,"threshold_uncertainty_score":0.2573353,"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."}}