{"id":"W3129885107","doi":"10.1287/moor.2020.1083","title":"Strong algorithms for the ordinal matroid secretary problem","year":2021,"lang":"en","type":"article","venue":"Universidad de Chile","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Secretary problem; Mathematics; Combinatorics; Rank (graph theory); Order (exchange); Discrete mathematics; Measure (data warehouse); Probability distribution; Algorithm; Computer science; Mathematical optimization; Data mining; Statistics; Optimal stopping","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.0001683242,0.00007646262,0.0000757999,0.00004608992,0.0002868816,0.0001489181,0.0005237452,0.00003589664,0.0001409189],"category_scores_gemma":[0.00001615903,0.00006265568,0.00007358841,0.0002849601,0.00003415208,0.0002875365,0.0001936674,0.0001146816,0.00001909113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005674708,"about_ca_system_score_gemma":0.0002400509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002015975,"about_ca_topic_score_gemma":0.00001188386,"domain_scores_codex":[0.9992355,0.00004702201,0.00008318499,0.0002234635,0.0001473278,0.0002635497],"domain_scores_gemma":[0.9993187,0.0001209877,0.00003384055,0.0003092541,0.00013402,0.00008322661],"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.00003751383,0.0002419255,0.0009577994,0.00009756613,0.000243344,0.0001766934,0.004597306,0.0974976,0.001318812,0.7348477,0.06542979,0.09455396],"study_design_scores_gemma":[0.0008886231,0.00008795084,0.0005715383,0.00001974909,0.00001592565,0.0000594812,0.0006973561,0.8699648,0.001144392,0.003335732,0.1230309,0.0001835523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003049975,0.000157986,0.9832232,0.004798878,0.0000969607,0.0002213045,0.0000113456,0.00008984995,0.01109549],"genre_scores_gemma":[0.07755125,0.0001658714,0.9025945,0.0014986,0.0002282847,0.00002823257,0.00006491007,0.00002620364,0.01784212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7724672,"threshold_uncertainty_score":0.2555024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02142803827901939,"score_gpt":0.2659630949472661,"score_spread":0.2445350566682467,"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."}}