{"id":"W4244231150","doi":"10.23952/jano.1.2019.2.04","title":"Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Preorder; Set (abstract data type); Mathematics; Computer science; Combinatorics; Discrete mathematics; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252213,0.000675849,0.0009859566,0.001142465,0.0005268619,0.00113452,0.001224655,0.0007181068,0.002273718],"category_scores_gemma":[0.003773448,0.000478585,0.001227523,0.000754881,0.001115286,0.001820693,0.0008957078,0.001382654,0.0004237484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008795148,"about_ca_system_score_gemma":0.001042123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001574171,"about_ca_topic_score_gemma":0.002363847,"domain_scores_codex":[0.9993628,0.0002089103,0.00003521776,0.0001160312,0.0001939001,0.00008308332],"domain_scores_gemma":[0.9984515,0.001096442,0.0001077087,0.0001299487,0.0001555074,0.00005880182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003165487,0.0001441135,0.002197294,0.0003264887,0.00008799139,0.000109302,0.0004470985,0.6551838,0.009567526,0.1572277,0.001839962,0.1725522],"study_design_scores_gemma":[0.00001294713,0.00007851383,0.0002605565,0.00002341938,0.00001108373,0.00003782301,0.00005778375,0.9075113,0.005062106,0.08598172,0.0009505199,0.00001220846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04058922,0.0001419312,0.9577938,0.0000824469,0.0000116377,0.00003367055,0.00006582348,0.0002442562,0.001037303],"genre_scores_gemma":[0.294782,0.0001749312,0.702555,0.00004833057,0.00002345581,0.0001873994,0.0003514179,0.0001805161,0.001696956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002273718,"threshold_uncertainty_score":0.007606328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006736461028911781,"score_gpt":0.2216589757036264,"score_spread":0.2149225146747147,"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."}}