{"id":"W4377200038","doi":"10.1007/978-3-031-32726-1_25","title":"Compressing Branch-and-Bound Trees","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Branch and bound; Upper and lower bounds; Computer science; Branching (polymer chemistry); Search tree; Tree (set theory); Heuristic; Compression (physics); Node (physics); Branch and cut; Algorithm; Combinatorics; Integer programming; Mathematics; Artificial intelligence; Search 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00137189,0.0004530608,0.0004799093,0.0008385938,0.0003725359,0.0009652211,0.002839121,0.0003008638,0.000006681747],"category_scores_gemma":[0.0002268936,0.0004286236,0.00008814962,0.00069589,0.001046457,0.0009052634,0.001660243,0.0007439418,0.00007023101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001741578,"about_ca_system_score_gemma":0.0002617355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002087682,"about_ca_topic_score_gemma":0.00004668853,"domain_scores_codex":[0.9964896,0.00005875791,0.0005012046,0.001458659,0.0008977659,0.0005940279],"domain_scores_gemma":[0.9972358,0.000767882,0.0002845373,0.001401115,0.0001532895,0.0001573359],"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.000002716064,0.000008411312,0.00003445461,0.0000373966,0.00000686493,0.00002511738,0.0006555967,0.007227719,0.0003575286,0.1004401,0.000009672,0.8911944],"study_design_scores_gemma":[0.0001705851,0.00008538574,0.0009252818,0.0004166449,0.000006438906,0.00005226822,1.19685e-7,0.6626027,0.001686132,0.332422,0.001049591,0.0005829454],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001263585,0.0003930137,0.9925368,0.0004285247,0.00254179,0.000274393,0.00000320146,0.0003927518,0.003303197],"genre_scores_gemma":[0.04096106,0.00009289747,0.9568837,0.0007210444,0.0004157179,0.00001037713,0.000003490936,0.00005052992,0.0008611736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8906114,"threshold_uncertainty_score":0.9998165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04226413585186892,"score_gpt":0.295072096857171,"score_spread":0.252807961005302,"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."}}