{"id":"W4403364360","doi":"10.1016/j.ejor.2024.10.014","title":"Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mediation; Inverse; Mathematical optimization; Conflict resolution; Graph; Path (computing); Theoretical computer science; Operations research; Mathematics; Political science; Computer network","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":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04121354,0.00009935241,0.0001205611,0.0004281336,0.0009173428,0.001188131,0.00132026,0.00001908167,0.0000993231],"category_scores_gemma":[0.01371264,0.00004874142,0.0001097974,0.001743092,0.0002762188,0.000668706,0.0001924101,0.0009440017,0.0007864221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000744035,"about_ca_system_score_gemma":0.000429578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000217693,"about_ca_topic_score_gemma":0.000007139074,"domain_scores_codex":[0.9927264,0.003191085,0.000792969,0.0002618147,0.002793625,0.0002341036],"domain_scores_gemma":[0.9916577,0.006113956,0.0001264327,0.0004492323,0.001458511,0.0001941311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003556742,0.00008155061,0.0000558032,0.000006778938,0.00006228845,0.00008057457,0.03020663,0.3745476,0.01008693,0.4959829,0.07272656,0.01580676],"study_design_scores_gemma":[0.0005382622,0.000589419,0.006864678,0.0004567963,0.00003389992,0.0001500849,0.01386379,0.6474032,0.001570951,0.2100392,0.1181557,0.0003340434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6470858,0.0003211656,0.2953385,0.05108382,0.0006834081,0.0006941489,0.00002907119,0.00002305933,0.00474096],"genre_scores_gemma":[0.9939458,0.0000758924,0.003529742,0.0005721815,0.0006242889,0.00003721829,0.000002331703,0.00001813434,0.001194461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3468599,"threshold_uncertainty_score":0.9999916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.6142092893936134,"score_gpt":0.4791714146721988,"score_spread":0.1350378747214146,"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."}}