{"id":"W7091187777","doi":"","title":"The Branch-and-Bound Tree Closure","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Hierarchy; Knapsack problem; Tree (set theory); Closure (psychology); Branching (polymer chemistry); Computational complexity theory; Linear programming; Integer programming","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006160297,0.001292343,0.00139805,0.00207146,0.0009269388,0.002545174,0.001751654,0.001243055,0.005502822],"category_scores_gemma":[0.02851987,0.001114382,0.002099676,0.001429332,0.002452729,0.005221983,0.002071506,0.005106224,0.000860209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001830937,"about_ca_system_score_gemma":0.002663085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002072225,"about_ca_topic_score_gemma":0.00127329,"domain_scores_codex":[0.9961991,0.001459214,0.0001501783,0.0005432884,0.001332476,0.0003157314],"domain_scores_gemma":[0.9793991,0.0171849,0.0009204695,0.001136233,0.001062989,0.0002962847],"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.0002954153,0.0001206451,0.001422588,0.000359949,0.00008102889,0.0001155089,0.0004688504,0.4214223,0.006161749,0.4848185,0.002698662,0.08203489],"study_design_scores_gemma":[0.00001818582,0.00008273829,0.0001999764,0.00009006288,0.00002429643,0.00006256932,0.00003208842,0.828615,0.002627403,0.1651118,0.003119774,0.00001599431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005534259,0.0001830348,0.9918724,0.0001569424,0.00001473917,0.00004335268,0.00009187974,0.00009025545,0.002013211],"genre_scores_gemma":[0.2833815,0.0009694611,0.7106797,0.0003395148,0.000131761,0.0004363541,0.0006924556,0.000400379,0.002968956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006160297,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02406133978940215,"score_gpt":0.2596056171755435,"score_spread":0.2355442773861414,"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."}}