{"id":"W2779139333","doi":"10.1137/1.9781611975031.47","title":"Strong Algorithms for the Ordinal Matroid Secretary Problem","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Secretary problem; Graphic matroid; Matroid partitioning; Rank (graph theory); Algorithm; Discrete mathematics; Competitive analysis; Upper and lower bounds; Mathematical optimization","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.00397373,0.001130754,0.001239295,0.001038346,0.001315328,0.00418862,0.003636688,0.002280707,0.008259078],"category_scores_gemma":[0.02355679,0.0007669784,0.001601089,0.00209729,0.001794859,0.006766587,0.004931071,0.004028169,0.001837195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002313805,"about_ca_system_score_gemma":0.002738619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008614143,"about_ca_topic_score_gemma":0.001393705,"domain_scores_codex":[0.9949588,0.001903837,0.0003161182,0.0009828284,0.001268657,0.0005697757],"domain_scores_gemma":[0.9876791,0.007591131,0.0008436033,0.002168681,0.0009957775,0.0007218299],"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.0005912614,0.0004825584,0.001623779,0.0004868726,0.0001117122,0.0001153879,0.0005732769,0.1085286,0.004587,0.7030078,0.01231785,0.1675738],"study_design_scores_gemma":[0.0001495108,0.0001781096,0.0002668763,0.0000384446,0.00004268457,0.0001531171,0.0001139689,0.4584912,0.003308005,0.5294611,0.007762711,0.00003432006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.033546,0.0003670813,0.9505648,0.001401957,0.00008687099,0.0001816439,0.0002142388,0.001014391,0.01262302],"genre_scores_gemma":[0.4091542,0.0004520741,0.5777382,0.00069731,0.0002835478,0.0005871497,0.0008044787,0.0005164338,0.009766547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008259078,"threshold_uncertainty_score":0.02762938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1111260376284657,"score_gpt":0.2982588400705883,"score_spread":0.1871328024421227,"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."}}