{"id":"W2196944838","doi":"10.1142/s1793830916500099","title":"On the graph of nilpotent matrix group of length one","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Adjacency matrix; Laplacian matrix; Multiplicative function; Graph; Nilpotent; Degree matrix; Nilpotent group; Discrete mathematics; Graph power; Line 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001098707,0.0003969746,0.0003558254,0.001109985,0.0008681576,0.0006906896,0.0005494928,0.0003915878,0.004426249],"category_scores_gemma":[0.0005284341,0.0001403932,0.000290395,0.0005274747,0.0008348115,0.001255246,0.0006533067,0.0005979633,0.000638633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000345485,"about_ca_system_score_gemma":0.0002275563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006489278,"about_ca_topic_score_gemma":0.0006820952,"domain_scores_codex":[0.999793,0.00004947889,0.000005785355,0.00006649914,0.00005171062,0.00003352766],"domain_scores_gemma":[0.9996098,0.000102441,0.00008800265,0.0000380042,0.00007789668,0.00008381342],"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.00007967099,0.00003454523,0.0007872783,0.0001285611,0.00001655268,0.0005026765,0.0004014304,0.004063624,0.01175758,0.9684092,0.002264823,0.01155418],"study_design_scores_gemma":[0.00002514212,0.0001029211,0.001131346,0.00002792232,0.00001879256,0.0007565732,0.0002786403,0.03178082,0.004877179,0.9515986,0.009365741,0.00003642251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8083439,0.001106336,0.1403448,0.0008991659,0.0003142388,0.00005777254,0.0003893695,0.0004530527,0.04809121],"genre_scores_gemma":[0.9594806,0.0007380467,0.02624469,0.0003247196,0.0002065967,0.00005424182,0.0004530542,0.0001217786,0.01237626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004426249,"threshold_uncertainty_score":0.01480722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05179355761883672,"score_gpt":0.3071338804084807,"score_spread":0.2553403227896439,"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."}}