{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":22,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":22,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"7eb314db32b8","filters":{"venue":"RAIRO - Operations Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3279619726614527,"gpt":0.5950344385732645,"spread":0.2670724659118118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02498206,0.0001214031,0.0001903159,0.002049722,0.001328172,0.001353033,0.0007969884,0.0001263837,0.000762583],"category_scores_gemma":[0.008609772,0.0001057408,0.00004752279,0.008994264,0.0002825756,0.0009816801,0.00015108,0.0003205189,0.002708361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005133397,"about_ca_system_score_gemma":0.0005976156,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001531028,"about_ca_topic_score_gemma":0.03948073,"domain_scores_codex":[0.9920338,0.001864627,0.0007054581,0.0009654503,0.003944234,0.0004864282],"domain_scores_gemma":[0.9921753,0.0005159987,0.00004223155,0.001002296,0.00607251,0.0001916416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001220059,0.0009062956,0.04485215,0.000004065878,0.00001498313,0.000001735828,0.006918843,0.5750265,0.1073929,0.008565838,0.003889826,0.2523049],"study_design_scores_gemma":[0.0002805633,0.0002591704,0.09722078,0.0000076806,0.000004468429,0.000002475153,0.0004451556,0.8882219,0.008039943,0.002024319,0.003352675,0.0001409151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8829865,0.00001410962,0.1120218,0.001444641,0.00008852409,0.0009970458,0.000005418551,0.00003691011,0.002405063],"genre_scores_gemma":[0.9945824,0.000001138842,0.002746,0.0001240686,0.0003013889,0.00040143,0.00002683804,0.00001562909,0.001801117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3131954,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06383388641025729,"gpt":0.4121994141531776,"spread":0.3483655277429203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001290852,0.0001494339,0.0002106116,0.0002524795,0.0008677082,0.0003664612,0.0004038394,0.00008664918,0.0001040624],"category_scores_gemma":[0.0004177833,0.0001231917,0.00006549838,0.0002846752,0.0001656092,0.0003792529,0.00005716143,0.0004732735,0.00002888526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002230897,"about_ca_system_score_gemma":0.0001611499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002494701,"about_ca_topic_score_gemma":0.0001381515,"domain_scores_codex":[0.9984286,0.0001801172,0.0002680592,0.0002351656,0.0004596879,0.0004283139],"domain_scores_gemma":[0.9986718,0.0001766845,0.00003116487,0.0006735142,0.0003484795,0.00009837029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000217933,0.00006155807,0.003008992,0.00003330176,0.00006286658,0.00000325257,0.00084503,0.9581773,0.02715793,0.0007077107,0.00004670088,0.009873563],"study_design_scores_gemma":[0.0005099913,0.0002377371,0.07322787,0.0001327084,0.000006245944,0.00000449194,0.0001117828,0.9188042,0.006789393,0.00002832443,0.00000503771,0.0001422678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9333844,0.0000261543,0.05322124,0.000213419,0.00002981576,0.0005453875,0.00002405376,0.0001238671,0.0124317],"genre_scores_gemma":[0.9646874,0.00001493995,0.03444955,0.000002291441,0.00003563009,0.00004326779,0.00001085651,0.00005904157,0.0006970044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07021888,"threshold_uncertainty_score":0.6673798,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05863119614734241,"gpt":0.3485741806096815,"spread":0.2899429844623391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267659,0.0001107476,0.0001234898,0.0003200777,0.0003338237,0.000268371,0.0002118308,0.00007634677,0.00006110694],"category_scores_gemma":[0.00005985201,0.000113414,0.00003105728,0.0006284258,0.00003645228,0.0001118438,0.00006053813,0.0002611747,0.0005624915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000733031,"about_ca_system_score_gemma":0.00002966473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003070145,"about_ca_topic_score_gemma":0.00004375649,"domain_scores_codex":[0.9987258,0.0001735653,0.0001983964,0.0002232932,0.0003326363,0.0003463612],"domain_scores_gemma":[0.9992169,0.00008309499,0.000003874939,0.0003159602,0.0002056079,0.0001745793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002641434,0.00004209968,0.00001710972,0.00003118028,0.00001099549,2.287301e-7,0.0007323709,0.9833338,0.002065528,0.002382494,0.01044348,0.0009380944],"study_design_scores_gemma":[0.0002345646,0.00005675694,0.0001731568,0.00002098922,0.000002854599,0.000006359481,0.00004297353,0.9813603,0.0009369389,0.00004102845,0.01698471,0.000139372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1066452,0.00005624671,0.8251098,0.001289251,0.0002728746,0.001033495,0.00002696282,0.0005115758,0.06505461],"genre_scores_gemma":[0.9583023,0.0000137481,0.03981517,0.0001118879,0.0001428896,0.0001265876,0.0001287104,0.00003646429,0.001322205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8516572,"threshold_uncertainty_score":0.7229878,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07942860718814532,"gpt":0.3119648954049459,"spread":0.2325362882168006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445434,0.0000917245,0.0001629954,0.0004614924,0.0001291862,0.0001092533,0.0002291208,0.00005410966,0.00004230937],"category_scores_gemma":[0.001031118,0.00007708344,0.00003017687,0.0007869132,0.0001104808,0.00044921,0.0000505125,0.0001626464,0.000001232375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003989523,"about_ca_system_score_gemma":0.0001176283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001223822,"about_ca_topic_score_gemma":0.002210729,"domain_scores_codex":[0.9987128,0.00005731871,0.0003262947,0.0002190855,0.0004333562,0.0002511359],"domain_scores_gemma":[0.9988136,0.0004702164,0.00005567028,0.0002678669,0.0003810283,0.0000115663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001772717,0.000096056,0.007568082,0.001209349,0.00002819111,0.000001998101,0.002173364,0.8749288,0.001178788,0.1092346,0.002611928,0.0007915646],"study_design_scores_gemma":[0.000754261,0.0000329016,0.01157282,0.00006209924,0.00002045551,1.678099e-7,0.005416576,0.9795098,0.00002166834,0.002440464,0.00008761197,0.00008114826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7059343,0.00002457796,0.289952,0.001043782,0.00003092176,0.002119217,0.00001375291,0.00001256593,0.0008688779],"genre_scores_gemma":[0.9965886,0.000006725412,0.002525081,0.00003649316,0.00003812609,0.0001049295,0.00003369024,0.0000119892,0.0006543832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2906542,"threshold_uncertainty_score":0.3143372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.5605074718402389,"gpt":0.5311501072448088,"spread":0.02935736459543004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.02491651,0.000224409,0.0005856731,0.002012961,0.001410216,0.001205132,0.007047384,0.00009548337,0.001439581],"category_scores_gemma":[0.01815513,0.000118147,0.00009278792,0.008780422,0.0006109081,0.002154051,0.002500044,0.000321687,0.0008124868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001293384,"about_ca_system_score_gemma":0.001146443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005445241,"about_ca_topic_score_gemma":0.006558503,"domain_scores_codex":[0.9896774,0.001324982,0.001046077,0.002115369,0.005069257,0.0007668897],"domain_scores_gemma":[0.9854482,0.002718866,0.00007786871,0.008699033,0.002792052,0.0002639735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005177089,0.0008230344,0.003613299,0.000008888152,0.002395418,0.00005919727,0.001941215,0.8020172,0.00531976,0.005656371,0.02108586,0.156562],"study_design_scores_gemma":[0.001111527,0.00004057832,0.0001937456,0.00002893614,0.0001427177,0.000002946638,0.0005099845,0.9905223,0.0002050461,0.0002691502,0.006753567,0.0002195166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06775224,0.0001748974,0.9183475,0.01033551,0.00008161496,0.0005173908,0.0005493775,0.00005764363,0.002183859],"genre_scores_gemma":[0.9754357,0.0001362532,0.01818557,0.00008186646,0.0001626012,0.00004666577,0.0004610594,0.00001950251,0.005470831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9076834,"threshold_uncertainty_score":0.9999655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1950906747035397,"gpt":0.5178714991477066,"spread":0.3227808244441669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01139509,0.0002112627,0.0003862491,0.002647052,0.001507002,0.001429473,0.001197721,0.0001419457,0.001913163],"category_scores_gemma":[0.01025047,0.0001695353,0.0002433313,0.006485276,0.0003931104,0.001339057,0.0004887406,0.0009994785,0.002995315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003269372,"about_ca_system_score_gemma":0.0006183333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000981804,"about_ca_topic_score_gemma":0.0006461065,"domain_scores_codex":[0.9916421,0.002259495,0.0008131048,0.001112076,0.003415942,0.0007572484],"domain_scores_gemma":[0.9918078,0.003522389,0.00009701597,0.001205407,0.003183269,0.0001841013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001166149,0.0006780993,0.05934009,0.0000132859,0.0001990155,0.00002538496,0.01166352,0.7952879,0.114643,0.005831823,0.002179889,0.01002138],"study_design_scores_gemma":[0.0004247176,0.0001273632,0.008206682,0.00005201513,0.00001271134,0.00001175675,0.007742333,0.9708105,0.007523708,0.002324567,0.002480078,0.0002835752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9584175,0.0001062898,0.03032929,0.001036921,0.0003163064,0.0007525965,0.00002832184,0.0000568275,0.008955974],"genre_scores_gemma":[0.9823964,0.000004251594,0.01265428,0.0001109373,0.0001284809,0.00003476705,0.00001528037,0.00002772654,0.004627829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1755226,"threshold_uncertainty_score":0.9997929,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02341840888200112,"gpt":0.2928427222999386,"spread":0.2694243134179374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001889314,0.0005117979,0.001028763,0.001289577,0.001176622,0.0008010488,0.0009746738,0.0002215881,0.003044138],"category_scores_gemma":[0.000705766,0.0004673419,0.0002707445,0.01489003,0.0002413745,0.001962578,0.0006889467,0.0008697176,0.001961421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000214193,"about_ca_system_score_gemma":0.0004803792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001318783,"about_ca_topic_score_gemma":0.00703325,"domain_scores_codex":[0.9945307,0.0004900531,0.0009362118,0.001198803,0.00188918,0.0009550779],"domain_scores_gemma":[0.9919335,0.0007343352,0.0002148085,0.001368867,0.005635479,0.0001129884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002810635,0.0004047111,0.0005823339,0.0003211124,0.002509653,0.00005548728,0.0007767312,0.9317868,0.06046354,0.002353811,0.0003212841,0.000143442],"study_design_scores_gemma":[0.00130292,0.00004100803,0.0006479464,0.00022767,0.001973756,0.000007796122,0.003310281,0.9858214,0.004019969,0.001183159,0.0007879275,0.0006761403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9801834,0.00009759216,0.006391866,0.009088388,0.00003924901,0.0008997145,0.0001625142,0.0002705512,0.002866727],"genre_scores_gemma":[0.992447,0.00001554746,0.0007602075,0.001694923,0.0002689466,0.0001870489,0.001980905,0.0001326892,0.002512794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05644357,"threshold_uncertainty_score":0.9997779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.5530373471008291,"gpt":0.4081188183778541,"spread":0.144918528722975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002718625,0.00006516955,0.0001612464,0.0004558059,0.00007995073,0.0001032579,0.0003667272,0.00005596238,0.00005308216],"category_scores_gemma":[0.0007316401,0.00006085205,0.00001702466,0.0005237764,0.0001844907,0.000215882,0.0001236599,0.000217017,0.00008820428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009525946,"about_ca_system_score_gemma":0.00006839288,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007016641,"about_ca_topic_score_gemma":0.01314363,"domain_scores_codex":[0.9989718,0.0000864306,0.0003846039,0.0002201978,0.00006146864,0.0002755371],"domain_scores_gemma":[0.9993426,0.0001605833,0.00002881584,0.0003701565,0.00003722575,0.000060582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002792216,0.000408279,0.08618965,0.00005165162,0.000009647137,0.000003598196,0.02652721,0.008542879,0.00006734173,0.8765528,0.001508732,0.0001103275],"study_design_scores_gemma":[0.005996822,0.0005211866,0.1415412,0.0001151103,0.000003623967,0.00001675196,0.03451777,0.1693337,0.0002591154,0.6393772,0.007611846,0.000705608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9755862,0.0007225134,0.00002355774,0.002538967,0.00004113796,0.0003234928,0.00008592141,0.000002939757,0.02067523],"genre_scores_gemma":[0.9989492,0.0003574949,0.0002149398,0.00009603924,0.00002608753,0.0000724163,0.00001342071,0.00000659848,0.0002638302],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2371755,"threshold_uncertainty_score":0.9995957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1086304915817077,"gpt":0.3339774089625199,"spread":0.2253469173808122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001955333,0.0001972224,0.0003237963,0.0002052577,0.001250417,0.001106948,0.0002508185,0.00006180123,0.001145114],"category_scores_gemma":[0.000263673,0.0001719688,0.00005093451,0.001045578,0.0001190661,0.0008639583,0.0003673375,0.0003280086,0.0004868667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001986849,"about_ca_system_score_gemma":0.0002971079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001811141,"about_ca_topic_score_gemma":0.003487046,"domain_scores_codex":[0.9975943,0.0001594647,0.0003847721,0.0005340129,0.0008385557,0.0004889222],"domain_scores_gemma":[0.9980943,0.00008071817,0.00006342935,0.0004344897,0.001282113,0.00004496056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002960572,0.001037556,0.01058322,0.03613486,0.0009527379,0.0009339603,0.003549666,0.001661716,0.005997654,0.6774508,0.2237645,0.03763732],"study_design_scores_gemma":[0.003750058,0.0000669957,0.005696369,0.006455271,0.0002468246,0.00007150729,0.03030618,0.03509365,0.0004073537,0.00006250324,0.9167824,0.001060855],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3398744,0.02905684,0.002254075,0.2868212,0.00132885,0.01123741,0.0001289103,0.001069942,0.3282284],"genre_scores_gemma":[0.9827067,0.0009401663,0.0003769128,0.007564294,0.0007588166,0.0003851988,0.0002297101,0.00005335108,0.006984905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.693018,"threshold_uncertainty_score":0.99993,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Humanities; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.04820096447093045,"gpt":0.346908263251655,"spread":0.2987072987807246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004644881,0.0004181411,0.0004396815,0.001315174,0.002030867,0.002443642,0.001348462,0.0004985532,0.001092542],"category_scores_gemma":[0.001060404,0.0004235473,0.0002149343,0.008781879,0.0003759582,0.002349964,0.000664993,0.001198765,0.001959377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007852337,"about_ca_system_score_gemma":0.002370015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002072745,"about_ca_topic_score_gemma":0.0006941473,"domain_scores_codex":[0.9928258,0.002341907,0.00100391,0.001070285,0.001817674,0.0009404119],"domain_scores_gemma":[0.9948515,0.001217703,0.0001426569,0.0009291278,0.002450293,0.0004087256],"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.00002207592,0.0006546869,0.00001049066,0.0001151071,0.00007034557,0.00001329938,0.003403456,0.4693359,0.0002713926,0.5120638,0.00564472,0.008394748],"study_design_scores_gemma":[0.0008968474,0.0001052856,0.0003061478,0.0000742336,0.00005738206,0.00010566,0.0003233469,0.9065656,0.0004696003,0.001349809,0.08932034,0.0004257683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007458543,0.001618302,0.8337815,0.1346084,0.0001716707,0.001395213,0.00005502611,0.0001891999,0.02743478],"genre_scores_gemma":[0.3609073,0.001433098,0.4702552,0.0004794819,0.001073827,0.0008114977,0.000272233,0.0001048046,0.1646626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.510714,"threshold_uncertainty_score":0.9998217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07441945382412024,"gpt":0.3335333790494214,"spread":0.2591139252253011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001499043,0.0001274657,0.0003240709,0.0005251983,0.0001434107,0.0002322104,0.0003343856,0.00009607294,0.002143056],"category_scores_gemma":[0.0001067029,0.0001239264,0.00005041716,0.0005217436,0.0001130258,0.0004495039,0.0001132575,0.0003357679,0.003002588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002209766,"about_ca_system_score_gemma":0.0001375571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001948033,"about_ca_topic_score_gemma":0.001376447,"domain_scores_codex":[0.9983994,0.00005773671,0.00046521,0.0005039861,0.00006548852,0.0005081619],"domain_scores_gemma":[0.9990929,0.0001264424,0.00003505195,0.0005814874,0.0000702907,0.00009382451],"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.00005258544,0.00008918749,0.03604783,0.00002491738,0.00002532534,0.0000040199,0.0009633683,0.0236415,0.0002217675,0.9378204,0.0007813802,0.0003276953],"study_design_scores_gemma":[0.007524152,0.001340104,0.04158171,0.0001963356,0.000006388811,0.00002083892,0.004389082,0.5443562,0.000826336,0.1168552,0.2811389,0.001764668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531866,0.0006227252,0.0006022243,0.002007079,0.0001290854,0.0006080203,0.00008926616,0.00002477026,0.04273027],"genre_scores_gemma":[0.9642476,0.0001499418,0.0009713755,0.00006206184,0.00007779973,0.0001076716,0.00003377589,0.000031298,0.03431842],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8209652,"threshold_uncertainty_score":0.9987691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02926980076289461,"gpt":0.309141042920805,"spread":0.2798712421579104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208946,0.0001141323,0.0001555093,0.000213652,0.0002814216,0.00008893626,0.0002132258,0.00009503516,0.0001541454],"category_scores_gemma":[0.00002824331,0.00009664804,0.00006631068,0.0003705758,0.00003409504,0.000276031,0.00003177277,0.0002238778,0.0001501447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002890466,"about_ca_system_score_gemma":0.000178882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001489047,"about_ca_topic_score_gemma":0.0001821781,"domain_scores_codex":[0.9987699,0.00005445426,0.0003444859,0.0002178215,0.0002623851,0.0003509592],"domain_scores_gemma":[0.999083,0.000219981,0.00002267276,0.0003623959,0.0002687578,0.0000431831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001153917,0.00002311607,0.0002288429,0.00008492119,0.00003646386,5.931018e-8,0.0001176416,0.9741707,0.006492202,0.0002187642,0.001292775,0.01732295],"study_design_scores_gemma":[0.0005322413,0.0001401333,0.0002628528,0.00003574411,0.00001039642,8.214149e-7,0.00006870487,0.9937468,0.004323912,0.00001437405,0.0007634997,0.0001005082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02045331,0.0001731492,0.9750417,0.0002172893,0.0003433061,0.002289444,0.00002690859,0.00008720333,0.00136769],"genre_scores_gemma":[0.9684206,0.00003281292,0.02931759,0.000008850231,0.0001778221,0.0007306397,0.0001072499,0.00005160275,0.001152827],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9479673,"threshold_uncertainty_score":0.3941193,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1094574019749217,"gpt":0.4049995213879207,"spread":0.295542119412999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00535779,0.0002188534,0.0002316523,0.0007413229,0.00133029,0.0004262523,0.002184507,0.00009842341,0.00003378297],"category_scores_gemma":[0.001830095,0.0001608767,0.0001153191,0.003778659,0.000290928,0.0006547344,0.0007715036,0.0006201653,0.0005276243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001787429,"about_ca_system_score_gemma":0.0009661351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009129807,"about_ca_topic_score_gemma":0.0002033208,"domain_scores_codex":[0.9958022,0.0004780539,0.0003808113,0.0007836787,0.001481267,0.001073998],"domain_scores_gemma":[0.99458,0.0008711854,0.00002243041,0.001443517,0.00254618,0.0005366761],"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.0005049071,0.001076728,0.0001124015,0.00008751159,0.0001585212,0.00003823735,0.007873802,0.3940598,0.02549926,0.4648137,0.02434019,0.08143496],"study_design_scores_gemma":[0.001011938,0.0007404975,0.00002153226,0.00002753018,0.000003039928,0.000004034307,0.0001950437,0.9463333,0.007949246,0.006662325,0.03682243,0.0002291155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004371875,0.00006243015,0.9797603,0.01152904,0.0001173035,0.002872639,0.00003549029,0.0002035808,0.001047335],"genre_scores_gemma":[0.0233619,0.00000769843,0.9664972,0.0004081258,0.0002879348,0.002404433,0.00006480308,0.00007447229,0.006893386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5522735,"threshold_uncertainty_score":0.9999698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03608862459387527,"gpt":0.360187388572784,"spread":0.3240987639789088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001341731,0.0002030325,0.0003000296,0.0005262386,0.00149486,0.000859628,0.001725049,0.0001512653,0.0001157388],"category_scores_gemma":[0.001013592,0.0001804335,0.0001132651,0.0003319446,0.0006267103,0.0005398472,0.0003045176,0.0004640272,0.0003503847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000148194,"about_ca_system_score_gemma":0.0004017653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000394261,"about_ca_topic_score_gemma":0.00006246508,"domain_scores_codex":[0.9966231,0.0006393645,0.000376523,0.0005977625,0.001111892,0.0006513631],"domain_scores_gemma":[0.9962426,0.0005778474,0.00008344935,0.00220821,0.0006851908,0.0002026473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005989302,0.0002125653,0.0004405965,0.00001046237,0.00002138535,0.00001234595,0.0001805036,0.9554062,0.01260464,0.02976865,0.0006284268,0.0006542801],"study_design_scores_gemma":[0.001052433,0.0002408336,0.002781983,0.00007551776,0.000003796522,0.000002807208,0.00001199707,0.9861133,0.008787184,0.00001496062,0.0007291738,0.0001859753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3370289,0.00006966423,0.6310188,0.02005982,0.0002864277,0.001046122,0.00009011832,0.0002296605,0.0101705],"genre_scores_gemma":[0.9789564,0.00001799444,0.01885364,0.0002321778,0.0001375832,0.00006467541,0.00001519591,0.00002576959,0.001696576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6419275,"threshold_uncertainty_score":0.999805,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05790708007242472,"gpt":0.305543186624393,"spread":0.2476361065519683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911937,0.0001865379,0.0001710651,0.0001759546,0.0007001113,0.0005840448,0.0004329316,0.0000694516,0.0001728978],"category_scores_gemma":[0.0002148337,0.0001151242,0.00002468162,0.002068875,0.00009050127,0.0002343128,0.00007854206,0.0006231798,0.0002799582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008165612,"about_ca_system_score_gemma":0.0002387675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005511277,"about_ca_topic_score_gemma":0.000430353,"domain_scores_codex":[0.9981481,0.0001338036,0.0002178612,0.0003581679,0.0006699156,0.0004720909],"domain_scores_gemma":[0.9986796,0.00007879055,0.000005998941,0.0003985626,0.0004819462,0.0003550723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003174405,0.00001388984,0.0002270078,0.00002435437,0.00004248008,0.00000873421,0.002299532,0.9952607,0.0006338426,0.0004493544,0.0003194621,0.0006889633],"study_design_scores_gemma":[0.0005110216,0.0002675331,0.0001599684,0.00007335516,0.000009082803,0.00001084083,0.001636685,0.9908664,0.002945154,0.000004461093,0.003263419,0.0002520853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5336897,0.000400753,0.4262007,0.0324862,0.0001562303,0.002213109,0.00003124147,0.0008206142,0.004001434],"genre_scores_gemma":[0.9065101,0.00004941284,0.09167359,0.0004039219,0.0003194569,0.0003860083,0.00002497433,0.0001020997,0.0005304588],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3728203,"threshold_uncertainty_score":0.5631958,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1326806790402599,"gpt":0.3536112008502528,"spread":0.2209305218099929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001002005,0.0001114366,0.0001089664,0.00008110211,0.003490726,0.001314123,0.000358808,0.00009017373,0.0000198513],"category_scores_gemma":[0.00066843,0.00007839344,0.00002802465,0.00009082619,0.0003851248,0.0003673357,0.0001408598,0.0003788654,0.00009005453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005664484,"about_ca_system_score_gemma":0.00007353773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000211076,"about_ca_topic_score_gemma":0.0000471557,"domain_scores_codex":[0.9987899,0.00006101394,0.0002024842,0.0001878699,0.0003937038,0.0003650464],"domain_scores_gemma":[0.9989815,0.00007531423,0.000009287544,0.000562028,0.0002564306,0.0001154251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004731798,0.00002490358,0.00001180915,0.00002438196,0.00002207006,9.271847e-7,0.0005947517,0.9800894,0.00117995,0.00832813,0.0001753392,0.009543561],"study_design_scores_gemma":[0.0001895516,0.00001551575,0.0000372143,0.00002993399,0.000004215128,0.000005032211,0.0002675544,0.9969053,0.001532663,0.0007780986,0.0001283811,0.0001065965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2171638,0.001507785,0.7612325,0.007765779,0.0002875686,0.0009224794,0.00001415038,0.0004383645,0.01066754],"genre_scores_gemma":[0.8960001,0.0005350606,0.09934685,0.00001108185,0.0001653567,0.0001719427,0.000005993769,0.00003837904,0.003725183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6788363,"threshold_uncertainty_score":0.9997226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":0,"score":{"opus":0.148498466662761,"gpt":0.4375453487014911,"spread":0.2890468820387301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005530153,0.000232263,0.0002565657,0.0004258298,0.001232176,0.0008152724,0.0006349118,0.0003402085,0.0004126048],"category_scores_gemma":[0.00172442,0.0002349791,0.0001142691,0.001613455,0.0004309575,0.002244415,0.0003380796,0.00109239,0.0004647319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003732046,"about_ca_system_score_gemma":0.0009865764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433888,"about_ca_topic_score_gemma":0.000135235,"domain_scores_codex":[0.9896709,0.007273684,0.0005291164,0.0006739849,0.001214472,0.00063779],"domain_scores_gemma":[0.9967455,0.001497974,0.00005311865,0.0006554355,0.0008165718,0.0002314379],"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.00001276206,0.0008924981,0.0002502056,0.0000872534,0.00005107902,0.00005431679,0.02483733,0.02850754,0.006579294,0.3534143,0.004215202,0.5810982],"study_design_scores_gemma":[0.0004337724,0.0002161527,0.01849203,0.0000878688,0.00000757008,0.00009621203,0.000257261,0.9366053,0.003525695,0.002437577,0.03757289,0.0002676319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.054152,0.0006920786,0.9108064,0.02796738,0.0007472297,0.0007018453,0.00001989571,0.0001569538,0.00475617],"genre_scores_gemma":[0.4356148,0.001384164,0.5464363,0.0003017075,0.000514751,0.0002290301,0.00007339208,0.00003964599,0.01540621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9080978,"threshold_uncertainty_score":0.9582171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.152142217960136,"gpt":0.4325296338383448,"spread":0.2803874158782088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001640646,0.0001776386,0.0004556701,0.0006628278,0.001331022,0.00004694828,0.001058365,0.0001313565,0.0006131601],"category_scores_gemma":[0.003987008,0.0001112419,0.000324206,0.005689336,0.002569594,0.0001869233,0.0003077083,0.0006710169,0.000009160728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000190698,"about_ca_system_score_gemma":0.001168053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002654382,"about_ca_topic_score_gemma":0.0005919545,"domain_scores_codex":[0.9953079,0.001275536,0.0008002306,0.0003642226,0.001815308,0.0004367773],"domain_scores_gemma":[0.9949571,0.001094948,0.0001236917,0.001536931,0.002169537,0.0001177437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008603138,0.003298862,0.0416148,0.0003254739,0.005713976,0.000008819886,0.03490044,0.5912987,0.03339322,0.2763474,0.004102411,0.008909921],"study_design_scores_gemma":[0.001508616,0.0001517449,0.03624771,0.0001207174,0.0006067879,0.00004196434,0.006453636,0.8967158,0.05106998,0.005574963,0.0009814184,0.0005266835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4308905,0.0002449808,0.5501776,0.004502045,0.0003570636,0.005457442,0.001504717,0.0001348655,0.006730762],"genre_scores_gemma":[0.9266013,0.0000868591,0.06623083,0.00002212367,0.00004757982,0.0001454651,0.00002613053,0.00003787296,0.006801857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4957108,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1814456646088307,"gpt":0.3769839753734943,"spread":0.1955383107646635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506852,0.00008394427,0.0001348146,0.0001079829,0.0009182498,0.00004904538,0.0002633273,0.00007576185,0.0008916424],"category_scores_gemma":[0.0002077588,0.00005703472,0.0001059382,0.0007664976,0.0002488639,0.00009316426,0.00004403529,0.0003587561,0.00009039311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006193293,"about_ca_system_score_gemma":0.000217623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007198998,"about_ca_topic_score_gemma":0.0005748901,"domain_scores_codex":[0.9982151,0.0003334215,0.0003214954,0.0001745192,0.0006072163,0.000348199],"domain_scores_gemma":[0.9988824,0.0002581792,0.000008782031,0.0004541747,0.000345724,0.00005079874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000798239,0.0004664693,0.0003435551,0.0000523468,0.00002956862,8.537697e-7,0.0003047054,0.003399266,0.01573089,0.9213396,0.05811908,0.0002056214],"study_design_scores_gemma":[0.004528545,0.0008097606,0.01548752,0.0005161159,0.0003149074,0.00009649606,0.002531707,0.1108082,0.06820682,0.669861,0.1254157,0.001423278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2394033,0.0001910214,0.5974497,0.02080485,0.0004380637,0.002820645,0.0001570612,0.0001944207,0.1385409],"genre_scores_gemma":[0.9705877,0.000005507155,0.006168895,0.00001477732,0.0001159178,0.0001771226,0.00001385995,0.00001885289,0.02289737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7311844,"threshold_uncertainty_score":0.9762859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09050988374062498,"gpt":0.3953697445445166,"spread":0.3048598608038916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009219897,0.00007447045,0.00006816836,0.000127423,0.002596144,0.001386666,0.0005520699,0.00003756728,0.00006870712],"category_scores_gemma":[0.0002107885,0.00005116964,0.00004274062,0.0001097133,0.0002228737,0.0004525475,0.0002088033,0.0001862037,0.00003170977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003592889,"about_ca_system_score_gemma":0.00009668723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007777078,"about_ca_topic_score_gemma":0.0004170476,"domain_scores_codex":[0.9989961,0.00007490602,0.0001315379,0.0002681328,0.0003130613,0.0002162644],"domain_scores_gemma":[0.9988081,0.000166886,0.00001763825,0.0006538358,0.0002906768,0.000062886],"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.00006366579,0.0002142809,0.001427535,0.00002836893,0.0000803636,0.000002813579,0.002363076,0.008645203,0.0007654604,0.6700945,0.01161669,0.3046981],"study_design_scores_gemma":[0.0009314272,0.0004405486,0.01633718,0.00004561476,0.000006161575,0.000005811657,0.0001690387,0.9247791,0.0006031711,0.002277035,0.05422541,0.000179555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02118418,0.00006550426,0.906833,0.06347553,0.0005343378,0.00177175,0.00001638108,0.00007166486,0.006047654],"genre_scores_gemma":[0.959936,0.000106485,0.03491904,0.0002861926,0.0001036106,0.0003416927,0.000005906327,0.000009798707,0.004291285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9387518,"threshold_uncertainty_score":0.99965,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1536482196114749,"gpt":0.4861941099809319,"spread":0.332545890369457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428816,0.00008538553,0.0001311737,0.000518323,0.0005611198,0.00004343125,0.0002846454,0.00008503963,0.0002127081],"category_scores_gemma":[0.001006793,0.00007504214,0.00006129838,0.00124432,0.000183346,0.0000953016,0.00005228947,0.0002571073,0.0001171184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004616448,"about_ca_system_score_gemma":0.00009004313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007375297,"about_ca_topic_score_gemma":0.000997015,"domain_scores_codex":[0.9985018,0.0001784715,0.0003511888,0.0002003201,0.0004814214,0.0002868077],"domain_scores_gemma":[0.9975246,0.001383187,0.00002747372,0.0005544309,0.0004147272,0.00009559408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001932514,0.0003360484,0.00004666019,0.00002336763,0.00001107492,0.000001053534,0.000710519,0.0002000906,0.007404673,0.9858803,0.002842183,0.002524749],"study_design_scores_gemma":[0.001167917,0.0005206734,0.003562605,0.0001822699,0.00005058264,0.00001184169,0.002222724,0.004864561,0.1192438,0.8342084,0.03351362,0.0004510335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7579603,0.00006970295,0.09711335,0.002705276,0.00006935128,0.001502319,0.0001092828,0.0001563466,0.1403141],"genre_scores_gemma":[0.9831024,0.00003473913,0.01222264,0.00002902567,0.00007455264,0.00009754186,0.00002825313,0.00002089511,0.004389995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2251421,"threshold_uncertainty_score":0.4315736,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07844059589662435,"gpt":0.3581824464709942,"spread":0.2797418505743699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009638152,0.0001041512,0.0001744034,0.0005985419,0.0006521079,0.0002776511,0.0003161911,0.00004196559,0.002968128],"category_scores_gemma":[0.001424934,0.0001013135,0.00006185538,0.001627624,0.00008833048,0.001575414,0.0001340735,0.0003111168,0.000986677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004858419,"about_ca_system_score_gemma":0.00001974592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005798344,"about_ca_topic_score_gemma":0.0006319783,"domain_scores_codex":[0.998616,0.00006905572,0.0003320423,0.0002411309,0.0004303137,0.0003114736],"domain_scores_gemma":[0.9979133,0.0003942307,0.00005579906,0.0003461107,0.001272911,0.0000176422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005046853,0.0003374439,0.0005822683,0.000113945,0.0001250889,0.000007380489,0.000816879,0.9032131,0.01519823,0.07274068,0.003357825,0.003456729],"study_design_scores_gemma":[0.0005258175,0.00001252864,0.0001364202,0.00004424702,0.00003519167,0.000001063844,0.001625095,0.9860061,0.0004356385,0.0003549391,0.01069122,0.0001317325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8847348,0.0001396344,0.07482257,0.01361491,0.0002426424,0.0008712669,0.00002911242,0.0001834551,0.02536158],"genre_scores_gemma":[0.9955031,0.000006301661,0.001629093,0.0004023424,0.0004752936,0.0000703893,0.00003033287,0.00002304263,0.001860096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1107683,"threshold_uncertainty_score":0.9997911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}