{"id":"W3175707130","doi":"","title":"The number of spanning trees of composite graphs","year":2014,"lang":"en","type":"article","venue":"HKBU Institutional Repository (Hong Kong Baptist University)","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Spanning tree; Composite number; Combinatorics; Discrete mathematics; Algorithm","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.001179822,0.0004156318,0.0007549241,0.0029482,0.00132028,0.002946345,0.001429129,0.001201057,0.008104916],"category_scores_gemma":[0.01233253,0.0006173357,0.0005901789,0.002002973,0.00114215,0.00389652,0.0009984028,0.0009364567,0.0008198685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001254594,"about_ca_system_score_gemma":0.0009667483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009637291,"about_ca_topic_score_gemma":0.001986712,"domain_scores_codex":[0.9987875,0.0002533146,0.00009044993,0.0003567864,0.0003013909,0.0002106043],"domain_scores_gemma":[0.981215,0.0118186,0.002086624,0.001279003,0.001553138,0.002047663],"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.003707089,0.0004626234,0.09322784,0.002354603,0.0006050558,0.0009207246,0.001633292,0.1302877,0.05711669,0.5239487,0.03935226,0.1463834],"study_design_scores_gemma":[0.0001396872,0.0003202547,0.04726673,0.0001336856,0.0003895042,0.002666275,0.0008546571,0.2990755,0.01532337,0.6200754,0.0136704,0.00008460355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9229409,0.0009579777,0.04900031,0.001062546,0.0001180094,0.00007222488,0.005202267,0.0004314055,0.02021434],"genre_scores_gemma":[0.9707929,0.0005532251,0.01874032,0.0001018979,0.00012783,0.0001059657,0.003780568,0.0001415362,0.0056556],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008104916,"threshold_uncertainty_score":0.02711368,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0155482126698136,"score_gpt":0.2398695955441937,"score_spread":0.2243213828743801,"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."}}