{"id":"W2408365485","doi":"","title":"Extremely uniform branching programs.","year":2014,"lang":"en","type":"article","venue":"NCMA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Branching (polymer chemistry); Property (philosophy); Mathematics; Tree (set theory); Combinatorics; Computer science; Discrete mathematics; Materials science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002672658,0.00009181965,0.00009820355,0.00006211516,0.0001542527,0.0001844176,0.0007626599,0.00003475334,0.00002009028],"category_scores_gemma":[0.00002237863,0.00008323836,0.00006222073,0.0002977714,0.00004092391,0.0003136865,0.0001936217,0.000121276,0.00009132174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001182518,"about_ca_system_score_gemma":0.0000158129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002856979,"about_ca_topic_score_gemma":0.00002115182,"domain_scores_codex":[0.9991487,0.00003266265,0.0001226959,0.0002433176,0.0002026003,0.0002499799],"domain_scores_gemma":[0.9993424,0.00004285937,0.00003940075,0.0004671072,0.00003331838,0.00007488812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[6.748829e-7,0.00002972746,0.0003937911,0.000005556814,0.000003257431,0.000001825728,0.0001980693,0.00000684456,0.00004773571,0.2710315,0.0002090188,0.728072],"study_design_scores_gemma":[0.0005626447,0.000228035,0.008520208,0.00005981173,0.000004937733,0.00004181399,0.0000196648,0.3321941,0.0008498607,0.2626051,0.3944656,0.0004481765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01856657,0.00005867033,0.9444792,0.0008145021,0.0005875836,0.0001076017,3.814278e-7,0.0004538371,0.0349316],"genre_scores_gemma":[0.8494991,0.000003216545,0.1495086,0.0004295931,0.0001720178,0.00000835155,0.000001788762,0.000006709842,0.000370632],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8309325,"threshold_uncertainty_score":0.3394362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02301243694629789,"score_gpt":0.2277192433120586,"score_spread":0.2047068063657607,"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."}}