{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006814,0.0009826157,0.001493341,0.002491475,0.0007871523,0.001903928,0.001924331,0.0009862651,0.02064316],"category_scores_gemma":[0.009808984,0.0008495439,0.001112339,0.004900267,0.001006351,0.004842835,0.002537512,0.002739614,0.00575118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001353635,"about_ca_system_score_gemma":0.00191665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003569958,"about_ca_topic_score_gemma":0.006473903,"domain_scores_codex":[0.9985005,0.0002249902,0.00008932412,0.0002189496,0.0007702678,0.0001960774],"domain_scores_gemma":[0.993769,0.003495029,0.0001869785,0.00179042,0.0005977051,0.0001609361],"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.0005113203,0.0002270972,0.0006975423,0.0006172523,0.0000581196,0.0001488593,0.0003493247,0.09790213,0.008755046,0.1242312,0.03493083,0.7315713],"study_design_scores_gemma":[0.0001283196,0.0001603318,0.0005002276,0.0002214739,0.00009842201,0.0001673015,0.0001931446,0.4235419,0.01103377,0.510086,0.05382882,0.00004033669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05480722,0.002370291,0.88832,0.001281437,0.0006155022,0.0003783359,0.00280891,0.009258919,0.04015949],"genre_scores_gemma":[0.2132699,0.00210465,0.7356672,0.0005815697,0.000299796,0.0005017839,0.007784007,0.003470351,0.03632082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02064316,"threshold_uncertainty_score":0.0690583,"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."}}