{"id":"W2820145021","doi":"10.1109/tkde.2018.2854797","title":"Introducing Cuts Into a Top-Down Process for Checking Tree Inclusion","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Matching (statistics); Bounded function; Computer science; Set (abstract data type); Combinatorics; Order (exchange); Space (punctuation); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Statistics","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.006560212,0.002260662,0.002531844,0.004333053,0.002082788,0.005155134,0.004565752,0.002645957,0.007747043],"category_scores_gemma":[0.03400401,0.002061637,0.004307927,0.00348284,0.004044601,0.009410451,0.007554692,0.005354344,0.002233457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001814566,"about_ca_system_score_gemma":0.003687441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009084604,"about_ca_topic_score_gemma":0.00903638,"domain_scores_codex":[0.9871793,0.002455109,0.00134502,0.003195989,0.004573306,0.001251412],"domain_scores_gemma":[0.9638069,0.02379609,0.00214036,0.005012632,0.004285565,0.000958397],"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.002517642,0.0008582223,0.01060674,0.001960823,0.0005257136,0.002288695,0.001867145,0.1539059,0.05610235,0.1568447,0.01346374,0.5990584],"study_design_scores_gemma":[0.0002274728,0.0005199116,0.001663187,0.0003352825,0.0002680559,0.0005056067,0.0004169965,0.6764312,0.03805019,0.2616639,0.01974139,0.0001768519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009567359,0.0001861042,0.9839476,0.0002304546,0.00008179942,0.0004170013,0.0004556422,0.004006475,0.001107417],"genre_scores_gemma":[0.06183376,0.0001194354,0.9330922,0.000237156,0.00006546035,0.0003727783,0.0017797,0.0007977198,0.00170178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009084604,"threshold_uncertainty_score":0.03469408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02127681939934982,"score_gpt":0.2953921537667026,"score_spread":0.2741153343673527,"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."}}