{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002826925,0.0001755523,0.0001630941,0.0001858259,0.0006143898,0.0001159081,0.0008979566,0.00006846456,0.000005644869],"category_scores_gemma":[0.0000183984,0.0001603329,0.00002857209,0.0003192541,0.00002622216,0.001160127,0.0001279348,0.0001529358,0.00001125998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003420844,"about_ca_system_score_gemma":0.00004768762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001660473,"about_ca_topic_score_gemma":0.0000357057,"domain_scores_codex":[0.998789,0.00001112703,0.000199214,0.0006218869,0.0001292045,0.000249559],"domain_scores_gemma":[0.9987339,0.00009753531,0.00003467944,0.0009291952,0.000097998,0.000106709],"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.00003489969,0.0001854103,0.000005410312,0.0002569677,0.00004027665,0.000002719803,0.005691021,0.003761278,0.01365136,0.0003553885,0.0009584121,0.9750568],"study_design_scores_gemma":[0.0003888017,0.0001367352,0.00001762674,0.0001602169,0.00001542641,0.00001037497,0.0000209572,0.9472077,0.03548577,0.0001624227,0.01617351,0.0002204314],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003767734,0.0002971582,0.9943265,0.0001131632,0.0009711499,0.0001897878,0.00004208602,0.0002073693,0.00008506713],"genre_scores_gemma":[0.8997635,0.00005128896,0.09946004,0.00003947312,0.0005206884,0.0000427725,0.00003158445,0.00002302171,0.0000675967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9748364,"threshold_uncertainty_score":0.6538187,"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."}}