{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003336985,0.001095167,0.001965958,0.0006966899,0.001199686,0.003591844,0.002724224,0.002952795,0.008887271],"category_scores_gemma":[0.01868725,0.0007628172,0.001828818,0.001492933,0.00226169,0.007996168,0.004058285,0.004366665,0.001121002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002213527,"about_ca_system_score_gemma":0.00229717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002460919,"about_ca_topic_score_gemma":0.001590165,"domain_scores_codex":[0.9937209,0.002212941,0.0002575527,0.002004837,0.0008135398,0.0009902525],"domain_scores_gemma":[0.984617,0.009317316,0.001626567,0.00260202,0.0007063435,0.001130718],"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.0005726357,0.0003135683,0.001814196,0.0002916684,0.0001153034,0.0003228651,0.0003888276,0.3039144,0.003430568,0.6425997,0.006390269,0.03984606],"study_design_scores_gemma":[0.0000697811,0.0001468033,0.0002934005,0.00001627347,0.00002478695,0.0001431121,0.0001135745,0.6262749,0.001283082,0.368468,0.003137378,0.00002886995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.118941,0.0002937277,0.8591132,0.003094763,0.0001259144,0.0002117631,0.0008155458,0.0009358955,0.01646821],"genre_scores_gemma":[0.865936,0.0003259834,0.1200112,0.0006408965,0.0002626289,0.0002204929,0.0008876583,0.0003448157,0.01137036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008887271,"threshold_uncertainty_score":0.02973086,"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."}}