{"id":"W2886931138","doi":"10.1145/3379552","title":"An Experimental Study of Algorithms for Online Bipartite Matching","year":2020,"lang":"en","type":"preprint","venue":"ACM Journal of Experimental Algorithmics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Greedy algorithm; Bipartite graph; Computer science; Matching (statistics); Algorithm; Preprocessor; Ranking (information retrieval); Online algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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"],"consensus_categories":[],"category_scores_codex":[0.0005842896,0.0004439189,0.0008945696,0.0003357197,0.000144508,0.0003107167,0.003755956,0.0001846168,0.00001586394],"category_scores_gemma":[0.00006197872,0.0004194518,0.000345526,0.0002722769,0.00006387334,0.0007884157,0.002289798,0.0007403769,0.000001658977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001926098,"about_ca_system_score_gemma":0.0003064585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005687183,"about_ca_topic_score_gemma":0.000002237198,"domain_scores_codex":[0.9962965,0.0002334824,0.001478612,0.000622339,0.0009858973,0.000383168],"domain_scores_gemma":[0.9965897,0.0001048547,0.001338378,0.001042796,0.0005025613,0.0004216697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001310281,0.09492735,0.0004614381,0.0004467133,0.002809512,0.0007278059,0.1960271,0.1223508,0.5326239,0.004608989,0.002123167,0.04158293],"study_design_scores_gemma":[0.007923472,0.02196558,0.00009782588,0.0003289904,0.00009796421,0.0001813514,0.03356558,0.6929302,0.2352602,0.006178478,0.0002624918,0.001207887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5176576,0.001921567,0.4758732,0.0006125213,0.002240995,0.001475705,0.0001069013,0.00008690266,0.00002463556],"genre_scores_gemma":[0.4758006,0.00005062195,0.5234653,0.0001430442,0.0004275406,0.00003131559,0.0000330192,0.00004099649,0.000007521645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5705794,"threshold_uncertainty_score":0.9998257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09766027536202379,"score_gpt":0.3921035343862945,"score_spread":0.2944432590242707,"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."}}