{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"c718cd23bb27","filters":{"venue":"Journal of the Operations Research Society of China"}},"results":[{"id":"W3097704957","doi":"10.1007/s40305-020-00324-7","title":"Pricing Decisions in Dual-Channel Closed-Loop Supply Chain Under Retailer’s Risk Aversion and Fairness Concerns","year":2020,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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":"Supply chain; Dual (grammatical number); Microeconomics; Risk aversion (psychology); Business; Channel (broadcasting); Closed loop; Economics; Marketing; Expected utility hypothesis; Computer science; Financial economics","authors":[{"name":"Chunfa Li","is_ca":false},{"name":"Xue-Qing Guo","is_ca":false},{"name":"Du Donglei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07361492902336443,"gpt":0.3127234505632386,"spread":0.2391085215398742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002543716,0.000121287,0.0002430777,0.0001738185,0.0005824272,0.0002435782,0.0003465738,0.00006595193,0.0001314902],"category_scores_gemma":[0.0007963497,0.00008446923,0.0002118586,0.0008593533,0.0002050567,0.0008688723,0.0005506329,0.000677691,0.000008428233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009561347,"about_ca_system_score_gemma":0.00008972885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005055201,"about_ca_topic_score_gemma":0.000102075,"domain_scores_codex":[0.998085,0.0001443328,0.0004797841,0.0001768929,0.0008594158,0.0002546098],"domain_scores_gemma":[0.999073,0.0001784536,0.0001952213,0.0001932952,0.0003179245,0.00004207826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006948115,0.001374626,0.06813743,0.001131256,0.0009223316,0.00006403639,0.03660428,0.398045,0.01463728,0.02703186,0.438088,0.01326909],"study_design_scores_gemma":[0.005103464,0.0002482982,0.1251988,0.0008859034,0.0001391742,0.00001148767,0.04458514,0.7794987,0.0009193988,0.007407495,0.03554977,0.0004523486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9585678,0.0002742952,0.001980835,0.03763037,0.0001888929,0.0004455686,0.000005147363,0.000008799011,0.0008982852],"genre_scores_gemma":[0.9964008,0.001406448,0.0003105734,0.001018329,0.0005142512,0.000004869563,0.000003208605,0.00001601172,0.0003254969],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4025383,"threshold_uncertainty_score":0.4479618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974465585","doi":"10.1007/s40305-014-0053-z","title":"Simultaneous Approximation of Multi-criteria Submodular Function Maximization","year":2014,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Maximization; Mathematics; Function (biology); Approximation algorithm; Characterization (materials science); Mathematical optimization; Combinatorics; Physics","authors":[{"name":"Donglei Du","is_ca":true},{"name":"Yu Li","is_ca":false},{"name":"Naihua Xiu","is_ca":false},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04455253395858549,"gpt":0.3299857041348491,"spread":0.2854331701762636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750369,0.00007620756,0.0001816782,0.0001177014,0.0003967744,0.0001123358,0.0009043477,0.00006084791,0.0000147727],"category_scores_gemma":[0.0006436159,0.0000537694,0.0002528086,0.0007485521,0.0002080519,0.0005711424,0.0002083358,0.0003542171,0.000001090196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000051187,"about_ca_system_score_gemma":0.0001278419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004004888,"about_ca_topic_score_gemma":0.000008665244,"domain_scores_codex":[0.997917,0.0004917128,0.0004751686,0.0001199032,0.0008426515,0.0001535505],"domain_scores_gemma":[0.9979355,0.0001992822,0.0001924373,0.0004160868,0.001206094,0.0000506519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007459479,0.00127334,0.0003393019,0.0003261438,0.0002457988,9.312973e-7,0.01227312,0.7216881,0.1227559,0.05676357,0.003590767,0.0806685],"study_design_scores_gemma":[0.0004124977,0.000223299,0.002616868,0.00006604266,0.000007975736,0.00001254517,0.0001100253,0.9837885,0.006455188,0.00582889,0.0004268768,0.00005124569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09369745,0.00009638227,0.9035946,0.002101382,0.000268967,0.0001726067,0.000002839063,0.000007513649,0.00005823087],"genre_scores_gemma":[0.8104141,0.00006591583,0.1892726,0.00003344258,0.00009031015,0.000002046983,0.000001497507,0.000004928063,0.0001151516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7167166,"threshold_uncertainty_score":0.3051708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611727281","doi":"10.1007/s40305-017-0164-4","title":"A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem","year":2017,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Steiner tree problem; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Computer science","authors":[{"name":"Lu Han","is_ca":false},{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Chenchen Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09638973414503361,"gpt":0.3840629623885448,"spread":0.2876732282435112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004843677,0.0001128865,0.0002280956,0.00006257513,0.005068144,0.001045614,0.003186746,0.00006037326,0.000008817118],"category_scores_gemma":[0.0005517695,0.00005935365,0.0005733344,0.0003591427,0.000502449,0.000760679,0.0008923236,0.0006780273,6.226164e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008252394,"about_ca_system_score_gemma":0.0006252789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001822177,"about_ca_topic_score_gemma":0.00008347454,"domain_scores_codex":[0.9977775,0.000239502,0.0004639397,0.0001720686,0.001006557,0.0003404554],"domain_scores_gemma":[0.9971098,0.0004463788,0.0002993405,0.0008962786,0.001173379,0.00007480317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001480987,0.001751491,0.001371557,0.0003479659,0.002430004,0.00001054967,0.04533008,0.0760344,0.02068855,0.1699912,0.1818868,0.5000093],"study_design_scores_gemma":[0.001319996,0.0002841986,0.004592691,0.0001071774,0.00002077226,0.00006201323,0.0002434221,0.9681935,0.002059927,0.01649215,0.006517597,0.0001065501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03244327,0.0005098702,0.9074828,0.05708371,0.0006634954,0.001364225,0.00001975031,0.00001463031,0.0004182419],"genre_scores_gemma":[0.1129115,0.0002598702,0.8827364,0.0001320246,0.0006948293,0.00005617043,6.730162e-7,0.00001535533,0.003193196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8921591,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224005576","doi":"10.1007/s40305-022-00398-5","title":"Cubic Regularization Methods with Second-Order Complexity Guarantee Based on a New Subproblem Reformulation","year":2022,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"National Natural Science Foundation of China","keywords":"Hessian matrix; Regularization (linguistics); Mathematics; Lipschitz continuity; Minification; Trust region; Eigenvalues and eigenvectors; Applied mathematics; Regular polygon; Computational complexity theory; Mathematical optimization; Algorithm; Computer science; Mathematical analysis; Artificial intelligence","authors":[{"name":"Rujun Jiang","is_ca":false},{"name":"Zhishuo Zhou","is_ca":true},{"name":"Zirui Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.136753856636964,"gpt":0.4532613657135169,"spread":0.3165075090765529,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006019854,0.0001459147,0.0003204162,0.0002540047,0.001413252,0.00009075679,0.0007275079,0.00006341438,0.0009672505],"category_scores_gemma":[0.001190184,0.00009534792,0.0002224051,0.002203677,0.0002795683,0.000383967,0.0002337422,0.001399398,9.882953e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005837352,"about_ca_system_score_gemma":0.001534157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003601705,"about_ca_topic_score_gemma":0.00003428189,"domain_scores_codex":[0.9947155,0.00181937,0.0006730043,0.0001945221,0.002290983,0.0003065936],"domain_scores_gemma":[0.9965013,0.0005759475,0.0003230087,0.0005814978,0.001922214,0.0000960861],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002387887,0.0003992041,0.00003755455,0.00007506357,0.0001008898,0.000001004886,0.002429881,0.9714343,0.003481627,0.01309971,0.00717271,0.001529269],"study_design_scores_gemma":[0.001846789,0.0007709494,0.000458657,0.00009185237,0.00002269813,0.00003468066,0.0008693464,0.9380937,0.005018074,0.05097611,0.001689519,0.0001276134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01977671,0.0000579049,0.9642692,0.01403664,0.00009040504,0.0009999595,0.00002951501,0.00001754128,0.0007220815],"genre_scores_gemma":[0.06104677,0.00002852429,0.9322354,0.0001343768,0.00009534402,0.00002805024,0.00001668458,0.00004467991,0.006370124],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04127006,"threshold_uncertainty_score":0.999946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2961884489","doi":"10.1007/s40305-019-00256-x","title":"Online Scheduling with Unit Processing Times and Processing Set Restrictions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Set (abstract data type); Unit (ring theory); Algorithm; Combinatorics; Mathematical optimization; Mathematics; Schedule; Upper and lower bounds; Operating system","authors":[{"name":"Yong Chen","is_ca":false},{"name":"Guang-Ting Chen","is_ca":false},{"name":"Longcheng Liu","is_ca":true},{"name":"Yiwei Jiang","is_ca":false},{"name":"Zhiyi Tan","is_ca":false},{"name":"An Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03202772653976704,"gpt":0.3227148121945191,"spread":0.290687085654752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733062,0.00008211916,0.0001481173,0.00009868525,0.0003799881,0.0001493915,0.0001993248,0.00005650828,0.00002112604],"category_scores_gemma":[0.00007690363,0.00005223415,0.00006230921,0.0007275138,0.0001188151,0.0003957702,0.00003990643,0.0006500147,9.960132e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004500405,"about_ca_system_score_gemma":0.0002918507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001155226,"about_ca_topic_score_gemma":0.000006404933,"domain_scores_codex":[0.9989669,0.00006076812,0.0002690362,0.00007697271,0.0004691922,0.0001571055],"domain_scores_gemma":[0.9990782,0.00004786535,0.00005694828,0.0001265777,0.0006267083,0.00006375982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006728246,0.00004201937,0.0009957284,0.0001218929,0.00004198205,2.619964e-7,0.002049559,0.9932585,0.001378766,0.00002290651,0.00016439,0.001917314],"study_design_scores_gemma":[0.0004126928,0.00007610949,0.00315847,0.0004281237,0.00001716909,0.00004262972,0.003090675,0.9916891,0.0008274753,0.00003889802,0.0001492135,0.00006937918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9751024,0.001334922,0.02095829,0.00206514,0.00006767062,0.000173095,0.000007881519,0.00002466604,0.0002658913],"genre_scores_gemma":[0.8189848,0.0003580027,0.1800154,0.00001690743,0.0001007021,0.000001718609,0.000002552695,0.0000191753,0.0005007306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1590571,"threshold_uncertainty_score":0.29226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3114113748","doi":"10.1007/s40305-021-00382-5","title":"Approximations for a Queueing Game Model with Join-the-Shortest-Queue Strategy","year":2022,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Join (topology); Queue; Computer science; Queueing theory; Bulk queue; Mathematical optimization; Mathematical economics; Mathematics; Computer network; Combinatorics","authors":[{"name":"Qihui Bu","is_ca":false},{"name":"Liwei Liu","is_ca":false},{"name":"Jiashan Tang","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05689808837259584,"gpt":0.3308756656474695,"spread":0.2739775772748736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003748188,0.0001013389,0.0002020158,0.0001430719,0.002131279,0.0002439094,0.0007859145,0.00002468421,0.00007384359],"category_scores_gemma":[0.0003227275,0.00005897896,0.0003483256,0.001130571,0.0002384151,0.0009549513,0.0002844273,0.000709464,8.945373e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213907,"about_ca_system_score_gemma":0.0002936663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008649686,"about_ca_topic_score_gemma":0.00007172715,"domain_scores_codex":[0.9982588,0.0001201961,0.0004023117,0.0001264525,0.0008534862,0.0002387419],"domain_scores_gemma":[0.998295,0.0001731937,0.0002639799,0.0003335986,0.0009191866,0.00001501884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005072606,0.0001083279,0.00004768768,0.00004196499,0.0001229098,3.680458e-7,0.0006925999,0.9587192,0.001639138,0.03423122,0.004001378,0.0003445011],"study_design_scores_gemma":[0.0003906998,0.00005658374,0.0001080703,0.00003497947,0.00007785908,0.000008594776,0.003541815,0.9578134,0.0001073152,0.0347704,0.003011599,0.00007862483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6580198,0.0002909814,0.2872552,0.05020531,0.0001261982,0.001562807,0.00003901463,0.00003143648,0.002469301],"genre_scores_gemma":[0.990458,0.0000163508,0.006845392,0.0003355125,0.0002765736,0.00007409375,0.000005166904,0.00002275019,0.001966196],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3324382,"threshold_uncertainty_score":0.9991678,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413122834","doi":"10.1007/s40305-025-00619-7","title":"Hypergraphs with a Quarter Uniform Turán Density","year":2025,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Quarter (Canadian coin); Mathematics; Combinatorics; History; Archaeology","authors":[{"name":"Li Hao","is_ca":false},{"name":"Hao Lin","is_ca":false},{"name":"Guanghui Wang","is_ca":false},{"name":"Wenling Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03066533879838002,"gpt":0.3596581150721673,"spread":0.3289927762737873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145823,0.00009236296,0.0002333637,0.0001094028,0.0008564626,0.00006027162,0.0005683211,0.000078104,0.00002998321],"category_scores_gemma":[0.0003459473,0.00004536356,0.0003515255,0.0006152191,0.0004628188,0.0001620977,0.0001577305,0.0007807134,3.046767e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000632318,"about_ca_system_score_gemma":0.0003012623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002678197,"about_ca_topic_score_gemma":0.00004866427,"domain_scores_codex":[0.9983959,0.0002605995,0.0003613845,0.00008535067,0.0007071979,0.0001896347],"domain_scores_gemma":[0.9983084,0.0003058983,0.00009404791,0.0004002786,0.0008421729,0.00004926328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003014971,0.000534476,0.00517374,0.0003990531,0.001483925,0.000004736302,0.0214577,0.001378979,0.00707553,0.8201823,0.1409,0.001108084],"study_design_scores_gemma":[0.001880838,0.0005569431,0.02931053,0.000725254,0.000184137,0.0001317005,0.006707102,0.002961238,0.01259166,0.9420567,0.002689941,0.000203944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987042,0.0001563456,0.002554745,0.006903153,0.0001536584,0.0002277268,0.000004454158,0.000005299478,0.002952657],"genre_scores_gemma":[0.9812047,0.0001018036,0.01688944,0.0001152426,0.00006700463,0.000002540673,2.402737e-7,0.000007679848,0.001611314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1382101,"threshold_uncertainty_score":0.6587304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4360985546","doi":"10.1007/s40305-023-00469-1","title":"Maximizing the Ratio of Monotone DR-Submodular Functions on Integer Lattice","year":2023,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Monotone polygon; Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Integer lattice; Half-integer; Computer science; Physics","authors":[{"name":"Sheng-Min-Jie Chen","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Wenguo Yang","is_ca":false},{"name":"Suixiang Gao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08786346303967044,"gpt":0.359096034426609,"spread":0.2712325713869386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00393714,0.00008262308,0.0001771227,0.0001442901,0.0009874544,0.0001586304,0.001633235,0.00004577422,0.00002167663],"category_scores_gemma":[0.0004312215,0.0000460621,0.0004103458,0.001859546,0.0003767835,0.0004039634,0.0004613169,0.0008438187,0.000009218116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005758111,"about_ca_system_score_gemma":0.0002764266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006174682,"about_ca_topic_score_gemma":0.0000125346,"domain_scores_codex":[0.997673,0.0004381299,0.0004447612,0.0001264684,0.001101319,0.0002162734],"domain_scores_gemma":[0.9979621,0.0004855003,0.0001307231,0.0006424065,0.0007253738,0.00005394911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006321929,0.0009025265,0.0002910176,0.0001389973,0.0007595004,0.000006121875,0.03575937,0.5487858,0.03032339,0.1907491,0.1766406,0.01558033],"study_design_scores_gemma":[0.0004055609,0.0003020973,0.007380389,0.0001720436,0.0000164831,0.00002371252,0.001687082,0.961473,0.006123765,0.01841347,0.0039146,0.00008777146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3023622,0.0002965994,0.5724658,0.1218551,0.00145919,0.0006205099,0.00001905013,0.00003626657,0.0008853017],"genre_scores_gemma":[0.9649947,0.0003007434,0.03162304,0.0002101702,0.0003454291,0.00001383081,0.000001341125,0.00001205641,0.002498734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6626324,"threshold_uncertainty_score":0.7594801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411163553","doi":"10.1007/s40305-025-00603-1","title":"Customer Strategic Behavior in an N-Policy Vacation Queue with Variable Arrival and Service Rates","year":2025,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Queue; Variable (mathematics); Service (business); Business; Operations research; Computer science; Operations management; Marketing; Economics; Mathematics; Computer network","authors":[{"name":"Yuan-Yuan Liu","is_ca":false},{"name":"Zhao-Zeng Yan","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03511535359564896,"gpt":0.3654889654685687,"spread":0.3303736118729197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775361,0.00007916649,0.0001626547,0.0002926295,0.0003857274,0.0002407626,0.0003454557,0.00004504417,0.00002752746],"category_scores_gemma":[0.0001366375,0.00005136552,0.00005799002,0.002133357,0.0001317334,0.001359645,0.0001138375,0.0004146192,0.00000145418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008106564,"about_ca_system_score_gemma":0.0002971014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150933,"about_ca_topic_score_gemma":0.0006260805,"domain_scores_codex":[0.9990199,0.0001085923,0.0002824385,0.0001065247,0.0003284263,0.0001541774],"domain_scores_gemma":[0.9987268,0.00005939842,0.0001155402,0.0002017046,0.0008832943,0.0000132175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003372416,0.0009250031,0.03155734,0.0005340131,0.0002752079,0.000003513599,0.001969195,0.5610871,0.05652697,0.3447192,0.0008651405,0.001200075],"study_design_scores_gemma":[0.004379996,0.0002179872,0.1779015,0.001104826,0.0005509721,0.00002390341,0.0187106,0.5710039,0.003086296,0.2194973,0.002973328,0.0005494229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890732,0.00005664104,0.001038657,0.008767994,0.00002499761,0.0001897194,0.000001367355,0.000004686819,0.0008427111],"genre_scores_gemma":[0.9966124,0.00003832949,0.002375299,0.0003950724,0.0001725483,0.00001015608,0.000003326507,0.000008086525,0.0003847632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1463441,"threshold_uncertainty_score":0.2966742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951607788","doi":"10.1007/s40305-019-00255-y","title":"A Note on Submodularity Preserved Involving the Rank Functions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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; Matroid; Intersection (aeronautics); Rank (graph theory); Computer science; Function (biology); Combinatorics; Mathematical optimization; Mathematics; Mathematical economics","authors":[{"name":"Min Li","is_ca":false},{"name":"Donglei Du","is_ca":true},{"name":"Dachuan Xu","is_ca":false},{"name":"Zhenning Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05601398994931464,"gpt":0.3357606615284274,"spread":0.2797466715791128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004079718,0.00008629386,0.0001667179,0.00007956617,0.001118069,0.0002999102,0.002341382,0.00005575444,0.00004711562],"category_scores_gemma":[0.0003991691,0.0000458439,0.0004776355,0.0009608922,0.0002624387,0.000587641,0.000609844,0.001223868,0.00001203553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008651723,"about_ca_system_score_gemma":0.0003765657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001464347,"about_ca_topic_score_gemma":0.0000559292,"domain_scores_codex":[0.9974127,0.0006149165,0.0003450621,0.0001480037,0.001238005,0.0002413217],"domain_scores_gemma":[0.997776,0.0004788842,0.0001030963,0.000875835,0.0007015279,0.00006462298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000215731,0.002876911,0.008405145,0.0003341139,0.001136636,0.000006544722,0.05113455,0.3510266,0.07505989,0.307385,0.183074,0.01934493],"study_design_scores_gemma":[0.00110271,0.0005901078,0.07554003,0.0002560045,0.00001635667,0.00003853514,0.0007430703,0.8850905,0.003858557,0.02386031,0.008739137,0.0001646798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8136194,0.0005492113,0.09077699,0.09161907,0.001250612,0.0007845599,0.00001182663,0.00002064049,0.001367736],"genre_scores_gemma":[0.9840456,0.0001419112,0.01366649,0.0002350466,0.0001800302,0.000005600507,4.749331e-7,0.000006388554,0.001718504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5340639,"threshold_uncertainty_score":0.8599398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2971295615","doi":"10.1007/s40305-019-00261-0","title":"Preface: Special Issue on Combinatorial Optimization","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operations research; Mathematical economics; Combinatorics; Mathematics","authors":[{"name":"Guohui Lin","is_ca":true},{"name":"Liying Kang","is_ca":false},{"name":"Guochuan Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02170501564823777,"gpt":0.3120061369272344,"spread":0.2903011212789967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133194,0.00006982561,0.0001524174,0.00008440321,0.0003519165,0.0001649783,0.0009744664,0.00006504773,0.000152441],"category_scores_gemma":[0.0001730759,0.00004373652,0.000215221,0.0006181794,0.0001049879,0.0003957891,0.0002078977,0.0005340306,0.00002328947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006099702,"about_ca_system_score_gemma":0.0003009527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804853,"about_ca_topic_score_gemma":8.691143e-7,"domain_scores_codex":[0.9979488,0.0002886237,0.0003358688,0.0001238787,0.001132581,0.0001702978],"domain_scores_gemma":[0.9985203,0.0001013629,0.0001072454,0.0004164526,0.0007886664,0.00006595765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002556376,0.0002895418,0.0001216564,0.00002020808,0.00005139517,3.951501e-7,0.002684633,0.8425207,0.003572744,0.04692553,0.1028784,0.0009092106],"study_design_scores_gemma":[0.003362108,0.001821599,0.001626837,0.0004291388,0.00001525976,0.00002793023,0.0003784429,0.9226615,0.01792592,0.03057017,0.02094459,0.0002364702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8317366,0.0005497338,0.03443529,0.09384923,0.01588445,0.001964309,0.0000126665,0.00005728938,0.02151038],"genre_scores_gemma":[0.8970848,0.0003900712,0.09515947,0.0003408602,0.001328226,0.000004507431,0.000001432128,0.00001868251,0.005671934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09350837,"threshold_uncertainty_score":0.2706693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963480423","doi":"10.1007/s40305-019-00260-1","title":"Approximation Algorithms for Vertex Happiness","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; China Scholarship Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Hypergraph; Vertex (graph theory); Approximation algorithm; Inverse; Upper and lower bounds; Mathematics; Linear programming relaxation; Physics; Discrete mathematics; Graph; Algorithm; Linear programming; Mathematical analysis","authors":[{"name":"Yao Xu","is_ca":true},{"name":"Yong Chen","is_ca":false},{"name":"Peng Zhang","is_ca":false},{"name":"Randy Goebel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06820800589132216,"gpt":0.3611336697797232,"spread":0.2929256638884011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596198,0.00007089652,0.0001748981,0.00008613673,0.0004247456,0.0001762178,0.001482557,0.00005020203,0.00001699332],"category_scores_gemma":[0.0001769186,0.00004615684,0.0003778102,0.0006796542,0.0001354637,0.000682252,0.0002673105,0.0003802797,0.000003572698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006223299,"about_ca_system_score_gemma":0.0002992616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002184439,"about_ca_topic_score_gemma":0.00000298664,"domain_scores_codex":[0.9983616,0.0001604509,0.0003495664,0.0001247253,0.0008058182,0.000197843],"domain_scores_gemma":[0.9982214,0.0002124293,0.000104708,0.0004260297,0.0009836541,0.00005179668],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009186992,0.001719516,0.0007890792,0.0008311611,0.0007706267,0.000001448683,0.02850734,0.08806143,0.06800262,0.5606829,0.0993642,0.1511779],"study_design_scores_gemma":[0.000671313,0.0002316437,0.00270095,0.00009848281,0.000005221534,0.00002083143,0.0002699094,0.958759,0.004465964,0.02945939,0.003242755,0.00007454339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08253057,0.0002493646,0.8979488,0.01719564,0.0008892491,0.0007138354,0.0000102486,0.00001147003,0.0004508194],"genre_scores_gemma":[0.5361577,0.0001282481,0.4616482,0.0001380862,0.0002266089,0.0000171519,0.00000202619,0.00001082772,0.001671093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8706976,"threshold_uncertainty_score":0.3266843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983854422","doi":"10.1007/s40305-012-0002-7","title":"An Almost Tight Lower Bound for the Scheduling Problem to Meet Two Min-Sum Objectives","year":2013,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Scheduling (production processes); Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Computer science; Mathematical analysis","authors":[{"name":"Donglei Du","is_ca":true},{"name":"Dachuan Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02532677473620773,"gpt":0.334522220282114,"spread":0.3091954455459062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606101,0.0001018995,0.0001563104,0.00006444073,0.000705469,0.0003214433,0.0005863959,0.00005460847,0.0000604157],"category_scores_gemma":[0.0002184903,0.00005784161,0.0002190818,0.0004354783,0.0001243561,0.0004341271,0.0000523371,0.0003766791,0.000004677941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009660385,"about_ca_system_score_gemma":0.0001686657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000053617,"about_ca_topic_score_gemma":0.00003573615,"domain_scores_codex":[0.9986801,0.0001091397,0.0003466386,0.00009662432,0.0005141353,0.0002533762],"domain_scores_gemma":[0.9983433,0.0002210253,0.00004368461,0.0002878911,0.0009868314,0.0001172698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007934852,0.00006011144,0.00003374338,0.00002130131,0.0001191789,7.990786e-8,0.00395421,0.9763308,0.0105663,0.0002394144,0.008007128,0.0006597593],"study_design_scores_gemma":[0.0004334099,0.0001603557,0.0005961149,0.00008465828,0.00001814084,0.00000827287,0.002221691,0.9868993,0.008219605,0.0005538217,0.0007145235,0.00009016207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7402237,0.0008906375,0.2320794,0.02371588,0.0007642235,0.001661652,0.00002130488,0.00003864594,0.000604582],"genre_scores_gemma":[0.6579481,0.0001208832,0.3408345,0.0001033512,0.0004082991,0.00005484851,0.000001284181,0.00002896203,0.0004997101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1087551,"threshold_uncertainty_score":0.5425968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}