{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008635223,0.000674317,0.001014044,0.0004632538,0.0004837844,0.0009866487,0.002186521,0.0005223177,0.00001171342],"category_scores_gemma":[0.00005137434,0.0006614453,0.0007466668,0.0003627379,0.0002039351,0.001829636,0.001590179,0.0008461139,0.00002779817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499718,"about_ca_system_score_gemma":0.000151132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008680484,"about_ca_topic_score_gemma":0.00001744599,"domain_scores_codex":[0.9959284,0.00006809004,0.001836816,0.0006130567,0.0007145646,0.0008390701],"domain_scores_gemma":[0.9956732,0.0001983911,0.001523298,0.001522518,0.000889523,0.0001930305],"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.0006423595,0.003121409,0.002182032,0.0345352,0.002022884,0.000004490882,0.03171713,0.004596395,0.000521695,0.2023138,0.008062231,0.7102804],"study_design_scores_gemma":[0.003371869,0.0008557713,0.0007921269,0.003101187,0.0002127792,0.0000488378,0.0004783355,0.90686,0.00108504,0.06033558,0.02143294,0.001425532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05017536,0.00009575732,0.9390706,0.0002123489,0.004697082,0.004155806,0.0004820045,0.0003841614,0.0007268109],"genre_scores_gemma":[0.6664422,0.00005797283,0.3276691,0.0004763996,0.0004770493,0.001464305,0.003132448,0.00008972034,0.0001908266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9022636,"threshold_uncertainty_score":0.9995837,"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."}}