{"id":"W2028772559","doi":"10.1145/2463372.2463454","title":"Generalizing the improved run-time complexity algorithm for non-dominated sorting","year":2013,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Sorting; Algorithm; Constraint (computer-aided design); Computer science; Limiting; Sorting algorithm; Time complexity; Point (geometry); Computational complexity theory; Reduction (mathematics); Mathematical optimization; Mathematics","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.0003792238,0.0001723481,0.0001910553,0.00004135049,0.000528147,0.000462581,0.001201479,0.00005690863,0.0001195886],"category_scores_gemma":[0.00002268039,0.0001031093,0.00009341838,0.0001970172,0.0000635564,0.0008229249,0.000691374,0.0001141093,0.0001512997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002611377,"about_ca_system_score_gemma":0.00003725972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007681837,"about_ca_topic_score_gemma":0.000005614347,"domain_scores_codex":[0.998629,0.00004211563,0.0003111803,0.0004137214,0.0001760157,0.0004279509],"domain_scores_gemma":[0.9986992,0.0001553024,0.000144533,0.0007162478,0.0001849248,0.00009976511],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002108763,0.00006083625,0.00001478307,0.000009069857,0.00002789676,0.00000122195,0.0002460534,0.00001545597,0.04497497,0.0053429,0.02063723,0.9286675],"study_design_scores_gemma":[0.0004061353,0.00004576547,0.0004270091,0.000008795778,0.000004119675,0.00000603205,0.00002790794,0.9858857,0.005151295,0.005701734,0.002157073,0.0001784251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003220723,0.00002553577,0.9936452,0.0009853056,0.0002735322,0.0007285518,0.000008699511,0.0001806978,0.0009317907],"genre_scores_gemma":[0.01474848,0.000002814413,0.98232,0.000969366,0.0002228272,0.0001500699,0.00003034294,0.00001620166,0.001539946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9858702,"threshold_uncertainty_score":0.4460679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02309343934796598,"score_gpt":0.2557412610820981,"score_spread":0.2326478217341321,"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."}}