{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403125,0.001390966,0.001496185,0.0008847522,0.001055936,0.004066969,0.001887142,0.002780897,0.0190943],"category_scores_gemma":[0.0111462,0.0006151332,0.0008053205,0.001457489,0.001991113,0.002892352,0.001836889,0.003348424,0.001221961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001287972,"about_ca_system_score_gemma":0.001571313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307436,"about_ca_topic_score_gemma":0.004293397,"domain_scores_codex":[0.9981925,0.0005574254,0.00006791854,0.0003246684,0.0003838241,0.0004735746],"domain_scores_gemma":[0.994521,0.004180003,0.0004896494,0.0002680245,0.0002970869,0.0002442189],"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.001015171,0.0005030878,0.001125564,0.0009448744,0.00010543,0.001390389,0.0003051257,0.2105785,0.00229964,0.6872329,0.03666012,0.05783914],"study_design_scores_gemma":[0.0002171646,0.0001166365,0.0005246623,0.00005168413,0.0000298128,0.0003887698,0.0002110365,0.3706619,0.001351905,0.621667,0.004726389,0.00005297895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.293089,0.00232674,0.445978,0.00744808,0.0006987464,0.0003521889,0.002964152,0.0008495548,0.2462935],"genre_scores_gemma":[0.8961638,0.0006898076,0.06653365,0.0004737415,0.000614258,0.0001910403,0.001358166,0.0003082536,0.03366738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0190943,"threshold_uncertainty_score":0.06387675,"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."}}