{"id":"W2799429911","doi":"10.1016/j.laa.2018.09.016","title":"An analog of Matrix Tree Theorem for signless Laplacians","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Laplacian matrix; Spanning tree; Bipartite graph; Discrete mathematics; Graph; Connectivity","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000449179,0.0002897667,0.0004643147,0.0001461787,0.0002615796,0.00004045419,0.0005664141,0.0003447147,0.0000641682],"category_scores_gemma":[0.00006860465,0.0002705353,0.0001832902,0.0002187071,0.0002090886,0.00006036667,0.0001588259,0.0002316885,0.00001779984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001205689,"about_ca_system_score_gemma":0.00007158203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003556685,"about_ca_topic_score_gemma":0.00002053231,"domain_scores_codex":[0.9984446,0.00006652952,0.0005518723,0.0005624425,0.0001403968,0.0002341653],"domain_scores_gemma":[0.9975812,0.0005178251,0.000413176,0.001022714,0.0003276609,0.0001374222],"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.00002250648,0.0003089535,0.0000206273,0.0004331867,0.00007977922,6.814111e-8,0.0003513335,0.000008754637,0.002170352,0.9943952,0.0005743878,0.001634857],"study_design_scores_gemma":[0.00026022,0.00008651657,0.0000747247,0.00005307223,0.0002748509,0.000002532055,0.0001735997,0.003521111,0.006706119,0.9812573,0.007295521,0.000294462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.399347,0.0007821593,0.5810267,0.001072841,0.0001274973,0.007472598,0.004119771,0.0004543649,0.005597054],"genre_scores_gemma":[0.949483,0.0001809265,0.04515167,0.00006798551,0.0005847858,0.003224329,0.0006280408,0.00008838668,0.000590861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.550136,"threshold_uncertainty_score":0.9999747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03722048731970568,"score_gpt":0.3498222017750788,"score_spread":0.3126017144553732,"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."}}