{"meta":{"query_hash":"c718cd23bb27","filters":{"venue":"Journal of the Operations Research Society of China"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"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/c718cd23bb27","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+the+Operations+Research+Society+of+China"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04455253395858549,"score_gpt":0.32998570413484907,"score_spread":0.2854331701762636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974465585","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.09369745,0.00009638227,0.9035946,0.002101382,0.000268967,0.00017260667,0.000002839063,0.000007513649,0.000058230875],"genre_scores_gemma":[0.81041414,0.00006591583,0.1892726,0.00003344258,0.00009031015,0.000002046983,0.0000014975068,0.000004928063,0.00011515156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997917,0.00049171277,0.0004751686,0.00011990319,0.00084265147,0.00015355047],"domain_scores_gemma":[0.9979355,0.00019928218,0.0001924373,0.00041608675,0.0012060939,0.000050651895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027503688,0.00007620756,0.00018167819,0.00011770136,0.00039677444,0.00011233575,0.0009043477,0.000060847906,0.000014772696],"category_scores_gemma":[0.0006436159,0.000053769396,0.00025280865,0.00074855215,0.00020805186,0.0005711424,0.0002083358,0.00035421707,0.000001090196],"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.00007459479,0.00127334,0.00033930189,0.0003261438,0.00024579882,9.312973e-7,0.012273117,0.7216881,0.12275586,0.05676357,0.0035907673,0.0806685],"study_design_scores_gemma":[0.0004124977,0.00022329896,0.0026168684,0.00006604266,0.000007975736,0.00001254517,0.00011002531,0.98378855,0.006455188,0.0058288896,0.0004268768,0.00005124569],"about_ca_topic_score_codex":0.000040048875,"about_ca_topic_score_gemma":0.000008665244,"teacher_disagreement_score":0.71671665,"about_ca_system_score_codex":0.000051187002,"about_ca_system_score_gemma":0.00012784192,"threshold_uncertainty_score":0.30517083},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025326774736207733,"score_gpt":0.334522220282114,"score_spread":0.3091954455459062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983854422","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.7402237,0.00089063746,0.2320794,0.023715876,0.00076422346,0.0016616518,0.000021304875,0.00003864594,0.00060458196],"genre_scores_gemma":[0.65794814,0.00012088319,0.34083453,0.00010335119,0.00040829906,0.000054848515,0.0000012841808,0.000028962027,0.00049971015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986801,0.00010913974,0.00034663858,0.00009662432,0.0005141353,0.00025337617],"domain_scores_gemma":[0.9983433,0.0002210253,0.00004368461,0.00028789107,0.0009868314,0.00011726981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016061013,0.00010189948,0.00015631036,0.00006444073,0.000705469,0.00032144334,0.0005863959,0.000054608467,0.0000604157],"category_scores_gemma":[0.00021849034,0.000057841607,0.00021908179,0.00043547832,0.00012435607,0.0004341271,0.0000523371,0.0003766791,0.0000046779405],"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.000007934852,0.000060111437,0.000033743385,0.000021301312,0.000119178934,7.9907856e-8,0.0039542103,0.9763308,0.010566301,0.00023941441,0.008007128,0.0006597593],"study_design_scores_gemma":[0.0004334099,0.00016035575,0.0005961149,0.00008465828,0.000018140836,0.00000827287,0.0022216914,0.98689926,0.008219605,0.00055382174,0.00071452354,0.00009016207],"about_ca_topic_score_codex":0.000053616997,"about_ca_topic_score_gemma":0.000035736146,"teacher_disagreement_score":0.10875512,"about_ca_system_score_codex":0.00009660385,"about_ca_system_score_gemma":0.00016866575,"threshold_uncertainty_score":0.5425968},"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,"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":"Combinatorics; Steiner tree problem; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Computer science","score_opus":0.09638973414503361,"score_gpt":0.38406296238854476,"score_spread":0.28767322824351116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611727281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032443274,0.0005098702,0.9074828,0.057083715,0.00066349545,0.0013642246,0.000019750314,0.000014630311,0.00041824186],"genre_scores_gemma":[0.11291149,0.00025987023,0.8827364,0.00013202462,0.0006948293,0.000056170433,6.7301625e-7,0.000015355332,0.0031931961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777746,0.00023950203,0.00046393974,0.00017206861,0.001006557,0.00034045542],"domain_scores_gemma":[0.99710983,0.00044637884,0.0002993405,0.0008962786,0.0011733792,0.00007480317],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004843677,0.00011288651,0.00022809561,0.00006257513,0.005068144,0.0010456139,0.0031867456,0.00006037326,0.000008817118],"category_scores_gemma":[0.0005517695,0.000059353653,0.0005733344,0.0003591427,0.000502449,0.00076067896,0.0008923236,0.00067802734,6.2261637e-7],"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.00014809871,0.0017514906,0.0013715568,0.0003479659,0.002430004,0.000010549666,0.045330085,0.076034404,0.020688547,0.1699912,0.18188679,0.5000093],"study_design_scores_gemma":[0.0013199962,0.00028419858,0.0045926906,0.000107177366,0.000020772255,0.00006201323,0.00024342205,0.96819353,0.002059927,0.016492153,0.0065175965,0.000106550135],"about_ca_topic_score_codex":0.00018221774,"about_ca_topic_score_gemma":0.000083474544,"teacher_disagreement_score":0.8921591,"about_ca_system_score_codex":0.00008252394,"about_ca_system_score_gemma":0.0006252789,"threshold_uncertainty_score":0.9999914},"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,"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; Matroid; Intersection (aeronautics); Rank (graph theory); Computer science; Function (biology); Combinatorics; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.05601398994931464,"score_gpt":0.33576066152842743,"score_spread":0.2797466715791128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951607788","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.8136194,0.00054921134,0.09077699,0.091619074,0.0012506122,0.00078455993,0.000011826626,0.000020640495,0.0013677359],"genre_scores_gemma":[0.98404557,0.00014191121,0.013666488,0.00023504655,0.0001800302,0.000005600507,4.7493313e-7,0.000006388554,0.0017185038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974127,0.0006149165,0.00034506206,0.00014800375,0.0012380052,0.00024132172],"domain_scores_gemma":[0.99777603,0.00047888418,0.0001030963,0.000875835,0.00070152787,0.00006462298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040797177,0.00008629386,0.00016671793,0.00007956617,0.0011180693,0.0002999102,0.0023413822,0.000055754444,0.00004711562],"category_scores_gemma":[0.00039916908,0.0000458439,0.00047763548,0.0009608922,0.0002624387,0.000587641,0.000609844,0.0012238675,0.000012035529],"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.00021573101,0.002876911,0.008405145,0.00033411387,0.0011366357,0.0000065447216,0.051134553,0.35102662,0.07505989,0.30738497,0.18307397,0.019344926],"study_design_scores_gemma":[0.00110271,0.0005901078,0.07554003,0.00025600448,0.00001635667,0.000038535145,0.00074307027,0.88509053,0.0038585572,0.023860307,0.008739137,0.00016467983],"about_ca_topic_score_codex":0.00014643467,"about_ca_topic_score_gemma":0.0000559292,"teacher_disagreement_score":0.5340639,"about_ca_system_score_codex":0.000086517226,"about_ca_system_score_gemma":0.0003765657,"threshold_uncertainty_score":0.8599398},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03202772653976704,"score_gpt":0.3227148121945191,"score_spread":0.29068708565475204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961884489","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.9751024,0.0013349223,0.020958293,0.0020651403,0.00006767062,0.00017309503,0.000007881519,0.00002466604,0.00026589129],"genre_scores_gemma":[0.8189848,0.00035800267,0.18001541,0.00001690743,0.00010070206,0.0000017186093,0.000002552695,0.000019175299,0.0005007306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.000060768118,0.00026903622,0.00007697271,0.00046919216,0.00015710549],"domain_scores_gemma":[0.99907815,0.000047865353,0.000056948276,0.00012657765,0.00062670826,0.00006375982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067330623,0.00008211916,0.00014811725,0.00009868525,0.00037998814,0.0001493915,0.0001993248,0.000056508285,0.000021126036],"category_scores_gemma":[0.000076903634,0.00005223415,0.00006230921,0.0007275138,0.000118815144,0.00039577018,0.00003990643,0.0006500147,9.960132e-7],"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.0000067282463,0.00004201937,0.0009957284,0.00012189285,0.000041982046,2.619964e-7,0.0020495586,0.9932585,0.0013787656,0.000022906508,0.00016438996,0.0019173141],"study_design_scores_gemma":[0.00041269275,0.00007610949,0.00315847,0.00042812366,0.000017169088,0.00004262972,0.0030906755,0.99168915,0.0008274753,0.000038898022,0.00014921355,0.00006937918],"about_ca_topic_score_codex":0.000011552262,"about_ca_topic_score_gemma":0.000006404933,"teacher_disagreement_score":0.15905711,"about_ca_system_score_codex":0.00004500405,"about_ca_system_score_gemma":0.00029185074,"threshold_uncertainty_score":0.29226},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06820800589132216,"score_gpt":0.3611336697797232,"score_spread":0.2929256638884011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963480423","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.08253057,0.00024936456,0.8979488,0.017195644,0.00088924915,0.00071383535,0.0000102486,0.0000114700315,0.00045081944],"genre_scores_gemma":[0.5361577,0.00012824805,0.46164823,0.00013808615,0.00022660891,0.0000171519,0.0000020261903,0.000010827723,0.0016710933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983616,0.00016045093,0.0003495664,0.00012472527,0.0008058182,0.00019784301],"domain_scores_gemma":[0.9982214,0.0002124293,0.00010470798,0.00042602967,0.000983654,0.000051796684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025961983,0.000070896516,0.00017489807,0.00008613673,0.00042474564,0.00017621784,0.001482557,0.00005020203,0.00001699332],"category_scores_gemma":[0.0001769186,0.000046156838,0.0003778102,0.00067965424,0.00013546368,0.000682252,0.00026731053,0.00038027967,0.0000035726985],"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.00009186992,0.0017195159,0.00078907923,0.0008311611,0.0007706267,0.0000014486826,0.028507335,0.08806143,0.06800262,0.5606829,0.0993642,0.15117785],"study_design_scores_gemma":[0.00067131297,0.00023164366,0.0027009498,0.000098482815,0.000005221534,0.00002083143,0.00026990936,0.958759,0.004465964,0.029459385,0.003242755,0.000074543386],"about_ca_topic_score_codex":0.000021844395,"about_ca_topic_score_gemma":0.00000298664,"teacher_disagreement_score":0.87069756,"about_ca_system_score_codex":0.00006223299,"about_ca_system_score_gemma":0.00029926162,"threshold_uncertainty_score":0.3266843},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operations research; Mathematical economics; Combinatorics; Mathematics","score_opus":0.021705015648237767,"score_gpt":0.31200613692723445,"score_spread":0.29030112127899665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971295615","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.8317366,0.00054973376,0.034435295,0.093849234,0.01588445,0.0019643095,0.000012666496,0.000057289384,0.021510381],"genre_scores_gemma":[0.89708483,0.00039007122,0.09515947,0.0003408602,0.0013282263,0.0000045074307,0.0000014321283,0.000018682513,0.005671934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794877,0.0002886237,0.0003358688,0.0001238787,0.0011325807,0.00017029779],"domain_scores_gemma":[0.9985203,0.00010136287,0.00010724536,0.00041645265,0.00078866637,0.00006595765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021331937,0.00006982561,0.00015241736,0.00008440321,0.00035191647,0.0001649783,0.0009744664,0.00006504773,0.00015244099],"category_scores_gemma":[0.00017307587,0.00004373652,0.00021522096,0.00061817945,0.00010498794,0.00039578913,0.00020789774,0.00053403055,0.000023289474],"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.000025563755,0.0002895418,0.000121656376,0.000020208085,0.000051395167,3.9515007e-7,0.0026846328,0.8425207,0.0035727439,0.04692553,0.102878384,0.00090921065],"study_design_scores_gemma":[0.0033621078,0.0018215994,0.0016268366,0.0004291388,0.00001525976,0.000027930233,0.00037844287,0.92266154,0.017925922,0.030570174,0.020944586,0.00023647021],"about_ca_topic_score_codex":0.00001804853,"about_ca_topic_score_gemma":8.691143e-7,"teacher_disagreement_score":0.09350837,"about_ca_system_score_codex":0.000060997023,"about_ca_system_score_gemma":0.0003009527,"threshold_uncertainty_score":0.27066925},"labels":[],"label_agreement":null},{"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,"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":"Supply chain; Dual (grammatical number); Microeconomics; Risk aversion (psychology); Business; Channel (broadcasting); Closed loop; Economics; Marketing; Expected utility hypothesis; Computer science; Financial economics","score_opus":0.07361492902336443,"score_gpt":0.31272345056323864,"score_spread":0.23910852153987422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097704957","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.9585678,0.00027429522,0.001980835,0.037630368,0.00018889294,0.00044556858,0.0000051473635,0.000008799011,0.00089828525],"genre_scores_gemma":[0.99640083,0.0014064481,0.00031057344,0.0010183294,0.00051425124,0.000004869563,0.0000032086052,0.000016011716,0.00032549686],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808496,0.00014433284,0.00047978412,0.00017689292,0.0008594158,0.00025460977],"domain_scores_gemma":[0.999073,0.0001784536,0.00019522128,0.00019329521,0.00031792445,0.000042078264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025437155,0.00012128703,0.00024307774,0.00017381851,0.0005824272,0.00024357816,0.00034657377,0.00006595193,0.00013149022],"category_scores_gemma":[0.00079634966,0.000084469226,0.00021185861,0.00085935334,0.00020505671,0.0008688723,0.0005506329,0.000677691,0.000008428233],"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.00069481146,0.0013746264,0.06813743,0.0011312558,0.0009223316,0.00006403639,0.03660428,0.39804497,0.014637282,0.02703186,0.43808803,0.013269086],"study_design_scores_gemma":[0.005103464,0.0002482982,0.12519883,0.00088590337,0.00013917423,0.00001148767,0.04458514,0.7794987,0.0009193988,0.007407495,0.035549775,0.0004523486],"about_ca_topic_score_codex":0.00050552015,"about_ca_topic_score_gemma":0.000102075006,"teacher_disagreement_score":0.40253827,"about_ca_system_score_codex":0.00009561347,"about_ca_system_score_gemma":0.00008972885,"threshold_uncertainty_score":0.44796178},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05689808837259584,"score_gpt":0.33087566564746945,"score_spread":0.2739775772748736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114113748","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.6580198,0.00029098138,0.28725517,0.05020531,0.00012619824,0.0015628069,0.000039014634,0.00003143648,0.002469301],"genre_scores_gemma":[0.99045795,0.000016350796,0.006845392,0.0003355125,0.0002765736,0.000074093754,0.0000051669044,0.00002275019,0.0019661963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982588,0.00012019611,0.00040231168,0.00012645248,0.0008534862,0.00023874188],"domain_scores_gemma":[0.998295,0.00017319371,0.00026397986,0.0003335986,0.00091918657,0.000015018837],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003748188,0.000101338934,0.00020201576,0.00014307188,0.002131279,0.00024390944,0.0007859145,0.000024684206,0.00007384359],"category_scores_gemma":[0.00032272754,0.00005897896,0.00034832564,0.0011305709,0.0002384151,0.00095495133,0.00028442728,0.00070946396,8.945373e-7],"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.00005072606,0.00010832791,0.00004768768,0.000041964988,0.00012290984,3.6804576e-7,0.00069259986,0.9587192,0.0016391377,0.03423122,0.0040013776,0.00034450105],"study_design_scores_gemma":[0.00039069977,0.000056583736,0.00010807027,0.000034979472,0.000077859084,0.000008594776,0.0035418149,0.95781344,0.000107315165,0.034770396,0.0030115987,0.00007862483],"about_ca_topic_score_codex":0.00008649686,"about_ca_topic_score_gemma":0.00007172715,"teacher_disagreement_score":0.3324382,"about_ca_system_score_codex":0.00012139071,"about_ca_system_score_gemma":0.00029366632,"threshold_uncertainty_score":0.9991678},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.136753856636964,"score_gpt":0.4532613657135169,"score_spread":0.3165075090765529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224005576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019776711,0.000057904897,0.9642692,0.014036638,0.00009040504,0.0009999595,0.000029515013,0.000017541277,0.0007220815],"genre_scores_gemma":[0.06104677,0.000028524295,0.9322354,0.00013437682,0.000095344025,0.000028050235,0.000016684578,0.000044679906,0.006370124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947155,0.0018193696,0.00067300425,0.0001945221,0.0022909835,0.0003065936],"domain_scores_gemma":[0.99650127,0.0005759475,0.00032300875,0.0005814978,0.001922214,0.0000960861],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006019854,0.00014591469,0.00032041618,0.0002540047,0.0014132519,0.00009075679,0.0007275079,0.00006341438,0.0009672505],"category_scores_gemma":[0.0011901841,0.00009534792,0.00022240514,0.002203677,0.00027956825,0.00038396704,0.00023374219,0.0013993977,9.882953e-7],"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.00023878868,0.0003992041,0.000037554546,0.00007506357,0.00010088982,0.0000010048857,0.0024298814,0.9714343,0.0034816267,0.0130997095,0.0071727103,0.001529269],"study_design_scores_gemma":[0.0018467888,0.0007709494,0.00045865696,0.00009185237,0.000022698134,0.00003468066,0.0008693464,0.9380937,0.0050180736,0.05097611,0.0016895188,0.00012761341],"about_ca_topic_score_codex":0.00003601705,"about_ca_topic_score_gemma":0.00003428189,"teacher_disagreement_score":0.041270062,"about_ca_system_score_codex":0.0005837352,"about_ca_system_score_gemma":0.0015341574,"threshold_uncertainty_score":0.999946},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08786346303967044,"score_gpt":0.35909603442660903,"score_spread":0.27123257138693857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360985546","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.30236223,0.00029659944,0.5724658,0.12185505,0.0014591904,0.0006205099,0.000019050127,0.000036266567,0.00088530174],"genre_scores_gemma":[0.96499467,0.00030074336,0.031623036,0.00021017021,0.0003454291,0.000013830811,0.0000013411251,0.000012056408,0.002498734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767303,0.00043812988,0.00044476122,0.00012646843,0.0011013186,0.00021627337],"domain_scores_gemma":[0.99796206,0.0004855003,0.00013072307,0.00064240646,0.0007253738,0.000053949112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039371396,0.00008262308,0.00017712265,0.00014429005,0.0009874544,0.00015863038,0.0016332347,0.00004577422,0.00002167663],"category_scores_gemma":[0.0004312215,0.000046062098,0.00041034576,0.001859546,0.00037678352,0.00040396338,0.0004613169,0.0008438187,0.000009218116],"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.00006321929,0.0009025265,0.00029101758,0.00013899729,0.0007595004,0.000006121875,0.035759367,0.5487858,0.03032339,0.19074908,0.17664064,0.015580332],"study_design_scores_gemma":[0.00040556092,0.00030209732,0.007380389,0.00017204361,0.0000164831,0.000023712524,0.0016870815,0.96147305,0.0061237654,0.018413471,0.0039146,0.000087771456],"about_ca_topic_score_codex":0.00006174682,"about_ca_topic_score_gemma":0.000012534603,"teacher_disagreement_score":0.6626324,"about_ca_system_score_codex":0.00005758111,"about_ca_system_score_gemma":0.00027642664,"threshold_uncertainty_score":0.7594801},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03511535359564896,"score_gpt":0.3654889654685687,"score_spread":0.3303736118729197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411163553","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.9890732,0.000056641038,0.0010386573,0.008767994,0.000024997606,0.00018971942,0.0000013673547,0.000004686819,0.0008427111],"genre_scores_gemma":[0.9966124,0.000038329486,0.0023752986,0.00039507242,0.00017254827,0.0000101560845,0.0000033265067,0.000008086525,0.00038476317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901986,0.00010859229,0.0002824385,0.000106524676,0.0003284263,0.00015417741],"domain_scores_gemma":[0.99872684,0.000059398422,0.00011554019,0.0002017046,0.00088329427,0.0000132175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017753615,0.00007916649,0.00016265469,0.0002926295,0.00038572738,0.0002407626,0.0003454557,0.000045044173,0.000027527463],"category_scores_gemma":[0.00013663752,0.00005136552,0.000057990022,0.0021333566,0.00013173337,0.0013596449,0.000113837516,0.00041461916,0.0000014541803],"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.00033724157,0.0009250031,0.031557336,0.00053401315,0.00027520795,0.0000035135986,0.001969195,0.5610871,0.056526974,0.3447192,0.00086514046,0.0012000753],"study_design_scores_gemma":[0.004379996,0.00021798722,0.17790148,0.0011048259,0.0005509721,0.000023903413,0.018710598,0.57100385,0.003086296,0.21949734,0.002973328,0.0005494229],"about_ca_topic_score_codex":0.001150933,"about_ca_topic_score_gemma":0.0006260805,"teacher_disagreement_score":0.14634414,"about_ca_system_score_codex":0.00008106564,"about_ca_system_score_gemma":0.00029710142,"threshold_uncertainty_score":0.29667422},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03066533879838002,"score_gpt":0.35965811507216733,"score_spread":0.3289927762737873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413122834","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.98704195,0.0001563456,0.0025547447,0.006903153,0.00015365842,0.00022772679,0.0000044541584,0.000005299478,0.002952657],"genre_scores_gemma":[0.98120475,0.00010180356,0.01688944,0.00011524264,0.00006700463,0.0000025406728,2.4027372e-7,0.000007679848,0.0016113142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839586,0.0002605995,0.00036138453,0.00008535067,0.0007071979,0.0001896347],"domain_scores_gemma":[0.99830836,0.0003058983,0.00009404791,0.00040027863,0.0008421729,0.000049263283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021458233,0.00009236296,0.00023336365,0.0001094028,0.00085646263,0.00006027162,0.00056832115,0.000078104,0.00002998321],"category_scores_gemma":[0.00034594725,0.000045363562,0.0003515255,0.0006152191,0.0004628188,0.00016209767,0.0001577305,0.0007807134,3.0467675e-7],"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.00030149712,0.00053447596,0.00517374,0.00039905313,0.0014839247,0.0000047363023,0.021457704,0.0013789787,0.0070755305,0.82018226,0.14090003,0.0011080845],"study_design_scores_gemma":[0.0018808382,0.0005569431,0.029310532,0.00072525395,0.00018413695,0.0001317005,0.0067071016,0.0029612377,0.012591659,0.9420567,0.0026899413,0.00020394403],"about_ca_topic_score_codex":0.000026781974,"about_ca_topic_score_gemma":0.000048664268,"teacher_disagreement_score":0.13821009,"about_ca_system_score_codex":0.000063231804,"about_ca_system_score_gemma":0.0003012623,"threshold_uncertainty_score":0.65873045},"labels":[],"label_agreement":null}]}