{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8793906,0.0001279638,0.11887889,0.0012822589,0.000032719698,0.00015660429,0.000009171431,0.0000018849763,0.000119925935],"genre_scores_gemma":[0.9318096,0.000018035,0.0680149,0.000025850832,0.00006542878,0.000004489589,9.148234e-7,0.0000071652853,0.000053623888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570304,0.0009971352,0.00085907755,0.00022580079,0.0020005188,0.00021444916],"domain_scores_gemma":[0.9924413,0.002459417,0.00035732295,0.00030429804,0.0041699405,0.0002677131],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012095169,0.00007270204,0.00035552488,0.0018438488,0.00028377053,0.00017845668,0.0005582891,0.000031900887,0.000010443168],"category_scores_gemma":[0.017373117,0.000052287945,0.00009431776,0.00329039,0.0014801247,0.00036117068,0.000103511804,0.00029976087,0.0000039369293],"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.0007946696,0.000833477,0.07607545,0.000009785718,0.00027451816,0.000014726723,0.023645975,0.15523812,0.029491244,0.012849222,0.0016131904,0.6991596],"study_design_scores_gemma":[0.002512358,0.0051066224,0.016990177,0.00014043125,0.00010989699,0.0002136313,0.049001165,0.89060485,0.015508662,0.014955282,0.0044546835,0.00040226593],"about_ca_topic_score_codex":0.00014617629,"about_ca_topic_score_gemma":0.00003874537,"teacher_disagreement_score":0.7353667,"about_ca_system_score_codex":0.00009916842,"about_ca_system_score_gemma":0.0009250186,"threshold_uncertainty_score":0.990904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14273241,0.00026897952,0.84768736,0.00015964988,0.00022903395,0.00076070224,0.0000033454417,0.00017417474,0.0079843635],"genre_scores_gemma":[0.6926812,0.000056833996,0.30707014,0.0000073070464,0.000066050525,0.000022885655,8.1419574e-7,0.000024067524,0.00007071249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868405,0.00011075175,0.00041116547,0.00009372566,0.00037770692,0.00032259553],"domain_scores_gemma":[0.99874836,0.000099199264,0.000037267673,0.00013645872,0.0008126678,0.00016603418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880494,0.00009509427,0.00019897173,0.0003745774,0.00018457287,0.000085931315,0.00021228516,0.000028693801,0.00012657481],"category_scores_gemma":[0.00034898028,0.00007865444,0.0000648874,0.0007724771,0.00025140028,0.0003390519,0.00003535572,0.0004885405,0.00003509285],"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.00004107261,0.00064005173,0.0005070441,0.00013454047,0.0003100927,0.00004481035,0.0298766,0.27863777,0.004604815,0.0035054614,0.00029904273,0.6813987],"study_design_scores_gemma":[0.000965432,0.002105522,0.0005549016,0.00034546066,0.00004272552,0.00022759794,0.015511943,0.9673388,0.0061862883,0.00053121365,0.0056652552,0.0005248505],"about_ca_topic_score_codex":0.000053860073,"about_ca_topic_score_gemma":0.000021927039,"teacher_disagreement_score":0.68870103,"about_ca_system_score_codex":0.00008382089,"about_ca_system_score_gemma":0.00008944294,"threshold_uncertainty_score":0.3207435},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019618627,0.00017063937,0.97830224,0.0008262228,0.000093913695,0.0005560065,0.0000075510147,0.00004683917,0.00037798175],"genre_scores_gemma":[0.53949267,0.00019297455,0.45974198,0.00003694655,0.0001441146,0.00011090365,0.00001049157,0.000038962367,0.00023096458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986541,0.00012300207,0.00041644712,0.00010493567,0.0003654527,0.00033604781],"domain_scores_gemma":[0.9982326,0.00012215626,0.000045483717,0.00014678031,0.0012903315,0.00016267378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792157,0.00009758362,0.0001888803,0.000249952,0.00022286673,0.0003194941,0.00019088827,0.000032036412,0.00015792492],"category_scores_gemma":[0.00009868884,0.000087242224,0.00006454567,0.0008008621,0.00012743428,0.000513528,0.000019767667,0.00025987954,0.000022929486],"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.000003109927,0.000038254853,0.000035667166,0.000009206074,0.000038799746,8.850566e-7,0.00045780276,0.8976051,0.00062527903,0.00013557174,0.00093959563,0.10011073],"study_design_scores_gemma":[0.0004042574,0.00035778122,0.00003980881,0.00003982534,0.000008059431,0.000022077636,0.00078232476,0.9956167,0.0012734955,0.00006739428,0.001285996,0.00010228644],"about_ca_topic_score_codex":0.000051353527,"about_ca_topic_score_gemma":0.000006746508,"teacher_disagreement_score":0.51987404,"about_ca_system_score_codex":0.0000963984,"about_ca_system_score_gemma":0.00011049947,"threshold_uncertainty_score":0.35576347},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5303258,0.00004852634,0.46816722,0.0012305672,0.00002613391,0.00005818993,0.0000027503536,0.0000016908886,0.00013916528],"genre_scores_gemma":[0.94634897,0.000016567765,0.053144112,0.00008830428,0.00012501943,0.000002737443,9.3020043e-7,0.0000067307515,0.00026663166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552006,0.0012729595,0.00082906854,0.0002719059,0.001832914,0.00027311358],"domain_scores_gemma":[0.99208236,0.0032163928,0.00021503479,0.0004189705,0.0038825797,0.00018464468],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.017964488,0.000080929254,0.0004659969,0.0025083928,0.0007335504,0.0007831098,0.00060058275,0.000023899556,0.000071608665],"category_scores_gemma":[0.011659969,0.00005637587,0.00022008772,0.006140352,0.0006956152,0.00040103024,0.00007715257,0.00023935597,0.000010195279],"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.000093711715,0.00016583789,0.026356379,0.0000022573274,0.00059982965,0.0000050364647,0.0018227039,0.812909,0.013792409,0.007845857,0.00091831986,0.13548867],"study_design_scores_gemma":[0.00020982766,0.0005213711,0.0042096986,0.0000064276956,0.00018318265,0.000023344632,0.0026375796,0.98786837,0.0003954782,0.0010834135,0.002770879,0.00009043824],"about_ca_topic_score_codex":0.00021350714,"about_ca_topic_score_gemma":0.00027623362,"teacher_disagreement_score":0.41602322,"about_ca_system_score_codex":0.000061674305,"about_ca_system_score_gemma":0.0003106312,"threshold_uncertainty_score":0.99666524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07623229,0.000061713465,0.91901124,0.004268632,0.000048648555,0.00029668034,9.899844e-7,0.000012185958,0.00006764951],"genre_scores_gemma":[0.636519,0.000014120316,0.3632484,0.00004747626,0.000037248094,0.00005039848,0.0000012080716,0.0000044557487,0.00007767313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978107,0.00050699257,0.000507896,0.00019792521,0.0006289182,0.00034753216],"domain_scores_gemma":[0.99724853,0.00016951667,0.00010042455,0.00019833115,0.0021465172,0.0001366898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322678,0.00008158195,0.00018166655,0.0009329851,0.0004631665,0.00052982976,0.00051251036,0.000021170481,0.00005051732],"category_scores_gemma":[0.00046489638,0.0000657579,0.00006954264,0.0029348626,0.00015154661,0.00061568,0.00014617032,0.00037640508,0.000042063515],"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":[9.852347e-7,0.00026391563,0.0005216578,0.0000015124641,0.000024107696,0.0000023648113,0.0017709935,0.9566311,0.0012757677,0.004664873,0.0000407101,0.034802012],"study_design_scores_gemma":[0.00024114762,0.0001758487,0.0040091486,0.00002088176,0.0000024763171,0.000018986315,0.0009045728,0.9943717,0.000049907623,0.00004107077,0.00008780283,0.00007644388],"about_ca_topic_score_codex":0.0013515824,"about_ca_topic_score_gemma":0.00023469319,"teacher_disagreement_score":0.5602867,"about_ca_system_score_codex":0.00025385027,"about_ca_system_score_gemma":0.00048892276,"threshold_uncertainty_score":0.51091605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.890484,0.0001289847,0.10661632,0.0002780046,0.000036467412,0.00031926896,6.9654664e-7,0.0000043199834,0.0021319434],"genre_scores_gemma":[0.8244723,0.000023222266,0.17537366,0.000012560407,0.000030336207,0.000018226256,0.0000011259492,0.0000044974195,0.00006407274],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99792624,0.00035930914,0.00053133216,0.00012224168,0.00064529356,0.00041561603],"domain_scores_gemma":[0.9984145,0.000088565124,0.00017088327,0.00018953216,0.0010455254,0.00009099376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003066366,0.00007639567,0.00026551436,0.0007801976,0.00012416288,0.000051554398,0.00048591747,0.00002610315,0.000009627856],"category_scores_gemma":[0.00014350742,0.000059663867,0.000043181877,0.002586324,0.00019113424,0.0006747072,0.00009396947,0.00028675195,0.000001189314],"study_design_candidate":"observational","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.00084545783,0.009150163,0.22228733,0.0005478748,0.000293971,0.00014858697,0.08091901,0.26589268,0.009355201,0.12154936,0.0040328256,0.28497753],"study_design_scores_gemma":[0.0059355297,0.010527294,0.52319974,0.00046533238,0.00003423729,0.0006117338,0.055619206,0.29802278,0.09332299,0.00045855055,0.010606721,0.0011958942],"about_ca_topic_score_codex":0.000373551,"about_ca_topic_score_gemma":0.0000114761115,"teacher_disagreement_score":0.3009124,"about_ca_system_score_codex":0.00018724737,"about_ca_system_score_gemma":0.001544763,"threshold_uncertainty_score":0.27403432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89972067,0.000022632683,0.09883249,0.000828674,0.000030230174,0.00027806126,0.000020317486,0.0000011926982,0.00026572478],"genre_scores_gemma":[0.95587415,0.0000056482872,0.043960445,0.00008072449,0.000026311274,0.000025351905,0.000013925441,0.0000049268633,0.00000853904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894905,0.007670991,0.0011180793,0.00036051054,0.001122633,0.00023729072],"domain_scores_gemma":[0.98840606,0.006850748,0.00031804814,0.0010930115,0.0032340563,0.000098064214],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.064873144,0.00008839059,0.0005145857,0.0023419657,0.00036786334,0.00012489322,0.0017308821,0.000025219575,0.00027716867],"category_scores_gemma":[0.005550279,0.000053956086,0.00011193161,0.0039929925,0.00097429496,0.0004353255,0.00013190304,0.00037495897,0.000004219401],"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.00069472165,0.000811332,0.02171287,0.0000034612779,0.00027531254,0.00003926326,0.006498404,0.804012,0.0001836883,0.002561429,0.000026179681,0.16318133],"study_design_scores_gemma":[0.00035342143,0.0010011297,0.034151223,0.000012564051,0.0001200554,0.000036056572,0.008414438,0.95528084,0.00023061887,0.00025242256,0.00008798118,0.000059264665],"about_ca_topic_score_codex":0.00046475444,"about_ca_topic_score_gemma":0.0026123421,"teacher_disagreement_score":0.16312207,"about_ca_system_score_codex":0.00010110742,"about_ca_system_score_gemma":0.0011234889,"threshold_uncertainty_score":0.9629099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98904884,0.000015637417,0.007790276,0.001160825,0.00007199373,0.00013419407,0.000020408634,6.6075745e-7,0.001757152],"genre_scores_gemma":[0.99928606,0.0000032735086,0.00018278924,0.000006045663,0.000110791065,0.000004340669,0.00000529811,0.0000029276682,0.00039846424],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984564,0.00039509745,0.0003024828,0.00006206035,0.0006218561,0.00016205746],"domain_scores_gemma":[0.9981149,0.00021882841,0.0001229109,0.00021254343,0.0012810754,0.000049785165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012168338,0.000040491166,0.00011428327,0.00004126499,0.00032721512,0.000112664515,0.00032400578,0.0000065860227,0.0005672023],"category_scores_gemma":[0.00014545901,0.000020039563,0.00009076847,0.0007194988,0.000818787,0.00021147923,0.000089855035,0.00022432538,0.000013956058],"study_design_candidate":"observational","study_design_consensus":"observational","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.0002027245,0.00082720706,0.5112224,0.000027722097,0.00049757137,6.412029e-7,0.0041751727,0.028578904,0.08160602,0.08731992,0.055043828,0.23049788],"study_design_scores_gemma":[0.0014775672,0.0013973396,0.75199574,0.0003100652,0.00006998375,0.00002372471,0.102017365,0.018451054,0.10346308,0.014306554,0.006175184,0.00031232045],"about_ca_topic_score_codex":0.0020411937,"about_ca_topic_score_gemma":0.000009551033,"teacher_disagreement_score":0.24077335,"about_ca_system_score_codex":0.000018998247,"about_ca_system_score_gemma":0.00029519893,"threshold_uncertainty_score":0.6210467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95812815,0.000048604965,0.032075744,0.005493396,0.00037212658,0.0005329758,0.000008418703,0.000017208295,0.00332336],"genre_scores_gemma":[0.9936201,0.000013271177,0.004260301,0.0003339204,0.0010495349,0.000059253427,0.000027432598,0.000017306658,0.0006188949],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997989,0.00007356892,0.0006411016,0.00014268295,0.00064000854,0.000513628],"domain_scores_gemma":[0.9977461,0.00014157387,0.00010339347,0.00022073697,0.0017302246,0.00005796209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041491017,0.000104322186,0.00020456863,0.0008385828,0.0007572406,0.0003122488,0.00039266358,0.000018017869,0.0007722218],"category_scores_gemma":[0.0016757012,0.00009011591,0.00012267099,0.0009014496,0.00017679384,0.0018565994,0.00018938674,0.00029712552,0.00014724815],"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.0012315642,0.0046519716,0.029589083,0.00024547038,0.0011087027,0.000025523283,0.00993516,0.11982303,0.013881099,0.2988375,0.21093623,0.30973464],"study_design_scores_gemma":[0.003664299,0.0014656672,0.038000997,0.00035455753,0.00025282818,0.000044839093,0.11420622,0.10311554,0.0010197811,0.0015983914,0.73516095,0.0011159499],"about_ca_topic_score_codex":0.0010012399,"about_ca_topic_score_gemma":0.00039291958,"teacher_disagreement_score":0.5242247,"about_ca_system_score_codex":0.00010525194,"about_ca_system_score_gemma":0.00006759197,"threshold_uncertainty_score":0.8455288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09256205,0.00034284714,0.90602815,0.00029924122,0.00015934955,0.00022376001,0.000012591703,0.000036516358,0.0003355081],"genre_scores_gemma":[0.6097782,0.000011344309,0.38983843,0.000014658651,0.00023078008,0.00002212706,0.000012786071,0.000027606857,0.00006406707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848634,0.00011994712,0.00045910114,0.00011405631,0.0004858122,0.00033475005],"domain_scores_gemma":[0.99781656,0.00034369668,0.000058305704,0.00013113931,0.0014134952,0.00023682768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015614158,0.00011866313,0.00026006385,0.00043762152,0.00019588105,0.00017969433,0.00023134978,0.00003373553,0.000016159793],"category_scores_gemma":[0.0008199637,0.000107347616,0.000054717388,0.0005638541,0.00014641134,0.00027979986,0.000032248452,0.00043479892,0.000011063379],"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.00003869182,0.000040209507,0.00003207272,0.000013422743,0.000055545916,0.0000032745331,0.003328035,0.9897944,0.00037151764,0.00011150431,0.000066345456,0.0061449795],"study_design_scores_gemma":[0.00059495727,0.0008028712,0.0000073002147,0.00007530549,0.000011802163,0.00005254016,0.010822366,0.9868035,0.0005718541,0.000081422586,0.00005482017,0.000121298974],"about_ca_topic_score_codex":0.000065465494,"about_ca_topic_score_gemma":0.000028433464,"teacher_disagreement_score":0.51721615,"about_ca_system_score_codex":0.00018002577,"about_ca_system_score_gemma":0.00021118132,"threshold_uncertainty_score":0.43775088},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96396637,0.000270189,0.013748787,0.0002921928,0.00021942283,0.00025572884,0.00000705173,0.00003130945,0.021208975],"genre_scores_gemma":[0.98940814,0.00021281137,0.009524322,0.000024432607,0.00025219875,0.000022155178,0.0000024880478,0.00004281273,0.0005106186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785817,0.00042632894,0.0005722846,0.00014277553,0.0005305941,0.00046984077],"domain_scores_gemma":[0.9989128,0.00008939474,0.00005337265,0.0002622135,0.0004834214,0.00019879539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017838315,0.00013621358,0.0002818778,0.0014173697,0.00007948415,0.000076873315,0.0003467413,0.000049944374,0.00024893138],"category_scores_gemma":[0.00025457988,0.00012905264,0.00005103603,0.0021672347,0.00014901326,0.00025982148,0.000033381097,0.0006311969,0.0000074680606],"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.000066733344,0.00016806975,0.0041704336,0.000016144897,0.00015120476,0.00016146016,0.0028405937,0.97079283,0.0078114527,0.0013999209,0.0052150185,0.007206157],"study_design_scores_gemma":[0.0012568962,0.001391532,0.01900881,0.00012877812,0.000023793378,0.00058308546,0.003207268,0.96637046,0.006103448,0.0000814482,0.0012392652,0.0006052152],"about_ca_topic_score_codex":0.0021715986,"about_ca_topic_score_gemma":0.00037518214,"teacher_disagreement_score":0.025441818,"about_ca_system_score_codex":0.00044216964,"about_ca_system_score_gemma":0.00071458414,"threshold_uncertainty_score":0.5262614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61343026,0.000099634744,0.38508788,0.00023502778,0.00029099375,0.00062958733,0.0000044011317,0.000034999928,0.0001872237],"genre_scores_gemma":[0.976585,0.00004038301,0.022749241,0.0000032817632,0.0005088855,0.00006907575,0.0000019045027,0.000025643796,0.00001664062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984717,0.00028769753,0.00037215897,0.00012942406,0.00046883998,0.00027017493],"domain_scores_gemma":[0.9978431,0.00008892239,0.00007039636,0.00042941398,0.001436606,0.00013159518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005756536,0.00009020644,0.00021948502,0.0003189218,0.00076600054,0.00028450624,0.00032356492,0.000045616398,0.000007832507],"category_scores_gemma":[0.00063261925,0.00008095776,0.0000805455,0.00024460434,0.00014991977,0.00038362603,0.000031737738,0.00032571124,0.000002194959],"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.000056615747,0.000022914677,0.00012732069,0.000026451138,0.000041197723,0.0000018118084,0.00033435156,0.8548483,0.053247027,0.00015398861,0.0010005243,0.09013949],"study_design_scores_gemma":[0.00019759021,0.0005763108,0.00053457153,0.00011944132,0.000023734701,0.000079705744,0.0007969031,0.9902081,0.007190195,0.000034499128,0.0001384371,0.000100520985],"about_ca_topic_score_codex":0.0002523174,"about_ca_topic_score_gemma":0.000014457533,"teacher_disagreement_score":0.36315468,"about_ca_system_score_codex":0.00059986586,"about_ca_system_score_gemma":0.00017834785,"threshold_uncertainty_score":0.5891534},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010702851,0.99379295,0.00009871048,0.00045683404,0.0002709558,0.0010257838,0.0000043507453,0.000016932567,0.0042264545],"genre_scores_gemma":[0.00028253335,0.99685895,0.00015426183,0.00018203609,0.001409146,0.000070890455,0.000029443823,0.00006601471,0.000946713],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689436,0.00032471778,0.0010824106,0.00034081814,0.0009405404,0.0004171527],"domain_scores_gemma":[0.99721146,0.00006068805,0.00063416245,0.00041295798,0.0016151094,0.000065603796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002975177,0.00033000208,0.0014667489,0.0012060707,0.00036347634,0.00034453333,0.0006521423,0.00005149841,0.0004106537],"category_scores_gemma":[0.00027031355,0.00022111973,0.00024134145,0.001908918,0.00063104014,0.0006592735,0.00026697593,0.00060353486,0.00043540073],"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.000046331876,0.00023439813,0.0002240905,0.12862372,0.001186157,0.00025132185,0.000103110775,0.000010670201,3.3210378e-7,0.009172048,0.26201606,0.5981317],"study_design_scores_gemma":[0.00014739727,0.00023276886,0.000004037854,0.041035764,0.00048396992,0.00009559437,0.0010909915,0.000092211056,1.6526325e-8,0.0000033685214,0.95657676,0.00023710962],"about_ca_topic_score_codex":0.00037397622,"about_ca_topic_score_gemma":0.00014111961,"teacher_disagreement_score":0.6945607,"about_ca_system_score_codex":0.00017950522,"about_ca_system_score_gemma":0.00033213155,"threshold_uncertainty_score":0.9017001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529416,0.0000061082847,0.84589875,0.00023534842,0.000017194243,0.0007521462,0.0000053871827,0.000022510978,0.00012098084],"genre_scores_gemma":[0.6832806,0.0000029982211,0.3165184,0.000008217506,0.00006951966,0.0000793212,0.00001642583,0.000015939193,0.000008578459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989943,0.000046124653,0.00038366424,0.00008905747,0.00030330993,0.00018358146],"domain_scores_gemma":[0.9979832,0.000058388334,0.00005625984,0.00010094436,0.001693718,0.00010745571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058693107,0.0000741696,0.00017630232,0.00025764274,0.00011722883,0.000070109265,0.000113048554,0.000021137526,0.000005459139],"category_scores_gemma":[0.00006900431,0.000059051457,0.00003149469,0.0008150821,0.00012932305,0.00020267269,0.000015247747,0.00010281541,0.0000056587924],"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.00044640075,0.00022961317,0.00023120371,0.00022126839,0.00011073807,6.2500095e-7,0.005964666,0.6337084,0.010424015,0.0022762702,0.0003023458,0.34608448],"study_design_scores_gemma":[0.00040772156,0.005152408,0.000083802996,0.00013016244,0.000014836816,0.00001056983,0.0014485258,0.98902893,0.0022689665,0.00017631413,0.0011734195,0.00010436406],"about_ca_topic_score_codex":0.00001616027,"about_ca_topic_score_gemma":0.00004918349,"teacher_disagreement_score":0.530339,"about_ca_system_score_codex":0.000053733325,"about_ca_system_score_gemma":0.00005898779,"threshold_uncertainty_score":0.24080487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41552946,0.00043490855,0.5803069,0.002077956,0.000096234944,0.00031716848,0.0000058123865,0.00007993548,0.001151664],"genre_scores_gemma":[0.767467,0.00005934256,0.23211926,0.00004553191,0.00020430925,0.000017006942,0.0000026632074,0.000032737404,0.000052128547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827754,0.00051426695,0.00034081988,0.00015108992,0.0004291979,0.0002871036],"domain_scores_gemma":[0.99919647,0.00017169205,0.000015954784,0.00020111364,0.0002441511,0.00017064034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034946639,0.00009237679,0.0001468239,0.00031038816,0.00030316028,0.00044833773,0.00028058185,0.000020631107,0.000021254378],"category_scores_gemma":[0.00007961147,0.000067564106,0.0000320702,0.001195932,0.00011837855,0.00036343446,0.000055454693,0.0005878104,0.000011534257],"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.0000066833054,0.00003001236,0.0001929205,0.000018418159,0.000048310736,0.000004907759,0.0038553893,0.8373274,0.01316436,0.00042320855,0.0005760243,0.14435236],"study_design_scores_gemma":[0.00008184001,0.00031363041,0.00038374626,0.000040511834,0.000010299071,0.00009475649,0.0032111334,0.9930301,0.0009007724,0.000026499289,0.0018177159,0.000089041154],"about_ca_topic_score_codex":0.000102918435,"about_ca_topic_score_gemma":0.000016314165,"teacher_disagreement_score":0.35193756,"about_ca_system_score_codex":0.00011404275,"about_ca_system_score_gemma":0.00009038626,"threshold_uncertainty_score":0.4323331},"labels":[],"label_agreement":null}]}