{"id":"W2033642621","doi":"10.1016/j.dam.2015.04.004","title":"The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases","year":2015,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Generalization; Rank (graph theory); Discrete mathematics; Time complexity; Quadratic equation; Matrix (chemical analysis)","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.00193048,0.001351246,0.001709974,0.0009763894,0.001502521,0.00417156,0.002315792,0.004567585,0.01634137],"category_scores_gemma":[0.01200656,0.0007861287,0.00108828,0.001909546,0.002240932,0.003927199,0.002119454,0.003554789,0.00108604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403293,"about_ca_system_score_gemma":0.001348309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003725383,"about_ca_topic_score_gemma":0.004189942,"domain_scores_codex":[0.9981214,0.0007435932,0.00005985087,0.0003995993,0.0002825814,0.0003929142],"domain_scores_gemma":[0.9936162,0.004821225,0.0006329637,0.0003075261,0.0003077317,0.0003143607],"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.0007490385,0.000519612,0.001505434,0.000949144,0.0001285017,0.0009273733,0.0003376765,0.1241928,0.00166162,0.7882046,0.04090889,0.03991532],"study_design_scores_gemma":[0.0001471796,0.00005537826,0.0005996415,0.00005692724,0.00002593023,0.0002501798,0.0001924168,0.2187544,0.0005358433,0.7759447,0.003404542,0.00003273983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.410651,0.002623019,0.3466203,0.0133826,0.0007047598,0.0003600278,0.003572697,0.000571457,0.2215142],"genre_scores_gemma":[0.9085804,0.0007433448,0.0532116,0.0009248177,0.000810283,0.0002571573,0.001877809,0.0002516998,0.03334293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01634137,"threshold_uncertainty_score":0.05466729,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04357328221893381,"score_gpt":0.2789088800179288,"score_spread":0.235335597798995,"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."}}