{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"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","author_layer_release":"2026-06-26"},"query_hash":"5511e00e3936","filters":{"venue":"International Journal of Mathematics in Operational Research"}},"results":[{"id":"W4380189073","doi":"10.1504/ijmor.2023.131383","title":"The hybrid DHP method for evaluation, ranking and selection of green suppliers in the supply chain","year":2023,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Ranking (information retrieval); Data envelopment analysis; Selection (genetic algorithm); Supply chain; Computer science; Process (computing); Order (exchange); Operations research; Supplier evaluation; Supply chain management; Mathematical optimization; Business; Machine learning; Mathematics; Marketing","authors":[{"name":"Elham Shadkam","is_ca":false},{"name":"Reza Yazdani","is_ca":false},{"name":"Mirpouya Mirmozaffari","is_ca":true},{"name":"Fatemeh Adineh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2446521541389607,"gpt":0.5615350988053223,"spread":0.3168829446663616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.1116684,0.00007762073,0.0002097957,0.001475171,0.0002485182,0.000404361,0.001403973,0.00003788628,0.00006483435],"category_scores_gemma":[0.03105294,0.00004323632,0.00009814808,0.001479476,0.0001762927,0.0002555996,0.0001148017,0.0003565638,0.000006833717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001728615,"about_ca_system_score_gemma":0.0004977328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006307899,"about_ca_topic_score_gemma":0.0004151867,"domain_scores_codex":[0.9901358,0.001388734,0.001367706,0.0001935297,0.006695052,0.0002191676],"domain_scores_gemma":[0.9691552,0.0252981,0.0003730527,0.0001530002,0.004990949,0.00002968897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007076946,0.0009690565,0.02540213,0.00006436722,0.000437744,0.00004996697,0.03267207,0.2414171,0.01084381,0.507574,0.01995079,0.1599113],"study_design_scores_gemma":[0.0007083263,0.00006607256,0.007913275,0.00006094175,0.00000818673,0.0000628793,0.004580427,0.649121,0.000536933,0.3361314,0.0007673309,0.00004317525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9209614,0.0001837503,0.04084194,0.03651282,0.0002683799,0.0007502243,0.00002496584,0.000003375819,0.0004531768],"genre_scores_gemma":[0.9891253,0.0000814825,0.01023872,0.00007086129,0.0001539953,0.00004838388,0.000005232351,0.000007736121,0.0002682664],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.407704,"threshold_uncertainty_score":0.9771089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2221027144","doi":"10.1504/ijmor.2015.072277","title":"Failure-prone manufacturing systems with setups: feasibility and optimality under various hypotheses about perturbations and setup interplay","year":2015,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Matching (statistics); Computer science; Mathematical optimization; Type (biology); Mathematics; Bellman equation; Statistics","authors":[{"name":"Vladimir Polotski","is_ca":true},{"name":"Jean‐Pierre Kenné","is_ca":true},{"name":"Ali Gharbi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09162658443519967,"gpt":0.3641170809562044,"spread":0.2724904965210048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210177,0.000127763,0.0002073879,0.0003682277,0.00006543005,0.0003888404,0.0002420601,0.00007338147,0.00002654945],"category_scores_gemma":[0.0005670348,0.0001002943,0.00002143264,0.0001077244,0.0001350541,0.0004127581,0.00007188206,0.000449553,0.000003944653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003514956,"about_ca_system_score_gemma":0.0001713624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002947748,"about_ca_topic_score_gemma":0.00004547987,"domain_scores_codex":[0.9980198,0.0001096436,0.0005011241,0.0001413295,0.001060187,0.0001678726],"domain_scores_gemma":[0.9980455,0.0005831688,0.00007879621,0.0001134315,0.001024553,0.0001545449],"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.0000964173,0.0002673962,0.003694106,0.0001290147,0.0002551123,0.00005845168,0.003914462,0.9778759,0.0001231182,0.01277853,0.0003194793,0.0004879911],"study_design_scores_gemma":[0.002121491,0.0001992774,0.00534181,0.0006308286,0.00001741235,0.001111917,0.007540621,0.9730337,0.0004841913,0.008978952,0.0002674595,0.0002723649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9184195,0.0009132737,0.07822706,0.0008867991,0.0003259279,0.0002673885,0.0000236377,0.00002564033,0.0009107291],"genre_scores_gemma":[0.9331841,0.0001525914,0.06634577,0.00002167061,0.0001367855,0.00001344524,0.000008181892,0.00002020885,0.0001172124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01476458,"threshold_uncertainty_score":0.4089881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011331359","doi":"10.1504/ijmor.2009.022881","title":"An accurate and efficient numerical method for solving Black-Scholes equation in option pricing","year":2009,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Black–Scholes model; Stencil; Variable (mathematics); Convection–diffusion equation; Applied mathematics; Mathematics; Numerical analysis; Computer science; Mathematical analysis; Econometrics","authors":[{"name":"Wenyuan Liao","is_ca":true},{"name":"Jianping Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1377901052902146,"gpt":0.4350025901049732,"spread":0.2972124848147585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722319,0.00007095913,0.0001989497,0.0006320025,0.00006715716,0.0001723521,0.0002901979,0.00005804631,0.00001415559],"category_scores_gemma":[0.00171771,0.00007288161,0.00003634509,0.0002471176,0.00003153861,0.0002988945,0.00002703275,0.0002404685,0.000006981451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001850572,"about_ca_system_score_gemma":0.00008502006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000248463,"about_ca_topic_score_gemma":0.000006551194,"domain_scores_codex":[0.998628,0.00001501038,0.000803648,0.0001705968,0.0002262386,0.0001565154],"domain_scores_gemma":[0.9985332,0.0005240899,0.0002579086,0.00007706348,0.0005583054,0.0000494372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003670039,0.0003711857,0.0002643445,0.00001190679,0.000007799751,0.000002705849,0.001172435,0.02895631,0.0005693079,0.9658102,0.000009981289,0.002787095],"study_design_scores_gemma":[0.0003978669,0.00008647949,0.004919448,0.00005497192,7.934615e-7,0.00001079248,0.0002162446,0.5566291,0.00008694208,0.4375042,0.00004308996,0.00005005582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1195278,0.0001481555,0.8776174,0.002135568,0.00006789749,0.0002141667,0.00001471027,0.000002350673,0.0002720518],"genre_scores_gemma":[0.8337779,0.00003951017,0.1659145,0.0000573654,0.0001669144,0.0000205608,0.000007002749,0.000006339279,0.000009854812],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7142501,"threshold_uncertainty_score":0.2972026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091648527","doi":"10.1504/ijmor.2013.052463","title":"Threshold results for the inventory cycle offsetting problem","year":2013,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Directorate for Computer and Information Science and Engineering","keywords":"Interval (graph theory); Constant (computer programming); Cycle count; Resource (disambiguation); Order (exchange); Mathematical optimization; Economic order quantity; Computer science; Mathematics; Operations research; Combinatorics; Economics","authors":[{"name":"Ernest S. Croot","is_ca":false},{"name":"Kai Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09863618438772116,"gpt":0.3616315983992814,"spread":0.2629954140115602,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005232221,0.00009927469,0.0001348612,0.0005806134,0.0001777661,0.0007517058,0.0009872027,0.00004188577,0.0003497353],"category_scores_gemma":[0.001645016,0.00006716059,0.00009762697,0.0002423083,0.00009478834,0.001104584,0.0002557473,0.0003298413,0.0001473386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001616209,"about_ca_system_score_gemma":0.00008644274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001271858,"about_ca_topic_score_gemma":0.00005013286,"domain_scores_codex":[0.9973252,0.00002348681,0.0007804959,0.0001344892,0.001499428,0.0002369288],"domain_scores_gemma":[0.9964686,0.000720025,0.0002924791,0.0001513055,0.002350927,0.00001666089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001343629,0.0006772347,0.002317472,0.0001605463,0.0002000668,0.00001736207,0.0007856773,0.009993955,0.0004306607,0.7695711,0.2111787,0.004532919],"study_design_scores_gemma":[0.002794631,0.0000567216,0.001898332,0.0004524157,0.00001744474,0.00001732878,0.004620668,0.4378662,0.0001183905,0.418934,0.1330148,0.0002089981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5282771,0.0007881144,0.01097072,0.2333074,0.004930905,0.005839594,0.0000276,0.00006521999,0.2157933],"genre_scores_gemma":[0.9898348,0.00004313308,0.004316474,0.001438016,0.002671519,0.000172979,0.00001760006,0.0000227164,0.001482743],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4615577,"threshold_uncertainty_score":0.7248716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129174856","doi":"10.1504/ijmor.2009.022874","title":"Transient results for M/M/1/c queues via path counting","year":2009,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"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":"Queue; Transient (computer programming); Path (computing); Mathematics; Physics; Computer science; Combinatorics; Computer network; Operating system","authors":[{"name":"Myron Hlynka","is_ca":true},{"name":"L.M. Hurajt","is_ca":true},{"name":"M. Cylwa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06898663828890524,"gpt":0.3980168945879657,"spread":0.3290302562990605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006265506,0.0001140489,0.0002256558,0.000922314,0.0001294852,0.0003523319,0.0006803157,0.00005387594,0.00005763099],"category_scores_gemma":[0.004049542,0.00009806685,0.0001319536,0.0003641571,0.00006112415,0.001103168,0.00005209917,0.0003324355,0.00002721798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001911365,"about_ca_system_score_gemma":0.00009267865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001623382,"about_ca_topic_score_gemma":0.00002693632,"domain_scores_codex":[0.9971406,0.00003495782,0.000919764,0.0001625397,0.001503215,0.0002388762],"domain_scores_gemma":[0.9952765,0.0008082576,0.0003661131,0.0001258885,0.003405676,0.00001760789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001077012,0.001317871,0.0001964609,0.00009268127,0.0001751523,0.0001167789,0.0009169157,0.04940204,0.00789153,0.9230961,0.005489843,0.01022758],"study_design_scores_gemma":[0.002445568,0.00009960026,0.0005443152,0.000488035,0.00002552679,0.00004362987,0.0008939618,0.2249158,0.000564702,0.7550057,0.01475464,0.0002185242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6724064,0.0003019389,0.2443233,0.05099457,0.00144644,0.001129413,0.00004547313,0.00005902179,0.02929345],"genre_scores_gemma":[0.9822058,0.00002368219,0.01532443,0.0006223799,0.001557217,0.00000954908,0.00002395895,0.00001420678,0.0002187453],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3097994,"threshold_uncertainty_score":0.4847973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988246090","doi":"10.1504/ijmor.2011.040027","title":"A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition","year":2011,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Flexibility (engineering); Decomposition; Computer science; Context (archaeology); Mathematical optimization; Point (geometry); Convergence (economics); Product (mathematics); Face (sociological concept); Algorithm; Mathematics; Economics","authors":[{"name":"Lila Rasekh","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2770806427203433,"gpt":0.4230390472327459,"spread":0.1459584045124027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199148,0.0001142368,0.0001750618,0.001483946,0.0001165572,0.0002324292,0.000406994,0.0000590637,0.000202803],"category_scores_gemma":[0.0004760687,0.0001048727,0.00004959517,0.0002237081,0.0001256326,0.000849166,0.0002247735,0.0002766944,0.00001548631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001803374,"about_ca_system_score_gemma":0.00004674528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005515387,"about_ca_topic_score_gemma":0.00003142127,"domain_scores_codex":[0.9984095,0.00002381415,0.0005499346,0.0001585612,0.0006586034,0.0001996269],"domain_scores_gemma":[0.9978999,0.0001484471,0.0002383361,0.00008738683,0.00160628,0.00001964053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003956654,0.002082519,0.004931078,0.0003817592,0.0004701707,0.0002123669,0.004069984,0.001747519,0.007017333,0.9560818,0.001195354,0.02141443],"study_design_scores_gemma":[0.004204515,0.0001609271,0.002274965,0.0009068237,0.0000259075,0.0001083645,0.006673064,0.8637578,0.001077743,0.1199666,0.0005602089,0.0002831179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2497872,0.00008069625,0.7463695,0.001242771,0.0005959366,0.0005451035,0.00002283147,0.00001799628,0.001337924],"genre_scores_gemma":[0.8063617,0.000006159021,0.1926584,0.0002348335,0.0005051666,0.00005953978,0.0000187752,0.00001890151,0.0001365367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8620103,"threshold_uncertainty_score":0.4276585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}