{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003123754,0.001043093,0.001296027,0.003212139,0.0009694956,0.002091018,0.001996529,0.001173088,0.004144055],"category_scores_gemma":[0.01532951,0.000477832,0.001171102,0.005043902,0.001039668,0.007498988,0.00234337,0.0009300103,0.0007767669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001871568,"about_ca_system_score_gemma":0.001958113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006360921,"about_ca_topic_score_gemma":0.005837929,"domain_scores_codex":[0.9937941,0.001769324,0.0005887719,0.00105584,0.002162252,0.0006296996],"domain_scores_gemma":[0.9937958,0.003806141,0.0003881801,0.0007925485,0.00102038,0.0001969381],"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.001331597,0.0003675201,0.005215908,0.001362331,0.0002546879,0.000596477,0.0006193403,0.287318,0.01380316,0.1726944,0.02195887,0.4944778],"study_design_scores_gemma":[0.00007682719,0.0001732813,0.0007162985,0.00006797275,0.00007074616,0.0003405078,0.0002679631,0.8203038,0.006434804,0.1635093,0.008002544,0.00003601038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0748813,0.002100158,0.9054363,0.0007692586,0.00009582273,0.0004843514,0.002332691,0.005139478,0.008760608],"genre_scores_gemma":[0.4735825,0.001091656,0.5151948,0.0002395087,0.0001242129,0.0004437752,0.005672262,0.0006348716,0.003016479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006360921,"threshold_uncertainty_score":0.0165202,"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."}}