{"id":"W4400486275","doi":"10.61091/jcmcc121-07","title":"Finding Optimal Spanning Trees For Damaged Networks","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Spanning tree; Computer science; Minimum spanning tree; Mathematics; Combinatorics; Algorithm","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.0006687728,0.0006767723,0.0007578697,0.00146519,0.0007012475,0.0008466322,0.0008350966,0.001298754,0.002714322],"category_scores_gemma":[0.005497395,0.0005427651,0.0004948631,0.001172014,0.0007436727,0.002523022,0.001214943,0.0007313999,0.000465888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007347507,"about_ca_system_score_gemma":0.0005872328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00140425,"about_ca_topic_score_gemma":0.002000161,"domain_scores_codex":[0.9996083,0.0001201703,0.00002360848,0.00009686687,0.00007771567,0.00007336593],"domain_scores_gemma":[0.9987305,0.0007041737,0.0001881568,0.0001337998,0.0001441049,0.00009933406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001325575,0.00009140097,0.001655062,0.0003194875,0.00006813883,0.0003819038,0.0003538329,0.7400579,0.006636554,0.1192605,0.006240575,0.124802],"study_design_scores_gemma":[0.00001610891,0.00004519187,0.0003787305,0.00003564436,0.00001656055,0.0001726978,0.0001482505,0.807216,0.002037838,0.1871956,0.002724946,0.00001246617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.127285,0.0008328022,0.8656054,0.00050682,0.00004616737,0.0001097514,0.0003950421,0.0004665929,0.004752396],"genre_scores_gemma":[0.6549559,0.001011358,0.3379261,0.0001288495,0.00004380561,0.0001393939,0.001085495,0.0002349026,0.004474229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002714322,"threshold_uncertainty_score":0.00908035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01980132350025476,"score_gpt":0.2697647538572149,"score_spread":0.2499634303569601,"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."}}