{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092774015,0.0010109086,0.97816104,0.0048953197,0.00032905265,0.0002924523,0.00037684824,0.0000039074257,0.005653066],"genre_scores_gemma":[0.9883115,0.00011403296,0.009609155,0.000011764514,0.0003409006,0.000053402207,0.000008512616,0.00001413914,0.001536582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863577,0.0000106019,0.0007706817,0.00017773865,0.00016184755,0.00024338221],"domain_scores_gemma":[0.99787533,0.00064712536,0.00032639655,0.00013877774,0.00092226965,0.00009010886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018181072,0.00007546426,0.0002791995,0.0003966506,0.00024883184,0.0000486504,0.00023238518,0.000069919224,0.00017776947],"category_scores_gemma":[0.0012395898,0.0000612183,0.000119786666,0.00034809814,0.00014226919,0.00025552054,0.00003105491,0.0001492762,0.00008099682],"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.00007417984,0.00010904639,0.0026696688,0.000021185013,0.000055291686,0.0000011556376,0.00017713103,0.000020570009,0.0019170942,0.98608947,0.003894062,0.0049711466],"study_design_scores_gemma":[0.0045641577,0.0016400418,0.024340378,0.00035353255,0.000026862901,0.0001321076,0.002884146,0.0022848293,0.004292327,0.70304954,0.2558926,0.00053947425],"about_ca_topic_score_codex":0.000013118766,"about_ca_topic_score_gemma":0.0000021822752,"teacher_disagreement_score":0.9790341,"about_ca_system_score_codex":0.00010631414,"about_ca_system_score_gemma":0.00022881353,"threshold_uncertainty_score":0.24964099},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544057,0.00014798138,0.042245965,0.00078785553,0.00018003724,0.000501481,0.0000036096933,0.00000662107,0.001720724],"genre_scores_gemma":[0.98865384,0.000033683737,0.011061863,0.000010145835,0.000061854764,0.000010001538,0.000039262974,0.000010199865,0.00011916282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99839264,0.000056465768,0.0007108796,0.00013666428,0.0005326233,0.0001707303],"domain_scores_gemma":[0.99693906,0.00010920202,0.0001928227,0.00010114425,0.0026459515,0.0000118439975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021115171,0.00008647414,0.000201708,0.0006273866,0.00010865051,0.000038700902,0.000186923,0.00004842383,0.00007492644],"category_scores_gemma":[0.0012839125,0.000080425445,0.000052789816,0.0008325229,0.00004793054,0.00082346087,0.000044562137,0.00010214144,0.0000026234695],"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.0008242731,0.0003505208,0.3586608,0.00049478904,0.00008820955,0.0000025047846,0.0031171977,0.61608094,0.002197221,0.016552312,0.0010971313,0.0005341302],"study_design_scores_gemma":[0.0017039964,0.00012640373,0.5748761,0.0004956955,0.00002674291,0.0000050160047,0.01770479,0.39918745,0.0031866143,0.002040494,0.00041000143,0.00023664853],"about_ca_topic_score_codex":0.00064568553,"about_ca_topic_score_gemma":0.0003170971,"teacher_disagreement_score":0.21689348,"about_ca_system_score_codex":0.00006515092,"about_ca_system_score_gemma":0.00014806022,"threshold_uncertainty_score":0.32796544},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019539965,0.00024939113,0.9692211,0.003709729,0.00035976578,0.00036629956,0.000105125524,0.000004674908,0.006443945],"genre_scores_gemma":[0.9717443,0.00008639758,0.027060073,0.00002448691,0.00068235764,0.00009425092,0.000016909711,0.000013661017,0.00027755677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890244,0.000013148298,0.00056331273,0.00016937435,0.00014525722,0.00020647598],"domain_scores_gemma":[0.99796003,0.00044854218,0.00031604496,0.00012648193,0.0010558193,0.00009310602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024293687,0.00007024332,0.00023604676,0.00036986984,0.0003443196,0.00013516152,0.00025482985,0.00004189976,0.00008584661],"category_scores_gemma":[0.0018383943,0.000069556336,0.0001003666,0.00043757528,0.00017107547,0.00026640962,0.000023595525,0.00038346008,0.00006390331],"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.00009198961,0.000073404044,0.0005425371,0.000003977317,0.000026337508,5.720551e-7,0.00019496893,0.0002770542,0.0008068953,0.9958783,0.00048480183,0.0016192009],"study_design_scores_gemma":[0.0023095342,0.00034179026,0.0051510795,0.000016387,0.0000072183957,0.000045297933,0.0005586624,0.011325243,0.00046046704,0.9266065,0.052999802,0.0001780322],"about_ca_topic_score_codex":0.000041107432,"about_ca_topic_score_gemma":0.000010410343,"teacher_disagreement_score":0.95220435,"about_ca_system_score_codex":0.000056405588,"about_ca_system_score_gemma":0.00017025917,"threshold_uncertainty_score":0.2836425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044333056,0.00041846337,0.9366904,0.0073359814,0.00082295766,0.0022409873,0.00008728148,0.00006403585,0.008006846],"genre_scores_gemma":[0.95436877,0.00007929596,0.042995445,0.000102046564,0.00056169054,0.0001059908,0.0002405767,0.000016971704,0.0015291927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972499,0.0001383152,0.0007725644,0.0003277482,0.0011079288,0.00040353253],"domain_scores_gemma":[0.99310255,0.00006917773,0.00013861067,0.00019069885,0.0064499434,0.00004899327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025410599,0.00019337138,0.0002625806,0.00059824553,0.00082732644,0.00022515217,0.00033151402,0.000074131975,0.0004290441],"category_scores_gemma":[0.0006021597,0.00017230252,0.00012751047,0.00088772975,0.0002721257,0.0011142074,0.00008974943,0.0004143534,0.0003006255],"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.003395113,0.009761147,0.043903627,0.0020894487,0.0016448805,0.00030268088,0.0070810583,0.1247294,0.018084824,0.39409596,0.107571386,0.28734046],"study_design_scores_gemma":[0.005183328,0.00036352835,0.07263688,0.00023564504,0.00006276825,0.00013274461,0.008670472,0.73634875,0.00038111804,0.001677295,0.17363396,0.0006734985],"about_ca_topic_score_codex":0.000533809,"about_ca_topic_score_gemma":0.00024501578,"teacher_disagreement_score":0.9100357,"about_ca_system_score_codex":0.00029601494,"about_ca_system_score_gemma":0.0004584218,"threshold_uncertainty_score":0.70262927},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968276,0.00021337974,0.19444995,0.0026794507,0.00023930492,0.0018464857,0.000009694121,0.00002056715,0.0037135847],"genre_scores_gemma":[0.99743706,0.000002952504,0.001958753,0.000019167337,0.00025444888,0.00010912796,0.000043333883,0.000012305431,0.00016286109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788076,0.00005409669,0.00074554706,0.00021679737,0.0008118025,0.00029097428],"domain_scores_gemma":[0.99724394,0.00009888879,0.00016487176,0.00012936852,0.0023441697,0.000018750708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033734418,0.00011594637,0.00023125765,0.0010250709,0.00018311384,0.00013575806,0.00024910652,0.00005618567,0.00003019599],"category_scores_gemma":[0.00059958495,0.00010344754,0.00009209131,0.0010399598,0.000119377364,0.00087631255,0.00004447899,0.00030430153,0.000012778466],"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.0013184561,0.003247919,0.28986025,0.0021031338,0.00023978557,0.000021334254,0.0024243346,0.5312241,0.004938373,0.14065957,0.0060263206,0.017936472],"study_design_scores_gemma":[0.003951723,0.00021474856,0.2174161,0.00041400216,0.00006150803,0.000013828965,0.021684432,0.7176876,0.0013717787,0.0114856055,0.025179796,0.00051886623],"about_ca_topic_score_codex":0.0005911767,"about_ca_topic_score_gemma":0.0004095529,"teacher_disagreement_score":0.20060946,"about_ca_system_score_codex":0.00012670844,"about_ca_system_score_gemma":0.00013364018,"threshold_uncertainty_score":0.42184684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8396274,0.00028973003,0.06278872,0.01253951,0.00015617603,0.0014080957,0.000004536559,0.00002776611,0.08315806],"genre_scores_gemma":[0.99818236,0.000022834243,0.00066352444,0.00020158378,0.0005000595,0.0000286035,0.0000067950864,0.000017767517,0.00037648002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800897,0.000071789626,0.00040584648,0.00021209368,0.0010511274,0.00025019885],"domain_scores_gemma":[0.9982476,0.00008166561,0.00015228832,0.00017249091,0.0012897254,0.000056182937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031596364,0.000118371245,0.00021163619,0.00057230226,0.00020251135,0.00019432697,0.0002794174,0.000043410077,0.000117152005],"category_scores_gemma":[0.00022184242,0.00009418176,0.000038631882,0.0005245478,0.00007210255,0.00107629,0.00015624637,0.0002485836,0.000035304372],"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.00062744645,0.0003983565,0.0069786888,0.00049116195,0.00018763919,0.000023074906,0.0012119693,0.08833376,0.0034591223,0.8804969,0.009520115,0.008271726],"study_design_scores_gemma":[0.0016766723,0.0003324822,0.0031518643,0.0002730104,0.000041895586,0.000036830454,0.0041251406,0.88436276,0.00040115207,0.01472286,0.09055858,0.00031675946],"about_ca_topic_score_codex":0.000067682086,"about_ca_topic_score_gemma":0.000012144374,"teacher_disagreement_score":0.8657741,"about_ca_system_score_codex":0.00005671883,"about_ca_system_score_gemma":0.00008984998,"threshold_uncertainty_score":0.38406208},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98154837,0.00087893585,0.0161194,0.00025457423,0.00034331222,0.00020630006,0.000044915923,0.000006328254,0.0005978495],"genre_scores_gemma":[0.9922439,0.00009642425,0.007341879,0.0000050633435,0.00017970434,0.0000053343356,0.000009226113,0.000013727568,0.00010477228],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9851379,0.0036702503,0.0021395136,0.0005244627,0.008133731,0.00039413988],"domain_scores_gemma":[0.9726263,0.019791933,0.0007695352,0.0005964774,0.0059280554,0.0002876573],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0225585,0.00018950133,0.0010886998,0.0025709304,0.0005704758,0.0004136947,0.0013382126,0.0001459899,0.001222964],"category_scores_gemma":[0.019878564,0.00013647406,0.00047557853,0.0053533153,0.0004066995,0.0009201887,0.00026749185,0.0007991709,0.00007401941],"study_design_candidate":"observational","study_design_consensus":"observational","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.0008813634,0.00045326794,0.9415809,0.000009632099,0.0006964971,0.00015183073,0.0024437492,0.00954265,0.029634006,0.00044030312,0.0026597502,0.011506036],"study_design_scores_gemma":[0.00063241454,0.00024547376,0.9665746,0.000095190655,0.00008776966,0.00004448222,0.0021707735,0.022394264,0.004705819,0.0012621187,0.0016353206,0.00015173819],"about_ca_topic_score_codex":0.0001378262,"about_ca_topic_score_gemma":0.00003524229,"teacher_disagreement_score":0.024993721,"about_ca_system_score_codex":0.00023816634,"about_ca_system_score_gemma":0.00083994586,"threshold_uncertainty_score":0.99969006},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56929195,0.00019789783,0.0056740954,0.17355089,0.000415669,0.0012938726,0.000005786265,0.00003209424,0.24953775],"genre_scores_gemma":[0.993381,0.00002053005,0.0007919113,0.0010554187,0.0009071745,0.0000051020515,0.000009747598,0.0000103489,0.0038187192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980501,0.00008512072,0.00035504284,0.00020409357,0.0010392703,0.000266361],"domain_scores_gemma":[0.9984492,0.00012978613,0.000110722365,0.00010907196,0.0011459899,0.000055220487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029800392,0.0001124555,0.00014748682,0.00069522107,0.00040155725,0.0005464335,0.00013975771,0.000053028867,0.00057650317],"category_scores_gemma":[0.0004991456,0.00009582285,0.00004769344,0.0004654013,0.00005733816,0.0012654138,0.000071749484,0.00033022286,0.00020017431],"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.0005874462,0.0007990263,0.040330008,0.00014237002,0.00018912139,0.00019626843,0.00473227,0.00051311485,0.005987942,0.3045235,0.6197945,0.02220443],"study_design_scores_gemma":[0.0022610566,0.0007788152,0.45878893,0.00039226923,0.000071901886,0.000137586,0.00860522,0.0074377996,0.0011180325,0.040716887,0.47907397,0.0006175323],"about_ca_topic_score_codex":0.000012210264,"about_ca_topic_score_gemma":0.0000038096748,"teacher_disagreement_score":0.4240891,"about_ca_system_score_codex":0.00008666047,"about_ca_system_score_gemma":0.00007307045,"threshold_uncertainty_score":0.63123053},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9184752,0.0002249222,0.00048178562,0.039717045,0.00037897006,0.0009638035,0.0000058425435,0.00002877691,0.039723646],"genre_scores_gemma":[0.9923488,0.000053050473,0.00046084076,0.00026056104,0.0017986046,0.000039236835,0.000016925167,0.000018060717,0.005003905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698037,0.0005539822,0.0005472318,0.0002609201,0.0013419432,0.00031556952],"domain_scores_gemma":[0.9975653,0.00043495427,0.00019454461,0.00028890584,0.0014534546,0.00006278542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011157944,0.00013517942,0.00019173342,0.00096753065,0.0009985578,0.0009602883,0.000373315,0.000055525546,0.00024384607],"category_scores_gemma":[0.0018473673,0.00008676608,0.000060060825,0.0015715684,0.00025203516,0.0020048374,0.00017487798,0.0004403232,0.00006214297],"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.043923,0.0012267497,0.011053601,0.00011032635,0.00015470307,0.0002571392,0.00076782185,0.0024119543,0.01168671,0.26177296,0.665662,0.00097305176],"study_design_scores_gemma":[0.0047795856,0.0005699957,0.0949516,0.00015022115,0.000049466093,0.0002497013,0.015861113,0.0044425908,0.00011671669,0.00834093,0.870099,0.00038908105],"about_ca_topic_score_codex":0.0014276258,"about_ca_topic_score_gemma":0.00008246029,"teacher_disagreement_score":0.25343204,"about_ca_system_score_codex":0.00013879908,"about_ca_system_score_gemma":0.0003469128,"threshold_uncertainty_score":0.9260082},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94365466,0.00017036822,0.00014098118,0.0038229306,0.00021109804,0.00034139364,0.000010679038,0.000008255097,0.051639646],"genre_scores_gemma":[0.9960141,0.00010892471,0.0002910143,0.000118662654,0.0003642253,0.000011575284,0.000038733622,0.000018013943,0.0030347486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978284,0.0000922475,0.0006635322,0.00020116298,0.00089074764,0.00032389036],"domain_scores_gemma":[0.9986544,0.00008749242,0.00020957075,0.0001857139,0.0008232739,0.000039505867],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017670005,0.00012784713,0.00027886956,0.0009857311,0.0003300872,0.0001733675,0.0003386921,0.000060752256,0.0050340327],"category_scores_gemma":[0.00018568007,0.00011824447,0.00010100356,0.0005191151,0.00022913546,0.0013819697,0.000121688085,0.00034721725,0.00039705914],"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.0010496925,0.0043123118,0.3131881,0.0003930532,0.00075385015,0.0005641579,0.0013127605,0.016032847,0.012946723,0.487707,0.16035047,0.0013890258],"study_design_scores_gemma":[0.00990145,0.0006216769,0.82048833,0.0007022186,0.00010409788,0.00052167615,0.016145369,0.029463725,0.0007620638,0.017637195,0.10257904,0.0010731557],"about_ca_topic_score_codex":0.00016628602,"about_ca_topic_score_gemma":0.000091680486,"teacher_disagreement_score":0.5073002,"about_ca_system_score_codex":0.00021031761,"about_ca_system_score_gemma":0.00061208167,"threshold_uncertainty_score":0.9958755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6605839,0.0026005653,0.002879405,0.012568737,0.0019807366,0.0012591282,0.000012285963,0.000049655406,0.31806555],"genre_scores_gemma":[0.99298805,0.00009877731,0.0005210376,0.00019568663,0.003580917,0.00001929796,0.000019323867,0.00002405158,0.0025528609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996808,0.00011059588,0.00051487004,0.00016489005,0.001801529,0.0006001489],"domain_scores_gemma":[0.9982506,0.000097137745,0.00022736854,0.00018390034,0.001169522,0.00007146249],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054588015,0.00015550805,0.00018850584,0.00063067494,0.000434589,0.0005970226,0.00038477068,0.00006107995,0.002891296],"category_scores_gemma":[0.00026197665,0.0001230714,0.00011481193,0.0005154276,0.000118398115,0.0024245786,0.00015271382,0.0005881589,0.0006374558],"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.00036524536,0.001303964,0.120334856,0.00012623034,0.000367694,0.000040170522,0.00041120933,0.010868547,0.0013288051,0.45846012,0.39932093,0.0070722345],"study_design_scores_gemma":[0.0018763273,0.00024905265,0.10536283,0.00010952815,0.00008379515,0.00004994811,0.01671979,0.003436353,0.00043501347,0.004592706,0.86663854,0.00044612854],"about_ca_topic_score_codex":0.000053058247,"about_ca_topic_score_gemma":0.000006224616,"teacher_disagreement_score":0.4673176,"about_ca_system_score_codex":0.00015572381,"about_ca_system_score_gemma":0.00015743772,"threshold_uncertainty_score":0.9980202},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7962686,0.0038625025,0.007918625,0.015226493,0.0024842455,0.002447196,0.00002018191,0.00006335875,0.17170882],"genre_scores_gemma":[0.99429864,0.00006270946,0.00030515675,0.00027169875,0.0028544755,0.000040530256,0.000018959907,0.000025459147,0.0021223947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979378,0.00006679253,0.00042411013,0.00016354099,0.00088978745,0.0005179415],"domain_scores_gemma":[0.99882483,0.00019706525,0.00017127235,0.00012909739,0.00061353686,0.000064222215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052283253,0.00014514841,0.00019997671,0.0007070305,0.0004330683,0.00069615676,0.0001793452,0.000048165635,0.0002987887],"category_scores_gemma":[0.00036047664,0.00012224002,0.000085377025,0.00031851963,0.00013435686,0.0027880762,0.00013903619,0.00030273688,0.00003598344],"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.00031297735,0.0003989116,0.012971602,0.0004300151,0.00017793349,0.000034382592,0.0017605843,0.0007136564,0.0030544933,0.91093963,0.06658705,0.0026187885],"study_design_scores_gemma":[0.0037317583,0.0002713748,0.008086945,0.00024712324,0.00006515475,0.00006634374,0.07379904,0.01988637,0.00035046582,0.01840315,0.8745384,0.0005538343],"about_ca_topic_score_codex":0.000058514303,"about_ca_topic_score_gemma":0.0000146171105,"teacher_disagreement_score":0.89253646,"about_ca_system_score_codex":0.00008868578,"about_ca_system_score_gemma":0.000138664,"threshold_uncertainty_score":0.6713056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661027,0.0009732078,0.0037131475,0.009081633,0.00016708033,0.0007393484,0.0000011598786,0.000013570212,0.019208124],"genre_scores_gemma":[0.9978444,0.000108679145,0.0006270228,0.0002131931,0.00043669844,0.000020783971,0.0000050276735,0.00001558948,0.00072862254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982669,0.00005317316,0.00031118892,0.00018333556,0.0009067934,0.0002786444],"domain_scores_gemma":[0.998709,0.0003132638,0.0001087961,0.0001139306,0.00069291843,0.00006207201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017864811,0.00011835872,0.00016726127,0.0006146424,0.0003964544,0.0007665135,0.00016570163,0.00003723195,0.00047917914],"category_scores_gemma":[0.0005366957,0.0000831996,0.000026379023,0.0003505849,0.00021004633,0.001437464,0.00014141982,0.0003040273,0.000054255113],"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.0009956639,0.0009668009,0.26458585,0.0005448222,0.0008048288,0.00041112065,0.0029280733,0.007027449,0.005447662,0.3386104,0.28000847,0.09766886],"study_design_scores_gemma":[0.011404961,0.0016381188,0.36167735,0.0025165381,0.000268915,0.00085116405,0.07107673,0.1330699,0.00015567607,0.07729788,0.3382322,0.0018105787],"about_ca_topic_score_codex":0.000109539506,"about_ca_topic_score_gemma":0.000019972873,"teacher_disagreement_score":0.2613125,"about_ca_system_score_codex":0.000050521463,"about_ca_system_score_gemma":0.00009153081,"threshold_uncertainty_score":0.7391507},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16318458,0.0013443613,0.0053605363,0.033194266,0.0005247998,0.0009348682,0.000003825263,0.000057726094,0.795395],"genre_scores_gemma":[0.99048537,0.0001128809,0.0017815316,0.0006872248,0.00070840516,0.000009622362,0.000008461488,0.00001960037,0.0061869235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725163,0.00007349179,0.0005565739,0.00028608463,0.0014003227,0.00043191985],"domain_scores_gemma":[0.9986263,0.000053834567,0.0001967091,0.00022185223,0.0008399415,0.000061345025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037559725,0.00019242599,0.00024544424,0.0009774485,0.00043790825,0.00073134707,0.00041107857,0.00006658599,0.00035135236],"category_scores_gemma":[0.00021633982,0.0001615265,0.00009665047,0.00054256583,0.00013853988,0.0016434581,0.00018462472,0.0005638533,0.000075716045],"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.00014100249,0.00023974244,0.0015614933,0.00013246392,0.00011221052,0.00018850922,0.00044347942,0.001674262,0.0011837059,0.8918176,0.08031756,0.02218792],"study_design_scores_gemma":[0.004770637,0.000545613,0.020581244,0.00085034606,0.00020058748,0.0001749135,0.03515604,0.32089856,0.00028229444,0.31292734,0.30236548,0.0012469405],"about_ca_topic_score_codex":0.000018030247,"about_ca_topic_score_gemma":0.000006078581,"teacher_disagreement_score":0.8273008,"about_ca_system_score_codex":0.00015467692,"about_ca_system_score_gemma":0.00010649592,"threshold_uncertainty_score":0.70523965},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827696,0.00020314049,0.0111162625,0.0029988964,0.0002817909,0.00027792653,0.00024707592,0.0000013276635,0.0021039885],"genre_scores_gemma":[0.9870096,0.000024860505,0.0127091,0.000014706344,0.00015485969,0.0000058069086,0.000011276419,0.000011425477,0.000058355643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979587,0.00018047028,0.0011055671,0.0002151512,0.00032080527,0.00021928082],"domain_scores_gemma":[0.997644,0.00065039186,0.00047078368,0.0006183809,0.00056558126,0.00005086295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012687448,0.00009744881,0.00027858716,0.00037385846,0.00024400855,0.000061638995,0.0006504571,0.00007604071,0.000087988265],"category_scores_gemma":[0.0060717515,0.000064295964,0.00007935102,0.0005144781,0.00016550579,0.00039456403,0.000094344665,0.0009966993,0.0000074489244],"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.00022938987,0.0004845585,0.06714024,0.00007158409,0.000038625687,0.0000280118,0.0015068598,0.6333801,0.00462217,0.2899494,0.00048830465,0.002060726],"study_design_scores_gemma":[0.0003746446,0.000062062405,0.02875162,0.000060344657,0.0000030214003,0.00002336156,0.00006093246,0.9069729,0.00006253657,0.06355002,0.000023578368,0.00005500074],"about_ca_topic_score_codex":0.00074007094,"about_ca_topic_score_gemma":0.0005104851,"teacher_disagreement_score":0.27359274,"about_ca_system_score_codex":0.000075661825,"about_ca_system_score_gemma":0.00059531286,"threshold_uncertainty_score":0.7268892},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032233298,0.0017663003,0.86231834,0.053112656,0.00072305446,0.009213556,0.0005130308,0.00013498403,0.03998479],"genre_scores_gemma":[0.7734506,0.00012579862,0.22370473,0.00007441919,0.00047737116,0.00005436018,0.00006645043,0.000043509655,0.0020027317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522,0.00043062674,0.00096259237,0.00029040224,0.0023939118,0.00070247403],"domain_scores_gemma":[0.99263674,0.0017413666,0.00024740622,0.00030385054,0.004747245,0.0003234086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057577137,0.00019037222,0.00043215373,0.0009909931,0.00058545184,0.00026669164,0.00056419644,0.000106726715,0.00047225252],"category_scores_gemma":[0.003601077,0.00016182772,0.00017770338,0.0013559648,0.00015088833,0.0005168087,0.00006300474,0.00083272427,0.000026685151],"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.00068742345,0.0016514104,0.0004507881,0.00016522735,0.0003164936,0.000049699025,0.0011490282,0.0025868132,0.014997135,0.9036241,0.059991,0.014330859],"study_design_scores_gemma":[0.01763853,0.010007708,0.011184572,0.00053739105,0.00013031316,0.0009226344,0.0065638353,0.07506247,0.011246312,0.777336,0.08794284,0.001427399],"about_ca_topic_score_codex":0.000008719923,"about_ca_topic_score_gemma":0.000010284953,"teacher_disagreement_score":0.7412173,"about_ca_system_score_codex":0.00045136188,"about_ca_system_score_gemma":0.0006593451,"threshold_uncertainty_score":0.65991426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114499174,0.00022330572,0.88352495,0.0005615373,0.00029001458,0.00044212473,0.000017266997,0.000027684633,0.00041391185],"genre_scores_gemma":[0.98222256,0.0000041734584,0.017366061,0.000018224908,0.0002570726,0.000023158356,0.000040910076,0.000021305668,0.000046511188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979841,0.00010083195,0.0007386168,0.00012839654,0.000660507,0.0003875644],"domain_scores_gemma":[0.997441,0.0011616934,0.000056639346,0.0001397115,0.0010404638,0.00016051292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00293468,0.000115809074,0.00016993048,0.000481992,0.00019519287,0.00009159102,0.0001481439,0.00009651553,0.00014856737],"category_scores_gemma":[0.00026343888,0.00011512922,0.000041897198,0.001516839,0.000061362196,0.00029731827,0.000008458867,0.0008180898,0.000033845743],"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.00007142134,0.00008993542,0.00036507504,0.0000057686266,0.00004671629,0.00034273445,0.0016558197,0.99187565,0.0003814658,0.0024200878,0.00097307336,0.0017722587],"study_design_scores_gemma":[0.006174695,0.0008130583,0.08107782,0.0007899505,0.00013239366,0.0045981994,0.035811186,0.8550013,0.0002866954,0.008723103,0.0054217423,0.001169905],"about_ca_topic_score_codex":0.00005916285,"about_ca_topic_score_gemma":0.00064625195,"teacher_disagreement_score":0.8677234,"about_ca_system_score_codex":0.00019202207,"about_ca_system_score_gemma":0.00033320708,"threshold_uncertainty_score":0.46948335},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021308346,0.00082953804,0.97296196,0.0035974612,0.000038220584,0.00031053214,0.000015742211,0.000013010456,0.0009251599],"genre_scores_gemma":[0.67348987,0.000024601399,0.32621267,0.000026112817,0.00013392203,0.000012775857,0.000017118731,0.00000850895,0.00007440953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977063,0.00031290078,0.00045667653,0.00022669713,0.0009717153,0.0003257117],"domain_scores_gemma":[0.9948928,0.0012272839,0.00013904108,0.00028648757,0.0032855845,0.00016881361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029069437,0.000114434384,0.00018462999,0.00023815491,0.0006175055,0.000666189,0.00069102587,0.000064483094,0.000009490196],"category_scores_gemma":[0.00039514847,0.00009278528,0.000034620516,0.00047235543,0.00010825047,0.00045919974,0.00007301663,0.0004124828,0.000006479834],"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.00022701126,0.0003484144,0.004515181,0.00011869212,0.00010491247,0.000013766633,0.0017722043,0.8630346,0.0019648555,0.11555963,0.0011500188,0.01119071],"study_design_scores_gemma":[0.0012566459,0.00041381037,0.0016885699,0.00013376393,0.000007279237,0.00014480687,0.0004122842,0.99129456,0.0003713789,0.0009692592,0.0031797022,0.00012794345],"about_ca_topic_score_codex":0.000009812067,"about_ca_topic_score_gemma":0.000003432598,"teacher_disagreement_score":0.6521815,"about_ca_system_score_codex":0.0000965479,"about_ca_system_score_gemma":0.0012404614,"threshold_uncertainty_score":0.6424076},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081616014,0.00015462542,0.0004839506,0.08871816,0.0031228587,0.002065458,0.000014052314,0.000031502415,0.82379335],"genre_scores_gemma":[0.8653497,0.0006042905,0.0023337014,0.0004978242,0.10820246,0.00010089453,0.000033198,0.00006645928,0.022811437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951481,0.000272182,0.00061903393,0.0004667987,0.0029026542,0.00059123343],"domain_scores_gemma":[0.99663717,0.00022498702,0.00017680234,0.0004292787,0.0024677827,0.000063977255],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.011166772,0.00019770963,0.00022220158,0.0016423565,0.0016482753,0.0011188871,0.00080126105,0.00008240793,0.0029144285],"category_scores_gemma":[0.0012029066,0.00014201338,0.00007279348,0.0017952415,0.00031791363,0.001463325,0.00045651093,0.0012180373,0.0028990763],"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.0005000589,0.0002103971,0.0027353072,0.00002183236,0.00006646807,0.000044759894,0.00030717987,0.0001433561,0.00004119562,0.37050468,0.60606086,0.019363929],"study_design_scores_gemma":[0.00044023324,0.00029418504,0.045075126,0.000044727465,0.00001952262,0.000016921767,0.0030264175,0.00015585619,0.00008938592,0.015091901,0.9355933,0.0001524222],"about_ca_topic_score_codex":0.00013184214,"about_ca_topic_score_gemma":0.000058538455,"teacher_disagreement_score":0.80098194,"about_ca_system_score_codex":0.00015940981,"about_ca_system_score_gemma":0.00009396843,"threshold_uncertainty_score":0.99991804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70138997,0.00015231516,0.28770256,0.00021376899,0.0007200311,0.00097364787,0.000257881,0.000008082572,0.008581762],"genre_scores_gemma":[0.97197515,0.000007863845,0.027749117,0.000005009795,0.00012697399,0.000031876356,0.000016782538,0.000007830739,0.0000793716],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98592997,0.002499658,0.0024119145,0.00024770873,0.0086214375,0.0002893301],"domain_scores_gemma":[0.96720916,0.0041054836,0.0012123295,0.00054286775,0.026760077,0.00017010042],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.08093853,0.00012762891,0.00050220214,0.0033984114,0.00036940168,0.0004964882,0.0009620745,0.00011018122,0.0012884917],"category_scores_gemma":[0.044492874,0.000090887,0.0003782032,0.0024959794,0.00013549763,0.0020666707,0.00010624022,0.00030519458,0.000092888964],"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.008837777,0.001070662,0.5203286,0.00015750255,0.0035109255,0.000023186203,0.047551546,0.048832335,0.013412485,0.041974545,0.042212036,0.27208844],"study_design_scores_gemma":[0.0031905829,0.00046737594,0.3093579,0.000082399994,0.00033292946,0.0000464399,0.028519144,0.6436284,0.003180566,0.007874788,0.0031354507,0.0001839881],"about_ca_topic_score_codex":0.00004512397,"about_ca_topic_score_gemma":0.000018413595,"teacher_disagreement_score":0.59479606,"about_ca_system_score_codex":0.0002435223,"about_ca_system_score_gemma":0.0007710276,"threshold_uncertainty_score":0.9996245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25212675,0.00034123517,0.74687606,0.000022838081,0.000083755716,0.00036946684,0.000004964199,0.000016141452,0.00015877963],"genre_scores_gemma":[0.6327882,0.00011520488,0.36700228,2.798967e-7,0.000043404503,0.0000073447163,0.0000011236095,0.000014211859,0.00002794499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985213,0.00016510766,0.0004090778,0.00012132868,0.00052652863,0.00025664727],"domain_scores_gemma":[0.99866253,0.00007679417,0.000069789625,0.000103565275,0.0009758226,0.00011152597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094917533,0.000108377826,0.00022428884,0.00018980695,0.00010889351,0.00006111102,0.00012681642,0.000056505465,0.000008944869],"category_scores_gemma":[0.000064182124,0.000089901085,0.00004802467,0.00025136524,0.00016258756,0.0003755449,0.000026711428,0.00031497746,0.0000020808811],"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.00028224007,0.00018586674,0.00043241028,0.00020515118,0.00014271909,0.00009108641,0.0040567657,0.97078085,0.01806579,0.0005427052,0.000044633838,0.005169761],"study_design_scores_gemma":[0.0005045408,0.0003443578,0.00090710784,0.00013366707,0.00001369761,0.0003632318,0.0015218946,0.9913871,0.0046169246,0.00007134485,0.00003679482,0.00009931858],"about_ca_topic_score_codex":0.000011795767,"about_ca_topic_score_gemma":5.210081e-7,"teacher_disagreement_score":0.38066146,"about_ca_system_score_codex":0.00010964177,"about_ca_system_score_gemma":0.00016657005,"threshold_uncertainty_score":0.366606},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.208323e-7,0.93444103,0.00008078759,0.003611239,0.00075759384,0.0011098592,0.000009227171,0.000020578262,0.059968974],"genre_scores_gemma":[0.00008870751,0.98993045,0.00010780365,0.0011005036,0.004912363,0.0001048506,0.0001091324,0.000102044716,0.003544136],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931789,0.0004090118,0.0019307293,0.000499491,0.0032919298,0.00068991334],"domain_scores_gemma":[0.99685925,0.00047486633,0.00090066204,0.00053606095,0.001127226,0.00010191873],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004620174,0.00052838464,0.0017303865,0.0013050775,0.000490928,0.0005577666,0.0013248605,0.00025313545,0.0017334085],"category_scores_gemma":[0.00089974364,0.00040360785,0.00096407696,0.0015692074,0.0002804621,0.002115005,0.0003446062,0.0017466475,0.00058535865],"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.000018163782,0.00025008476,0.0000033529627,0.019854505,0.00038951717,0.00021781608,0.00002633949,0.000060231992,2.7578162e-7,0.038297202,0.8453543,0.09552817],"study_design_scores_gemma":[0.0003214825,0.000043250628,0.0000041726025,0.026234364,0.00024297315,0.00022803413,0.00024054799,0.0001829705,6.2852585e-8,0.001871979,0.9702815,0.00034867757],"about_ca_topic_score_codex":0.000020164882,"about_ca_topic_score_gemma":0.000004232841,"teacher_disagreement_score":0.12492715,"about_ca_system_score_codex":0.0005028806,"about_ca_system_score_gemma":0.00128537,"threshold_uncertainty_score":0.9998416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41385078,0.0010949775,0.5400366,0.00028064885,0.00023705664,0.00030149432,0.00015066248,0.000008892629,0.044038855],"genre_scores_gemma":[0.9868434,0.00024383083,0.011738685,0.000013919362,0.00009598765,0.000008834552,0.0000034752413,0.000016831473,0.0010350093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980946,0.00007900075,0.0008880742,0.00027865142,0.0003021071,0.0003575704],"domain_scores_gemma":[0.9986955,0.00011083968,0.00026488656,0.00026820414,0.0005049201,0.00015566181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003192049,0.00012442358,0.00029907667,0.0004942681,0.00031154536,0.00008919362,0.00034204219,0.000091567876,0.00056678796],"category_scores_gemma":[0.00036922906,0.0001217486,0.00014535448,0.00029646096,0.00010987058,0.00046928262,0.000080058875,0.0006633418,0.0001708064],"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.00040625024,0.0005497611,0.04487669,0.00003248498,0.0002217267,0.00001661832,0.003922022,0.023004983,0.000028274877,0.92231804,0.0013068154,0.003316345],"study_design_scores_gemma":[0.0006471774,0.00020428775,0.07867485,0.00003083724,0.0000082457445,0.000010257944,0.0007906641,0.47364473,0.000022379525,0.4451385,0.00063605484,0.00019200856],"about_ca_topic_score_codex":0.0000846592,"about_ca_topic_score_gemma":0.00001126424,"teacher_disagreement_score":0.5729926,"about_ca_system_score_codex":0.00020347163,"about_ca_system_score_gemma":0.000144499,"threshold_uncertainty_score":0.6205931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9127492,0.003955695,0.0038317216,0.0047175153,0.0052188304,0.00082551053,0.000008887492,0.00008046945,0.06861218],"genre_scores_gemma":[0.99225783,0.000084245396,0.00021163086,0.00006474705,0.002236193,0.0000057490524,0.000012085007,0.00002642927,0.005101102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744606,0.00025203146,0.00055549253,0.00024374222,0.0012067942,0.00029585394],"domain_scores_gemma":[0.99599934,0.0011560327,0.00033963853,0.00023562722,0.0022160574,0.00005331437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005272381,0.00014830797,0.00033163585,0.0017899683,0.00038770927,0.0003767207,0.00027928475,0.00009447825,0.0004633978],"category_scores_gemma":[0.0074318238,0.00012443925,0.000101458776,0.0011754124,0.00014669728,0.0012645369,0.00007415865,0.00064584025,0.0002768571],"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.0021862555,0.0005460425,0.007085382,0.00019633574,0.00041773135,0.00008954141,0.00016349385,0.02689475,0.0060836724,0.79471344,0.15737756,0.004245781],"study_design_scores_gemma":[0.0026295953,0.00036438674,0.0032279845,0.00024314482,0.00012349829,0.000085968975,0.0013106763,0.041819487,0.000051903866,0.008621876,0.9411099,0.00041159743],"about_ca_topic_score_codex":0.0001122564,"about_ca_topic_score_gemma":0.000009232845,"teacher_disagreement_score":0.78609157,"about_ca_system_score_codex":0.00030586676,"about_ca_system_score_gemma":0.00012477132,"threshold_uncertainty_score":0.88971245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14417207,0.0008746243,0.8491599,0.0018911397,0.0011869643,0.00079341506,0.000016187772,0.000013850156,0.0018918618],"genre_scores_gemma":[0.6854853,0.0000050879135,0.3141563,0.000059327027,0.00018535595,0.000021604104,0.000004229885,0.000021631522,0.00006117101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9716392,0.011456261,0.0038470966,0.00085843436,0.0114154285,0.0007835473],"domain_scores_gemma":[0.9330525,0.050662506,0.0011781957,0.0010825505,0.013624019,0.00040022796],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.16659564,0.00029545327,0.0009174474,0.0034630862,0.00071370916,0.001608313,0.0017865495,0.0002316348,0.0011628553],"category_scores_gemma":[0.20859097,0.00022367472,0.0003200475,0.0028074493,0.00033725236,0.0011429428,0.00031392722,0.0014325506,0.00020710558],"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.0004808789,0.0005208654,0.061139412,0.000011236883,0.000030346751,0.000050927603,0.0008529936,0.048679467,0.009730381,0.0019114556,0.004705216,0.8718868],"study_design_scores_gemma":[0.0031041172,0.00032104598,0.06999988,0.00038237261,0.00001748156,0.0000767533,0.0040083784,0.90248245,0.0006889578,0.014057512,0.004567621,0.00029340872],"about_ca_topic_score_codex":0.000023492452,"about_ca_topic_score_gemma":0.000084955784,"teacher_disagreement_score":0.8715934,"about_ca_system_score_codex":0.00064367405,"about_ca_system_score_gemma":0.002645582,"threshold_uncertainty_score":0.9997502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015982524,0.00008869202,0.97897625,0.0019642406,0.000150763,0.0015636962,0.000029654237,0.000008536847,0.0012356623],"genre_scores_gemma":[0.7000574,0.000009042473,0.29828426,0.00002910898,0.00015943892,0.00017546493,0.00003373134,0.000020384014,0.0012311523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99395925,0.0007393856,0.0011796107,0.0004198852,0.003202793,0.00049909565],"domain_scores_gemma":[0.9845381,0.0055209505,0.00058301794,0.00036000618,0.008735706,0.00026222432],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012110071,0.00019522195,0.00045199052,0.0007182045,0.0005881428,0.001337619,0.00070546666,0.000111023204,0.0017542585],"category_scores_gemma":[0.011330595,0.00012806372,0.00012742993,0.0012042555,0.00033721927,0.0014836137,0.00006991095,0.00052853575,0.00007142544],"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.0025191465,0.00091734057,0.0013768704,0.000054786844,0.0003707259,0.00003140948,0.009417902,0.47462523,0.0046001053,0.042069737,0.02149824,0.4425185],"study_design_scores_gemma":[0.006026294,0.0020605046,0.0022280065,0.0002653629,0.000043774253,0.0008028119,0.011598454,0.855289,0.00040847465,0.11519428,0.0055239517,0.0005590868],"about_ca_topic_score_codex":0.00003768493,"about_ca_topic_score_gemma":0.000020423342,"teacher_disagreement_score":0.6840749,"about_ca_system_score_codex":0.00011516187,"about_ca_system_score_gemma":0.0011870101,"threshold_uncertainty_score":0.9996991},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025332332,0.00023773119,0.956794,0.0007577151,0.0001778918,0.00081268797,0.000022545684,0.000025530207,0.015839543],"genre_scores_gemma":[0.88556045,0.000017162554,0.11306541,0.0000060969487,0.000057727153,0.00005533598,0.000039843304,0.00002269136,0.0011752885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980305,0.00016075082,0.0006096343,0.00014287766,0.00079752813,0.00025874455],"domain_scores_gemma":[0.9984874,0.0001699247,0.00009091279,0.00020345302,0.0009591645,0.00008913346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018756494,0.00012504552,0.00029674493,0.00090445956,0.00008272959,0.00017831115,0.00031484052,0.00005406223,0.000472892],"category_scores_gemma":[0.000028347291,0.00009993287,0.00022437282,0.000692053,0.000036495123,0.00029190633,0.000041441395,0.00016157184,0.000022050588],"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.000087368986,0.000067165834,0.0005289922,0.0003947087,0.0017536085,0.000011562794,0.00027605475,0.97439176,0.0012223484,0.0021670226,0.01779828,0.001301147],"study_design_scores_gemma":[0.0008035438,0.0002213986,0.0026416683,0.00017905624,0.00021808481,0.0000048854463,0.0026882149,0.98690814,0.0024290527,0.00004768396,0.003717111,0.00014118827],"about_ca_topic_score_codex":0.0000065483573,"about_ca_topic_score_gemma":0.0000011194459,"teacher_disagreement_score":0.8602281,"about_ca_system_score_codex":0.00013528424,"about_ca_system_score_gemma":0.000023216951,"threshold_uncertainty_score":0.5177836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026150933,0.0011670892,0.9299395,0.006727358,0.00039722808,0.0005437534,0.000016176025,0.000010549494,0.035047423],"genre_scores_gemma":[0.9877771,0.000030943385,0.008286316,0.000026179405,0.00045300022,0.00003057649,0.0000052830615,0.000019405521,0.003371178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98987806,0.0019519043,0.0014692625,0.00045592763,0.005721499,0.00052335486],"domain_scores_gemma":[0.98596895,0.0075707054,0.00041618722,0.00060418446,0.0051681157,0.00027186374],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04593356,0.00016272871,0.0005160605,0.0011763572,0.00051585276,0.0012531726,0.0014780291,0.00012254955,0.000102188606],"category_scores_gemma":[0.013226027,0.000107460706,0.00030413785,0.0012287588,0.00047368536,0.0007718187,0.000097310265,0.00053081807,0.00013872681],"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.0001385174,0.00013214705,0.00026660817,0.0000111487325,0.000050101673,0.000004506299,0.0005339896,0.38341644,0.00023021991,0.6018293,0.01065188,0.0027351484],"study_design_scores_gemma":[0.0005305664,0.0003569321,0.00018622399,0.000044446588,0.000018399529,0.00010031884,0.0034820572,0.7709718,0.000088523935,0.20688897,0.017198186,0.00013358645],"about_ca_topic_score_codex":0.000006923264,"about_ca_topic_score_gemma":0.0000030287213,"teacher_disagreement_score":0.9616262,"about_ca_system_score_codex":0.00013456405,"about_ca_system_score_gemma":0.0006964917,"threshold_uncertainty_score":0.99978364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903209,0.0026962168,0.18788783,0.010809999,0.00067102036,0.00042710511,0.000012892781,0.000051725314,0.007122321],"genre_scores_gemma":[0.9758674,0.00034663462,0.023397632,0.0000034442196,0.00019221762,0.0000051117436,0.00000303896,0.000016357202,0.00016817215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.00004930001,0.0002371783,0.00007885806,0.00058265484,0.00019364894],"domain_scores_gemma":[0.9989513,0.00022081698,0.00006481376,0.00014604689,0.00052465545,0.000092354254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017924791,0.00007300544,0.000098255216,0.000106290994,0.0013209297,0.0006741163,0.0002084548,0.00003938584,0.000012407053],"category_scores_gemma":[0.00024324475,0.00004745965,0.000024144416,0.00007721874,0.0001465316,0.00037091237,0.000007464683,0.00043876615,0.0000030432975],"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.00015636439,0.000027119464,0.016607247,0.000041224626,0.00017959424,0.00007163884,0.0035366593,0.9435822,0.002449202,0.008930719,0.0002953549,0.02412271],"study_design_scores_gemma":[0.002006017,0.0003007781,0.051292636,0.0003706057,0.000028943492,0.0002660565,0.01686925,0.92063516,0.003750709,0.000672123,0.0034725375,0.00033519103],"about_ca_topic_score_codex":0.000004783364,"about_ca_topic_score_gemma":0.000014213835,"teacher_disagreement_score":0.18554652,"about_ca_system_score_codex":0.000036391215,"about_ca_system_score_gemma":0.00009715403,"threshold_uncertainty_score":0.9999792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381267,0.0036264984,0.01909361,0.0043607666,0.000594544,0.0006625897,0.00008883972,0.000006379591,0.033440113],"genre_scores_gemma":[0.9976642,0.00009739411,0.0008843256,0.0000058205756,0.000072572686,0.0000036249262,8.667613e-7,0.000010452411,0.0012607443],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9826101,0.00080130657,0.0018931471,0.00038457906,0.01393916,0.00037172865],"domain_scores_gemma":[0.97486955,0.0018785656,0.00148752,0.0010189468,0.020554466,0.00019096138],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03843056,0.00015133536,0.0006240538,0.0009196395,0.00078580633,0.00060804666,0.0026411095,0.000085005544,0.00045154567],"category_scores_gemma":[0.0526672,0.00010451094,0.00026532248,0.00081804843,0.001029893,0.0008435851,0.00022510876,0.00049719773,0.00004735145],"study_design_candidate":"bench_or_experimental","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.0025801233,0.008257664,0.4551402,0.0006109698,0.0019334997,0.00052725227,0.021801783,0.049923103,0.2820719,0.042183198,0.026144529,0.10882578],"study_design_scores_gemma":[0.012106095,0.006639639,0.24971183,0.0029124436,0.00039009334,0.00047801022,0.14841954,0.013633377,0.50553894,0.017415948,0.041005995,0.0017480615],"about_ca_topic_score_codex":0.00015877461,"about_ca_topic_score_gemma":0.00019131807,"teacher_disagreement_score":0.22346708,"about_ca_system_score_codex":0.0001784579,"about_ca_system_score_gemma":0.002720605,"threshold_uncertainty_score":0.9901381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358549,0.00038633528,0.0075888354,0.006761109,0.00020279769,0.00036560785,0.0000017375767,0.00003023847,0.048808444],"genre_scores_gemma":[0.9977806,0.000023249728,0.0008068362,0.00007317548,0.00080579554,0.0000048281295,0.0000049385467,0.000017107332,0.00048344294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979618,0.000105484476,0.00040455823,0.00020204515,0.0010075386,0.0003185712],"domain_scores_gemma":[0.997736,0.00019799153,0.00015195983,0.00013619932,0.0017399476,0.000037900532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036219743,0.00011268799,0.00023265982,0.00063016487,0.00029832456,0.00044205188,0.00024243385,0.00006259696,0.00017947386],"category_scores_gemma":[0.00055183645,0.00008266195,0.0000322659,0.001081272,0.0004035433,0.0014544924,0.00008935428,0.00043469144,0.000071133305],"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.001905173,0.0005135968,0.32745293,0.00019621389,0.0005175375,0.0005428282,0.0005511759,0.013934922,0.004227005,0.641421,0.0061788107,0.0025587738],"study_design_scores_gemma":[0.01776397,0.0032731767,0.3283612,0.0040669916,0.00047780946,0.001832184,0.04282712,0.31266224,0.0017139629,0.12580465,0.15860963,0.0026070685],"about_ca_topic_score_codex":0.000059393966,"about_ca_topic_score_gemma":0.000037113747,"teacher_disagreement_score":0.51561636,"about_ca_system_score_codex":0.00009957605,"about_ca_system_score_gemma":0.00019311556,"threshold_uncertainty_score":0.42627165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9747255,0.0013259231,0.002218907,0.008855596,0.00018023717,0.0005160397,0.000020081177,0.000004530608,0.012153173],"genre_scores_gemma":[0.9923406,0.00005086719,0.0053776763,0.00001707495,0.0004038603,0.000009707511,0.0000016067149,0.000013954831,0.0017846295],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9715619,0.005517767,0.0026397773,0.0004938678,0.019069944,0.0007167551],"domain_scores_gemma":[0.9521289,0.015565112,0.00093969866,0.0008361678,0.0303398,0.00019034391],"candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.16308616,0.00015225446,0.00053752435,0.002310877,0.0011273621,0.0003971097,0.0031823255,0.00015732073,0.0006932292],"category_scores_gemma":[0.051147435,0.00008532559,0.00026155767,0.0069948793,0.0034521346,0.0007095522,0.0005336479,0.0018650163,0.00016492468],"study_design_candidate":"bench_or_experimental","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.0014516984,0.0011258819,0.026755648,0.00007503348,0.00034617967,0.000032049447,0.048486218,0.01430309,0.6584539,0.14673536,0.057640024,0.044594932],"study_design_scores_gemma":[0.0046954933,0.025360158,0.10189193,0.0025714114,0.00018094003,0.0007806382,0.18794765,0.16639584,0.14567284,0.33403522,0.029364396,0.0011034785],"about_ca_topic_score_codex":0.00004085135,"about_ca_topic_score_gemma":0.000016357038,"teacher_disagreement_score":0.512781,"about_ca_system_score_codex":0.00017580758,"about_ca_system_score_gemma":0.0029453894,"threshold_uncertainty_score":0.9992599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792028,0.00013480833,0.0008041758,0.002405506,0.0000675628,0.00024800366,0.0000010260877,0.000010615035,0.0171255],"genre_scores_gemma":[0.9978215,0.00002795767,0.0010299127,0.000060312606,0.00025669808,0.000022482513,0.000023387629,0.000021075119,0.000736682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983837,0.000097413365,0.00040882602,0.00021170922,0.0006431794,0.0002551769],"domain_scores_gemma":[0.99860066,0.00019621893,0.00020072912,0.00015944264,0.00081365183,0.000029268522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019689847,0.000118944175,0.00019114435,0.0011411898,0.00027164767,0.00046841174,0.00019620378,0.00005975802,0.00045389734],"category_scores_gemma":[0.00011552317,0.000099058656,0.000045064655,0.0010040774,0.00010550695,0.0016066899,0.00006784083,0.00060500065,0.00010490207],"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.00035448596,0.0004193743,0.3265338,0.000064076245,0.0001446308,0.000039929128,0.00041967657,0.038640305,0.008431502,0.6224074,0.00019328485,0.0023515846],"study_design_scores_gemma":[0.007754818,0.0007162464,0.57848394,0.0026702045,0.0005526497,0.0005118647,0.15348533,0.09153335,0.00061218016,0.14363077,0.0179477,0.0021009296],"about_ca_topic_score_codex":0.00005130975,"about_ca_topic_score_gemma":0.00014090228,"teacher_disagreement_score":0.4787766,"about_ca_system_score_codex":0.0001322205,"about_ca_system_score_gemma":0.00015636176,"threshold_uncertainty_score":0.49698576},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7093033,0.00073786586,0.26298475,0.0015079417,0.0011781732,0.002888296,0.0000347199,0.00024222648,0.021122737],"genre_scores_gemma":[0.94714415,0.00002467973,0.052466474,0.000009846222,0.00016228211,0.000014040446,0.000017599039,0.00002610212,0.00013481565],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978172,0.00033163364,0.00040870628,0.00016908403,0.0009640536,0.0003092983],"domain_scores_gemma":[0.99788547,0.00024718387,0.00007544014,0.0002388137,0.0014174886,0.00013561784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025850977,0.00013926618,0.00025740277,0.0004329974,0.00014762071,0.00014464601,0.00028143305,0.00008790454,0.000069795424],"category_scores_gemma":[0.00021283232,0.000108501335,0.000088989975,0.00028423616,0.000041378542,0.00037296762,0.00001946003,0.00043680443,0.000012111796],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00034511217,0.00023230907,0.002309903,0.00006364844,0.00022312174,0.000024114543,0.0007893942,0.014033121,0.95631015,0.0030581853,0.013381839,0.009229101],"study_design_scores_gemma":[0.0035056865,0.0036126876,0.0065475376,0.0012127685,0.00006724439,0.0005152968,0.0027659754,0.44227326,0.5199238,0.0077654007,0.011053622,0.00075672875],"about_ca_topic_score_codex":0.0000070126957,"about_ca_topic_score_gemma":0.0000038618978,"teacher_disagreement_score":0.43638638,"about_ca_system_score_codex":0.00015470678,"about_ca_system_score_gemma":0.00024423495,"threshold_uncertainty_score":0.44245562},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97375405,0.000054504904,0.00113003,0.00046789608,0.00004472495,0.0001261903,0.0000066925177,0.000004457281,0.024411434],"genre_scores_gemma":[0.9983498,0.00004030332,0.0003688856,0.000045221754,0.00016433334,0.0000045260367,0.000019289664,0.000016350079,0.0009913268],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972859,0.00011170315,0.00075659505,0.00017686636,0.0013773341,0.00029160478],"domain_scores_gemma":[0.99624056,0.00040423952,0.0005315482,0.00033238047,0.0024699955,0.000021274705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005830898,0.00012459168,0.00045590114,0.00092723937,0.00023112306,0.00012255105,0.000517848,0.000057907277,0.0009623537],"category_scores_gemma":[0.00058009767,0.00008515572,0.0002786922,0.0023279975,0.00018595834,0.001531884,0.00014993951,0.00047380137,0.000043228003],"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.00016326089,0.00013916807,0.54556394,0.000054870914,0.0009185182,0.000003850259,0.00034426496,0.38740548,0.0020521372,0.0625677,0.0004766474,0.00031014968],"study_design_scores_gemma":[0.00033388473,0.000029262541,0.034502666,0.00012003889,0.0003760073,0.000003892445,0.0031911049,0.95835006,0.00033888742,0.0018770264,0.00075351406,0.00012365771],"about_ca_topic_score_codex":0.000048406386,"about_ca_topic_score_gemma":0.00004196194,"teacher_disagreement_score":0.5709446,"about_ca_system_score_codex":0.000050356117,"about_ca_system_score_gemma":0.00015561769,"threshold_uncertainty_score":0.9999509},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982382,0.22582826,0.029458769,0.10778892,0.0017770173,0.0075398223,0.00006922135,0.000065290915,0.02923447],"genre_scores_gemma":[0.99792916,0.00089845655,0.0003142162,0.00019346128,0.00033449312,0.000038680577,0.000017768944,0.000017797649,0.00025596545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979841,0.00011299942,0.00057649054,0.000175619,0.000880644,0.0002701404],"domain_scores_gemma":[0.99671113,0.0009532529,0.00029526546,0.00015033023,0.0018487567,0.000041257084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040828283,0.00012374549,0.000294482,0.00022737318,0.0006540077,0.00039625762,0.00023826752,0.000036067075,0.00010345609],"category_scores_gemma":[0.0034588592,0.000077809804,0.000086140404,0.00054882606,0.00020911056,0.0005770052,0.000086421256,0.00033841527,0.000002471976],"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.0026108646,0.0015853324,0.024876984,0.0042682276,0.00210947,0.00029497134,0.0019181285,0.003215006,0.018129114,0.5363226,0.24473758,0.15993173],"study_design_scores_gemma":[0.007307898,0.0009690367,0.0147231165,0.014748053,0.00058508676,0.00038316278,0.058659792,0.089324094,0.0009378861,0.010358078,0.801191,0.00081280473],"about_ca_topic_score_codex":0.000014748291,"about_ca_topic_score_gemma":0.000022834387,"teacher_disagreement_score":0.5564534,"about_ca_system_score_codex":0.00006885186,"about_ca_system_score_gemma":0.00036490816,"threshold_uncertainty_score":0.5030165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09269167,0.0009986827,0.8763045,0.012947028,0.00031856782,0.0002624198,0.000010513331,0.000017580753,0.016449051],"genre_scores_gemma":[0.91343594,0.00016202012,0.0858813,0.000040186605,0.000112295114,0.000002769891,0.000004740232,0.0000061794594,0.0003545804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979958,0.00018272149,0.00027865655,0.00021397343,0.0010937657,0.00023511186],"domain_scores_gemma":[0.9975994,0.00017579632,0.00007058072,0.00022201301,0.0017801872,0.00015198033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387705,0.00008527617,0.0001541786,0.00023051676,0.00030559453,0.00047770925,0.00035621042,0.00004182069,0.00011865734],"category_scores_gemma":[0.00013639232,0.000068423666,0.000040307506,0.0006415782,0.0003010266,0.00065961335,0.00013382846,0.00042025442,0.000011407952],"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.0001316053,0.0005474191,0.009272853,0.00007521872,0.00028378426,0.0020961529,0.0024406034,0.0017604769,0.015153486,0.88375056,0.006387146,0.0781007],"study_design_scores_gemma":[0.0145481145,0.006269704,0.19634627,0.001769642,0.0000831807,0.060068198,0.016783863,0.27666578,0.07730292,0.28977337,0.05798408,0.002404905],"about_ca_topic_score_codex":0.0000018714825,"about_ca_topic_score_gemma":0.0000027679514,"teacher_disagreement_score":0.8207443,"about_ca_system_score_codex":0.000041608717,"about_ca_system_score_gemma":0.00076067954,"threshold_uncertainty_score":0.46065614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74855334,0.0057924404,0.06170797,0.08214497,0.0015870269,0.0017184209,0.00003562732,0.00009189438,0.09836832],"genre_scores_gemma":[0.9898689,0.00040584934,0.004133707,0.00025953326,0.0017028236,0.000010017981,0.0000845242,0.000030513387,0.003504161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974939,0.000092242335,0.00042727636,0.00026252534,0.001400799,0.00032320642],"domain_scores_gemma":[0.99755967,0.00009162587,0.00016564371,0.00015883145,0.0019718446,0.00005241461],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020719403,0.00014769893,0.00021391384,0.00046846742,0.00043605556,0.0009860366,0.00020588742,0.000058717626,0.0013870033],"category_scores_gemma":[0.00029506712,0.00011826518,0.00005200309,0.00056671735,0.000113006354,0.0012781272,0.00013978875,0.0004193565,0.00002421383],"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.002096059,0.0040432517,0.15377915,0.0014769936,0.0016251712,0.004752242,0.0036127155,0.5550058,0.0073927077,0.17032528,0.079937756,0.015952863],"study_design_scores_gemma":[0.00926049,0.0007592358,0.026126537,0.0012121527,0.00026822448,0.001299573,0.07035218,0.4820562,0.0012767568,0.002484295,0.40350178,0.0014025497],"about_ca_topic_score_codex":0.000013817661,"about_ca_topic_score_gemma":0.000022622391,"teacher_disagreement_score":0.32356405,"about_ca_system_score_codex":0.00008452898,"about_ca_system_score_gemma":0.0002550664,"threshold_uncertainty_score":0.99952585},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6938348,0.016088275,0.24186157,0.013146392,0.002009596,0.0027284503,0.0006596819,0.0005361991,0.029135052],"genre_scores_gemma":[0.80312705,0.00020844051,0.19267105,0.000027304015,0.0001441432,0.000029337469,0.000044335324,0.000044712804,0.0037036573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977502,0.00023893065,0.00037532276,0.0002131179,0.0011073302,0.00031507004],"domain_scores_gemma":[0.9988222,0.00032172445,0.000065021166,0.00016902605,0.00043766422,0.00018435137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015635936,0.00017853045,0.00024911555,0.0004179475,0.0006724479,0.00019589634,0.00024170548,0.000051693245,0.0015748108],"category_scores_gemma":[0.00017787643,0.0001430436,0.00004678214,0.00041490284,0.00009294512,0.0002587278,0.00007935818,0.0010864058,0.0000484596],"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.00022836137,0.00014507204,0.0023730698,0.000017993452,0.00010473853,0.000059258065,0.00030991738,0.9916401,0.00055934256,0.0010322909,0.0022725582,0.0012573032],"study_design_scores_gemma":[0.0018517479,0.00048645475,0.0012186982,0.000043828306,0.000012289664,0.00028485528,0.00074091693,0.9919158,0.000503659,0.000096618474,0.0026341698,0.00021096667],"about_ca_topic_score_codex":0.000030616342,"about_ca_topic_score_gemma":0.000005451766,"teacher_disagreement_score":0.10929224,"about_ca_system_score_codex":0.00013305238,"about_ca_system_score_gemma":0.00017426249,"threshold_uncertainty_score":0.9993379},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047838926,0.00018392921,0.908923,0.01685071,0.0006326046,0.00072395086,0.000017399603,0.000077786746,0.0247517],"genre_scores_gemma":[0.97349936,0.000088680106,0.025140692,0.000030254634,0.00017057308,0.000012167163,0.000009844633,0.000009669712,0.0010387788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719197,0.00020177086,0.00036117662,0.00021771867,0.0016874777,0.0003399065],"domain_scores_gemma":[0.9976851,0.00032099392,0.00009748064,0.00025635198,0.001490725,0.00014936314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025383087,0.000098472636,0.00016175734,0.0005921022,0.0003553385,0.00043544394,0.0006969576,0.000049179383,0.00009150101],"category_scores_gemma":[0.00016859369,0.00007398925,0.00006248004,0.001695787,0.00023950434,0.00075102056,0.000130575,0.0004615414,0.00013067458],"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.00018386844,0.00068356184,0.005903279,0.0001209387,0.0003970812,0.0011264796,0.0071155243,0.08250177,0.008646657,0.7513333,0.094205126,0.047782425],"study_design_scores_gemma":[0.0045808414,0.0036531687,0.03833969,0.00072708674,0.000020166857,0.0026053563,0.0039092195,0.76664025,0.0049953535,0.08124977,0.0923951,0.00088402774],"about_ca_topic_score_codex":0.0000040449813,"about_ca_topic_score_gemma":0.0000017625023,"teacher_disagreement_score":0.92566043,"about_ca_system_score_codex":0.00006528394,"about_ca_system_score_gemma":0.0007469021,"threshold_uncertainty_score":0.41989958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5275142,0.0036654654,0.03569236,0.39737132,0.003188758,0.0029085076,0.000034136883,0.00015554449,0.029469687],"genre_scores_gemma":[0.9960134,0.0000728018,0.0005222096,0.00006132248,0.0014338171,0.00008187481,0.000040111947,0.00002082032,0.0017536195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782795,0.00007791037,0.0005853996,0.00030020808,0.00080966065,0.00039884457],"domain_scores_gemma":[0.997988,0.00019355967,0.00010152346,0.0001511526,0.0015446536,0.000021113874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006697668,0.00012428852,0.00022295475,0.0030097403,0.00025298822,0.0009842949,0.00032588557,0.00009275047,0.0002591121],"category_scores_gemma":[0.0022342948,0.000105488754,0.00010586506,0.002165397,0.00015473846,0.0022222218,0.00012625412,0.00065194274,0.00010977765],"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.0001700104,0.00026556413,0.0077414853,0.00041694398,0.00023927963,0.00012957517,0.0003408437,0.00049603754,0.001944238,0.84669256,0.1018889,0.039674584],"study_design_scores_gemma":[0.0011990725,0.00030101882,0.005485749,0.001003748,0.00006182406,0.00007342474,0.01978928,0.01640281,0.0012280873,0.12211512,0.8318209,0.0005189375],"about_ca_topic_score_codex":0.000017308745,"about_ca_topic_score_gemma":0.000029432023,"teacher_disagreement_score":0.729932,"about_ca_system_score_codex":0.0002173674,"about_ca_system_score_gemma":0.00024806015,"threshold_uncertainty_score":0.9491579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31189552,0.008952289,0.6461742,0.009328347,0.0010637381,0.007359756,0.00022014191,0.00045329772,0.014552702],"genre_scores_gemma":[0.9398755,0.00035393142,0.058653764,0.000011189675,0.000091666974,0.00047666917,0.000020130843,0.000052150368,0.00046502418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997826,0.00020704248,0.000593853,0.00020293682,0.0007728552,0.000397329],"domain_scores_gemma":[0.9974189,0.001772722,0.000040472663,0.00022350019,0.0004439053,0.00010051368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019634098,0.00019041613,0.00029761496,0.0007615389,0.00015974224,0.0004473047,0.00033965442,0.000107930406,0.00007409032],"category_scores_gemma":[0.00010970222,0.00010856907,0.00014819372,0.0008808361,0.00015448639,0.00048977905,0.000020608995,0.00068609207,0.000010601008],"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.0039253337,0.001262707,0.0014664893,0.0019131945,0.0041426914,0.00075536256,0.011136882,0.0047419267,0.44666904,0.20164219,0.10208939,0.2202548],"study_design_scores_gemma":[0.0072020325,0.004337801,0.002580898,0.00219484,0.00022927158,0.0009341044,0.0026674408,0.71035874,0.055602044,0.12663856,0.08586712,0.0013871527],"about_ca_topic_score_codex":0.000004840435,"about_ca_topic_score_gemma":0.000009662715,"teacher_disagreement_score":0.70561683,"about_ca_system_score_codex":0.00012159429,"about_ca_system_score_gemma":0.0002282883,"threshold_uncertainty_score":0.4427318},"labels":[],"label_agreement":null}]}