{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401592,0.000593885,0.0007334576,0.002220816,0.001232863,0.002414264,0.001383693,0.001704338,0.01297012],"category_scores_gemma":[0.00293003,0.0002934699,0.0008457316,0.001623913,0.002175348,0.00524947,0.001619061,0.00244281,0.0019137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007345651,"about_ca_system_score_gemma":0.0005162014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006848785,"about_ca_topic_score_gemma":0.0006656754,"domain_scores_codex":[0.9994955,0.0001253175,0.00002484564,0.0001222503,0.0001753806,0.00005666089],"domain_scores_gemma":[0.999078,0.0002812756,0.0001228514,0.0001283171,0.0002522775,0.0001372313],"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.00000614161,0.000008652572,0.00004327804,0.00003059997,0.000003631877,0.00003408537,0.00005815395,0.000277779,0.0008562713,0.9935586,0.001811332,0.003311534],"study_design_scores_gemma":[0.000004038729,0.00000621294,0.00005132435,0.000005354219,0.000002418579,0.00008395784,0.00002031071,0.002907084,0.0001784781,0.9945058,0.002229475,0.000005566238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.096223,0.002947651,0.6781261,0.008448377,0.00293098,0.00009759473,0.0007044622,0.0008375999,0.2096842],"genre_scores_gemma":[0.8159403,0.002744711,0.09541287,0.005370094,0.004265268,0.0001627835,0.0006229605,0.0006896334,0.07479135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01297012,"threshold_uncertainty_score":0.04338938,"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."}}