{"meta":{"query_hash":"7eb314db32b8","filters":{"venue":"RAIRO - Operations Research"},"cohort_total":22,"direct_labels_cover":0,"predictions_cover":22,"exported":22,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7eb314db32b8","api":"https://metacan.xera.ac/api/v1/cohort?venue=RAIRO+-+Operations+Research"},"results":[{"id":"W1994797589","doi":"10.1051/ro:2008008","title":"Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications","year":2008,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Logarithm; Differentiable function; Constraint (computer-aided design); Set (abstract data type); Mathematics; Multiplier (economics); Algorithm; Nonlinear system; Mathematical optimization; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.15214221796013597,"score_gpt":0.43252963383834475,"score_spread":0.2803874158782088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994797589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43089053,0.00024498077,0.5501776,0.0045020455,0.00035706363,0.005457442,0.0015047173,0.00013486552,0.0067307623],"genre_scores_gemma":[0.9266013,0.0000868591,0.066230826,0.000022123673,0.000047579815,0.00014546508,0.00002613053,0.000037872964,0.0068018567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953079,0.0012755357,0.0008002306,0.0003642226,0.0018153075,0.0004367773],"domain_scores_gemma":[0.99495715,0.0010949483,0.00012369169,0.001536931,0.0021695371,0.00011774371],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016406465,0.00017763865,0.00045567015,0.0006628278,0.0013310215,0.00004694828,0.0010583655,0.00013135652,0.00061316014],"category_scores_gemma":[0.003987008,0.00011124188,0.00032420602,0.005689336,0.0025695942,0.00018692327,0.00030770828,0.0006710169,0.000009160728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008603138,0.0032988617,0.0416148,0.00032547393,0.005713976,0.000008819886,0.034900438,0.5912987,0.03339322,0.27634737,0.0041024107,0.008909921],"study_design_scores_gemma":[0.0015086159,0.00015174485,0.03624771,0.00012071736,0.0006067879,0.00004196434,0.0064536356,0.89671576,0.051069982,0.0055749626,0.0009814184,0.0005266835],"about_ca_topic_score_codex":0.00026543817,"about_ca_topic_score_gemma":0.0005919545,"teacher_disagreement_score":0.49571076,"about_ca_system_score_codex":0.00019069805,"about_ca_system_score_gemma":0.0011680534,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W2091085418","doi":"10.1051/ro:2008007","title":"La différentiation automatique et son utilisation en optimisation","year":2008,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Sketch; Computer science; Software; Focus (optics); Automatic differentiation; Software engineering; Key (lock); Ideal (ethics); Operations research; Engineering; Computer security; Programming language; Algorithm; Epistemology; Philosophy","score_opus":0.14849846666276098,"score_gpt":0.4375453487014911,"score_spread":0.2890468820387301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091085418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054151997,0.00069207855,0.9108064,0.027967384,0.0007472297,0.0007018453,0.000019895708,0.00015695383,0.0047561703],"genre_scores_gemma":[0.43561482,0.0013841641,0.54643625,0.0003017075,0.00051475095,0.00022903009,0.00007339208,0.000039645995,0.015406207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98967093,0.0072736843,0.0005291164,0.00067398493,0.0012144725,0.00063778996],"domain_scores_gemma":[0.99674547,0.0014979739,0.000053118652,0.00065543555,0.00081657176,0.00023143791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055301534,0.00023226299,0.00025656566,0.00042582978,0.0012321761,0.0008152724,0.0006349118,0.00034020853,0.00041260477],"category_scores_gemma":[0.0017244195,0.00023497915,0.00011426915,0.0016134555,0.0004309575,0.002244415,0.00033807955,0.0010923896,0.00046473191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012762062,0.0008924981,0.00025020557,0.0000872534,0.00005107902,0.000054316788,0.024837334,0.028507542,0.0065792943,0.35341433,0.0042152023,0.5810982],"study_design_scores_gemma":[0.00043377242,0.00021615266,0.018492028,0.0000878688,0.00000757008,0.00009621203,0.000257261,0.93660533,0.0035256946,0.0024375771,0.037572894,0.0002676319],"about_ca_topic_score_codex":0.0014338881,"about_ca_topic_score_gemma":0.00013523496,"teacher_disagreement_score":0.9080978,"about_ca_system_score_codex":0.00037320465,"about_ca_system_score_gemma":0.0009865764,"threshold_uncertainty_score":0.95821714},"labels":[],"label_agreement":null},{"id":"W2126642927","doi":"10.1051/ro:2005003","title":"Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?","year":2005,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Humanities; Philosophy","score_opus":0.048200964470930446,"score_gpt":0.34690826325165497,"score_spread":0.29870729878072455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126642927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007458543,0.0016183022,0.83378154,0.13460843,0.00017167068,0.0013952133,0.000055026107,0.00018919988,0.027434781],"genre_scores_gemma":[0.36090726,0.0014330976,0.4702552,0.00047948185,0.001073827,0.00081149774,0.000272233,0.00010480461,0.16466261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928258,0.0023419068,0.0010039095,0.0010702852,0.001817674,0.00094041193],"domain_scores_gemma":[0.99485147,0.001217703,0.00014265688,0.0009291278,0.002450293,0.00040872564],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004644881,0.00041814108,0.0004396815,0.0013151739,0.0020308674,0.0024436417,0.001348462,0.0004985532,0.0010925422],"category_scores_gemma":[0.0010604037,0.00042354726,0.00021493435,0.008781879,0.00037595816,0.0023499636,0.00066499296,0.0011987654,0.0019593767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022075925,0.00065468694,0.000010490663,0.000115107105,0.000070345566,0.000013299383,0.0034034564,0.46933585,0.00027139258,0.5120638,0.0056447196,0.008394748],"study_design_scores_gemma":[0.0008968474,0.00010528562,0.00030614782,0.0000742336,0.000057382058,0.000105659965,0.0003233469,0.9065656,0.00046960026,0.0013498086,0.08932034,0.00042576832],"about_ca_topic_score_codex":0.0020727452,"about_ca_topic_score_gemma":0.00069414725,"teacher_disagreement_score":0.510714,"about_ca_system_score_codex":0.0007852337,"about_ca_system_score_gemma":0.0023700153,"threshold_uncertainty_score":0.99982166},"labels":[],"label_agreement":null},{"id":"W2147243846","doi":"10.1051/ro/2014019","title":"Block decomposition approach to compute a minimum geodetic set","year":2014,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Geodetic datum; Block (permutation group theory); Set (abstract data type); Decomposition; Computer science; Algorithm; Mathematics; Arithmetic; Geodesy; Combinatorics; Geology; Programming language; Chemistry","score_opus":0.05863119614734241,"score_gpt":0.3485741806096815,"score_spread":0.28994298446233907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147243846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106645204,0.000056246714,0.8251098,0.0012892509,0.0002728746,0.0010334951,0.000026962818,0.0005115758,0.06505461],"genre_scores_gemma":[0.9583023,0.000013748105,0.039815165,0.00011188787,0.0001428896,0.00012658762,0.00012871041,0.00003646429,0.0013222048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987258,0.00017356535,0.0001983964,0.00022329323,0.0003326363,0.0003463612],"domain_scores_gemma":[0.99921685,0.000083094994,0.0000038749386,0.00031596018,0.0002056079,0.00017457927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062676595,0.00011074761,0.00012348978,0.00032007767,0.00033382373,0.00026837105,0.00021183083,0.00007634677,0.00006110694],"category_scores_gemma":[0.000059852006,0.00011341397,0.00003105728,0.0006284258,0.000036452282,0.00011184377,0.00006053813,0.00026117466,0.00056249154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026414343,0.00004209968,0.000017109724,0.000031180276,0.000010995489,2.2873014e-7,0.00073237094,0.98333377,0.002065528,0.0023824943,0.0104434835,0.0009380944],"study_design_scores_gemma":[0.00023456458,0.000056756944,0.00017315683,0.00002098922,0.000002854599,0.000006359481,0.000042973526,0.9813603,0.0009369389,0.000041028452,0.01698471,0.00013937199],"about_ca_topic_score_codex":0.00003070145,"about_ca_topic_score_gemma":0.000043756492,"teacher_disagreement_score":0.85165715,"about_ca_system_score_codex":0.0000733031,"about_ca_system_score_gemma":0.000029664727,"threshold_uncertainty_score":0.72298783},"labels":[],"label_agreement":null},{"id":"W2154857537","doi":"10.1051/ro:2007028","title":"A note on tree realizations of matrices","year":2007,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Realization (probability); Diagonal; Tree (set theory); Mathematics; Combinatorics; Metric (unit); Class (philosophy); Zero (linguistics); Discrete mathematics; Computer science; Geometry; Statistics; Artificial intelligence; Engineering","score_opus":0.15364821961147487,"score_gpt":0.48619410998093193,"score_spread":0.33254589036945703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154857537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75796026,0.000069702946,0.09711335,0.0027052765,0.00006935128,0.0015023191,0.00010928275,0.00015634662,0.1403141],"genre_scores_gemma":[0.9831024,0.000034739132,0.012222642,0.000029025674,0.00007455264,0.00009754186,0.000028253127,0.000020895108,0.004389995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985018,0.00017847147,0.00035118885,0.00020032012,0.0004814214,0.00028680766],"domain_scores_gemma":[0.99752456,0.0013831872,0.000027473716,0.00055443094,0.0004147272,0.00009559408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428816,0.00008538553,0.00013117367,0.000518323,0.00056111976,0.000043431253,0.00028464542,0.00008503963,0.00021270814],"category_scores_gemma":[0.0010067932,0.00007504214,0.00006129838,0.00124432,0.00018334597,0.0000953016,0.000052289473,0.00025710728,0.0001171184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019325142,0.00033604837,0.000046660192,0.00002336763,0.00001107492,0.000001053534,0.000710519,0.00020009058,0.0074046734,0.98588026,0.0028421828,0.002524749],"study_design_scores_gemma":[0.0011679173,0.0005206734,0.0035626045,0.00018226987,0.000050582636,0.0000118416865,0.0022227245,0.0048645614,0.11924378,0.83420837,0.03351362,0.00045103353],"about_ca_topic_score_codex":0.00007375297,"about_ca_topic_score_gemma":0.000997015,"teacher_disagreement_score":0.22514209,"about_ca_system_score_codex":0.00004616448,"about_ca_system_score_gemma":0.00009004313,"threshold_uncertainty_score":0.4315736},"labels":[],"label_agreement":null},{"id":"W2160970399","doi":"10.1051/ro:2006011","title":"Numerical solutions of the mass transfer problem","year":2006,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Australian Government","keywords":"Bounded function; Mathematics; Real line; Measure (data warehouse); Plane (geometry); Convergence (economics); Interval (graph theory); Rate of convergence; Numerical analysis; Function (biology); Transfer (computing); Line (geometry); Mass transfer; Transfer problem; Applied mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer science; Geometry; Physics","score_opus":0.18144566460883074,"score_gpt":0.37698397537349426,"score_spread":0.19553831076466352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160970399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23940334,0.0001910214,0.5974497,0.020804849,0.00043806373,0.0028206455,0.00015706124,0.00019442067,0.13854088],"genre_scores_gemma":[0.97058773,0.0000055071546,0.006168895,0.000014777324,0.00011591781,0.0001771226,0.000013859949,0.00001885289,0.022897366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821514,0.00033342146,0.00032149538,0.0001745192,0.00060721627,0.00034819904],"domain_scores_gemma":[0.99888235,0.0002581792,0.000008782031,0.00045417473,0.00034572397,0.00005079874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085068523,0.00008394427,0.00013481463,0.000107982916,0.00091824983,0.00004904538,0.0002633273,0.00007576185,0.00089164235],"category_scores_gemma":[0.0002077588,0.000057034722,0.00010593825,0.0007664976,0.00024886394,0.000093164264,0.000044035292,0.00035875614,0.000090393114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000798239,0.00046646927,0.0003435551,0.000052346804,0.000029568624,8.5376973e-7,0.00030470543,0.003399266,0.015730891,0.92133963,0.058119085,0.0002056214],"study_design_scores_gemma":[0.004528545,0.0008097606,0.015487521,0.00051611586,0.00031490743,0.000096496056,0.0025317068,0.11080816,0.068206824,0.669861,0.12541567,0.001423278],"about_ca_topic_score_codex":0.0007198998,"about_ca_topic_score_gemma":0.00057489006,"teacher_disagreement_score":0.73118436,"about_ca_system_score_codex":0.00006193293,"about_ca_system_score_gemma":0.00021762298,"threshold_uncertainty_score":0.9762859},"labels":[],"label_agreement":null},{"id":"W2166999867","doi":"10.1051/ro:2003002","title":"Optimal QoS control of interacting service stations","year":2002,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Queue; Network packet; Quality of service; Computer science; Monotonic function; Computer network; Queueing theory; Queue management system; Controller (irrigation); Mathematical optimization; Real-time computing; Mathematics","score_opus":0.07844059589662435,"score_gpt":0.35818244647099423,"score_spread":0.2797418505743699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166999867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8847348,0.00013963442,0.07482257,0.013614912,0.00024264239,0.0008712669,0.000029112423,0.00018345511,0.025361577],"genre_scores_gemma":[0.9955031,0.000006301661,0.0016290934,0.00040234244,0.00047529364,0.0000703893,0.000030332867,0.00002304263,0.0018600965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00006905572,0.00033204225,0.00024113091,0.00043031372,0.0003114736],"domain_scores_gemma":[0.9979133,0.00039423065,0.000055799064,0.0003461107,0.0012729114,0.000017642196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009638152,0.00010415118,0.00017440344,0.0005985419,0.00065210793,0.00027765107,0.00031619112,0.00004196559,0.002968128],"category_scores_gemma":[0.0014249341,0.00010131348,0.00006185538,0.0016276236,0.00008833048,0.0015754136,0.00013407352,0.00031111678,0.000986677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050468527,0.00033744393,0.0005822683,0.00011394501,0.00012508892,0.000007380489,0.00081687904,0.9032131,0.015198234,0.07274068,0.0033578246,0.0034567288],"study_design_scores_gemma":[0.0005258175,0.000012528639,0.00013642017,0.00004424702,0.000035191668,0.0000010638443,0.0016250955,0.9860061,0.00043563847,0.00035493908,0.010691224,0.00013173251],"about_ca_topic_score_codex":0.0005798344,"about_ca_topic_score_gemma":0.0006319783,"teacher_disagreement_score":0.11076828,"about_ca_system_score_codex":0.00004858419,"about_ca_system_score_gemma":0.000019745916,"threshold_uncertainty_score":0.99979115},"labels":[],"label_agreement":null},{"id":"W2308641315","doi":"10.1051/ro/2015024","title":"Linear time algorithms to solve the linear ordering problem for oriented tree based graphs","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Time complexity; Computer science; Tree (set theory); Mathematics; Combinatorics","score_opus":0.10945740197492171,"score_gpt":0.4049995213879207,"score_spread":0.295542119412999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308641315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043718754,0.000062430154,0.9797603,0.011529036,0.000117303534,0.0028726393,0.000035490295,0.00020358084,0.0010473354],"genre_scores_gemma":[0.023361905,0.00000769843,0.96649724,0.0004081258,0.0002879348,0.0024044334,0.000064803084,0.00007447229,0.006893386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580216,0.0004780539,0.00038081128,0.0007836787,0.0014812674,0.0010739978],"domain_scores_gemma":[0.99458003,0.0008711854,0.000022430408,0.0014435174,0.00254618,0.00053667615],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0053577903,0.00021885335,0.00023165235,0.00074132293,0.0013302896,0.0004262523,0.002184507,0.00009842341,0.00003378297],"category_scores_gemma":[0.0018300946,0.0001608767,0.00011531909,0.0037786586,0.000290928,0.00065473444,0.0007715036,0.0006201653,0.0005276243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005049071,0.0010767276,0.00011240153,0.00008751159,0.0001585212,0.000038237347,0.0078738015,0.3940598,0.025499262,0.46481368,0.024340186,0.08143496],"study_design_scores_gemma":[0.0010119384,0.00074049755,0.000021532256,0.000027530185,0.0000030399276,0.000004034307,0.0001950437,0.9463333,0.007949246,0.006662325,0.036822427,0.00022911545],"about_ca_topic_score_codex":0.00009129807,"about_ca_topic_score_gemma":0.00020332077,"teacher_disagreement_score":0.55227345,"about_ca_system_score_codex":0.00017874292,"about_ca_system_score_gemma":0.0009661351,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W2493227902","doi":"10.1051/ro/2015054","title":"Strategic investments in R&amp;D and efficiency in the presence of free riders","year":2015,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Spillover effect; Business; Welfare; Industrial organization; Process (computing); Marketing; Microeconomics; Economics; Market economy; Computer science","score_opus":0.5530373471008291,"score_gpt":0.4081188183778541,"score_spread":0.144918528722975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493227902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97558624,0.00072251336,0.000023557735,0.0025389674,0.000041137962,0.00032349277,0.000085921405,0.000002939757,0.020675229],"genre_scores_gemma":[0.99894917,0.00035749486,0.00021493985,0.00009603924,0.000026087528,0.0000724163,0.000013420706,0.0000065984805,0.00026383024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897176,0.0000864306,0.00038460392,0.00022019785,0.00006146864,0.00027553708],"domain_scores_gemma":[0.9993426,0.0001605833,0.000028815835,0.00037015654,0.00003722575,0.000060582002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027186247,0.00006516955,0.00016124643,0.00045580594,0.000079950725,0.00010325787,0.00036672724,0.000055962377,0.000053082164],"category_scores_gemma":[0.0007316401,0.000060852046,0.000017024657,0.0005237764,0.00018449068,0.00021588197,0.0001236599,0.00021701705,0.00008820428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027922162,0.00040827895,0.08618965,0.000051651623,0.000009647137,0.0000035981961,0.02652721,0.008542879,0.00006734173,0.87655276,0.0015087319,0.00011032751],"study_design_scores_gemma":[0.005996822,0.0005211866,0.14154123,0.00011511032,0.0000036239671,0.000016751963,0.034517765,0.16933368,0.00025911542,0.63937724,0.0076118456,0.000705608],"about_ca_topic_score_codex":0.007016641,"about_ca_topic_score_gemma":0.013143628,"teacher_disagreement_score":0.23717551,"about_ca_system_score_codex":0.00009525946,"about_ca_system_score_gemma":0.00006839288,"threshold_uncertainty_score":0.9995957},"labels":[],"label_agreement":null},{"id":"W2566538835","doi":"10.1051/ro/2016076","title":"Chance-constrained data envelopment analysis modeling with random-rough data","year":2016,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Robustness (evolution); Quadratic equation; Mathematical optimization; Computer science; Mathematics; Stability (learning theory); Machine learning","score_opus":0.5605074718402389,"score_gpt":0.5311501072448088,"score_spread":0.029357364595430036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566538835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06775224,0.00017489739,0.9183475,0.010335514,0.00008161496,0.0005173908,0.0005493775,0.00005764363,0.002183859],"genre_scores_gemma":[0.9754357,0.00013625323,0.018185565,0.00008186646,0.00016260121,0.000046665766,0.00046105936,0.000019502508,0.0054708314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896774,0.0013249819,0.0010460768,0.002115369,0.005069257,0.00076688966],"domain_scores_gemma":[0.9854482,0.002718866,0.00007786871,0.008699033,0.0027920522,0.0002639735],"candidate_categories":["metaresearch","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.024916511,0.00022440898,0.0005856731,0.0020129613,0.0014102157,0.0012051319,0.007047384,0.000095483374,0.001439581],"category_scores_gemma":[0.018155131,0.00011814703,0.00009278792,0.008780422,0.0006109081,0.0021540506,0.0025000442,0.000321687,0.0008124868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005177089,0.00082303444,0.0036132995,0.0000088881525,0.002395418,0.000059197275,0.001941215,0.8020172,0.0053197597,0.0056563714,0.021085856,0.15656203],"study_design_scores_gemma":[0.0011115267,0.000040578318,0.00019374563,0.000028936141,0.00014271772,0.000002946638,0.0005099845,0.99052227,0.00020504608,0.0002691502,0.0067535667,0.00021951657],"about_ca_topic_score_codex":0.00054452405,"about_ca_topic_score_gemma":0.0065585026,"teacher_disagreement_score":0.90768343,"about_ca_system_score_codex":0.00012933843,"about_ca_system_score_gemma":0.0011464426,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W2593872908","doi":"10.1051/ro/2017011","title":"Lower and upper bounds for the linear arrangement problem on interval graphs","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Interval graph; Intersection graph; Mathematics; Interval (graph theory); Combinatorics; Indifference graph; Graph; Intersection (aeronautics); Upper and lower bounds; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Mathematical analysis","score_opus":0.09050988374062498,"score_gpt":0.39536974454451657,"score_spread":0.3048598608038916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593872908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02118418,0.00006550426,0.906833,0.063475534,0.00053433777,0.0017717498,0.000016381076,0.000071664865,0.0060476544],"genre_scores_gemma":[0.95993596,0.000106485,0.03491904,0.0002861926,0.00010361059,0.00034169274,0.000005906327,0.000009798707,0.004291285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00007490602,0.00013153793,0.00026813283,0.0003130613,0.00021626438],"domain_scores_gemma":[0.9988081,0.00016688599,0.000017638247,0.00065383577,0.00029067683,0.000062886],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009219897,0.00007447045,0.00006816836,0.00012742296,0.0025961436,0.0013866664,0.00055206986,0.000037567283,0.000068707115],"category_scores_gemma":[0.00021078852,0.000051169638,0.000042740623,0.00010971331,0.00022287366,0.00045254754,0.00020880329,0.00018620372,0.000031709773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063665786,0.00021428088,0.0014275351,0.000028368931,0.0000803636,0.0000028135787,0.0023630757,0.008645203,0.00076546037,0.6700945,0.011616695,0.30469805],"study_design_scores_gemma":[0.0009314272,0.00044054855,0.016337184,0.00004561476,0.0000061615747,0.0000058116566,0.00016903866,0.92477906,0.0006031711,0.0022770348,0.054225408,0.00017955502],"about_ca_topic_score_codex":0.00007777078,"about_ca_topic_score_gemma":0.00041704762,"teacher_disagreement_score":0.9387518,"about_ca_system_score_codex":0.000035928893,"about_ca_system_score_gemma":0.00009668723,"threshold_uncertainty_score":0.99965},"labels":[],"label_agreement":null},{"id":"W2609748945","doi":"10.1051/ro/2017030","title":"Impact of vehicle tracking on a routing problem with dynamic travel times","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Schedule; Computer science; Vehicle routing problem; Routing (electronic design automation); Adaptive routing; Dynamic positioning; Operations research; Real-time computing; Transport engineering; Static routing; Engineering; Computer network; Routing protocol; Marine engineering","score_opus":0.06383388641025729,"score_gpt":0.41219941415317757,"score_spread":0.3483655277429203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609748945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93338436,0.0000261543,0.053221244,0.00021341901,0.000029815763,0.0005453875,0.000024053763,0.00012386708,0.012431703],"genre_scores_gemma":[0.9646874,0.000014939954,0.03444955,0.0000022914412,0.00003563009,0.000043267788,0.000010856514,0.000059041573,0.00069700443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842864,0.00018011716,0.00026805923,0.00023516559,0.00045968793,0.00042831394],"domain_scores_gemma":[0.99867177,0.00017668451,0.000031164866,0.00067351415,0.00034847946,0.00009837029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012908517,0.0001494339,0.00021061163,0.00025247948,0.00086770824,0.00036646123,0.00040383937,0.00008664918,0.00010406243],"category_scores_gemma":[0.0004177833,0.00012319167,0.00006549838,0.00028467522,0.0001656092,0.0003792529,0.000057161426,0.0004732735,0.000028885263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021793296,0.00006155807,0.0030089924,0.00003330176,0.00006286658,0.0000032525695,0.00084503,0.9581773,0.027157927,0.0007077107,0.000046700883,0.009873563],"study_design_scores_gemma":[0.00050999125,0.00023773707,0.073227875,0.00013270843,0.0000062459444,0.00000449194,0.00011178278,0.91880417,0.006789393,0.000028324426,0.0000050377103,0.00014226785],"about_ca_topic_score_codex":0.0002494701,"about_ca_topic_score_gemma":0.00013815152,"teacher_disagreement_score":0.07021888,"about_ca_system_score_codex":0.00022308966,"about_ca_system_score_gemma":0.00016114989,"threshold_uncertainty_score":0.6673798},"labels":[],"label_agreement":null},{"id":"W2625464829","doi":"10.1051/ro/2017048","title":"Optimal power consumption control of sensor node based on (<i>N, D</i>)-policy discrete-time queues","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Node (physics); Queue; Queueing theory; Computer science; Power control; Network packet; Transmission (telecommunications); Computer network; Sensor node; Wireless sensor network; Power (physics); Real-time computing; Mathematical optimization; Wireless; Key distribution in wireless sensor networks; Telecommunications; Mathematics; Wireless network; Engineering","score_opus":0.03608862459387527,"score_gpt":0.36018738857278404,"score_spread":0.3240987639789088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625464829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33702886,0.00006966423,0.6310188,0.020059818,0.00028642768,0.0010461222,0.000090118316,0.00022966047,0.010170501],"genre_scores_gemma":[0.9789564,0.000017994438,0.018853638,0.00023217776,0.00013758322,0.000064675405,0.000015195915,0.000025769594,0.0016965759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966231,0.00063936453,0.000376523,0.0005977625,0.0011118922,0.00065136305],"domain_scores_gemma":[0.99624264,0.00057784736,0.00008344935,0.0022082103,0.0006851908,0.00020264734],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013417307,0.00020303254,0.0003000296,0.00052623864,0.0014948596,0.000859628,0.0017250489,0.00015126527,0.00011573875],"category_scores_gemma":[0.0010135925,0.00018043348,0.0001132651,0.00033194464,0.0006267103,0.0005398472,0.00030451757,0.00046402722,0.0003503847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005989302,0.0002125653,0.00044059654,0.0000104623705,0.000021385353,0.000012345952,0.00018050364,0.95540625,0.012604643,0.02976865,0.0006284268,0.0006542801],"study_design_scores_gemma":[0.0010524326,0.00024083363,0.0027819835,0.00007551776,0.0000037965217,0.0000028072084,0.000011997072,0.9861133,0.008787184,0.000014960622,0.0007291738,0.00018597531],"about_ca_topic_score_codex":0.00039426103,"about_ca_topic_score_gemma":0.00006246508,"teacher_disagreement_score":0.64192754,"about_ca_system_score_codex":0.00014819403,"about_ca_system_score_gemma":0.00040176528,"threshold_uncertainty_score":0.99980503},"labels":[],"label_agreement":null},{"id":"W2767893134","doi":"10.1051/ro/2017086","title":"The cycle shop scheduling: mathematical model, properties and solution algorithms","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Job shop scheduling; Heuristics; Mathematical optimization; Algorithm; Flow shop scheduling; Metaheuristic; Scheduling (production processes); Integer programming; Rate-monotonic scheduling; Schedule; Dynamic priority scheduling; Mathematics","score_opus":0.13268067904025993,"score_gpt":0.3536112008502528,"score_spread":0.2209305218099929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767893134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21716383,0.0015077852,0.7612325,0.007765779,0.0002875686,0.0009224794,0.000014150383,0.0004383645,0.010667538],"genre_scores_gemma":[0.89600015,0.0005350606,0.09934685,0.000011081852,0.00016535666,0.00017194271,0.000005993769,0.00003837904,0.0037251827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987899,0.000061013936,0.0002024842,0.0001878699,0.00039370384,0.0003650464],"domain_scores_gemma":[0.99898154,0.00007531423,0.000009287544,0.00056202797,0.00025643056,0.00011542508],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010020051,0.000111436566,0.00010896638,0.00008110211,0.0034907262,0.0013141226,0.00035880797,0.00009017373,0.000019851304],"category_scores_gemma":[0.00066843,0.000078393445,0.000028024655,0.000090826186,0.00038512476,0.0003673357,0.00014085976,0.00037886537,0.00009005453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004731798,0.000024903582,0.0000118091475,0.00002438196,0.000022070062,9.271847e-7,0.00059475173,0.9800894,0.0011799504,0.00832813,0.00017533924,0.009543561],"study_design_scores_gemma":[0.00018955165,0.000015515749,0.000037214297,0.000029933988,0.000004215128,0.000005032211,0.00026755437,0.99690527,0.0015326625,0.0007780986,0.00012838111,0.000106596504],"about_ca_topic_score_codex":0.0000211076,"about_ca_topic_score_gemma":0.0000471557,"teacher_disagreement_score":0.67883635,"about_ca_system_score_codex":0.000056644843,"about_ca_system_score_gemma":0.000073537725,"threshold_uncertainty_score":0.9997226},"labels":[],"label_agreement":null},{"id":"W2880529068","doi":"10.1051/ro/2018060","title":"Gangless cross-evaluation in DEA: an application to stock selection","year":2018,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Data envelopment analysis; Stock (firearms); Computer science; Envelopment; Selection (genetic algorithm); Operations research; Econometrics; Economics; Mathematical optimization; Mathematics; Engineering; Artificial intelligence","score_opus":0.3279619726614527,"score_gpt":0.5950344385732645,"score_spread":0.26707246591181183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2880529068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88298655,0.000014109621,0.11202175,0.001444641,0.00008852409,0.0009970458,0.000005418551,0.00003691011,0.0024050635],"genre_scores_gemma":[0.9945824,0.0000011388416,0.0027460002,0.00012406857,0.00030138894,0.00040142998,0.000026838037,0.000015629086,0.0018011173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920338,0.0018646268,0.0007054581,0.0009654503,0.0039442335,0.0004864282],"domain_scores_gemma":[0.99217534,0.00051599875,0.000042231553,0.0010022955,0.0060725105,0.00019164162],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.024982056,0.000121403114,0.00019031588,0.0020497215,0.0013281719,0.0013530331,0.0007969884,0.00012638372,0.00076258305],"category_scores_gemma":[0.008609772,0.000105740764,0.000047522793,0.008994264,0.0002825756,0.0009816801,0.00015108,0.00032051894,0.0027083613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012200595,0.00090629555,0.044852145,0.0000040658783,0.000014983135,0.0000017358276,0.0069188434,0.57502645,0.107392944,0.008565838,0.0038898264,0.25230485],"study_design_scores_gemma":[0.00028056328,0.0002591704,0.09722078,0.0000076806,0.0000044684293,0.0000024751532,0.00044515557,0.88822186,0.008039943,0.0020243193,0.0033526747,0.00014091507],"about_ca_topic_score_codex":0.0015310282,"about_ca_topic_score_gemma":0.03948073,"teacher_disagreement_score":0.3131954,"about_ca_system_score_codex":0.0005133397,"about_ca_system_score_gemma":0.00059761555,"threshold_uncertainty_score":0.999972},"labels":[],"label_agreement":null},{"id":"W2908334818","doi":"10.1051/ro/2019007","title":"Z-equilibria in Bi-matrix games with uncertain payoffs","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Statistics Canada","funders":"","keywords":"Mathematical economics; Nash equilibrium; Pareto principle; Game theory; Mathematical optimization; Normal-form game; Ranking (information retrieval); Computation; Pareto optimal; Fictitious play; Mathematics; Matrix (chemical analysis); Best response; Solution concept; Equilibrium selection; Computer science; Repeated game; Multi-objective optimization; Algorithm; Artificial intelligence","score_opus":0.07441945382412024,"score_gpt":0.3335333790494214,"score_spread":0.25911392522530113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908334818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9531866,0.0006227252,0.0006022243,0.0020070788,0.00012908544,0.00060802035,0.000089266156,0.000024770257,0.042730268],"genre_scores_gemma":[0.96424764,0.00014994176,0.0009713755,0.00006206184,0.000077799734,0.000107671614,0.000033775887,0.000031297997,0.03431842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839944,0.000057736706,0.00046520997,0.00050398614,0.00006548852,0.0005081619],"domain_scores_gemma":[0.9990929,0.00012644238,0.000035051948,0.00058148743,0.0000702907,0.000093824514],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014990434,0.0001274657,0.00032407095,0.0005251983,0.00014341073,0.00023221043,0.0003343856,0.00009607294,0.0021430564],"category_scores_gemma":[0.00010670287,0.00012392642,0.00005041716,0.00052174355,0.00011302582,0.00044950386,0.00011325754,0.00033576787,0.0030025884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052585445,0.00008918749,0.03604783,0.000024917379,0.000025325337,0.0000040199,0.0009633683,0.023641497,0.0002217675,0.93782043,0.0007813802,0.00032769534],"study_design_scores_gemma":[0.0075241523,0.0013401045,0.04158171,0.00019633562,0.0000063888106,0.000020838916,0.0043890816,0.5443562,0.000826336,0.11685525,0.28113893,0.0017646676],"about_ca_topic_score_codex":0.0019480331,"about_ca_topic_score_gemma":0.001376447,"teacher_disagreement_score":0.8209652,"about_ca_system_score_codex":0.00022097664,"about_ca_system_score_gemma":0.00013755713,"threshold_uncertainty_score":0.9987691},"labels":[],"label_agreement":null},{"id":"W2942309913","doi":"10.1051/ro/2019043","title":"A Non-Linear-Threshold-Accepting Function Based Algorithm for the Solution of Economic Dispatch Problem","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematical optimization; Economic dispatch; Computer science; Harmony search; Benchmark (surveying); Heuristics; Heuristic; Electric power system; Algorithm; Power (physics); Mathematics","score_opus":0.029269800762894614,"score_gpt":0.30914104292080496,"score_spread":0.27987124215791037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942309913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020453306,0.00017314915,0.9750417,0.00021728927,0.00034330614,0.0022894444,0.000026908592,0.000087203334,0.0013676898],"genre_scores_gemma":[0.9684206,0.000032812924,0.029317588,0.000008850231,0.00017782209,0.00073063973,0.00010724993,0.00005160275,0.0011528269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987699,0.000054454256,0.0003444859,0.00021782148,0.00026238515,0.0003509592],"domain_scores_gemma":[0.999083,0.00021998101,0.000022672764,0.00036239592,0.00026875775,0.000043183096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208946,0.00011413232,0.00015550929,0.000213652,0.00028142164,0.00008893626,0.00021322578,0.00009503516,0.00015414543],"category_scores_gemma":[0.000028243312,0.000096648044,0.00006631068,0.0003705758,0.000034095043,0.00027603097,0.000031772768,0.0002238778,0.0001501447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011539169,0.000023116067,0.0002288429,0.000084921194,0.000036463858,5.9310178e-8,0.00011764165,0.97417074,0.0064922017,0.0002187642,0.0012927746,0.017322954],"study_design_scores_gemma":[0.0005322413,0.00014013333,0.0002628528,0.00003574411,0.000010396419,8.214149e-7,0.00006870487,0.9937468,0.004323912,0.000014374048,0.0007634997,0.00010050818],"about_ca_topic_score_codex":0.00014890466,"about_ca_topic_score_gemma":0.00018217812,"teacher_disagreement_score":0.9479673,"about_ca_system_score_codex":0.00028904655,"about_ca_system_score_gemma":0.00017888202,"threshold_uncertainty_score":0.3941193},"labels":[],"label_agreement":null},{"id":"W2985494805","doi":"10.1051/ro/2019105","title":"Interactive multiobjective DEA target setting using lexicographic DDF","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lexicographical order; Computer science; Mathematical optimization; Process (computing); Efficient frontier; Function (biology); Multi-objective optimization; Algorithm; Mathematics","score_opus":0.1950906747035397,"score_gpt":0.5178714991477066,"score_spread":0.3227808244441669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985494805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584175,0.00010628982,0.030329293,0.0010369212,0.00031630642,0.0007525965,0.000028321843,0.000056827503,0.008955974],"genre_scores_gemma":[0.9823964,0.0000042515944,0.012654283,0.00011093731,0.0001284809,0.00003476705,0.000015280366,0.000027726543,0.0046278294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916421,0.0022594945,0.0008131048,0.001112076,0.003415942,0.00075724843],"domain_scores_gemma":[0.9918078,0.003522389,0.000097015974,0.0012054069,0.003183269,0.00018410126],"candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011395087,0.0002112627,0.00038624913,0.0026470523,0.0015070017,0.0014294733,0.0011977209,0.00014194567,0.0019131631],"category_scores_gemma":[0.010250474,0.00016953531,0.00024333133,0.006485276,0.00039311041,0.001339057,0.00048874057,0.0009994785,0.0029953148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011661487,0.00067809934,0.05934009,0.000013285902,0.00019901547,0.000025384956,0.011663519,0.7952879,0.114643015,0.005831823,0.0021798895,0.010021377],"study_design_scores_gemma":[0.00042471755,0.0001273632,0.008206682,0.00005201513,0.000012711338,0.000011756751,0.007742333,0.9708105,0.007523708,0.0023245672,0.0024800785,0.0002835752],"about_ca_topic_score_codex":0.000981804,"about_ca_topic_score_gemma":0.0006461065,"teacher_disagreement_score":0.17552261,"about_ca_system_score_codex":0.00032693718,"about_ca_system_score_gemma":0.00061833335,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W2987548641","doi":"10.1051/ro/2019061","title":"A new model for logistics and transportation of fashion goods in the presence of stochastic market demands considering restricted retailers capacity","year":2019,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Simulated annealing; Computer science; Taguchi methods; Profit (economics); Sorting; Mathematical optimization; Metaheuristic; Genetic algorithm; Operations research; Scheduling (production processes); Supply chain; Economics; Business; Algorithm; Microeconomics; Machine learning; Marketing; Mathematics","score_opus":0.07942860718814532,"score_gpt":0.3119648954049459,"score_spread":0.23253628821680056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987548641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70593435,0.00002457796,0.28995198,0.0010437815,0.000030921765,0.002119217,0.000013752914,0.000012565928,0.00086887786],"genre_scores_gemma":[0.9965886,0.000006725412,0.0025250812,0.000036493162,0.000038126094,0.0001049295,0.000033690238,0.000011989196,0.00065438316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871284,0.00005731871,0.00032629468,0.0002190855,0.0004333562,0.00025113593],"domain_scores_gemma":[0.9988136,0.00047021644,0.00005567028,0.00026786694,0.00038102834,0.0000115663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014454344,0.0000917245,0.00016299538,0.00046149243,0.00012918624,0.000109253255,0.00022912081,0.00005410966,0.000042309373],"category_scores_gemma":[0.0010311176,0.000077083445,0.00003017687,0.00078691315,0.00011048078,0.00044921003,0.0000505125,0.00016264639,0.0000012323749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001772717,0.000096056,0.007568082,0.0012093495,0.000028191105,0.0000019981007,0.0021733637,0.87492883,0.0011787879,0.109234564,0.0026119282,0.00079156464],"study_design_scores_gemma":[0.000754261,0.000032901597,0.01157282,0.00006209924,0.000020455509,1.6780992e-7,0.005416576,0.97950983,0.000021668337,0.0024404638,0.000087611974,0.00008114826],"about_ca_topic_score_codex":0.0012238222,"about_ca_topic_score_gemma":0.0022107288,"teacher_disagreement_score":0.29065424,"about_ca_system_score_codex":0.000039895225,"about_ca_system_score_gemma":0.00011762828,"threshold_uncertainty_score":0.31433716},"labels":[],"label_agreement":null},{"id":"W3010623153","doi":"10.1051/ro/2019116","title":"Scheduling job shop problems with operators with respect to the maximum lateness","year":2020,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Operator (biology); Scheduling (production processes); Mathematical optimization; Job shop scheduling; Computer science; Duration (music); Job shop; Mathematics; Flow shop scheduling; Schedule","score_opus":0.05790708007242472,"score_gpt":0.305543186624393,"score_spread":0.24763610655196827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010623153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53368974,0.000400753,0.4262007,0.0324862,0.00015623026,0.0022131088,0.000031241474,0.00082061416,0.004001434],"genre_scores_gemma":[0.90651006,0.000049412844,0.09167359,0.00040392188,0.00031945686,0.0003860083,0.00002497433,0.000102099715,0.00053045875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814814,0.00013380362,0.00021786125,0.00035816786,0.0006699156,0.0004720909],"domain_scores_gemma":[0.99867964,0.00007879055,0.0000059989407,0.00039856264,0.0004819462,0.0003550723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059119373,0.00018653789,0.0001710651,0.00017595457,0.00070011127,0.00058404484,0.00043293156,0.0000694516,0.00017289781],"category_scores_gemma":[0.0002148337,0.00011512425,0.000024681622,0.002068875,0.00009050127,0.00023431283,0.000078542056,0.0006231798,0.00027995816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031744046,0.000013889836,0.00022700783,0.000024354369,0.00004248008,0.00000873421,0.0022995323,0.99526066,0.0006338426,0.0004493544,0.00031946212,0.0006889633],"study_design_scores_gemma":[0.0005110216,0.00026753306,0.00015996837,0.00007335516,0.000009082803,0.000010840826,0.0016366851,0.9908664,0.002945154,0.0000044610933,0.0032634188,0.00025208527],"about_ca_topic_score_codex":0.00005511277,"about_ca_topic_score_gemma":0.00043035304,"teacher_disagreement_score":0.37282035,"about_ca_system_score_codex":0.00008165612,"about_ca_system_score_gemma":0.00023876748,"threshold_uncertainty_score":0.5631958},"labels":[],"label_agreement":null},{"id":"W3136294381","doi":"10.1051/ro/2021040","title":"Socially concerned periodic review replenishment system with customer service level and supply chain contracting","year":2021,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Supply chain; Profitability index; Business; Decentralization; Order (exchange); Microeconomics; Service (business); Industrial organization; Marketing; Economics; Finance","score_opus":0.10863049158170769,"score_gpt":0.3339774089625199,"score_spread":0.2253469173808122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136294381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33987436,0.029056836,0.002254075,0.2868212,0.0013288496,0.011237412,0.00012891028,0.0010699423,0.3282284],"genre_scores_gemma":[0.98270667,0.0009401663,0.00037691277,0.007564294,0.0007588166,0.0003851988,0.00022971006,0.00005335108,0.0069849053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975943,0.00015946473,0.00038477205,0.0005340129,0.00083855574,0.0004889222],"domain_scores_gemma":[0.99809426,0.00008071817,0.000063429354,0.00043448966,0.0012821128,0.00004496056],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019553332,0.00019722235,0.00032379627,0.00020525769,0.0012504165,0.0011069482,0.00025081847,0.000061801235,0.0011451143],"category_scores_gemma":[0.00026367302,0.00017196879,0.00005093451,0.0010455777,0.000119066135,0.0008639583,0.00036733752,0.00032800855,0.00048686672],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002960572,0.0010375555,0.010583223,0.03613486,0.0009527379,0.0009339603,0.0035496657,0.001661716,0.0059976536,0.6774508,0.22376448,0.03763732],"study_design_scores_gemma":[0.003750058,0.0000669957,0.005696369,0.006455271,0.00024682455,0.00007150729,0.030306177,0.035093654,0.0004073537,0.00006250324,0.91678244,0.0010608548],"about_ca_topic_score_codex":0.0018111413,"about_ca_topic_score_gemma":0.003487046,"teacher_disagreement_score":0.69301796,"about_ca_system_score_codex":0.00019868492,"about_ca_system_score_gemma":0.00029710785,"threshold_uncertainty_score":0.99993},"labels":[],"label_agreement":null},{"id":"W3144499601","doi":"10.1051/ro/2021054","title":"Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/<i>G<sub>n</sub><sup>(a,b)</sup>/</i>1","year":2021,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Computer science; Epoch (astronomy); Queueing theory; Bulk queue; Queue; Generating function; Markov process; Function (biology); Discrete time and continuous time; Real-time computing; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Discrete mathematics; Computer network; Statistics","score_opus":0.023418408882001123,"score_gpt":0.2928427222999386,"score_spread":0.26942431341793743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144499601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801834,0.000097592165,0.0063918657,0.009088388,0.00003924901,0.0008997145,0.00016251416,0.00027055125,0.002866727],"genre_scores_gemma":[0.99244696,0.000015547457,0.00076020753,0.001694923,0.0002689466,0.00018704886,0.0019809054,0.00013268922,0.0025127938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945307,0.0004900531,0.00093621184,0.0011988034,0.0018891804,0.00095507794],"domain_scores_gemma":[0.9919335,0.0007343352,0.00021480852,0.0013688668,0.0056354795,0.000112988375],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018893142,0.0005117979,0.0010287631,0.0012895768,0.0011766225,0.0008010488,0.0009746738,0.00022158808,0.0030441384],"category_scores_gemma":[0.000705766,0.0004673419,0.00027074447,0.014890029,0.00024137451,0.001962578,0.0006889467,0.00086971757,0.0019614208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002810635,0.00040471114,0.0005823339,0.00032111237,0.002509653,0.00005548728,0.0007767312,0.93178684,0.06046354,0.002353811,0.0003212841,0.00014344195],"study_design_scores_gemma":[0.0013029198,0.00004100803,0.00064794644,0.00022767004,0.0019737561,0.000007796122,0.0033102809,0.9858214,0.004019969,0.0011831591,0.0007879275,0.0006761403],"about_ca_topic_score_codex":0.0013187835,"about_ca_topic_score_gemma":0.0070332503,"teacher_disagreement_score":0.05644357,"about_ca_system_score_codex":0.000214193,"about_ca_system_score_gemma":0.00048037918,"threshold_uncertainty_score":0.99977785},"labels":[],"label_agreement":null}]}