{"id":"W4406023013","doi":"10.1007/s10107-024-02184-y","title":"Online bipartite matching in the probe-commit model","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Competitive analysis; Patience; Bipartite graph; Matching (statistics); Online algorithm; Vertex (graph theory); Combinatorics; Mathematics; Commit; Graph; Discrete mathematics; Computer science; Mathematical optimization; Upper and lower bounds; Statistics","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.004582955,0.001277958,0.004399503,0.001380599,0.001693301,0.00430363,0.006303525,0.006171576,0.02129926],"category_scores_gemma":[0.02469608,0.001691099,0.00128646,0.003473056,0.003053003,0.0100654,0.003426626,0.005263194,0.002442757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003041329,"about_ca_system_score_gemma":0.002933112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005034962,"about_ca_topic_score_gemma":0.005120325,"domain_scores_codex":[0.9964019,0.001836452,0.00008893965,0.0007045793,0.0003658578,0.0006022672],"domain_scores_gemma":[0.9806331,0.01485994,0.001281327,0.001609937,0.0006440419,0.0009716602],"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.0007388883,0.0004794798,0.0008396987,0.0003091379,0.0001010675,0.0003809321,0.0002106593,0.2911953,0.000682818,0.6642733,0.01792101,0.02286773],"study_design_scores_gemma":[0.0001099207,0.00004625943,0.0001337109,0.00001972335,0.00002282329,0.00006878129,0.00005852398,0.6518521,0.0001934146,0.3461093,0.001362848,0.00002264408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1331496,0.00121259,0.8168882,0.009429887,0.0002944411,0.0003737768,0.001965607,0.0009736004,0.03571235],"genre_scores_gemma":[0.8638823,0.00099528,0.07752977,0.00107944,0.0004248107,0.0006047848,0.001061216,0.0004515347,0.05397079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02129926,"threshold_uncertainty_score":0.07125318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03770484380387491,"score_gpt":0.3200962744507926,"score_spread":0.2823914306469177,"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."}}