{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005647973,0.0004230147,0.0004537828,0.0002165985,0.000421821,0.001514912,0.001551953,0.0001174979,0.00002705122],"category_scores_gemma":[0.00008700317,0.0003601764,0.0001636984,0.0007556407,0.00008240934,0.004146722,0.001089376,0.0003645814,0.0001159237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007630858,"about_ca_system_score_gemma":0.0001070475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007198345,"about_ca_topic_score_gemma":0.00002075806,"domain_scores_codex":[0.9970859,0.00003574763,0.0009023024,0.0004498102,0.0006463642,0.0008798692],"domain_scores_gemma":[0.997668,0.0001106501,0.0004409505,0.001282812,0.0002862817,0.0002112976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001247406,0.001393213,0.02854729,0.002781,0.001145928,0.0003741326,0.0223245,0.0009135848,0.0001544031,0.2301845,0.01804825,0.6940085],"study_design_scores_gemma":[0.006739668,0.0005947847,0.003027804,0.0006923493,0.0001315645,0.0003299784,0.004339641,0.7951546,0.003112317,0.001863858,0.182129,0.001884465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01295932,0.000067662,0.9534656,0.0007956986,0.0006727446,0.00064176,0.0001306226,0.0004192917,0.03084729],"genre_scores_gemma":[0.1969133,0.00003818648,0.7966855,0.002408453,0.0003970533,0.0001735272,0.001233895,0.00008541572,0.002064734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.794241,"threshold_uncertainty_score":0.999885,"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."}}