{"id":"W3202345783","doi":"10.4230/lipics.approx/random.2021.13","title":"Secretary Matching Meets Probing with Commitment","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Matching (statistics); Competitive analysis; Combinatorics; Knapsack problem; Secretary problem; Online algorithm; Order (exchange); Stochastic block model; Generalization; Set (abstract data type); Time complexity; Mathematics; Context (archaeology); Oracle; Matroid; Discrete mathematics; Computer science; Algorithm; Mathematical optimization; Graph; Upper and lower bounds; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005324375,0.0003201868,0.0003574642,0.0001693812,0.0004742878,0.0008518506,0.0009252624,0.0001167907,0.00005085822],"category_scores_gemma":[0.00002963272,0.0002660997,0.0001396191,0.0004736694,0.00006749956,0.002129406,0.0006017448,0.0003775616,0.00008484241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001084236,"about_ca_system_score_gemma":0.0002205485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001016909,"about_ca_topic_score_gemma":0.00002744933,"domain_scores_codex":[0.9975087,0.00006764115,0.0007488199,0.0003246343,0.0006321018,0.0007181101],"domain_scores_gemma":[0.9980837,0.0001025531,0.0002670375,0.000858547,0.0004280307,0.0002601945],"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.0003956354,0.003325183,0.009416826,0.005794171,0.002129492,0.0004290521,0.1867776,0.08609556,0.001143933,0.5434205,0.0208488,0.1402232],"study_design_scores_gemma":[0.007616282,0.000676015,0.0003949112,0.0008291289,0.0000584749,0.0005350951,0.003259326,0.7433062,0.004822815,0.003729557,0.2332376,0.001534564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01720513,0.00008357462,0.9662377,0.002625687,0.000477699,0.001216418,0.00008308845,0.0003853459,0.01168531],"genre_scores_gemma":[0.3477346,0.0001111354,0.6443602,0.005033144,0.0001162748,0.0002621934,0.0007295569,0.00007213479,0.001580735],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6572106,"threshold_uncertainty_score":0.9999791,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01628817910318698,"score_gpt":0.2455387204149818,"score_spread":0.2292505413117948,"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."}}