{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009421752,0.0001069691,0.0001482007,0.000121479,0.0001235887,0.0003825215,0.0009171085,0.00004595281,0.000007465699],"category_scores_gemma":[0.0001261562,0.00007029485,0.00005134946,0.0007247401,0.00004587031,0.000235433,0.0002510035,0.0002611334,0.00002807144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002484676,"about_ca_system_score_gemma":0.00004862099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005031995,"about_ca_topic_score_gemma":0.00001251966,"domain_scores_codex":[0.9987535,0.00009610414,0.0003204787,0.0002276646,0.0002731764,0.0003290396],"domain_scores_gemma":[0.9992383,0.0001990535,0.00003836626,0.0004429145,0.00003857077,0.00004279068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001158847,0.0004665042,0.00004128507,0.0001190835,0.000005435125,0.000004837037,0.00280489,0.005321315,0.00002173258,0.9487211,0.00007882323,0.04241387],"study_design_scores_gemma":[0.0001180714,0.00001036702,0.00001348639,0.00007983358,0.000002065336,0.000002055262,0.0001184748,0.6653948,0.00001180083,0.3335762,0.0006153141,0.00005757831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001559985,0.00003640173,0.9849664,0.006984193,0.00002406075,0.0005119689,3.741849e-7,0.0001471987,0.005769449],"genre_scores_gemma":[0.2195332,0.000003430765,0.7786818,0.001026122,0.00001105814,0.0001218228,0.000002438057,0.0000068599,0.0006132958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6600735,"threshold_uncertainty_score":0.3688663,"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."}}