{"id":"W6467814","doi":"10.1007/978-3-540-72792-7_13","title":"On Integer Programming and the Branch-Width of the Constraint Matrix","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Matroid; Combinatorics; Integer programming; Mathematics; Constant (computer programming); Constraint (computer-aided design); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Algorithm; Computer science; Physics; Geometry; Symmetric matrix; Eigenvalues and eigenvectors; Chemistry","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.001174829,0.0002681637,0.0002996971,0.000304758,0.0002287551,0.0002628626,0.00133178,0.0001578461,0.00001837193],"category_scores_gemma":[0.0001350098,0.0001514502,0.0001141327,0.0004378924,0.002641405,0.000166811,0.0005682366,0.0006198758,0.000003603414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008604673,"about_ca_system_score_gemma":0.0002552298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001564197,"about_ca_topic_score_gemma":0.0000736396,"domain_scores_codex":[0.9979969,0.00004793171,0.0004066384,0.0006055924,0.0006521122,0.0002908025],"domain_scores_gemma":[0.9978104,0.0008826877,0.0003105947,0.0007735471,0.0001604386,0.00006233442],"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.000008016075,0.00000629349,0.00004561601,0.00001198795,0.000005743418,0.000002641558,0.0005930096,0.007776786,0.000007167445,0.248884,0.000003112177,0.7426557],"study_design_scores_gemma":[0.001601161,0.0001817923,0.000982209,0.0009709633,0.00002410555,0.0002576039,0.000001710042,0.5974776,0.0009017409,0.3954192,0.001471817,0.0007101277],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007911442,0.0001470206,0.9932809,0.001721504,0.0009742614,0.000530172,0.000001856871,0.00004723543,0.003217924],"genre_scores_gemma":[0.7902941,0.00003776165,0.2070937,0.002172624,0.0001359171,0.000006575622,9.079588e-7,0.00001842446,0.0002400096],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.790215,"threshold_uncertainty_score":0.9732369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01250998386695398,"score_gpt":0.2492199954398392,"score_spread":0.2367100115728852,"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."}}