{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002633672,0.001444624,0.00120019,0.001971197,0.0008522791,0.001846627,0.002826832,0.001293516,0.004192948],"category_scores_gemma":[0.009707036,0.0005008985,0.00152382,0.002030769,0.001170569,0.002650719,0.002044639,0.002961667,0.001954044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002777279,"about_ca_system_score_gemma":0.005006594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009201616,"about_ca_topic_score_gemma":0.0165844,"domain_scores_codex":[0.9956216,0.000721578,0.0002780767,0.0005712298,0.002399191,0.0004083548],"domain_scores_gemma":[0.9960713,0.001399403,0.000206242,0.00111323,0.001098045,0.0001117777],"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.0003392398,0.000335702,0.001118368,0.000306331,0.0000927013,0.000143623,0.0002058782,0.2287432,0.02541404,0.06928977,0.01571795,0.6582931],"study_design_scores_gemma":[0.00007447122,0.0001062556,0.0004707677,0.00002842501,0.0000343172,0.0001601856,0.00002914366,0.9455931,0.01285094,0.02793478,0.01268193,0.00003561591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005094172,0.0002634197,0.9872657,0.0002210089,0.0001124891,0.00009920506,0.00005664968,0.002281921,0.004605503],"genre_scores_gemma":[0.06867895,0.0002921026,0.9238302,0.0003202226,0.0001555385,0.0001501628,0.0004364203,0.0005371267,0.005599252],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009201616,"threshold_uncertainty_score":0.02015066,"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."}}