{"id":"W2407048800","doi":"10.1007/s10107-017-1111-1","title":"The bilinear assignment problem: complexity and polynomially solvable special cases","year":2017,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Rank (graph theory); Function (biology); Diagonal; Value (mathematics); Generalization; Polynomial; Discrete mathematics; Mathematical 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.003072849,0.001447013,0.002539945,0.001682421,0.002574817,0.00982689,0.003434719,0.003900534,0.01079597],"category_scores_gemma":[0.02088372,0.001196508,0.00226542,0.003456158,0.004321328,0.01609693,0.004089879,0.009394911,0.00120628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002999345,"about_ca_system_score_gemma":0.002529369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001949696,"about_ca_topic_score_gemma":0.001770475,"domain_scores_codex":[0.9953447,0.001360904,0.0002309104,0.001091239,0.00103233,0.0009399001],"domain_scores_gemma":[0.9777973,0.0167973,0.001665107,0.001895199,0.000958706,0.0008863783],"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.0003451908,0.0004165163,0.00112772,0.0004289186,0.00007934348,0.0002926341,0.000437273,0.02360752,0.0008881494,0.9416695,0.01444389,0.01626339],"study_design_scores_gemma":[0.00004564904,0.00001175145,0.0001446248,0.00001386726,0.00001745767,0.0001095962,0.00009410195,0.03950781,0.0003125012,0.9584035,0.001324351,0.00001478481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3875898,0.003977837,0.4865496,0.02178618,0.0007299687,0.000294028,0.002983369,0.0005608849,0.09552835],"genre_scores_gemma":[0.915717,0.002148654,0.0591791,0.001064501,0.001893412,0.0003642524,0.001852668,0.0003043121,0.01747609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01079597,"threshold_uncertainty_score":0.03611618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0806663039339923,"score_gpt":0.307690644329012,"score_spread":0.2270243403950197,"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."}}