{"id":"W2134098997","doi":"10.1145/2077336.2077337","title":"Pebbles and Branching Programs for Tree Evaluation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Boolean function; Tree (set theory); Binary decision diagram; Discrete mathematics; Algorithm","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.001595841,0.0009338738,0.0008248358,0.0008024581,0.001516634,0.002742752,0.001651718,0.001457829,0.008183741],"category_scores_gemma":[0.01020702,0.0006396144,0.001820912,0.001603148,0.003773959,0.007465299,0.002979793,0.005769375,0.0009755066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003237847,"about_ca_system_score_gemma":0.002372783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003986632,"about_ca_topic_score_gemma":0.004539011,"domain_scores_codex":[0.9973049,0.0006792643,0.0001620911,0.0006225616,0.0006460443,0.0005851613],"domain_scores_gemma":[0.9932249,0.005152234,0.000389483,0.0006612052,0.0003782745,0.0001937792],"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.0003540585,0.0002374551,0.001598879,0.0004005904,0.00003624563,0.0001614249,0.0007621502,0.06221687,0.01151481,0.8280143,0.003464689,0.09123848],"study_design_scores_gemma":[0.00006392246,0.00009808294,0.0003401013,0.00006052196,0.00003555867,0.0001036737,0.00014095,0.1880659,0.01040712,0.7938229,0.006824645,0.00003660383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08122671,0.0004557138,0.9010868,0.001892559,0.00006375406,0.0001957326,0.000277937,0.002124257,0.01267655],"genre_scores_gemma":[0.4823763,0.0006112,0.5042002,0.0008404449,0.000124171,0.0007519781,0.0008258849,0.000732836,0.009536934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008183741,"threshold_uncertainty_score":0.02737737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06058992463226921,"score_gpt":0.3174479788893818,"score_spread":0.2568580542571126,"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."}}