{"id":"W2952243533","doi":"10.48550/arxiv.1005.2642","title":"Pebbles and Branching Programs for Tree Evaluation","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Branching (polymer chemistry); Upper and lower bounds; Tree (set theory); Mathematics; Binary decision diagram; Binary tree; Discrete mathematics; Simple (philosophy); Binary number; Algorithm; Arithmetic","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.001751568,0.0009397097,0.0008368244,0.0008682688,0.001594475,0.002967843,0.001706989,0.001513952,0.007788403],"category_scores_gemma":[0.01061953,0.0006576417,0.001805133,0.001720155,0.00428482,0.00762982,0.003340403,0.006203499,0.0009425387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003557752,"about_ca_system_score_gemma":0.00242955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004123949,"about_ca_topic_score_gemma":0.004363244,"domain_scores_codex":[0.9969619,0.0007495261,0.000185523,0.0006797375,0.0007667754,0.000656503],"domain_scores_gemma":[0.9931061,0.005199641,0.0003918269,0.0006523207,0.0004376752,0.0002124256],"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.0002257559,0.0001552383,0.001094551,0.0002826368,0.00002483969,0.000116045,0.0006523945,0.03808966,0.007285591,0.8893334,0.002569862,0.06017],"study_design_scores_gemma":[0.0000475446,0.0000735357,0.0002627326,0.00005490342,0.00002982378,0.00008100715,0.0001185995,0.1352344,0.008267463,0.8492086,0.006589517,0.00003187494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07650807,0.0004793608,0.9045326,0.001912527,0.00007154375,0.0001805646,0.00026756,0.001857387,0.01419052],"genre_scores_gemma":[0.4772217,0.0006502656,0.508148,0.0008817568,0.0001360295,0.0007620965,0.0007837337,0.0007442463,0.01067215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007788403,"threshold_uncertainty_score":0.02605474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1320572416662838,"score_gpt":0.257449233558476,"score_spread":0.1253919918921923,"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."}}