{"id":"W1554455557","doi":"10.4230/lipics.ccc.2018.15","title":"Hardness of Function Composition for Semantic Read once Branching Programs","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Branching (polymer chemistry); Bottleneck; Computer science; Argument (complex analysis); Upper and lower bounds; Discrete mathematics; Mathematics; Theoretical computer science; Tree traversal; Combinatorics; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004598851,0.001429208,0.002504262,0.001440811,0.003336552,0.007527177,0.003195694,0.003321018,0.01592088],"category_scores_gemma":[0.02723162,0.001283725,0.003977174,0.001890282,0.005092954,0.01848898,0.005442469,0.008417338,0.002147205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004582772,"about_ca_system_score_gemma":0.003609271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001832426,"about_ca_topic_score_gemma":0.001662757,"domain_scores_codex":[0.9915633,0.001942289,0.0004148866,0.001859844,0.002415079,0.001804484],"domain_scores_gemma":[0.9674267,0.02646245,0.001290358,0.002824402,0.0009848105,0.001011322],"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.002584541,0.0007935484,0.007448905,0.001414559,0.0002590857,0.0009191177,0.002544755,0.1667967,0.03079724,0.7006916,0.008696602,0.0770534],"study_design_scores_gemma":[0.0001548282,0.00009184763,0.0007328376,0.0000503379,0.0001227052,0.0003029185,0.0002602168,0.2863382,0.01358422,0.6946903,0.003621307,0.00005033943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.468477,0.001157353,0.4799302,0.007379587,0.000130947,0.000301193,0.0009816869,0.004429794,0.03721228],"genre_scores_gemma":[0.8794079,0.0006614231,0.1029163,0.0009074635,0.0003228742,0.0004390892,0.001430525,0.001485672,0.01242869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01592088,"threshold_uncertainty_score":0.05326062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03285590300738768,"score_gpt":0.2686928816787141,"score_spread":0.2358369786713264,"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."}}