{"id":"W2125099185","doi":"10.1109/cyberc.2010.60","title":"A New Top-Down Algorithm for Tree Inclusion","year":2010,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Combinatorics; Matching (statistics); Computer science; Algorithm; Node (physics); XML; Mathematics; Discrete mathematics; Physics; World Wide Web; 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.0011025,0.002033179,0.002072658,0.002334299,0.001847668,0.003834068,0.004541569,0.002032973,0.02096023],"category_scores_gemma":[0.004926597,0.001058913,0.002671935,0.003281426,0.0008820709,0.008145694,0.005229965,0.00380367,0.01112212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414263,"about_ca_system_score_gemma":0.003032609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005084618,"about_ca_topic_score_gemma":0.008873104,"domain_scores_codex":[0.9973155,0.0002980957,0.0002169919,0.0007851493,0.001046552,0.0003376799],"domain_scores_gemma":[0.9976904,0.000692191,0.00008929567,0.0007986178,0.000593796,0.0001355669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002698716,0.0003473927,0.000452904,0.0006122911,0.00008948637,0.000230633,0.0001905481,0.02416873,0.008659028,0.04226066,0.04636367,0.8763548],"study_design_scores_gemma":[0.0002195636,0.0002377114,0.0003764178,0.0001695137,0.0001774931,0.0006983302,0.0002480744,0.6543171,0.01827821,0.2077495,0.1174327,0.00009548479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002378529,0.0005232164,0.9840357,0.0004142476,0.0002531353,0.0003053242,0.0007292253,0.00618032,0.005180387],"genre_scores_gemma":[0.02199289,0.000349663,0.9664851,0.0002952448,0.000124538,0.0002912696,0.002051063,0.0007674139,0.007642868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02096023,"threshold_uncertainty_score":0.07011896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009271043576254736,"score_gpt":0.2549714707387515,"score_spread":0.2457004271624967,"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."}}