{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004367501,0.001047849,0.001168759,0.001071304,0.00134576,0.003654344,0.003640991,0.001867831,0.006645751],"category_scores_gemma":[0.02156899,0.0008053608,0.001503993,0.002092847,0.001831334,0.005924202,0.004756592,0.003741094,0.00140309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002467855,"about_ca_system_score_gemma":0.002977866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00104545,"about_ca_topic_score_gemma":0.001644778,"domain_scores_codex":[0.9951099,0.001826926,0.0003007333,0.0009000425,0.00128949,0.0005729208],"domain_scores_gemma":[0.9877896,0.007569893,0.0008689646,0.002060313,0.001052177,0.0006590484],"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.0004981443,0.0004288596,0.001542984,0.000423309,0.0001013883,0.00009532026,0.0005024591,0.1534379,0.004489894,0.6628358,0.009943219,0.1657007],"study_design_scores_gemma":[0.0001325779,0.0001749759,0.0002694884,0.00003458513,0.00003508711,0.0001335961,0.0001016506,0.5634748,0.003136065,0.4254207,0.007055313,0.00003123032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02569226,0.0002607618,0.9632815,0.0008389267,0.00005567744,0.000154642,0.0001414828,0.0007689956,0.008805721],"genre_scores_gemma":[0.377336,0.0004001711,0.6122216,0.0004636268,0.0002014485,0.0006254209,0.0006180546,0.0004056978,0.007727965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006645751,"threshold_uncertainty_score":0.02309781,"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."}}