{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08895199,0.00087504665,0.89552075,0.0014306536,0.000086568165,0.000084700674,0.00012483924,0.00024788282,0.0126775615],"genre_scores_gemma":[0.92825633,0.0011357727,0.04903021,0.00027988944,0.000075472955,0.00030353677,0.00033420871,0.00025496475,0.020329624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993832,0.0002541136,0.000022600827,0.00009303998,0.00013501976,0.00011204905],"domain_scores_gemma":[0.9919898,0.005488044,0.0007308626,0.00019528264,0.001153822,0.00044223873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031402553,0.0011640703,0.0010134735,0.0012342164,0.0006484468,0.0018611222,0.0014133811,0.0016949058,0.0053995093],"category_scores_gemma":[0.026603706,0.00042947143,0.0007148372,0.0006286753,0.002469372,0.0028085313,0.002115781,0.0024614283,0.0004983437],"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.0002780632,0.00008737574,0.0021005715,0.0003388849,0.00006389845,0.0003356412,0.00034813918,0.52162653,0.005358301,0.4539098,0.001961048,0.013591714],"study_design_scores_gemma":[0.000013076384,0.00004618325,0.00016970267,0.000028714174,0.000007763374,0.00003069534,0.000046575977,0.9725246,0.00049944484,0.026167197,0.00045528973,0.000010779559],"about_ca_topic_score_codex":0.0042608096,"about_ca_topic_score_gemma":0.0014883853,"teacher_disagreement_score":0.0053995093,"about_ca_system_score_codex":0.0018122713,"about_ca_system_score_gemma":0.002073494,"threshold_uncertainty_score":0.018063128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035468456,0.023941353,0.9407453,0.0024620388,0.0009076695,0.000026630305,0.000046912333,0.00038343418,0.027939832],"genre_scores_gemma":[0.21340346,0.03940357,0.7063138,0.0018333202,0.0025954132,0.00031827064,0.00017192459,0.001138911,0.03482137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946502,0.0024983939,0.00030404664,0.00056262023,0.0018045024,0.00018023585],"domain_scores_gemma":[0.995331,0.0033099288,0.00021410202,0.0005062155,0.00055098993,0.000087764194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050407606,0.001762232,0.0015227079,0.0018354581,0.0008823339,0.0035153213,0.0013924456,0.002070352,0.0039104824],"category_scores_gemma":[0.011001149,0.0007245451,0.001512453,0.0029701355,0.006619211,0.00413902,0.0021180937,0.006580377,0.0022217035],"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.00004687624,0.0000141709115,0.00021573006,0.00031657144,0.000035960322,0.0000946406,0.00029776624,0.019197935,0.001497754,0.8829388,0.0029825934,0.092361204],"study_design_scores_gemma":[0.00003451273,0.00007501083,0.00029961072,0.00022296752,0.00003346333,0.00036628114,0.000093201976,0.13130054,0.0039827814,0.7135149,0.1500082,0.00006850506],"about_ca_topic_score_codex":0.0038676765,"about_ca_topic_score_gemma":0.0021609077,"teacher_disagreement_score":0.0050407606,"about_ca_system_score_codex":0.0024003545,"about_ca_system_score_gemma":0.0013869123,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01731029,0.0003413209,0.97824794,0.0010231412,0.00006860819,0.00003677782,0.00016177597,0.0001182352,0.0026919267],"genre_scores_gemma":[0.33966646,0.0018233773,0.646001,0.00041993643,0.0002929392,0.00025353584,0.00068186346,0.00021955934,0.010641424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825865,0.0005326008,0.000078281904,0.00045470145,0.0005533278,0.00012235071],"domain_scores_gemma":[0.9937318,0.0047093057,0.0002530149,0.00051585026,0.0006366761,0.00015331371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020614404,0.0007101788,0.0011737797,0.00063248014,0.00070563855,0.0017893534,0.0010356205,0.0015257675,0.0072135744],"category_scores_gemma":[0.017524805,0.00044034029,0.00097320526,0.0010802215,0.0016266435,0.0034632164,0.0019214819,0.0028391774,0.0009111593],"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.00036380783,0.00010344906,0.0031489404,0.0010747265,0.00015223701,0.0004042163,0.0008063059,0.28631195,0.024061969,0.39097372,0.006517505,0.28608114],"study_design_scores_gemma":[0.000034610715,0.00018209741,0.0013813585,0.00011961423,0.000039648283,0.0004571923,0.00040105887,0.80227137,0.009629757,0.17100611,0.014427241,0.000049957445],"about_ca_topic_score_codex":0.004749485,"about_ca_topic_score_gemma":0.0041574477,"teacher_disagreement_score":0.0072135744,"about_ca_system_score_codex":0.00082945917,"about_ca_system_score_gemma":0.0013572708,"threshold_uncertainty_score":0.024131775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0189705,0.00023751598,0.97384393,0.00021697905,0.00003653628,0.00009890804,0.00029066534,0.00051567034,0.0057892734],"genre_scores_gemma":[0.18833236,0.00031676033,0.8053219,0.00012285124,0.00004937488,0.0002066042,0.001317522,0.00022473732,0.004107909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00008899924,0.00002257682,0.00009791616,0.00012967207,0.00009125084],"domain_scores_gemma":[0.99925977,0.0003601117,0.00006304343,0.00013893987,0.00011867485,0.00005952188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004951457,0.00068376784,0.000991873,0.0012899167,0.00064877997,0.0009839451,0.0010817343,0.0007940147,0.008726893],"category_scores_gemma":[0.0020058632,0.00038837644,0.00063969544,0.0017232479,0.00042848487,0.0021456347,0.0010468598,0.0012673851,0.0015180822],"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.0004023171,0.00025983993,0.0018773039,0.00045893854,0.00010833171,0.00014006656,0.00022112632,0.46298784,0.013874168,0.1752123,0.016787367,0.32767043],"study_design_scores_gemma":[0.000039545004,0.00006960535,0.00033384227,0.000018219218,0.00001995098,0.000077979494,0.000057264755,0.9246592,0.002912738,0.06633518,0.005466047,0.00001039003],"about_ca_topic_score_codex":0.0034842587,"about_ca_topic_score_gemma":0.006349809,"teacher_disagreement_score":0.008726893,"about_ca_system_score_codex":0.001151218,"about_ca_system_score_gemma":0.0012798663,"threshold_uncertainty_score":0.029194355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14706208,0.0034696048,0.7510854,0.0021323645,0.0005409875,0.000060782168,0.00052669476,0.00047670957,0.09464548],"genre_scores_gemma":[0.7763849,0.0046611526,0.19327633,0.00083344814,0.0012152898,0.0001978058,0.0008987027,0.00054387026,0.021988494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.00025085927,0.000039293493,0.00015588169,0.00023850365,0.00012421195],"domain_scores_gemma":[0.99822074,0.00085621205,0.00021825671,0.00020367776,0.00021268296,0.00028843316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801841,0.0005320842,0.0007327767,0.00071061176,0.001144644,0.0014809684,0.0005871385,0.0011145503,0.0071618394],"category_scores_gemma":[0.0034957926,0.00041545535,0.0006870332,0.001145845,0.0012134146,0.0026701016,0.001453658,0.0021956468,0.0014661631],"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.000025803773,0.000010435853,0.00019871451,0.000034195982,0.0000072007347,0.000103804414,0.000106335305,0.009632851,0.0022936196,0.974445,0.0027170847,0.010424918],"study_design_scores_gemma":[0.000009255194,0.000082116,0.0003190944,0.000023622202,0.000007708404,0.0001467457,0.0000662719,0.047810458,0.0009097062,0.9347683,0.015834495,0.000022181483],"about_ca_topic_score_codex":0.0011963106,"about_ca_topic_score_gemma":0.0016901394,"teacher_disagreement_score":0.0071618394,"about_ca_system_score_codex":0.0005841823,"about_ca_system_score_gemma":0.0004686876,"threshold_uncertainty_score":0.023958683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052221723,0.00039437172,0.937086,0.0008926888,0.00010212931,0.0000703535,0.000064617285,0.0002399683,0.008928293],"genre_scores_gemma":[0.57454276,0.0002726107,0.41881827,0.000133597,0.00006562603,0.00032855975,0.00010885013,0.00009207418,0.0056377403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956566,0.00018353046,0.000026914282,0.00006119388,0.000107923064,0.000054731772],"domain_scores_gemma":[0.9955035,0.0034186915,0.00032114403,0.00022911593,0.0004023012,0.00012531072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022285953,0.00076693314,0.00087557954,0.00081542856,0.00070124184,0.0012192328,0.0010570373,0.0023857506,0.0035062314],"category_scores_gemma":[0.013199343,0.00040448553,0.00049481215,0.00068229804,0.0020044977,0.0012412748,0.0017773551,0.001406633,0.000390862],"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.0001336871,0.00005582647,0.0006804317,0.000090450834,0.000022777178,0.00004943999,0.00012057368,0.8968553,0.0010891907,0.07790081,0.00069229346,0.022309253],"study_design_scores_gemma":[0.000025334934,0.000015756055,0.000050372757,0.000009794892,0.000002742513,0.000009298139,0.000016549931,0.9821708,0.00034790952,0.016924921,0.00042155944,0.0000049435953],"about_ca_topic_score_codex":0.0032639569,"about_ca_topic_score_gemma":0.0023259835,"teacher_disagreement_score":0.0035062314,"about_ca_system_score_codex":0.0011273893,"about_ca_system_score_gemma":0.00143198,"threshold_uncertainty_score":0.011786103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38860118,0.00047089453,0.5955207,0.0010165373,0.00014709421,0.00014255772,0.00015938263,0.0004480805,0.013493625],"genre_scores_gemma":[0.98829925,0.000105794476,0.009388101,0.000037894424,0.000028287983,0.000049016024,0.000029434883,0.000015989966,0.0020463127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985393,0.00041975206,0.000056392662,0.00030161842,0.00024392654,0.0004390414],"domain_scores_gemma":[0.9972019,0.0012293236,0.00051101635,0.00012922667,0.0004935699,0.00043493428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230729,0.0013538562,0.00128029,0.00072292733,0.0011952479,0.0025709,0.0024647205,0.0018322068,0.0038016778],"category_scores_gemma":[0.005216893,0.0009955391,0.0006083797,0.0006922243,0.0020264748,0.0014848772,0.0018979992,0.0015800776,0.00041456227],"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.00014982937,0.000055783286,0.00043396078,0.000023580653,0.000024622024,0.00009825103,0.00006524614,0.98052615,0.0015400681,0.012570347,0.00019868049,0.0043134815],"study_design_scores_gemma":[0.000023845849,0.000034006363,0.00008670522,0.0000021709357,0.0000072757634,0.0000045909596,0.000019613228,0.99563366,0.00016208188,0.003897977,0.00012242436,0.000005703633],"about_ca_topic_score_codex":0.018892083,"about_ca_topic_score_gemma":0.006884204,"teacher_disagreement_score":0.018892083,"about_ca_system_score_codex":0.003518821,"about_ca_system_score_gemma":0.0021418189,"threshold_uncertainty_score":0.037564218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015589015,0.00058176223,0.97294307,0.00048201246,0.00012323982,0.000218129,0.0003146475,0.0025058475,0.0072422535],"genre_scores_gemma":[0.09696099,0.000621002,0.8948133,0.0001929667,0.00011043567,0.00030159665,0.00127704,0.0003787649,0.005343938],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989838,0.00023945865,0.000055465913,0.00019825863,0.00027953106,0.00024345933],"domain_scores_gemma":[0.9973124,0.001795067,0.00023304638,0.00029373725,0.0002604935,0.00010529558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067944324,0.0015968425,0.0008672746,0.0009773392,0.0008476094,0.0016002518,0.0018605518,0.0010911641,0.013496041],"category_scores_gemma":[0.00437622,0.00050533394,0.0007167079,0.0023863714,0.0007007605,0.0029613108,0.0011536733,0.0021944728,0.0025888865],"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.0006140052,0.0007813131,0.0009572333,0.0010297976,0.00012766074,0.00012590192,0.00030206735,0.17974454,0.014203946,0.089614384,0.034542635,0.6779566],"study_design_scores_gemma":[0.00045514092,0.00031265584,0.0006172258,0.000054623208,0.00010370144,0.00022217205,0.0003110107,0.7825714,0.011122177,0.18694527,0.01723836,0.000046345605],"about_ca_topic_score_codex":0.0035101287,"about_ca_topic_score_gemma":0.007282532,"teacher_disagreement_score":0.013496041,"about_ca_system_score_codex":0.0012577052,"about_ca_system_score_gemma":0.0021318975,"threshold_uncertainty_score":0.04514873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9424816,0.0005861202,0.040214613,0.001942946,0.000020332596,0.00003413266,0.000116002164,0.000027778511,0.014576488],"genre_scores_gemma":[0.99739766,0.00019581038,0.0010988672,0.000036816426,0.000014151811,0.000013799736,0.000018352463,0.0000016620587,0.0012229031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986363,0.000513641,0.000059202564,0.00023752656,0.00007710344,0.0004762305],"domain_scores_gemma":[0.98752034,0.0068682414,0.0032243633,0.0006047587,0.00045586194,0.0013264877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025402228,0.0006748417,0.0013397902,0.0010128351,0.00083601027,0.0023011314,0.0010163268,0.0023975782,0.004640225],"category_scores_gemma":[0.009771895,0.0004354151,0.0009083785,0.0007972274,0.0027356655,0.0024971198,0.002044667,0.0012896844,0.00033219453],"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.001065312,0.000920407,0.048036743,0.00044473607,0.0005766344,0.0025981695,0.0008467162,0.46761394,0.008454636,0.44377196,0.0026334983,0.023037288],"study_design_scores_gemma":[0.0004744076,0.00063098804,0.016214434,0.000093593844,0.00036867248,0.00040332144,0.0015340039,0.58462065,0.002749924,0.39048356,0.0023257749,0.00010072939],"about_ca_topic_score_codex":0.0038495846,"about_ca_topic_score_gemma":0.0020124344,"teacher_disagreement_score":0.004640225,"about_ca_system_score_codex":0.0011153633,"about_ca_system_score_gemma":0.0008871826,"threshold_uncertainty_score":0.015523076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009346058,0.00021640553,0.98831856,0.00025599895,0.000018156672,0.0000468859,0.000121662306,0.000040454845,0.0016357907],"genre_scores_gemma":[0.8095518,0.0009844222,0.18350685,0.00014490637,0.0000586898,0.00052746566,0.00039503153,0.00004714967,0.0047837375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629885,0.0016941334,0.00022457677,0.0006668207,0.0008053954,0.00031022224],"domain_scores_gemma":[0.9956682,0.002807717,0.0006837089,0.00026661518,0.00046818427,0.00010559533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041021924,0.0014514682,0.0018068117,0.0013780488,0.0005187703,0.0027700118,0.0020395478,0.0014493942,0.0019555031],"category_scores_gemma":[0.009022386,0.0009139651,0.002423437,0.0022646582,0.0012953936,0.0024099054,0.0017143984,0.00182306,0.00023839393],"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.000015335194,0.000013380595,0.00028797303,0.00004428947,0.000037370915,0.000046788464,0.000031445048,0.94542897,0.0002192723,0.050641187,0.00016173045,0.0030722588],"study_design_scores_gemma":[0.0000033891129,0.000010519904,0.00010181963,0.0000071139566,0.000006707309,0.000007856422,0.0000068115305,0.9824582,0.00010142353,0.016988145,0.00029848638,0.000009604588],"about_ca_topic_score_codex":0.0072634104,"about_ca_topic_score_gemma":0.0037065626,"teacher_disagreement_score":0.0072634104,"about_ca_system_score_codex":0.0020786498,"about_ca_system_score_gemma":0.0017905863,"threshold_uncertainty_score":0.02169466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029629234,0.008839564,0.88535833,0.00535783,0.00053697923,0.00026581433,0.0019253462,0.0017787184,0.06630824],"genre_scores_gemma":[0.3272972,0.01007888,0.62934077,0.0019267275,0.0018321846,0.0011804117,0.0049450146,0.0021274104,0.021271365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913755,0.0021256134,0.00038782385,0.0012249261,0.0027597582,0.0021262784],"domain_scores_gemma":[0.95988095,0.03058739,0.0018679722,0.0036852444,0.002328009,0.0016503294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056662452,0.003243553,0.0024061357,0.003960003,0.002024496,0.0081731,0.0065175416,0.003025908,0.024126565],"category_scores_gemma":[0.036145627,0.0013952857,0.0027011903,0.006913781,0.00263156,0.015497731,0.0048358794,0.010819571,0.004627095],"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.00087071327,0.00069184694,0.0021187118,0.0019095694,0.00021952322,0.00028827685,0.0007334383,0.35019338,0.006126584,0.4342231,0.036601197,0.16602361],"study_design_scores_gemma":[0.00007056692,0.00024108178,0.0010260051,0.00042411342,0.00012752782,0.0004192721,0.00033902968,0.5744355,0.003980474,0.39372665,0.025135025,0.00007479385],"about_ca_topic_score_codex":0.0029913823,"about_ca_topic_score_gemma":0.0035031887,"teacher_disagreement_score":0.024126565,"about_ca_system_score_codex":0.00476296,"about_ca_system_score_gemma":0.0024650148,"threshold_uncertainty_score":0.080711365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86713004,0.0006274152,0.12626584,0.000583854,0.00006423125,0.000057037225,0.00011485347,0.0002919881,0.004864775],"genre_scores_gemma":[0.98720086,0.0001404628,0.011961899,0.00003142544,0.000012752106,0.000013343041,0.000054123753,0.000020298865,0.0005648429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911314,0.0004956656,0.000028910139,0.00011081448,0.000123432,0.0001280581],"domain_scores_gemma":[0.9912476,0.00769352,0.0004877523,0.00018657386,0.00021263924,0.00017201502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026599183,0.000798437,0.0005880035,0.00043071923,0.0006537514,0.0010240015,0.00059705763,0.0011703824,0.0015043175],"category_scores_gemma":[0.009428306,0.00046105354,0.0003851426,0.00053889165,0.000789516,0.001594927,0.00072631624,0.0010091349,0.0001081545],"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.00009337221,0.000036167083,0.0006378922,0.000014876299,0.000008605301,0.000021242055,0.000011015819,0.994605,0.0005219919,0.00059601414,0.00006126239,0.0033926019],"study_design_scores_gemma":[0.000011174688,0.0000864053,0.00030509138,0.0000024745132,0.0000066529306,0.000009796528,0.00001666274,0.9986877,0.00039101706,0.00041502516,0.00006473075,0.0000033639935],"about_ca_topic_score_codex":0.011355487,"about_ca_topic_score_gemma":0.0059078196,"teacher_disagreement_score":0.011355487,"about_ca_system_score_codex":0.00091707264,"about_ca_system_score_gemma":0.0011756271,"threshold_uncertainty_score":0.022578776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14938535,0.0005596555,0.8458469,0.00055711163,0.000107968786,0.00007469499,0.000062033425,0.0002551879,0.0031510838],"genre_scores_gemma":[0.9860162,0.00016054868,0.012860975,0.00005409274,0.000017328663,0.000034109777,0.00001538545,0.000011189547,0.0008302565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924326,0.0001773076,0.000041044532,0.00021176643,0.00013344252,0.00019314092],"domain_scores_gemma":[0.99885416,0.00057759666,0.00021097636,0.00005650596,0.00018701669,0.000113713606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012031737,0.00065901957,0.00075560354,0.00036558165,0.0005476549,0.001325353,0.0011991154,0.00054058013,0.0008933839],"category_scores_gemma":[0.0022680557,0.0003333932,0.00038160753,0.00047323704,0.00080447254,0.0010499986,0.0006250696,0.0007349612,0.00008756268],"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.00027370834,0.00010477658,0.001429494,0.00010062735,0.000044087123,0.00009979039,0.00012728898,0.95237017,0.006970463,0.02345392,0.000632928,0.014392823],"study_design_scores_gemma":[0.000014007406,0.000029036119,0.00008776741,0.0000019846048,0.0000072432563,0.00000648916,0.00001510782,0.99698144,0.00053810986,0.0022274817,0.00008746952,0.0000038280755],"about_ca_topic_score_codex":0.0067611607,"about_ca_topic_score_gemma":0.0042957948,"teacher_disagreement_score":0.0067611607,"about_ca_system_score_codex":0.0017375859,"about_ca_system_score_gemma":0.0016515347,"threshold_uncertainty_score":0.013443589},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006424797,0.0021209402,0.9861762,0.00031884405,0.00007305428,0.00006284138,0.00015215529,0.00015408722,0.0045170216],"genre_scores_gemma":[0.44236127,0.008781045,0.539914,0.00023398548,0.00040062793,0.0005339493,0.0007942176,0.00015150667,0.006829397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947387,0.00017252978,0.00002607912,0.00009871796,0.00017920301,0.000049593793],"domain_scores_gemma":[0.99965584,0.000187424,0.000051680156,0.000029776185,0.0000590813,0.00001608635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935106,0.0009314682,0.0008536767,0.0007160375,0.00044575328,0.0012132977,0.0011021559,0.001026436,0.0014268346],"category_scores_gemma":[0.0013645107,0.00046101352,0.0008641985,0.001819957,0.0007204802,0.00133988,0.00057545735,0.0011287067,0.00038765272],"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.00004582551,0.00007044496,0.00052753015,0.0002781249,0.00004260094,0.00012296227,0.00008416224,0.81443197,0.0022633823,0.12163975,0.0036392466,0.056854043],"study_design_scores_gemma":[0.000010381137,0.000031916195,0.00011178137,0.000017561168,0.00000949331,0.0000664224,0.000018527782,0.9506707,0.0004696727,0.04378799,0.0047949417,0.000010542655],"about_ca_topic_score_codex":0.004392376,"about_ca_topic_score_gemma":0.0019010312,"teacher_disagreement_score":0.004392376,"about_ca_system_score_codex":0.0010834644,"about_ca_system_score_gemma":0.0018475736,"threshold_uncertainty_score":0.00873363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06080658,0.0005187029,0.9356341,0.00012479468,0.00003211344,0.00014647386,0.00004807397,0.0001941987,0.0024949582],"genre_scores_gemma":[0.45447943,0.00041056232,0.5432824,0.000074914984,0.00003354444,0.00026876564,0.0001420455,0.00008120786,0.0012271549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544406,0.0029636994,0.0003081526,0.0002743915,0.0008393481,0.00017040638],"domain_scores_gemma":[0.9922381,0.005933674,0.00041949056,0.00031600028,0.0009627685,0.00013013846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012594018,0.0014188328,0.0016629741,0.003648678,0.0008143616,0.0016999543,0.00057529344,0.00071604643,0.0012492095],"category_scores_gemma":[0.015348843,0.00039601777,0.0013750481,0.0031867947,0.00074504106,0.00094934955,0.0018531547,0.0013595718,0.00019148625],"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.0002913929,0.00023784417,0.006616149,0.0003250794,0.0004488597,0.00017368209,0.00040900375,0.5991713,0.0040378924,0.017511884,0.00054221664,0.37023467],"study_design_scores_gemma":[0.000018867113,0.00019312334,0.0020820824,0.000038143527,0.000049650378,0.000044732562,0.00007036078,0.98653203,0.003513928,0.006399168,0.001028712,0.000029187866],"about_ca_topic_score_codex":0.0034235273,"about_ca_topic_score_gemma":0.0029289494,"teacher_disagreement_score":0.012594018,"about_ca_system_score_codex":0.0011471027,"about_ca_system_score_gemma":0.0010055285,"threshold_uncertainty_score":0.066604316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037042838,0.00044496602,0.95145386,0.0003272405,0.000037717473,0.000098661054,0.00008731429,0.00006068456,0.010446681],"genre_scores_gemma":[0.82454157,0.0011866168,0.16559534,0.00016842506,0.000062319,0.00058542145,0.00013516952,0.000043254968,0.007681867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984629,0.0007613226,0.00007919421,0.00020750496,0.00030946467,0.0001796854],"domain_scores_gemma":[0.99832886,0.0010190078,0.00030000246,0.000051892082,0.0001937412,0.00010640966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019615775,0.0009924051,0.0007715755,0.0011563379,0.00076613645,0.002226802,0.0009926022,0.0011387309,0.002961884],"category_scores_gemma":[0.0047185887,0.0003805787,0.000774089,0.0009917265,0.0021297014,0.0028247826,0.0018548339,0.0015911275,0.00043890413],"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.000043017488,0.000024237039,0.0002618499,0.000056038436,0.00002592319,0.0001156517,0.00014538119,0.09655353,0.0013272155,0.8942714,0.00048468367,0.006691069],"study_design_scores_gemma":[0.000026147824,0.000048056023,0.00016122186,0.000025366213,0.000011036538,0.000056827677,0.00010128938,0.4863841,0.0005772129,0.5109049,0.0016796348,0.000024253295],"about_ca_topic_score_codex":0.0020097375,"about_ca_topic_score_gemma":0.0014284198,"teacher_disagreement_score":0.002961884,"about_ca_system_score_codex":0.0015445227,"about_ca_system_score_gemma":0.0010041642,"threshold_uncertainty_score":0.011206329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009305116,0.00014357362,0.98736316,0.00009759212,0.000037696915,0.000059738737,0.00002270339,0.00027599765,0.0026944599],"genre_scores_gemma":[0.2901214,0.00023010522,0.7042601,0.00014614486,0.00003687759,0.0003838267,0.00020060396,0.00014238265,0.004478543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996468,0.00010649588,0.00002110265,0.00006064759,0.00010052353,0.00006439473],"domain_scores_gemma":[0.9996865,0.00018144325,0.00003553948,0.000020175727,0.000056714696,0.000019714485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065958034,0.0007188463,0.00081738003,0.0006797133,0.0005151611,0.0008024532,0.0013722171,0.0009292162,0.003264579],"category_scores_gemma":[0.0012007917,0.00025873655,0.0006400668,0.00087562826,0.00043496705,0.00078717934,0.0006227084,0.0011203442,0.0005004787],"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.00014941269,0.00013585381,0.0005528737,0.00013270727,0.000051032905,0.00009587313,0.000096207616,0.78543735,0.0031519795,0.028198043,0.003607139,0.17839152],"study_design_scores_gemma":[0.0000137552415,0.000027897018,0.000052452728,0.0000039893675,0.000004038064,0.000018687424,0.0000067125593,0.9965245,0.00043463262,0.0022388627,0.0006704949,0.0000038890903],"about_ca_topic_score_codex":0.0030791264,"about_ca_topic_score_gemma":0.002594907,"teacher_disagreement_score":0.003264579,"about_ca_system_score_codex":0.0007672814,"about_ca_system_score_gemma":0.0014431133,"threshold_uncertainty_score":0.010921121},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003180492,0.00017280692,0.9940044,0.000031202057,0.000013590865,0.000055882618,0.000030494091,0.0000810034,0.0024301407],"genre_scores_gemma":[0.20968568,0.00045748075,0.786118,0.00007116797,0.000036679543,0.00064727006,0.00026050414,0.00012822212,0.0025951045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822444,0.0008422289,0.000113845206,0.00021372295,0.0004985056,0.00010727516],"domain_scores_gemma":[0.9983429,0.0011360409,0.00012434508,0.00011737958,0.00022915426,0.000050276813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352071,0.0016492892,0.001886785,0.0019536074,0.00055116345,0.0020005237,0.0017486847,0.0011364141,0.004068209],"category_scores_gemma":[0.003233454,0.0006736119,0.0015877526,0.0017551325,0.0006545821,0.0015403603,0.001647031,0.0015794383,0.00063875114],"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.00010008365,0.0001329007,0.0006266125,0.00036898142,0.00013506867,0.0001093274,0.00010865719,0.85578346,0.0028537526,0.03746834,0.00095203175,0.1013607],"study_design_scores_gemma":[0.000012728915,0.000066626024,0.00007599648,0.000018135606,0.000014168288,0.000029343855,0.000020301117,0.9884814,0.0010548773,0.0087341545,0.0014801371,0.000012008116],"about_ca_topic_score_codex":0.0021429332,"about_ca_topic_score_gemma":0.0019945835,"teacher_disagreement_score":0.004068209,"about_ca_system_score_codex":0.0012217677,"about_ca_system_score_gemma":0.001282116,"threshold_uncertainty_score":0.013609469},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029932028,0.0011003058,0.9309149,0.0013761905,0.00038653586,0.0002432925,0.0014815103,0.0003577884,0.034207497],"genre_scores_gemma":[0.7819291,0.0027126372,0.10953686,0.00039295835,0.00026369072,0.0010031385,0.0013027166,0.00017620738,0.10268272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.0002611428,0.000052130774,0.0002619752,0.00019224947,0.00018351938],"domain_scores_gemma":[0.9992938,0.0003070626,0.00013181145,0.000029672809,0.00018081,0.00005684563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012380866,0.0015234287,0.0016163944,0.0015427793,0.0009941704,0.0031286993,0.0038162991,0.0036170925,0.008425987],"category_scores_gemma":[0.001532714,0.0010825342,0.0022340713,0.002474681,0.0009839414,0.0026485466,0.0014897365,0.002422219,0.0012097872],"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.000034122913,0.000035883153,0.00025675356,0.000086689084,0.00002548433,0.00017131453,0.00004086982,0.9771474,0.0007002937,0.01813598,0.0006934535,0.0026718127],"study_design_scores_gemma":[0.000010791972,0.000027191654,0.00010140437,0.00000879587,0.000014181681,0.00002746591,0.000020007217,0.99490094,0.000115233765,0.003552093,0.0012125921,0.000009194349],"about_ca_topic_score_codex":0.019070843,"about_ca_topic_score_gemma":0.014497257,"teacher_disagreement_score":0.019070843,"about_ca_system_score_codex":0.0024884215,"about_ca_system_score_gemma":0.0024559197,"threshold_uncertainty_score":0.03791964},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21469356,0.00073439855,0.77887815,0.00045952157,0.0001254623,0.00021423343,0.0002842062,0.00031611204,0.0042943293],"genre_scores_gemma":[0.86158067,0.00042335317,0.13220197,0.00013724757,0.00020798623,0.00023941217,0.00034118412,0.0001899249,0.004678251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859196,0.000651959,0.00007337078,0.0001950103,0.0002130006,0.0002747554],"domain_scores_gemma":[0.995743,0.0027344462,0.00048794982,0.00021071713,0.00030002318,0.0005237569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003905339,0.0012514896,0.002025845,0.00071751676,0.00093243254,0.0016763159,0.0015494033,0.0011399704,0.0015946408],"category_scores_gemma":[0.0058842422,0.00069487904,0.00094035635,0.0009996835,0.0012453657,0.0023074194,0.0013505438,0.0013925517,0.00019099137],"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.0010622483,0.00024886627,0.0012424864,0.00038883806,0.00012192955,0.00029197178,0.00029267906,0.9002981,0.012443215,0.055594716,0.0019652138,0.026049675],"study_design_scores_gemma":[0.00020115277,0.00066561304,0.00051509694,0.000023591661,0.00003577722,0.00013633136,0.000096351185,0.90708876,0.002158573,0.087525964,0.0015220153,0.000030798215],"about_ca_topic_score_codex":0.0009104967,"about_ca_topic_score_gemma":0.0009441764,"teacher_disagreement_score":0.003905339,"about_ca_system_score_codex":0.0011893468,"about_ca_system_score_gemma":0.0016640059,"threshold_uncertainty_score":0.020653665},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1648576,0.0007297678,0.8028485,0.0020428156,0.00020133314,0.0007490871,0.00028666886,0.00043089947,0.0278533],"genre_scores_gemma":[0.9478067,0.0002253561,0.04354666,0.0001365698,0.00012777871,0.00026063772,0.000083106446,0.000031568146,0.007781639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99036425,0.0043034083,0.0005070814,0.0016911186,0.0022308526,0.00090332906],"domain_scores_gemma":[0.9891205,0.0047913073,0.0021674705,0.0014664867,0.00158365,0.00087064714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008483855,0.0010403736,0.0015654258,0.0011065861,0.0016610745,0.003359992,0.002910188,0.0024098356,0.004688794],"category_scores_gemma":[0.015871765,0.0006396964,0.0011423902,0.0013221935,0.002027947,0.0034916473,0.0029171975,0.0016450541,0.0005570435],"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.0007533106,0.00038243062,0.0046276143,0.00041356313,0.00028636586,0.001440326,0.0011982073,0.39116773,0.0068160486,0.50621265,0.004335384,0.082366385],"study_design_scores_gemma":[0.00014406991,0.00032798867,0.0011823898,0.000052070893,0.00010706264,0.0005748193,0.00023689408,0.87115574,0.0017721147,0.11584723,0.008498159,0.000101466714],"about_ca_topic_score_codex":0.003322693,"about_ca_topic_score_gemma":0.002164979,"teacher_disagreement_score":0.008483855,"about_ca_system_score_codex":0.0033723179,"about_ca_system_score_gemma":0.004024492,"threshold_uncertainty_score":0.044867456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459174,0.0015041837,0.80586183,0.0011236705,0.00014603895,0.000116105846,0.00035407292,0.00031509713,0.0059872223],"genre_scores_gemma":[0.9794708,0.00061056233,0.01451743,0.00012706697,0.00010098899,0.000073556796,0.0002270227,0.00006666134,0.0048059453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.00019146105,0.000028481383,0.0001174711,0.00026898275,0.00016945596],"domain_scores_gemma":[0.9973437,0.0014173968,0.000341677,0.000097591204,0.0006204309,0.00017918095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020307077,0.00085471483,0.0010000656,0.00093568984,0.0007459817,0.0012723961,0.0013786047,0.00088487193,0.0023712069],"category_scores_gemma":[0.0047635026,0.00042486333,0.0011163934,0.00066250516,0.0011056835,0.0016697572,0.00080739433,0.0010933945,0.00022300094],"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.00022187196,0.000076126424,0.002719517,0.00017306814,0.000090805705,0.00030695277,0.0002092302,0.8604269,0.008053553,0.119598925,0.0016327291,0.00649035],"study_design_scores_gemma":[0.000003956878,0.000013306678,0.00029990735,0.0000025574366,0.000007357572,0.000019762667,0.000012610925,0.9940268,0.00024412147,0.005250145,0.00011227247,0.0000072326247],"about_ca_topic_score_codex":0.013369445,"about_ca_topic_score_gemma":0.005237207,"teacher_disagreement_score":0.013369445,"about_ca_system_score_codex":0.0026897832,"about_ca_system_score_gemma":0.0025902227,"threshold_uncertainty_score":0.026583254},"labels":[],"label_agreement":null}]}