{"id":"W2074049387","doi":"10.1007/s10878-006-9625-0","title":"Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Theory of computation; Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic equation; Quadratic programming; Discrete mathematics; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Geometry","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.0009199566,0.0001842526,0.000466009,0.0001961721,0.000177037,0.00008553509,0.0003452417,0.0001211035,0.00007528115],"category_scores_gemma":[0.001451375,0.0001331823,0.0001909212,0.0006719659,0.0002192633,0.0004055624,0.00006393513,0.0002882566,6.143363e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001806708,"about_ca_system_score_gemma":0.0006863404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002106577,"about_ca_topic_score_gemma":0.000004279258,"domain_scores_codex":[0.9972107,0.0002546613,0.001284627,0.0001341662,0.0008440024,0.0002718487],"domain_scores_gemma":[0.9959391,0.0006546492,0.001608242,0.0002447647,0.001476487,0.00007671315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003407516,0.0008050166,0.0004416839,0.0001654636,0.0001035015,0.00002994004,0.0001958168,0.8764964,0.0007028776,0.1185907,0.001263168,0.0008646183],"study_design_scores_gemma":[0.0349713,0.003260978,0.0001029959,0.00201483,0.0009455287,0.001371299,0.001687861,0.3303717,0.03020843,0.5902644,0.003198746,0.001601954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01211219,0.0002157526,0.9791534,0.0007255672,0.002572032,0.001671132,0.00001585149,0.00006388895,0.003470204],"genre_scores_gemma":[0.3482143,0.0000234937,0.6510736,0.00001172482,0.000354347,0.00001050415,0.00000496343,0.00004539599,0.0002616755],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5461247,"threshold_uncertainty_score":0.5431015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02051957195072803,"score_gpt":0.2957860368845196,"score_spread":0.2752664649337916,"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."}}