{"id":"W2949865904","doi":"10.48550/arxiv.0911.0086","title":"Sorting under Partial Information (without the Ellipsoid Algorithm)","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Logarithm; Combinatorics; Time complexity; Binary logarithm; Log-log plot; Sorting algorithm; Algorithm; Linear extension; Pairwise comparison; Upper and lower bounds; Sorting; Approximation algorithm; Ellipsoid method; Entropy (arrow of time); Discrete mathematics; Regular polygon; Convex optimization; Convex combination; Partially ordered set","routes":{"ca_aff":true,"ca_fund":true,"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.002121041,0.0007364237,0.00155598,0.001800943,0.0008846405,0.002015095,0.002227197,0.001107721,0.004417969],"category_scores_gemma":[0.007909125,0.0006118387,0.001152492,0.003838372,0.001440861,0.006645915,0.003158135,0.001758638,0.001180293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001691723,"about_ca_system_score_gemma":0.002638458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00393134,"about_ca_topic_score_gemma":0.005030645,"domain_scores_codex":[0.9971355,0.0006441732,0.0002295044,0.0005835004,0.001011459,0.0003958489],"domain_scores_gemma":[0.9958292,0.00168385,0.0003728699,0.001401138,0.0005132396,0.0001998186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009484771,0.0001775312,0.001609392,0.0002876741,0.00007770672,0.0001383491,0.0004101119,0.2783384,0.00758921,0.2787806,0.009519161,0.4221233],"study_design_scores_gemma":[0.00007335552,0.0001171622,0.000399469,0.00003486779,0.0000218474,0.0001314806,0.00006300375,0.759777,0.005493268,0.2268171,0.007022537,0.00004893461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03232359,0.0003518588,0.9603723,0.0004913336,0.00007950306,0.000117141,0.0003976652,0.001165079,0.004701475],"genre_scores_gemma":[0.2186178,0.0003711961,0.775513,0.0002940604,0.00006346185,0.0001635644,0.0008508749,0.0001621922,0.003963748],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004417969,"threshold_uncertainty_score":0.01477951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05492157628295052,"score_gpt":0.196491950106113,"score_spread":0.1415703738231625,"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."}}