{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001371216,0.0003826369,0.0004738905,0.00003417485,0.0007041302,0.0006539547,0.001106383,0.0005624732,0.000006750508],"category_scores_gemma":[0.00003013714,0.0002704893,0.0005126301,0.0000628166,0.0002592488,0.0000538993,0.00121031,0.000649718,0.000002519364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000531204,"about_ca_system_score_gemma":0.000338639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000576458,"about_ca_topic_score_gemma":0.00000140353,"domain_scores_codex":[0.9979258,0.000013736,0.0005525956,0.0006259593,0.0003641118,0.0005177891],"domain_scores_gemma":[0.9980547,0.0005953805,0.0003947052,0.0006272554,0.0001905855,0.0001373629],"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.00006437227,0.0001642768,0.000001211704,0.002011999,0.001154365,3.00655e-7,0.01143976,0.001750146,0.0001876029,0.8140624,0.06012412,0.1090394],"study_design_scores_gemma":[0.0024125,0.0002061352,2.458864e-7,0.0001915964,0.0002135599,0.000005283391,0.001099695,0.5863833,0.0006394392,0.3893788,0.01886604,0.0006033828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001730367,0.00005693719,0.9890481,0.0008316028,0.0004445068,0.005559072,0.0001577035,0.0001751828,0.003553838],"genre_scores_gemma":[0.001337127,0.00002699071,0.9923244,0.0002304757,0.001416535,0.00250867,0.00007821741,0.00005846303,0.002019185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5846332,"threshold_uncertainty_score":0.9999747,"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."}}