{"meta":{"query_hash":"e35e17daf8d4","filters":{"venue":"American Journal of Operations Research"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"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/e35e17daf8d4","api":"https://metacan.xera.ac/api/v1/cohort?venue=American+Journal+of+Operations+Research"},"results":[{"id":"W1582557684","doi":"10.4236/ajor.2015.55026","title":"Using DEA and AHP for Multiplicative Aggregation of Hierarchical Indicators","year":2015,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Laurentian University","funders":"","keywords":"Analytic hierarchy process; Data envelopment analysis; Multiplicative function; Hierarchy; Computer science; Set (abstract data type); Operations research; Construct (python library); Data mining; Mathematics; Statistics; Economics","score_opus":0.3821685235789269,"score_gpt":0.557091714635482,"score_spread":0.17492319105655513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582557684","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.0017529943,0.00020698477,0.99652326,0.00008142736,0.00003585988,0.00016734136,0.000054855336,0.00006413122,0.0011132137],"genre_scores_gemma":[0.060138386,0.00045483786,0.93811005,0.000043719123,0.000028394583,0.0006460836,0.00018160569,0.000033799726,0.00036304185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.986439,0.007986064,0.0012856015,0.00095062645,0.0030374357,0.00030130093],"domain_scores_gemma":[0.9912663,0.0057795867,0.00076739676,0.00055861525,0.0015350358,0.00009310502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015731571,0.0020793374,0.0017300237,0.004994051,0.0012525325,0.0032427206,0.0015207169,0.0007378134,0.0018827925],"category_scores_gemma":[0.022475624,0.00088355545,0.0025671376,0.007944075,0.001118921,0.0025084587,0.0029047704,0.0030615532,0.0003305987],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094942654,0.00016842523,0.002160683,0.0016137875,0.0010460054,0.00025963158,0.001465495,0.41097146,0.004072994,0.21086876,0.0024436298,0.3648342],"study_design_scores_gemma":[0.000034540102,0.00011709118,0.0008407441,0.0002333053,0.00019102044,0.000064334134,0.00033610174,0.85722226,0.0024448216,0.12845798,0.009965886,0.00009197817],"about_ca_topic_score_codex":0.0055688503,"about_ca_topic_score_gemma":0.007825757,"teacher_disagreement_score":0.015731571,"about_ca_system_score_codex":0.0023291858,"about_ca_system_score_gemma":0.003239997,"threshold_uncertainty_score":0.083197534},"labels":[],"label_agreement":null},{"id":"W1964676846","doi":"10.4236/ajor.2011.14024","title":"Solving Bilevel Linear Multiobjective Programming Problems","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":22,"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":"Bilevel optimization; Mathematical optimization; Linear programming; Decision maker; Pareto principle; Set (abstract data type); Pareto optimal; Computer science; Linear-fractional programming; Multiobjective programming; Mathematics; Resolution (logic); Multi-objective optimization; Optimization problem; Operations research; Artificial intelligence","score_opus":0.10967015286265903,"score_gpt":0.3538734093731688,"score_spread":0.24420325651050978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964676846","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.009230673,0.0005556478,0.98652077,0.00016291924,0.000032612137,0.000038932838,0.000027862257,0.00005730288,0.0033733097],"genre_scores_gemma":[0.4082527,0.002190225,0.58145416,0.000186216,0.00017807007,0.000477685,0.00029037235,0.00015509092,0.006815475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.0006521377,0.00006372943,0.00014902838,0.00020624089,0.00013566198],"domain_scores_gemma":[0.9982759,0.0012890939,0.00012970148,0.00007208697,0.00017147885,0.000061726205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00212204,0.0014215072,0.0019893441,0.0007083859,0.00059843005,0.0025502827,0.0011389859,0.0019362955,0.0028395283],"category_scores_gemma":[0.0051147607,0.00063745695,0.0011217667,0.0013045905,0.0007875319,0.0015117358,0.0021303399,0.0020875053,0.0005826098],"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.0000432192,0.000060398346,0.00029359167,0.00041183713,0.000077447614,0.00013097451,0.00012396622,0.9229344,0.0012255313,0.030992758,0.00069062744,0.0430152],"study_design_scores_gemma":[0.000012130262,0.000037471604,0.000040278373,0.000028674578,0.000011200142,0.00003364084,0.000049259812,0.9637544,0.0005197996,0.034153566,0.0013515454,0.000007969974],"about_ca_topic_score_codex":0.0013033269,"about_ca_topic_score_gemma":0.000897788,"teacher_disagreement_score":0.0028395283,"about_ca_system_score_codex":0.00048513434,"about_ca_system_score_gemma":0.0011292284,"threshold_uncertainty_score":0.011222601},"labels":[],"label_agreement":null},{"id":"W1965685568","doi":"10.4236/ajor.2013.32024","title":"A Particle Swarm Optimization Algorithm for a 2-D Irregular Strip Packing Problem","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"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":"Particle swarm optimization; Packing problems; Algorithm; Benchmark (surveying); Generator (circuit theory); Set (abstract data type); Circle packing; Sequence (biology); Mathematical optimization; Multi-swarm optimization; Phase (matter); Mathematics; Optimization problem; Computer science; Combinatorics; Power (physics)","score_opus":0.03452771659394198,"score_gpt":0.3214010978096618,"score_spread":0.2868733812157198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965685568","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.005988236,0.00019888484,0.9908862,0.00011728399,0.000059840506,0.00009107253,0.00004733435,0.00020521278,0.002405879],"genre_scores_gemma":[0.1384824,0.00041492685,0.8550465,0.000111365705,0.00007343498,0.00067863194,0.00031941364,0.000070168375,0.0048031546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967504,0.0000917334,0.000022485123,0.00006458758,0.00011027698,0.00003593092],"domain_scores_gemma":[0.9995384,0.0002547109,0.000043614735,0.000028467663,0.00011109948,0.000023770835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075650885,0.0011531909,0.0011684496,0.0007045033,0.0005915133,0.0008719039,0.0011065671,0.0016729303,0.0024982411],"category_scores_gemma":[0.0015535968,0.00050838763,0.00074386346,0.000972828,0.00041568733,0.00069232425,0.00094802404,0.0010916382,0.00058871927],"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.000044157572,0.00004629598,0.00032809193,0.0000765229,0.0000278214,0.000059271886,0.000051213763,0.9419897,0.0012251887,0.004335568,0.0018190584,0.049997166],"study_design_scores_gemma":[0.000011646006,0.000020248679,0.00004087581,0.0000048450183,0.0000038983794,0.0000099299705,0.000005955009,0.99828374,0.00016762357,0.0007205245,0.0007281663,0.000002610291],"about_ca_topic_score_codex":0.005862439,"about_ca_topic_score_gemma":0.003795786,"teacher_disagreement_score":0.005862439,"about_ca_system_score_codex":0.00049331994,"about_ca_system_score_gemma":0.0012510498,"threshold_uncertainty_score":0.011656642},"labels":[],"label_agreement":null},{"id":"W1971729061","doi":"10.4236/ajor.2014.44026","title":"Using DEA and AHP for Ratio Analysis","year":2014,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Laurentian University","funders":"","keywords":"Data envelopment analysis; Analytic hierarchy process; Ranking (information retrieval); Set (abstract data type); Measure (data warehouse); Computer science; Parametric statistics; Range (aeronautics); Closeness; Efficiency; Mathematics; Operations research; Mathematical optimization; Statistics; Data mining; Engineering; Artificial intelligence","score_opus":0.32266419792019224,"score_gpt":0.5640352884855022,"score_spread":0.24137109056530998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971729061","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.0024176526,0.00032384996,0.99519604,0.00007926422,0.00002430928,0.00013935709,0.000057702087,0.000076199816,0.0016856719],"genre_scores_gemma":[0.1159758,0.0009671244,0.88139486,0.00005767805,0.000051391493,0.0006717532,0.0002242587,0.0000574143,0.0005997732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98502976,0.008804199,0.00088430167,0.00094602304,0.0040272274,0.00030844487],"domain_scores_gemma":[0.9911027,0.0065766904,0.0007449527,0.00039563613,0.0010854733,0.00009461856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013538484,0.0023134581,0.002103308,0.0074261227,0.0009321571,0.0034462153,0.0018085187,0.00083655294,0.002137607],"category_scores_gemma":[0.020922296,0.0008054191,0.0023771115,0.006732463,0.0012595316,0.0023627745,0.0024647615,0.0024132174,0.00032566645],"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.0000983154,0.0001347255,0.0015955516,0.0010190415,0.0006397984,0.00015469987,0.0003894406,0.6253428,0.0019099105,0.16639711,0.0010730386,0.20124559],"study_design_scores_gemma":[0.00003574071,0.00009755413,0.00047637353,0.0001632156,0.00010390378,0.000053774056,0.00017946563,0.8747642,0.0016363502,0.11648434,0.0059433994,0.00006168484],"about_ca_topic_score_codex":0.0046177795,"about_ca_topic_score_gemma":0.0040479028,"teacher_disagreement_score":0.013538484,"about_ca_system_score_codex":0.0024886678,"about_ca_system_score_gemma":0.002652599,"threshold_uncertainty_score":0.071599185},"labels":[],"label_agreement":null},{"id":"W1995445457","doi":"10.4236/ajor.2013.32026","title":"Generating Efficient Solutions in Bilevel Multi-Objective Programming Problems","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"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":"Bilevel optimization; Decision maker; Mathematical optimization; Construct (python library); Point (geometry); Multiobjective programming; Linear programming; Computer science; Mathematics; Optimization problem; Multi-objective optimization; Operations research","score_opus":0.07852591409686466,"score_gpt":0.3622887004825126,"score_spread":0.28376278638564795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995445457","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.018077698,0.00015010832,0.97974133,0.00012140224,0.000012050349,0.00005438497,0.000024285564,0.000057216886,0.0017615078],"genre_scores_gemma":[0.30146375,0.00038049615,0.6953473,0.00010646489,0.000027211496,0.00048397982,0.00018607388,0.00013643948,0.0018682525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867994,0.00072135235,0.000063534695,0.00015013992,0.00025977008,0.00012523873],"domain_scores_gemma":[0.9969928,0.0022388352,0.00021595751,0.00015265578,0.00031871072,0.0000809227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033398166,0.0011505082,0.0016285001,0.0010395438,0.0006782916,0.0012952177,0.0011424941,0.001661318,0.002232539],"category_scores_gemma":[0.009036183,0.00082132756,0.00095843157,0.0011785025,0.0012851775,0.0015602019,0.002479514,0.0018508241,0.0004547206],"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.000047603924,0.00005080021,0.00037721117,0.00017488246,0.000040238807,0.000091923976,0.00012983983,0.913575,0.0013112396,0.05443016,0.00046742076,0.029303744],"study_design_scores_gemma":[0.000019087884,0.000040896026,0.000044919092,0.000029868428,0.000007487994,0.000027362845,0.000042775366,0.95473856,0.000957404,0.04325534,0.0008290553,0.0000072334556],"about_ca_topic_score_codex":0.00060055556,"about_ca_topic_score_gemma":0.0006395967,"teacher_disagreement_score":0.0033398166,"about_ca_system_score_codex":0.0006186052,"about_ca_system_score_gemma":0.0009577263,"threshold_uncertainty_score":0.017662823},"labels":[],"label_agreement":null},{"id":"W1998041568","doi":"10.4236/ajor.2012.24059","title":"Dominance-Based Rough Set Approach in Selection of Portfolio of Sustainable Development Projects","year":2012,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Cégep de l'Abitibi Témiscamingue; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Rough set; Computer science; Dominance (genetics); Portfolio; Dominance-based rough set approach; Set (abstract data type); Operations research; Futures contract; Sustainable development; Data mining; Process (computing); Management science; Business; Economics; Mathematics; Ecology; Finance","score_opus":0.06883002560422653,"score_gpt":0.35399660299456437,"score_spread":0.28516657739033785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998041568","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.02370259,0.0014402438,0.9694909,0.00044256586,0.000055344954,0.00021541998,0.00016868404,0.00006842498,0.0044158064],"genre_scores_gemma":[0.51728725,0.0017372965,0.47839472,0.00014651082,0.00010305906,0.00049883866,0.00029328652,0.000023522683,0.0015155612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919248,0.0041915663,0.0005758124,0.00055190176,0.00237786,0.00037806624],"domain_scores_gemma":[0.9946227,0.0038192265,0.00044198657,0.00017985536,0.00079040194,0.00014585508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007673485,0.0009460033,0.0022039162,0.005139499,0.0010211237,0.0034961249,0.0013869803,0.0008231382,0.001244334],"category_scores_gemma":[0.011622187,0.00049984414,0.0021706158,0.0033211634,0.0009757822,0.002439095,0.0011134164,0.0011094048,0.00018681979],"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.0001605778,0.00013440225,0.0034687137,0.0008528315,0.0005072936,0.0005780952,0.00068987324,0.6685267,0.0023768484,0.16013815,0.0025744175,0.15999205],"study_design_scores_gemma":[0.000049526974,0.00020693804,0.0013420276,0.00017221879,0.00016484306,0.00023381936,0.000268165,0.84673774,0.0013257759,0.14506313,0.004358906,0.00007686904],"about_ca_topic_score_codex":0.0039111623,"about_ca_topic_score_gemma":0.004071064,"teacher_disagreement_score":0.007673485,"about_ca_system_score_codex":0.0024953624,"about_ca_system_score_gemma":0.0023655621,"threshold_uncertainty_score":0.040581763},"labels":[],"label_agreement":null},{"id":"W2037616197","doi":"10.4236/ajor.2011.13015","title":"A Hierarchical Methodology for Performance Evaluation Based on Data Envelopment Analysis: The Case of Companies’ Competitiveness in an Economy","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Laurentian University","funders":"","keywords":"Data envelopment analysis; Index (typography); Identification (biology); Computer science; Industrial organization; Operations research; Business; Econometrics; Economics; Mathematics; Statistics","score_opus":0.6756018683741475,"score_gpt":0.5818432606939765,"score_spread":0.09375860768017097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037616197","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.0030741468,0.00037902457,0.9936395,0.00015207357,0.000016734593,0.00008692999,0.0000664326,0.000041407384,0.0025437095],"genre_scores_gemma":[0.15815929,0.00079150154,0.83966506,0.000075022705,0.00005190885,0.00039495277,0.00014967845,0.000040296127,0.00067241606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9885633,0.006967859,0.00048189517,0.0007008823,0.0029093514,0.00037668893],"domain_scores_gemma":[0.9945649,0.0033912438,0.00054385525,0.00070867257,0.00068316224,0.00010820439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009074522,0.001130059,0.0013225015,0.0041908976,0.0010943292,0.0030794616,0.0011820451,0.0011366674,0.0017718677],"category_scores_gemma":[0.013107017,0.00046873983,0.0019185434,0.0061001256,0.0021561699,0.0021910707,0.0019432729,0.0019754637,0.00038516553],"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.000033436132,0.00007060616,0.0014476529,0.00043254203,0.00018828276,0.00018482638,0.00050420006,0.31980488,0.0023025454,0.57216376,0.0014182724,0.101448976],"study_design_scores_gemma":[0.000023953806,0.00012990371,0.001890938,0.00020034864,0.00008540378,0.000107184715,0.00027751204,0.6687445,0.0019825941,0.31351086,0.012953706,0.00009302659],"about_ca_topic_score_codex":0.007915975,"about_ca_topic_score_gemma":0.0049644588,"teacher_disagreement_score":0.009074522,"about_ca_system_score_codex":0.0031152556,"about_ca_system_score_gemma":0.003188302,"threshold_uncertainty_score":0.047991216},"labels":[],"label_agreement":null},{"id":"W2046036316","doi":"10.4236/ajor.2013.33035","title":"Computing the Distribution Function of the Number of Renewals","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":8,"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":"Laplace transform; Laplace distribution; Mathematics; Laplace–Stieltjes transform; Variance (accounting); Distribution (mathematics); Applied mathematics; Two-sided Laplace transform; Laplace transform applied to differential equations; Function (biology); Renewal theory; Calculus (dental); Mathematical optimization; Mathematical analysis; Statistics; Fourier transform","score_opus":0.029007040298941723,"score_gpt":0.3727250329594432,"score_spread":0.34371799266050146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046036316","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.07211109,0.00018489483,0.92509747,0.0001708428,0.000029047747,0.000025382957,0.00007006281,0.0006872356,0.0016239998],"genre_scores_gemma":[0.63286877,0.00030373872,0.3629104,0.000052596202,0.000066421795,0.000087809654,0.00035825328,0.00022422949,0.003127846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999561,0.000087706125,0.000023493982,0.00009282768,0.00016584028,0.00006910042],"domain_scores_gemma":[0.9948265,0.0038967566,0.00023814035,0.00023080825,0.0006835095,0.00012421711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020449804,0.000521302,0.0009063943,0.0027559132,0.0005529913,0.0012390758,0.00091347157,0.00075848895,0.0022503093],"category_scores_gemma":[0.015050981,0.0003729787,0.00061284483,0.0013038669,0.00096649956,0.0018947086,0.00075946137,0.00093931274,0.00057695864],"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.00028012024,0.00011634326,0.009081472,0.00018074879,0.000076978904,0.00034051997,0.00030871746,0.7072908,0.0137001565,0.10151983,0.0017967919,0.16530754],"study_design_scores_gemma":[0.0000081090375,0.000010233533,0.0005134455,0.000005128382,0.000004592674,0.00004776361,0.000016578999,0.9843284,0.002042729,0.012750916,0.0002623071,0.000009743929],"about_ca_topic_score_codex":0.005093121,"about_ca_topic_score_gemma":0.0027052397,"teacher_disagreement_score":0.005093121,"about_ca_system_score_codex":0.0015283774,"about_ca_system_score_gemma":0.0018353288,"threshold_uncertainty_score":0.011089265},"labels":[],"label_agreement":null},{"id":"W2048027870","doi":"10.4236/ajor.2012.23039","title":"A DSS for Human Resettlement: Supporting Interactive Optimal Decisions","year":2012,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Facility Location and Emergency Management","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 Lethbridge","funders":"","keywords":"Relocation; Decision support system; Computer science; Decision aids; Operations research; Management science; Process management; Knowledge management; Human resources; Risk analysis (engineering); Business; Artificial intelligence; Engineering; Economics; Management","score_opus":0.14270990343475184,"score_gpt":0.45128867287390234,"score_spread":0.3085787694391505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048027870","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.10370937,0.0006578822,0.8381411,0.0021265456,0.0004144829,0.001037708,0.0045230747,0.03617296,0.013216868],"genre_scores_gemma":[0.47552818,0.00068705174,0.51420844,0.00035113347,0.000085970096,0.00066129887,0.0029236968,0.0003216511,0.0052325972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995498,0.00017228375,0.00006353645,0.00007859117,0.00010880431,0.000027017131],"domain_scores_gemma":[0.9982504,0.0011002027,0.00012816857,0.00013468046,0.00024187982,0.00014454674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012551557,0.0009233469,0.00077558606,0.0007654447,0.00068868056,0.0019468896,0.0012652954,0.0013669872,0.009746251],"category_scores_gemma":[0.0033081432,0.0003700963,0.00044069847,0.0005829831,0.00029390448,0.0011706075,0.0010705547,0.00083310326,0.0011971204],"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.0014529884,0.001137572,0.0070893746,0.001355086,0.0002998854,0.0014882651,0.001798971,0.43826216,0.03050472,0.019855386,0.05081619,0.4459394],"study_design_scores_gemma":[0.00022339725,0.00016964917,0.000995767,0.00010138101,0.000108176304,0.000119937744,0.0002681892,0.94996285,0.008010049,0.006568525,0.03339802,0.00007403391],"about_ca_topic_score_codex":0.00376658,"about_ca_topic_score_gemma":0.0053250855,"teacher_disagreement_score":0.009746251,"about_ca_system_score_codex":0.0005378077,"about_ca_system_score_gemma":0.0011457622,"threshold_uncertainty_score":0.032604456},"labels":[],"label_agreement":null},{"id":"W2093411841","doi":"10.4236/ajor.2015.52006","title":"Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"York University","funders":"","keywords":"Cutting-plane method; Scheduling (production processes); Plane (geometry); Computer science; Inequality; Due date; Preemption; Mathematical optimization; Mathematics; Algorithm; Operations research; Geometry; Integer programming; Programming language; Mathematical analysis; Queue; Operating system","score_opus":0.07349344966246948,"score_gpt":0.3500015452314819,"score_spread":0.27650809556901246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093411841","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.011507726,0.00035210315,0.986019,0.00017237275,0.000031450563,0.000026941218,0.000081879894,0.000058843125,0.001749593],"genre_scores_gemma":[0.74135065,0.0016378654,0.25121072,0.00030792868,0.00016290724,0.00032789796,0.0005683923,0.00012913918,0.004304563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886703,0.0003672487,0.000046185658,0.00014055069,0.00042591683,0.0001530656],"domain_scores_gemma":[0.99720544,0.0019389082,0.0003399902,0.000119855926,0.00027224724,0.00012360315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020362632,0.001340888,0.0012689027,0.0008588364,0.00037293052,0.0012857732,0.0013862507,0.0010858616,0.0024533607],"category_scores_gemma":[0.00390484,0.00066218665,0.0010540652,0.001320689,0.0008167428,0.0015539683,0.0015364805,0.0026621555,0.00021857338],"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.000042304986,0.000033505054,0.00019510226,0.00009357083,0.000026411471,0.000055342738,0.000024825624,0.9477555,0.0014981609,0.034695633,0.0006381795,0.01494143],"study_design_scores_gemma":[0.0000047459857,0.000023539042,0.00005826474,0.000005321358,0.000004525672,0.000008686941,0.0000037227871,0.98341894,0.00022341742,0.01599454,0.0002511983,0.00000315982],"about_ca_topic_score_codex":0.0020556364,"about_ca_topic_score_gemma":0.001558605,"teacher_disagreement_score":0.0024533607,"about_ca_system_score_codex":0.0011646465,"about_ca_system_score_gemma":0.0013396397,"threshold_uncertainty_score":0.01076889},"labels":[],"label_agreement":null},{"id":"W2100018616","doi":"10.4236/ajor.2011.14031","title":"Optimal Generator Portfolio in Day-Ahead Market under Uncertain Carbon Tax Policy","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Electric Power System Optimization","field":"Engineering","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":"York University","funders":"","keywords":"Portfolio; Carbon tax; Bidding; Robustness (evolution); Flexibility (engineering); Electricity market; Economics; Generator (circuit theory); Computer science; Electricity; Microeconomics; Finance; Power (physics); Greenhouse gas; Engineering","score_opus":0.040948568793657304,"score_gpt":0.32574030808831855,"score_spread":0.28479173929466123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100018616","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.6358452,0.000453375,0.34535947,0.001154654,0.000045340934,0.00008464567,0.00043916385,0.0001693037,0.016448826],"genre_scores_gemma":[0.98894054,0.00012865067,0.0070592314,0.000031017116,0.000008514031,0.000027948505,0.00007611129,0.000021914282,0.003706101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996743,0.00015287787,0.000010150541,0.000050545823,0.000044620912,0.000067516696],"domain_scores_gemma":[0.99934274,0.00036352346,0.00011151927,0.000027391101,0.00006648028,0.00008831101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053297,0.0005575085,0.0010642279,0.0003322357,0.00034386764,0.0015702747,0.0006863971,0.0013579521,0.0026406755],"category_scores_gemma":[0.0022561937,0.00051997876,0.0003561129,0.0003905549,0.00069341704,0.0015126474,0.0005428246,0.000802519,0.00022546921],"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.000041580468,0.000014105037,0.00026602705,0.000010690283,0.00000840267,0.00006743321,0.000010594644,0.98744255,0.0004004181,0.01030585,0.0002479231,0.0011844846],"study_design_scores_gemma":[0.0000061567503,0.000008096794,0.000079913094,0.0000012374302,0.0000023122936,0.000005652009,0.0000056385124,0.996846,0.000057526482,0.0029337471,0.00005079121,0.000002750587],"about_ca_topic_score_codex":0.003916695,"about_ca_topic_score_gemma":0.0029648184,"teacher_disagreement_score":0.003916695,"about_ca_system_score_codex":0.0012149301,"about_ca_system_score_gemma":0.0009615633,"threshold_uncertainty_score":0.008833885},"labels":[],"label_agreement":null},{"id":"W2617507377","doi":"10.4236/ajor.2017.73014","title":"System Reliability Evaluation for Imperfect Networks Using Polygon-to-Chain Reduction","year":2017,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"VLSI and FPGA Design Techniques","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":"Université Laval","funders":"","keywords":"Polygon (computer graphics); Computation; Reliability (semiconductor); Algorithm; Reduction (mathematics); Computer science; Series (stratigraphy); Mathematical optimization; Node (physics); Process (computing); Mathematics; Theoretical computer science","score_opus":0.08582483862008403,"score_gpt":0.4240188789983182,"score_spread":0.3381940403782342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617507377","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.040066443,0.000071569375,0.95731527,0.000035932335,0.0000075293847,0.000026585503,0.000029727084,0.000113210204,0.0023338275],"genre_scores_gemma":[0.84931654,0.0002441539,0.14902237,0.00001194014,0.000015483229,0.00006650257,0.00008568761,0.000060195915,0.0011771321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961925,0.00014716476,0.000013499066,0.00003572514,0.00014937467,0.000034937293],"domain_scores_gemma":[0.998836,0.0008237787,0.00010956839,0.000099442,0.00011252254,0.00001878243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084872625,0.00054786267,0.0006175781,0.00085513847,0.00026091828,0.00047527766,0.0005705,0.00027359955,0.0011459356],"category_scores_gemma":[0.003718517,0.00021899205,0.0005937441,0.0006030213,0.000792094,0.0007932157,0.00042771627,0.00045019903,0.00012760979],"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.00001119674,0.0000032740209,0.00018195825,0.000013643954,0.000005474207,0.000020854108,0.000011349485,0.9875349,0.00053499965,0.0071166237,0.000049664555,0.0045160577],"study_design_scores_gemma":[7.962429e-7,0.000009747703,0.000043539894,0.0000011680382,0.0000021674632,0.000006686796,0.0000033567446,0.99712604,0.00030754556,0.002418341,0.00007933179,0.0000013616011],"about_ca_topic_score_codex":0.003897684,"about_ca_topic_score_gemma":0.002840714,"teacher_disagreement_score":0.003897684,"about_ca_system_score_codex":0.0008216673,"about_ca_system_score_gemma":0.0006853395,"threshold_uncertainty_score":0.0077500343},"labels":[],"label_agreement":null},{"id":"W2890394882","doi":"10.4236/ajor.2018.85020","title":"A Continuous Review Inventory System with Lost Sales and Emergency Orders","year":2018,"lang":"en","type":"review","venue":"American Journal of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Operations management; Lost sales; Operations research; Computer science; Business; Mathematics; Economics","score_opus":0.09218014604378812,"score_gpt":0.3742876701343237,"score_spread":0.2821075240905356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890394882","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26329762,0.42700186,0.24229497,0.0027321703,0.0009357907,0.0006423908,0.00076416135,0.0004289407,0.06190209],"genre_scores_gemma":[0.84362686,0.11797715,0.028349454,0.0002720872,0.0005987246,0.0001388562,0.0004650945,0.000035721503,0.008536004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.0002227215,0.000051270956,0.000119506774,0.0003681491,0.00009873795],"domain_scores_gemma":[0.99888414,0.0004851748,0.00026460132,0.000050601182,0.00027020095,0.000045267516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011114612,0.00084880233,0.0011481964,0.0009913226,0.00036976938,0.0019335863,0.0015501044,0.00097346166,0.0018560129],"category_scores_gemma":[0.0022458686,0.0004251249,0.0009947555,0.0016978856,0.00049212674,0.0018981231,0.000592636,0.0006264804,0.00040620755],"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.0006376739,0.0006113536,0.0116550485,0.011149448,0.00082170253,0.0029365607,0.0004256392,0.4231443,0.005611046,0.07203171,0.012879309,0.45809615],"study_design_scores_gemma":[0.00021445993,0.0012785502,0.013743148,0.0019004027,0.0010467946,0.0028354507,0.00062435,0.85564315,0.0036169305,0.033604108,0.08523044,0.00026220654],"about_ca_topic_score_codex":0.0065797903,"about_ca_topic_score_gemma":0.00482278,"teacher_disagreement_score":0.0065797903,"about_ca_system_score_codex":0.0015286867,"about_ca_system_score_gemma":0.002044951,"threshold_uncertainty_score":0.013082981},"labels":[],"label_agreement":null},{"id":"W2890533656","doi":"10.4236/ajor.2018.85019","title":"Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem","year":2018,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","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é de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Swine Innovation Porc","keywords":"Set (abstract data type); Mathematical optimization; Pareto principle; Solver; Linear programming; Computation; Simple (philosophy); Computer science; Decision maker; Pareto interpolation; Space (punctuation); Mathematics; Algorithm; Operations research; Statistics; Programming language","score_opus":0.04879858949140138,"score_gpt":0.38852608958476437,"score_spread":0.339727500093363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890533656","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.018308407,0.00007315307,0.97855294,0.000082075974,0.000018187233,0.000053696513,0.00006078603,0.00052055815,0.0023302748],"genre_scores_gemma":[0.17364149,0.000102011145,0.8233493,0.00006711077,0.000018416133,0.00036205293,0.00030911757,0.0003248422,0.0018257422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934286,0.00022997982,0.00003265421,0.00007106216,0.00021691169,0.0001064897],"domain_scores_gemma":[0.998209,0.0011775175,0.00009472733,0.00008128284,0.0003652285,0.00007222858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018231362,0.0015070345,0.0013795584,0.0016192718,0.00092199165,0.0014653731,0.0010390739,0.00117391,0.005012034],"category_scores_gemma":[0.0044399956,0.0006657782,0.0012953349,0.0010352929,0.0007054147,0.0009867859,0.0017346446,0.002162188,0.00092717604],"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.00012174443,0.00014085395,0.00080955576,0.00014202911,0.000050239312,0.00013909882,0.00014272117,0.8711078,0.0036568358,0.032906845,0.0017337159,0.08904856],"study_design_scores_gemma":[0.00001544523,0.000025863152,0.00007843546,0.000009241652,0.0000040787104,0.000013044359,0.00001919689,0.9885867,0.00076402683,0.009989189,0.0004887191,0.0000060924654],"about_ca_topic_score_codex":0.00512906,"about_ca_topic_score_gemma":0.004888615,"teacher_disagreement_score":0.00512906,"about_ca_system_score_codex":0.001023235,"about_ca_system_score_gemma":0.002104301,"threshold_uncertainty_score":0.016766906},"labels":[],"label_agreement":null},{"id":"W4405036614","doi":"10.4236/ajor.2024.146009","title":"An Elementary Approach to the Vehicle Routing Problem via Python and Google API","year":2024,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast","keywords":"Python (programming language); Computer science; Vehicle routing problem; Programming language; World Wide Web; Information retrieval; Routing (electronic design automation); Computer network","score_opus":0.03696489952496746,"score_gpt":0.37009940208506703,"score_spread":0.3331345025600996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405036614","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.0034663628,0.00011667354,0.9348076,0.0007342697,0.00012527754,0.0003184718,0.00431329,0.034129895,0.021988105],"genre_scores_gemma":[0.07619423,0.00045978505,0.8895805,0.000656099,0.00006554401,0.001650213,0.00693495,0.006995333,0.017463326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994018,0.00012375801,0.000049208247,0.00010428926,0.00022185681,0.000099070916],"domain_scores_gemma":[0.99942183,0.00026145283,0.000047024565,0.00009868421,0.00013134231,0.000039648796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288174,0.0011699059,0.00052826054,0.00057959073,0.0006303327,0.0014306859,0.0028209197,0.0010082283,0.03243108],"category_scores_gemma":[0.0027055058,0.0006197716,0.0017530108,0.00071986153,0.00055450795,0.0017115339,0.001986854,0.002259815,0.01035949],"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.00023717679,0.0003111203,0.0028202992,0.0015146518,0.00013720202,0.0007185685,0.00046993108,0.4007361,0.006838954,0.21429235,0.17671214,0.19521147],"study_design_scores_gemma":[0.000082021295,0.00004131293,0.0005157952,0.00009287905,0.000020739439,0.0002372247,0.000077998,0.76885563,0.0031096402,0.082150884,0.14476292,0.00005296693],"about_ca_topic_score_codex":0.007863419,"about_ca_topic_score_gemma":0.013118092,"teacher_disagreement_score":0.03243108,"about_ca_system_score_codex":0.00077483186,"about_ca_system_score_gemma":0.0028743506,"threshold_uncertainty_score":0.10849285},"labels":[],"label_agreement":null}]}