{"id":"W2079685570","doi":"10.1016/j.ipl.2005.11.022","title":"A new tree inclusion algorithm","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Tree (set theory); Mathematics; Matching (statistics); Algorithm; Node (physics); Space (punctuation); Time complexity; Discrete mathematics; Computer science; Physics; 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.0001446259,0.0001219243,0.00009248759,0.0001708163,0.0004663058,0.0005572892,0.0006173943,0.00004615164,0.000009583468],"category_scores_gemma":[0.000007692087,0.0001052635,0.00003257793,0.0003742705,0.00001637864,0.007184886,0.0006932776,0.0001024055,0.00009830816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005147871,"about_ca_system_score_gemma":0.00008882197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001690616,"about_ca_topic_score_gemma":0.000001775609,"domain_scores_codex":[0.9988909,0.00001326385,0.0003189225,0.000139201,0.0004248788,0.0002128111],"domain_scores_gemma":[0.9994095,0.00001400029,0.0001868454,0.0002631258,0.00006165972,0.00006484469],"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.000001260319,0.000006511509,0.00001446614,0.0000102665,9.039424e-7,0.000001763234,0.0005413729,0.000222994,0.0004911884,0.0006527344,0.02618312,0.9718734],"study_design_scores_gemma":[0.000801486,0.00002472212,0.001829045,0.00009534577,0.00000449749,0.00003826947,0.00001985335,0.7157542,0.002761389,0.004245898,0.2740574,0.0003679498],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000617197,0.0000637216,0.9926643,0.004024165,0.0002176458,0.00007900572,0.000002318994,0.0003142931,0.002017396],"genre_scores_gemma":[0.0308682,0.000002333034,0.9617468,0.006836024,0.0002792441,0.000008446194,0.00009457061,0.000007181941,0.0001572538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9715055,"threshold_uncertainty_score":0.5373952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004709152392638082,"score_gpt":0.2048582784913232,"score_spread":0.2001491260986852,"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."}}