{"id":"W1984238924","doi":"10.2991/iccnce.2013.32","title":"On the Tree Inclusion Problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Computer science; Time complexity; K-ary tree; Algorithm; Inclusion (mineral); Mathematics; Tree structure; Theoretical computer science; Mathematical optimization; Combinatorics; Binary tree","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.002574695,0.001117675,0.002080418,0.002115401,0.003380174,0.003591907,0.00286287,0.002802676,0.0115163],"category_scores_gemma":[0.01513684,0.0008494646,0.002101324,0.004592645,0.002570794,0.01657378,0.005561749,0.004689455,0.002566236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139802,"about_ca_system_score_gemma":0.001549071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003085498,"about_ca_topic_score_gemma":0.001940099,"domain_scores_codex":[0.9961564,0.001056215,0.000306154,0.0009830903,0.0008913334,0.0006068554],"domain_scores_gemma":[0.9860469,0.01040978,0.0007356332,0.001261478,0.0009969609,0.0005494526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009422558,0.0006871971,0.004120392,0.001213124,0.0001705901,0.001306966,0.001176714,0.05918862,0.005329822,0.5728252,0.04272839,0.3103108],"study_design_scores_gemma":[0.0000885303,0.0001185417,0.0007487036,0.0001308399,0.00007071227,0.0008871708,0.0003834673,0.08382171,0.003084207,0.8894957,0.02112929,0.0000410768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1455007,0.003730679,0.7974301,0.008546116,0.0005606532,0.0004678539,0.001961767,0.001409809,0.04039223],"genre_scores_gemma":[0.433588,0.005350073,0.5190343,0.002387297,0.001423877,0.0006278263,0.00824224,0.001049341,0.02829704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0115163,"threshold_uncertainty_score":0.03852588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01894632046418544,"score_gpt":0.2726178480970612,"score_spread":0.2536715276328758,"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."}}