{"id":"W290526480","doi":"10.4230/dagsemproc.06111.10","title":"Incremental branching programs","year":2006,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Nondeterministic algorithm; Branching (polymer chemistry); Computation; Computer science; Exponential function; Mathematics; Discrete mathematics; Combinatorics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001546442,0.0006334459,0.0004644622,0.0007175332,0.0007625987,0.001756327,0.002625896,0.000999196,0.007568963],"category_scores_gemma":[0.00567118,0.0004920653,0.001179814,0.0007998252,0.002471764,0.004945321,0.002576762,0.002900066,0.000889877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033034,"about_ca_system_score_gemma":0.001060886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001431758,"about_ca_topic_score_gemma":0.001551918,"domain_scores_codex":[0.9982111,0.0005104351,0.00009551138,0.0004376681,0.0005178075,0.0002274791],"domain_scores_gemma":[0.9956754,0.002282934,0.0002876464,0.001041253,0.0004982282,0.0002145105],"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.00006800058,0.00005518147,0.0004703774,0.00008645011,0.00001643447,0.0001615893,0.0002127237,0.02212961,0.002526427,0.9510131,0.001798835,0.02146132],"study_design_scores_gemma":[0.00003961497,0.000056555,0.000187448,0.00002664475,0.00002962975,0.0002082835,0.00007433405,0.1598963,0.002959912,0.8192046,0.01729796,0.00001868622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03405046,0.0002176589,0.9316633,0.0009364319,0.00007505174,0.0001722734,0.0003980175,0.001253138,0.0312336],"genre_scores_gemma":[0.5398955,0.0003696411,0.4409511,0.0006628347,0.000155657,0.0007310496,0.001043662,0.0003363805,0.01585406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007568963,"threshold_uncertainty_score":0.02532065,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008540348256302814,"score_gpt":0.2195347521631794,"score_spread":0.2109944039068766,"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."}}