{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241146,0.0009067078,0.001499003,0.00259829,0.001574533,0.002778375,0.002544228,0.001705938,0.01224441],"category_scores_gemma":[0.005210631,0.0005628459,0.001070862,0.00360441,0.0008005397,0.004965901,0.004040635,0.002285268,0.007588717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006858381,"about_ca_system_score_gemma":0.001757218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073505,"about_ca_topic_score_gemma":0.001769591,"domain_scores_codex":[0.9980822,0.00031841,0.0001477349,0.0003401201,0.0009439909,0.0001675303],"domain_scores_gemma":[0.997097,0.000721378,0.0000940524,0.0008929078,0.00102052,0.0001741004],"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.0003197582,0.0002455424,0.0003762326,0.0001925055,0.00005533118,0.0001281998,0.0001472755,0.01220348,0.01204218,0.08790998,0.0230738,0.8633057],"study_design_scores_gemma":[0.000162375,0.0003190773,0.000520517,0.0001217424,0.000140459,0.0009247195,0.00009706808,0.6461272,0.03398832,0.1931186,0.1243963,0.00008361441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005569203,0.0005331956,0.983631,0.0003282777,0.0003698276,0.0001306826,0.0001924308,0.00187029,0.007375044],"genre_scores_gemma":[0.04219493,0.0004693333,0.9408841,0.0003602795,0.0003537912,0.0002230806,0.0007737622,0.0008208198,0.0139199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01224441,"threshold_uncertainty_score":0.04096162,"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."}}