{"id":"W2082076097","doi":"10.1504/ijitcc.2011.042125","title":"Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries","year":2011,"lang":"en","type":"article","venue":"International Journal of Information Technology Communications and Convergence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Tree (set theory); Descendant; Matching (statistics); Ancestor; K-ary tree; Theoretical computer science; Search tree; Set (abstract data type); Tree traversal; Tree structure; Algorithm; Mathematics; Binary tree; Combinatorics; Search algorithm","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.0008801664,0.0001066975,0.0001635016,0.0003678213,0.0001751326,0.00005080856,0.001465697,0.00008455521,0.00001569554],"category_scores_gemma":[0.0001347339,0.00007979894,0.00003916639,0.0002450467,0.000320916,0.002223067,0.0006197248,0.0002644965,0.000002768422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003331711,"about_ca_system_score_gemma":0.0001150782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001369191,"about_ca_topic_score_gemma":0.0002835618,"domain_scores_codex":[0.9985867,0.0001015903,0.0007400254,0.00007920527,0.0003987313,0.00009381903],"domain_scores_gemma":[0.9970426,0.0001056293,0.0009619697,0.0006346657,0.001224045,0.00003111924],"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.00001634818,0.00003741496,0.002096207,0.00001122734,0.00009695423,7.265783e-7,0.006821092,0.00001683299,0.0004352429,0.349494,0.00003807548,0.6409359],"study_design_scores_gemma":[0.007044619,0.0009449515,0.1108018,0.001190513,0.0003076283,0.002591965,0.06645325,0.09770494,0.01888038,0.6415957,0.0511774,0.001306867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.118775,0.001169899,0.8725809,0.005746725,0.0003293984,0.0001765274,0.00001667523,0.00003835193,0.001166527],"genre_scores_gemma":[0.9481001,0.001471348,0.05026186,0.0001202768,0.00000970176,0.00001755986,0.000007648531,0.000003164127,0.000008356408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8293251,"threshold_uncertainty_score":0.3254107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03728276694932228,"score_gpt":0.2923406455522601,"score_spread":0.2550578786029378,"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."}}