{"id":"W2333804416","doi":"10.5963/ijcsai0204001","title":"Efficient Streaming Algorithms for Tree Matching Problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Computer Science and Artificial Intelligence","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Node (physics); XML; Tree (set theory); Overhead (engineering); Matching (statistics); Focus (optics); Theoretical computer science; Data structure; Algorithm; Data mining; Mathematics; Programming language","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.001842471,0.0001266694,0.0001711326,0.0003202155,0.0002242988,0.0003228401,0.001054533,0.00002497503,0.000002130465],"category_scores_gemma":[0.0001092604,0.0001007742,0.00006851961,0.0003164311,0.0002295349,0.00156893,0.000349498,0.0001123643,0.000004559222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007823252,"about_ca_system_score_gemma":0.0001496812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001181984,"about_ca_topic_score_gemma":0.000002940389,"domain_scores_codex":[0.9979704,0.00002347398,0.0005710682,0.0002314332,0.0008612409,0.0003424001],"domain_scores_gemma":[0.9979682,0.000175276,0.0003656146,0.0001747402,0.001125552,0.0001906237],"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.000009420312,0.0000935549,0.00005369127,0.000007139605,0.00001552305,0.000005632102,0.002197502,0.008809743,0.003504752,0.284332,0.00001942827,0.7009516],"study_design_scores_gemma":[0.0001228995,0.0003056206,0.0004708003,0.0002598549,0.000009357398,0.0005730797,0.0004916145,0.9333332,0.0354779,0.02197623,0.006623205,0.0003563056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03539728,0.0002150338,0.9598351,0.0006291338,0.003741305,0.0001138412,0.00000485685,0.00001956174,0.00004395727],"genre_scores_gemma":[0.6342798,0.00001394662,0.36473,0.000130843,0.0008333126,0.000003383632,4.079742e-7,0.000003971867,0.000004398951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9245234,"threshold_uncertainty_score":0.4109451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05159529562954639,"score_gpt":0.3265719468394973,"score_spread":0.2749766512099509,"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."}}