{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001525202,0.0004458989,0.0005960381,0.00007297217,0.001801862,0.003948431,0.002520481,0.0002204192,0.00002797597],"category_scores_gemma":[0.0004087612,0.0003101647,0.0002363919,0.00009054469,0.001097864,0.0002137067,0.00550909,0.0008750574,0.00003968874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008241215,"about_ca_system_score_gemma":0.00019325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007646511,"about_ca_topic_score_gemma":0.00008031802,"domain_scores_codex":[0.9969468,0.0001441076,0.0006524166,0.0008574362,0.0006603608,0.0007389252],"domain_scores_gemma":[0.9966469,0.0007556449,0.0004429361,0.001808249,0.0001078918,0.0002383358],"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.00001254251,0.0002926298,0.00002991289,0.000531242,0.0001014343,0.0000886813,0.0007606241,0.00001377739,0.000005138963,0.5535238,0.001005095,0.4436352],"study_design_scores_gemma":[0.000250277,0.0001279725,0.00004979298,0.0003545761,0.00004029696,0.000121398,0.00006405245,0.05468763,0.00005562876,0.9024556,0.04129415,0.0004985763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003177997,0.001157938,0.9648296,0.008291853,0.002044139,0.0035107,0.00002874102,0.0007130592,0.01624602],"genre_scores_gemma":[0.03697918,0.0000946195,0.9595826,0.00008359393,0.001981715,0.0003517187,0.00001138893,0.00004738904,0.0008677695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4431366,"threshold_uncertainty_score":0.999935,"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."}}