{"meta":{"query_hash":"5511e00e3936","filters":{"venue":"International Journal of Mathematics in Operational Research"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/5511e00e3936","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Mathematics+in+Operational+Research"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2770806427203433,"score_gpt":0.42303904723274594,"score_spread":0.14595840451240266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988246090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024577896,0.000055358152,0.9965496,0.00004547809,0.0000140938155,0.000030379246,0.000017293369,0.000084874926,0.0007449975],"genre_scores_gemma":[0.11659407,0.00014126363,0.88096726,0.000055321267,0.00002784996,0.00046209013,0.00012347465,0.00009807327,0.0015305118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922645,0.000382192,0.00003275579,0.000090660295,0.00018802329,0.00007993574],"domain_scores_gemma":[0.9985605,0.0010220926,0.00010087568,0.00004814454,0.00020126872,0.00006721801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020796263,0.0011112547,0.0017425258,0.0007972684,0.0006020321,0.0010405212,0.0013626718,0.0018817694,0.0040572886],"category_scores_gemma":[0.002899487,0.00086725474,0.0011638764,0.0010535141,0.0008138829,0.00096550933,0.001319413,0.0020898627,0.00060683116],"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.000033048367,0.00004109419,0.00014205708,0.000050174698,0.000017640861,0.000035026347,0.00003288316,0.967307,0.0005441119,0.009477754,0.00052223884,0.021797115],"study_design_scores_gemma":[0.000006359699,0.000010030912,0.000010528518,0.0000028832408,0.000001713207,0.0000037914704,0.0000021942553,0.9981431,0.00008928849,0.0015236366,0.00020459926,0.0000019241304],"about_ca_topic_score_codex":0.0059348373,"about_ca_topic_score_gemma":0.0042240713,"teacher_disagreement_score":0.0059348373,"about_ca_system_score_codex":0.0009919934,"about_ca_system_score_gemma":0.0025246318,"threshold_uncertainty_score":0.013572991},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13779010529021463,"score_gpt":0.43500259010497316,"score_spread":0.29721248481475854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011331359","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001560204,0.00028461686,0.9965035,0.00009390807,0.00010548113,0.00002868728,0.000020375976,0.00013275951,0.0012704228],"genre_scores_gemma":[0.06636384,0.0008063559,0.92813534,0.000113865295,0.00015834461,0.00019321982,0.00008229192,0.00012918266,0.004017469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918574,0.00023912045,0.00004647699,0.000059389276,0.00042928662,0.00004003641],"domain_scores_gemma":[0.9989592,0.0005343965,0.0000857849,0.00011373577,0.0002582488,0.000048616886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014773401,0.00054841413,0.0008437539,0.0007284182,0.0006203877,0.0008853935,0.00090273254,0.0012825294,0.00218102],"category_scores_gemma":[0.0041148565,0.00032671753,0.0007355245,0.00094434235,0.00076780404,0.0013621392,0.0009668358,0.0020598667,0.0010357373],"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.00007562694,0.000103248094,0.0008734856,0.0002791636,0.000060559218,0.00030063663,0.00019089064,0.5495051,0.016644817,0.22952521,0.006152289,0.19628896],"study_design_scores_gemma":[0.000013945018,0.000016655338,0.00006575351,0.000014508187,0.0000060468046,0.000071397015,0.0000057746247,0.9770412,0.001411174,0.016426539,0.0049136905,0.0000133589165],"about_ca_topic_score_codex":0.0017415516,"about_ca_topic_score_gemma":0.0016705387,"teacher_disagreement_score":0.00218102,"about_ca_system_score_codex":0.00043920943,"about_ca_system_score_gemma":0.0011453824,"threshold_uncertainty_score":0.007813036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09863618438772116,"score_gpt":0.3616315983992814,"score_spread":0.26299541401156024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091648527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036336176,0.0049628564,0.9257922,0.0023321034,0.00024517355,0.00019718028,0.00024467366,0.00050267496,0.029386979],"genre_scores_gemma":[0.8176028,0.00815216,0.15244792,0.0013172051,0.0007495067,0.0006382345,0.00068483216,0.00055156846,0.017855776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969688,0.00069990574,0.0002153249,0.0004878433,0.0011514684,0.00047664653],"domain_scores_gemma":[0.9740117,0.021118077,0.0015037946,0.0008840985,0.0015134484,0.00096896547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004436679,0.0013716024,0.0021531815,0.0024140943,0.0013196436,0.0039975774,0.0035004283,0.0024252913,0.010450312],"category_scores_gemma":[0.031102577,0.00068890577,0.0015654393,0.0036521398,0.002431085,0.0069574015,0.0024237277,0.004988152,0.0008451983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0004629006,0.00017447108,0.0016826513,0.0009203336,0.00012270168,0.0003212712,0.00038698173,0.37521824,0.0040601874,0.54641116,0.007243453,0.062995695],"study_design_scores_gemma":[0.00007420818,0.00011197324,0.00029242868,0.00014073002,0.000055249537,0.00016850118,0.00007286085,0.6991708,0.0014406926,0.29466283,0.0037770614,0.000032749038],"about_ca_topic_score_codex":0.002608271,"about_ca_topic_score_gemma":0.0012478604,"teacher_disagreement_score":0.010450312,"about_ca_system_score_codex":0.0039643142,"about_ca_system_score_gemma":0.0024483907,"threshold_uncertainty_score":0.034959733},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06898663828890524,"score_gpt":0.3980168945879657,"score_spread":0.32903025629906046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129174856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116594456,0.0015257511,0.8512547,0.001345574,0.00017751857,0.00013189644,0.00037552128,0.00073653675,0.027858],"genre_scores_gemma":[0.9192628,0.0019533092,0.06689361,0.0004888527,0.00035296922,0.0003848868,0.0005066832,0.00043249992,0.009724286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817073,0.0005818755,0.000096900854,0.0003028006,0.00050921435,0.00033860613],"domain_scores_gemma":[0.98080724,0.014311471,0.0013672293,0.0010926953,0.00135068,0.0010705832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042636814,0.0014286825,0.0014479299,0.0050376668,0.0018549813,0.0034051167,0.003467707,0.0015843766,0.009985843],"category_scores_gemma":[0.027298464,0.00077856844,0.0020806557,0.0035196438,0.003269716,0.009021912,0.0030940098,0.0035189528,0.0007863977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00013428481,0.00009670198,0.0014982768,0.00016622715,0.00004358571,0.0002413227,0.0002633317,0.08732957,0.0018190484,0.8943081,0.0026802935,0.011419309],"study_design_scores_gemma":[0.000021438722,0.00005524125,0.00045416408,0.00005182694,0.000047213412,0.00016147239,0.00007104382,0.55883795,0.0011370264,0.43784323,0.0012809413,0.000038431408],"about_ca_topic_score_codex":0.0021925776,"about_ca_topic_score_gemma":0.0014432941,"teacher_disagreement_score":0.009985843,"about_ca_system_score_codex":0.004096518,"about_ca_system_score_gemma":0.0017680008,"threshold_uncertainty_score":0.03340596},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09162658443519967,"score_gpt":0.36411708095620443,"score_spread":0.27249049652100477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221027144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40370223,0.0017571186,0.5784764,0.0020120877,0.00013541512,0.00032238333,0.000707461,0.00019934635,0.012687541],"genre_scores_gemma":[0.9810419,0.0004495374,0.016389702,0.00007636252,0.00005154785,0.00016595508,0.0001670214,0.000025689766,0.0016321072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974667,0.001409822,0.000100111254,0.00028469207,0.00028244182,0.0004563097],"domain_scores_gemma":[0.97168803,0.02354156,0.0029244334,0.00039749045,0.00083134195,0.0006171599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069875843,0.001701717,0.0021612162,0.0012528504,0.00097284745,0.0022657467,0.0014775441,0.0029205019,0.0026376685],"category_scores_gemma":[0.022719674,0.0011109208,0.0017989195,0.0013065173,0.0034598473,0.0022214835,0.002352906,0.0020488699,0.0002481423],"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.0003618528,0.00006264923,0.0010496281,0.00014779385,0.00006621011,0.0004117084,0.00009041153,0.96210754,0.0011175236,0.03256199,0.00035963944,0.0016629789],"study_design_scores_gemma":[0.000041142273,0.000109841385,0.0009273641,0.000023780138,0.000025291576,0.00003533269,0.00008315502,0.9822336,0.00032603703,0.016050823,0.000115578645,0.000028092067],"about_ca_topic_score_codex":0.005823688,"about_ca_topic_score_gemma":0.0027456773,"teacher_disagreement_score":0.0069875843,"about_ca_system_score_codex":0.0018890656,"about_ca_system_score_gemma":0.001721056,"threshold_uncertainty_score":0.036954343},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.24465215413896071,"score_gpt":0.5615350988053223,"score_spread":0.3168829446663616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380189073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026171159,0.00017083259,0.9948133,0.0000758023,0.000020022078,0.00011094725,0.00010784772,0.00007198012,0.0020122512],"genre_scores_gemma":[0.18222225,0.0007339725,0.8128091,0.00008627834,0.00005192614,0.0007574497,0.00039630543,0.000054768516,0.0028879582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950199,0.002469922,0.00021524917,0.00037455314,0.0017005792,0.00021977168],"domain_scores_gemma":[0.9968172,0.0021083797,0.00016072251,0.00016546297,0.0006808838,0.0000673994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043567526,0.0013207833,0.0015912509,0.004701321,0.00086487643,0.0018764569,0.0015359079,0.00094768364,0.003336127],"category_scores_gemma":[0.007321496,0.00067525863,0.001391631,0.0055922368,0.0007725559,0.0016946937,0.001704049,0.0013116461,0.0005977292],"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.00008832554,0.00014893035,0.0021243726,0.00065035786,0.00026642057,0.0001585103,0.00024480044,0.58143437,0.0031819101,0.06367772,0.0030908438,0.3449334],"study_design_scores_gemma":[0.00002165975,0.00004939861,0.00042613025,0.0000344057,0.000030417496,0.000055000604,0.000078267476,0.97576356,0.0012777876,0.018879704,0.0033576288,0.000026009451],"about_ca_topic_score_codex":0.008672394,"about_ca_topic_score_gemma":0.0060056136,"teacher_disagreement_score":0.008672394,"about_ca_system_score_codex":0.001966612,"about_ca_system_score_gemma":0.002465756,"threshold_uncertainty_score":0.02304101},"labels":[],"label_agreement":null}]}