{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005082252,0.0008850528,0.002785802,0.0009101844,0.00146622,0.006111851,0.002391898,0.003827535,0.007514574],"category_scores_gemma":[0.01469645,0.001654057,0.001342506,0.0009797888,0.003422599,0.005497285,0.002319579,0.002703422,0.0004843391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003341316,"about_ca_system_score_gemma":0.002386646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009268079,"about_ca_topic_score_gemma":0.00535925,"domain_scores_codex":[0.9967799,0.001137316,0.0001091668,0.0007341775,0.0002828763,0.000956575],"domain_scores_gemma":[0.9845464,0.01119365,0.001302299,0.0004842868,0.00138323,0.001090032],"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.002370457,0.0006030677,0.004933341,0.0002172207,0.0002132431,0.001807122,0.0006203693,0.8526412,0.004115564,0.1169788,0.002763957,0.0127357],"study_design_scores_gemma":[0.00009284831,0.0001379377,0.0008085734,0.00001174064,0.00005819111,0.00009159226,0.0001701029,0.9598679,0.0003751336,0.03812201,0.0001994518,0.00006459493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8032419,0.0004804193,0.1774818,0.002667992,0.000203863,0.0001267249,0.0002723275,0.0001830901,0.0153419],"genre_scores_gemma":[0.9947397,0.00007399725,0.002119513,0.00004243549,0.00002426615,0.00001408867,0.00002073677,0.00001183776,0.00295324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009268079,"threshold_uncertainty_score":0.02687782,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035082,0.002367673,0.003760312,0.001752436,0.0007745189,0.002252969,0.003502072,0.002238146,0.004428817],"category_scores_gemma":[0.00899506,0.001597913,0.002198837,0.003556737,0.001004134,0.002734947,0.002892989,0.002467022,0.0006779789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00172336,"about_ca_system_score_gemma":0.002153522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004691554,"about_ca_topic_score_gemma":0.004723688,"domain_scores_codex":[0.9975236,0.001107157,0.00008901574,0.0004483552,0.0005195866,0.0003122433],"domain_scores_gemma":[0.9961248,0.002727646,0.0002556934,0.0002890353,0.0004122534,0.0001905449],"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.0002359778,0.0002573626,0.000907464,0.0003609243,0.0002159173,0.0001550496,0.000101009,0.9034742,0.001238958,0.02302427,0.005875125,0.06415375],"study_design_scores_gemma":[0.00001042842,0.00003022137,0.00006181426,0.000007198731,0.00001488747,0.00002352415,0.000009027759,0.99473,0.0001360114,0.004740237,0.0002324243,0.00000419865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02466994,0.0009276363,0.9687817,0.0003094506,0.00008565953,0.00009292766,0.0001993951,0.0002858352,0.004647374],"genre_scores_gemma":[0.6123638,0.000758408,0.3783029,0.000275009,0.0001993135,0.0005247626,0.0008137975,0.0002498426,0.006512308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004691554,"threshold_uncertainty_score":0.01605123,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210999,0.001393327,0.002410838,0.001163513,0.00129707,0.002248883,0.002945926,0.002043842,0.006892686],"category_scores_gemma":[0.00370143,0.0008790855,0.001109088,0.002298038,0.0009084659,0.002454385,0.002717204,0.002537575,0.0009025868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727508,"about_ca_system_score_gemma":0.003626312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002785864,"about_ca_topic_score_gemma":0.004201697,"domain_scores_codex":[0.9989906,0.0003984447,0.00004244928,0.0001885258,0.0001823957,0.0001976347],"domain_scores_gemma":[0.9984977,0.0007601263,0.0001131862,0.0001630501,0.0002299414,0.0002359452],"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.0008892847,0.001034796,0.001531728,0.0006870078,0.000153159,0.0002503326,0.0002159352,0.6451356,0.002921715,0.08767124,0.02633677,0.2331724],"study_design_scores_gemma":[0.0001538608,0.00008336295,0.0002071615,0.00002750379,0.00003158644,0.0001201678,0.00006059638,0.952887,0.0004544053,0.04384655,0.002111931,0.0000158569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05727269,0.0007822908,0.9252349,0.001346392,0.000310533,0.0004139644,0.0005439483,0.0006501225,0.01344518],"genre_scores_gemma":[0.3104786,0.0004521006,0.6801086,0.0003496822,0.0002181114,0.0004568302,0.0007538233,0.0002481769,0.00693407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006892686,"threshold_uncertainty_score":0.0230583,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844036,0.001386183,0.00145287,0.0009773071,0.0005573005,0.001538407,0.002171176,0.001999557,0.005839887],"category_scores_gemma":[0.007392622,0.0005081645,0.0009702931,0.001185486,0.001397054,0.002190336,0.003109821,0.004725913,0.001170647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000830062,"about_ca_system_score_gemma":0.002110008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003489587,"about_ca_topic_score_gemma":0.004856507,"domain_scores_codex":[0.9987782,0.0004026922,0.00005582774,0.0001744333,0.0004830749,0.0001057678],"domain_scores_gemma":[0.9974846,0.001301981,0.0001396941,0.0003496903,0.0005759455,0.0001479689],"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.0003032737,0.0002801263,0.0006194878,0.0004683044,0.00008587864,0.0002661046,0.000212863,0.4156277,0.01055583,0.4199361,0.0216705,0.1299737],"study_design_scores_gemma":[0.000009919654,0.00002198605,0.00003417254,0.000005266375,0.00000507943,0.00002108051,0.000005101635,0.984457,0.0003744255,0.01399865,0.001061044,0.000006315595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002734596,0.0001635651,0.9930512,0.0002315453,0.00008146264,0.00003318573,0.00004412407,0.00009504929,0.00356527],"genre_scores_gemma":[0.1977462,0.0007473862,0.7813916,0.0005899464,0.0005913919,0.0005153972,0.0005095361,0.0006672243,0.01724135],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005839887,"threshold_uncertainty_score":0.01953638,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004388731,0.002066853,0.004699028,0.001095899,0.001289214,0.00290997,0.004493723,0.002328999,0.006121229],"category_scores_gemma":[0.01346372,0.001939502,0.001378716,0.003355841,0.001235546,0.005217318,0.00229352,0.003168351,0.0009819692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170412,"about_ca_system_score_gemma":0.003747414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003905396,"about_ca_topic_score_gemma":0.004021849,"domain_scores_codex":[0.9962998,0.001233874,0.0002405071,0.0007324468,0.0006955621,0.0007978686],"domain_scores_gemma":[0.9812899,0.01229478,0.001618709,0.002709,0.001208023,0.0008794568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001598275,0.0007202484,0.000749485,0.0003473887,0.0001263477,0.000527799,0.000088713,0.9078804,0.00431268,0.03136224,0.005047415,0.04723894],"study_design_scores_gemma":[0.00007086675,0.00008839255,0.0001407922,0.000006321678,0.00002481619,0.00004834887,0.00001193935,0.9873222,0.0007167172,0.0110838,0.0004749481,0.00001099331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1224516,0.000822242,0.8626944,0.0008690928,0.0005929567,0.0002801967,0.0007034941,0.001236637,0.01034935],"genre_scores_gemma":[0.8663548,0.0004150253,0.122861,0.0002862751,0.0006356467,0.0003521814,0.0005633605,0.0003304276,0.008201141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006121229,"threshold_uncertainty_score":0.02321011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004227438,0.001897676,0.003338193,0.002294426,0.001599304,0.004199643,0.005756297,0.004450171,0.007189845],"category_scores_gemma":[0.02190524,0.001315211,0.002178321,0.002234329,0.003035481,0.005468435,0.002754717,0.004455121,0.0008201919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006168314,"about_ca_system_score_gemma":0.005750822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04122661,"about_ca_topic_score_gemma":0.02018491,"domain_scores_codex":[0.9983774,0.0006669405,0.00005140617,0.0001713511,0.0003076377,0.0004251694],"domain_scores_gemma":[0.9879782,0.009120266,0.0006311474,0.0003393227,0.001157586,0.0007734388],"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.00007113822,0.0000689738,0.0004245859,0.00007829707,0.0000315159,0.0001033792,0.0001321811,0.8450196,0.0002332319,0.1493376,0.002276894,0.002222774],"study_design_scores_gemma":[0.000008554567,0.000005574378,0.00003929127,0.000007520513,0.000007228932,0.000007408538,0.00002039906,0.9849306,0.00001416309,0.01478288,0.0001705951,0.000005746317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0862587,0.003066076,0.8753328,0.003769613,0.0005476548,0.000188292,0.0006177399,0.0003713243,0.02984779],"genre_scores_gemma":[0.9013972,0.002295488,0.06517903,0.0007572409,0.0004504287,0.0003145279,0.0006808038,0.0002730782,0.02865208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04122661,"threshold_uncertainty_score":0.08197325,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037409,0.0004563312,0.001192137,0.00252549,0.002039545,0.00248765,0.001765287,0.00140978,0.009629458],"category_scores_gemma":[0.008074119,0.0006169563,0.0007467485,0.001706431,0.001837714,0.004423312,0.00220147,0.001797586,0.0008807434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173222,"about_ca_system_score_gemma":0.0009983544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002591371,"about_ca_topic_score_gemma":0.001830204,"domain_scores_codex":[0.9991386,0.0003185328,0.00003429809,0.0001673743,0.0001653999,0.0001757594],"domain_scores_gemma":[0.9941874,0.002917205,0.0004718004,0.0006829779,0.0008402526,0.0009003915],"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.0001004678,0.00004416065,0.0006564831,0.00005543997,0.00001787147,0.0001106758,0.0001558109,0.008392616,0.001405048,0.9799396,0.002946293,0.006175716],"study_design_scores_gemma":[0.00002770684,0.00004925655,0.001013517,0.000030709,0.00002918142,0.0003299279,0.0001801389,0.1022609,0.001021472,0.8913667,0.003660911,0.00002961599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.709463,0.001622864,0.1941763,0.003651086,0.0002498026,0.00009964998,0.000946542,0.0008958616,0.08889491],"genre_scores_gemma":[0.9611756,0.0006644236,0.01642914,0.0005010872,0.000217934,0.0001397779,0.0003261462,0.0001696008,0.02037633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009629458,"threshold_uncertainty_score":0.03221375,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004560292,0.002047797,0.002991084,0.001882574,0.0007852329,0.004087437,0.003193029,0.001796403,0.006287185],"category_scores_gemma":[0.02219004,0.000902555,0.0009361066,0.002347295,0.001527669,0.005494736,0.002279223,0.002221879,0.0009783198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002866485,"about_ca_system_score_gemma":0.001664587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000939845,"about_ca_topic_score_gemma":0.000893406,"domain_scores_codex":[0.9960108,0.002171891,0.00009886573,0.0005120868,0.0006366451,0.0005697336],"domain_scores_gemma":[0.9899682,0.007390787,0.0006505791,0.0007004727,0.0005708832,0.0007191477],"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.002005577,0.0006433683,0.002113424,0.001111272,0.0002000961,0.0003156703,0.0002776384,0.316288,0.0114189,0.5133827,0.01810399,0.1341394],"study_design_scores_gemma":[0.0001229793,0.0003169695,0.0003691323,0.00006641039,0.00004813003,0.0002984661,0.000120175,0.7770948,0.002290206,0.2167675,0.002465627,0.00003942814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3476458,0.003335974,0.5833511,0.002992364,0.0002434814,0.0003551151,0.001323666,0.001682356,0.05907012],"genre_scores_gemma":[0.8550732,0.001398191,0.1342074,0.0004572086,0.000241294,0.0003259174,0.0005341012,0.000445214,0.007317591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006287185,"threshold_uncertainty_score":0.02411741,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003512166,0.0005984266,0.001296225,0.00101696,0.001565984,0.003078384,0.0021279,0.001963885,0.003165571],"category_scores_gemma":[0.008855655,0.0009232418,0.000656389,0.001372213,0.001495471,0.002000319,0.00111577,0.001477613,0.0003280418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003857749,"about_ca_system_score_gemma":0.003568594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02690811,"about_ca_topic_score_gemma":0.0215452,"domain_scores_codex":[0.9981464,0.000507904,0.00006344519,0.0002855149,0.0002301483,0.0007666585],"domain_scores_gemma":[0.9868364,0.007882025,0.001466856,0.0002640175,0.00141723,0.002133447],"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.002398149,0.001033287,0.04843465,0.0001225408,0.0001986474,0.00247939,0.001020714,0.8510785,0.008328563,0.07159021,0.004223989,0.009091303],"study_design_scores_gemma":[0.00002948692,0.0001043257,0.001830151,0.00000426693,0.00002269306,0.00006146204,0.0002048524,0.9952302,0.0001768948,0.002245741,0.00006568628,0.0000243353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9690141,0.0001229821,0.02738666,0.0007916396,0.00005259823,0.00003764515,0.00009876474,0.00008946662,0.002406135],"genre_scores_gemma":[0.9978509,0.00003637492,0.0008526588,0.00004297022,0.00001297681,0.00000712317,0.00003083607,0.000007280265,0.001159011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02690811,"threshold_uncertainty_score":0.05350298,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002925,0.001127964,0.001452535,0.00162923,0.002275772,0.003048565,0.002154656,0.001718279,0.009409539],"category_scores_gemma":[0.01670319,0.0004629644,0.001940911,0.002469387,0.004913004,0.01364194,0.004778917,0.00797721,0.001357074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358884,"about_ca_system_score_gemma":0.001391791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720144,"about_ca_topic_score_gemma":0.001273304,"domain_scores_codex":[0.997631,0.0007007468,0.0001076871,0.0006713505,0.0005480066,0.0003412435],"domain_scores_gemma":[0.9915378,0.00462064,0.0003812791,0.002288482,0.0007579091,0.0004138144],"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.00009348599,0.00004913397,0.0003819714,0.0001491727,0.00002405156,0.0001553759,0.0002534867,0.002468501,0.001805686,0.956714,0.009693409,0.02821174],"study_design_scores_gemma":[0.00001194149,0.00005552941,0.0003113573,0.00003208645,0.00003396653,0.00023178,0.00007516397,0.008692471,0.001316406,0.977776,0.01143467,0.00002865226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1277004,0.006933175,0.5824664,0.01604211,0.00396238,0.0002101256,0.001366068,0.0008648618,0.2604544],"genre_scores_gemma":[0.8048483,0.007310744,0.1280948,0.004194219,0.004656855,0.0002134543,0.001044968,0.0008463982,0.04879028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009409539,"threshold_uncertainty_score":0.03147805,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002208693,0.002464227,0.002238707,0.004497645,0.001798171,0.004965841,0.002078903,0.002863885,0.1256947],"category_scores_gemma":[0.008723878,0.0007031765,0.001575133,0.00401346,0.0008032068,0.003976827,0.001456489,0.006305061,0.05584235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002761338,"about_ca_system_score_gemma":0.002730485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001880749,"about_ca_topic_score_gemma":0.003193269,"domain_scores_codex":[0.9987504,0.0001789076,0.0001245618,0.0002737104,0.0005684543,0.000103816],"domain_scores_gemma":[0.9926772,0.001631844,0.0003460167,0.0005884792,0.003407401,0.001349043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002177189,0.00002874756,0.0000521311,0.0001699157,0.000008379558,0.0000188746,0.000004435782,0.0002612002,0.0001046456,0.001501118,0.9750323,0.02279649],"study_design_scores_gemma":[0.00002752656,0.00007102108,0.001245745,0.0003809474,0.00002715597,0.0001187863,0.00002575304,0.001345551,0.0002385668,0.01109942,0.9853948,0.00002482252],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000729271,0.02982061,0.004915713,0.03930729,0.8590771,0.0001578473,0.002224348,0.000274475,0.06349333],"genre_scores_gemma":[0.006447305,0.0269559,0.004887919,0.01067884,0.7550842,0.0002242219,0.004973041,0.0008776943,0.189871],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.1256947,"threshold_uncertainty_score":0.4204906,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002945163,0.002260085,0.003066936,0.003365096,0.002754142,0.006074242,0.006092588,0.002879926,0.01820201],"category_scores_gemma":[0.01713926,0.001239553,0.003601623,0.006396853,0.0023258,0.01081054,0.0056543,0.006616477,0.002811389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005143045,"about_ca_system_score_gemma":0.004326976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004991183,"about_ca_topic_score_gemma":0.006221277,"domain_scores_codex":[0.9972067,0.0007594755,0.0001285227,0.0007217766,0.0005619768,0.0006215767],"domain_scores_gemma":[0.9917924,0.004418009,0.0004839331,0.00193952,0.0006630238,0.0007031368],"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.001330476,0.0007260527,0.003810978,0.0005327876,0.0003014287,0.0001430421,0.0008155916,0.1901194,0.001968338,0.4704228,0.04982009,0.280009],"study_design_scores_gemma":[0.0001238554,0.00008448977,0.0004596138,0.00006747208,0.0001302703,0.0001126807,0.0002654005,0.5429348,0.001290093,0.447697,0.006807658,0.00002666297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1106127,0.00300733,0.834785,0.006731427,0.000580708,0.0005314012,0.002626842,0.002648627,0.03847593],"genre_scores_gemma":[0.5715739,0.002218866,0.3867393,0.001111243,0.0006723098,0.0007553006,0.005069796,0.001116534,0.03074278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01820201,"threshold_uncertainty_score":0.06089181,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00794565,0.004805326,0.004488975,0.003171925,0.002368079,0.007371082,0.003819518,0.003847133,0.01423841],"category_scores_gemma":[0.03500282,0.001625851,0.00251238,0.004425957,0.002451111,0.00752415,0.005620594,0.00823588,0.00235155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004313971,"about_ca_system_score_gemma":0.004429187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0028193,"about_ca_topic_score_gemma":0.002960707,"domain_scores_codex":[0.9924428,0.002377437,0.0002562857,0.0009116833,0.002257381,0.001754536],"domain_scores_gemma":[0.9782248,0.01652974,0.0008427786,0.001456988,0.0018088,0.001137002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002037019,0.0007919549,0.001120962,0.001527911,0.0003741929,0.0002975714,0.0004653319,0.6196308,0.008024319,0.2261736,0.0377409,0.1018154],"study_design_scores_gemma":[0.0001255094,0.0003426661,0.0006107176,0.0001808165,0.0001084885,0.0002170918,0.0001763384,0.8011438,0.001979864,0.1892519,0.005804653,0.00005811477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05644932,0.00763262,0.8634166,0.006376514,0.001777575,0.000339162,0.001474533,0.001025377,0.06150842],"genre_scores_gemma":[0.6307989,0.005153448,0.3361513,0.003600753,0.002600041,0.001191837,0.00244152,0.001364469,0.01669773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01423841,"threshold_uncertainty_score":0.04763228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}