{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2497872,0.00008069625,0.74636954,0.0012427706,0.0005959366,0.00054510345,0.00002283147,0.00001799628,0.0013379242],"genre_scores_gemma":[0.80636173,0.000006159021,0.19265838,0.00023483347,0.0005051666,0.000059539783,0.000018775201,0.000018901514,0.00013653666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840945,0.00002381415,0.00054993463,0.00015856118,0.0006586034,0.00019962685],"domain_scores_gemma":[0.9978999,0.00014844711,0.00023833606,0.000087386834,0.00160628,0.000019640533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199148,0.00011423683,0.00017506182,0.0014839458,0.00011655723,0.0002324292,0.00040699402,0.000059063703,0.00020280298],"category_scores_gemma":[0.0004760687,0.00010487272,0.000049595168,0.00022370809,0.00012563264,0.00084916595,0.00022477348,0.00027669442,0.000015486312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039566544,0.002082519,0.004931078,0.0003817592,0.0004701707,0.00021236694,0.0040699844,0.0017475192,0.007017333,0.9560818,0.0011953539,0.021414435],"study_design_scores_gemma":[0.004204515,0.00016092713,0.002274965,0.0009068237,0.000025907497,0.00010836446,0.0066730636,0.8637578,0.0010777427,0.11996657,0.0005602089,0.00028311793],"about_ca_topic_score_codex":0.000055153865,"about_ca_topic_score_gemma":0.000031421267,"teacher_disagreement_score":0.8620103,"about_ca_system_score_codex":0.00018033743,"about_ca_system_score_gemma":0.00004674528,"threshold_uncertainty_score":0.42765853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11952777,0.00014815545,0.87761736,0.0021355678,0.00006789749,0.00021416666,0.000014710266,0.0000023506727,0.00027205184],"genre_scores_gemma":[0.8337779,0.000039510167,0.16591452,0.000057365396,0.00016691438,0.0000205608,0.000007002749,0.0000063392795,0.000009854812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998628,0.000015010376,0.000803648,0.00017059682,0.00022623858,0.00015651541],"domain_scores_gemma":[0.9985332,0.0005240899,0.00025790863,0.00007706348,0.0005583054,0.0000494372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037223194,0.000070959126,0.00019894971,0.0006320025,0.00006715716,0.00017235205,0.0002901979,0.000058046306,0.000014155586],"category_scores_gemma":[0.0017177099,0.00007288161,0.000036345093,0.00024711763,0.000031538613,0.00029889453,0.000027032753,0.00024046848,0.0000069814514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003670039,0.0003711857,0.00026434447,0.000011906792,0.000007799751,0.0000027058493,0.0011724354,0.028956315,0.0005693079,0.96581024,0.000009981289,0.0027870948],"study_design_scores_gemma":[0.0003978669,0.00008647949,0.0049194484,0.00005497192,7.934615e-7,0.000010792476,0.00021624463,0.5566291,0.00008694208,0.4375042,0.00004308996,0.00005005582],"about_ca_topic_score_codex":0.000024846302,"about_ca_topic_score_gemma":0.0000065511936,"teacher_disagreement_score":0.71425015,"about_ca_system_score_codex":0.00018505723,"about_ca_system_score_gemma":0.00008502006,"threshold_uncertainty_score":0.29720256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5282771,0.0007881144,0.010970719,0.23330742,0.0049309046,0.0058395937,0.000027600003,0.00006521999,0.21579333],"genre_scores_gemma":[0.98983485,0.00004313308,0.004316474,0.0014380156,0.0026715193,0.00017297897,0.000017600058,0.000022716402,0.001482743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973252,0.000023486808,0.00078049593,0.00013448918,0.0014994281,0.00023692878],"domain_scores_gemma":[0.9964686,0.000720025,0.00029247912,0.00015130552,0.0023509269,0.00001666089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005232221,0.000099274694,0.00013486123,0.00058061344,0.00017776614,0.00075170584,0.0009872027,0.000041885767,0.0003497353],"category_scores_gemma":[0.0016450158,0.00006716059,0.00009762697,0.00024230829,0.00009478834,0.0011045838,0.00025574732,0.00032984128,0.00014733862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013436287,0.0006772347,0.0023174724,0.00016054635,0.00020006685,0.00001736207,0.00078567734,0.009993955,0.0004306607,0.76957107,0.2111787,0.0045329193],"study_design_scores_gemma":[0.0027946313,0.000056721605,0.001898332,0.0004524157,0.000017444738,0.000017328775,0.0046206685,0.4378662,0.00011839051,0.41893402,0.13301484,0.00020899808],"about_ca_topic_score_codex":0.00012718582,"about_ca_topic_score_gemma":0.00005013286,"teacher_disagreement_score":0.46155772,"about_ca_system_score_codex":0.00016162095,"about_ca_system_score_gemma":0.00008644274,"threshold_uncertainty_score":0.72487164},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6724064,0.00030193885,0.24432331,0.05099457,0.0014464405,0.0011294135,0.000045473127,0.00005902179,0.02929345],"genre_scores_gemma":[0.9822058,0.00002368219,0.015324432,0.0006223799,0.0015572172,0.00000954908,0.00002395895,0.000014206778,0.0002187453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714065,0.00003495782,0.00091976405,0.00016253965,0.0015032149,0.00023887616],"domain_scores_gemma":[0.99527645,0.00080825755,0.00036611306,0.00012588846,0.0034056758,0.00001760789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006265506,0.00011404889,0.00022565576,0.000922314,0.00012948523,0.0003523319,0.00068031566,0.000053875938,0.000057630987],"category_scores_gemma":[0.0040495424,0.00009806685,0.00013195357,0.00036415714,0.00006112415,0.001103168,0.00005209917,0.00033243553,0.000027217984],"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.0010770122,0.0013178706,0.00019646085,0.00009268127,0.00017515227,0.000116778916,0.0009169157,0.049402036,0.00789153,0.9230961,0.0054898425,0.010227578],"study_design_scores_gemma":[0.0024455679,0.00009960026,0.0005443152,0.00048803497,0.000025526788,0.000043629872,0.00089396175,0.22491579,0.000564702,0.7550057,0.014754635,0.00021852425],"about_ca_topic_score_codex":0.00001623382,"about_ca_topic_score_gemma":0.000026936315,"teacher_disagreement_score":0.30979943,"about_ca_system_score_codex":0.00019113653,"about_ca_system_score_gemma":0.00009267865,"threshold_uncertainty_score":0.48479733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91841954,0.00091327366,0.07822706,0.0008867991,0.00032592786,0.0002673885,0.000023637702,0.000025640333,0.00091072905],"genre_scores_gemma":[0.93318415,0.00015259141,0.06634577,0.000021670614,0.00013678546,0.000013445244,0.000008181892,0.000020208854,0.00011721238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980198,0.0001096436,0.00050112413,0.00014132948,0.0010601867,0.00016787258],"domain_scores_gemma":[0.9980455,0.0005831688,0.000078796205,0.0001134315,0.0010245529,0.00015454489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021017704,0.00012776304,0.00020738791,0.00036822772,0.00006543005,0.00038884036,0.00024206012,0.00007338147,0.000026549445],"category_scores_gemma":[0.0005670348,0.00010029425,0.000021432636,0.00010772442,0.0001350541,0.00041275806,0.00007188206,0.000449553,0.000003944653],"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.0000964173,0.00026739624,0.0036941064,0.00012901473,0.00025511227,0.00005845168,0.003914462,0.9778759,0.00012311817,0.012778535,0.00031947927,0.00048799108],"study_design_scores_gemma":[0.002121491,0.00019927743,0.00534181,0.0006308286,0.000017412354,0.0011119171,0.007540621,0.97303367,0.00048419126,0.008978952,0.00026745946,0.00027236494],"about_ca_topic_score_codex":0.000029477482,"about_ca_topic_score_gemma":0.000045479872,"teacher_disagreement_score":0.014764585,"about_ca_system_score_codex":0.0003514956,"about_ca_system_score_gemma":0.00017136244,"threshold_uncertainty_score":0.4089881},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9209614,0.00018375031,0.04084194,0.036512822,0.00026837987,0.00075022434,0.000024965837,0.0000033758192,0.0004531768],"genre_scores_gemma":[0.9891253,0.0000814825,0.010238721,0.000070861286,0.00015399532,0.00004838388,0.0000052323508,0.000007736121,0.00026826645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9901358,0.0013887342,0.0013677063,0.00019352969,0.006695052,0.00021916762],"domain_scores_gemma":[0.9691552,0.025298096,0.0003730527,0.00015300025,0.0049909493,0.000029688974],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.11166839,0.00007762073,0.00020979572,0.0014751706,0.0002485182,0.00040436097,0.0014039731,0.00003788628,0.00006483435],"category_scores_gemma":[0.031052936,0.000043236323,0.000098148084,0.0014794765,0.00017629273,0.0002555996,0.00011480175,0.0003565638,0.000006833717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070769456,0.0009690565,0.025402129,0.000064367225,0.000437744,0.00004996697,0.03267207,0.2414171,0.010843806,0.507574,0.019950794,0.15991127],"study_design_scores_gemma":[0.00070832635,0.000066072564,0.007913275,0.000060941748,0.00000818673,0.0000628793,0.0045804274,0.64912105,0.00053693296,0.3361314,0.0007673309,0.000043175252],"about_ca_topic_score_codex":0.000063078995,"about_ca_topic_score_gemma":0.00041518666,"teacher_disagreement_score":0.40770397,"about_ca_system_score_codex":0.00017286153,"about_ca_system_score_gemma":0.00049773284,"threshold_uncertainty_score":0.9771089},"labels":[],"label_agreement":null}]}