{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":15,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":15,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"e35e17daf8d4","filters":{"venue":"American Journal of Operations Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.109670152862659,"gpt":0.3538734093731688,"spread":0.2442032565105098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009880494,0.00009509427,0.0001989717,0.0003745774,0.0001845729,0.00008593131,0.0002122852,0.0000286938,0.0001265748],"category_scores_gemma":[0.0003489803,0.00007865444,0.0000648874,0.0007724771,0.0002514003,0.0003390519,0.00003535572,0.0004885405,0.00003509285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008382089,"about_ca_system_score_gemma":0.00008944294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005386007,"about_ca_topic_score_gemma":0.00002192704,"domain_scores_codex":[0.998684,0.0001107518,0.0004111655,0.00009372566,0.0003777069,0.0003225955],"domain_scores_gemma":[0.9987484,0.00009919926,0.00003726767,0.0001364587,0.0008126678,0.0001660342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004107261,0.0006400517,0.0005070441,0.0001345405,0.0003100927,0.00004481035,0.0298766,0.2786378,0.004604815,0.003505461,0.0002990427,0.6813987],"study_design_scores_gemma":[0.000965432,0.002105522,0.0005549016,0.0003454607,0.00004272552,0.0002275979,0.01551194,0.9673388,0.006186288,0.0005312136,0.005665255,0.0005248505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1427324,0.0002689795,0.8476874,0.0001596499,0.0002290339,0.0007607022,0.000003345442,0.0001741747,0.007984363],"genre_scores_gemma":[0.6926812,0.000056834,0.3070701,0.000007307046,0.00006605052,0.00002288566,8.141957e-7,0.00002406752,0.00007071249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.688701,"threshold_uncertainty_score":0.3207435,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03452771659394198,"gpt":0.3214010978096618,"spread":0.2868733812157198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007792157,0.00009758362,0.0001888803,0.000249952,0.0002228667,0.0003194941,0.0001908883,0.00003203641,0.0001579249],"category_scores_gemma":[0.00009868884,0.00008724222,0.00006454567,0.0008008621,0.0001274343,0.000513528,0.00001976767,0.0002598795,0.00002292949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000963984,"about_ca_system_score_gemma":0.0001104995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005135353,"about_ca_topic_score_gemma":0.000006746508,"domain_scores_codex":[0.9986541,0.0001230021,0.0004164471,0.0001049357,0.0003654527,0.0003360478],"domain_scores_gemma":[0.9982326,0.0001221563,0.00004548372,0.0001467803,0.001290331,0.0001626738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003109927,0.00003825485,0.00003566717,0.000009206074,0.00003879975,8.850566e-7,0.0004578028,0.8976051,0.000625279,0.0001355717,0.0009395956,0.1001107],"study_design_scores_gemma":[0.0004042574,0.0003577812,0.00003980881,0.00003982534,0.000008059431,0.00002207764,0.0007823248,0.9956167,0.001273495,0.00006739428,0.001285996,0.0001022864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01961863,0.0001706394,0.9783022,0.0008262228,0.0000939137,0.0005560065,0.000007551015,0.00004683917,0.0003779817],"genre_scores_gemma":[0.5394927,0.0001929745,0.459742,0.00003694655,0.0001441146,0.0001109037,0.00001049157,0.00003896237,0.0002309646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.519874,"threshold_uncertainty_score":0.3557635,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07852591409686466,"gpt":0.3622887004825126,"spread":0.2837627863856479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732268,0.00008158195,0.0001816665,0.0009329851,0.0004631665,0.0005298298,0.0005125104,0.00002117048,0.00005051732],"category_scores_gemma":[0.0004648964,0.0000657579,0.00006954264,0.002934863,0.0001515466,0.00061568,0.0001461703,0.0003764051,0.00004206352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002538503,"about_ca_system_score_gemma":0.0004889228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001351582,"about_ca_topic_score_gemma":0.0002346932,"domain_scores_codex":[0.9978107,0.0005069926,0.000507896,0.0001979252,0.0006289182,0.0003475322],"domain_scores_gemma":[0.9972485,0.0001695167,0.0001004245,0.0001983312,0.002146517,0.0001366898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.852347e-7,0.0002639156,0.0005216578,0.000001512464,0.0000241077,0.000002364811,0.001770993,0.9566311,0.001275768,0.004664873,0.0000407101,0.03480201],"study_design_scores_gemma":[0.0002411476,0.0001758487,0.004009149,0.00002088176,0.000002476317,0.00001898631,0.0009045728,0.9943717,0.00004990762,0.00004107077,0.00008780283,0.00007644388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07623229,0.00006171346,0.9190112,0.004268632,0.00004864856,0.0002966803,9.899844e-7,0.00001218596,0.00006764951],"genre_scores_gemma":[0.636519,0.00001412032,0.3632484,0.00004747626,0.00003724809,0.00005039848,0.000001208072,0.000004455749,0.00007767313],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5602867,"threshold_uncertainty_score":0.5109161,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06883002560422653,"gpt":0.3539966029945644,"spread":0.2851665773903378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003066366,0.00007639567,0.0002655144,0.0007801976,0.0001241629,0.0000515544,0.0004859175,0.00002610315,0.000009627856],"category_scores_gemma":[0.0001435074,0.00005966387,0.00004318188,0.002586324,0.0001911342,0.0006747072,0.00009396947,0.000286752,0.000001189314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001872474,"about_ca_system_score_gemma":0.001544763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000373551,"about_ca_topic_score_gemma":0.00001147611,"domain_scores_codex":[0.9979262,0.0003593091,0.0005313322,0.0001222417,0.0006452936,0.000415616],"domain_scores_gemma":[0.9984145,0.00008856512,0.0001708833,0.0001895322,0.001045525,0.00009099376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0008454578,0.009150163,0.2222873,0.0005478748,0.000293971,0.000148587,0.08091901,0.2658927,0.009355201,0.1215494,0.004032826,0.2849775],"study_design_scores_gemma":[0.00593553,0.01052729,0.5231997,0.0004653324,0.00003423729,0.0006117338,0.05561921,0.2980228,0.09332299,0.0004585506,0.01060672,0.001195894],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.890484,0.0001289847,0.1066163,0.0002780046,0.00003646741,0.000319269,6.965466e-7,0.000004319983,0.002131943],"genre_scores_gemma":[0.8244723,0.00002322227,0.1753737,0.00001256041,0.00003033621,0.00001822626,0.000001125949,0.000004497419,0.00006407274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3009124,"threshold_uncertainty_score":0.2740343,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02900704029894172,"gpt":0.3727250329594432,"spread":0.3437179926605015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216834,0.00004049117,0.0001142833,0.00004126499,0.0003272151,0.0001126645,0.0003240058,0.000006586023,0.0005672023],"category_scores_gemma":[0.000145459,0.00002003956,0.00009076847,0.0007194988,0.000818787,0.0002114792,0.00008985504,0.0002243254,0.00001395606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001899825,"about_ca_system_score_gemma":0.0002951989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002041194,"about_ca_topic_score_gemma":0.000009551033,"domain_scores_codex":[0.9984564,0.0003950974,0.0003024828,0.00006206035,0.0006218561,0.0001620575],"domain_scores_gemma":[0.9981149,0.0002188284,0.0001229109,0.0002125434,0.001281075,0.00004978517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002027245,0.0008272071,0.5112224,0.0000277221,0.0004975714,6.412029e-7,0.004175173,0.0285789,0.08160602,0.08731992,0.05504383,0.2304979],"study_design_scores_gemma":[0.001477567,0.00139734,0.7519957,0.0003100652,0.00006998375,0.00002372471,0.1020174,0.01845105,0.1034631,0.01430655,0.006175184,0.0003123205],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890488,0.00001563742,0.007790276,0.001160825,0.00007199373,0.0001341941,0.00002040863,6.607575e-7,0.001757152],"genre_scores_gemma":[0.9992861,0.000003273509,0.0001827892,0.000006045663,0.0001107911,0.000004340669,0.00000529811,0.000002927668,0.0003984642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2407734,"threshold_uncertainty_score":0.6210467,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09218014604378812,"gpt":0.3742876701343237,"spread":0.2821075240905356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002975177,0.0003300021,0.001466749,0.001206071,0.0003634763,0.0003445333,0.0006521423,0.00005149841,0.0004106537],"category_scores_gemma":[0.0002703136,0.0002211197,0.0002413414,0.001908918,0.0006310401,0.0006592735,0.0002669759,0.0006035349,0.0004354007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001795052,"about_ca_system_score_gemma":0.0003321315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003739762,"about_ca_topic_score_gemma":0.0001411196,"domain_scores_codex":[0.9968944,0.0003247178,0.001082411,0.0003408181,0.0009405404,0.0004171527],"domain_scores_gemma":[0.9972115,0.00006068805,0.0006341625,0.000412958,0.001615109,0.0000656038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004633188,0.0002343981,0.0002240905,0.1286237,0.001186157,0.0002513218,0.0001031108,0.0000106702,3.321038e-7,0.009172048,0.2620161,0.5981317],"study_design_scores_gemma":[0.0001473973,0.0002327689,0.000004037854,0.04103576,0.0004839699,0.00009559437,0.001090992,0.00009221106,1.652633e-8,0.000003368521,0.9565768,0.0002371096],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001070285,0.993793,0.00009871048,0.000456834,0.0002709558,0.001025784,0.000004350745,0.00001693257,0.004226455],"genre_scores_gemma":[0.0002825334,0.996859,0.0001542618,0.0001820361,0.001409146,0.00007089046,0.00002944382,0.00006601471,0.000946713],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.6945607,"threshold_uncertainty_score":0.9017001,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3226641979201922,"gpt":0.5640352884855022,"spread":0.24137109056531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01796449,0.00008092925,0.0004659969,0.002508393,0.0007335504,0.0007831098,0.0006005827,0.00002389956,0.00007160867],"category_scores_gemma":[0.01165997,0.00005637587,0.0002200877,0.006140352,0.0006956152,0.0004010302,0.00007715257,0.000239356,0.00001019528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006167431,"about_ca_system_score_gemma":0.0003106312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002135071,"about_ca_topic_score_gemma":0.0002762336,"domain_scores_codex":[0.9955201,0.00127296,0.0008290685,0.0002719059,0.001832914,0.0002731136],"domain_scores_gemma":[0.9920824,0.003216393,0.0002150348,0.0004189705,0.00388258,0.0001846447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009371171,0.0001658379,0.02635638,0.000002257327,0.0005998297,0.000005036465,0.001822704,0.812909,0.01379241,0.007845857,0.0009183199,0.1354887],"study_design_scores_gemma":[0.0002098277,0.0005213711,0.004209699,0.000006427696,0.0001831827,0.00002334463,0.00263758,0.9878684,0.0003954782,0.001083413,0.002770879,0.00009043824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5303258,0.00004852634,0.4681672,0.001230567,0.00002613391,0.00005818993,0.000002750354,0.000001690889,0.0001391653],"genre_scores_gemma":[0.946349,0.00001656776,0.05314411,0.00008830428,0.0001250194,0.000002737443,9.302004e-7,0.000006730751,0.0002666317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4160232,"threshold_uncertainty_score":0.9966652,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.6756018683741475,"gpt":0.5818432606939765,"spread":0.09375860768017097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06487314,0.00008839059,0.0005145857,0.002341966,0.0003678633,0.0001248932,0.001730882,0.00002521958,0.0002771687],"category_scores_gemma":[0.005550279,0.00005395609,0.0001119316,0.003992992,0.000974295,0.0004353255,0.000131903,0.000374959,0.000004219401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001011074,"about_ca_system_score_gemma":0.001123489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004647544,"about_ca_topic_score_gemma":0.002612342,"domain_scores_codex":[0.9894905,0.007670991,0.001118079,0.0003605105,0.001122633,0.0002372907],"domain_scores_gemma":[0.9884061,0.006850748,0.0003180481,0.001093011,0.003234056,0.00009806421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006947216,0.000811332,0.02171287,0.000003461278,0.0002753125,0.00003926326,0.006498404,0.804012,0.0001836883,0.002561429,0.00002617968,0.1631813],"study_design_scores_gemma":[0.0003534214,0.00100113,0.03415122,0.00001256405,0.0001200554,0.00003605657,0.008414438,0.9552808,0.0002306189,0.0002524226,0.00008798118,0.00005926466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8997207,0.00002263268,0.09883249,0.000828674,0.00003023017,0.0002780613,0.00002031749,0.000001192698,0.0002657248],"genre_scores_gemma":[0.9558741,0.000005648287,0.04396044,0.00008072449,0.00002631127,0.0000253519,0.00001392544,0.000004926863,0.00000853904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1631221,"threshold_uncertainty_score":0.9629099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.3821685235789269,"gpt":0.557091714635482,"spread":0.1749231910565551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01209517,0.00007270204,0.0003555249,0.001843849,0.0002837705,0.0001784567,0.0005582891,0.00003190089,0.00001044317],"category_scores_gemma":[0.01737312,0.00005228795,0.00009431776,0.00329039,0.001480125,0.0003611707,0.0001035118,0.0002997609,0.000003936929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009916842,"about_ca_system_score_gemma":0.0009250186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001461763,"about_ca_topic_score_gemma":0.00003874537,"domain_scores_codex":[0.995703,0.0009971352,0.0008590776,0.0002258008,0.002000519,0.0002144492],"domain_scores_gemma":[0.9924413,0.002459417,0.0003573229,0.000304298,0.00416994,0.0002677131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007946696,0.000833477,0.07607545,0.000009785718,0.0002745182,0.00001472672,0.02364597,0.1552381,0.02949124,0.01284922,0.00161319,0.6991596],"study_design_scores_gemma":[0.002512358,0.005106622,0.01699018,0.0001404312,0.000109897,0.0002136313,0.04900116,0.8906049,0.01550866,0.01495528,0.004454684,0.0004022659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8793906,0.0001279638,0.1188789,0.001282259,0.0000327197,0.0001566043,0.000009171431,0.000001884976,0.0001199259],"genre_scores_gemma":[0.9318096,0.000018035,0.0680149,0.00002585083,0.00006542878,0.000004489589,9.148234e-7,0.000007165285,0.00005362389],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7353667,"threshold_uncertainty_score":0.990904,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08582483862008403,"gpt":0.4240188789983182,"spread":0.3381940403782342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005756536,0.00009020644,0.000219485,0.0003189218,0.0007660005,0.0002845062,0.0003235649,0.0000456164,0.000007832507],"category_scores_gemma":[0.0006326193,0.00008095776,0.0000805455,0.0002446043,0.0001499198,0.000383626,0.00003173774,0.0003257112,0.000002194959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005998659,"about_ca_system_score_gemma":0.0001783479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002523174,"about_ca_topic_score_gemma":0.00001445753,"domain_scores_codex":[0.9984717,0.0002876975,0.000372159,0.0001294241,0.00046884,0.0002701749],"domain_scores_gemma":[0.9978431,0.00008892239,0.00007039636,0.000429414,0.001436606,0.0001315952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005661575,0.00002291468,0.0001273207,0.00002645114,0.00004119772,0.000001811808,0.0003343516,0.8548483,0.05324703,0.0001539886,0.001000524,0.09013949],"study_design_scores_gemma":[0.0001975902,0.0005763108,0.0005345715,0.0001194413,0.0000237347,0.00007970574,0.0007969031,0.9902081,0.007190195,0.00003449913,0.0001384371,0.000100521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6134303,0.00009963474,0.3850879,0.0002350278,0.0002909937,0.0006295873,0.000004401132,0.00003499993,0.0001872237],"genre_scores_gemma":[0.976585,0.00004038301,0.02274924,0.000003281763,0.0005088855,0.00006907575,0.000001904503,0.0000256438,0.00001664062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3631547,"threshold_uncertainty_score":0.5891534,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07349344966246948,"gpt":0.3500015452314819,"spread":0.2765080955690125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561416,0.0001186631,0.0002600639,0.0004376215,0.000195881,0.0001796943,0.0002313498,0.00003373553,0.00001615979],"category_scores_gemma":[0.0008199637,0.0001073476,0.00005471739,0.0005638541,0.0001464113,0.0002797999,0.00003224845,0.0004347989,0.00001106338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001800258,"about_ca_system_score_gemma":0.0002111813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006546549,"about_ca_topic_score_gemma":0.00002843346,"domain_scores_codex":[0.9984863,0.0001199471,0.0004591011,0.0001140563,0.0004858122,0.00033475],"domain_scores_gemma":[0.9978166,0.0003436967,0.0000583057,0.0001311393,0.001413495,0.0002368277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003869182,0.00004020951,0.00003207272,0.00001342274,0.00005554592,0.000003274533,0.003328035,0.9897944,0.0003715176,0.0001115043,0.00006634546,0.00614498],"study_design_scores_gemma":[0.0005949573,0.0008028712,0.000007300215,0.00007530549,0.00001180216,0.00005254016,0.01082237,0.9868035,0.0005718541,0.00008142259,0.00005482017,0.000121299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09256205,0.0003428471,0.9060282,0.0002992412,0.0001593496,0.00022376,0.0000125917,0.00003651636,0.0003355081],"genre_scores_gemma":[0.6097782,0.00001134431,0.3898384,0.00001465865,0.0002307801,0.00002212706,0.00001278607,0.00002760686,0.00006406707],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5172161,"threshold_uncertainty_score":0.4377509,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0409485687936573,"gpt":0.3257403080883186,"spread":0.2847917392946612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783832,0.0001362136,0.0002818778,0.00141737,0.00007948415,0.00007687332,0.0003467413,0.00004994437,0.0002489314],"category_scores_gemma":[0.0002545799,0.0001290526,0.00005103603,0.002167235,0.0001490133,0.0002598215,0.0000333811,0.0006311969,0.000007468061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004421696,"about_ca_system_score_gemma":0.0007145841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002171599,"about_ca_topic_score_gemma":0.0003751821,"domain_scores_codex":[0.9978582,0.0004263289,0.0005722846,0.0001427755,0.0005305941,0.0004698408],"domain_scores_gemma":[0.9989128,0.00008939474,0.00005337265,0.0002622135,0.0004834214,0.0001987954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006673334,0.0001680697,0.004170434,0.0000161449,0.0001512048,0.0001614602,0.002840594,0.9707928,0.007811453,0.001399921,0.005215019,0.007206157],"study_design_scores_gemma":[0.001256896,0.001391532,0.01900881,0.0001287781,0.00002379338,0.0005830855,0.003207268,0.9663705,0.006103448,0.0000814482,0.001239265,0.0006052152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9639664,0.000270189,0.01374879,0.0002921928,0.0002194228,0.0002557288,0.00000705173,0.00003130945,0.02120898],"genre_scores_gemma":[0.9894081,0.0002128114,0.009524322,0.00002443261,0.0002521987,0.00002215518,0.000002488048,0.00004281273,0.0005106186],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02544182,"threshold_uncertainty_score":0.5262614,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1427099034347518,"gpt":0.4512886728739023,"spread":0.3085787694391505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004149102,0.0001043222,0.0002045686,0.0008385828,0.0007572406,0.0003122488,0.0003926636,0.00001801787,0.0007722218],"category_scores_gemma":[0.001675701,0.00009011591,0.000122671,0.0009014496,0.0001767938,0.001856599,0.0001893867,0.0002971255,0.0001472482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001052519,"about_ca_system_score_gemma":0.00006759197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100124,"about_ca_topic_score_gemma":0.0003929196,"domain_scores_codex":[0.997989,0.00007356892,0.0006411016,0.000142683,0.0006400085,0.000513628],"domain_scores_gemma":[0.9977461,0.0001415739,0.0001033935,0.000220737,0.001730225,0.00005796209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001231564,0.004651972,0.02958908,0.0002454704,0.001108703,0.00002552328,0.00993516,0.119823,0.0138811,0.2988375,0.2109362,0.3097346],"study_design_scores_gemma":[0.003664299,0.001465667,0.038001,0.0003545575,0.0002528282,0.00004483909,0.1142062,0.1031155,0.001019781,0.001598391,0.7351609,0.00111595],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9581282,0.00004860496,0.03207574,0.005493396,0.0003721266,0.0005329758,0.000008418703,0.00001720829,0.00332336],"genre_scores_gemma":[0.9936201,0.00001327118,0.004260301,0.0003339204,0.001049535,0.00005925343,0.0000274326,0.00001730666,0.0006188949],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5242247,"threshold_uncertainty_score":0.8455288,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04879858949140138,"gpt":0.3885260895847644,"spread":0.339727500093363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869311,0.0000741696,0.0001763023,0.0002576427,0.0001172288,0.00007010926,0.0001130486,0.00002113753,0.000005459139],"category_scores_gemma":[0.00006900431,0.00005905146,0.00003149469,0.0008150821,0.000129323,0.0002026727,0.00001524775,0.0001028154,0.000005658792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005373333,"about_ca_system_score_gemma":0.00005898779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001616027,"about_ca_topic_score_gemma":0.00004918349,"domain_scores_codex":[0.9989943,0.00004612465,0.0003836642,0.00008905747,0.0003033099,0.0001835815],"domain_scores_gemma":[0.9979832,0.00005838833,0.00005625984,0.0001009444,0.001693718,0.0001074557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004464008,0.0002296132,0.0002312037,0.0002212684,0.0001107381,6.25001e-7,0.005964666,0.6337084,0.01042402,0.00227627,0.0003023458,0.3460845],"study_design_scores_gemma":[0.0004077216,0.005152408,0.000083803,0.0001301624,0.00001483682,0.00001056983,0.001448526,0.9890289,0.002268967,0.0001763141,0.00117342,0.0001043641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1529416,0.000006108285,0.8458987,0.0002353484,0.00001719424,0.0007521462,0.000005387183,0.00002251098,0.0001209808],"genre_scores_gemma":[0.6832806,0.000002998221,0.3165184,0.000008217506,0.00006951966,0.0000793212,0.00001642583,0.00001593919,0.000008578459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.530339,"threshold_uncertainty_score":0.2408049,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03696489952496746,"gpt":0.370099402085067,"spread":0.3331345025600996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003494664,0.00009237679,0.0001468239,0.0003103882,0.0003031603,0.0004483377,0.0002805819,0.00002063111,0.00002125438],"category_scores_gemma":[0.00007961147,0.00006756411,0.0000320702,0.001195932,0.0001183785,0.0003634345,0.00005545469,0.0005878104,0.00001153426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140427,"about_ca_system_score_gemma":0.00009038626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001029184,"about_ca_topic_score_gemma":0.00001631416,"domain_scores_codex":[0.9982775,0.000514267,0.0003408199,0.0001510899,0.0004291979,0.0002871036],"domain_scores_gemma":[0.9991965,0.0001716921,0.00001595478,0.0002011136,0.0002441511,0.0001706403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006683305,0.00003001236,0.0001929205,0.00001841816,0.00004831074,0.000004907759,0.003855389,0.8373274,0.01316436,0.0004232085,0.0005760243,0.1443524],"study_design_scores_gemma":[0.00008184001,0.0003136304,0.0003837463,0.00004051183,0.00001029907,0.00009475649,0.003211133,0.9930301,0.0009007724,0.00002649929,0.001817716,0.00008904115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4155295,0.0004349086,0.5803069,0.002077956,0.00009623494,0.0003171685,0.000005812386,0.00007993548,0.001151664],"genre_scores_gemma":[0.767467,0.00005934256,0.2321193,0.00004553191,0.0002043093,0.00001700694,0.000002663207,0.0000327374,0.00005212855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3519376,"threshold_uncertainty_score":0.4323331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}