{"id":"W3202113264","doi":"10.29007/8d9g","title":"Improved Algorithm for the Incremental Assignment Problem","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University; Laurentian University","funders":"","keywords":"Bipartite graph; Assignment problem; Hungarian algorithm; 3-dimensional matching; Matching (statistics); Algorithm; Blossom algorithm; Generalized assignment problem; Mathematics; Weapon target assignment problem; Graph; Quadratic assignment problem; Mathematical optimization; Computer science; Optimization problem; Combinatorics","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.0008287977,0.0001278585,0.0001465965,0.0000364982,0.0003348202,0.0001820255,0.0006101018,0.0000373902,0.00001209967],"category_scores_gemma":[0.00004403367,0.0001012621,0.00007475558,0.0003596279,0.00006009872,0.0002396109,0.0005330121,0.0001493321,0.000002169561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000501428,"about_ca_system_score_gemma":0.00006600224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001039579,"about_ca_topic_score_gemma":0.000007563146,"domain_scores_codex":[0.9987819,0.0001068721,0.0002716563,0.0003552458,0.0001461805,0.0003381321],"domain_scores_gemma":[0.9990016,0.0004475095,0.0000817854,0.0003760695,0.00005610736,0.00003689188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000405803,0.0000708984,0.0001905818,0.00001876995,0.00003683018,0.00002456304,0.001628741,0.0005066633,0.001055622,0.06203271,0.0001018973,0.9343287],"study_design_scores_gemma":[0.0007171787,0.0001180225,0.0005380735,0.00005277985,0.000006557155,0.00007218202,0.001010032,0.9389655,0.01816041,0.03674424,0.003375132,0.0002398787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002435004,0.0003194239,0.9943115,0.001184011,0.0009459887,0.000299263,0.000002499761,0.00008396406,0.000418377],"genre_scores_gemma":[0.2975484,0.00001075884,0.7013317,0.0005783228,0.0002238936,0.00004344221,0.000004751938,0.00001128516,0.0002475141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9384589,"threshold_uncertainty_score":0.4129348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01369102880265367,"score_gpt":0.2479045922986634,"score_spread":0.2342135634960097,"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."}}