{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004356753,0.001320783,0.001591251,0.004701321,0.0008648764,0.001876457,0.001535908,0.0009476836,0.003336127],"category_scores_gemma":[0.007321496,0.0006752586,0.001391631,0.005592237,0.0007725559,0.001694694,0.001704049,0.001311646,0.0005977292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001966612,"about_ca_system_score_gemma":0.002465756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008672394,"about_ca_topic_score_gemma":0.006005614,"domain_scores_codex":[0.9950199,0.002469922,0.0002152492,0.0003745531,0.001700579,0.0002197717],"domain_scores_gemma":[0.9968172,0.00210838,0.0001607225,0.000165463,0.0006808838,0.0000673994],"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.00008832554,0.0001489304,0.002124373,0.0006503579,0.0002664206,0.0001585103,0.0002448004,0.5814344,0.00318191,0.06367772,0.003090844,0.3449334],"study_design_scores_gemma":[0.00002165975,0.00004939861,0.0004261303,0.0000344057,0.0000304175,0.0000550006,0.00007826748,0.9757636,0.001277788,0.0188797,0.003357629,0.00002600945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002617116,0.0001708326,0.9948133,0.0000758023,0.00002002208,0.0001109473,0.0001078477,0.00007198012,0.002012251],"genre_scores_gemma":[0.1822222,0.0007339725,0.8128091,0.00008627834,0.00005192614,0.0007574497,0.0003963054,0.00005476852,0.002887958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008672394,"threshold_uncertainty_score":0.02304101,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006987584,0.001701717,0.002161216,0.00125285,0.0009728475,0.002265747,0.001477544,0.002920502,0.002637669],"category_scores_gemma":[0.02271967,0.001110921,0.00179892,0.001306517,0.003459847,0.002221484,0.002352906,0.00204887,0.0002481423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001889066,"about_ca_system_score_gemma":0.001721056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005823688,"about_ca_topic_score_gemma":0.002745677,"domain_scores_codex":[0.9974667,0.001409822,0.0001001113,0.0002846921,0.0002824418,0.0004563097],"domain_scores_gemma":[0.971688,0.02354156,0.002924433,0.0003974905,0.000831342,0.0006171599],"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.0003618528,0.00006264923,0.001049628,0.0001477938,0.00006621011,0.0004117084,0.00009041153,0.9621075,0.001117524,0.03256199,0.0003596394,0.001662979],"study_design_scores_gemma":[0.00004114227,0.0001098414,0.0009273641,0.00002378014,0.00002529158,0.00003533269,0.00008315502,0.9822336,0.000326037,0.01605082,0.0001155786,0.00002809207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4037022,0.001757119,0.5784764,0.002012088,0.0001354151,0.0003223833,0.000707461,0.0001993464,0.01268754],"genre_scores_gemma":[0.9810419,0.0004495374,0.0163897,0.00007636252,0.00005154785,0.0001659551,0.0001670214,0.00002568977,0.001632107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006987584,"threshold_uncertainty_score":0.03695434,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00147734,0.0005484141,0.0008437539,0.0007284182,0.0006203877,0.0008853935,0.0009027325,0.001282529,0.00218102],"category_scores_gemma":[0.004114856,0.0003267175,0.0007355245,0.0009443423,0.000767804,0.001362139,0.0009668358,0.002059867,0.001035737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004392094,"about_ca_system_score_gemma":0.001145382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741552,"about_ca_topic_score_gemma":0.001670539,"domain_scores_codex":[0.9991857,0.0002391204,0.00004647699,0.00005938928,0.0004292866,0.00004003641],"domain_scores_gemma":[0.9989592,0.0005343965,0.0000857849,0.0001137358,0.0002582488,0.00004861689],"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.00007562694,0.0001032481,0.0008734856,0.0002791636,0.00006055922,0.0003006366,0.0001908906,0.5495051,0.01664482,0.2295252,0.006152289,0.196289],"study_design_scores_gemma":[0.00001394502,0.00001665534,0.00006575351,0.00001450819,0.000006046805,0.00007139701,0.000005774625,0.9770412,0.001411174,0.01642654,0.00491369,0.00001335892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001560204,0.0002846169,0.9965035,0.00009390807,0.0001054811,0.00002868728,0.00002037598,0.0001327595,0.001270423],"genre_scores_gemma":[0.06636384,0.0008063559,0.9281353,0.0001138653,0.0001583446,0.0001932198,0.00008229192,0.0001291827,0.004017469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00218102,"threshold_uncertainty_score":0.007813036,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004436679,0.001371602,0.002153181,0.002414094,0.001319644,0.003997577,0.003500428,0.002425291,0.01045031],"category_scores_gemma":[0.03110258,0.0006889058,0.001565439,0.00365214,0.002431085,0.006957402,0.002423728,0.004988152,0.0008451983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003964314,"about_ca_system_score_gemma":0.002448391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002608271,"about_ca_topic_score_gemma":0.00124786,"domain_scores_codex":[0.9969688,0.0006999057,0.0002153249,0.0004878433,0.001151468,0.0004766465],"domain_scores_gemma":[0.9740117,0.02111808,0.001503795,0.0008840985,0.001513448,0.0009689655],"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.0004629006,0.0001744711,0.001682651,0.0009203336,0.0001227017,0.0003212712,0.0003869817,0.3752182,0.004060187,0.5464112,0.007243453,0.06299569],"study_design_scores_gemma":[0.00007420818,0.0001119732,0.0002924287,0.00014073,0.00005524954,0.0001685012,0.00007286085,0.6991708,0.001440693,0.2946628,0.003777061,0.00003274904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03633618,0.004962856,0.9257922,0.002332103,0.0002451735,0.0001971803,0.0002446737,0.000502675,0.02938698],"genre_scores_gemma":[0.8176028,0.00815216,0.1524479,0.001317205,0.0007495067,0.0006382345,0.0006848322,0.0005515685,0.01785578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045031,"threshold_uncertainty_score":0.03495973,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004263681,0.001428682,0.00144793,0.005037667,0.001854981,0.003405117,0.003467707,0.001584377,0.009985843],"category_scores_gemma":[0.02729846,0.0007785684,0.002080656,0.003519644,0.003269716,0.009021912,0.00309401,0.003518953,0.0007863977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004096518,"about_ca_system_score_gemma":0.001768001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002192578,"about_ca_topic_score_gemma":0.001443294,"domain_scores_codex":[0.9981707,0.0005818755,0.00009690085,0.0003028006,0.0005092144,0.0003386061],"domain_scores_gemma":[0.9808072,0.01431147,0.001367229,0.001092695,0.00135068,0.001070583],"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.0001342848,0.00009670198,0.001498277,0.0001662272,0.00004358571,0.0002413227,0.0002633317,0.08732957,0.001819048,0.8943081,0.002680294,0.01141931],"study_design_scores_gemma":[0.00002143872,0.00005524125,0.0004541641,0.00005182694,0.00004721341,0.0001614724,0.00007104382,0.558838,0.001137026,0.4378432,0.001280941,0.00003843141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1165945,0.001525751,0.8512547,0.001345574,0.0001775186,0.0001318964,0.0003755213,0.0007365367,0.027858],"genre_scores_gemma":[0.9192628,0.001953309,0.06689361,0.0004888527,0.0003529692,0.0003848868,0.0005066832,0.0004324999,0.009724286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009985843,"threshold_uncertainty_score":0.03340596,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079626,0.001111255,0.001742526,0.0007972684,0.0006020321,0.001040521,0.001362672,0.001881769,0.004057289],"category_scores_gemma":[0.002899487,0.0008672547,0.001163876,0.001053514,0.0008138829,0.0009655093,0.001319413,0.002089863,0.0006068312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009919934,"about_ca_system_score_gemma":0.002524632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005934837,"about_ca_topic_score_gemma":0.004224071,"domain_scores_codex":[0.9992265,0.000382192,0.00003275579,0.00009066029,0.0001880233,0.00007993574],"domain_scores_gemma":[0.9985605,0.001022093,0.0001008757,0.00004814454,0.0002012687,0.00006721801],"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.00003304837,0.00004109419,0.0001420571,0.0000501747,0.00001764086,0.00003502635,0.00003288316,0.967307,0.0005441119,0.009477754,0.0005222388,0.02179711],"study_design_scores_gemma":[0.000006359699,0.00001003091,0.00001052852,0.000002883241,0.000001713207,0.00000379147,0.000002194255,0.9981431,0.00008928849,0.001523637,0.0002045993,0.00000192413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00245779,0.00005535815,0.9965496,0.00004547809,0.00001409382,0.00003037925,0.00001729337,0.00008487493,0.0007449975],"genre_scores_gemma":[0.1165941,0.0001412636,0.8809673,0.00005532127,0.00002784996,0.0004620901,0.0001234746,0.00009807327,0.001530512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005934837,"threshold_uncertainty_score":0.01357299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}