{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001408756,0.0005264225,0.0007997878,0.001041796,0.0005834482,0.001070465,0.0008725353,0.000176892,0.00001254736],"category_scores_gemma":[0.0003584326,0.0004818833,0.0003014606,0.001400457,0.0002135199,0.0005335904,0.0006072549,0.0004487919,0.00004593152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001241175,"about_ca_system_score_gemma":0.00011766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009150964,"about_ca_topic_score_gemma":0.0002852662,"domain_scores_codex":[0.9960589,0.000129412,0.001130129,0.001015876,0.0006507906,0.001014876],"domain_scores_gemma":[0.9973846,0.0008695435,0.0002054345,0.0007947091,0.0003277849,0.0004179439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003026309,0.00018473,0.0008703418,0.0002414971,0.0001648551,0.00006155517,0.003766819,0.002868498,0.007542463,0.9808614,0.001365732,0.0020418],"study_design_scores_gemma":[0.002020335,0.0004661562,0.006242364,0.001447144,0.0001429542,0.0001363492,0.0006121909,0.5604764,0.0007796991,0.4227742,0.003863654,0.001038497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1455095,0.002185099,0.8449744,0.003645668,0.0005467142,0.00159798,0.0007056118,0.000595715,0.0002393237],"genre_scores_gemma":[0.9232336,0.00003418517,0.07593866,0.0002741374,0.00002843058,0.0002753158,0.00008869965,0.00004731016,0.00007969303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7777241,"threshold_uncertainty_score":0.9999665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0337211460636568,"score_gpt":0.2992418798723409,"score_spread":0.2655207338086841,"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."}}