{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000171097,0.0001047099,0.0001060326,0.0000578657,0.0003101763,0.0001292231,0.001002691,0.00007422511,0.000130625],"category_scores_gemma":[0.00002091539,0.00007630659,0.00005782548,0.000148337,0.00001128938,0.000542344,0.002086406,0.0001217083,0.00004528035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008111321,"about_ca_system_score_gemma":0.0000856536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001734251,"about_ca_topic_score_gemma":0.0000617585,"domain_scores_codex":[0.9990951,0.000008068624,0.0001392383,0.0003304813,0.0002076395,0.0002195068],"domain_scores_gemma":[0.9990506,0.0000714971,0.00004046728,0.0006201132,0.00005457183,0.0001627363],"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.000001145615,0.00001905036,0.000006727412,0.000001103502,0.000001787807,0.000001436981,0.00009705676,4.378622e-7,0.002937571,0.01757236,0.02786962,0.9514917],"study_design_scores_gemma":[0.0005740842,0.00008764234,0.0002377254,0.00000568711,0.000002534642,0.00001287172,0.000004429395,0.561968,0.009164802,0.0237398,0.4040291,0.0001733351],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002900997,0.00002561266,0.9933759,0.0012275,0.001021409,0.0001749485,0.000005500824,0.0001905947,0.003688451],"genre_scores_gemma":[0.002046508,0.000003271574,0.9929268,0.0004704143,0.0004016413,0.00001102867,0.00001074044,0.000006620377,0.004123027],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9513184,"threshold_uncertainty_score":0.3111692,"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."}}