{"id":"W3216398592","doi":"10.20382/jocg.v14i1a1","title":"Approximating Longest Spanning Tree with Neighborhoods","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Computer science; Minimum spanning tree; Tree (set theory); Combinatorics; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0008781909,0.0007553473,0.001527404,0.001081895,0.0005384242,0.0008672407,0.001350803,0.001018132,0.001796415],"category_scores_gemma":[0.005080521,0.0005329479,0.0007202726,0.00223659,0.0004593869,0.002403921,0.001193684,0.0007517296,0.0005330424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007775034,"about_ca_system_score_gemma":0.0005067794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002452739,"about_ca_topic_score_gemma":0.002381027,"domain_scores_codex":[0.9992761,0.0002707014,0.00004109551,0.0001839514,0.0001358211,0.00009241395],"domain_scores_gemma":[0.9984441,0.0009250015,0.0001977792,0.0001776574,0.0001400791,0.0001152967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003129574,0.000110789,0.001769511,0.0002539121,0.00008663378,0.0002200396,0.0001502583,0.8920383,0.004071833,0.02557506,0.006084814,0.06932587],"study_design_scores_gemma":[0.00001467015,0.00003675154,0.0001653376,0.0000088617,0.000008321892,0.00007205422,0.00002272081,0.9829317,0.0006268645,0.01514272,0.0009653587,0.000004569755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1864522,0.002467828,0.8050176,0.0006164497,0.00009468793,0.00006842997,0.0005535266,0.0008352946,0.003893896],"genre_scores_gemma":[0.5369654,0.0009248541,0.457373,0.00009740391,0.00008887168,0.0001144947,0.001452997,0.0002560675,0.002726936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002452739,"threshold_uncertainty_score":0.006009638,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01329564247200219,"score_gpt":0.2316146009542934,"score_spread":0.2183189584822912,"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."}}