{"id":"W2030580634","doi":"10.1007/s00291-009-0192-5","title":"Deriving a minimum distance-based collective preorder: a binary mathematical programming approach","year":2010,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Preorder; Binary relation; Transitive relation; Mathematics; Linear programming; Ranking (information retrieval); Binary number; Preference; Computer science; Combinatorics; Mathematical optimization; Algorithm; Discrete mathematics; Artificial intelligence; Statistics","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","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002968546,0.0003879135,0.0006741852,0.000571108,0.000514425,0.001223558,0.001449413,0.0002110128,0.003316857],"category_scores_gemma":[0.008116497,0.0002621938,0.000261444,0.00216596,0.0003258033,0.0003980841,0.0003470621,0.000613626,0.0004437474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258389,"about_ca_system_score_gemma":0.0004958371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007599794,"about_ca_topic_score_gemma":0.0001656008,"domain_scores_codex":[0.994534,0.0002632966,0.001073455,0.001198587,0.002106114,0.0008245948],"domain_scores_gemma":[0.9945652,0.003037445,0.0004169069,0.001454935,0.0002098259,0.0003156544],"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.01058431,0.0159127,0.08393056,0.0007014616,0.0005415399,0.002751458,0.03139732,0.001271549,0.1255942,0.111873,0.05172166,0.5637202],"study_design_scores_gemma":[0.005128827,0.001005483,0.01518313,0.0003133727,0.00009624264,0.0004811219,0.004288921,0.7015609,0.006309133,0.1560172,0.1074514,0.002164383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4699171,0.00004498339,0.5050877,0.0015487,0.001026595,0.001531365,0.00002448911,0.0003389946,0.02048008],"genre_scores_gemma":[0.7888728,5.2407e-7,0.2061774,0.000116051,0.0001875978,0.0001527467,0.000002826604,0.0000506601,0.00443935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7002893,"threshold_uncertainty_score":0.999983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09501258977061526,"score_gpt":0.3844359962684172,"score_spread":0.2894234064978019,"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."}}