{"id":"W2405982180","doi":"","title":"Predicting the size of depth-first branch and bound search trees","year":2013,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Backtracking; Branch and bound; Computer science; Depth-first search; Search tree; Upper and lower bounds; Graphical model; Context (archaeology); Bayesian network; Tree (set theory); Algorithm; Combinatorial optimization; Mathematics; Search algorithm; Mathematical optimization; Artificial intelligence; Combinatorics","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.0002325282,0.00006472412,0.00008177038,0.0000177383,0.0001391162,0.0001984379,0.000439724,0.00003082439,0.00003515588],"category_scores_gemma":[0.00004395483,0.0000391235,0.0000201329,0.0001349942,0.00009283964,0.000267771,0.0001778758,0.00009393242,0.00001674655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004562526,"about_ca_system_score_gemma":0.00003162467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012874,"about_ca_topic_score_gemma":0.0001979919,"domain_scores_codex":[0.999323,0.00003365606,0.00013232,0.0001732565,0.00016906,0.0001687739],"domain_scores_gemma":[0.9992202,0.0003292772,0.00002674199,0.0002923741,0.00007753888,0.00005386673],"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.000009466796,0.0001858619,0.2725365,0.0001508507,0.00009596529,0.000003037438,0.01653603,0.00103381,0.0141862,0.1883423,0.003474802,0.5034451],"study_design_scores_gemma":[0.0002550605,0.0001274127,0.2647777,0.00005303177,0.000005758068,0.0000192725,0.0002492444,0.7136973,0.005216422,0.0153345,0.0000949496,0.0001693454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6582075,0.0001054413,0.3331741,0.002314467,0.00005014673,0.00009735933,2.886753e-7,0.00005931284,0.005991404],"genre_scores_gemma":[0.9929146,0.00002344082,0.006432964,0.0001623635,0.0000252385,0.000007477335,7.470252e-8,0.000003140395,0.0004307694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7126635,"threshold_uncertainty_score":0.1913542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02553967557165122,"score_gpt":0.2501971537164205,"score_spread":0.2246574781447693,"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."}}