{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024669943,0.00092763634,0.9687817,0.00030945064,0.00008565953,0.00009292766,0.00019939507,0.00028583524,0.004647374],"genre_scores_gemma":[0.61236376,0.00075840804,0.3783029,0.00027500905,0.00019931348,0.0005247626,0.00081379747,0.00024984256,0.0065123076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975236,0.0011071571,0.00008901574,0.00044835525,0.00051958655,0.00031224333],"domain_scores_gemma":[0.9961248,0.002727646,0.0002556934,0.00028903535,0.00041225343,0.00019054489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030350825,0.0023676734,0.0037603122,0.0017524359,0.0007745189,0.0022529692,0.0035020723,0.0022381458,0.0044288174],"category_scores_gemma":[0.00899506,0.0015979132,0.0021988375,0.0035567365,0.0010041341,0.0027349475,0.002892989,0.0024670218,0.00067797885],"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.0002359778,0.00025736255,0.00090746395,0.00036092428,0.00021591726,0.00015504962,0.000101009005,0.9034742,0.0012389576,0.023024268,0.005875125,0.064153746],"study_design_scores_gemma":[0.000010428422,0.000030221372,0.00006181426,0.0000071987306,0.000014887467,0.000023524153,0.000009027759,0.99473,0.00013601143,0.004740237,0.00023242431,0.00000419865],"about_ca_topic_score_codex":0.004691554,"about_ca_topic_score_gemma":0.004723688,"teacher_disagreement_score":0.004691554,"about_ca_system_score_codex":0.0017233603,"about_ca_system_score_gemma":0.0021535216,"threshold_uncertainty_score":0.016051233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056449316,0.00763262,0.86341655,0.0063765137,0.0017775749,0.000339162,0.0014745331,0.0010253774,0.061508417],"genre_scores_gemma":[0.6307989,0.005153448,0.33615127,0.0036007531,0.002600041,0.0011918365,0.0024415203,0.0013644686,0.016697727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924428,0.0023774372,0.00025628565,0.0009116833,0.0022573806,0.0017545357],"domain_scores_gemma":[0.97822475,0.016529739,0.0008427786,0.0014569882,0.0018088002,0.0011370021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00794565,0.0048053265,0.004488975,0.0031719245,0.0023680788,0.0073710815,0.0038195185,0.0038471334,0.014238412],"category_scores_gemma":[0.035002824,0.0016258507,0.0025123798,0.004425957,0.0024511106,0.00752415,0.0056205937,0.00823588,0.00235155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020370192,0.00079195487,0.0011209617,0.0015279108,0.0003741929,0.00029757136,0.0004653319,0.61963075,0.008024319,0.22617358,0.0377409,0.101815425],"study_design_scores_gemma":[0.00012550935,0.00034266614,0.0006107176,0.00018081654,0.00010848854,0.00021709183,0.00017633845,0.8011438,0.0019798642,0.1892519,0.005804653,0.000058114765],"about_ca_topic_score_codex":0.0028192997,"about_ca_topic_score_gemma":0.0029607068,"teacher_disagreement_score":0.014238412,"about_ca_system_score_codex":0.004313971,"about_ca_system_score_gemma":0.004429187,"threshold_uncertainty_score":0.047632277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057272688,0.00078229076,0.9252349,0.0013463915,0.00031053298,0.00041396442,0.0005439483,0.0006501225,0.013445183],"genre_scores_gemma":[0.3104786,0.00045210062,0.6801086,0.00034968223,0.00021811137,0.00045683017,0.0007538233,0.00024817692,0.00693407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00039844465,0.000042449275,0.00018852577,0.00018239568,0.00019763474],"domain_scores_gemma":[0.9984977,0.00076012634,0.000113186245,0.00016305006,0.00022994139,0.00023594516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210999,0.0013933271,0.0024108377,0.0011635133,0.0012970701,0.0022488825,0.002945926,0.002043842,0.0068926862],"category_scores_gemma":[0.0037014296,0.0008790855,0.0011090883,0.0022980375,0.0009084659,0.0024543854,0.0027172044,0.0025375746,0.00090258685],"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.0008892847,0.001034796,0.0015317284,0.0006870078,0.00015315895,0.00025033255,0.0002159352,0.6451356,0.0029217147,0.087671235,0.026336772,0.2331724],"study_design_scores_gemma":[0.00015386082,0.000083362946,0.00020716147,0.000027503793,0.000031586438,0.00012016784,0.00006059638,0.952887,0.00045440526,0.043846548,0.0021119306,0.0000158569],"about_ca_topic_score_codex":0.0027858643,"about_ca_topic_score_gemma":0.004201697,"teacher_disagreement_score":0.0068926862,"about_ca_system_score_codex":0.0017275079,"about_ca_system_score_gemma":0.003626312,"threshold_uncertainty_score":0.023058295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12770045,0.0069331755,0.58246636,0.016042106,0.00396238,0.00021012557,0.0013660683,0.0008648618,0.2604544],"genre_scores_gemma":[0.8048483,0.007310744,0.12809479,0.004194219,0.0046568555,0.00021345429,0.001044968,0.00084639824,0.048790284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763095,0.0007007468,0.00010768706,0.00067135046,0.0005480066,0.00034124355],"domain_scores_gemma":[0.9915378,0.0046206396,0.00038127913,0.0022884822,0.0007579091,0.00041381438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002925,0.001127964,0.0014525349,0.0016292295,0.0022757722,0.0030485652,0.0021546562,0.0017182792,0.009409539],"category_scores_gemma":[0.016703192,0.00046296444,0.0019409114,0.0024693874,0.004913004,0.013641942,0.0047789174,0.00797721,0.0013570738],"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.00009348599,0.00004913397,0.00038197142,0.00014917266,0.000024051562,0.00015537589,0.00025348665,0.002468501,0.0018056857,0.956714,0.009693409,0.028211743],"study_design_scores_gemma":[0.000011941491,0.00005552941,0.00031135735,0.000032086446,0.00003396653,0.00023178001,0.00007516397,0.008692471,0.0013164063,0.977776,0.011434667,0.000028652265],"about_ca_topic_score_codex":0.0017201442,"about_ca_topic_score_gemma":0.0012733041,"teacher_disagreement_score":0.009409539,"about_ca_system_score_codex":0.0013588837,"about_ca_system_score_gemma":0.0013917914,"threshold_uncertainty_score":0.031478047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12245158,0.000822242,0.86269444,0.0008690928,0.0005929567,0.00028019672,0.00070349406,0.0012366367,0.010349345],"genre_scores_gemma":[0.8663548,0.00041502534,0.12286102,0.00028627506,0.00063564675,0.0003521814,0.0005633605,0.00033042763,0.008201141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962998,0.0012338735,0.00024050707,0.00073244685,0.0006955621,0.00079786865],"domain_scores_gemma":[0.9812899,0.01229478,0.001618709,0.0027090001,0.0012080233,0.00087945675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043887305,0.0020668525,0.0046990276,0.0010958993,0.001289214,0.0029099705,0.0044937227,0.0023289986,0.006121229],"category_scores_gemma":[0.013463715,0.0019395023,0.0013787164,0.0033558414,0.0012355461,0.0052173184,0.0022935201,0.0031683515,0.0009819692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015982747,0.0007202484,0.000749485,0.0003473887,0.00012634769,0.00052779895,0.000088713,0.9078804,0.00431268,0.031362236,0.005047415,0.04723894],"study_design_scores_gemma":[0.00007086675,0.00008839255,0.00014079217,0.0000063216776,0.000024816194,0.000048348866,0.000011939346,0.98732215,0.00071671716,0.011083798,0.00047494814,0.000010993305],"about_ca_topic_score_codex":0.0039053962,"about_ca_topic_score_gemma":0.0040218495,"teacher_disagreement_score":0.006121229,"about_ca_system_score_codex":0.0017041197,"about_ca_system_score_gemma":0.0037474136,"threshold_uncertainty_score":0.023210108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11061266,0.00300733,0.83478504,0.0067314273,0.00058070803,0.0005314012,0.0026268424,0.002648627,0.03847593],"genre_scores_gemma":[0.57157385,0.002218866,0.3867393,0.0011112433,0.00067230983,0.0007553006,0.005069796,0.0011165345,0.030742785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720675,0.0007594755,0.00012852269,0.0007217766,0.0005619768,0.0006215767],"domain_scores_gemma":[0.99179244,0.0044180094,0.0004839331,0.0019395205,0.0006630238,0.00070313684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029451626,0.0022600847,0.0030669358,0.0033650962,0.0027541416,0.0060742423,0.006092588,0.0028799265,0.018202014],"category_scores_gemma":[0.017139262,0.0012395527,0.0036016228,0.006396853,0.0023258,0.010810542,0.0056543,0.006616477,0.0028113893],"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.0013304756,0.00072605273,0.0038109785,0.00053278764,0.00030142866,0.00014304205,0.0008155916,0.19011943,0.001968338,0.47042283,0.04982009,0.28000897],"study_design_scores_gemma":[0.00012385541,0.000084489766,0.00045961377,0.00006747208,0.00013027035,0.00011268069,0.00026540048,0.54293483,0.001290093,0.44769704,0.006807658,0.00002666297],"about_ca_topic_score_codex":0.0049911826,"about_ca_topic_score_gemma":0.006221277,"teacher_disagreement_score":0.018202014,"about_ca_system_score_codex":0.0051430454,"about_ca_system_score_gemma":0.0043269764,"threshold_uncertainty_score":0.060891807},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000729271,0.029820608,0.0049157133,0.039307293,0.8590771,0.00015784727,0.0022243483,0.000274475,0.063493334],"genre_scores_gemma":[0.0064473054,0.026955897,0.0048879194,0.010678839,0.75508416,0.0002242219,0.004973041,0.0008776943,0.18987095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875045,0.00017890756,0.00012456182,0.00027371044,0.0005684543,0.00010381597],"domain_scores_gemma":[0.9926772,0.0016318435,0.0003460167,0.00058847916,0.003407401,0.0013490425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022086934,0.002464227,0.0022387072,0.0044976454,0.0017981713,0.0049658413,0.002078903,0.002863885,0.12569466],"category_scores_gemma":[0.008723878,0.00070317654,0.0015751332,0.00401346,0.0008032068,0.0039768266,0.0014564887,0.006305061,0.055842347],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021771886,0.000028747556,0.000052131105,0.00016991567,0.000008379558,0.000018874603,0.000004435782,0.00026120024,0.00010464558,0.0015011181,0.97503227,0.022796491],"study_design_scores_gemma":[0.00002752656,0.00007102108,0.0012457452,0.00038094743,0.000027155967,0.00011878626,0.000025753036,0.0013455505,0.00023856685,0.011099422,0.98539484,0.000024822515],"about_ca_topic_score_codex":0.0018807488,"about_ca_topic_score_gemma":0.0031932693,"teacher_disagreement_score":0.12569466,"about_ca_system_score_codex":0.0027613384,"about_ca_system_score_gemma":0.002730485,"threshold_uncertainty_score":0.42049056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032419,0.0004804193,0.17748176,0.002667992,0.00020386298,0.00012672489,0.0002723275,0.00018309012,0.0153419],"genre_scores_gemma":[0.9947397,0.000073997246,0.0021195128,0.000042435495,0.000024266152,0.000014088669,0.000020736768,0.000011837764,0.00295324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677986,0.0011373158,0.00010916675,0.0007341775,0.0002828763,0.000956575],"domain_scores_gemma":[0.9845464,0.011193651,0.001302299,0.00048428678,0.0013832302,0.0010900324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050822524,0.0008850528,0.0027858024,0.0009101844,0.0014662202,0.0061118514,0.0023918983,0.0038275348,0.0075145736],"category_scores_gemma":[0.014696451,0.0016540572,0.0013425063,0.0009797888,0.0034225986,0.005497285,0.0023195788,0.0027034224,0.00048433914],"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.0023704574,0.0006030677,0.004933341,0.00021722075,0.00021324311,0.0018071217,0.0006203693,0.85264117,0.004115564,0.116978824,0.0027639575,0.0127356965],"study_design_scores_gemma":[0.00009284831,0.00013793769,0.0008085734,0.000011740637,0.000058191108,0.00009159226,0.0001701029,0.9598679,0.00037513362,0.038122013,0.00019945181,0.00006459493],"about_ca_topic_score_codex":0.009268079,"about_ca_topic_score_gemma":0.00535925,"teacher_disagreement_score":0.009268079,"about_ca_system_score_codex":0.0033413155,"about_ca_system_score_gemma":0.002386646,"threshold_uncertainty_score":0.02687782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0862587,0.0030660764,0.8753328,0.0037696126,0.0005476548,0.00018829198,0.00061773986,0.00037132428,0.029847788],"genre_scores_gemma":[0.9013972,0.0022954878,0.06517903,0.00075724086,0.0004504287,0.00031452786,0.00068080385,0.0002730782,0.02865208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837744,0.00066694047,0.000051406172,0.00017135113,0.0003076377,0.00042516945],"domain_scores_gemma":[0.9879782,0.009120266,0.00063114736,0.0003393227,0.001157586,0.0007734388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042274385,0.0018976758,0.0033381933,0.0022944259,0.0015993044,0.0041996427,0.0057562967,0.004450171,0.007189845],"category_scores_gemma":[0.021905242,0.0013152112,0.0021783207,0.0022343295,0.0030354809,0.0054684347,0.0027547167,0.0044551212,0.0008201919],"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.00007113822,0.0000689738,0.0004245859,0.00007829707,0.000031515898,0.00010337923,0.00013218106,0.8450196,0.0002332319,0.14933756,0.0022768944,0.002222774],"study_design_scores_gemma":[0.000008554567,0.000005574378,0.000039291273,0.000007520513,0.0000072289317,0.0000074085383,0.000020399057,0.98493063,0.000014163094,0.014782879,0.00017059507,0.0000057463167],"about_ca_topic_score_codex":0.041226607,"about_ca_topic_score_gemma":0.020184914,"teacher_disagreement_score":0.041226607,"about_ca_system_score_codex":0.006168314,"about_ca_system_score_gemma":0.005750822,"threshold_uncertainty_score":0.081973255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027345964,0.00016356506,0.9930512,0.00023154529,0.00008146264,0.000033185726,0.000044124066,0.00009504929,0.0035652698],"genre_scores_gemma":[0.19774625,0.0007473862,0.78139156,0.0005899464,0.0005913919,0.00051539723,0.00050953607,0.00066722435,0.017241346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877816,0.00040269224,0.00005582774,0.00017443334,0.00048307492,0.00010576779],"domain_scores_gemma":[0.99748456,0.0013019808,0.00013969408,0.00034969026,0.00057594554,0.00014796894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018440358,0.0013861827,0.0014528704,0.0009773071,0.0005573005,0.001538407,0.0021711758,0.0019995568,0.0058398866],"category_scores_gemma":[0.007392622,0.0005081645,0.00097029307,0.0011854859,0.0013970542,0.002190336,0.0031098214,0.0047259126,0.0011706465],"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.00030327373,0.00028012626,0.00061948784,0.00046830435,0.000085878644,0.0002661046,0.00021286296,0.41562775,0.01055583,0.41993612,0.021670504,0.12997368],"study_design_scores_gemma":[0.000009919654,0.000021986047,0.000034172535,0.000005266375,0.0000050794297,0.000021080514,0.000005101635,0.98445696,0.00037442546,0.013998653,0.0010610436,0.0000063155953],"about_ca_topic_score_codex":0.0034895875,"about_ca_topic_score_gemma":0.0048565073,"teacher_disagreement_score":0.0058398866,"about_ca_system_score_codex":0.000830062,"about_ca_system_score_gemma":0.002110008,"threshold_uncertainty_score":0.019536376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34764585,0.0033359742,0.5833511,0.0029923636,0.00024348144,0.00035511513,0.0013236664,0.0016823557,0.05907012],"genre_scores_gemma":[0.85507315,0.0013981905,0.13420743,0.0004572086,0.00024129402,0.00032591738,0.00053410116,0.000445214,0.0073175915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960108,0.0021718906,0.000098865734,0.00051208684,0.00063664507,0.0005697336],"domain_scores_gemma":[0.9899682,0.007390787,0.0006505791,0.0007004727,0.0005708832,0.0007191477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045602918,0.0020477974,0.0029910835,0.0018825738,0.0007852329,0.004087437,0.0031930292,0.001796403,0.0062871845],"category_scores_gemma":[0.022190042,0.000902555,0.0009361066,0.002347295,0.0015276689,0.005494736,0.002279223,0.0022218789,0.0009783198],"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.0020055769,0.00064336834,0.0021134238,0.0011112719,0.0002000961,0.00031567033,0.0002776384,0.31628796,0.011418898,0.5133827,0.018103994,0.13413945],"study_design_scores_gemma":[0.00012297927,0.0003169695,0.0003691323,0.000066410386,0.000048130034,0.0002984661,0.000120175035,0.77709484,0.002290206,0.21676755,0.0024656272,0.000039428138],"about_ca_topic_score_codex":0.000939845,"about_ca_topic_score_gemma":0.00089340605,"teacher_disagreement_score":0.0062871845,"about_ca_system_score_codex":0.0028664854,"about_ca_system_score_gemma":0.0016645866,"threshold_uncertainty_score":0.02411741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690141,0.00012298212,0.027386658,0.0007916396,0.000052598225,0.000037645146,0.000098764736,0.000089466615,0.0024061354],"genre_scores_gemma":[0.9978509,0.000036374917,0.0008526588,0.000042970223,0.000012976805,0.0000071231702,0.00003083607,0.0000072802654,0.0011590106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981464,0.00050790404,0.000063445186,0.0002855149,0.00023014829,0.0007666585],"domain_scores_gemma":[0.98683643,0.007882025,0.0014668556,0.00026401752,0.0014172297,0.0021334474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035121657,0.0005984266,0.0012962254,0.0010169598,0.0015659842,0.0030783843,0.0021279005,0.0019638846,0.003165571],"category_scores_gemma":[0.008855655,0.0009232418,0.00065638905,0.0013722125,0.001495471,0.002000319,0.0011157703,0.001477613,0.00032804185],"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.0023981489,0.0010332874,0.048434652,0.00012254078,0.00019864738,0.0024793905,0.0010207136,0.85107845,0.008328563,0.071590215,0.0042239893,0.009091303],"study_design_scores_gemma":[0.000029486917,0.00010432566,0.0018301512,0.00000426693,0.000022693057,0.000061462044,0.00020485239,0.9952302,0.00017689484,0.0022457412,0.000065686276,0.000024335304],"about_ca_topic_score_codex":0.02690811,"about_ca_topic_score_gemma":0.021545198,"teacher_disagreement_score":0.02690811,"about_ca_system_score_codex":0.0038577488,"about_ca_system_score_gemma":0.0035685943,"threshold_uncertainty_score":0.053502977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709463,0.0016228643,0.1941763,0.003651086,0.00024980263,0.00009964998,0.00094654196,0.0008958616,0.08889491],"genre_scores_gemma":[0.96117556,0.0006644236,0.01642914,0.0005010872,0.00021793404,0.00013977793,0.00032614623,0.00016960083,0.020376328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991386,0.00031853278,0.000034298086,0.00016737431,0.00016539989,0.00017575941],"domain_scores_gemma":[0.99418736,0.0029172045,0.00047180042,0.0006829779,0.0008402526,0.0009003915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010374092,0.00045633115,0.0011921375,0.0025254905,0.002039545,0.00248765,0.001765287,0.0014097805,0.009629458],"category_scores_gemma":[0.008074119,0.00061695627,0.00074674847,0.0017064306,0.0018377142,0.0044233124,0.00220147,0.001797586,0.00088074344],"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.00010046782,0.00004416065,0.0006564831,0.000055439967,0.000017871467,0.00011067577,0.00015581089,0.008392616,0.0014050484,0.9799396,0.0029462934,0.0061757164],"study_design_scores_gemma":[0.000027706836,0.000049256552,0.0010135169,0.000030709,0.000029181423,0.00032992786,0.00018013894,0.10226087,0.0010214716,0.89136666,0.0036609108,0.000029615987],"about_ca_topic_score_codex":0.002591371,"about_ca_topic_score_gemma":0.0018302039,"teacher_disagreement_score":0.009629458,"about_ca_system_score_codex":0.0017322198,"about_ca_system_score_gemma":0.0009983544,"threshold_uncertainty_score":0.032213748},"labels":[],"label_agreement":null}]}