{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002509243,0.0001023229,0.00010333,0.00005033501,0.0005626856,0.0002006795,0.000830769,0.00004231112,0.000005369272],"category_scores_gemma":[0.00005099188,0.00007317142,0.00006561574,0.0004367405,0.000170718,0.000180059,0.0003778767,0.0001679252,0.00004049041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001211343,"about_ca_system_score_gemma":0.00004436091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000295948,"about_ca_topic_score_gemma":0.0001066582,"domain_scores_codex":[0.9991676,0.0000509133,0.0001474411,0.0002754115,0.0001267301,0.0002319014],"domain_scores_gemma":[0.9990422,0.0002606195,0.00003427184,0.0005800003,0.000039849,0.00004302575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000007023318,0.00004374531,0.2697236,0.00001579821,0.00005787397,0.000008610175,0.0003883343,0.00000258507,0.0002952773,0.4544864,0.004785832,0.270185],"study_design_scores_gemma":[0.0003516923,0.00003972098,0.7534383,0.00002987479,0.000009728801,0.000007852236,0.00003156256,0.00229168,0.001007075,0.1042281,0.1384016,0.0001627634],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9053515,0.002308793,0.06010282,0.01422361,0.001445904,0.0001596877,0.000001613558,0.0002200944,0.01618603],"genre_scores_gemma":[0.9941807,0.0001269923,0.001170032,0.001035528,0.00008052957,0.00001087432,4.941687e-7,0.000003894887,0.003390898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4837147,"threshold_uncertainty_score":0.4327779,"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."}}