{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01758701,0.002433979,0.001965425,0.002900725,0.002067728,0.002566085,0.00535922,0.002971045,0.007810274],"category_scores_gemma":[0.0748284,0.0008181417,0.001602333,0.00529354,0.002369121,0.006839005,0.003165185,0.004066818,0.002207096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0041132,"about_ca_system_score_gemma":0.002911515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003002397,"about_ca_topic_score_gemma":0.003438161,"domain_scores_codex":[0.971505,0.01293315,0.002758782,0.003988071,0.0063994,0.00241554],"domain_scores_gemma":[0.8803639,0.07446256,0.005766916,0.02883785,0.008531949,0.002036918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01092572,0.01427413,0.01798546,0.00376327,0.001154025,0.0004556653,0.0004419758,0.5092623,0.02048044,0.0447819,0.07299206,0.3034829],"study_design_scores_gemma":[0.001800789,0.003607323,0.00586882,0.0001964337,0.0002307502,0.0007557326,0.0005136722,0.9066765,0.02692543,0.03567978,0.01762562,0.0001191219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7083427,0.008524172,0.1948313,0.005824308,0.002208346,0.002445882,0.0113493,0.0155818,0.05089239],"genre_scores_gemma":[0.7903014,0.001101511,0.1865052,0.001009019,0.0003641069,0.001271289,0.01389503,0.001304899,0.004247545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01758701,"threshold_uncertainty_score":0.09301019,"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."}}