{"id":"W7117419413","doi":"10.61091/ars165-04","title":"Combinatorial identities using the matrix tree theorem","year":2025,"lang":"","type":"article","venue":"Ars Combinatoria","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science","keywords":"Spanning tree; Bipartite graph; Minimum spanning tree; Complete bipartite graph; Trémaux tree; Graph; Tree (set theory); Combinatorial proof; Minimum degree spanning tree","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002234547,0.0006323309,0.0007867309,0.0002920567,0.002489084,0.0003991998,0.001678297,0.0004960137,0.0003734309],"category_scores_gemma":[0.0006509592,0.0005283392,0.0005377264,0.001672245,0.001046552,0.0003178841,0.0006948911,0.001070222,0.0001609694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002553182,"about_ca_system_score_gemma":0.0004212117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004381481,"about_ca_topic_score_gemma":0.0000068296,"domain_scores_codex":[0.995582,0.001081879,0.001235627,0.0006563553,0.0005832006,0.0008609471],"domain_scores_gemma":[0.9939195,0.002954947,0.0005880899,0.001978381,0.000427253,0.0001318236],"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.00009358485,0.0005537018,0.0004760369,0.0002599336,0.0004756629,0.000006423145,0.001706032,0.000007792948,0.0006070492,0.9882089,0.007336441,0.0002684434],"study_design_scores_gemma":[0.002385246,0.00006437129,0.0001505139,0.0003396731,0.0009366837,0.000007967723,0.003668856,0.0007443501,0.001828849,0.9846478,0.004752869,0.0004727955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9094958,0.001806883,0.0006331909,0.001224145,0.02255513,0.002050283,0.00005169272,0.0002337315,0.06194915],"genre_scores_gemma":[0.992599,0.0001662253,0.0002255557,0.0001931053,0.00009767069,0.0001210898,0.000008848536,0.00007723912,0.00651134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08310314,"threshold_uncertainty_score":0.9997168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02147741468406402,"score_gpt":0.3131722221738988,"score_spread":0.2916948074898348,"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."}}