{"id":"W63952162","doi":"","title":"Cubic Graphs with Minimum Number of Spanning Trees.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Spanning tree; Combinatorics; Minimum 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004818653,0.0004907406,0.0008805366,0.0007678519,0.001527962,0.0025625,0.001417499,0.001472828,0.01316485],"category_scores_gemma":[0.006095863,0.0005766716,0.0005697091,0.001689883,0.0008128579,0.00359165,0.001430736,0.001628201,0.001763462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001519124,"about_ca_system_score_gemma":0.001482294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003160455,"about_ca_topic_score_gemma":0.005879393,"domain_scores_codex":[0.9992985,0.0001719527,0.00003897844,0.0001795355,0.0001420859,0.0001689966],"domain_scores_gemma":[0.9955004,0.002300678,0.0006088375,0.0007792041,0.0003626811,0.0004483208],"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.001044697,0.0003808304,0.004211983,0.00113482,0.0001113289,0.0003212443,0.0004542791,0.05572962,0.01519483,0.7092484,0.08566693,0.1265011],"study_design_scores_gemma":[0.0001863752,0.0001068573,0.003068524,0.0001119892,0.00007285499,0.0006080018,0.0005433606,0.1069357,0.006671143,0.8475445,0.03410341,0.0000472157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5521905,0.002741666,0.2535247,0.009562501,0.0005445061,0.0003166928,0.01415799,0.002147715,0.1648137],"genre_scores_gemma":[0.8189481,0.001010239,0.1457236,0.0007594619,0.0002160647,0.0002002218,0.006194609,0.0004831952,0.02646453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01316485,"threshold_uncertainty_score":0.0440408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008992087305351936,"score_gpt":0.2198149427223398,"score_spread":0.2108228554169879,"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."}}