{"meta":{"query_hash":"1259fe389d1a","filters":{"venue":"Asia Pacific Journal of Operational Research"},"cohort_total":42,"direct_labels_cover":0,"predictions_cover":42,"exported":42,"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/1259fe389d1a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Asia+Pacific+Journal+of+Operational+Research"},"results":[{"id":"W1598072008","doi":"10.1142/s0217595916500408","title":"Algorithms for Finding Copulas Minimizing Convex Functions of Sums","year":2016,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Marginal distribution; Regular polygon; Convex function; Convergence (economics); Distribution (mathematics); Applied mathematics; Measure (data warehouse); Mathematical optimization; Function (biology); Copula (linguistics); Algorithm; Random variable; Computer science; Statistics; Mathematical analysis; Econometrics","score_opus":0.16288595459406607,"score_gpt":0.3587616215732444,"score_spread":0.19587566697917835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598072008","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.0019773203,0.00007006543,0.9970613,0.00005180574,0.000009500039,0.00004279094,0.000015658494,0.00030068468,0.00047079424],"genre_scores_gemma":[0.052306015,0.00020346665,0.9443671,0.00014296798,0.000054713753,0.0003993377,0.00026373967,0.0007249999,0.0015375682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826837,0.00066204474,0.00011566912,0.0003796059,0.00037739082,0.0001969558],"domain_scores_gemma":[0.99438655,0.004044344,0.0003674911,0.00046636653,0.00058476895,0.0001505446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033966769,0.0024535602,0.0023978848,0.0023314296,0.0009627183,0.0018548198,0.0030706075,0.002160036,0.0070286784],"category_scores_gemma":[0.014272182,0.0015958133,0.001982796,0.0018985629,0.0016548383,0.0028927594,0.0025846225,0.0035825216,0.0028112438],"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.00013024405,0.0001603648,0.0006431928,0.00020299367,0.00011151292,0.00010583942,0.00021176797,0.7247986,0.0047874195,0.07115185,0.0036264337,0.19406977],"study_design_scores_gemma":[0.00004203561,0.000040083392,0.000101563375,0.000018822593,0.000016044409,0.000030503727,0.000026500202,0.9662832,0.0015610403,0.03076565,0.0010962137,0.000018348996],"about_ca_topic_score_codex":0.0026260829,"about_ca_topic_score_gemma":0.003199711,"teacher_disagreement_score":0.0070286784,"about_ca_system_score_codex":0.001873176,"about_ca_system_score_gemma":0.002166323,"threshold_uncertainty_score":0.023513258},"labels":[],"label_agreement":null},{"id":"W1971256194","doi":"10.1142/s0217595911003442","title":"PLANNING RELOCATION OF PEOPLE FOR DEVELOPING SURFACE MINES IN DENSELY POPULATED AREAS: OPTIMIZATION OF MULTIPLE OBJECTIVES","year":2011,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Facility Location and Emergency 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":"University of Lethbridge","funders":"","keywords":"Relocation; Environmental planning; Natural (archaeology); Compensation (psychology); Process (computing); Analytic hierarchy process; Computer science; Risk analysis (engineering); Environmental resource management; Operations research; Business; Geography; Engineering; Environmental science; Archaeology","score_opus":0.13776416126053295,"score_gpt":0.3416390625268461,"score_spread":0.20387490126631316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971256194","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.40048924,0.0005473349,0.5890043,0.0011210755,0.000047599944,0.00035901042,0.00022490736,0.0001548824,0.008051738],"genre_scores_gemma":[0.8963232,0.00039657153,0.100177236,0.00005240326,0.00001423297,0.00021299702,0.00013352245,0.000034768887,0.0026551653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944204,0.0003025136,0.000016106209,0.000059780104,0.000056560897,0.00012298222],"domain_scores_gemma":[0.99926835,0.0004052335,0.000118803044,0.000019663381,0.00005535033,0.00013264109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010176867,0.0007246814,0.0008032768,0.000681038,0.0006023593,0.0012505662,0.0009042218,0.0010995917,0.002216742],"category_scores_gemma":[0.0016851175,0.00053269416,0.00077385077,0.0007620117,0.0007628309,0.0010945383,0.0012487771,0.00085956906,0.00024978037],"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.000118254145,0.00010169064,0.0028284332,0.00009644979,0.000048485927,0.0003389822,0.00020320281,0.9671545,0.0010448135,0.0071200817,0.0006474243,0.020297661],"study_design_scores_gemma":[0.000032141037,0.00019974352,0.0013195412,0.000026828451,0.000028286406,0.00009180621,0.0008633015,0.9858627,0.0005256266,0.009994552,0.001036929,0.000018651812],"about_ca_topic_score_codex":0.0056503685,"about_ca_topic_score_gemma":0.008682632,"teacher_disagreement_score":0.0056503685,"about_ca_system_score_codex":0.00076135265,"about_ca_system_score_gemma":0.0018176871,"threshold_uncertainty_score":0.011234939},"labels":[],"label_agreement":null},{"id":"W1972437235","doi":"10.1142/s0217595910002624","title":"ALTERNATIVE RANDOMIZATION FOR VALUING AMERICAN OPTIONS","year":2010,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Laplace transform; Random variable; Mathematical optimization; Context (archaeology); Computer science; Mathematics; Variable (mathematics); Maturity (psychological); Applied mathematics; Econometrics; Calculus (dental); Statistics","score_opus":0.06962739646991001,"score_gpt":0.3544901727073047,"score_spread":0.2848627762373947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972437235","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.00959272,0.000204737,0.9883221,0.00015526319,0.00006750731,0.000043666125,0.000028608121,0.00016516919,0.0014202299],"genre_scores_gemma":[0.30880633,0.0005033245,0.6850226,0.00023500569,0.00016390857,0.00024567373,0.00014953992,0.00013368849,0.0047399127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648356,0.0022121437,0.00012468961,0.00030599211,0.00075046293,0.00012300715],"domain_scores_gemma":[0.9955205,0.0028493614,0.00043341733,0.0004097608,0.0006240561,0.00016293454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049115103,0.00059252867,0.00089935213,0.0015411628,0.00062858657,0.0014143673,0.0013292491,0.001836546,0.0032241356],"category_scores_gemma":[0.018959863,0.00039160438,0.0010632895,0.0012707841,0.0019005003,0.0026177336,0.0013923628,0.0020484105,0.0006784549],"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.0002693847,0.00008870758,0.000812025,0.00010756819,0.000050739658,0.00013759125,0.00011283493,0.25808945,0.0054362607,0.65472794,0.0013027313,0.078864716],"study_design_scores_gemma":[0.00006027111,0.00007445804,0.00018490915,0.000022125041,0.000008490892,0.00006688368,0.000010041421,0.8688574,0.0015788313,0.12637652,0.0027131937,0.000046880403],"about_ca_topic_score_codex":0.0013929907,"about_ca_topic_score_gemma":0.0012293876,"teacher_disagreement_score":0.0049115103,"about_ca_system_score_codex":0.001119076,"about_ca_system_score_gemma":0.0010912046,"threshold_uncertainty_score":0.02597487},"labels":[],"label_agreement":null},{"id":"W1984754911","doi":"10.1142/s0217595908001626","title":"GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM","year":2008,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Mathematical optimization; Facility location problem; Time horizon; Profit (economics); Distribution center; Genetic algorithm; Heuristic; Distribution (mathematics); Computer science; Dynamic programming; Operations research; Mathematics; Economics; Microeconomics","score_opus":0.1074843412040636,"score_gpt":0.34156553741085066,"score_spread":0.23408119620678708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984754911","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.122462004,0.0005649184,0.86588955,0.00043706747,0.00006527386,0.00015031133,0.00015136546,0.00033438372,0.009945144],"genre_scores_gemma":[0.71046966,0.00036293152,0.28495362,0.00012800103,0.000030903135,0.00031229103,0.0002079898,0.00005301366,0.0034815783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996433,0.00015592962,0.00001155065,0.00005767476,0.000060732116,0.00007075766],"domain_scores_gemma":[0.9992716,0.00050313293,0.0000807085,0.000022865031,0.00008816731,0.00003347255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008079134,0.00075933186,0.0009556422,0.00089098536,0.00051326177,0.0009612482,0.0010214896,0.0013945318,0.0019709188],"category_scores_gemma":[0.0018163128,0.00042271957,0.0005548074,0.0010443531,0.0004717696,0.00053412543,0.0005702603,0.0006783123,0.00016471483],"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.000019680476,0.000017512977,0.00025600742,0.000018038458,0.000017367545,0.00003333028,0.0000185182,0.9878386,0.00018252492,0.0027160984,0.00028370024,0.008598497],"study_design_scores_gemma":[0.000015494108,0.000020503861,0.000074797004,0.000003736891,0.000006601086,0.000009632106,0.000012518467,0.9981123,0.000079344245,0.001451751,0.00021078951,0.0000025701136],"about_ca_topic_score_codex":0.014624023,"about_ca_topic_score_gemma":0.008605038,"teacher_disagreement_score":0.014624023,"about_ca_system_score_codex":0.0012079569,"about_ca_system_score_gemma":0.0019463606,"threshold_uncertainty_score":0.029077828},"labels":[],"label_agreement":null},{"id":"W1990591475","doi":"10.1142/s0217595906000760","title":"APPLICATION OF ANALYTIC HIERARCHY PROCESS IN MULTI-OBJECTIVE MIXED INTEGER PROGRAMMING FOR AIRLIFT CAPACITY PLANNING","year":2006,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Manitoba; University of Lethbridge","funders":"","keywords":"Airlift; Integer programming; Analytic hierarchy process; Mathematical optimization; Variable (mathematics); Integer (computer science); Computer science; Linear programming; Operations research; Process (computing); Airframe; Hierarchy; Engineering; Mathematics; Economics; Aerospace engineering","score_opus":0.09110557511785854,"score_gpt":0.3668458145480676,"score_spread":0.27574023943020903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990591475","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.002337338,0.00048618743,0.9941459,0.00020441094,0.00005046914,0.00010397901,0.000027102076,0.000102317965,0.0025422787],"genre_scores_gemma":[0.19113746,0.001252524,0.8048891,0.00013895951,0.00012734081,0.0007251327,0.00010593331,0.000111291076,0.0015123199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571,0.002799853,0.00011757127,0.00016327575,0.0009992719,0.00020994853],"domain_scores_gemma":[0.9928484,0.006024819,0.0003153412,0.000100782556,0.0005656477,0.00014508565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006943387,0.0017735005,0.0019039805,0.0017666473,0.001167142,0.0023311768,0.0015577548,0.0013796036,0.0027931333],"category_scores_gemma":[0.012081739,0.0010792516,0.0014887375,0.0027575556,0.0013981988,0.0016322698,0.0022589455,0.0035614953,0.00043094245],"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.000032415104,0.00006384042,0.00020123436,0.00016633078,0.000071295515,0.000075370896,0.00013038194,0.9247557,0.0004227896,0.044486403,0.00088523864,0.028709028],"study_design_scores_gemma":[0.00001041783,0.000020998184,0.0000199674,0.000012925569,0.000007311692,0.0000036086687,0.000012327396,0.9851621,0.000121762445,0.014040712,0.00058233744,0.0000055281207],"about_ca_topic_score_codex":0.012493587,"about_ca_topic_score_gemma":0.009735216,"teacher_disagreement_score":0.012493587,"about_ca_system_score_codex":0.0020077578,"about_ca_system_score_gemma":0.004184099,"threshold_uncertainty_score":0.036720574},"labels":[],"label_agreement":null},{"id":"W1991303080","doi":"10.1142/s0217595914500420","title":"A Variant of L<sup>♮</sup>-Convexity and its Application to Inventory Models with Batch Ordering","year":2014,"lang":"en","type":"article","venue":"Asia Pacific Journal of 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":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Convexity; Inventory control; Computer science; Mathematical optimization; Perpetual inventory; Inventory theory; Operations research; Sensitivity (control systems); Mathematical economics; Economics; Mathematics; Financial economics; Engineering","score_opus":0.05343138039678206,"score_gpt":0.29084585544540864,"score_spread":0.2374144750486266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991303080","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.02195812,0.0018677502,0.9537858,0.0020585202,0.0002456178,0.00007611758,0.0003902466,0.0001485348,0.019469326],"genre_scores_gemma":[0.8208744,0.005677054,0.15504958,0.0013370622,0.0008875001,0.00031368897,0.0006773321,0.00046390918,0.014719528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978466,0.0010044806,0.00009812507,0.00033542662,0.00038366223,0.00033168262],"domain_scores_gemma":[0.989913,0.0066565117,0.0010951877,0.0006935851,0.0011632852,0.0004783994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050496887,0.0020802845,0.0018006903,0.001908008,0.0014250517,0.003186036,0.0023244892,0.0016541579,0.003913236],"category_scores_gemma":[0.009815715,0.000855826,0.0036300079,0.002380504,0.0037819794,0.004922235,0.0026276247,0.005857697,0.0006411218],"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.00013585843,0.000113248505,0.002526764,0.00027241674,0.00012353084,0.0006712315,0.0002860304,0.29594177,0.002063218,0.6672366,0.008757491,0.021871772],"study_design_scores_gemma":[0.0000086179725,0.000046572903,0.0005040327,0.00004208968,0.00002813275,0.0001301823,0.000060900868,0.7959541,0.0005729114,0.1995637,0.0030502987,0.00003858629],"about_ca_topic_score_codex":0.0092656845,"about_ca_topic_score_gemma":0.005310031,"teacher_disagreement_score":0.0092656845,"about_ca_system_score_codex":0.0036399171,"about_ca_system_score_gemma":0.0027723613,"threshold_uncertainty_score":0.026705623},"labels":[],"label_agreement":null},{"id":"W1998164572","doi":"10.1142/s0217595908001754","title":"EFFECTIVENESS ANALYSIS OF DERIVING PRIORITY VECTORS FROM RECIPROCAL PAIRWISE COMPARISON MATRICES","year":2008,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Reciprocal; Mathematics; Statistics; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.3130313125483327,"score_gpt":0.5174707121392591,"score_spread":0.20443939959092639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998164572","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.022493465,0.00033656802,0.9753327,0.00004775783,0.000014188709,0.00014740865,0.000049904214,0.00013462656,0.0014434853],"genre_scores_gemma":[0.31769255,0.00044613107,0.6804755,0.000037954862,0.00005120958,0.0004268481,0.0003043293,0.000077230856,0.00048824673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9751898,0.017041495,0.0007965595,0.0012941262,0.00530842,0.00036964443],"domain_scores_gemma":[0.884441,0.10094115,0.00409469,0.002595767,0.007486481,0.00044082478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02067163,0.0015205098,0.0014622589,0.007125405,0.00053152867,0.0015024587,0.0014978581,0.0008494371,0.0033232966],"category_scores_gemma":[0.110808454,0.0005306911,0.0012982115,0.0026800793,0.0012053095,0.003122354,0.0014250306,0.0011270521,0.0005816532],"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.00079777633,0.0003075162,0.006500667,0.0012508649,0.0005009875,0.00008645714,0.00041482373,0.33037427,0.0061635184,0.04968344,0.0011286945,0.60279113],"study_design_scores_gemma":[0.000088258545,0.0006506583,0.002773694,0.00008490065,0.00014620202,0.00017114278,0.00015910192,0.96683246,0.007922744,0.02011487,0.0009935144,0.00006241803],"about_ca_topic_score_codex":0.0015926636,"about_ca_topic_score_gemma":0.0010972688,"teacher_disagreement_score":0.02067163,"about_ca_system_score_codex":0.0013850076,"about_ca_system_score_gemma":0.0017400915,"threshold_uncertainty_score":0.10932338},"labels":[],"label_agreement":null},{"id":"W2004907946","doi":"10.1142/s0217595909002353","title":"SELLER-BUYER RELATIONSHIP WHEN END DEMAND IS SENSITIVE TO PRICE AND PROMOTION","year":2009,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":19,"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":"","keywords":"Stackelberg competition; Microeconomics; Pareto principle; Product (mathematics); Game theory; Promotion (chess); Unit (ring theory); Key (lock); Economics; Computer science; Mathematics","score_opus":0.08440383362852519,"score_gpt":0.329235403837098,"score_spread":0.2448315702085728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004907946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51089877,0.0013112846,0.35959595,0.0067300685,0.00025344483,0.0006907869,0.00089991855,0.00049575476,0.11912408],"genre_scores_gemma":[0.9812866,0.00027241037,0.00596189,0.0003548181,0.000075964155,0.00010511263,0.00009755534,0.000038949205,0.011806732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611557,0.0014552943,0.00015224853,0.0008997638,0.0005243263,0.0008527652],"domain_scores_gemma":[0.97711253,0.016674953,0.0027642017,0.0013854727,0.0010949663,0.0009679222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008985909,0.0007331207,0.0025733623,0.0007979718,0.0017645479,0.0055501405,0.0027780754,0.0065009366,0.02826232],"category_scores_gemma":[0.027732825,0.0016163167,0.0012995568,0.0010465448,0.0019386034,0.010685396,0.0027592476,0.0038022704,0.003398574],"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.00192568,0.0013021443,0.03997043,0.000942847,0.0006669656,0.012344965,0.002249069,0.26588622,0.018754728,0.6007112,0.011068243,0.04417745],"study_design_scores_gemma":[0.0004787917,0.00085522915,0.017086428,0.000117795666,0.00035955076,0.0043776734,0.0029558612,0.56610155,0.005462305,0.38689014,0.014986759,0.0003279196],"about_ca_topic_score_codex":0.0022360128,"about_ca_topic_score_gemma":0.0016120586,"teacher_disagreement_score":0.02826232,"about_ca_system_score_codex":0.0020818391,"about_ca_system_score_gemma":0.0015182361,"threshold_uncertainty_score":0.094546854},"labels":[],"label_agreement":null},{"id":"W2012702951","doi":"10.1142/s021759590600084x","title":"QUANTITY RESTRICTIONS AND THE RESELLER'S RESPONSE TO A TEMPORARY PRICE REDUCTION OR AN ANNOUNCED PRICE INCREASE","year":2006,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business; Promotion (chess); Point (geometry); Trade promotion; Microeconomics; Rest (music); Reservation price; Commerce; Monetary economics; Economics; International trade","score_opus":0.06366395592583468,"score_gpt":0.32929838736309247,"score_spread":0.2656344314372578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012702951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317662,0.0008260637,0.21716788,0.0022674603,0.00021958417,0.0004830704,0.0005718087,0.0004512868,0.046246592],"genre_scores_gemma":[0.98687035,0.00015256836,0.009134899,0.00006383621,0.00004023482,0.00005764751,0.00009416385,0.000028167724,0.0035581088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970983,0.0011447861,0.00021741769,0.00048046518,0.0005872232,0.0004718678],"domain_scores_gemma":[0.9770055,0.015128424,0.004434692,0.0016186669,0.0011370631,0.00067577505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048571383,0.0006512431,0.00079035235,0.00048816952,0.0006872175,0.0028791872,0.0019155198,0.0016892803,0.008461155],"category_scores_gemma":[0.024072286,0.00060724857,0.0005377019,0.00090385275,0.0017925311,0.005306831,0.0014238552,0.0017304115,0.00073557254],"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.0063359723,0.00090699206,0.0144768255,0.00062779157,0.00014911342,0.0012180936,0.0009912333,0.6318854,0.025784073,0.21057674,0.0038344702,0.10321335],"study_design_scores_gemma":[0.00074301177,0.0030551392,0.028814595,0.000112333124,0.00020315271,0.0006238007,0.0014342662,0.7614539,0.016596625,0.17367567,0.012951808,0.00033569662],"about_ca_topic_score_codex":0.0030191992,"about_ca_topic_score_gemma":0.0024601745,"teacher_disagreement_score":0.008461155,"about_ca_system_score_codex":0.0015340414,"about_ca_system_score_gemma":0.0013219109,"threshold_uncertainty_score":0.028305352},"labels":[],"label_agreement":null},{"id":"W2013498054","doi":"10.1142/s0217595908001675","title":"ECONOMIC ORDER QUANTITY UNDER CONDITIONS OF A ONE-TIME-ONLY EXTENDED PERMISSIBLE DELAY PERIOD IN PAYMENTS","year":2008,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Science Council","keywords":"Order (exchange); Payment; Economic order quantity; Balance (ability); Period (music); Computer science; Operations research; Economics; Business; Mathematics; Marketing; Finance; Supply chain","score_opus":0.08522164076189392,"score_gpt":0.3427735281234195,"score_spread":0.25755188736152557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013498054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54210913,0.0010379163,0.42074567,0.0010950408,0.00014758483,0.00010739032,0.0005007544,0.0002053925,0.03405111],"genre_scores_gemma":[0.9847462,0.00023761559,0.012218451,0.000029857398,0.000034738958,0.000033094828,0.00009148622,0.000026264514,0.002582233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984131,0.00044030746,0.00008990915,0.00029955257,0.00035095337,0.00040613773],"domain_scores_gemma":[0.99544084,0.0026268396,0.00076202245,0.00033287026,0.0004862704,0.00035109033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023786544,0.00066135573,0.0010299948,0.00074658904,0.0007252003,0.0021462454,0.001168522,0.0010127602,0.0031991606],"category_scores_gemma":[0.010690954,0.0005195683,0.0006530698,0.00078301184,0.002036742,0.0048463778,0.0010103836,0.0014355123,0.00026861572],"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.00055655977,0.00009608987,0.0020898897,0.00016935146,0.000030961106,0.00076527445,0.00024040378,0.600451,0.006117168,0.38075608,0.0013446654,0.007382528],"study_design_scores_gemma":[0.000087277185,0.00018165995,0.0017357854,0.000027189095,0.000024419049,0.0002855466,0.00021466796,0.7459152,0.0020330064,0.24678268,0.002653916,0.00005870778],"about_ca_topic_score_codex":0.0025276996,"about_ca_topic_score_gemma":0.0015264904,"teacher_disagreement_score":0.0031991606,"about_ca_system_score_codex":0.002083637,"about_ca_system_score_gemma":0.0017421634,"threshold_uncertainty_score":0.015117943},"labels":[],"label_agreement":null},{"id":"W2013674341","doi":"10.1142/s0217595912400064","title":"OPTIMAL PROCUREMENT STRATEGY UNDER SUPPLY RISK","year":2012,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pooling; Procurement; Nash equilibrium; Competitor analysis; Information asymmetry; Order (exchange); Microeconomics; Business; Competition (biology); Industrial organization; Supplier relationship management; Supply chain; Outcome (game theory); Game theory; Economics; Supply chain management; Computer science; Marketing","score_opus":0.09584052852995457,"score_gpt":0.3404266115999856,"score_spread":0.24458608307003105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013674341","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.35816678,0.0014102445,0.57699394,0.0025125763,0.00010454786,0.00039776863,0.00062265253,0.00035534153,0.059436128],"genre_scores_gemma":[0.9665927,0.00054559356,0.021283409,0.000113122354,0.000028468683,0.00014091468,0.000111408284,0.000045462988,0.011138853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839205,0.00078388595,0.00009146219,0.00023544235,0.0002266636,0.00027057104],"domain_scores_gemma":[0.9973375,0.0015605132,0.00036209341,0.00016280689,0.00032873065,0.00024822552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022343814,0.0008448287,0.0014789595,0.000741953,0.000527834,0.0026027656,0.0011202673,0.001925005,0.0070295767],"category_scores_gemma":[0.0061542196,0.00093293993,0.0006837776,0.00087922456,0.0011833733,0.0023823131,0.001476963,0.0010448796,0.0011619986],"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.0004692671,0.00011804807,0.0014338609,0.00026703658,0.000114756185,0.0005309077,0.00028704194,0.8138598,0.0029627895,0.15137583,0.0021474937,0.026433019],"study_design_scores_gemma":[0.000084688465,0.00018114905,0.0006693939,0.000048844213,0.000038101487,0.00014907267,0.00021976385,0.8674321,0.00062039256,0.12881579,0.001693507,0.00004717738],"about_ca_topic_score_codex":0.003003309,"about_ca_topic_score_gemma":0.0018886136,"teacher_disagreement_score":0.0070295767,"about_ca_system_score_codex":0.0023711922,"about_ca_system_score_gemma":0.0023364995,"threshold_uncertainty_score":0.023516238},"labels":[],"label_agreement":null},{"id":"W2022100198","doi":"10.1142/s0217595912400040","title":"PRICING AND INVENTORY STRATEGIES FOR A TWO-STAGE DUAL-CHANNEL SUPPLY CHAIN","year":2012,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Channel (broadcasting); Dual (grammatical number); Production (economics); Business; Monopoly; Product (mathematics); Economic order quantity; Microeconomics; Pricing strategies; Industrial organization; Marketing; Economics; Computer science; Telecommunications","score_opus":0.09018776338499693,"score_gpt":0.34283046221562374,"score_spread":0.25264269883062684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022100198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56887275,0.0004780469,0.40510297,0.0013827853,0.000071916766,0.0004403911,0.0005055368,0.00014879643,0.022996852],"genre_scores_gemma":[0.9741132,0.00021660462,0.015450213,0.00006440569,0.000024933071,0.00016458229,0.00010485348,0.000017269182,0.009843904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.000577711,0.00006345954,0.00030073567,0.00019743522,0.00039696958],"domain_scores_gemma":[0.9975762,0.001314681,0.0004002492,0.00012103546,0.00024952614,0.0003383831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022334727,0.0010066269,0.0014949369,0.0010004287,0.001050564,0.0030532265,0.0023720213,0.003215648,0.007924068],"category_scores_gemma":[0.003835986,0.0012654732,0.0013293055,0.0010897071,0.0019937104,0.0031230338,0.0020359065,0.0016083776,0.0007023444],"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.00049834396,0.00021766135,0.002118896,0.00009511351,0.00006790536,0.000825208,0.00022017374,0.9383077,0.0022026605,0.048564617,0.0008027251,0.006078992],"study_design_scores_gemma":[0.00008264342,0.00009510776,0.0004130144,0.00000844279,0.000024916118,0.000075272386,0.00011085236,0.9815771,0.0002861016,0.016939003,0.00035351276,0.000034088658],"about_ca_topic_score_codex":0.008373767,"about_ca_topic_score_gemma":0.0054882746,"teacher_disagreement_score":0.008373767,"about_ca_system_score_codex":0.0028312046,"about_ca_system_score_gemma":0.0013117128,"threshold_uncertainty_score":0.026508689},"labels":[],"label_agreement":null},{"id":"W2029826589","doi":"10.1142/s0217595913500309","title":"PRICING AND INVENTORY DECISIONS WITH UNCERTAIN SUPPLY AND STOCHASTIC DEMAND","year":2013,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":11,"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; Ontario Tech University","funders":"","keywords":"Supply chain; Microeconomics; Profit (economics); Economics; Supply and demand; Set (abstract data type); Business; Computer science; Marketing","score_opus":0.057735397828189365,"score_gpt":0.30348654982698736,"score_spread":0.245751151998798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029826589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6024557,0.0010259238,0.37306917,0.0038394332,0.00019470646,0.00016869845,0.00067587744,0.00016556322,0.018404935],"genre_scores_gemma":[0.98970956,0.00029218124,0.0065786354,0.00006919294,0.000049468694,0.000038294715,0.00007743731,0.00001593131,0.0031692002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702734,0.0012294061,0.00014483422,0.00044886442,0.00049043674,0.00065915403],"domain_scores_gemma":[0.989077,0.008052579,0.0015220599,0.00034023114,0.0005903716,0.0004177932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038055677,0.0011091453,0.0017881136,0.0008316062,0.00073028373,0.0035054253,0.0020631223,0.0036632854,0.0030472714],"category_scores_gemma":[0.015768101,0.00169175,0.0016452395,0.0014635475,0.002390158,0.0042078905,0.001570176,0.0026565327,0.0003137594],"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.0001302151,0.00005753675,0.0013252023,0.000043067685,0.00005313394,0.00054797076,0.00009615608,0.96171874,0.0006596725,0.03313245,0.00024270122,0.0019931975],"study_design_scores_gemma":[0.00002284419,0.00004549739,0.00061493716,0.000008699724,0.000024767376,0.00006488072,0.000068514564,0.9816151,0.00022005434,0.01713437,0.00014990111,0.000030355843],"about_ca_topic_score_codex":0.01097349,"about_ca_topic_score_gemma":0.0057885996,"teacher_disagreement_score":0.01097349,"about_ca_system_score_codex":0.0025352633,"about_ca_system_score_gemma":0.0015468532,"threshold_uncertainty_score":0.021819234},"labels":[],"label_agreement":null},{"id":"W2033919760","doi":"10.1142/s0217595909002304","title":"A RETAIL CATEGORY MANAGEMENT MODEL INTEGRATING SHELF SPACE AND INVENTORY LEVELS","year":2009,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Operations research; Profit (economics); Space (punctuation); Product (mathematics); Benchmark (surveying); Inventory management; Computer science; Business; Operations management; Economics; Microeconomics; Mathematics","score_opus":0.09518612694697591,"score_gpt":0.322217781147874,"score_spread":0.2270316542008981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033919760","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.17948642,0.0007674366,0.7745775,0.0007651026,0.00015062344,0.00041473212,0.001257512,0.00057760323,0.042003043],"genre_scores_gemma":[0.90890884,0.00048115026,0.0632215,0.00008221695,0.000045803154,0.00044672776,0.0004867539,0.00006536829,0.026261585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992662,0.00018091868,0.00003810068,0.0002022905,0.00016468058,0.0001478815],"domain_scores_gemma":[0.9993579,0.00022968101,0.00009608419,0.000042812597,0.00018562905,0.00008793718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004926,0.0008757918,0.0013256668,0.0010703835,0.0007143823,0.0027344483,0.0038503306,0.0022843818,0.007779149],"category_scores_gemma":[0.0012792343,0.00091658486,0.0009828148,0.0018320098,0.0007667541,0.0022882582,0.0010874397,0.0010087135,0.0009312508],"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.00003950806,0.000044024935,0.0004976749,0.00003450439,0.000013076809,0.00007604955,0.000032523865,0.9844118,0.00063877867,0.007634863,0.0004086242,0.00616853],"study_design_scores_gemma":[0.000011523891,0.000043145843,0.0001822206,0.000005032313,0.000012408429,0.000029473094,0.00002016216,0.9962799,0.00014229963,0.0026438115,0.00061981886,0.0000101203],"about_ca_topic_score_codex":0.011897184,"about_ca_topic_score_gemma":0.010464785,"teacher_disagreement_score":0.011897184,"about_ca_system_score_codex":0.0022285276,"about_ca_system_score_gemma":0.002256024,"threshold_uncertainty_score":0.026023865},"labels":[],"label_agreement":null},{"id":"W2044767136","doi":"10.1142/s0217595910002697","title":"ESTIMATING BIVARIATE GARCH-JUMP MODEL BASED ON HIGH FREQUENCY DATA: THE CASE OF REVALUATION OF THE CHINESE YUAN IN JULY 2005","year":2010,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Kwansei Gakuin University","keywords":"Jump; Bivariate analysis; Autoregressive conditional heteroskedasticity; Volatility (finance); Liberian dollar; Econometrics; Us dollar; Exchange rate; Univariate; Economics; Mathematics; Poisson distribution; Statistics; Multivariate statistics; Monetary economics; Finance; Physics","score_opus":0.11937178490166776,"score_gpt":0.37424887662704,"score_spread":0.2548770917253722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044767136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99652857,0.00005935891,0.0030381272,0.00007401327,0.000005751795,0.000004555124,0.000107423104,0.000025230664,0.00015703493],"genre_scores_gemma":[0.9987418,0.00004845945,0.00077876006,0.0000067470405,0.000009111602,0.0000036843178,0.00029825364,0.00000358031,0.00010954269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00017503985,0.00003394963,0.000119582495,0.000091757145,0.00012537003],"domain_scores_gemma":[0.99614054,0.0024342772,0.0007267343,0.00026609685,0.0002697161,0.00016261489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028225551,0.00053836184,0.00085768494,0.0010484942,0.000333342,0.0007971598,0.00076480024,0.0010629871,0.000500097],"category_scores_gemma":[0.0070483973,0.00035045348,0.00077676325,0.00090448296,0.00043206543,0.0008921522,0.0005396995,0.0010874744,0.0000982239],"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.00056574034,0.00033827874,0.4437566,0.00009812149,0.00045136877,0.0021400987,0.00045099054,0.52391845,0.003757796,0.0048844414,0.0013508123,0.018287268],"study_design_scores_gemma":[0.000018006958,0.00007703456,0.07022693,0.0000069052576,0.000068185414,0.00010507469,0.00017708396,0.9275791,0.00082731864,0.00071937393,0.00016541024,0.000029502795],"about_ca_topic_score_codex":0.02817261,"about_ca_topic_score_gemma":0.016884089,"teacher_disagreement_score":0.02817261,"about_ca_system_score_codex":0.0007931352,"about_ca_system_score_gemma":0.00053330994,"threshold_uncertainty_score":0.05601728},"labels":[],"label_agreement":null},{"id":"W2052557309","doi":"10.1142/s0217595909002171","title":"VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS","year":2009,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":38,"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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Differentiable function; Complementarity (molecular biology); Complementarity theory; Orthant; Lagrangian; Jacobian matrix and determinant; Applied mathematics; Trust region; Stationary point; Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.16022711289082814,"score_gpt":0.4544760530473624,"score_spread":0.29424894015653424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052557309","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.025636913,0.00023832575,0.96552646,0.00037519852,0.000033650063,0.000031678544,0.00004714322,0.00003451556,0.008076085],"genre_scores_gemma":[0.6226605,0.0006950039,0.35921037,0.00015193077,0.0000926777,0.00022723552,0.00021704647,0.000104918094,0.016640253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972373,0.000101532554,0.000012480518,0.00002789026,0.000104201245,0.000030124713],"domain_scores_gemma":[0.99947315,0.00021428356,0.000089946436,0.000035212208,0.00013867617,0.000048755086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010680595,0.0005436831,0.0005512712,0.00045816047,0.00039083275,0.0009740656,0.0005200241,0.00070280104,0.0014781196],"category_scores_gemma":[0.0022738413,0.00023669867,0.00036451413,0.0003713389,0.0011762466,0.0011402555,0.0010805803,0.0011140428,0.00025963978],"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.00003273861,0.000027525693,0.0003318072,0.00010451058,0.000011327019,0.00015416245,0.00011674296,0.28876394,0.003963073,0.68639743,0.0014541082,0.018642668],"study_design_scores_gemma":[0.000011493439,0.000031346597,0.00006924744,0.000015398853,0.0000026670382,0.000045540484,0.000024372275,0.8905484,0.0008060282,0.10581904,0.002617145,0.00000929261],"about_ca_topic_score_codex":0.0009822119,"about_ca_topic_score_gemma":0.0012975964,"teacher_disagreement_score":0.0014781196,"about_ca_system_score_codex":0.00067134463,"about_ca_system_score_gemma":0.001424435,"threshold_uncertainty_score":0.0056484938},"labels":[],"label_agreement":null},{"id":"W2056200673","doi":"10.1142/s0217595907001206","title":"CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN","year":2007,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Flexibility (engineering); Robustness (evolution); Stochastic programming; Computer science; Network planning and design; Stochastic optimization; Mathematical optimization; Stochastic modelling; Stochastic process; Service (business); Mathematics; Economics","score_opus":0.08042517883552801,"score_gpt":0.34705683999105846,"score_spread":0.26663166115553044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056200673","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.11843451,0.00057488383,0.86487037,0.0030089545,0.000056655885,0.00008368583,0.000103881066,0.0000789853,0.01278808],"genre_scores_gemma":[0.92782736,0.0006329359,0.06671366,0.00032189165,0.00015371984,0.00023059583,0.00005689061,0.000053486052,0.0040094997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958192,0.0025706694,0.00014623093,0.00037335575,0.00070463156,0.00038583274],"domain_scores_gemma":[0.98931074,0.00746276,0.0014980164,0.00062835275,0.000578352,0.000521776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053410237,0.0008187504,0.0014036582,0.0006203546,0.0010471586,0.0016691127,0.00088118244,0.0025734517,0.0017217613],"category_scores_gemma":[0.015295571,0.0007885194,0.0018143929,0.0012944494,0.0026355668,0.0021199558,0.002054947,0.0031532447,0.0001725653],"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.000052613614,0.000042262807,0.001032466,0.000048339756,0.000040450206,0.00050584826,0.00022924428,0.45189166,0.00047987752,0.53886807,0.00060338265,0.006205785],"study_design_scores_gemma":[0.000039569466,0.00006850998,0.00030861702,0.000019747815,0.000016537837,0.00012184861,0.000054336102,0.7243651,0.00028467976,0.27321365,0.0014846239,0.000022703145],"about_ca_topic_score_codex":0.004136022,"about_ca_topic_score_gemma":0.0026619367,"teacher_disagreement_score":0.0053410237,"about_ca_system_score_codex":0.0021897836,"about_ca_system_score_gemma":0.0022310799,"threshold_uncertainty_score":0.028246343},"labels":[],"label_agreement":null},{"id":"W2059572074","doi":"10.1142/s021759590500056x","title":"PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS","year":2005,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Science and Engineering Research Board; Serbian Academy of Sciences and Arts; National Science Foundation","keywords":"Computer science; Multiprocessor scheduling; Heuristics; Tabu search; Multiprocessing; Permutation (music); Scheduling (production processes); Parallel computing; Permutation matrix; Schedule; Job shop scheduling; Variable neighborhood search; Mathematical optimization; Metaheuristic; Theoretical computer science; Algorithm; Mathematics; Flow shop scheduling","score_opus":0.04156626148663788,"score_gpt":0.33006350023127445,"score_spread":0.28849723874463656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059572074","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.14423181,0.0019304563,0.8465071,0.00031921026,0.00009898934,0.00016671531,0.00013712869,0.00091104803,0.0056975787],"genre_scores_gemma":[0.6495554,0.0007285244,0.34641993,0.00010549317,0.000042031734,0.0002965154,0.00023628492,0.00013860257,0.002477225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995535,0.0002632995,0.000015105367,0.00003593505,0.00008584985,0.000046374047],"domain_scores_gemma":[0.99936277,0.00042514363,0.00007523768,0.000042943695,0.00006279514,0.00003113002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008741915,0.00061663036,0.0008627291,0.0009720701,0.00050257664,0.0006175257,0.0010799421,0.00078547874,0.00076681795],"category_scores_gemma":[0.0021085155,0.00040639058,0.00049782806,0.0014651777,0.0005930917,0.000748177,0.0003891514,0.00048629945,0.00014989241],"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.00004894331,0.00003639382,0.0002062751,0.000028733815,0.000022071861,0.000023804887,0.000028199827,0.96544147,0.00039515272,0.004617099,0.00046327835,0.028688604],"study_design_scores_gemma":[0.000020663636,0.000032502354,0.000083865016,0.000003472265,0.00000828439,0.000011829948,0.000009416459,0.9959039,0.00028284016,0.003187164,0.00045161217,0.0000044404674],"about_ca_topic_score_codex":0.008234906,"about_ca_topic_score_gemma":0.0069590756,"teacher_disagreement_score":0.008234906,"about_ca_system_score_codex":0.0013314626,"about_ca_system_score_gemma":0.001305338,"threshold_uncertainty_score":0.016373992},"labels":[],"label_agreement":null},{"id":"W2062677517","doi":"10.1142/s0217595911003016","title":"INTRODUCTION TO THE SPECIAL ISSUE ON \"OPERATIONAL RESEARCH AND ASIA RISK MANAGEMENT\"","year":2011,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Risk Management in Financial Firms","field":"Business, Management and Accounting","cited_by":5,"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 Toronto","funders":"","keywords":"Risk management; Operational risk management; Operational risk; Risk analysis (engineering); Management science; Computer science; Business; Engineering","score_opus":0.07325236802913186,"score_gpt":0.3327696629823044,"score_spread":0.25951729495317255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062677517","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005216663,0.043534312,0.0041214265,0.053678155,0.86494505,0.00009022904,0.0004691908,0.00022500358,0.032415025],"genre_scores_gemma":[0.0030352608,0.031982627,0.0015838393,0.021827718,0.89553577,0.00010050338,0.0005859027,0.00029173843,0.04505665],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695563,0.00070702954,0.0004279475,0.00039616306,0.0012823766,0.00023086192],"domain_scores_gemma":[0.982637,0.008592742,0.0013591363,0.001318919,0.0041769096,0.0019152168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044371784,0.0021626246,0.002484664,0.005829069,0.0021455635,0.0073389695,0.0021641448,0.0045235637,0.052964505],"category_scores_gemma":[0.0135673955,0.00054181763,0.0016765618,0.0046739876,0.0021986146,0.007050026,0.0032504639,0.0072981124,0.023916988],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000019690979,0.000023069351,0.00017286841,0.00024580263,0.000009555922,0.00006117111,0.0000556518,0.000075020704,0.00014688539,0.0043024216,0.9716026,0.023285244],"study_design_scores_gemma":[0.0000047970266,0.000026607802,0.00055482506,0.00027018838,0.000008978056,0.0001711916,0.000059647064,0.00013879208,0.0000605281,0.0028550199,0.9958397,0.0000097092425],"about_ca_topic_score_codex":0.0010943887,"about_ca_topic_score_gemma":0.0019896869,"teacher_disagreement_score":0.052964505,"about_ca_system_score_codex":0.0018303754,"about_ca_system_score_gemma":0.0022605548,"threshold_uncertainty_score":0.17718393},"labels":[],"label_agreement":null},{"id":"W2067647807","doi":"10.1142/s021759591100303x","title":"MULTIPLE CRITERIA ANALYSIS FOR EVALUATION OF INFORMATION SYSTEM RISK","year":2011,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":14,"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 Toronto","funders":"","keywords":"Outsourcing; Enterprise resource planning; Risk analysis (engineering); Computer science; Information system; Identification (biology); Set (abstract data type); Information technology; Process management; Business; Knowledge management; Engineering; Marketing","score_opus":0.5045986172732625,"score_gpt":0.5336432032935186,"score_spread":0.029044586020256058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067647807","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.0716967,0.003528308,0.9001246,0.00063826103,0.00017513637,0.0022790094,0.00047683678,0.00023006338,0.020851018],"genre_scores_gemma":[0.5231895,0.0011316696,0.47090533,0.000090872694,0.000074832365,0.00231197,0.0003419229,0.000060065817,0.0018937717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9602207,0.028229618,0.0015531752,0.0007252858,0.008564998,0.0007061402],"domain_scores_gemma":[0.96344405,0.029148072,0.0016711213,0.00066282775,0.004502228,0.0005718192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022587596,0.0026375568,0.0022693833,0.012526534,0.0016193751,0.0038124544,0.0013967421,0.0017445942,0.0050154408],"category_scores_gemma":[0.043487523,0.0005326533,0.002885357,0.008567707,0.0013105683,0.0019781082,0.002055799,0.002043525,0.00033639578],"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.00088650966,0.00058785075,0.010955686,0.0022775596,0.0017091702,0.0006385144,0.0015948062,0.60195345,0.0054535167,0.11768564,0.0043267272,0.25193056],"study_design_scores_gemma":[0.00008679234,0.0007917163,0.0038953777,0.00034963587,0.0002171097,0.0001296624,0.0007622736,0.95157355,0.001279955,0.03702647,0.0037651164,0.00012223596],"about_ca_topic_score_codex":0.0042415974,"about_ca_topic_score_gemma":0.004015744,"teacher_disagreement_score":0.022587596,"about_ca_system_score_codex":0.0047517437,"about_ca_system_score_gemma":0.0038212894,"threshold_uncertainty_score":0.11945605},"labels":[],"label_agreement":null},{"id":"W2080015090","doi":"10.1142/s0217595911003235","title":"OPTIMAL DESIGN OF A MULTI-STATE WEIGHTED SERIES-PARALLEL SYSTEM USING PHYSICAL PROGRAMMING AND GENETIC ALGORITHMS","year":2011,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":14,"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 Alberta","funders":"","keywords":"Component (thermodynamics); Reliability (semiconductor); Computer science; Mathematical optimization; Genetic algorithm; Series (stratigraphy); Optimization problem; Flexibility (engineering); Series and parallel circuits; Optimal design; Selection (genetic algorithm); State (computer science); Algorithm; Mathematics; Engineering; Artificial intelligence; Machine learning","score_opus":0.08133626238716024,"score_gpt":0.31160211068398724,"score_spread":0.230265848296827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080015090","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.049389485,0.0002901552,0.9446664,0.00019551512,0.00003642985,0.00009471378,0.0000369443,0.00016390378,0.005126519],"genre_scores_gemma":[0.7950022,0.00038786067,0.19944796,0.00008068095,0.0000357653,0.00035624762,0.00007541874,0.000073023795,0.0045410073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999481,0.00016115727,0.000021182399,0.00012748942,0.00014779568,0.00006137642],"domain_scores_gemma":[0.9993443,0.00033508314,0.00014861328,0.000030374624,0.000110069996,0.00003155944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011069524,0.0010691263,0.001152874,0.00072721415,0.00045597763,0.0010091008,0.0007831376,0.0009858729,0.0016995473],"category_scores_gemma":[0.0016833873,0.0007007943,0.0008851885,0.00065225124,0.0009990147,0.00083491206,0.0007176871,0.00077025354,0.00018081538],"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.000014738257,0.000013217843,0.0000839584,0.00002199106,0.000012735657,0.000020522471,0.000010840315,0.99309087,0.00069210917,0.0022032417,0.00006394277,0.0037718427],"study_design_scores_gemma":[0.000008581127,0.000031923613,0.00004576101,0.0000028861286,0.000006940942,0.0000065964737,0.0000057379566,0.9975937,0.00021565927,0.0019258786,0.00015337049,0.0000029869163],"about_ca_topic_score_codex":0.0034416723,"about_ca_topic_score_gemma":0.0034941183,"teacher_disagreement_score":0.0034416723,"about_ca_system_score_codex":0.0011222996,"about_ca_system_score_gemma":0.0013939748,"threshold_uncertainty_score":0.008142889},"labels":[],"label_agreement":null},{"id":"W2088618050","doi":"10.1142/s0217595908001651","title":"INVENTORY LOT-SIZE MODELS UNDER TRADE CREDITS: A REVIEW","year":2008,"lang":"en","type":"review","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Economic shortage; Strengths and weaknesses; Order (exchange); Payment; Inflation (cosmology); Economics; Trade credit; Operations research; Computer science; Actuarial science; Business; Engineering; Accounting; Finance; Government (linguistics); Psychology","score_opus":0.23242029081178098,"score_gpt":0.3901811978411353,"score_spread":0.15776090702935433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088618050","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001710378,0.97116977,0.018363524,0.0008456336,0.0002833118,0.000016948947,0.000091823706,0.00007510158,0.007443586],"genre_scores_gemma":[0.021377549,0.9716832,0.004557843,0.00016123235,0.00048355918,0.000026158179,0.00012118789,0.000014285737,0.0015749846],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951255,0.00011104554,0.00004464621,0.000100429075,0.00019793723,0.000033411467],"domain_scores_gemma":[0.9981462,0.0012517167,0.00017197308,0.000063885724,0.0003255763,0.00004073554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013412073,0.0013819726,0.002536584,0.0017039542,0.00030967526,0.0016200807,0.0028146694,0.0016373105,0.0025651301],"category_scores_gemma":[0.0027934944,0.0007642206,0.0009933047,0.004879593,0.00076686515,0.0028791158,0.00063127506,0.0011487445,0.0015465358],"study_design_candidate":"not_applicable","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.00013061013,0.00019355628,0.0016873708,0.012793235,0.0002673778,0.00032353395,0.00013730406,0.11089473,0.0008599864,0.118937716,0.026331991,0.72744256],"study_design_scores_gemma":[0.00007283015,0.00035697708,0.0031475849,0.008483997,0.0005748127,0.0017554078,0.00034654498,0.13136753,0.0020412414,0.1436664,0.7079363,0.0002503962],"about_ca_topic_score_codex":0.003711267,"about_ca_topic_score_gemma":0.0024871754,"teacher_disagreement_score":0.003711267,"about_ca_system_score_codex":0.0014047687,"about_ca_system_score_gemma":0.0022754124,"threshold_uncertainty_score":0.010192335},"labels":[],"label_agreement":null},{"id":"W2095555475","doi":"10.1142/s0217595911003053","title":"RISK MANAGEMENT UNDER A FACTOR STOCHASTIC VOLATILITY MODEL","year":2011,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","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":"Toronto Metropolitan University","funders":"","keywords":"Stochastic volatility; Volatility (finance); Econometrics; Expected shortfall; Portfolio; Value at risk; Economics; Model risk; Risk management; Actuarial science; Mathematics; Financial economics; Finance","score_opus":0.19753091352306168,"score_gpt":0.33085690324337647,"score_spread":0.13332598972031479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095555475","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.2195592,0.0012160743,0.7719877,0.00088973634,0.00008088894,0.000048589,0.00021491699,0.00024524212,0.0057577086],"genre_scores_gemma":[0.9806995,0.0005883337,0.0137730455,0.00007168718,0.00009640044,0.000047617665,0.00011909987,0.000033877874,0.0045703915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988211,0.00046104717,0.000054702898,0.0002782245,0.00021325152,0.00017167334],"domain_scores_gemma":[0.99784875,0.00114475,0.00051474245,0.00011562933,0.0002502567,0.00012590479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022047993,0.0010116474,0.0015752293,0.000625133,0.00035234305,0.0020481767,0.0012217136,0.0017997238,0.0017394214],"category_scores_gemma":[0.0055994005,0.00041564097,0.0010838365,0.00057827006,0.0010488194,0.0024336318,0.00097440626,0.0010124395,0.0001816736],"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.000075784264,0.000026006112,0.001316363,0.00004897285,0.00010190508,0.00017848282,0.000050473765,0.8796028,0.0013299797,0.11175723,0.00045362543,0.005058374],"study_design_scores_gemma":[0.000015637523,0.000037482074,0.0002640514,0.0000048273673,0.000016200518,0.000036600846,0.000008268775,0.96862316,0.00012349266,0.030649114,0.00020825925,0.000012964344],"about_ca_topic_score_codex":0.004659991,"about_ca_topic_score_gemma":0.0012465584,"teacher_disagreement_score":0.004659991,"about_ca_system_score_codex":0.00091673114,"about_ca_system_score_gemma":0.0008111363,"threshold_uncertainty_score":0.011660278},"labels":[],"label_agreement":null},{"id":"W2099949338","doi":"10.1142/s0217595914400016","title":"ON MULTISERVER RETRIAL QUEUES: HISTORY, OKUBO-TYPE HYPERGEOMETRIC SYSTEMS AND MATRIX CONTINUED-FRACTIONS","year":2014,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Generating function; Applied mathematics; Singularity; Hypergeometric function; Hypergeometric distribution; Taylor series; Matrix (chemical analysis); Markov chain; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.056794314662746925,"score_gpt":0.33760670257978215,"score_spread":0.2808123879170352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099949338","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.44741443,0.006136814,0.48075503,0.004473605,0.00038183897,0.00009194933,0.0001815915,0.00015275387,0.060411893],"genre_scores_gemma":[0.97314507,0.0017860236,0.013238525,0.0002477114,0.00029558473,0.000047751702,0.000057423273,0.000028025448,0.011153927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996345,0.00012316743,0.000015681459,0.000048551723,0.00010404757,0.0000739751],"domain_scores_gemma":[0.9990107,0.0004270055,0.00020656515,0.000056226716,0.00015521498,0.00014428094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012142226,0.00043396748,0.0005305973,0.001099563,0.000862704,0.0015023971,0.00078482146,0.0009915517,0.0020190917],"category_scores_gemma":[0.0039575924,0.00024210215,0.00052765995,0.0009989543,0.0015256157,0.0023341407,0.0009977967,0.001070283,0.0002966888],"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.000010646519,0.000011684196,0.00050716946,0.000022787794,0.000004806571,0.00013544207,0.0001531051,0.016133074,0.00046579313,0.9798933,0.00042714586,0.002235078],"study_design_scores_gemma":[0.000021610798,0.000028174964,0.00056189054,0.000032250733,0.000008929941,0.00017241032,0.00014933695,0.3638012,0.00044162027,0.6308466,0.0039101476,0.000025748648],"about_ca_topic_score_codex":0.004031183,"about_ca_topic_score_gemma":0.0022724192,"teacher_disagreement_score":0.004031183,"about_ca_system_score_codex":0.0018644691,"about_ca_system_score_gemma":0.0009329092,"threshold_uncertainty_score":0.013527691},"labels":[],"label_agreement":null},{"id":"W2103654611","doi":"10.1142/s0217595914500249","title":"IMPROVING CONSISTENCY EVALUATION IN FUZZY MULTI-ATTRIBUTE PAIRWISE COMPARISON-BASED DECISION-MAKING METHODS","year":2014,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Natural Resources; University of Alberta","funders":"","keywords":"Pairwise comparison; Consistency (knowledge bases); Vagueness; Computer science; Data mining; Fuzzy logic; Set (abstract data type); Fuzzy set; Reliability (semiconductor); Mathematics; Artificial intelligence","score_opus":0.40707566053770367,"score_gpt":0.5853305995668792,"score_spread":0.1782549390291755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103654611","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.009037234,0.00030990998,0.98978406,0.00006160131,0.000031204538,0.0001229937,0.000025993544,0.000098872624,0.0005281692],"genre_scores_gemma":[0.17297041,0.00022696683,0.8257801,0.000060116887,0.00005098411,0.00041660917,0.00012566904,0.00007095298,0.00029814275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9610442,0.023028884,0.0025077264,0.0026040087,0.010165673,0.00064960984],"domain_scores_gemma":[0.93596584,0.048342835,0.0033436345,0.0027712856,0.009067972,0.00050846045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.045709234,0.0017737293,0.0034089163,0.0049060015,0.0016873345,0.0031612753,0.0041560545,0.001923959,0.0017674901],"category_scores_gemma":[0.08702414,0.0010954787,0.0027872755,0.0052841324,0.001559008,0.003785853,0.0037438339,0.0033387851,0.00033698315],"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.0006459983,0.0003478322,0.0074926,0.0014389222,0.0011814018,0.0003933453,0.0015577374,0.5376955,0.0054354095,0.05143807,0.001377181,0.39099604],"study_design_scores_gemma":[0.000063931235,0.00026514026,0.0010168315,0.000114524315,0.00012723534,0.00009967008,0.00011665154,0.9580546,0.0031987622,0.03564505,0.0012373393,0.00006029807],"about_ca_topic_score_codex":0.001712732,"about_ca_topic_score_gemma":0.0012304971,"teacher_disagreement_score":0.045709234,"about_ca_system_score_codex":0.0018771599,"about_ca_system_score_gemma":0.0025674405,"threshold_uncertainty_score":0.24173647},"labels":[],"label_agreement":null},{"id":"W2105055176","doi":"10.1142/s0217595913400022","title":"A SMOOTHING PENALIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC PROGRAMS WITH SECOND-ORDER STOCHASTIC DOMINANCE CONSTRAINTS","year":2013,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Mathematics; Smoothing; Mathematical optimization; Stochastic dominance; Sample size determination; Applied mathematics; Rate of convergence; Bellman equation; Function (biology); Discretization; Minification; Penalty method; Exponential function; Sample (material); Convergence (economics); Computer science; Statistics; Mathematical analysis","score_opus":0.11957889688163752,"score_gpt":0.4312643474946223,"score_spread":0.31168545061298475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105055176","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.0013879057,0.00009963724,0.9980988,0.00004068709,0.000021491443,0.000009118379,0.000007806887,0.000056299985,0.0002782116],"genre_scores_gemma":[0.19060554,0.0005207213,0.80412745,0.0001898919,0.00013823048,0.00024204025,0.00017250162,0.00016780595,0.0038356495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990701,0.00038757766,0.000038123253,0.00011919433,0.000325369,0.00005970813],"domain_scores_gemma":[0.9986432,0.0008218571,0.00009846862,0.000096784606,0.00027666532,0.00006301229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016493112,0.00080518203,0.0012439673,0.00067154557,0.00037811196,0.00087266526,0.0013108711,0.001190491,0.0018347627],"category_scores_gemma":[0.003444575,0.00047068845,0.001072764,0.00070439023,0.0006684637,0.0010012983,0.00082989316,0.0018401606,0.00039402233],"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.00007245666,0.000057570054,0.0004618661,0.00014428567,0.000080931524,0.00007310822,0.000057892183,0.89031154,0.005417679,0.034264002,0.0012817666,0.067776926],"study_design_scores_gemma":[0.0000027316246,0.000010916217,0.000022961565,0.000002642531,0.000002643295,0.000008232335,0.0000012607982,0.9976278,0.0002483771,0.0016682304,0.00040137005,0.0000029127477],"about_ca_topic_score_codex":0.0033227722,"about_ca_topic_score_gemma":0.0024672071,"teacher_disagreement_score":0.0033227722,"about_ca_system_score_codex":0.0005873798,"about_ca_system_score_gemma":0.0014033186,"threshold_uncertainty_score":0.008722484},"labels":[],"label_agreement":null},{"id":"W2166107721","doi":"10.1142/s0217595913500218","title":"ROBUST INTERVAL-BASED MINIMAX-REGRET ANALYSIS METHOD FOR FILTER MANAGEMENT OF FLUID POWER SYSTEM","year":2013,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Beijing University of Technology; McMaster University","keywords":"Regret; Downtime; Filter (signal processing); Reliability engineering; Computer science; Interval (graph theory); Reliability (semiconductor); Probabilistic logic; Risk analysis (engineering); Mathematical optimization; Operations research; Engineering; Power (physics); Mathematics; Artificial intelligence","score_opus":0.05233666809748597,"score_gpt":0.3098325139099416,"score_spread":0.25749584581245566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166107721","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.007846479,0.0002519073,0.9900366,0.00016726658,0.0000262286,0.000037253587,0.00003958403,0.000096271375,0.0014984853],"genre_scores_gemma":[0.75958645,0.00068346865,0.23372917,0.00025030767,0.0001534045,0.0004984152,0.00026687622,0.00013551269,0.0046963273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983335,0.0008591767,0.00006212878,0.00022357223,0.00033774532,0.00018390901],"domain_scores_gemma":[0.9954782,0.0034462253,0.0003341123,0.00009301219,0.0005455459,0.00010302386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040568784,0.001381224,0.0017004173,0.00076126854,0.0005275322,0.0014963733,0.0014547297,0.0013670119,0.0032447772],"category_scores_gemma":[0.0069721933,0.0005629288,0.0013147615,0.00062381657,0.00089198217,0.0012437825,0.0011601803,0.002129605,0.00026244743],"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.000035492085,0.000021338585,0.00022470123,0.00004497699,0.000039719056,0.00003758262,0.000021577129,0.98650384,0.00036365134,0.005480973,0.00031999592,0.00690615],"study_design_scores_gemma":[0.0000028199465,0.000011449226,0.000031662377,0.0000025027555,0.0000041273734,0.000003583169,0.0000022976697,0.9985676,0.0000741669,0.0012382005,0.00005894807,0.0000026245743],"about_ca_topic_score_codex":0.005196418,"about_ca_topic_score_gemma":0.0027129813,"teacher_disagreement_score":0.005196418,"about_ca_system_score_codex":0.0015088458,"about_ca_system_score_gemma":0.001997434,"threshold_uncertainty_score":0.02145511},"labels":[],"label_agreement":null},{"id":"W2168500957","doi":"10.1142/s0217595915500086","title":"DEA Models for Parallel Systems: Game-Theoretic Approaches","year":2014,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Shanghai Municipal Education Commission; National Natural Science Foundation of China; Shanghai Education Development Foundation; Natural Science Foundation of Shanghai","keywords":"Data envelopment analysis; Stackelberg competition; Set (abstract data type); Computer science; Component (thermodynamics); Sequence (biology); Black box; Game theory; Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Mathematical economics","score_opus":0.33683346457804736,"score_gpt":0.4471171203260393,"score_spread":0.11028365574799193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168500957","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.004884955,0.0010022464,0.98420125,0.00036394523,0.000046788547,0.0000924283,0.00010632793,0.000051595474,0.009250529],"genre_scores_gemma":[0.71501434,0.005524443,0.25999558,0.00036752163,0.00028511515,0.0011915597,0.00035858338,0.00012713509,0.017135853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816567,0.0010028768,0.000073277515,0.00023124971,0.00035884624,0.00016808443],"domain_scores_gemma":[0.99728847,0.0020136787,0.00024133883,0.000087753164,0.0002631203,0.00010568318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003292942,0.002466847,0.0021081595,0.0014999828,0.0007954764,0.0029661818,0.002325322,0.0018215412,0.0045579695],"category_scores_gemma":[0.005413797,0.0010789925,0.0014927115,0.0019547532,0.001925729,0.002569697,0.002161394,0.0026770462,0.00056243484],"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.000009789039,0.000028203793,0.00011880629,0.000042262785,0.000029034767,0.0000330836,0.000039932023,0.8927473,0.00012505092,0.10286394,0.00036579318,0.0035967454],"study_design_scores_gemma":[0.0000053396343,0.000008505738,0.000026871,0.000008897077,0.0000051501715,0.0000070424785,0.000017475724,0.94847083,0.000036454436,0.05061642,0.00079108676,0.00000587343],"about_ca_topic_score_codex":0.010911608,"about_ca_topic_score_gemma":0.0081335325,"teacher_disagreement_score":0.010911608,"about_ca_system_score_codex":0.0035125846,"about_ca_system_score_gemma":0.0018934302,"threshold_uncertainty_score":0.025485754},"labels":[],"label_agreement":null},{"id":"W2595965212","doi":"10.1142/s0217595917500099","title":"The Supplying Chain Scheduling with Outsourcing and Transportation","year":2017,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"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 New Brunswick","funders":"","keywords":"Outsourcing; Scheduling (production processes); Supply chain; Computer science; Operations research; Job shop scheduling; Schedule; Supply chain management; Operations management; Mathematical optimization; Business; Mathematics; Engineering; Marketing; Operating system","score_opus":0.03636940252046441,"score_gpt":0.314691723051226,"score_spread":0.2783223205307616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595965212","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.06756442,0.0007562574,0.9157661,0.0012315887,0.00017398497,0.00015632572,0.000439188,0.00021996636,0.013692158],"genre_scores_gemma":[0.75852215,0.0016437186,0.21641739,0.00023869057,0.000312333,0.0002457255,0.00060068874,0.00021076507,0.021808539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888414,0.00037203883,0.000043386044,0.00025694462,0.00021063288,0.00023283293],"domain_scores_gemma":[0.9990797,0.00040566523,0.00013015984,0.00013274499,0.0001114322,0.0001402255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655327,0.0013396975,0.0020463949,0.00066310115,0.0013649409,0.0016403829,0.0022240449,0.001478204,0.006883181],"category_scores_gemma":[0.0024408358,0.0008378297,0.001347866,0.0027780607,0.0012521716,0.002912156,0.0018418544,0.0016587828,0.0006844851],"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.00012208284,0.00008121077,0.00046365152,0.00014921329,0.000033233486,0.00030477098,0.00011160946,0.919551,0.000759266,0.058078192,0.0033643455,0.016981393],"study_design_scores_gemma":[0.000028514403,0.000032756776,0.00013070858,0.000011506092,0.000013008425,0.000075180986,0.000037217287,0.96830755,0.00038126204,0.028933672,0.00203555,0.000013050861],"about_ca_topic_score_codex":0.019069359,"about_ca_topic_score_gemma":0.00896219,"teacher_disagreement_score":0.019069359,"about_ca_system_score_codex":0.0024721434,"about_ca_system_score_gemma":0.0023632115,"threshold_uncertainty_score":0.03791678},"labels":[],"label_agreement":null},{"id":"W2769934030","doi":"10.1142/s0217595917500324","title":"Efficiency Measurement of Multistage Processes: Context Dependent Numbers of Stages","year":2017,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Revenue; Benchmarking; Context (archaeology); Stage (stratigraphy); Set (abstract data type); Operations research; Econometrics; Computer science; Group (periodic table); Mathematical optimization; Economics; Microeconomics; Business; Mathematics; Marketing; Finance","score_opus":0.25379913212239535,"score_gpt":0.4793348763853889,"score_spread":0.22553574426299355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769934030","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.09783046,0.00043040738,0.897335,0.00022607602,0.000020094783,0.00014618924,0.00012933284,0.000062033505,0.0038203362],"genre_scores_gemma":[0.91109186,0.0003779966,0.08737164,0.000037783095,0.000026375219,0.00020233376,0.000090978836,0.000021606627,0.0007794203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98553675,0.008842174,0.00063797086,0.0021368992,0.0020682286,0.00077799446],"domain_scores_gemma":[0.9646216,0.025822228,0.004681343,0.0029960722,0.0014036959,0.0004750855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01028318,0.0011290207,0.0018130143,0.0016874776,0.0006757012,0.0032704198,0.002001014,0.0016663397,0.0014682903],"category_scores_gemma":[0.033587642,0.0009528447,0.0017049108,0.0030722413,0.0023439226,0.0051141027,0.0026102827,0.0021847258,0.00013687299],"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.00015690023,0.00014840969,0.0067936606,0.00021118815,0.0001165491,0.00013507147,0.00016991337,0.8565173,0.0027490577,0.1118681,0.00016944863,0.020964371],"study_design_scores_gemma":[0.00001074565,0.000085880514,0.002130772,0.000031425905,0.000024262481,0.000026042704,0.000079417776,0.9575888,0.0018585933,0.037626944,0.000512648,0.00002440618],"about_ca_topic_score_codex":0.0030189394,"about_ca_topic_score_gemma":0.002210323,"teacher_disagreement_score":0.01028318,"about_ca_system_score_codex":0.0029285136,"about_ca_system_score_gemma":0.0016088593,"threshold_uncertainty_score":0.054383337},"labels":[],"label_agreement":null},{"id":"W2892251471","doi":"10.1142/s0217595918500380","title":"Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers","year":2018,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Throughput; Flexibility (engineering); Computer science; Computer network; Markov process; Distributed computing; Queue; Infinity; Mathematics; Operating system; Statistics","score_opus":0.04527977279817552,"score_gpt":0.3255007031245078,"score_spread":0.2802209303263323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892251471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50562674,0.0014590655,0.47739324,0.0010863497,0.00011077001,0.000080181744,0.00023021418,0.0005883826,0.013425054],"genre_scores_gemma":[0.991236,0.00027767886,0.0061541446,0.00008175017,0.00004206509,0.00005248162,0.000055697754,0.000045024317,0.0020551686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980562,0.00052988355,0.00006300847,0.00027706358,0.00031972592,0.0007541712],"domain_scores_gemma":[0.9905813,0.006384405,0.0011979033,0.00040152064,0.0007602538,0.0006746726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490249,0.0013415675,0.0016603384,0.0015381521,0.0013803514,0.0022879175,0.0017382394,0.0014292628,0.0023309027],"category_scores_gemma":[0.016271818,0.00091319386,0.0010713888,0.0010966355,0.0032774985,0.0034919712,0.002240058,0.0018033416,0.00039201765],"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.00034233724,0.000109336725,0.0022445663,0.00017524524,0.00012424805,0.0007880225,0.00047630715,0.82978714,0.009488986,0.15017071,0.0012527838,0.0050403094],"study_design_scores_gemma":[0.00002579715,0.00007016513,0.00049014424,0.0000225826,0.00003323165,0.00011196103,0.000120696655,0.9451446,0.0008936632,0.052833103,0.00022804074,0.000026109627],"about_ca_topic_score_codex":0.0051628505,"about_ca_topic_score_gemma":0.00254125,"teacher_disagreement_score":0.0051628505,"about_ca_system_score_codex":0.0040861736,"about_ca_system_score_gemma":0.0022450981,"threshold_uncertainty_score":0.02964735},"labels":[],"label_agreement":null},{"id":"W2895123774","doi":"10.1142/s0217595918500422","title":"Evaluating the Efficiencies of Academic Research Groups: A Problem of Shared Outputs","year":2018,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Set (abstract data type); Computer science; Group (periodic table); Operations research; Work (physics); Management science; Mathematical optimization; Mathematics; Economics; Engineering","score_opus":0.5016388177665313,"score_gpt":0.5807102904807587,"score_spread":0.07907147271422743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895123774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18068501,0.0016980948,0.80426854,0.0020419469,0.000056901597,0.0006678447,0.00062241126,0.00012507653,0.009834139],"genre_scores_gemma":[0.77950037,0.0005126399,0.2175346,0.00011144144,0.00006139403,0.001037364,0.00033475168,0.0000834213,0.00082402636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.77703214,0.15779549,0.0144654,0.019179838,0.02662792,0.0048992727],"domain_scores_gemma":[0.7069176,0.22285736,0.032232467,0.021443259,0.014088603,0.0024607703],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.11248327,0.0028904248,0.0076202764,0.012829352,0.0030237227,0.012640336,0.0053333207,0.004142597,0.0018902456],"category_scores_gemma":[0.27587497,0.0020313098,0.004354945,0.018199334,0.0069476366,0.012498106,0.011471047,0.0028357112,0.00038970157],"study_design_candidate":"observational","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.00072586053,0.0005668252,0.062248614,0.0025308928,0.0041338117,0.0010251113,0.006179353,0.35930908,0.0029656498,0.3144485,0.001552027,0.24431424],"study_design_scores_gemma":[0.00020834178,0.00065973063,0.021906149,0.000986907,0.0008935064,0.0006322461,0.0052290848,0.379668,0.006523826,0.5758652,0.007205993,0.00022102214],"about_ca_topic_score_codex":0.0032715253,"about_ca_topic_score_gemma":0.0015065919,"teacher_disagreement_score":0.88751674,"about_ca_system_score_codex":0.009449983,"about_ca_system_score_gemma":0.008135641,"threshold_uncertainty_score":0.5948755},"labels":[],"label_agreement":null},{"id":"W2912703927","doi":"10.1142/s0217595919500039","title":"Customer Strategic Joining Behavior in Markovian Queues with Working Vacations and Vacation Interruptions Under Bernoulli Schedule","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Unobservable; Bernoulli's principle; Schedule; Queue; Computer science; Markov process; Queueing theory; Queue management system; Operations research; Mathematical optimization; Computer network; Mathematics; Econometrics; Engineering; Statistics","score_opus":0.08036126464956433,"score_gpt":0.35213213953252576,"score_spread":0.2717708748829614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912703927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494273,0.00013104694,0.048499245,0.0003278042,0.000016866577,0.000036932335,0.000050809285,0.00005761181,0.0014524047],"genre_scores_gemma":[0.99820054,0.0000483813,0.0012274778,0.000018493927,0.000007874151,0.000011767547,0.00001938927,0.000004139955,0.00046192887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978787,0.0007595384,0.00008057502,0.0003210491,0.00026803304,0.0006922291],"domain_scores_gemma":[0.9902958,0.006079449,0.0018731646,0.00030798893,0.0006321982,0.00081134454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033876577,0.00052962004,0.00085912365,0.0006928883,0.0008595666,0.0015010185,0.001472184,0.0012468648,0.0012954354],"category_scores_gemma":[0.007971333,0.00058951916,0.0006313021,0.000691908,0.0014268503,0.0016975824,0.0008474592,0.00094206334,0.00013978782],"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.0007020632,0.00034970455,0.034733642,0.0000939394,0.00016212276,0.0008479635,0.00088993955,0.88708967,0.0041337023,0.061992433,0.0009011043,0.008103761],"study_design_scores_gemma":[0.00002010508,0.00008670147,0.0024870944,0.0000048047214,0.00002181562,0.00006913096,0.00019580896,0.9915181,0.00021861511,0.005273694,0.00008039671,0.000023708673],"about_ca_topic_score_codex":0.012096578,"about_ca_topic_score_gemma":0.009898381,"teacher_disagreement_score":0.012096578,"about_ca_system_score_codex":0.0018924781,"about_ca_system_score_gemma":0.0018821788,"threshold_uncertainty_score":0.024052322},"labels":[],"label_agreement":null},{"id":"W2943886563","doi":"10.1142/s0217595919400086","title":"An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"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 Manitoba","funders":"National Natural Science Foundation of China","keywords":"Computation; Convergence (economics); Quadratic equation; Mathematical optimization; Applied mathematics; Regression; Algorithm; Gradient method; Computer science; Quadratic programming; Least-squares function approximation; Mathematics; Proximal Gradient Methods; Gradient descent; Artificial intelligence; Statistics","score_opus":0.12231513977116805,"score_gpt":0.402842736482826,"score_spread":0.28052759671165794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943886563","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.0010834128,0.000099224846,0.99824345,0.000058184993,0.000025716614,0.000012584551,0.000011960124,0.000070561066,0.00039488744],"genre_scores_gemma":[0.11367348,0.0006021018,0.8816842,0.00018693897,0.00013109094,0.0001947021,0.00015744961,0.00012282647,0.003247222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993055,0.00026349942,0.00002543951,0.000106170366,0.00027435113,0.000024961055],"domain_scores_gemma":[0.9995419,0.00021547418,0.000050437582,0.00004483667,0.00012086764,0.000026638116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474281,0.00092485244,0.0011128872,0.000451889,0.00029784994,0.0006732537,0.00094302243,0.001126993,0.002026387],"category_scores_gemma":[0.0026441037,0.00044200922,0.0005613169,0.00059378706,0.00075033505,0.0013163778,0.0011472749,0.0015525409,0.0006091566],"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.00014284538,0.00008326744,0.0004337305,0.0005113424,0.00010306306,0.00024473475,0.00014457454,0.6518097,0.016492253,0.07085271,0.004638794,0.25454298],"study_design_scores_gemma":[0.000007873734,0.00002977064,0.000044065044,0.000008534883,0.000004389892,0.00004367433,0.0000044207254,0.9937802,0.0012138054,0.003585782,0.0012695072,0.000007879915],"about_ca_topic_score_codex":0.0013017074,"about_ca_topic_score_gemma":0.0011691666,"teacher_disagreement_score":0.002026387,"about_ca_system_score_codex":0.0002915101,"about_ca_system_score_gemma":0.0010216341,"threshold_uncertainty_score":0.006778896},"labels":[],"label_agreement":null},{"id":"W2946332541","doi":"10.1142/s0217595919500192","title":"Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bulk queue; Queue; Queueing theory; Fork–join queue; Computer science; Multilevel queue; Mean value analysis; Queue management system; Set (abstract data type); Limiting; Mathematics; Computer network; Engineering","score_opus":0.037873178342053115,"score_gpt":0.3390445940980144,"score_spread":0.3011714157559613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946332541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5520676,0.0021189114,0.42570138,0.0029500176,0.00030981205,0.00011822339,0.00019003435,0.00072828686,0.015815778],"genre_scores_gemma":[0.98908335,0.0003096191,0.007288916,0.00010516853,0.00008642863,0.000033134434,0.000070111615,0.000046328223,0.0029768937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766135,0.00095524394,0.000047976984,0.00032018003,0.00044013755,0.00057510403],"domain_scores_gemma":[0.9896728,0.0062784315,0.00090387894,0.00038286427,0.0014947723,0.0012673488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004959127,0.0012561195,0.0018552534,0.0012260433,0.0015200025,0.0027802044,0.0032882988,0.002164878,0.0033068734],"category_scores_gemma":[0.013529018,0.0006849624,0.0008282469,0.0011331367,0.002276933,0.0033143312,0.0020804398,0.0020857856,0.00046420994],"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.00032162396,0.00014272601,0.0014589756,0.00007577837,0.000069799324,0.00014032992,0.00022568768,0.92658985,0.0024299754,0.06297435,0.0014914215,0.004079577],"study_design_scores_gemma":[0.000009646912,0.000043829365,0.00007514918,0.0000029799983,0.0000091944175,0.000011816533,0.000022298276,0.99596584,0.000111029185,0.0036648687,0.00007523759,0.000008130465],"about_ca_topic_score_codex":0.012377255,"about_ca_topic_score_gemma":0.004368575,"teacher_disagreement_score":0.012377255,"about_ca_system_score_codex":0.0038244766,"about_ca_system_score_gemma":0.002897817,"threshold_uncertainty_score":0.027748644},"labels":[],"label_agreement":null},{"id":"W3118251183","doi":"10.1142/s021759592050058x","title":"The Coordinator Role of Trade Credit Contract for Coordinating Integrated Pricing and Periodic Review Inventory Decisions With Stochastic Demand","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Université du Québec à Montréal","funders":"","keywords":"Trade credit; Supply chain; Microeconomics; Sensitivity (control systems); Supply and demand; Business; Economics; Industrial organization; Finance; Marketing","score_opus":0.0440163946220916,"score_gpt":0.31262804932224403,"score_spread":0.2686116547001524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118251183","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.09610453,0.00016717064,0.89151406,0.00048758095,0.000082468694,0.00026976105,0.00007943427,0.00015139642,0.011143621],"genre_scores_gemma":[0.9585588,0.00010173934,0.038496103,0.000052463354,0.00003888389,0.000121074976,0.000034860146,0.000020693307,0.002575357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968599,0.0013055981,0.0001447954,0.0005339861,0.00078437617,0.00037133184],"domain_scores_gemma":[0.9947982,0.0023837863,0.00084812514,0.0007859499,0.00069561705,0.00048827013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049846177,0.00064056297,0.00089517963,0.00048927753,0.0007819788,0.0024572369,0.0017218565,0.0015566851,0.0043111863],"category_scores_gemma":[0.013583563,0.00047947388,0.0005366016,0.0008865665,0.0015757903,0.0031057543,0.001734265,0.0015824573,0.0003554615],"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.00059553457,0.00019597674,0.0036008086,0.00012096608,0.000056331006,0.00046052184,0.0003357222,0.75551236,0.0074024643,0.17499556,0.0022920351,0.054431662],"study_design_scores_gemma":[0.000050353297,0.000121484896,0.00040005002,0.0000136905455,0.000013383176,0.000106406675,0.00006925983,0.9696399,0.0012662247,0.026765421,0.0015328174,0.000020944548],"about_ca_topic_score_codex":0.0020414132,"about_ca_topic_score_gemma":0.0013280489,"teacher_disagreement_score":0.0049846177,"about_ca_system_score_codex":0.0014443162,"about_ca_system_score_gemma":0.003739543,"threshold_uncertainty_score":0.026361465},"labels":[],"label_agreement":null},{"id":"W3125922185","doi":"10.1142/s0217595921400017","title":"Non-Submodular Maximization with Matroid and Knapsack Constraints","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"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 New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Maximization; Mathematics; Constraint (computer-aided design); Greedy algorithm; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Geometry","score_opus":0.04239402338292181,"score_gpt":0.3160553754276193,"score_spread":0.2736613520446975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125922185","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.017506197,0.00077333616,0.97413456,0.0006130693,0.000084057516,0.00008674457,0.00024811798,0.00019216751,0.0063615935],"genre_scores_gemma":[0.5296379,0.0018897834,0.45453954,0.00046375417,0.00034160537,0.00039272817,0.000660769,0.0003952015,0.011678795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860805,0.00065241853,0.000038372422,0.0003323941,0.00021653813,0.0001522576],"domain_scores_gemma":[0.9964384,0.0025521251,0.00036964592,0.00030568018,0.00016349369,0.00017073248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064294,0.002064854,0.0022955616,0.00075373094,0.00047753126,0.0017902035,0.0028365543,0.0016021392,0.0050338344],"category_scores_gemma":[0.006923957,0.0007777476,0.0012722701,0.0028585654,0.0014189099,0.003960577,0.0017930219,0.0024084249,0.0010454591],"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.00015872976,0.00022782308,0.0004010021,0.00054847274,0.00013400555,0.00027972338,0.00008863597,0.8055757,0.0021796108,0.13874932,0.008088115,0.04356889],"study_design_scores_gemma":[0.000016647698,0.00005223901,0.00009947647,0.00001748623,0.000017827258,0.00007867061,0.000021532282,0.93157214,0.00058312353,0.06626979,0.0012605177,0.000010535702],"about_ca_topic_score_codex":0.0021280209,"about_ca_topic_score_gemma":0.0022497699,"teacher_disagreement_score":0.0050338344,"about_ca_system_score_codex":0.0016902754,"about_ca_system_score_gemma":0.0013001369,"threshold_uncertainty_score":0.016839802},"labels":[],"label_agreement":null},{"id":"W4200186865","doi":"10.1142/s0217595922400048","title":"Online-Retail Supply Chain Optimization with Credit Period and Selling Price-Dependent Demand","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":3,"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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Supply chain; Business; Payment; Credit card; Cash; Trade credit; Demand chain; Industrial organization; Microeconomics; Commerce; Supply chain management; Finance; Service management; Marketing; Economics","score_opus":0.045010174137838165,"score_gpt":0.28578105130841497,"score_spread":0.2407708771705768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200186865","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.25744048,0.0006338897,0.7314172,0.00063126726,0.00008693126,0.0002540963,0.00042004252,0.00023277392,0.008883383],"genre_scores_gemma":[0.9794573,0.00020053828,0.015418882,0.000031092946,0.0000228843,0.00007297307,0.000095059884,0.000019055415,0.0046821786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895966,0.00042522573,0.000053177933,0.00023755318,0.00011743439,0.00020686035],"domain_scores_gemma":[0.9965578,0.0021109611,0.0005894762,0.00018502068,0.00031173314,0.0002449705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019277646,0.0012281699,0.0020647862,0.0005376867,0.00069358863,0.0015198026,0.0013811752,0.0018570776,0.0046159932],"category_scores_gemma":[0.0037939728,0.00066885183,0.0007244076,0.0012085807,0.0011164768,0.002295351,0.0013764461,0.0013811325,0.00032459115],"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.0001328509,0.00007841082,0.0007456526,0.000051374835,0.000029059938,0.00013721059,0.000031446045,0.98334587,0.00048177651,0.0076773427,0.00034937984,0.006939593],"study_design_scores_gemma":[0.00002660652,0.00006163288,0.000231434,0.000004552182,0.000010712998,0.000023801238,0.00002179763,0.992642,0.00017332217,0.006603922,0.00019201323,0.000008219872],"about_ca_topic_score_codex":0.008795048,"about_ca_topic_score_gemma":0.006476455,"teacher_disagreement_score":0.008795048,"about_ca_system_score_codex":0.0014633992,"about_ca_system_score_gemma":0.0014063073,"threshold_uncertainty_score":0.017487705},"labels":[],"label_agreement":null},{"id":"W4226523135","doi":"10.1142/s0217595922500129","title":"Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times","year":2022,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Computation; Integer programming; Mathematical optimization; Multiplicity (mathematics); Heuristic; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.040207361377749454,"score_gpt":0.29309479929100035,"score_spread":0.2528874379132509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226523135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60881245,0.00084798806,0.38309762,0.00021533539,0.0001901027,0.00029361199,0.00014917889,0.00030671907,0.0060870643],"genre_scores_gemma":[0.91154027,0.00032078623,0.08537283,0.00003950454,0.000060486138,0.00014081875,0.00012463506,0.00008053109,0.0023200864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992724,0.00024075284,0.000039436116,0.00012279917,0.00012832475,0.00019627517],"domain_scores_gemma":[0.99858356,0.0006314019,0.00035023183,0.00015832532,0.000092235394,0.00018423457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808022,0.0011362323,0.0013488927,0.00061210117,0.0011648639,0.0011747696,0.0014511013,0.0008317073,0.0012539004],"category_scores_gemma":[0.0018472457,0.0008981114,0.000966124,0.0014025704,0.0006207796,0.0010447109,0.0008573626,0.0009369548,0.0002204905],"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.00050286594,0.00018919207,0.0021461488,0.000273002,0.0001145684,0.0007273211,0.00008912033,0.9553753,0.018329581,0.0050453166,0.00054356235,0.01666412],"study_design_scores_gemma":[0.00005149575,0.0002749379,0.0018894963,0.000010519724,0.000043147116,0.00020721323,0.00006591239,0.98644173,0.0046611642,0.005104606,0.0012252323,0.000024551098],"about_ca_topic_score_codex":0.0021613345,"about_ca_topic_score_gemma":0.0035905493,"teacher_disagreement_score":0.0021613345,"about_ca_system_score_codex":0.00076150795,"about_ca_system_score_gemma":0.0011369507,"threshold_uncertainty_score":0.0055251718},"labels":[],"label_agreement":null},{"id":"W4360610866","doi":"10.1142/s0217595923400122","title":"Minimization Problems with Non-Submodular Cover Constraint","year":2023,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Cover (algebra); Constraint (computer-aided design); Set function; Set cover problem; Mathematics; Greedy algorithm; Set (abstract data type); Mathematical optimization; Covering problems; Function (biology); Computer science","score_opus":0.06893791714868018,"score_gpt":0.33205864503315735,"score_spread":0.26312072788447716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360610866","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.0446072,0.0035676027,0.93112123,0.0022357926,0.00026822285,0.0001806098,0.00062772946,0.00027690767,0.017114848],"genre_scores_gemma":[0.59310734,0.0048381896,0.38264105,0.0008508421,0.0008034516,0.0005801544,0.0014619323,0.00034303064,0.015373949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986827,0.00045185848,0.000053036994,0.00030900334,0.00031555982,0.00018781885],"domain_scores_gemma":[0.99774253,0.0017045244,0.00018032645,0.00013903421,0.00013259689,0.00010102161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014060308,0.0015601915,0.0019777007,0.00074015395,0.0005578833,0.0018893419,0.0016327734,0.0018680611,0.0048266836],"category_scores_gemma":[0.004798183,0.0004976485,0.0013733023,0.0018564316,0.00086436066,0.0030731673,0.0015944594,0.002165109,0.00066574826],"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.0002243816,0.00036385073,0.001165151,0.00095096,0.00022703856,0.0005316537,0.00018081268,0.58209884,0.0037554386,0.26256818,0.019331275,0.12860247],"study_design_scores_gemma":[0.00005107689,0.00010839131,0.0004797473,0.00006763292,0.000047949634,0.00036303562,0.00008952569,0.7987909,0.0014300068,0.1915686,0.0069804415,0.000022678421],"about_ca_topic_score_codex":0.0012573615,"about_ca_topic_score_gemma":0.0012502337,"teacher_disagreement_score":0.0048266836,"about_ca_system_score_codex":0.0013218505,"about_ca_system_score_gemma":0.0010624299,"threshold_uncertainty_score":0.016146898},"labels":[],"label_agreement":null},{"id":"W4391512525","doi":"10.1142/s0217595924500040","title":"Semi-Additive Integer-Valued Production Technology for Analyzing Public Hospitals in Mashhad","year":2024,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Quality and Supply 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":"York University","funders":"","keywords":"Production (economics); Integer (computer science); Integer programming; Business; Computer science; Mathematics; Mathematical optimization; Economics; Microeconomics; Operating system","score_opus":0.06556596729416804,"score_gpt":0.36029970495030905,"score_spread":0.294733737656141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391512525","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.10148076,0.00022524419,0.8922982,0.00030710915,0.000023395962,0.00012162746,0.00016049683,0.000090134505,0.005292987],"genre_scores_gemma":[0.9162502,0.0002753117,0.081703424,0.000022857304,0.0000107376945,0.00020185519,0.0001248903,0.000013798706,0.0013969833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987472,0.00063680904,0.000051853858,0.0001715464,0.00026118392,0.00013128093],"domain_scores_gemma":[0.9986714,0.00087155506,0.00020487337,0.00006215022,0.00015536496,0.000034639146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019677803,0.00101109,0.0006489281,0.0012142325,0.00057774637,0.0019053547,0.0007977871,0.00071549724,0.0014398771],"category_scores_gemma":[0.0028866136,0.00037478938,0.0011833052,0.0017556278,0.0007527109,0.0013449192,0.0012255318,0.00090710924,0.00015431143],"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.000017523673,0.000039987266,0.0014373494,0.00005372737,0.000020597976,0.00012338518,0.000067397385,0.9720416,0.0006563135,0.013967668,0.00021487115,0.01135964],"study_design_scores_gemma":[0.0000016905956,0.00002131364,0.00049445237,0.0000069262405,0.000008790669,0.000011999985,0.00006442033,0.9943317,0.00028904912,0.0045303,0.00023333958,0.00000599043],"about_ca_topic_score_codex":0.009058863,"about_ca_topic_score_gemma":0.007142441,"teacher_disagreement_score":0.009058863,"about_ca_system_score_codex":0.0028628595,"about_ca_system_score_gemma":0.0019925258,"threshold_uncertainty_score":0.020771563},"labels":[],"label_agreement":null},{"id":"W4402073352","doi":"10.1142/s0217595924500258","title":"Parameterized Approximations for the Minimum Diameter Vertex-Weighted Steiner Tree Problem in Graphs with Parameterized Weights","year":2024,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China; Zhejiang University of Water Resources and Electric Power","keywords":"Parameterized complexity; Steiner tree problem; Vertex (graph theory); Mathematics; Combinatorics; Treewidth; Discrete mathematics; Graph; Computer science; Pathwidth; Line graph","score_opus":0.04196131371238212,"score_gpt":0.31087166920946213,"score_spread":0.26891035549708003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402073352","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.09160351,0.0016376255,0.88479745,0.0014159335,0.00026414916,0.00027193673,0.0014057951,0.0019184382,0.016685147],"genre_scores_gemma":[0.5134507,0.0017815018,0.46822608,0.0006561152,0.0002492364,0.0005294995,0.0038833022,0.0012319406,0.00999158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981476,0.00045120504,0.000082118204,0.0005134258,0.00049592566,0.00030979209],"domain_scores_gemma":[0.99442035,0.0030748686,0.0006695186,0.0009035438,0.0005088608,0.00042274606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014288484,0.0030027393,0.0022786616,0.0011750226,0.0010113708,0.0026118152,0.0041518235,0.0020544797,0.008635928],"category_scores_gemma":[0.014498366,0.00087453896,0.0016792358,0.0028061594,0.0010484398,0.006723709,0.002973439,0.0031428973,0.0013100398],"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.0004063369,0.0001729291,0.0009069746,0.00044146928,0.000082622966,0.00021535088,0.00019829048,0.8472393,0.002377441,0.08234388,0.011664743,0.053950623],"study_design_scores_gemma":[0.00003908394,0.000058989277,0.00017025445,0.000034762907,0.000032750573,0.00008606298,0.00008538623,0.92518103,0.00045746475,0.0707333,0.003108653,0.000012317065],"about_ca_topic_score_codex":0.0060176235,"about_ca_topic_score_gemma":0.00809076,"teacher_disagreement_score":0.008635928,"about_ca_system_score_codex":0.003739026,"about_ca_system_score_gemma":0.0022681453,"threshold_uncertainty_score":0.028890073},"labels":[],"label_agreement":null}]}