{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001441099,0.0006261371,0.0007057042,0.000134115,0.000661699,0.001908143,0.003007425,0.0002684387,0.000007978677],"category_scores_gemma":[0.000136326,0.000449809,0.0002633656,0.0004418481,0.000458686,0.0001686974,0.002993894,0.0008287259,0.00007226702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001133927,"about_ca_system_score_gemma":0.0007333256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005180041,"about_ca_topic_score_gemma":0.0001278068,"domain_scores_codex":[0.9964631,0.00006022602,0.0009869606,0.0008210099,0.0008111775,0.0008575797],"domain_scores_gemma":[0.9959787,0.0006308738,0.0007218791,0.002200359,0.0002023247,0.0002658428],"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.00001226306,0.0002110715,0.000004083605,0.0008652895,0.0002210483,0.00004345977,0.004289083,0.0007586922,0.0001245082,0.9523149,0.0029847,0.03817088],"study_design_scores_gemma":[0.000450783,0.00009414867,0.000002552026,0.0003765465,0.0001143454,0.00007569405,0.001065946,0.09983101,0.0003984152,0.8865246,0.01008144,0.0009845232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002375504,0.0008266187,0.9588093,0.001401809,0.001058943,0.003614492,0.00005988619,0.001136795,0.03071663],"genre_scores_gemma":[0.06195011,0.00005710714,0.9359002,0.0001134757,0.0002982332,0.001024013,0.0000599616,0.00007953187,0.0005173733],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09907232,"threshold_uncertainty_score":0.9997954,"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."}}