{"id":"W2603318542","doi":"","title":"Polynomially Solvable Cases of the Constant Rank Unconstrained Quadratic 0-1 Programming Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic programming; Quadratic equation; Quadratic function; Matrix (chemical analysis); Function (biology); Mathematical optimization; Computer science; 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.000379094,0.0002043195,0.0003252752,0.0001016749,0.0003474288,0.00006355272,0.0003003291,0.0001311287,0.00009442349],"category_scores_gemma":[0.0005918615,0.0001503901,0.0001344058,0.0004587807,0.0008518753,0.0001303216,0.00006265293,0.0003005345,0.000004440185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001645927,"about_ca_system_score_gemma":0.0002721378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001681908,"about_ca_topic_score_gemma":0.0002205743,"domain_scores_codex":[0.9981663,0.0001540415,0.000556077,0.000251713,0.0004508682,0.0004210563],"domain_scores_gemma":[0.9983064,0.0007084387,0.0002911569,0.0003980332,0.0002281214,0.0000678504],"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.0001629138,0.0007665411,0.003049372,0.0007644072,0.0001898527,0.0001504103,0.002221771,0.00519674,0.005824605,0.9605024,0.004572352,0.01659863],"study_design_scores_gemma":[0.0133975,0.0008291743,0.0005034755,0.0009326637,0.0004807946,0.001166866,0.00957552,0.02813798,0.05214067,0.8678838,0.02229211,0.002659479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3720081,0.0006898717,0.5859966,0.003353377,0.000471922,0.00583603,0.0001513495,0.000648374,0.03084433],"genre_scores_gemma":[0.4575467,0.00001256202,0.5383373,0.00005271758,0.0001007353,0.00008587388,0.00001145203,0.00005442463,0.003798261],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09261862,"threshold_uncertainty_score":0.613273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0194214988598456,"score_gpt":0.2746901866794111,"score_spread":0.2552686878195655,"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."}}