{"id":"W2009319587","doi":"10.1145/1557626.1557665","title":"General spanning trees and reachability query evaluation","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Reachability; Spanning tree; Computer science; Combinatorics; Graph; Tree (set theory); Path (computing); Node (physics); Minimum spanning tree; Enhanced Data Rates for GSM Evolution; Trémaux tree; Routing (electronic design automation); Theoretical computer science; Directed graph; Discrete mathematics; Mathematics; Pathwidth; Line graph; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0005877638,0.00004890258,0.00004937544,0.00003858603,0.00004911824,0.0001567904,0.0001995227,0.0000124705,0.00001465121],"category_scores_gemma":[0.00002101287,0.00004025798,0.00001216732,0.0001000102,0.0000106398,0.00076978,0.00008948181,0.0000261024,0.000007260953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001173202,"about_ca_system_score_gemma":0.000008308221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004115894,"about_ca_topic_score_gemma":0.000008996054,"domain_scores_codex":[0.999402,0.00003412591,0.00007791768,0.0002144015,0.0001756017,0.00009598754],"domain_scores_gemma":[0.9996505,0.00001111756,0.00001887442,0.000265823,0.00002528658,0.00002839419],"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":[5.195502e-7,0.00001663635,0.0006210746,8.727142e-7,0.000001876885,7.709518e-7,0.00006953083,0.00002216447,0.0001860774,0.0430762,0.00148453,0.9545197],"study_design_scores_gemma":[0.0001872109,0.00005633055,0.1747377,0.000003130247,0.000005026326,0.000001275428,0.00001300931,0.8055896,0.0002335993,0.01686716,0.002212827,0.00009314167],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1925928,0.0001403586,0.7619383,0.00389417,0.0001846582,0.000229727,6.828861e-7,0.0002309028,0.04078843],"genre_scores_gemma":[0.8066691,0.00001047119,0.1908069,0.0006832214,0.00009164656,0.000003870042,0.000009102526,0.000001595409,0.001724079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9544266,"threshold_uncertainty_score":0.1641673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02869023033899969,"score_gpt":0.286801518287136,"score_spread":0.2581112879481363,"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."}}