{"meta":{"query_hash":"5fc4432d917b","filters":{"venue":"Operations Research Letters"},"cohort_total":82,"direct_labels_cover":0,"predictions_cover":82,"exported":82,"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/5fc4432d917b","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operations+Research+Letters"},"results":[{"id":"W1428174065","doi":"10.1016/j.orl.2015.07.006","title":"Approximated cooperative equilibria for games played over event trees","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Saint Petersburg State University","keywords":"Stochastic game; Mathematical economics; Event (particle physics); Focus (optics); Class (philosophy); Tree (set theory); Mathematics; Event horizon; Computer science; Horizon; Mathematical optimization; Combinatorics; Artificial intelligence; Physics","score_opus":0.3516116309144722,"score_gpt":0.5185068786424022,"score_spread":0.16689524772793002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1428174065","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.91373104,0.000046689365,0.057667073,0.02419996,0.00012739703,0.0014893234,0.00015426318,0.00006007363,0.002524169],"genre_scores_gemma":[0.9876675,0.0000030063136,0.0030191655,0.0008658458,0.00018226453,0.0010368814,0.00008286057,0.000020345038,0.007122142],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960341,0.00087905966,0.00051105977,0.0005834675,0.0014977054,0.0004946471],"domain_scores_gemma":[0.9958686,0.0016545665,0.00003751459,0.00079953874,0.001343294,0.0002964382],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0069168424,0.00014656875,0.00022949459,0.00039962423,0.000687031,0.00094197824,0.00091056334,0.000065016415,0.0005026068],"category_scores_gemma":[0.005637359,0.00010756418,0.000093229464,0.0013638498,0.0004303173,0.0006456567,0.00019124664,0.00025010973,0.00080679625],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028341296,0.000314786,0.0002645599,0.000003971128,0.00006122783,0.000004752168,0.004136531,0.07765722,0.27841216,0.12013157,0.5153308,0.003399035],"study_design_scores_gemma":[0.0041137612,0.0007087083,0.0022884498,0.00004106827,0.000025228974,0.000015380616,0.009352952,0.60276884,0.036144875,0.033703674,0.31005308,0.00078397687],"about_ca_topic_score_codex":0.00006815756,"about_ca_topic_score_gemma":0.00023270462,"teacher_disagreement_score":0.5251116,"about_ca_system_score_codex":0.0001181077,"about_ca_system_score_gemma":0.00030677044,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W1758756115","doi":"10.1016/j.orl.2015.10.002","title":"A primal-simplex based Tardos’ algorithm","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","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":"McMaster University","funders":"Japan Society for the Promotion of Science","keywords":"Unimodular matrix; Simplex algorithm; Simplex; Linear programming; Dimension (graph theory); Mathematics; Revised simplex method; Algorithm; Matrix (chemical analysis); Coefficient matrix; Polynomial; Bounded function; Mathematical optimization; Computer science; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.2905634287283733,"score_gpt":0.4823722494864992,"score_spread":0.1918088207581259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758756115","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.0061307107,0.0000488034,0.9631634,0.025497796,0.0001265854,0.0013628613,0.0000603867,0.00023546304,0.003374037],"genre_scores_gemma":[0.011806904,0.000011576294,0.98223895,0.0013876711,0.000325799,0.00054175605,0.00012549286,0.00010123339,0.003460642],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526525,0.00082152465,0.0004055885,0.00050823623,0.0020992053,0.00090017857],"domain_scores_gemma":[0.9964137,0.00062115147,0.000025660389,0.0008386937,0.0015559432,0.00054486335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028639752,0.00020466106,0.0002463589,0.0006870865,0.00057781924,0.00039029043,0.00059661176,0.00009723535,0.00073680014],"category_scores_gemma":[0.0039152405,0.00019255535,0.00007637798,0.0014546447,0.00038412274,0.00054551975,0.00023638412,0.0007587432,0.00053971086],"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.00012106961,0.0014885692,0.000116554,0.00010943906,0.00015323775,0.00033317183,0.002216625,0.30902898,0.0064778007,0.028563527,0.5954766,0.05591438],"study_design_scores_gemma":[0.0020800948,0.00014344702,0.000018221826,0.000028351025,0.000007198711,0.000014327278,0.00049433904,0.94239306,0.0026159682,0.0036977085,0.04816647,0.00034082454],"about_ca_topic_score_codex":0.00011854127,"about_ca_topic_score_gemma":0.00007712692,"teacher_disagreement_score":0.6333641,"about_ca_system_score_codex":0.0005867159,"about_ca_system_score_gemma":0.00078357506,"threshold_uncertainty_score":0.80674446},"labels":[],"label_agreement":null},{"id":"W1967726020","doi":"10.1016/j.orl.2008.02.001","title":"A new formulation for the conditional -median and -center problems","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":36,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Center (category theory); Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.11984964661624015,"score_gpt":0.3206096362429959,"score_spread":0.20075998962675573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967726020","genre_codex":"commentary","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.24097188,0.000105762185,0.24851568,0.50304437,0.00049154955,0.0037780735,0.000026348165,0.00010851358,0.0029578046],"genre_scores_gemma":[0.98955977,0.000042219275,0.0008327603,0.006263371,0.00069940684,0.00034416077,0.00028715597,0.000010459037,0.0019606678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991452,0.0000119476945,0.00014454889,0.00016837368,0.00032013716,0.00020975625],"domain_scores_gemma":[0.99958503,0.000044579585,0.000007836913,0.0001483723,0.00019759632,0.000016587539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045809647,0.000066080545,0.0000505856,0.00018123651,0.0011302718,0.00023126164,0.00013198276,0.000025373274,0.00036817126],"category_scores_gemma":[0.00012755884,0.00004948227,0.00002938411,0.00027367938,0.00006701601,0.0007747495,0.000067774,0.00012482797,0.00017938239],"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.000033640026,0.00009528343,0.004210041,0.00012214703,0.0000639555,0.0000016683991,0.0005810604,0.049904466,0.0017694558,0.1407102,0.7963815,0.006126633],"study_design_scores_gemma":[0.0008537609,0.000010943306,0.019136798,0.000010623387,0.00000894665,0.0000018587555,0.00016943814,0.3460893,0.000015603622,0.00070932106,0.6328682,0.00012523381],"about_ca_topic_score_codex":0.0015339181,"about_ca_topic_score_gemma":0.0019583206,"teacher_disagreement_score":0.7485879,"about_ca_system_score_codex":0.000026802847,"about_ca_system_score_gemma":0.000028345905,"threshold_uncertainty_score":0.8693251},"labels":[],"label_agreement":null},{"id":"W1969119890","doi":"10.1016/j.orl.2014.10.001","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Applied mathematics; Combinatorics; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.05506757424898105,"score_gpt":0.39056686560416604,"score_spread":0.33549929135518497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969119890","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.11100874,0.000010334332,0.88494676,0.002184267,0.00011663838,0.0005454686,0.00000392196,0.00023461385,0.0009492801],"genre_scores_gemma":[0.5528152,0.0000075114044,0.44599116,0.00021539316,0.00031347378,0.0003879057,0.00011329101,0.000046951685,0.00010912489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989036,0.0002407847,0.0001572113,0.00015554459,0.00022078113,0.00032207847],"domain_scores_gemma":[0.99930125,0.00021051918,0.00000436454,0.00023133277,0.00017856558,0.00007398139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016442754,0.00008033437,0.00008488332,0.00015574579,0.00032995397,0.0001675522,0.00015658945,0.00004795761,0.00002583593],"category_scores_gemma":[0.00024277325,0.000079495505,0.000038611706,0.0003108595,0.00007153864,0.00015365769,0.000020252248,0.00019303217,0.000052168205],"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.0000037227835,0.000015902067,0.000046818124,0.000022715532,0.000011891488,2.0814748e-7,0.00015033287,0.9198787,0.057268817,0.0043551023,0.0014485976,0.016797177],"study_design_scores_gemma":[0.00022433484,0.000044126846,0.000046609755,0.000015485364,0.000002746924,0.0000015216425,0.000021053736,0.9821484,0.007610175,0.000081432045,0.00970979,0.000094312934],"about_ca_topic_score_codex":0.000010168614,"about_ca_topic_score_gemma":0.000013699363,"teacher_disagreement_score":0.44180644,"about_ca_system_score_codex":0.00007106422,"about_ca_system_score_gemma":0.000012625024,"threshold_uncertainty_score":0.32417327},"labels":[],"label_agreement":null},{"id":"W1969471641","doi":"10.1016/j.orl.2006.11.004","title":"Interior point stabilization for column generation","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Degeneracy (biology); Convergence (economics); Interior point method; Acceleration; Point (geometry); Mathematical optimization; Column (typography); Vehicle routing problem; Computer science; Dual (grammatical number); Space (punctuation); Extreme point; Mathematics; Routing (electronic design automation); Algorithm; Control theory (sociology); Combinatorics; Physics; Geometry; Artificial intelligence; Telecommunications; Classical mechanics","score_opus":0.06313064214832748,"score_gpt":0.35427776294184643,"score_spread":0.29114712079351895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969471641","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.25048763,0.000029339762,0.7460912,0.0019392547,0.00018691731,0.0006539669,0.00002042088,0.0001735461,0.00041771235],"genre_scores_gemma":[0.7853243,0.000013049751,0.2123996,0.0001953456,0.000593296,0.000571277,0.000386643,0.00006547832,0.00045102063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874103,0.00019320744,0.00027958388,0.00020404015,0.00026385084,0.00031826418],"domain_scores_gemma":[0.9992762,0.00011249329,0.00000817448,0.00023366089,0.00032163327,0.000047842677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740784,0.00009833364,0.00009917281,0.0002475362,0.00038136225,0.00032076373,0.00012663037,0.000057692178,0.00010492085],"category_scores_gemma":[0.00024090277,0.000110403154,0.00003892825,0.00043805336,0.000060589475,0.00032572917,0.000023285893,0.00015263517,0.000028919147],"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.0000018731488,0.000007935354,0.00005009962,0.000013111255,0.0000048115876,3.1864468e-7,0.0000765884,0.6526779,0.32870495,0.00085179356,0.016939392,0.000671241],"study_design_scores_gemma":[0.0002651889,0.000024427878,0.00014757598,0.000008796923,0.0000034233515,0.0000015335396,0.000039989554,0.9556984,0.03907451,0.000025529183,0.004591843,0.00011882346],"about_ca_topic_score_codex":0.00008696848,"about_ca_topic_score_gemma":0.00037780797,"teacher_disagreement_score":0.53483665,"about_ca_system_score_codex":0.00025261374,"about_ca_system_score_gemma":0.00003548001,"threshold_uncertainty_score":0.45021102},"labels":[],"label_agreement":null},{"id":"W1978372231","doi":"10.1016/j.orl.2009.01.010","title":"An edge-reduction algorithm for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Vertex cover; Edge cover; Cover (algebra); Vertex (graph theory); Feedback vertex set; Reduction (mathematics); Algorithm; Combinatorics; Mathematics; Upper and lower bounds; Approximation algorithm; Graph","score_opus":0.057983112540506636,"score_gpt":0.3598596864221159,"score_spread":0.30187657388160927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978372231","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.0017961358,0.00006459224,0.944539,0.05217448,0.000290363,0.00080251315,0.000009428758,0.000082868326,0.00024063108],"genre_scores_gemma":[0.17333058,0.000068067515,0.81905264,0.0048348326,0.00095319195,0.0005714772,0.000051732557,0.00002016964,0.0011173014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834293,0.00019489347,0.00016015206,0.00037976337,0.00050010264,0.00042216937],"domain_scores_gemma":[0.99872637,0.00015526795,0.000011065346,0.0007221607,0.00029036537,0.00009477289],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001105145,0.00009829991,0.00008241613,0.00018896474,0.0016112368,0.0009925214,0.0011753935,0.000036614652,0.000026417712],"category_scores_gemma":[0.000039039667,0.0000736262,0.000063840176,0.00075845,0.00016773815,0.001046263,0.0000741687,0.0003013314,0.000053498137],"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.000004503968,0.00017599257,0.0000012788609,0.0000028611153,0.00001897841,0.0000028436277,0.0008386603,0.01598244,0.01712725,0.07424286,0.04204164,0.8495607],"study_design_scores_gemma":[0.0002496896,0.00024406402,0.00020982612,0.000007844828,0.0000027480423,0.000015308075,0.00006302373,0.9709917,0.0016506854,0.0039341645,0.022510527,0.00012042587],"about_ca_topic_score_codex":0.00008477791,"about_ca_topic_score_gemma":0.000013824538,"teacher_disagreement_score":0.9550093,"about_ca_system_score_codex":0.00007049897,"about_ca_system_score_gemma":0.00010580724,"threshold_uncertainty_score":0.9996885},"labels":[],"label_agreement":null},{"id":"W1983553101","doi":"10.1016/j.orl.2005.06.002","title":"The k-level facility location game","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":42,"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":"Facility location problem; Monotonic function; Scheme (mathematics); Computer science; Game theory; 1-center problem; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.16215534261250739,"score_gpt":0.3297216512856123,"score_spread":0.16756630867310493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983553101","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.8912769,0.00075902004,0.02471985,0.072147146,0.00028422032,0.0005743509,0.00012925547,0.00005009192,0.010059173],"genre_scores_gemma":[0.9925522,0.000030731073,0.00020822862,0.00043611054,0.00020458238,0.00009178016,0.000016142574,0.000006785211,0.006453431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988586,0.0001565666,0.0003433336,0.00023722938,0.00008079036,0.00032351472],"domain_scores_gemma":[0.99921393,0.00017399355,0.000026415539,0.00042699627,0.00010178534,0.00005689914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003980243,0.000066115674,0.000099487865,0.00012183055,0.0007752896,0.00034137533,0.0003033004,0.00003783305,0.0001811694],"category_scores_gemma":[0.00063872855,0.000057130943,0.000037632864,0.0003398686,0.0001847713,0.00025519612,0.000044070366,0.00026112268,0.005453194],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002274023,0.000106804146,0.0037934433,0.000022190694,0.000052856405,0.0000012820477,0.002639854,0.04978147,0.0023676604,0.9053516,0.02641659,0.009443538],"study_design_scores_gemma":[0.00050536235,0.00005277164,0.015648156,0.0000187147,0.0000016209276,0.000006113476,0.0004906657,0.058185425,0.000855396,0.0030210272,0.92091304,0.000301712],"about_ca_topic_score_codex":0.0003241482,"about_ca_topic_score_gemma":0.00036246012,"teacher_disagreement_score":0.9023305,"about_ca_system_score_codex":0.00015423242,"about_ca_system_score_gemma":0.000026084314,"threshold_uncertainty_score":0.99532115},"labels":[],"label_agreement":null},{"id":"W1988044523","doi":"10.1016/j.orl.2007.10.006","title":"The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scaling; Semidefinite programming; Equivalence (formal languages); Semidefinite embedding; Polynomial; Mathematics; Mathematical optimization; Computer science; Combinatorics; Discrete mathematics; Mathematical analysis; Quadratically constrained quadratic program; Geometry","score_opus":0.06701004283141021,"score_gpt":0.35075252352602226,"score_spread":0.28374248069461205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988044523","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.41499218,0.00020689929,0.5772631,0.0067317383,0.000110189205,0.00031059977,0.0000033430388,0.000024065013,0.00035784184],"genre_scores_gemma":[0.9355729,0.000058696805,0.06418863,0.00007168707,0.000041745865,0.00001697509,0.0000023022176,0.0000042300185,0.000042822616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857616,0.00014847639,0.00029185216,0.0001911287,0.00048707426,0.00030527543],"domain_scores_gemma":[0.9985734,0.0006398813,0.000034801596,0.0004272499,0.00025854673,0.00006608818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025981094,0.000060017483,0.000084535895,0.0001999403,0.00071033713,0.00016807778,0.0006210239,0.000027697977,0.000002746007],"category_scores_gemma":[0.00022896481,0.00004640853,0.00003856687,0.0009117425,0.00072463317,0.0002849379,0.0003028578,0.00023702228,0.0000025766547],"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.000036567795,0.000253604,0.0033405526,0.00006554186,0.00007443088,0.000012472845,0.0064505558,0.0032864271,0.2008318,0.22240584,0.0011199387,0.5621223],"study_design_scores_gemma":[0.0015286035,0.0008421242,0.034156535,0.00038054225,0.0000206825,0.000087285545,0.0019631528,0.8543107,0.08759943,0.0073961257,0.0109831635,0.0007316919],"about_ca_topic_score_codex":0.0002986034,"about_ca_topic_score_gemma":0.00021017797,"teacher_disagreement_score":0.85102427,"about_ca_system_score_codex":0.00002227648,"about_ca_system_score_gemma":0.00005482329,"threshold_uncertainty_score":0.5463411},"labels":[],"label_agreement":null},{"id":"W1988784053","doi":"10.1016/j.orl.2004.08.001","title":"The -machine flowshop problem with unit-time operations and intree precedence constraints","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Time complexity; Unit (ring theory); Conjecture; Mathematics; Algorithm; Combinatorics","score_opus":0.019061492623753413,"score_gpt":0.2776207736294116,"score_spread":0.2585592810056582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988784053","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.6243072,0.0005440856,0.31595942,0.051960975,0.0001747069,0.0019477116,0.0000929289,0.00058454444,0.004428404],"genre_scores_gemma":[0.8109689,0.00031163424,0.18718658,0.00032483373,0.00011873784,0.000310046,0.00008286856,0.000055175933,0.00064124796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891466,0.00009199027,0.00016494091,0.00019100682,0.0003175248,0.00031985043],"domain_scores_gemma":[0.9992932,0.000116015326,0.0000038136268,0.0002628228,0.00020502173,0.000119102006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019072,0.00011870108,0.000084915504,0.00012429891,0.0011052941,0.0005835648,0.00019451226,0.000039705705,0.00006866617],"category_scores_gemma":[0.00012363831,0.000082600025,0.000013323355,0.00048362897,0.00047750957,0.00027563452,0.000039012517,0.00039873572,0.00008266583],"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.000003816044,0.000013028602,0.000022922513,0.000005596525,0.000027540786,0.000004028371,0.00047968118,0.9899002,0.006185272,0.0012580472,0.00017068704,0.0019291964],"study_design_scores_gemma":[0.0005856934,0.00006740291,0.00012153123,0.000061435654,0.0000073887186,0.000040422445,0.00034085865,0.99568075,0.002344609,0.000027633168,0.0005306868,0.00019157778],"about_ca_topic_score_codex":0.000104554216,"about_ca_topic_score_gemma":0.0010392902,"teacher_disagreement_score":0.18666166,"about_ca_system_score_codex":0.00007029476,"about_ca_system_score_gemma":0.00010717928,"threshold_uncertainty_score":0.850114},"labels":[],"label_agreement":null},{"id":"W1990311848","doi":"10.1016/j.orl.2008.09.004","title":"Evaluating a warm standby system with components having proportional hazard rates","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":40,"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":"Component (thermodynamics); Statistics; Proportional hazards model; Hazard ratio; Hazard; Computer science; Reliability engineering; Mathematics; Control theory (sociology); Engineering; Physics; Artificial intelligence; Biology; Control (management)","score_opus":0.10389035107292438,"score_gpt":0.3509936052648227,"score_spread":0.24710325419189832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990311848","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.91853386,0.000040843574,0.07894967,0.0010066673,0.00007599298,0.0006101073,0.000010190161,0.00017273765,0.0005999511],"genre_scores_gemma":[0.98231375,0.000031632724,0.017043747,0.00004233354,0.00007232487,0.00024057427,0.000082189115,0.00002813628,0.00014530876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832207,0.00014787051,0.00023764132,0.00021861475,0.00071751676,0.0003562988],"domain_scores_gemma":[0.99923104,0.000061282866,0.000010555957,0.00022819308,0.00038611944,0.00008277981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079831237,0.000111662004,0.00012549458,0.0001588953,0.00077650294,0.00012018294,0.00012853902,0.00003833717,0.00004013316],"category_scores_gemma":[0.000105242616,0.00009242679,0.000026341133,0.00036742113,0.00018241872,0.00037066426,0.000027260328,0.00029406892,0.000049786307],"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.000016945813,0.00002042582,0.0009591958,0.00006703673,0.000022213844,0.00002022138,0.0003772593,0.9477332,0.049153347,0.00027773064,0.0012332497,0.00011914818],"study_design_scores_gemma":[0.0003883187,0.00006493382,0.0017524385,0.00013890931,0.0000040067944,0.000048306356,0.00024570178,0.9942729,0.0027385429,0.0000017660328,0.00021059727,0.00013357756],"about_ca_topic_score_codex":0.00009955006,"about_ca_topic_score_gemma":0.00006224801,"teacher_disagreement_score":0.06377991,"about_ca_system_score_codex":0.00038366189,"about_ca_system_score_gemma":0.00009803803,"threshold_uncertainty_score":0.5972311},"labels":[],"label_agreement":null},{"id":"W2006832443","doi":"10.1016/j.orl.2009.01.001","title":"On competitiveness in uniform utility allocation markets","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"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 Waterloo","funders":"Georgia Institute of Technology; National Science Foundation","keywords":"Business; Industrial organization; Microeconomics; Mathematical optimization; Computer science; Economics; Operations research; Mathematics","score_opus":0.16684133642276838,"score_gpt":0.47180009910889886,"score_spread":0.3049587626861305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006832443","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.88855475,0.0000068259787,0.024473144,0.06495944,0.00006198904,0.00048545763,0.000014021521,0.000027593567,0.021416763],"genre_scores_gemma":[0.996146,0.0000061305936,0.0003921248,0.0018098013,0.00004487077,0.000073304254,0.00002059633,0.0000040030804,0.0015031735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99682623,0.0009609,0.0003780468,0.00042162815,0.0011346707,0.00027852732],"domain_scores_gemma":[0.9977379,0.0011274957,0.00002195225,0.0006430943,0.00037665822,0.00009290988],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0067722634,0.00008283947,0.00011728393,0.0005905523,0.0006067093,0.00031816025,0.0005572467,0.000045859208,0.0015254283],"category_scores_gemma":[0.0020418726,0.000068141824,0.000040622963,0.0018157332,0.0002120057,0.0004247278,0.000040547682,0.0003500167,0.0010316875],"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.00018150077,0.0006030391,0.0011286911,0.0000019991464,0.0000057979496,0.000009572385,0.0007691875,0.03996676,0.019808453,0.8482168,0.010392234,0.078915976],"study_design_scores_gemma":[0.001370052,0.00027212346,0.6341359,0.00007486167,0.0000034974976,0.000011900484,0.0028605273,0.10896881,0.010917179,0.15819137,0.082673706,0.00052007864],"about_ca_topic_score_codex":0.00003780333,"about_ca_topic_score_gemma":0.00016860165,"teacher_disagreement_score":0.69002545,"about_ca_system_score_codex":0.0001185729,"about_ca_system_score_gemma":0.00008732961,"threshold_uncertainty_score":0.99974614},"labels":[],"label_agreement":null},{"id":"W2009389420","doi":"10.1016/j.orl.2004.08.004","title":"Response time in a tandem queue with blocking, Markovian arrivals and phase-type services","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"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 Manitoba","funders":"","keywords":"Queue; Blocking (statistics); Computer science; Tandem; Markov chain; Fork–join queue; Markov process; Discrete time and continuous time; Mathematical optimization; Control theory (sociology); Mathematics; Queue management system; Computer network; Statistics; Control (management); Engineering; Artificial intelligence","score_opus":0.020846876357894152,"score_gpt":0.3171079521990768,"score_spread":0.2962610758411826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009389420","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.9791608,0.000033229346,0.00035526793,0.019636502,0.0000139869135,0.0002930682,0.0000013166913,0.000050803275,0.0004550338],"genre_scores_gemma":[0.99575955,0.000006811851,0.0008908661,0.002752533,0.00013989891,0.000039349536,0.000025531714,0.000026930114,0.00035854644],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985781,0.00014729142,0.00018852332,0.00034204003,0.00037473717,0.0003693447],"domain_scores_gemma":[0.9993318,0.00011681052,0.00002932366,0.0002941368,0.0002033862,0.000024557825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019704748,0.00013394722,0.00016405797,0.00079587824,0.0004710965,0.0005535071,0.00023036236,0.000040237253,0.00017982241],"category_scores_gemma":[0.00026074384,0.00011566262,0.000021133517,0.0015128476,0.00017597563,0.0011747075,0.00012207651,0.00026939134,0.00017980732],"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.0030315537,0.00060698076,0.011137061,0.00015552496,0.0002018979,0.00066692446,0.0015970786,0.44534463,0.52225417,0.0120949475,0.0011726841,0.0017365533],"study_design_scores_gemma":[0.050032027,0.0015047854,0.03360996,0.004548048,0.00051292323,0.00015277624,0.012110434,0.623394,0.016864924,0.018918222,0.23233464,0.0060172128],"about_ca_topic_score_codex":0.00078361627,"about_ca_topic_score_gemma":0.002103931,"teacher_disagreement_score":0.5053893,"about_ca_system_score_codex":0.00010479051,"about_ca_system_score_gemma":0.000052368527,"threshold_uncertainty_score":0.5337482},"labels":[],"label_agreement":null},{"id":"W2012217367","doi":"10.1016/j.orl.2013.09.009","title":"Binary group facets with complete support and non-binary coefficients","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Binary number; Group (periodic table); Mathematics; Combinatorics; Binary data; Discrete mathematics; Arithmetic; Physics","score_opus":0.1354584550971923,"score_gpt":0.38946420432126033,"score_spread":0.25400574922406804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012217367","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.963032,0.000007298339,0.016659828,0.015165243,0.000015693267,0.0014713187,0.00004385349,0.000054983182,0.003549788],"genre_scores_gemma":[0.9739289,0.000009587608,0.022137213,0.0008324581,0.00004912444,0.00095098617,0.00007018955,0.0000343785,0.0019871606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.00013923028,0.00028667372,0.00030783023,0.0005380565,0.00045985018],"domain_scores_gemma":[0.9986262,0.0004635169,0.000021005435,0.0004817568,0.00021356148,0.00019400976],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057211623,0.00014661168,0.00019755415,0.00015043528,0.0006631847,0.00031228326,0.00023966948,0.00004670637,0.0010643281],"category_scores_gemma":[0.00011240901,0.000109008484,0.000029457482,0.00033075517,0.00036345204,0.00024903106,0.0001671206,0.0002936473,0.00043072665],"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.000030146373,0.0014280368,0.00044345888,0.0006147521,0.00014831734,0.000037210226,0.0046804827,0.00081606756,0.255119,0.39384314,0.34193736,0.000902052],"study_design_scores_gemma":[0.0100558195,0.0055219177,0.019403268,0.0013711897,0.00023441497,0.00033191557,0.027169855,0.76179975,0.0049593938,0.050358273,0.114075355,0.0047188206],"about_ca_topic_score_codex":0.0002618178,"about_ca_topic_score_gemma":0.00004377905,"teacher_disagreement_score":0.7609837,"about_ca_system_score_codex":0.000045682056,"about_ca_system_score_gemma":0.000035117046,"threshold_uncertainty_score":0.99984884},"labels":[],"label_agreement":null},{"id":"W2012762076","doi":"10.1016/s0167-6377(01)00095-5","title":"Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model","year":2001,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Subject (documents); Single use; Computer science; Upper and lower bounds; Operations management; Operations research; Mathematics; Economics; Engineering; Process engineering","score_opus":0.27002455987313667,"score_gpt":0.45987269963396177,"score_spread":0.1898481397608251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012762076","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.92021626,0.00008162879,0.028825544,0.04164179,0.00009725038,0.0010461471,0.000013434174,0.00004647942,0.008031461],"genre_scores_gemma":[0.97984535,0.00009609448,0.0075931237,0.009296205,0.00008425419,0.00015763186,0.0000051247544,0.000038649527,0.002883576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943563,0.0005774528,0.0006020698,0.0011678569,0.0023033996,0.0009929594],"domain_scores_gemma":[0.9963981,0.0014692663,0.00003976375,0.0009230811,0.00069400435,0.0004757998],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051119174,0.00026209845,0.00033471105,0.00102377,0.0021146177,0.002999365,0.00080953096,0.00012006743,0.0004205505],"category_scores_gemma":[0.006074449,0.00022427026,0.00009553571,0.0019655314,0.00037470617,0.0011588377,0.00047768714,0.00061760674,0.0008815779],"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.00037061694,0.0003559995,0.0014298747,0.000015227034,0.00005730471,0.00009039324,0.010921028,0.7687758,0.1537457,0.0033198195,0.018960135,0.041958082],"study_design_scores_gemma":[0.0011575178,0.00045782223,0.00032766163,0.00022976074,0.000010932925,0.00006844327,0.003978131,0.96131074,0.0052100373,0.003660097,0.022879617,0.00070925],"about_ca_topic_score_codex":0.0012899059,"about_ca_topic_score_gemma":0.0018335728,"teacher_disagreement_score":0.19253491,"about_ca_system_score_codex":0.00043250673,"about_ca_system_score_gemma":0.00034336105,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W2018660239","doi":"10.1016/j.orl.2008.09.006","title":"Certification of an optimal TSP tour through 85,900 cities","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":171,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Travelling salesman problem; Certification; Code (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Operations research; Bottleneck traveling salesman problem; Mathematics; Programming language; Economics","score_opus":0.12102799807608362,"score_gpt":0.374011808626763,"score_spread":0.25298381055067937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018660239","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.8182901,0.000051750125,0.17748986,0.0014636563,0.00008579887,0.00023822107,0.00001405084,0.00015482683,0.002211744],"genre_scores_gemma":[0.7716902,0.00007246708,0.22761235,0.000089963294,0.000110412395,0.00006297376,0.000054611523,0.000035724435,0.00027130102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00031424538,0.00029166738,0.00019497746,0.00045024444,0.00031062998],"domain_scores_gemma":[0.99913716,0.000099710785,0.00001169903,0.00042025957,0.0002611264,0.00007002623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006290692,0.00010420609,0.00013328821,0.00021526785,0.00038611423,0.00007234568,0.00025290626,0.00006395906,0.00025726613],"category_scores_gemma":[0.00019614045,0.00011153422,0.000036356738,0.0005657591,0.00027615504,0.00061636785,0.000034251294,0.00028883867,0.00004107712],"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.0000053136155,0.000022949689,0.00005647936,0.000015166946,0.000014001074,0.00000393555,0.002044487,0.87886965,0.11369281,0.00016193405,0.00453419,0.0005790983],"study_design_scores_gemma":[0.00021358604,0.000045613167,0.0010470867,0.000015462077,0.0000037217449,0.000016214071,0.00044975258,0.877345,0.119150005,0.000008702331,0.0015498758,0.00015495965],"about_ca_topic_score_codex":0.000111736095,"about_ca_topic_score_gemma":0.0000137302095,"teacher_disagreement_score":0.050122485,"about_ca_system_score_codex":0.00009976253,"about_ca_system_score_gemma":0.00005871126,"threshold_uncertainty_score":0.45482334},"labels":[],"label_agreement":null},{"id":"W2024720842","doi":"10.1016/j.orl.2012.05.008","title":"Simultaneous testing of multicharacteristic components","year":2012,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Software Reliability and Analysis Research","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 British Columbia","funders":"","keywords":"Component (thermodynamics); Computer science; Construct (python library); Simple (philosophy); Heuristic; Test strategy; Sequential analysis; Algorithm; Mathematical optimization; Mathematics; Statistics; Artificial intelligence","score_opus":0.10618553926644932,"score_gpt":0.37003103829978545,"score_spread":0.26384549903333615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024720842","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.85505885,0.00006129416,0.14238709,0.0019532803,0.000073917814,0.00022660148,0.0000053697363,0.000055966368,0.000177614],"genre_scores_gemma":[0.9553502,0.000006421039,0.044317357,0.00012521159,0.000082282284,0.000030963198,0.000008758767,0.000007324094,0.000071487455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973523,0.0005479119,0.00028965482,0.00025152095,0.00093669526,0.00062188605],"domain_scores_gemma":[0.9962461,0.002298225,0.000020080846,0.00064227625,0.00058210146,0.00021118754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019901562,0.00008902284,0.00015967782,0.00034524073,0.00040708945,0.00019766267,0.00083721575,0.00003842771,0.000043187596],"category_scores_gemma":[0.0048187887,0.00007946531,0.000053675896,0.0013281931,0.0002167371,0.00062979705,0.00037204518,0.00035086225,0.0002066102],"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.000011436659,0.0008351174,0.03553327,0.000094891366,0.000079425066,0.000030332007,0.002110082,0.045182824,0.87228197,0.0031051077,0.00052580796,0.040209714],"study_design_scores_gemma":[0.00020059673,0.000057778416,0.0123884175,0.000038104223,0.00000427443,0.000010430554,0.000050508075,0.97715837,0.008598399,0.00002650124,0.0013147515,0.00015189104],"about_ca_topic_score_codex":0.00042359674,"about_ca_topic_score_gemma":0.000008586074,"teacher_disagreement_score":0.93197554,"about_ca_system_score_codex":0.00009568837,"about_ca_system_score_gemma":0.00007325906,"threshold_uncertainty_score":0.5768888},"labels":[],"label_agreement":null},{"id":"W2029207664","doi":"10.1016/j.orl.2010.08.007","title":"Lifting, tilting and fractional programming revisited","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":21,"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 Waterloo","funders":"","keywords":"Integer programming; Connection (principal bundle); Simple (philosophy); Linear programming; Mathematical optimization; Mathematics; Key (lock); Integer (computer science); Fractional programming; Computer science; Algorithm; Nonlinear programming; Programming language; Nonlinear system; Geometry","score_opus":0.08743048111281011,"score_gpt":0.44426865722914527,"score_spread":0.35683817611633517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029207664","genre_codex":"empirical","genre_gemma":"methods","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.6546261,0.000070816786,0.3048049,0.033370655,0.0002469515,0.0024485341,0.000025291363,0.00039899317,0.0040077865],"genre_scores_gemma":[0.15100828,0.000033555785,0.84581363,0.00034336455,0.0005075662,0.00027880902,0.00004546623,0.000064818625,0.0019045124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783874,0.00022864038,0.00026730678,0.00035197788,0.0008212794,0.0004920674],"domain_scores_gemma":[0.99802977,0.0007953243,0.000024614925,0.00035757927,0.00060793565,0.00018475809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913643,0.00011495527,0.00012969926,0.00038244377,0.0010631188,0.00046034888,0.00020744865,0.00007751623,0.0005068257],"category_scores_gemma":[0.0061419094,0.00010950746,0.000029884079,0.000682345,0.00029652214,0.00047271416,0.0001765702,0.0012919995,0.000065373206],"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.000079659665,0.0007758679,0.0050888485,0.00039382683,0.00020956378,0.00013688588,0.0039435118,0.0117798,0.5573649,0.22124374,0.041404128,0.15757932],"study_design_scores_gemma":[0.0023123254,0.00019951178,0.0015454637,0.00022483361,0.000027095131,0.00023672795,0.0015362987,0.77872944,0.008417279,0.00648883,0.19912568,0.0011565012],"about_ca_topic_score_codex":0.00003601884,"about_ca_topic_score_gemma":0.000100160076,"teacher_disagreement_score":0.76694965,"about_ca_system_score_codex":0.000055321932,"about_ca_system_score_gemma":0.00008945191,"threshold_uncertainty_score":0.81767577},"labels":[],"label_agreement":null},{"id":"W2031070862","doi":"10.1016/j.orl.2008.05.001","title":"The influence of the node criticality relation on some measures of component importance","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Royal Canadian Geographical Society","keywords":"Criticality; Component (thermodynamics); Ranking (information retrieval); Reliability (semiconductor); Relation (database); Computer science; Reliability engineering; Node (physics); Mathematics; Statistics; Data mining; Artificial intelligence; Engineering; Physics","score_opus":0.04816845958036342,"score_gpt":0.29232573389454153,"score_spread":0.2441572743141781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031070862","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.9911387,0.000050129776,0.0012416134,0.006968706,0.00005028899,0.00027386504,0.0000071916666,0.0000152037655,0.000254331],"genre_scores_gemma":[0.99919647,0.0002545752,0.00032755177,0.00013855268,0.000013917572,0.00003568561,0.0000030500285,0.0000068590175,0.00002332382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988508,0.00017665017,0.0002481697,0.0000923116,0.00046915543,0.00016291285],"domain_scores_gemma":[0.99907905,0.00022562529,0.000012128453,0.0003946453,0.0002632497,0.000025328345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071079005,0.00005328887,0.00007433905,0.000040176972,0.00039654085,0.000017363625,0.00020817376,0.00003105008,0.0000040438863],"category_scores_gemma":[0.00078437204,0.00003299181,0.000037530266,0.00024722968,0.00050481886,0.0001678066,0.000025749547,0.0002475405,0.0000042266183],"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.000007223897,0.000017314407,0.0015709935,0.000014204062,0.000006728749,3.0351663e-7,0.00017349627,0.9247237,0.065628596,0.0070793116,0.00074199366,0.00003614117],"study_design_scores_gemma":[0.00043280903,0.0000652933,0.5225043,0.00017465658,0.0000084100975,0.000004778651,0.00014017006,0.41779426,0.056391913,0.00079382234,0.0015009395,0.00018858169],"about_ca_topic_score_codex":0.00008418185,"about_ca_topic_score_gemma":0.000044760523,"teacher_disagreement_score":0.5209334,"about_ca_system_score_codex":0.00008272705,"about_ca_system_score_gemma":0.000037911886,"threshold_uncertainty_score":0.30499116},"labels":[],"label_agreement":null},{"id":"W2032553706","doi":"10.1016/j.orl.2013.04.002","title":"Game theory to a friend’s rescue","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Algorithms and Data Compression","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":"Royal Military College of Canada","funders":"","keywords":"Game theory; Computer science; Psychology; Mathematics; Mathematical economics","score_opus":0.04051551192477621,"score_gpt":0.3415616473245901,"score_spread":0.3010461353998139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032553706","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.07584103,0.000028322345,0.8836715,0.03821202,0.00014751976,0.0005555182,0.0000062984004,0.00008902285,0.0014487173],"genre_scores_gemma":[0.7071477,0.000016630282,0.27872276,0.0092258165,0.00036171434,0.00086449424,0.000031897616,0.000025442223,0.0036035571],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979918,0.00039915228,0.00015160743,0.0004055073,0.00059230434,0.0004596183],"domain_scores_gemma":[0.99839765,0.00013605547,0.0000046889113,0.0009714404,0.00025179674,0.00023839115],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00094271486,0.00008762092,0.000082719074,0.00028540537,0.00046299558,0.001084158,0.0012582914,0.0000317588,0.00025438413],"category_scores_gemma":[0.00019601038,0.00006924534,0.000028525235,0.00069819635,0.00007698259,0.0012694562,0.0008097259,0.00028314174,0.0033112022],"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.000010152697,0.00016807826,0.000051767136,0.000012065436,0.000026317164,0.00004643614,0.004613219,0.018263372,0.15753497,0.23300444,0.40884274,0.17742644],"study_design_scores_gemma":[0.0006642265,0.00032034316,0.0051615504,0.00011898056,0.0000026304301,0.000029178984,0.00049647834,0.7254197,0.011475674,0.005841671,0.24976774,0.0007018075],"about_ca_topic_score_codex":0.00073524256,"about_ca_topic_score_gemma":0.000042568507,"teacher_disagreement_score":0.70715636,"about_ca_system_score_codex":0.00006182735,"about_ca_system_score_gemma":0.00007741674,"threshold_uncertainty_score":0.9999528},"labels":[],"label_agreement":null},{"id":"W2033053245","doi":"10.1016/j.orl.2010.08.003","title":"On the supplier diversification under binomial yield","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University; University of Toronto; University of New Brunswick; Dalhousie University","funders":"","keywords":"Diversification (marketing strategy); Binomial (polynomial); Yield (engineering); Mathematics; Binomial distribution; Business; Statistics; Marketing","score_opus":0.08486870141100007,"score_gpt":0.2964477325248592,"score_spread":0.21157903111385912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033053245","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.78286576,0.0000015802043,0.00042548712,0.17841089,0.00056372944,0.0005283781,0.0000021919675,0.000046456924,0.037155513],"genre_scores_gemma":[0.9757796,0.0000017996823,0.00003940683,0.021235665,0.0010847383,0.00012503148,0.000036553673,0.000014407497,0.001682802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988242,0.00002840336,0.0001205616,0.00023782229,0.000496137,0.00029287377],"domain_scores_gemma":[0.99924994,0.00015026746,0.000014886731,0.00044411857,0.00012665076,0.000014143106],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009919256,0.000091823604,0.00005617661,0.0003190444,0.0010510347,0.0008401318,0.00043775892,0.00003888761,0.0050149835],"category_scores_gemma":[0.0002848233,0.000064900356,0.000043473054,0.00043799065,0.00018869637,0.0005247704,0.00017753347,0.00047668404,0.003227444],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012863396,0.000060453982,0.00027541703,0.000006268372,0.000013920173,0.0000019744723,0.000046437228,0.0017904099,0.039389513,0.5301332,0.4278707,0.00039885173],"study_design_scores_gemma":[0.00070122146,0.000028880855,0.010266311,0.000027061411,0.000024645029,7.9312656e-7,0.001809561,0.042985827,0.0020815493,0.003260766,0.938363,0.00045038114],"about_ca_topic_score_codex":0.00067640893,"about_ca_topic_score_gemma":0.0005905574,"teacher_disagreement_score":0.52687246,"about_ca_system_score_codex":0.000038816917,"about_ca_system_score_gemma":0.000016418518,"threshold_uncertainty_score":0.99754864},"labels":[],"label_agreement":null},{"id":"W2033097589","doi":"10.1016/j.orl.2003.08.005","title":"A bilevel programming approach to the travelling salesman problem","year":2003,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Travelling salesman problem; Bilevel optimization; Mathematical optimization; Extension (predicate logic); Linear programming relaxation; Computer science; Relaxation (psychology); Toll; Linear programming; Dual (grammatical number); Optimization problem; Mathematics","score_opus":0.07996579037548483,"score_gpt":0.3380938230751212,"score_spread":0.25812803269963636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033097589","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.022708155,0.00004779713,0.96506345,0.0025282225,0.00007550878,0.0012017287,0.0000032908702,0.00020668584,0.008165152],"genre_scores_gemma":[0.27509806,0.000009502074,0.72354686,0.00026257802,0.000086732936,0.00059323,0.000011431823,0.00005359836,0.00033802187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.0005305676,0.0002318715,0.00025541775,0.0004402128,0.000551217],"domain_scores_gemma":[0.99921215,0.00012824626,0.0000054006537,0.00038584092,0.00013941187,0.00012893073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027956467,0.00012654997,0.00010504157,0.00025038628,0.00064704503,0.00040687967,0.00031122603,0.000049415492,0.000022466205],"category_scores_gemma":[0.00029412378,0.00010044379,0.00003739996,0.0012681514,0.00006995493,0.00014188518,0.000031058757,0.0004934729,0.00009373141],"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":[8.150098e-7,0.00002286185,0.00003450424,0.000019707297,0.000016503058,9.135455e-7,0.0015218678,0.9792521,0.008152109,0.0031313556,0.0018054709,0.0060417834],"study_design_scores_gemma":[0.00020801158,0.000022896853,0.000087414075,0.000028036427,0.0000060218576,0.000015396065,0.000530001,0.9336976,0.0038793383,0.000020808278,0.061256222,0.00024827317],"about_ca_topic_score_codex":0.000023347107,"about_ca_topic_score_gemma":0.000022658818,"teacher_disagreement_score":0.2523899,"about_ca_system_score_codex":0.00012331661,"about_ca_system_score_gemma":0.000051463652,"threshold_uncertainty_score":0.49766126},"labels":[],"label_agreement":null},{"id":"W2036223399","doi":"10.1016/s0167-6377(02)00178-5","title":"A mountain process with state dependent input and output and a correlated dam","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outflow; Generalization; Equivalence (formal languages); Production (economics); Process (computing); Work (physics); Production rate; State (computer science); State dependent; Work in process; Mathematics; Constant (computer programming); Computer science; Mathematical economics; Economics; Operations management; Thermodynamics; Engineering; Mathematical analysis; Algorithm; Discrete mathematics; Process engineering; Physics","score_opus":0.03403268896689165,"score_gpt":0.2893857000473459,"score_spread":0.2553530110804542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036223399","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.98720086,0.00006962484,0.005590017,0.0058150114,0.000012429022,0.0003178785,0.0000021207732,0.000053456155,0.00093863346],"genre_scores_gemma":[0.9967796,0.000021668002,0.0002902642,0.0016141948,0.00008111382,0.000050775016,0.000012430256,0.00002206808,0.0011278422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987664,0.000044036395,0.00014976533,0.00031454646,0.0003955912,0.0003296649],"domain_scores_gemma":[0.99944365,0.000070391856,0.000025551077,0.00018489549,0.00024807535,0.00002744292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077659,0.000117471536,0.0001196794,0.0004949979,0.0006003838,0.0006438868,0.00012423062,0.00002775321,0.00007771057],"category_scores_gemma":[0.00018831299,0.00009604184,0.000011227186,0.0007564725,0.00024211165,0.0011764382,0.00011321615,0.0002981356,0.00007071331],"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.0010007777,0.0008865999,0.0778223,0.0009855933,0.00095006154,0.0011986621,0.009173126,0.7730409,0.025128407,0.029918369,0.009976735,0.06991845],"study_design_scores_gemma":[0.0018254931,0.00006490705,0.0019276248,0.00013737306,0.00008148813,0.000029702178,0.001974425,0.98617595,0.0002762785,0.0011119948,0.0058210217,0.0005737207],"about_ca_topic_score_codex":0.0003333348,"about_ca_topic_score_gemma":0.00076232705,"teacher_disagreement_score":0.21313506,"about_ca_system_score_codex":0.00003806467,"about_ca_system_score_gemma":0.0000093523195,"threshold_uncertainty_score":0.6209015},"labels":[],"label_agreement":null},{"id":"W2037455685","doi":"10.1016/j.orl.2010.03.003","title":"Revisiting a simple algorithm for the planar multiterminal cut problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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","keywords":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","score_opus":0.059342137113430476,"score_gpt":0.36125828020580025,"score_spread":0.3019161430923698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037455685","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.0069090556,0.000032335385,0.9552117,0.03648559,0.0002159914,0.00085036387,0.000032057193,0.00007522798,0.00018765485],"genre_scores_gemma":[0.03401531,0.00001423139,0.96204585,0.0018414344,0.0010282107,0.00065360987,0.000030149416,0.00001826009,0.00035296116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982466,0.00014013502,0.0002097316,0.00038444548,0.00049507053,0.00052400964],"domain_scores_gemma":[0.99807274,0.0008116966,0.00001781754,0.0007128874,0.00028642418,0.00009843864],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018208608,0.000109794455,0.000102098034,0.00018755978,0.0020649356,0.0010691562,0.0014278387,0.000041963445,0.000035381978],"category_scores_gemma":[0.00020514269,0.000080628255,0.00008252,0.00059403817,0.00024540108,0.0005162607,0.00024104933,0.00069048087,0.000039610255],"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.0000035873425,0.000060884988,0.000054835065,0.000022396945,0.00003657338,0.000021800783,0.0011005164,0.0010136588,0.02980924,0.07186814,0.015617143,0.88039124],"study_design_scores_gemma":[0.00022726263,0.000036052927,0.00017469988,0.000012866752,0.0000027034703,0.000029641924,0.00006449834,0.919279,0.00092106714,0.0010276888,0.07809916,0.00012537396],"about_ca_topic_score_codex":0.0002752526,"about_ca_topic_score_gemma":0.00029986876,"teacher_disagreement_score":0.91826534,"about_ca_system_score_codex":0.000026343547,"about_ca_system_score_gemma":0.00010256164,"threshold_uncertainty_score":0.9999678},"labels":[],"label_agreement":null},{"id":"W2037492274","doi":"10.1016/j.orl.2014.04.005","title":"Stochastic capacity expansion with multiple sources of capacity","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tissue expansion; Mathematics; Mathematical optimization; Computer science; Medicine; Surgery","score_opus":0.07668023595771185,"score_gpt":0.26316913896779814,"score_spread":0.1864889030100863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037492274","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.98217446,0.00016712728,0.015264951,0.0016661282,0.000034259167,0.00017847403,0.0000447572,0.000012932099,0.00045689708],"genre_scores_gemma":[0.99778485,0.00003381948,0.0016348889,0.00017113754,0.000064780594,0.000039877024,0.000017345023,0.000012463444,0.00024086468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989702,0.000073097945,0.00029332904,0.00027844214,0.00012300485,0.00026193185],"domain_scores_gemma":[0.99931544,0.0001215457,0.000047221525,0.00033199295,0.000098604825,0.00008521773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474191,0.00009180071,0.00023183342,0.000410441,0.0003228803,0.0000941461,0.00017846428,0.000041962314,0.00015300098],"category_scores_gemma":[0.0002602409,0.0000803263,0.00006827267,0.0004242002,0.00034573756,0.00023127996,0.00004001675,0.00020357934,0.00017138451],"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.00006988197,0.00052750926,0.06515288,0.00008439543,0.00030526164,0.0000029513624,0.0076838974,0.31336176,0.030270472,0.5790989,0.0030005593,0.00044155438],"study_design_scores_gemma":[0.0021216501,0.0005726082,0.037352223,0.000082315666,0.000029767667,0.000006914227,0.00085559336,0.9373511,0.010803256,0.0056194547,0.004466128,0.0007390072],"about_ca_topic_score_codex":0.0045346012,"about_ca_topic_score_gemma":0.0014461942,"teacher_disagreement_score":0.62398934,"about_ca_system_score_codex":0.00006220725,"about_ca_system_score_gemma":0.000012443359,"threshold_uncertainty_score":0.6854991},"labels":[],"label_agreement":null},{"id":"W2038708756","doi":"10.1016/j.orl.2010.09.006","title":"Weak aggregating algorithm for the distribution-free perishable inventory problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Class (philosophy); Parametric statistics; Computer science; Distribution (mathematics); Mathematics; Algorithm; Artificial intelligence; Statistics","score_opus":0.1251349721004983,"score_gpt":0.4507296444040477,"score_spread":0.32559467230354944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038708756","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.019507362,0.00018698638,0.886681,0.08839652,0.0007580216,0.003040204,0.00061986654,0.00008345918,0.0007265331],"genre_scores_gemma":[0.25252867,0.00021539131,0.63963884,0.0029191112,0.008696177,0.015276403,0.0010192314,0.00033570363,0.07937045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931927,0.0005494282,0.00064102677,0.00078372983,0.0037536677,0.0010794526],"domain_scores_gemma":[0.9902147,0.0050682,0.00006300419,0.001965994,0.0024076118,0.0002804548],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012925675,0.00018839873,0.00022431303,0.00035962174,0.0040253378,0.002399697,0.003196973,0.000111067,0.0007965566],"category_scores_gemma":[0.020871375,0.00012047454,0.00016148492,0.0020197225,0.0011420494,0.0011605341,0.0007830408,0.0015447652,0.00038856594],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002558434,0.00014763496,0.00032289154,0.000009957242,0.000058057216,0.000011071519,0.0007188559,0.023228474,0.019636676,0.0040050554,0.55429035,0.39754537],"study_design_scores_gemma":[0.0006310006,0.000077931385,0.00029368242,0.000012500807,0.000004217321,0.000013517833,0.0012551787,0.6393008,0.0019420818,0.0038224305,0.352458,0.000188611],"about_ca_topic_score_codex":0.0003954232,"about_ca_topic_score_gemma":0.001255929,"teacher_disagreement_score":0.61607236,"about_ca_system_score_codex":0.00017710643,"about_ca_system_score_gemma":0.00045548525,"threshold_uncertainty_score":0.9986359},"labels":[],"label_agreement":null},{"id":"W2041485345","doi":"10.1016/j.orl.2005.01.009","title":"The multiple TSP with time windows: vehicle bounds based on precedence graphs","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorics; Traveling purchaser problem; Mathematics; Computer science; Similarity (geometry); Mathematical optimization; 2-opt; Routing (electronic design automation); Artificial intelligence","score_opus":0.025797792919006197,"score_gpt":0.3082450610410842,"score_spread":0.282447268122078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041485345","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.81089646,0.00010429926,0.1385361,0.039702065,0.00015020277,0.0016109704,0.00002975057,0.0007958612,0.008174285],"genre_scores_gemma":[0.9476478,0.000016563157,0.05068595,0.00064416917,0.000110834604,0.0002085554,0.000016987187,0.0000562481,0.0006128723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980717,0.00039778606,0.00018676442,0.00022999286,0.0006229552,0.00049082836],"domain_scores_gemma":[0.9983967,0.0007968874,0.000008530838,0.0005230504,0.00016530082,0.00010956292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013766937,0.00013516344,0.000095743344,0.00019386462,0.0010602142,0.00047449642,0.00035346334,0.00004877028,0.00009443751],"category_scores_gemma":[0.0003743923,0.000099333025,0.00003411314,0.0007578642,0.00021179646,0.00026130624,0.000028478195,0.00049764034,0.00026852702],"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.00001952618,0.00002178082,0.0003249563,0.000004384004,0.000013958905,0.000001745787,0.00015805835,0.96562976,0.026682328,0.00008644521,0.004226022,0.0028310071],"study_design_scores_gemma":[0.00041437955,0.000059069618,0.00076930795,0.000028075505,0.0000027996412,0.0000015661957,0.000030595624,0.9840193,0.007808084,0.0000021604585,0.006733983,0.00013072438],"about_ca_topic_score_codex":0.000031187912,"about_ca_topic_score_gemma":0.00016725439,"teacher_disagreement_score":0.13675134,"about_ca_system_score_codex":0.00017916839,"about_ca_system_score_gemma":0.00006583147,"threshold_uncertainty_score":0.81544185},"labels":[],"label_agreement":null},{"id":"W2042788891","doi":"10.1016/j.orl.2010.09.004","title":"Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"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 Waterloo","funders":"","keywords":"Steiner tree problem; Linear programming relaxation; Hypergraph; Mathematics; Upper and lower bounds; Combinatorics; Bounded function; Relaxation (psychology); Linear programming; Tree (set theory); Approximation algorithm; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.06305174887661538,"score_gpt":0.33851725168657865,"score_spread":0.2754655028099633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042788891","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.9697189,0.000023690203,0.02102113,0.008056075,0.0001821272,0.00044308678,0.00001554474,0.000012169803,0.00052727724],"genre_scores_gemma":[0.9880609,0.0000054687516,0.011645209,0.000088090404,0.00003246388,0.000046498535,0.000003819035,0.0000059611475,0.00011156901],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979404,0.0003603797,0.0003955873,0.00025718127,0.0008181876,0.00022821862],"domain_scores_gemma":[0.9980973,0.00017616109,0.00005038692,0.0010435642,0.00058287964,0.000049726434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015113722,0.00009244034,0.00017249645,0.00034971247,0.00025987963,0.00007856858,0.0012134846,0.0000591387,0.000037280002],"category_scores_gemma":[0.00040000706,0.00006369701,0.00014098026,0.0015433738,0.00091237033,0.0003916521,0.00031549297,0.0005479521,0.0000016668545],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017090731,0.00044430475,0.009196136,0.00007073665,0.00006632475,0.0000013710195,0.002399621,0.0020959822,0.7614553,0.2113337,0.0017270641,0.011192372],"study_design_scores_gemma":[0.0010729356,0.00048216782,0.11792301,0.00033950724,0.000032673892,0.000028427368,0.0005639892,0.36539742,0.49634233,0.013579608,0.0036954195,0.0005425209],"about_ca_topic_score_codex":0.00077762746,"about_ca_topic_score_gemma":0.00195786,"teacher_disagreement_score":0.36330143,"about_ca_system_score_codex":0.000019638604,"about_ca_system_score_gemma":0.00018564347,"threshold_uncertainty_score":0.33616665},"labels":[],"label_agreement":null},{"id":"W2051229026","doi":"10.1016/j.orl.2013.04.011","title":"Network design with a discrete set of traffic matrices","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Variety (cybernetics); Set (abstract data type); Scheme (mathematics); Time complexity; Computer science; Approximation algorithm; Network planning and design; Computational complexity theory; Polynomial; Mathematical optimization; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.07737951602445946,"score_gpt":0.3222089761203714,"score_spread":0.24482946009591194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051229026","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.09799498,0.0000885107,0.88216066,0.018869638,0.000053338546,0.0006110819,0.0000030994452,0.000058226437,0.00016046844],"genre_scores_gemma":[0.57613957,0.000018526473,0.42301664,0.00040518306,0.000114471404,0.00017901513,0.0000049244427,0.00000871306,0.00011295984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823475,0.00037603235,0.00016758668,0.0002686421,0.00054674235,0.00040624975],"domain_scores_gemma":[0.9989115,0.00026742576,0.000016666974,0.0004985426,0.00021598402,0.00008986922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261967,0.000088524124,0.00011498201,0.000205989,0.0004395232,0.00048183525,0.0008817388,0.000024305586,0.00007730811],"category_scores_gemma":[0.00003083768,0.00006639583,0.000030864627,0.0013625904,0.00024886007,0.0007403022,0.0001679047,0.00023453432,0.00007418875],"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.000007086809,0.000031487576,0.000040970976,0.000013467749,0.000029280603,0.00001029317,0.0008771527,0.94759524,0.0014931594,0.011245409,0.029344946,0.009311496],"study_design_scores_gemma":[0.0002443909,0.00025184662,0.0005083938,0.00004785057,0.0000027087563,0.000010913235,0.00009103047,0.9965477,0.00039280043,0.00062802597,0.0011146669,0.00015966722],"about_ca_topic_score_codex":0.00021358242,"about_ca_topic_score_gemma":0.00005340626,"teacher_disagreement_score":0.47814456,"about_ca_system_score_codex":0.00002315143,"about_ca_system_score_gemma":0.00008887121,"threshold_uncertainty_score":0.46463484},"labels":[],"label_agreement":null},{"id":"W2054151210","doi":"10.1016/j.orl.2004.11.011","title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematical optimization; Node (physics); Computer science; Algorithm; Longest path problem; K shortest path routing; Repetition (rhetorical device); Widest path problem; Mathematics; Theoretical computer science; Graph","score_opus":0.07945066765209823,"score_gpt":0.36972095527867616,"score_spread":0.2902702876265779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054151210","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.055941127,0.0002675346,0.87473947,0.06303556,0.00012623152,0.0033003408,0.00017811473,0.0006403624,0.0017712681],"genre_scores_gemma":[0.18241856,0.000045275578,0.813144,0.002030786,0.00065284665,0.00090880453,0.00024063983,0.0001026854,0.00045638715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981119,0.00027166246,0.00035479674,0.0002609044,0.00040221895,0.00059853686],"domain_scores_gemma":[0.99859846,0.0007253788,0.000013164495,0.00033594278,0.00023111457,0.00009595731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025684661,0.00015514581,0.00012493688,0.00016370951,0.0009643737,0.00038704093,0.00035566223,0.000059846334,0.00013329738],"category_scores_gemma":[0.00023871331,0.00012997651,0.000040839266,0.0006025989,0.0001386273,0.0002716691,0.000063909356,0.0004876012,0.000024828052],"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.000004202593,0.000019597524,0.00005605896,0.000011637857,0.0000528439,0.0000015457151,0.00040255682,0.89926493,0.034566633,0.00015188575,0.022309916,0.04315817],"study_design_scores_gemma":[0.0005328845,0.000026024325,0.000061105886,0.000022111968,0.000010268992,0.000005410705,0.00031089422,0.9639624,0.0037843436,0.0000032119417,0.031130971,0.00015040475],"about_ca_topic_score_codex":0.000033962675,"about_ca_topic_score_gemma":0.00004965158,"teacher_disagreement_score":0.12647744,"about_ca_system_score_codex":0.00019453451,"about_ca_system_score_gemma":0.00006819993,"threshold_uncertainty_score":0.741728},"labels":[],"label_agreement":null},{"id":"W2060240953","doi":"10.1016/j.orl.2003.09.006","title":"Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Bernoulli's principle; Queue; Queueing theory; Random variable; Service (business); Bulk queue; Computer science; Bernoulli trial; Applied mathematics; Burke's theorem; Discrete time and continuous time; Variable (mathematics); Mathematics; Mathematical optimization; Queue management system; Statistics; Physics; Computer network; Fork–join queue; Mathematical analysis","score_opus":0.025128764168466117,"score_gpt":0.30822822908588654,"score_spread":0.28309946491742044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060240953","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.9418885,0.00001816159,0.0034034713,0.051865496,0.000050041148,0.00030434073,0.000011114345,0.000050073017,0.0024088195],"genre_scores_gemma":[0.9936585,0.0000031696056,0.00036278748,0.0050738207,0.00023296158,0.000047992693,0.0000812504,0.000022561542,0.00051695417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981819,0.00010003523,0.00031224883,0.00033123943,0.00069793226,0.00037666308],"domain_scores_gemma":[0.99846745,0.000106088235,0.000063842024,0.0008093207,0.00053519645,0.000018126868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153311,0.00013631643,0.00025127034,0.0009554425,0.0007918926,0.00032161118,0.0007685824,0.000044409797,0.0006477407],"category_scores_gemma":[0.00053848576,0.00010011149,0.00022274496,0.0073539964,0.00023924024,0.00093222625,0.00037451374,0.00030976854,0.00046320577],"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.000013771461,0.000056605488,0.0007313627,0.000019024259,0.0004138632,0.0000030949136,0.00013103156,0.9401326,0.041037727,0.01698232,0.00037492503,0.0001036492],"study_design_scores_gemma":[0.0018347838,0.000027741502,0.0241969,0.00023436126,0.003243978,0.0000022458407,0.001404992,0.92592,0.006437783,0.007642614,0.027892178,0.0011624206],"about_ca_topic_score_codex":0.0051034987,"about_ca_topic_score_gemma":0.003708448,"teacher_disagreement_score":0.05177002,"about_ca_system_score_codex":0.00012237606,"about_ca_system_score_gemma":0.000053444353,"threshold_uncertainty_score":0.77149975},"labels":[],"label_agreement":null},{"id":"W2065245021","doi":"10.1016/j.orl.2010.06.001","title":"A note on demand functions with uncertainty","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"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 British Columbia","funders":"","keywords":"Multiplicative function; Mathematical optimization; Utility maximization; Maximization; Mathematical economics; Demand curve; On demand; Inverse demand function; Utility maximization problem; Mathematics; Economics; Computer science; Econometrics; Microeconomics","score_opus":0.03633866740808209,"score_gpt":0.2979967812589659,"score_spread":0.2616581138508838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065245021","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.8641895,0.0000037647517,0.002537366,0.06156839,0.0005650753,0.00078206667,0.0000045694546,0.0001338544,0.070215404],"genre_scores_gemma":[0.98502594,0.0000015936496,0.00028152522,0.010145761,0.0012828516,0.00021781062,0.00007025265,0.000024728382,0.0029495305],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985634,0.00002865661,0.0001314203,0.0003125703,0.00057685183,0.0003870708],"domain_scores_gemma":[0.9992603,0.000055639845,0.00001498619,0.00042097186,0.00022185621,0.000026235652],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007669533,0.00012385762,0.00008865103,0.00053270266,0.0009510545,0.00077688415,0.0002586743,0.000037455444,0.0014568564],"category_scores_gemma":[0.0001516675,0.00009467433,0.0000373877,0.0007041457,0.00019825088,0.0006767571,0.0001050519,0.00053242664,0.0019458155],"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.00022943805,0.000544906,0.003814578,0.00009954669,0.000105074665,0.000081392354,0.00026051857,0.14447963,0.05970999,0.16016236,0.6234542,0.0070583792],"study_design_scores_gemma":[0.00077166996,0.0000521336,0.0024312988,0.000029821693,0.00001704987,0.0000017938584,0.00033973847,0.0627006,0.00015623929,0.00010638713,0.93313557,0.00025770377],"about_ca_topic_score_codex":0.0009473791,"about_ca_topic_score_gemma":0.00417267,"teacher_disagreement_score":0.3096814,"about_ca_system_score_codex":0.000045953366,"about_ca_system_score_gemma":0.0000317834,"threshold_uncertainty_score":0.9994559},"labels":[],"label_agreement":null},{"id":"W2080259970","doi":"10.1016/j.orl.2009.09.002","title":"Bounds on the cleaning times of robot vacuums","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Protocol (science); Robot; Simple (philosophy); Enhanced Data Rates for GSM Evolution; Polynomial; Exponential function; Computer science; Mathematics; Combinatorics; Artificial intelligence; Medicine; Mathematical analysis; Pathology; Philosophy","score_opus":0.0580586038922692,"score_gpt":0.3224082306799817,"score_spread":0.2643496267877125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080259970","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.85893375,0.0002193757,0.063402556,0.042827915,0.00020247605,0.0006184606,0.000008160942,0.00014573343,0.033641595],"genre_scores_gemma":[0.9981509,0.000043679196,0.00077590067,0.0005899719,0.00006449009,0.00001340488,0.0000038712415,0.000010269925,0.00034750646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999147,0.000073150164,0.00013322885,0.00010267403,0.0003163452,0.00022760779],"domain_scores_gemma":[0.9995174,0.00009001864,0.0000035916473,0.00028875528,0.00006348455,0.00003676492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045229192,0.00006724694,0.00007168419,0.00010840347,0.00024015507,0.000110026755,0.00024147231,0.000024990555,0.00035129226],"category_scores_gemma":[0.0000693784,0.000046805948,0.00003161567,0.00026133502,0.0000676018,0.00008561211,0.000014933643,0.00028923783,0.00012149145],"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.0000025660522,0.000016776563,0.0000079346455,0.0000039417896,0.000012672189,0.00000313289,0.0003951457,0.8255915,0.12908307,0.021736793,0.0179031,0.0052433657],"study_design_scores_gemma":[0.00015644688,0.0002793956,0.0017112701,0.00010834632,0.0000061385317,0.0000059389026,0.00039037084,0.74598444,0.23997241,0.00050738995,0.010582286,0.0002955588],"about_ca_topic_score_codex":0.000034151988,"about_ca_topic_score_gemma":0.000015133193,"teacher_disagreement_score":0.13921718,"about_ca_system_score_codex":0.000039281615,"about_ca_system_score_gemma":0.000013708154,"threshold_uncertainty_score":0.3846404},"labels":[],"label_agreement":null},{"id":"W2083670109","doi":"10.1016/j.orl.2011.11.009","title":"Impact of discounting and competition on benefit of decentralization with strategic customers","year":2011,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":16,"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 British Columbia","funders":"University of International Business and Economics","keywords":"Discounting; Decentralization; Profit (economics); Competition (biology); Business; Microeconomics; Industrial organization; Channel (broadcasting); Decentralised system; Marketing; Economics; Computer science; Finance; Market economy; Telecommunications","score_opus":0.0806537895905129,"score_gpt":0.29148295849139305,"score_spread":0.21082916890088016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083670109","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.98316175,0.000002695491,0.000052955314,0.00007196073,0.000012815082,0.00014387823,0.000004215432,0.000006259839,0.016543454],"genre_scores_gemma":[0.9997272,0.0000067260344,0.00008753446,0.00006272985,0.000036520672,0.000005555175,0.000051670435,0.0000088405195,0.00001322465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99944204,0.0000014600636,0.00015006993,0.00010945415,0.00014330611,0.00015368982],"domain_scores_gemma":[0.9996971,0.0000116381725,0.000043081687,0.000095783624,0.00014154227,0.000010852428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019623745,0.00006345906,0.0000928192,0.0002485656,0.000104662286,0.00022263285,0.00006993257,0.000017481696,0.000093219445],"category_scores_gemma":[0.000012491385,0.000047105113,0.000023490476,0.0002409692,0.0001136567,0.0020126868,0.000027928103,0.00006338402,0.000012688118],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020391814,0.00025312413,0.081930004,0.0001435282,0.000089123016,0.0000030042088,0.0002761142,0.06078773,0.006789742,0.84828967,0.000109201486,0.001124814],"study_design_scores_gemma":[0.0042473236,0.0011685645,0.8068237,0.0009079192,0.0001037386,0.0000084254325,0.00965578,0.15874404,0.0034480824,0.013455033,0.0002579786,0.0011794432],"about_ca_topic_score_codex":0.0023078949,"about_ca_topic_score_gemma":0.0004919912,"teacher_disagreement_score":0.83483464,"about_ca_system_score_codex":0.000026762618,"about_ca_system_score_gemma":0.0000186487,"threshold_uncertainty_score":0.34888622},"labels":[],"label_agreement":null},{"id":"W2086959235","doi":"10.1016/j.orl.2012.01.011","title":"Model of transfer tax on transboundary water pollution in China’s river basin","year":2012,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Local Government Finance and Decentralization","field":"Social Sciences","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Stackelberg competition; Pollution; Tax rate; Pollutant; China; Environmental science; Drainage basin; Structural basin; Water pollution; Water transfer; Environmental tax; Reduction (mathematics); Water resource management; Economics; Tax reform; Geography; Geology; Microeconomics; Mathematics; Public economics; Chemistry; Ecology","score_opus":0.06665134195146924,"score_gpt":0.3497308808681951,"score_spread":0.2830795389167259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086959235","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.95962965,0.000014251963,0.009638822,0.026318936,0.000067036206,0.00033632576,0.000028973509,0.000009036943,0.0039569465],"genre_scores_gemma":[0.998189,0.00009980321,0.00018778628,0.00080447306,0.00007621812,0.000031253294,0.000020802485,0.000007064455,0.0005835986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980987,0.00036574109,0.00016224029,0.00012617088,0.0007716811,0.0004755195],"domain_scores_gemma":[0.99974227,0.000017844628,0.0000036573565,0.00011308496,0.00004713298,0.00007600936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012662238,0.000060730858,0.00008519852,0.00015217155,0.00041390595,0.000050205454,0.00012744252,0.000061310355,0.0002031339],"category_scores_gemma":[0.0000466145,0.00004868841,0.00003775125,0.00029323297,0.0003448251,0.00065655314,0.000008923701,0.0001731208,0.00003653245],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022001985,0.0009257983,0.010427133,0.000035545512,0.000023913643,0.0000035797957,0.22378385,0.3068974,0.20072281,0.24330114,0.010023153,0.0036356244],"study_design_scores_gemma":[0.008322194,0.0007375025,0.24497354,0.0005122693,0.00006411314,0.0000018914943,0.011465291,0.17768793,0.34418514,0.0031996858,0.20667818,0.0021722757],"about_ca_topic_score_codex":0.0055050906,"about_ca_topic_score_gemma":0.0025174422,"teacher_disagreement_score":0.24010146,"about_ca_system_score_codex":0.00026706126,"about_ca_system_score_gemma":0.000097620155,"threshold_uncertainty_score":0.83220863},"labels":[],"label_agreement":null},{"id":"W2088456596","doi":"10.1016/j.orl.2014.12.008","title":"A tight bound on the speed-up through storage for quickest multi-commodity flows","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Computer science; Speedup; Commodity; Parallel computing; Mathematics; Mathematical optimization; Simulation; Business; Mathematical analysis","score_opus":0.14718004806790977,"score_gpt":0.38045640621018106,"score_spread":0.2332763581422713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088456596","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.018410683,0.000009813156,0.8574906,0.121374145,0.0002960552,0.0012215157,0.000018933611,0.000070322596,0.0011079537],"genre_scores_gemma":[0.7341527,0.000060903894,0.22658615,0.028385486,0.0007670646,0.0011119017,0.00013368836,0.00007355413,0.008728599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971449,0.0008655532,0.00021875293,0.00045656948,0.00073815143,0.00057607185],"domain_scores_gemma":[0.9975804,0.00089644676,0.000018660654,0.0009978486,0.0003808529,0.00012575396],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002608342,0.00013699073,0.00012946186,0.00015365989,0.0018922443,0.0013618569,0.0013520274,0.000053815624,0.000073483556],"category_scores_gemma":[0.0008517723,0.00009483849,0.000074118376,0.0005961963,0.0002254182,0.00071606267,0.00024298119,0.00048240533,0.00034563174],"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.000024131004,0.00039594056,0.000023475297,0.00003323665,0.00004560646,0.0000049364676,0.006673654,0.30476066,0.016086688,0.41826752,0.24984697,0.0038371778],"study_design_scores_gemma":[0.0005347258,0.00011920851,0.000049360504,0.000014053067,0.0000010658466,0.0000012834554,0.000053052256,0.88096476,0.0010011243,0.00026591576,0.11687551,0.000119960896],"about_ca_topic_score_codex":0.00016267142,"about_ca_topic_score_gemma":0.00035902366,"teacher_disagreement_score":0.715742,"about_ca_system_score_codex":0.000120278535,"about_ca_system_score_gemma":0.00014037162,"threshold_uncertainty_score":0.9996748},"labels":[],"label_agreement":null},{"id":"W2089329646","doi":"10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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 British Columbia","funders":"","keywords":"Unimodular matrix; Oracle; Linear programming; Mathematics; Polynomial; Convergence (economics); Time complexity; Algorithm; Construct (python library); Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.07014629511236242,"score_gpt":0.3576475601690094,"score_spread":0.28750126505664697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329646","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.09720608,0.00012250204,0.86945266,0.030017942,0.00045849083,0.0024205968,0.00013389508,0.00013191752,0.00005591966],"genre_scores_gemma":[0.30119166,0.0000632624,0.6818416,0.004704678,0.0036871196,0.0029406713,0.00016732627,0.00008050328,0.005323182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972105,0.00015792709,0.0004146176,0.00072662084,0.0004965003,0.0009938462],"domain_scores_gemma":[0.998297,0.00040291858,0.000031419517,0.0007126965,0.00035482322,0.00020119114],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011746817,0.00020601587,0.00023226073,0.00024531895,0.001784426,0.0010253702,0.0011717693,0.000102055405,0.000103727],"category_scores_gemma":[0.00012597571,0.00021190685,0.00018184968,0.00062478083,0.00022998828,0.00056078995,0.00014974075,0.00039464625,0.000030702766],"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.0003622126,0.0003754763,0.000050248367,0.00006122686,0.00015228303,0.000010809471,0.0022643148,0.30903888,0.0139826555,0.002043738,0.2178665,0.45379168],"study_design_scores_gemma":[0.00080030545,0.00024226942,0.000032691798,0.0000213352,0.0000059039335,0.0000032908217,0.000046548437,0.83615035,0.0027599707,0.000013480269,0.15969573,0.00022811991],"about_ca_topic_score_codex":0.0007700888,"about_ca_topic_score_gemma":0.0004151894,"teacher_disagreement_score":0.5271115,"about_ca_system_score_codex":0.00014657022,"about_ca_system_score_gemma":0.00035972215,"threshold_uncertainty_score":0.9995151},"labels":[],"label_agreement":null},{"id":"W2089509243","doi":"10.1016/j.orl.2007.03.005","title":"New formulations and valid inequalities for a bilevel pricing problem","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fédération Wallonie-Bruxelles","keywords":"Bilevel optimization; Toll; Commodity; Mathematical optimization; Computer science; Revenue; Inequality; Mathematical economics; Flow network; Operations research; Revenue management; Mathematics; Optimization problem; Economics","score_opus":0.135590153453481,"score_gpt":0.43403059732770183,"score_spread":0.29844044387422086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089509243","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.14052278,0.00003294153,0.8419759,0.013874303,0.000057312667,0.00080168055,0.000014136961,0.0000649325,0.0026560077],"genre_scores_gemma":[0.7881468,0.000027435219,0.20710367,0.00041712204,0.00025708377,0.000070783004,0.00008593831,0.000012583999,0.0038785764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989197,0.00008807537,0.00018418864,0.00014701764,0.0003442883,0.00031673288],"domain_scores_gemma":[0.9991706,0.0004205922,0.000013505571,0.000071766284,0.00019998233,0.00012357974],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002206722,0.00005061088,0.00006068186,0.00025495558,0.0015752397,0.00024031989,0.00007944608,0.00004486449,0.00003757251],"category_scores_gemma":[0.00026989885,0.000050570263,0.000019791642,0.0004198059,0.000082005514,0.00040166048,0.000006869038,0.000101147314,0.00000346464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060476523,0.00005820463,0.010398581,0.00006125384,0.000040989893,0.000003319136,0.16141202,0.10166191,0.009245742,0.6733068,0.018121468,0.025629206],"study_design_scores_gemma":[0.0071683275,0.00068211264,0.09479328,0.0005697243,0.00011864414,0.0000074378204,0.09589564,0.065791406,0.0059622303,0.020997932,0.70582783,0.0021854197],"about_ca_topic_score_codex":0.0038901404,"about_ca_topic_score_gemma":0.0090127885,"teacher_disagreement_score":0.68770635,"about_ca_system_score_codex":0.000066589804,"about_ca_system_score_gemma":0.00022807081,"threshold_uncertainty_score":0.99972457},"labels":[],"label_agreement":null},{"id":"W2090915089","doi":"10.1016/j.orl.2013.07.007","title":"Routing vehicles to minimize fuel consumption","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"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 Lethbridge","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Routing (electronic design automation); Generalization; Heuristic; Fuel efficiency; Mathematical optimization; Computer science; Mathematics; Engineering; Computer network","score_opus":0.06715273491549184,"score_gpt":0.35207197887978303,"score_spread":0.2849192439642912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090915089","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.7570183,0.000044776272,0.23314957,0.007304347,0.00016408005,0.0006805596,0.000005954839,0.0003464286,0.0012859469],"genre_scores_gemma":[0.77720743,0.000028200035,0.22117876,0.0007214608,0.00014077376,0.00031312078,0.00001640673,0.000047757836,0.00034606727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998293,0.0003024748,0.0002654884,0.00023498133,0.00040012022,0.0005039375],"domain_scores_gemma":[0.9989981,0.00024035852,0.00000600058,0.00032987932,0.00023159092,0.00019408726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009555464,0.00012298417,0.00012263533,0.00033910217,0.0003148791,0.00045512567,0.00023521128,0.000061974024,0.00057149254],"category_scores_gemma":[0.0004613044,0.00012988126,0.000033216886,0.0005506955,0.00007024899,0.00038946874,0.00007488134,0.0003496872,0.002356117],"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.0000014120777,0.000009878772,0.0010980695,0.000021172367,0.000014514699,0.0000016272963,0.0005877264,0.7821255,0.20061961,0.00021878244,0.011264186,0.00403755],"study_design_scores_gemma":[0.00027432854,0.000014939652,0.0125053665,0.00004114949,0.0000036460813,0.000004319889,0.00020125798,0.97772545,0.007406302,0.000015215938,0.0015685466,0.0002394896],"about_ca_topic_score_codex":0.00014244716,"about_ca_topic_score_gemma":0.000020558075,"teacher_disagreement_score":0.19559997,"about_ca_system_score_codex":0.00016879305,"about_ca_system_score_gemma":0.000023188903,"threshold_uncertainty_score":0.99842066},"labels":[],"label_agreement":null},{"id":"W2092197733","doi":"10.1016/s0167-6377(02)00126-8","title":"Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Bulk queue; Constant (computer programming); Real-time computing; Mathematics; Mathematical optimization; Computer network","score_opus":0.02083138433353086,"score_gpt":0.25906677893165786,"score_spread":0.238235394598127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092197733","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.99090713,0.00003990572,0.0027081517,0.004700666,0.000026911901,0.0005961035,0.000049861483,0.00013133245,0.0008399211],"genre_scores_gemma":[0.99806744,0.0000022102124,0.00023851384,0.00031471482,0.00013599485,0.00006581632,0.00029491933,0.00003343952,0.0008469626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982519,0.0001519629,0.00035310243,0.0003833325,0.00047135932,0.00038834836],"domain_scores_gemma":[0.9987184,0.0002102687,0.00009522501,0.00039180298,0.00054891995,0.000035376477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007620191,0.0001881643,0.00028740847,0.0002780212,0.0006194923,0.00036105694,0.00025873535,0.00006066704,0.00047577274],"category_scores_gemma":[0.00031858368,0.00015901065,0.00004643353,0.0010660106,0.00022657128,0.0010540012,0.00012879838,0.00024662865,0.00093152956],"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.0006073606,0.0006042984,0.002558227,0.0031129743,0.0010838624,0.00040012423,0.0012378154,0.71793795,0.22318827,0.029932661,0.016891047,0.002445441],"study_design_scores_gemma":[0.0005273085,0.000024151685,0.00016865811,0.0003485256,0.00009926757,0.0000071006034,0.00024235027,0.997346,0.00022230994,0.00002239643,0.0007802181,0.00021173566],"about_ca_topic_score_codex":0.0005823338,"about_ca_topic_score_gemma":0.00009837894,"teacher_disagreement_score":0.27940807,"about_ca_system_score_codex":0.000099037534,"about_ca_system_score_gemma":0.000013647496,"threshold_uncertainty_score":0.99984634},"labels":[],"label_agreement":null},{"id":"W2095553101","doi":"10.1016/j.orl.2006.03.014","title":"A list heuristic for vertex cover","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Heuristic; Cover (algebra); Sequence (biology); Degree (music); Mathematics; Approximation algorithm; Order (exchange); Discrete mathematics; Mathematical optimization; Graph; Physics","score_opus":0.051379162552689324,"score_gpt":0.35267193164324034,"score_spread":0.301292769090551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095553101","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.0046898853,0.000028612249,0.9545683,0.035899356,0.0001240596,0.0006738988,0.000012936346,0.000085282925,0.003917651],"genre_scores_gemma":[0.80389905,0.000021984431,0.1746785,0.004239854,0.00027367176,0.00075585063,0.00013038487,0.00003127751,0.015969412],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983925,0.00017878148,0.00017554239,0.00031702462,0.0004954627,0.0004406872],"domain_scores_gemma":[0.9988736,0.0002369567,0.000008137975,0.00041953672,0.0003732904,0.000088510584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079077383,0.000077164186,0.00008163972,0.00024238476,0.00068545353,0.0009095464,0.00061242626,0.00003212672,0.000105630104],"category_scores_gemma":[0.00022886187,0.00007198337,0.00004446897,0.00061444484,0.00011214147,0.00052992604,0.00013294841,0.00017726062,0.00025886923],"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.000007970447,0.00014683834,0.00007646306,0.000021480351,0.0000112800935,0.000011153533,0.00025274057,0.1894481,0.019003937,0.30967963,0.4799956,0.0013447889],"study_design_scores_gemma":[0.00045453195,0.00006488632,0.00020970209,0.000009704652,0.0000010124297,0.0000033677186,0.000009644294,0.9215925,0.000603679,0.00083076494,0.07609924,0.00012100723],"about_ca_topic_score_codex":0.000322417,"about_ca_topic_score_gemma":0.00011453895,"teacher_disagreement_score":0.7992092,"about_ca_system_score_codex":0.00008920071,"about_ca_system_score_gemma":0.00014184722,"threshold_uncertainty_score":0.87707764},"labels":[],"label_agreement":null},{"id":"W2145798290","doi":"10.1016/j.orl.2013.09.008","title":"A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","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":"University of Toronto","funders":"","keywords":"Laplace transform; Queue; Poisson distribution; Class (philosophy); Mathematical optimization; Computer science; First-hitting-time model; Lévy process; Process (computing); Queueing theory; Priority queue; Mathematics; Applied mathematics; Mathematical analysis; Computer network; Statistics","score_opus":0.012512005975808241,"score_gpt":0.29076447427547286,"score_spread":0.2782524682996646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145798290","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.7404039,0.00006799701,0.10457753,0.1460027,0.000020853857,0.0074317283,0.00003194468,0.00018819117,0.0012751962],"genre_scores_gemma":[0.9877414,0.000008593544,0.0054179123,0.0026064334,0.00022825979,0.0027807273,0.00011118914,0.000035085603,0.001070396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987485,0.00003245241,0.0001847965,0.00040812072,0.0002599924,0.00036614298],"domain_scores_gemma":[0.9987628,0.000160423,0.000031938307,0.00020278535,0.0008142128,0.000027883721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155963,0.00012924,0.00013979305,0.00036104128,0.00080343883,0.0006784982,0.00023023335,0.000037063608,0.00008166259],"category_scores_gemma":[0.00057601434,0.00012182809,0.000030421617,0.0009657159,0.000061625884,0.0015878848,0.00013172283,0.00015158487,0.00061826815],"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.00023605446,0.0005401772,0.00043357487,0.0019200427,0.00028964307,0.000010737865,0.0015557817,0.12755004,0.7587857,0.082158536,0.016971119,0.0095485505],"study_design_scores_gemma":[0.0007887194,0.00008498402,0.0019104122,0.00021442171,0.0000777871,0.000003186783,0.00030170503,0.96812195,0.0019999186,0.010427061,0.015379108,0.0006907429],"about_ca_topic_score_codex":0.00042930245,"about_ca_topic_score_gemma":0.0014713575,"teacher_disagreement_score":0.84057194,"about_ca_system_score_codex":0.00010719897,"about_ca_system_score_gemma":0.00003671486,"threshold_uncertainty_score":0.7946793},"labels":[],"label_agreement":null},{"id":"W2228632909","doi":"10.1016/j.orl.2016.02.011","title":"Fast Engset computation","year":2016,"lang":"en","type":"article","venue":"Operations Research Letters","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":"University of Waterloo","funders":"","keywords":"Fixed-point iteration; Uniqueness; Mathematics; Fixed point; Convergence (economics); Computation; Simple (philosophy); Queue; Applied mathematics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.04349622580139683,"score_gpt":0.3333929454138204,"score_spread":0.2898967196124236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228632909","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.7258557,0.0000112752,0.19384268,0.0729655,0.00014420047,0.00031516215,0.0000064597975,0.00017186753,0.006687162],"genre_scores_gemma":[0.9948945,0.0000034317482,0.0009935208,0.0024461,0.00064834923,0.000046797784,0.000031721906,0.00001852578,0.00091701874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.00006311537,0.00014992499,0.00023659597,0.0003737872,0.00029047063],"domain_scores_gemma":[0.9993236,0.00013753369,0.00001853397,0.000212168,0.0002951743,0.00001297659],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008716894,0.00008040048,0.00008400135,0.00046831122,0.00054052554,0.00032890585,0.00020530348,0.000023724977,0.0004958755],"category_scores_gemma":[0.00048261535,0.000056972527,0.00004149992,0.00070855964,0.00015505304,0.0015088951,0.00011751421,0.0001180718,0.002490409],"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.00006508682,0.00014038125,0.0016899494,0.0000474342,0.000099284276,0.00004060224,0.00015813606,0.19384325,0.45805454,0.19318618,0.07748123,0.075193934],"study_design_scores_gemma":[0.0042959754,0.00006588087,0.0062760804,0.0004438921,0.0001251378,0.000010833485,0.0014559769,0.47723722,0.007468464,0.033267256,0.46743482,0.0019184668],"about_ca_topic_score_codex":0.00014150587,"about_ca_topic_score_gemma":0.00015373927,"teacher_disagreement_score":0.45058608,"about_ca_system_score_codex":0.000071462004,"about_ca_system_score_gemma":0.000013429522,"threshold_uncertainty_score":0.99828625},"labels":[],"label_agreement":null},{"id":"W2236981052","doi":"10.1016/j.orl.2016.11.005","title":"Protection of flows under targeted attacks","year":2016,"lang":"en","type":"preprint","venue":"Operations Research Letters","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Interdiction; Robustness (evolution); Flow network; Computer science; Mathematical optimization; Robust optimization; Path (computing); Flow (mathematics); Adversary model; Optimization problem; Minimum-cost flow problem; Maximum flow problem; Class (philosophy); Routing (electronic design automation); Adversary; Distributed computing; Computer security; Mathematics; Algorithm; Artificial intelligence; Computer network; Engineering","score_opus":0.04228335718825012,"score_gpt":0.32668597290665896,"score_spread":0.28440261571840886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236981052","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.66890335,0.00011641699,0.322823,0.005526806,0.00036290422,0.00096694374,0.000095447474,0.00013146098,0.0010736574],"genre_scores_gemma":[0.9977872,0.00006960609,0.0012957442,0.00004278793,0.00025208326,0.00029647545,0.000060988517,0.000031507367,0.00016361786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806684,0.00027850934,0.00035792694,0.00032957716,0.00059442496,0.00037269894],"domain_scores_gemma":[0.99885345,0.00005877152,0.000015963355,0.0006638633,0.00033251723,0.000075448916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104303,0.00018233924,0.00026557973,0.0005584097,0.00021210356,0.00011411167,0.0003524838,0.00023614771,0.0005870807],"category_scores_gemma":[0.00013542996,0.00014814612,0.00014170726,0.0004196041,0.00018607201,0.00016032206,0.00016753364,0.0010870575,0.000063364605],"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.0000035644557,0.0000084571775,0.000026444613,0.00011260365,0.00008595499,9.402321e-7,0.00009250959,0.75636476,0.2401777,0.00010589254,0.0018242041,0.0011969763],"study_design_scores_gemma":[0.00028358656,0.000045224922,0.0014557582,0.00029191538,0.000042043906,0.0000029693413,0.00014517763,0.88615054,0.10736646,0.0011277804,0.0025790709,0.00050945854],"about_ca_topic_score_codex":0.00021458945,"about_ca_topic_score_gemma":0.00029238308,"teacher_disagreement_score":0.3288838,"about_ca_system_score_codex":0.0003108274,"about_ca_system_score_gemma":0.00012101575,"threshold_uncertainty_score":0.64281225},"labels":[],"label_agreement":null},{"id":"W2527480274","doi":"10.1016/j.orl.2016.09.011","title":"An elementary integrality proof of Rothblum’s stable matching formulation","year":2016,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"University of Waterloo","funders":"","keywords":"Rounding; Elementary proof; Mathematical proof; Mathematics; Bipartite graph; Combinatorics; Hull; Combinatorial proof; Convex hull; Matching (statistics); Discrete mathematics; Regular polygon; Computer science; Graph","score_opus":0.08850971007240122,"score_gpt":0.3358788426814007,"score_spread":0.2473691326089995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527480274","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.9481545,0.000028815499,0.046847895,0.0031762845,0.00006848656,0.0003573457,0.00010883259,0.000015541546,0.001242278],"genre_scores_gemma":[0.9979933,0.0000043265427,0.001195166,0.00011181465,0.00007715542,0.000058276615,0.000024231242,0.000012668334,0.00052306266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987996,0.0001622212,0.00044736813,0.0002415587,0.00008321736,0.0002660062],"domain_scores_gemma":[0.99937147,0.00007848169,0.000055826447,0.0003595649,0.00007764558,0.000057034984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032973709,0.00006863306,0.0001593858,0.00025604814,0.00021617135,0.0000798494,0.00022084206,0.000035019053,0.0004900683],"category_scores_gemma":[0.00012021202,0.000056634377,0.000039464998,0.0002045211,0.00007446931,0.00075278146,0.000035456516,0.00011657287,0.0001021845],"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.000043449756,0.00020597836,0.034186404,0.000068613444,0.00005366141,0.0000013643726,0.002056029,0.004789926,0.20642297,0.74806553,0.0010145177,0.0030915486],"study_design_scores_gemma":[0.008197523,0.0022770527,0.100290366,0.0012329593,0.000025062081,0.000020506355,0.005965525,0.08162148,0.46814933,0.28542835,0.04412709,0.0026647653],"about_ca_topic_score_codex":0.0018384355,"about_ca_topic_score_gemma":0.00030491306,"teacher_disagreement_score":0.46263722,"about_ca_system_score_codex":0.00013329009,"about_ca_system_score_gemma":0.000020014033,"threshold_uncertainty_score":0.5365904},"labels":[],"label_agreement":null},{"id":"W2611782410","doi":"10.1016/j.orl.2019.03.013","title":"Strategic bilateral exchange of a bad","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Economics; Pareto optimal; Commodity; Microeconomics; Pareto principle; Mathematical economics; Scheme (mathematics); Computer science; Set (abstract data type); Mathematics; Operations management; Finance","score_opus":0.11588440354529453,"score_gpt":0.30507553661763714,"score_spread":0.18919113307234262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611782410","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.9570709,0.00021833502,0.0002894279,0.0031418302,0.00018081124,0.00028841753,0.000099246194,0.00000982768,0.038701206],"genre_scores_gemma":[0.99475384,0.00008002712,0.00042855318,0.0002757925,0.000070517635,0.00003671927,0.00002102353,0.00001505125,0.0043184794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990155,0.000033433542,0.0003428947,0.00026995302,0.000041047388,0.00029716265],"domain_scores_gemma":[0.99944913,0.000039885817,0.00003317482,0.00037417642,0.000046940924,0.000056691737],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008996677,0.00007355238,0.00020512009,0.00029524352,0.00009531577,0.00010048616,0.00023089058,0.000045636803,0.0031749264],"category_scores_gemma":[0.00002055976,0.00007970926,0.000062082,0.00019557789,0.00009300834,0.00026515505,0.000070911876,0.0001677225,0.0017583701],"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.000013283475,0.000045208046,0.0038813686,0.00003248478,0.00003207854,0.0000016250277,0.00072857586,0.007672066,0.0058534527,0.9804153,0.0012358188,0.000088731045],"study_design_scores_gemma":[0.009654133,0.0020458573,0.024472302,0.00026554236,0.000017848139,0.000036512225,0.004206778,0.41409615,0.011084129,0.25412118,0.27685556,0.0031440363],"about_ca_topic_score_codex":0.00082549185,"about_ca_topic_score_gemma":0.00008182768,"teacher_disagreement_score":0.72629416,"about_ca_system_score_codex":0.000072651565,"about_ca_system_score_gemma":0.000026841455,"threshold_uncertainty_score":0.99901885},"labels":[],"label_agreement":null},{"id":"W2739784970","doi":"10.1016/j.orl.2017.07.005","title":"The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers","year":2017,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 British Columbia","funders":"Government of Canada","keywords":"Class (philosophy); Queueing theory; Computer science; Poisson distribution; Queueing system; Mathematical optimization; Server; Routing (electronic design automation); Layered queueing network; Nash equilibrium; Operations research; Computer network; Mathematics; Statistics; Artificial intelligence","score_opus":0.08374648839579794,"score_gpt":0.3626902892683113,"score_spread":0.27894380087251336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739784970","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.9883465,0.000120382814,0.0019333292,0.005067658,0.00010844362,0.0008113781,0.0000037900243,0.00003695736,0.00357152],"genre_scores_gemma":[0.9974489,0.00002815455,0.0006108893,0.00008815426,0.00009876913,0.00009162694,0.000009028772,0.000025981552,0.0015984613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998154,0.0002157628,0.0003331742,0.00034359668,0.0005220596,0.00043143952],"domain_scores_gemma":[0.9982363,0.00024111169,0.00018073234,0.0008769966,0.00044496453,0.000019906247],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025758108,0.00015684932,0.00023588756,0.0003683431,0.002009648,0.0010547296,0.00072823366,0.000053535357,0.000009508896],"category_scores_gemma":[0.0008067817,0.000107181935,0.000057824447,0.0005103571,0.000704002,0.0028319259,0.00023558803,0.00054865127,0.00005311073],"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.00030054897,0.00030892022,0.033580605,0.0002785816,0.00031452507,0.00015329407,0.0007460966,0.63054585,0.014698172,0.3183145,0.00018767599,0.00057124306],"study_design_scores_gemma":[0.002828718,0.000034009052,0.014180749,0.00057408575,0.0000730245,0.0000023783762,0.012689534,0.96417475,0.00032607105,0.0003501669,0.0042215134,0.0005449907],"about_ca_topic_score_codex":0.0057312157,"about_ca_topic_score_gemma":0.010660065,"teacher_disagreement_score":0.33362892,"about_ca_system_score_codex":0.0001306821,"about_ca_system_score_gemma":0.00006931379,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W2745275603","doi":"10.1016/j.orl.2017.08.004","title":"Linear fractional approximations for master problems in column generation","year":2017,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Column (typography); Mathematics; Applied mathematics; Calculus (dental); Mathematical optimization; Computer science; Medicine; Geometry","score_opus":0.3870013463244872,"score_gpt":0.4904084144009487,"score_spread":0.1034070680764615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745275603","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.026609432,0.000011309296,0.9463024,0.022930523,0.00014474122,0.0028825921,0.00008394522,0.00004531403,0.0009897241],"genre_scores_gemma":[0.17157994,0.000051904768,0.8081537,0.0004138531,0.0010358073,0.0057305237,0.00037646262,0.00011131515,0.0125464965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758935,0.00024398195,0.00041642901,0.0004244342,0.0007921498,0.00053363346],"domain_scores_gemma":[0.997733,0.00044271856,0.00005739527,0.00078917376,0.0008632311,0.00011450057],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018927981,0.00013701458,0.00018000214,0.0004934149,0.0022018524,0.0007259386,0.0004978377,0.000099688834,0.00030483495],"category_scores_gemma":[0.0040294845,0.00014062211,0.00005949256,0.00028263227,0.00027558696,0.0011787987,0.00014907084,0.0005052533,0.00007780283],"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.00004774648,0.0007474069,0.0012055486,0.00021272471,0.00006692157,0.000009820165,0.0012977312,0.85164815,0.046297237,0.05590946,0.038439803,0.004117471],"study_design_scores_gemma":[0.0011359914,0.000052647723,0.00031550994,0.00003473035,0.0000033765039,0.0000036903716,0.00010636621,0.9850689,0.0010448468,0.003333486,0.008716008,0.00018441705],"about_ca_topic_score_codex":0.00010877513,"about_ca_topic_score_gemma":0.0014453141,"teacher_disagreement_score":0.14497052,"about_ca_system_score_codex":0.00029670182,"about_ca_system_score_gemma":0.00020053773,"threshold_uncertainty_score":0.99909717},"labels":[],"label_agreement":null},{"id":"W2751970538","doi":"10.1016/j.orl.2018.01.007","title":"On the complexity of instationary gas flows","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","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":"University of Waterloo","funders":"Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft","keywords":"Sequence (biology); Computer science; Biology","score_opus":0.1779869882226343,"score_gpt":0.37888232275254263,"score_spread":0.20089533452990832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751970538","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.16451678,0.000008028629,0.545798,0.27315652,0.00015205822,0.00075475854,0.000012495285,0.000064156535,0.01553716],"genre_scores_gemma":[0.94974387,0.000009872124,0.045961075,0.0038470842,0.00006846899,0.00006445556,0.00001076298,0.0000064356036,0.00028795243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981552,0.0005398931,0.00016412608,0.00020599658,0.0006896185,0.00024518897],"domain_scores_gemma":[0.9985375,0.00027551973,0.000012042219,0.0005573764,0.00055402314,0.00006356388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012317504,0.000058248996,0.000062907966,0.00020781766,0.0007610189,0.00021897191,0.0008355007,0.000019607616,0.00032550236],"category_scores_gemma":[0.00034193083,0.000039935818,0.000026941045,0.00085180183,0.00085224374,0.00033134752,0.00020157141,0.00022480953,0.00033140203],"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.000005667325,0.000069388974,0.000013428097,0.0000033035046,0.000008966633,0.0000015530896,0.001157304,0.017195174,0.008686944,0.94102377,0.030581143,0.0012533517],"study_design_scores_gemma":[0.00017587985,0.00018734779,0.00034287717,0.000016349617,4.4764e-7,0.0000018518201,0.00006583456,0.98531884,0.0035387522,0.00645438,0.003826023,0.000071399314],"about_ca_topic_score_codex":0.00009855181,"about_ca_topic_score_gemma":0.00012473275,"teacher_disagreement_score":0.9681237,"about_ca_system_score_codex":0.000041386025,"about_ca_system_score_gemma":0.0001320012,"threshold_uncertainty_score":0.5853219},"labels":[],"label_agreement":null},{"id":"W2760175348","doi":"10.1016/j.orl.2018.01.004","title":"Existence and uniqueness of optimal dynamic pricing and advertising controls without concavity","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Arrow; Profit (economics); Mathematical optimization; Mathematical economics; Goodwill; Dynamic pricing; Mathematics; Optimal control; Hamiltonian (control theory); Dynamic programming; Economics; Advertising; Computer science; Microeconomics; Business; Mathematical analysis","score_opus":0.04988785080288739,"score_gpt":0.3214098729123397,"score_spread":0.2715220221094523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760175348","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.97816944,0.00036149935,0.018013438,0.0016475152,0.00005122401,0.00025352024,0.00004474257,0.000008839739,0.0014497574],"genre_scores_gemma":[0.9942943,0.00015165994,0.0050321086,0.00022535522,0.000037044887,0.00002079954,0.0000036021977,0.00001194851,0.00022322247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906266,0.00004818889,0.00031466002,0.00029556424,0.000033315704,0.00024559753],"domain_scores_gemma":[0.9994963,0.00008840437,0.00004627202,0.00021123514,0.00008682703,0.00007098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010916973,0.00007907832,0.00023665742,0.00016887084,0.00031969475,0.00012962145,0.00011442633,0.00004254233,0.000039755378],"category_scores_gemma":[0.00013884454,0.00008707586,0.00002016261,0.00010860066,0.00066842156,0.00034023574,0.00010233462,0.00013479128,0.000011508802],"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.00010866159,0.00004967962,0.030037196,0.000086522916,0.00009790417,0.0000043045648,0.004054522,0.0021644768,0.0492863,0.91111743,0.00008424368,0.0029087747],"study_design_scores_gemma":[0.0039249794,0.00078491087,0.052292954,0.00023885626,0.000018271257,0.000048864185,0.0016322238,0.90707576,0.008709082,0.018261366,0.0060626385,0.00095007115],"about_ca_topic_score_codex":0.0007629182,"about_ca_topic_score_gemma":0.00020188425,"teacher_disagreement_score":0.9049113,"about_ca_system_score_codex":0.00006883616,"about_ca_system_score_gemma":0.000026229933,"threshold_uncertainty_score":0.35508505},"labels":[],"label_agreement":null},{"id":"W2889569267","doi":"10.1016/j.orl.2018.09.002","title":"On Eulerian orientations of even-degree hypercubes","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eulerian path; Hypercube; Degree (music); Orientation (vector space); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Undirected graph; Graph; Node (physics); Connectivity; Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence; Pure mathematics","score_opus":0.10560141980985446,"score_gpt":0.37061326968721553,"score_spread":0.26501184987736104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889569267","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.58090353,0.000014136063,0.3874746,0.013248286,0.0011737125,0.00042395244,0.000008450557,0.00006985713,0.016683467],"genre_scores_gemma":[0.99334174,0.0000026305247,0.00468878,0.00076595036,0.0003194072,0.000053791715,0.0000042087536,0.0000073206475,0.0008161794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984187,0.00032740014,0.00022861382,0.00026988136,0.00048366864,0.00027175524],"domain_scores_gemma":[0.99865943,0.00017015543,0.000015547148,0.0005556268,0.0005263021,0.00007293991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781027,0.00007288215,0.00009865221,0.0003158008,0.0005765646,0.0002380459,0.0005686752,0.000035365792,0.00018883937],"category_scores_gemma":[0.00017087364,0.00006239822,0.000043887478,0.00078227994,0.00020149608,0.000389108,0.00009913093,0.0001747661,0.00037742427],"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.000018116727,0.00016901629,0.000138392,0.000011644297,0.000047801193,0.000009631578,0.0044686305,0.009510938,0.0979623,0.7409645,0.14051783,0.0061812373],"study_design_scores_gemma":[0.0016407379,0.002826733,0.0059226975,0.00034480263,0.000009333933,0.000071163384,0.0014710637,0.8613174,0.05089345,0.0024397208,0.07224687,0.0008160401],"about_ca_topic_score_codex":0.00028945124,"about_ca_topic_score_gemma":0.00046939548,"teacher_disagreement_score":0.85180646,"about_ca_system_score_codex":0.000063295505,"about_ca_system_score_gemma":0.0000791813,"threshold_uncertainty_score":0.4851151},"labels":[],"label_agreement":null},{"id":"W2921838721","doi":"10.1016/j.orl.2019.03.003","title":"Double-sided matching queues: Priority and impatient customers","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"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 Toronto","funders":"","keywords":"Queue; Computer science; Poisson distribution; Priority queue; Patience; Matching (statistics); Queueing theory; Poisson process; Mathematical optimization; Computer network; Mathematics; Statistics","score_opus":0.031049150511296364,"score_gpt":0.3234884503273505,"score_spread":0.29243929981605415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921838721","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.9892272,0.000024995094,0.00031283704,0.0055554146,0.00010941591,0.00046057906,0.0000014022462,0.00007100626,0.004237155],"genre_scores_gemma":[0.9967359,0.000009682117,0.00031414127,0.0019134147,0.00026305323,0.000046617963,0.000032423002,0.000024123154,0.000660653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850315,0.0000614683,0.00020816707,0.00036265995,0.00046571353,0.00039884704],"domain_scores_gemma":[0.9992475,0.00011059394,0.00003181944,0.00036587293,0.00021917492,0.000025052137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012060507,0.0001288617,0.00016083336,0.0005438078,0.00058632996,0.0006802799,0.0002280727,0.00003850968,0.0003043964],"category_scores_gemma":[0.0001409128,0.00011822655,0.00004912342,0.0007514597,0.00012868048,0.0017186173,0.00026611483,0.00035429373,0.0008763383],"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.0003389864,0.00019901474,0.010052715,0.0003376739,0.0002135009,0.000040412117,0.0019297728,0.5867139,0.16164398,0.22859545,0.0048698075,0.0050647613],"study_design_scores_gemma":[0.011219663,0.00014891443,0.009481997,0.0008963902,0.00029771516,0.000020208647,0.016235607,0.7125254,0.0046112086,0.013533938,0.22749196,0.0035369808],"about_ca_topic_score_codex":0.0020025235,"about_ca_topic_score_gemma":0.00042565516,"teacher_disagreement_score":0.22262216,"about_ca_system_score_codex":0.000097207965,"about_ca_system_score_gemma":0.000024842046,"threshold_uncertainty_score":0.9999016},"labels":[],"label_agreement":null},{"id":"W2955163350","doi":"10.1016/j.orl.2019.06.006","title":"Idealness and 2-resistant sets","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypercube; Unit cube; Combinatorics; Ideal (ethics); Cardinality (data modeling); Mathematics; Cube (algebra); Set (abstract data type); Regular polygon; Convex hull; Unit (ring theory); Discrete mathematics; Computer science; Geometry","score_opus":0.03179020033189318,"score_gpt":0.3315998570981613,"score_spread":0.29980965676626814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955163350","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.4440578,0.00005986665,0.4298738,0.12154017,0.00014292811,0.000415145,0.0000071713152,0.00008290065,0.0038202284],"genre_scores_gemma":[0.9712714,0.000017838725,0.025423339,0.0018409198,0.000023308066,0.000025015228,0.000014469949,0.000004923041,0.0013787888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988456,0.00017065805,0.00011524556,0.00025880238,0.00042545085,0.00018427675],"domain_scores_gemma":[0.9993135,0.00009429544,0.0000074796185,0.00031767008,0.0001911986,0.00007587661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875091,0.00005283585,0.000069919704,0.00024004815,0.0003018297,0.00053584186,0.00032237853,0.00002054981,0.00017519202],"category_scores_gemma":[0.00006151169,0.000045942874,0.000020347861,0.0006764206,0.00003837349,0.00054417347,0.00016297688,0.00011629999,0.0003086544],"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.0000072996418,0.00006155406,0.0017660272,0.000016423324,0.000050272327,0.000009014592,0.0007716898,0.11684619,0.046041705,0.82473934,0.0070210085,0.0026694704],"study_design_scores_gemma":[0.00025537622,0.000029273559,0.0075999764,0.0000065933255,0.0000020912491,0.000003019621,0.000049124203,0.9853701,0.00039334103,0.0003409564,0.0058309957,0.00011917939],"about_ca_topic_score_codex":0.00016550143,"about_ca_topic_score_gemma":0.000057504625,"teacher_disagreement_score":0.8685239,"about_ca_system_score_codex":0.00003604736,"about_ca_system_score_gemma":0.0000632781,"threshold_uncertainty_score":0.5167135},"labels":[],"label_agreement":null},{"id":"W2963290245","doi":"10.1016/j.orl.2018.10.003","title":"On the asymptotic behaviour of the Aragón Artacho–Campoy algorithm","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Saudi Arabian Cultural Bureau; Natural Sciences and Engineering Research Council of Canada; Saudi Arabia Cultural Bureau in London","keywords":"Hilbert space; Mathematics; Resolvent; Monotone polygon; Intersection (aeronautics); Generalization; Projection (relational algebra); Interpretation (philosophy); Algorithm; Regular polygon; Operator (biology); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.039232365579928506,"score_gpt":0.3265307217875624,"score_spread":0.2872983562076339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963290245","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.07805872,0.000007503732,0.72979707,0.18952988,0.00024500937,0.00041530878,0.0000122869915,0.000030484209,0.0019037542],"genre_scores_gemma":[0.9772897,0.0000039137485,0.016464127,0.004746348,0.00012500708,0.00004783448,0.000005137401,0.0000064116684,0.0013115214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816304,0.00046695996,0.00017432957,0.00021714353,0.00077750714,0.00020100457],"domain_scores_gemma":[0.99848163,0.0002593632,0.00002378603,0.00071207096,0.00047818816,0.000044970355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009331749,0.000067860965,0.0000688465,0.00015556125,0.00091305247,0.0002872247,0.0010656294,0.000026021744,0.000259179],"category_scores_gemma":[0.00029759257,0.00003706061,0.00006997783,0.001274153,0.0002489287,0.00021753514,0.00020129432,0.00022610197,0.00018984952],"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.0000052657506,0.00032557422,0.0010149941,0.0000033272559,0.000111271314,0.0000028666004,0.0020743597,0.09066581,0.006901285,0.8385921,0.055799622,0.004503498],"study_design_scores_gemma":[0.00013218525,0.00006009763,0.0072122808,0.00001314481,0.0000063218386,0.0000020104526,0.000044712553,0.9880514,0.0030138316,0.000553323,0.00083140854,0.00007928469],"about_ca_topic_score_codex":0.00014244486,"about_ca_topic_score_gemma":0.000070189104,"teacher_disagreement_score":0.89923096,"about_ca_system_score_codex":0.00004904591,"about_ca_system_score_gemma":0.000109967004,"threshold_uncertainty_score":0.70225537},"labels":[],"label_agreement":null},{"id":"W2975579666","doi":"10.1016/j.orl.2019.09.009","title":"Assortment optimization under the multinomial logit model with product synergies","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Cornell University","keywords":"Attractiveness; Mathematical optimization; Product (mathematics); Combinatorics; Treewidth; Computer science; Mathematics; Path (computing); Graph; Pathwidth","score_opus":0.05254429056906057,"score_gpt":0.2816712590283065,"score_spread":0.2291269684592459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975579666","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.7257272,0.000046683374,0.044490047,0.19475035,0.00046442158,0.00368708,0.000005503402,0.00019272078,0.030635975],"genre_scores_gemma":[0.9847753,0.00000800382,0.0018071018,0.0075862915,0.0006585232,0.0002763711,0.00010121101,0.00003162219,0.0047555706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844766,0.00004741773,0.00016117099,0.0003421172,0.000639596,0.00036205322],"domain_scores_gemma":[0.9992214,0.000033468343,0.00002709891,0.00046746174,0.00023895601,0.000011636842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008015704,0.00013100416,0.00009794851,0.00026030312,0.0005793553,0.0009080966,0.00034975776,0.00002192908,0.00049461564],"category_scores_gemma":[0.000044279303,0.00008240309,0.000034456596,0.00047724906,0.00013139685,0.0010520802,0.00021562168,0.00021280932,0.00048795564],"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.00002350705,0.000053586075,0.00043509633,0.00002275775,0.000031203635,0.0000016105226,0.000053061973,0.9570276,0.0011755453,0.012192158,0.028853644,0.0001302177],"study_design_scores_gemma":[0.00043155302,0.000013453835,0.00034583334,0.000016543536,0.00001278844,4.0182107e-7,0.00073297584,0.9812476,0.000075531214,0.000030131052,0.016951589,0.00014157321],"about_ca_topic_score_codex":0.00041446975,"about_ca_topic_score_gemma":0.00013844956,"teacher_disagreement_score":0.2590481,"about_ca_system_score_codex":0.000112505724,"about_ca_system_score_gemma":0.000041280513,"threshold_uncertainty_score":0.8756797},"labels":[],"label_agreement":null},{"id":"W3083184497","doi":"10.1016/j.orl.2020.08.014","title":"Sampling from the complement of a polyhedron: An MCMC algorithm for data augmentation","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complement (music); Sampling (signal processing); Algorithm; Polyhedron; Computer science; Markov chain Monte Carlo; Set (abstract data type); Pipeline (software); Boundary (topology); Data set; Artificial intelligence; Pattern recognition (psychology); Mathematics; Bayesian probability; Computer vision","score_opus":0.2966483137067856,"score_gpt":0.4570154344034947,"score_spread":0.16036712069670905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083184497","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.009333368,0.00003488161,0.8978763,0.09203846,0.00006656504,0.0003997523,0.00020659293,0.00003158352,0.000012473313],"genre_scores_gemma":[0.07886087,0.000008521875,0.91504425,0.004371295,0.00051841635,0.0000787175,0.0010869999,0.000012147366,0.000018804858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832237,0.0003406711,0.00020784474,0.0004058157,0.00049209985,0.00023120253],"domain_scores_gemma":[0.99860847,0.00036693036,0.000023898529,0.0007836791,0.00012523774,0.00009180479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070443,0.000072878145,0.00009430917,0.000045662695,0.0005667435,0.00039000507,0.0017612365,0.000015485404,0.00004230282],"category_scores_gemma":[0.00016435114,0.000055383072,0.00002463237,0.0003359041,0.00007059496,0.00054430065,0.0005104289,0.0002163825,0.0000124958415],"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.00001649413,0.0001469164,0.00032869383,0.000018722565,0.000100459336,0.0000038136245,0.009785055,0.03710837,0.052669555,0.006524995,0.027485205,0.8658117],"study_design_scores_gemma":[0.000323413,0.000114121496,0.00034209498,0.000008218022,0.0000034000936,4.5011188e-7,0.00027902803,0.9878913,0.00066246063,0.000045145367,0.010266246,0.000064085325],"about_ca_topic_score_codex":0.0018235634,"about_ca_topic_score_gemma":0.00011137921,"teacher_disagreement_score":0.95078295,"about_ca_system_score_codex":0.000023928113,"about_ca_system_score_gemma":0.00008658799,"threshold_uncertainty_score":0.43589902},"labels":[],"label_agreement":null},{"id":"W3097322038","doi":"10.1016/j.orl.2020.10.009","title":"A note on the Lasserre hierarchy for different formulations of the maximum independent set problem","year":2020,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Hierarchy; Mathematics; Set (abstract data type); Independent set; Combinatorics; Optimization problem; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.1664717190378425,"score_gpt":0.41683763501147447,"score_spread":0.250365915973632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097322038","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.09743655,0.000010556088,0.51268417,0.381645,0.000074270436,0.006737288,0.0003044162,0.0000650571,0.0010427327],"genre_scores_gemma":[0.9148577,0.000022738102,0.078120746,0.0032427162,0.00022898607,0.002215942,0.00006982061,0.00009620073,0.0011451704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970871,0.0005078935,0.0003831636,0.00031179405,0.0012524427,0.00045760884],"domain_scores_gemma":[0.99683326,0.0018168814,0.000049724244,0.0006181338,0.0005549249,0.00012705366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081594643,0.00015316262,0.00018181793,0.00014470112,0.0010126779,0.0001546705,0.000772512,0.00006362329,0.00016234057],"category_scores_gemma":[0.002768191,0.00008547871,0.00013141028,0.00079784275,0.0002496054,0.00016765749,0.00030368264,0.00072396913,0.000021025555],"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.00028105616,0.00059661263,0.00025570727,0.0003860896,0.00021947964,0.0000046347986,0.011376489,0.29300034,0.052702073,0.57148015,0.066178545,0.0035188312],"study_design_scores_gemma":[0.002311345,0.0005384068,0.00053578,0.00017896689,0.000035393317,0.0000042270917,0.0015012531,0.89473885,0.030924188,0.05528281,0.013508272,0.00044049762],"about_ca_topic_score_codex":0.000015166776,"about_ca_topic_score_gemma":0.00012743432,"teacher_disagreement_score":0.81742114,"about_ca_system_score_codex":0.0001635105,"about_ca_system_score_gemma":0.00016600611,"threshold_uncertainty_score":0.77888024},"labels":[],"label_agreement":null},{"id":"W3098638685","doi":"10.1016/j.orl.2021.06.013","title":"Saturating stable matchings","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Mathematics; Stable marriage problem; Graph; Stability (learning theory); Discrete mathematics; Computer science; Statistics","score_opus":0.10235703068210504,"score_gpt":0.3173001541598679,"score_spread":0.21494312347776284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098638685","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.9493022,0.00051526295,0.0044022086,0.013380933,0.00028459352,0.00015799014,0.000042275373,0.000040106876,0.03187441],"genre_scores_gemma":[0.9869319,0.00001699422,0.0021020884,0.0008526056,0.00018478202,0.00003690633,0.000029019644,0.000016983417,0.009828707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988001,0.00014598803,0.0003202086,0.000306953,0.000073917334,0.0003528226],"domain_scores_gemma":[0.99937403,0.00011288577,0.000024135365,0.000327025,0.000095377094,0.000066551715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020714477,0.00006998782,0.00015692446,0.00016039051,0.0005609375,0.0004664663,0.00016897895,0.000040398514,0.00090483483],"category_scores_gemma":[0.0005960043,0.00008087211,0.00004780079,0.00044707392,0.000060956678,0.0003067286,0.000077331635,0.00032987792,0.0017568434],"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.000004641438,0.00006279164,0.004077739,0.000040692026,0.000041625244,0.000038661357,0.0020912343,0.006316582,0.0460761,0.9288381,0.012156192,0.0002556935],"study_design_scores_gemma":[0.002834935,0.00019792591,0.0150318425,0.00042401254,0.0000112382595,0.00021583648,0.008759391,0.09112828,0.045003116,0.04771009,0.7865234,0.002159947],"about_ca_topic_score_codex":0.00048293313,"about_ca_topic_score_gemma":0.00010329865,"teacher_disagreement_score":0.88112795,"about_ca_system_score_codex":0.00008974347,"about_ca_system_score_gemma":0.00003835797,"threshold_uncertainty_score":0.9990204},"labels":[],"label_agreement":null},{"id":"W3131144142","doi":"10.1016/j.orl.2021.09.006","title":"Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid","year":2021,"lang":"en","type":"preprint","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Automatic summarization; Heuristics; Greedy algorithm; Computer science; Set function; Set (abstract data type); Mathematical optimization; Submodular set function; Weighted matroid; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Matroid partitioning; Graphic matroid","score_opus":0.0882885469965528,"score_gpt":0.33743894468261254,"score_spread":0.24915039768605973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131144142","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.5828646,0.0003492898,0.40404758,0.01034925,0.00064360956,0.0014004974,0.00018841351,0.00007251172,0.000084277155],"genre_scores_gemma":[0.5651955,0.0006946303,0.43111923,0.00072191627,0.00035722213,0.001253343,0.00027156604,0.000058328667,0.00032823946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996368,0.0003498237,0.0005607779,0.0011253395,0.0009469335,0.0006491172],"domain_scores_gemma":[0.9970078,0.00038898154,0.00006469979,0.0015488936,0.0008308684,0.00015877979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001554086,0.00033834096,0.0004969397,0.0009057279,0.0010863339,0.0007706512,0.0012484717,0.00019471113,0.000022290633],"category_scores_gemma":[0.00028661606,0.0003487289,0.0002683907,0.00077171915,0.0004559975,0.0005566284,0.0015407474,0.0010957691,0.000009147353],"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.00044541596,0.0032686042,0.0017031546,0.0069645643,0.0026914955,0.00037321332,0.024638513,0.39570734,0.19253276,0.035290956,0.035477083,0.3009069],"study_design_scores_gemma":[0.00065965095,0.00032096248,0.000672318,0.0006272516,0.000030583495,0.000033438686,0.00043823506,0.99151087,0.0030154774,0.00016208312,0.0020843379,0.00044479562],"about_ca_topic_score_codex":0.00021326054,"about_ca_topic_score_gemma":0.000078428915,"teacher_disagreement_score":0.5958035,"about_ca_system_score_codex":0.00012905667,"about_ca_system_score_gemma":0.00035334448,"threshold_uncertainty_score":0.99989647},"labels":[],"label_agreement":null},{"id":"W3168150448","doi":"10.1016/j.orl.2021.05.013","title":"Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 British Columbia","funders":"Program of Shanghai Subject Chief Scientist; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Sizing; Mathematical optimization; Heuristic; Dynamic programming; Computer science; Extension (predicate logic); Time horizon; Selection (genetic algorithm); Algorithm; Order (exchange); Mathematics; Artificial intelligence; Economics","score_opus":0.09766281410526081,"score_gpt":0.32387846076756704,"score_spread":0.22621564666230623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168150448","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.90524024,0.00015492106,0.004753396,0.082524784,0.0003543684,0.0009930977,0.00002930139,0.00018677425,0.005763091],"genre_scores_gemma":[0.970003,0.00001809567,0.020460984,0.0052243173,0.001174314,0.00010992419,0.00037081365,0.000042418484,0.0025961169],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826336,0.00007416266,0.00022094451,0.00048351393,0.000520212,0.00043779457],"domain_scores_gemma":[0.9992454,0.000030093961,0.000024137837,0.00026779898,0.00040001606,0.000032530927],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006083231,0.00015537108,0.00014968183,0.000278456,0.0012418858,0.0014698482,0.00016686246,0.00003611027,0.00052476017],"category_scores_gemma":[0.00011843438,0.00013431086,0.000031079886,0.00083479396,0.00029479677,0.001005185,0.0002607049,0.0003224586,0.00008959626],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014378886,0.0014419967,0.07970147,0.0020015056,0.0016427125,0.0021410885,0.0077850097,0.079958916,0.17806628,0.17169486,0.4324094,0.04171886],"study_design_scores_gemma":[0.004928208,0.00006224286,0.042928744,0.00011791962,0.000049970877,0.000063926695,0.005664261,0.64421695,0.0013073415,0.00012744057,0.29971623,0.0008167532],"about_ca_topic_score_codex":0.001053962,"about_ca_topic_score_gemma":0.002719008,"teacher_disagreement_score":0.56425804,"about_ca_system_score_codex":0.00009510509,"about_ca_system_score_gemma":0.000047535184,"threshold_uncertainty_score":0.99956673},"labels":[],"label_agreement":null},{"id":"W3179697346","doi":"10.1016/j.orl.2021.06.014","title":"Busy periods of discrete-time queues using the Lagrange implicit function theorem","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Bernoulli's principle; Mathematics; Discrete time and continuous time; Applied mathematics; Operator (biology); Notation; Bernoulli process; Generating function; Function (biology); Probability distribution; Discrete mathematics; Computer science; Statistics","score_opus":0.03858907018433338,"score_gpt":0.32903426024653976,"score_spread":0.29044519006220637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179697346","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.9679773,0.00010690241,0.01657501,0.012657041,0.000077810146,0.00022637293,0.000006331277,0.000045571855,0.0023277004],"genre_scores_gemma":[0.9963923,0.000008709174,0.00058419997,0.0017747242,0.0005863434,0.000030876978,0.00006286235,0.000027265154,0.00053268124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851906,0.00020658188,0.00023446657,0.00027311652,0.0004567474,0.0003100292],"domain_scores_gemma":[0.9987113,0.00015886538,0.00004418184,0.0005010582,0.00057235896,0.0000122650745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554894,0.0001160129,0.00016505898,0.00025767888,0.0009903954,0.00049189717,0.00028169865,0.000037345355,0.00072302064],"category_scores_gemma":[0.00048672775,0.00008494405,0.00010998926,0.0014283025,0.00030013674,0.0009750035,0.0002330501,0.00026127486,0.000106213345],"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.00004480496,0.0000466701,0.0004633232,0.00004063971,0.000108817665,0.000009932716,0.0001865966,0.0989301,0.8244039,0.073566325,0.0012166584,0.0009822664],"study_design_scores_gemma":[0.0011642867,0.00003946626,0.002589972,0.00027350624,0.0005086451,0.000014658973,0.011472807,0.9093456,0.022508655,0.011530827,0.0396074,0.00094414246],"about_ca_topic_score_codex":0.0007734538,"about_ca_topic_score_gemma":0.00040283898,"teacher_disagreement_score":0.8104155,"about_ca_system_score_codex":0.000057025092,"about_ca_system_score_gemma":0.000043373973,"threshold_uncertainty_score":0.7916569},"labels":[],"label_agreement":null},{"id":"W3204221696","doi":"10.1016/j.orl.2022.01.018","title":"Guidelines for the computational testing of machine learning approaches to vehicle routing problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Work (physics); Machine learning; Management science; Operations research; Engineering","score_opus":0.38072239786165063,"score_gpt":0.3906359972719764,"score_spread":0.009913599410325769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204221696","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.07793654,0.0001239726,0.9038987,0.016616184,0.00008239972,0.001010269,0.000036807614,0.00013717027,0.00015791888],"genre_scores_gemma":[0.60226786,0.0000015544485,0.39664906,0.00025076602,0.00008175218,0.0005593747,0.000042195865,0.0000370029,0.00011042601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.00035820977,0.0003557861,0.00017980605,0.0004955992,0.00029584952],"domain_scores_gemma":[0.99800926,0.0013792247,0.000019417794,0.00016543898,0.0003794681,0.00004717313],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039905556,0.00008800356,0.00011002088,0.00019569196,0.00140151,0.00010410637,0.00029877672,0.000016060212,0.000033697284],"category_scores_gemma":[0.0024603882,0.00007897461,0.00003736222,0.0010073244,0.000047963575,0.000087542525,0.0001765456,0.00041751645,0.0000028343293],"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.0000033654414,0.000010791064,0.0006260025,0.000022886445,0.000022575761,2.2959587e-7,0.0007935879,0.9815492,0.010189262,0.00045858114,0.0009454181,0.005378068],"study_design_scores_gemma":[0.00017524221,0.000045658457,0.00015154439,0.00001224393,0.0000044321787,0.0000029467176,0.00044497754,0.9963211,0.00044803607,0.000018412973,0.0022910612,0.000084358515],"about_ca_topic_score_codex":0.00012770444,"about_ca_topic_score_gemma":0.000015151826,"teacher_disagreement_score":0.52433133,"about_ca_system_score_codex":0.000115117335,"about_ca_system_score_gemma":0.000052272288,"threshold_uncertainty_score":0.99989855},"labels":[],"label_agreement":null},{"id":"W3211377203","doi":"10.1016/j.orl.2021.10.005","title":"The pairwise flowtime network construction problem","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Connection (principal bundle); Mathematics; Combinatorics; Time complexity; Discrete mathematics; Computer science; Mathematical optimization; Algorithm","score_opus":0.024144724458390502,"score_gpt":0.2807077763147023,"score_spread":0.2565630518563118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211377203","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.26053438,0.007452629,0.56074893,0.091685034,0.002208755,0.0037173762,0.00005116888,0.0039997855,0.069601946],"genre_scores_gemma":[0.8150625,0.0029534346,0.17362578,0.001162843,0.0019061096,0.0013018798,0.00013388811,0.0001440024,0.0037095319],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989251,0.000188935,0.00014303152,0.0001300389,0.00025517223,0.0003577192],"domain_scores_gemma":[0.9993497,0.00015070035,0.0000028389518,0.00028427917,0.00015669335,0.00005579118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143536,0.00007206574,0.00006491324,0.000047113466,0.0007309475,0.0003418637,0.00014231539,0.00004354251,0.0000945453],"category_scores_gemma":[0.00007224134,0.0000574708,0.000033791264,0.000475668,0.0001316365,0.00014675148,0.00003979161,0.0003563418,0.0001011946],"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.000004096985,0.000015579846,0.000167355,0.000027792068,0.000072273724,0.00004602597,0.00023026604,0.2522139,0.22956468,0.013145197,0.45648423,0.048028603],"study_design_scores_gemma":[0.00045924017,0.0000742218,0.0004464143,0.00015049966,0.0000172981,0.00017412356,0.00048371335,0.33984542,0.09270937,0.0022277813,0.56281644,0.00059549295],"about_ca_topic_score_codex":0.000015038565,"about_ca_topic_score_gemma":0.00009569422,"teacher_disagreement_score":0.5545281,"about_ca_system_score_codex":0.00008262069,"about_ca_system_score_gemma":0.00005356549,"threshold_uncertainty_score":0.5621931},"labels":[],"label_agreement":null},{"id":"W3211932688","doi":"10.1016/j.orl.2023.03.008","title":"On a partition LP relaxation for min-cost 2-node connected spanning subgraphs","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming relaxation; Spanning tree; Combinatorics; Partition (number theory); Mathematics; Minimum spanning tree; Relaxation (psychology); Linear programming; Graph partition; Minimum degree spanning tree; Greedy algorithm; Graph factorization; Discrete mathematics; Graph; Mathematical optimization; Line graph; Graph power","score_opus":0.13134850434815168,"score_gpt":0.3851309175006559,"score_spread":0.25378241315250427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211932688","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.3813772,0.000015430616,0.5619844,0.053700536,0.00047904105,0.0014260168,0.000047772042,0.0004799211,0.00048970035],"genre_scores_gemma":[0.9634701,0.000026471349,0.032008898,0.00194352,0.00020845217,0.0014030149,0.00033961755,0.000026426736,0.0005734781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978797,0.00028670643,0.00022194238,0.00047610706,0.00058384245,0.00055174384],"domain_scores_gemma":[0.9981999,0.00083294284,0.00002199345,0.0005368748,0.00030324317,0.00010505189],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00143125,0.00011430545,0.00011197529,0.0008270303,0.0013644705,0.00059938873,0.0005685549,0.000053182932,0.000030861993],"category_scores_gemma":[0.00080681423,0.00011496672,0.00008357959,0.0023836482,0.00013451018,0.00055544346,0.00013590543,0.000300588,0.00026113435],"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.000047338515,0.00016513906,0.0001818066,0.00004039429,0.000054022137,0.000037329006,0.0024616017,0.093645535,0.052442927,0.6694756,0.16287859,0.018569691],"study_design_scores_gemma":[0.0006628342,0.00018402476,0.0027751217,0.00006820495,0.0000032626028,0.000004166673,0.00011892582,0.97133213,0.0046806117,0.00923161,0.010706056,0.0002330199],"about_ca_topic_score_codex":0.00007611636,"about_ca_topic_score_gemma":0.00011319601,"teacher_disagreement_score":0.8776866,"about_ca_system_score_codex":0.00008590995,"about_ca_system_score_gemma":0.0000734928,"threshold_uncertainty_score":0.9999356},"labels":[],"label_agreement":null},{"id":"W3214336004","doi":"10.1016/j.orl.2021.11.002","title":"Single-item lot-sizing with quantity discount and bounded inventory","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Sizing; Production (economics); Mathematical optimization; Piecewise linear function; Key (lock); Holding cost; Computer science; Production planning; Mathematics; Economics; Microeconomics","score_opus":0.08794248011699106,"score_gpt":0.30098971414777503,"score_spread":0.21304723403078396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214336004","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.96502507,0.0001936578,0.00069446693,0.0221725,0.00017046521,0.00034210464,0.000001916726,0.00006717751,0.011332652],"genre_scores_gemma":[0.99002945,0.000029158844,0.0006192242,0.0071076034,0.0006377215,0.00007982701,0.000082986495,0.000034106288,0.0013799192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99819773,0.000076739656,0.00019767013,0.00042544527,0.0006598542,0.0004425645],"domain_scores_gemma":[0.9992339,0.00004873791,0.000024335102,0.00036046046,0.00029943048,0.000033114437],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007636067,0.00014778839,0.00014359406,0.00035514167,0.0008560257,0.0020789318,0.00019095022,0.000033476612,0.0003471794],"category_scores_gemma":[0.00020929864,0.00013026329,0.000036043693,0.00074960437,0.00028105328,0.0015490027,0.00033164123,0.00025941298,0.00014428],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019471394,0.0014282184,0.10776864,0.0013470184,0.0004934139,0.0010941378,0.0017058762,0.0035739385,0.13987033,0.6223384,0.111658,0.008527302],"study_design_scores_gemma":[0.0019970718,0.0000764422,0.010920695,0.0003321215,0.00007143464,0.00001753454,0.0077271494,0.048629124,0.0020034045,0.00052913383,0.9268358,0.0008601179],"about_ca_topic_score_codex":0.0010807905,"about_ca_topic_score_gemma":0.004567186,"teacher_disagreement_score":0.8151778,"about_ca_system_score_codex":0.00012846857,"about_ca_system_score_gemma":0.000056968172,"threshold_uncertainty_score":0.998957},"labels":[],"label_agreement":null},{"id":"W4226355997","doi":"10.1016/j.orl.2022.06.009","title":"On the population monotonicity of independent set games","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Natural Science Foundation of Shandong Province; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Monotonic function; Computer science; Set (abstract data type); Population; Mathematical economics; Profit (economics); Mathematical optimization; Game theory; Mathematics; Microeconomics; Economics; Medicine","score_opus":0.10093682790227854,"score_gpt":0.315773368045517,"score_spread":0.21483654014323844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226355997","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.989478,0.000041829197,0.00023184107,0.0074799657,0.00012346017,0.0003354871,0.00011525507,0.000008951762,0.0021852413],"genre_scores_gemma":[0.9985542,0.000003342181,0.000022869517,0.00047484148,0.000032001804,0.00016891948,0.000027086991,0.000008785057,0.0007079479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998864,0.00034355724,0.00029187638,0.00018826536,0.00013531986,0.00017700846],"domain_scores_gemma":[0.9993539,0.00021595582,0.00004968522,0.00032989605,0.000026798632,0.000023771347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037233909,0.00005175076,0.000117502335,0.00023312877,0.0006683394,0.00006598512,0.0002865881,0.000017641076,0.0010319543],"category_scores_gemma":[0.0002889721,0.000046792313,0.000048014714,0.00032601706,0.00005675894,0.00007822583,0.00010425472,0.00035330054,0.00012879167],"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.000015989535,0.00005368465,0.009222657,0.0000059599884,0.000019525172,0.0000010031864,0.00091802946,0.095154606,0.00069636817,0.8907532,0.0031119813,0.000047002297],"study_design_scores_gemma":[0.0034623635,0.0018967468,0.38602537,0.00012210259,0.000016517319,0.000037556263,0.010797112,0.34137508,0.0060680765,0.16789794,0.08066796,0.0016331814],"about_ca_topic_score_codex":0.0014621109,"about_ca_topic_score_gemma":0.000052485415,"teacher_disagreement_score":0.72285527,"about_ca_system_score_codex":0.00014698075,"about_ca_system_score_gemma":0.000012818419,"threshold_uncertainty_score":0.99988127},"labels":[],"label_agreement":null},{"id":"W4313350174","doi":"10.1016/j.orl.2022.12.006","title":"Gradient boosting for convex cone predict and optimize problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"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; University of Toronto","funders":"","keywords":"Regret; Gradient boosting; Convex optimization; Mathematical optimization; Boosting (machine learning); Regular polygon; Computer science; Quadratic programming; Quadratic equation; Artificial intelligence; Mathematics; Machine learning; Random forest","score_opus":0.26017722015919637,"score_gpt":0.4724558772527916,"score_spread":0.21227865709359522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313350174","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.41761246,0.00083522056,0.4676271,0.10338343,0.0006923301,0.007876932,0.00081963395,0.00014331499,0.0010095632],"genre_scores_gemma":[0.94908446,0.00006940458,0.032830253,0.0014153883,0.00034679708,0.005919631,0.00012990205,0.00006789079,0.01013627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936216,0.0009906302,0.000527558,0.00078439165,0.0032847568,0.00079109747],"domain_scores_gemma":[0.9948825,0.0033938782,0.000040716914,0.00059949467,0.00083129935,0.00025210285],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01077246,0.00013166816,0.00024494875,0.0007812734,0.003423869,0.00082353334,0.0008909745,0.000030783907,0.0007583722],"category_scores_gemma":[0.006502343,0.00011147725,0.000066754896,0.0013923409,0.0005774341,0.00051839434,0.00090833916,0.0007133725,0.000044602974],"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.00012764861,0.00015354437,0.0005908634,0.00001922732,0.00004660366,0.000035971585,0.0021629361,0.8696664,0.021093281,0.0014183805,0.08909677,0.015588402],"study_design_scores_gemma":[0.0016931541,0.0005765675,0.00045648142,0.000011974635,0.000004486992,0.000045662066,0.0032334456,0.84521055,0.00074733986,0.0016916875,0.14608434,0.0002443167],"about_ca_topic_score_codex":0.000111453286,"about_ca_topic_score_gemma":0.000053800988,"teacher_disagreement_score":0.531472,"about_ca_system_score_codex":0.0002506377,"about_ca_system_score_gemma":0.00022177295,"threshold_uncertainty_score":0.99787354},"labels":[],"label_agreement":null},{"id":"W4313350206","doi":"10.1016/j.orl.2022.12.001","title":"A knapsack intersection hierarchy","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Packing Problems","field":"Engineering","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Hierarchy; Intersection (aeronautics); Mathematics; Integer programming; Combinatorics; Integer (computer science); Flow (mathematics); Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.043404422865347736,"score_gpt":0.3032691263942398,"score_spread":0.25986470352889207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313350206","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.81061256,0.00024298947,0.109985255,0.023265207,0.0023239967,0.0014461984,0.00008594723,0.001234142,0.050803732],"genre_scores_gemma":[0.99630225,0.00002003057,0.0014266289,0.000507036,0.000078983605,0.00030076437,0.00007449368,0.000027913915,0.0012619109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989764,0.00018642705,0.000118187185,0.00012882063,0.00034630572,0.0002438292],"domain_scores_gemma":[0.99967927,0.00003299754,0.0000026578214,0.00017966749,0.000049831702,0.000055591398],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004889454,0.00006122319,0.000053944346,0.00035070936,0.00068554987,0.00013750845,0.00016121601,0.0000152330695,0.002013774],"category_scores_gemma":[0.000026121284,0.00006939671,0.000027461045,0.0006673238,0.00004511343,0.0001533825,0.0000764718,0.00050547614,0.00013967679],"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.0000027837261,0.000013153117,0.000029777566,0.0000062965096,0.000011597811,0.0000035495364,0.00079008803,0.9324265,0.016795801,0.0007424899,0.048387833,0.00079014624],"study_design_scores_gemma":[0.00024530166,0.000055965742,0.000071137954,0.000005492259,0.0000018058957,0.00001563116,0.0004279681,0.8189637,0.0009564823,0.000026315978,0.17908902,0.00014118786],"about_ca_topic_score_codex":0.000057725894,"about_ca_topic_score_gemma":0.000050095663,"teacher_disagreement_score":0.1856897,"about_ca_system_score_codex":0.00024773725,"about_ca_system_score_gemma":0.000025029216,"threshold_uncertainty_score":0.9988985},"labels":[],"label_agreement":null},{"id":"W4382930395","doi":"10.1016/j.orl.2023.06.006","title":"Unconstrained traveling tournament problem is APX-complete","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Hamiltonian path; Combinatorics; Complete graph; Mathematics; Travelling salesman problem; APX; Graph; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.09799900504041466,"score_gpt":0.3645096889024662,"score_spread":0.26651068386205157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382930395","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.5316176,0.00007671212,0.41132084,0.044970363,0.00045228595,0.0014850146,0.000099981466,0.001834789,0.008142457],"genre_scores_gemma":[0.7157285,0.00016231381,0.28011653,0.0012445663,0.0003942128,0.0003799116,0.0001398115,0.0001469018,0.0016872452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998109,0.00023090317,0.0002981581,0.0002417622,0.0005367767,0.0005834287],"domain_scores_gemma":[0.99924767,0.00016696428,0.0000070313536,0.00029792587,0.00014946633,0.00013094919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730694,0.00012856667,0.00013338005,0.00038342047,0.00046478008,0.00030148527,0.0002477888,0.000054091222,0.00028152947],"category_scores_gemma":[0.00013282482,0.00013434922,0.000050973464,0.0014224023,0.00008851163,0.00018918593,0.000058897822,0.0004455558,0.0005710966],"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.0000011576907,0.0000058945097,0.00004504759,0.000023040457,0.000027128575,0.000010546701,0.0010494232,0.85077655,0.12584805,0.00022580725,0.017050147,0.0049371966],"study_design_scores_gemma":[0.00026710646,0.000015703363,0.00015319085,0.00003831655,0.0000036939152,0.000005716967,0.0003188698,0.9856899,0.0049183425,0.000036957284,0.008384718,0.00016750298],"about_ca_topic_score_codex":0.00004127171,"about_ca_topic_score_gemma":0.000015292879,"teacher_disagreement_score":0.18411095,"about_ca_system_score_codex":0.00018092325,"about_ca_system_score_gemma":0.000055454693,"threshold_uncertainty_score":0.73404825},"labels":[],"label_agreement":null},{"id":"W4382934680","doi":"10.1016/j.orl.2023.06.004","title":"Continuous cutting plane algorithms in integer programming","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Packing Problems","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Subadditivity; Cutting-plane method; Integer programming; Mathematical optimization; Mathematics; Integer (computer science); Linear programming; Algorithm; Optimization problem; Theory of computation; Branch and cut; Computer science; Combinatorics","score_opus":0.05034676274351741,"score_gpt":0.33285877107178313,"score_spread":0.28251200832826573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382934680","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.9068831,0.00020139824,0.05822726,0.017291088,0.0011065167,0.0022245243,0.000036359346,0.0026524365,0.011377313],"genre_scores_gemma":[0.98444897,0.00010705482,0.013094001,0.0002239334,0.00017216038,0.00032801024,0.000223368,0.00006708438,0.0013353996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998865,0.00008652182,0.00018834077,0.00015477552,0.00026062987,0.0004447258],"domain_scores_gemma":[0.9996336,0.00009113941,0.0000035757082,0.00015061014,0.00006076273,0.00006028593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008158858,0.00008151514,0.00009431649,0.00053607544,0.00015961828,0.0002430783,0.00013714725,0.00004559444,0.00008036196],"category_scores_gemma":[0.00011865609,0.00008362594,0.000019625859,0.001275986,0.000048546524,0.00016953194,0.00003868918,0.00040326623,0.00039393755],"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.0000011683039,0.00001000812,0.0006038907,0.000024297004,0.00000953883,0.000035562363,0.0011863136,0.9712855,0.005486032,0.00016618162,0.0088363495,0.012355132],"study_design_scores_gemma":[0.0002674193,0.00001668493,0.00034620852,0.0000690311,0.000001015072,0.000004604554,0.00048191796,0.9685299,0.0009225723,0.000005975194,0.02920946,0.00014520455],"about_ca_topic_score_codex":0.00012619785,"about_ca_topic_score_gemma":0.00015872202,"teacher_disagreement_score":0.077565886,"about_ca_system_score_codex":0.00007734278,"about_ca_system_score_gemma":0.000019735311,"threshold_uncertainty_score":0.50634015},"labels":[],"label_agreement":null},{"id":"W4387063518","doi":"10.1016/j.orl.2023.09.008","title":"Lower bounds for American option prices with control variates","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"Western University; Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Control variates; Monte Carlo method; Context (archaeology); Optimal stopping; Proxy (statistics); Futures contract; Mathematics; Econometrics; Statistics; Sample size determination; Valuation of options; Markov chain Monte Carlo; Economics; Hybrid Monte Carlo; Finance","score_opus":0.051855341843932916,"score_gpt":0.3141233142460983,"score_spread":0.2622679724021654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387063518","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.08424766,0.000051401374,0.8929214,0.021160379,0.000070397815,0.00072853157,0.00020331073,0.000063405,0.0005535324],"genre_scores_gemma":[0.9884125,0.000033773555,0.0081511885,0.00067912374,0.00020584928,0.0020621412,0.000090966954,0.000025434541,0.00033901475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.0000062296194,0.00023532765,0.00033774265,0.00007437178,0.00037872477],"domain_scores_gemma":[0.9993339,0.00017051247,0.000043648888,0.00023694756,0.00015027125,0.000064709326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065468013,0.000084182786,0.00017278003,0.00034423615,0.00061926286,0.00025649517,0.00020507819,0.000028062816,0.000025937257],"category_scores_gemma":[0.0002207532,0.00008249877,0.000040713083,0.0012228327,0.0001983121,0.00020500833,0.000025762432,0.00012581413,0.00051333616],"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.000046371926,0.00006214664,0.0004641421,0.000014884557,0.000038201146,0.0000013113537,0.00022204153,0.0072871256,0.0009214018,0.98789364,0.0022821147,0.0007666448],"study_design_scores_gemma":[0.0045629526,0.0018868744,0.0594471,0.000063201456,0.000031301293,0.000008180491,0.00089826155,0.52746665,0.00028175092,0.12306481,0.28099233,0.001296598],"about_ca_topic_score_codex":0.00055527134,"about_ca_topic_score_gemma":0.00014925141,"teacher_disagreement_score":0.90416485,"about_ca_system_score_codex":0.00007379901,"about_ca_system_score_gemma":0.000048046215,"threshold_uncertainty_score":0.6598069},"labels":[],"label_agreement":null},{"id":"W4389274127","doi":"10.1016/j.orl.2023.11.010","title":"The complexity of geometric scaling","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Polytope; Combinatorics; Mathematics; Oracle; Scaling; Simplex; Upper and lower bounds; Integer (computer science); Simplex algorithm; Discrete mathematics; Linear programming; Mathematical optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.20657309042899014,"score_gpt":0.387549487468558,"score_spread":0.18097639703956786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389274127","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.38346022,0.00020372632,0.46388853,0.14885198,0.0006908334,0.0006668099,0.000020238906,0.00033505706,0.0018825971],"genre_scores_gemma":[0.978221,0.00011285838,0.02087135,0.00028607305,0.00009502185,0.000059094848,0.00000900617,0.00000770836,0.0003378926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812835,0.00029417677,0.00019714092,0.00022049768,0.0007523953,0.0004074429],"domain_scores_gemma":[0.99840766,0.00062676443,0.000012385572,0.00065021927,0.0002396028,0.0000633437],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023807988,0.00005915904,0.00008207052,0.00064954796,0.0015289423,0.0004243464,0.0013867441,0.000019436711,0.0000133914455],"category_scores_gemma":[0.00042515135,0.000043703545,0.00005653649,0.006107755,0.0008649181,0.00026229853,0.000582403,0.00027806286,0.0001523851],"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.0000041778894,0.00006384086,0.00020882784,0.000018574938,0.00003993275,0.00001757559,0.0009068647,0.021352664,0.012067216,0.86466,0.033419482,0.067240834],"study_design_scores_gemma":[0.00022234015,0.0000551053,0.01123551,0.000020935553,0.0000014251132,0.0000056374533,0.0002264227,0.95571786,0.0046673412,0.01261739,0.015079437,0.00015060058],"about_ca_topic_score_codex":0.00022731743,"about_ca_topic_score_gemma":0.00008690762,"teacher_disagreement_score":0.9343652,"about_ca_system_score_codex":0.00003275157,"about_ca_system_score_gemma":0.00006638668,"threshold_uncertainty_score":0.99977094},"labels":[],"label_agreement":null},{"id":"W4395450178","doi":"10.1016/j.orl.2024.107116","title":"Some asymptotic properties of the Erlang-C formula in many-server limiting regimes","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Limiting; Erlang (programming language); Asymptotic distribution; Staffing; Computer science; Mathematics; Applied mathematics; Statistics; Theoretical computer science; Engineering; Economics; Estimator","score_opus":0.04782271483692816,"score_gpt":0.2966113428409581,"score_spread":0.24878862800402993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395450178","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.9764391,0.00042823912,0.0001228217,0.021701992,0.00010947994,0.00029688957,9.305977e-7,0.000050219955,0.0008503355],"genre_scores_gemma":[0.9969508,0.000013561768,0.00007548636,0.0010508108,0.0004476557,0.000063534884,0.000004833671,0.000023134975,0.0013701555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872935,0.00008575095,0.00023880054,0.00022883955,0.00041670137,0.00030053285],"domain_scores_gemma":[0.99943227,0.00008072269,0.0000197408,0.00033902217,0.00012115158,0.0000070989354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049972,0.000095352196,0.00012052576,0.00054059236,0.0003178105,0.00046451855,0.00037289815,0.00003045863,0.00005641396],"category_scores_gemma":[0.0005190051,0.000063640786,0.00008377403,0.0012785285,0.00017952929,0.0017229638,0.00026382913,0.00033319084,0.00013187101],"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.000035495734,0.00009493601,0.0027350048,0.0008670211,0.00012370232,0.000043614727,0.000757952,0.20587422,0.18313216,0.60002416,0.0041518025,0.0021599568],"study_design_scores_gemma":[0.0006141979,0.000018899329,0.0034829772,0.0026857455,0.000100891375,0.000005725466,0.0023299127,0.94012934,0.018557468,0.011873375,0.019583426,0.00061802665],"about_ca_topic_score_codex":0.00049981853,"about_ca_topic_score_gemma":0.00034670567,"teacher_disagreement_score":0.73425514,"about_ca_system_score_codex":0.000079082536,"about_ca_system_score_gemma":0.000036750687,"threshold_uncertainty_score":0.44793633},"labels":[],"label_agreement":null},{"id":"W4400412965","doi":"10.1016/j.orl.2024.107140","title":"Optimal design of vaccination policies: A case study for Newfoundland and Labrador","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"demographic modeling and climate adaptation","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Vaccination; Computer science; Operations research; Medicine; Engineering; Immunology","score_opus":0.3136102260825757,"score_gpt":0.5049252288127664,"score_spread":0.19131500273019064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400412965","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.7197942,0.00009915179,0.2760543,0.0032016342,0.00006066826,0.0007276614,0.000017317567,0.00001710034,0.000027963399],"genre_scores_gemma":[0.9908405,0.000020931982,0.008475407,0.0000695489,0.000052677853,0.00018483335,0.0000048884476,0.000010388038,0.00034084532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977664,0.00046810182,0.00037698477,0.00035311907,0.00083287706,0.00020257027],"domain_scores_gemma":[0.997048,0.0020514869,0.000016627906,0.00025715338,0.0005612244,0.00006549613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00637486,0.000074520874,0.0001273247,0.0008956299,0.00044234146,0.0010034203,0.00017473537,0.00003139339,0.000049946226],"category_scores_gemma":[0.0011638503,0.000055633536,0.000038603433,0.0011337558,0.000077158984,0.00045170326,0.000049566526,0.00012630297,0.000011869663],"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.0001345842,0.0003896709,0.001972724,0.00007167438,0.00014471784,0.00034916523,0.04212374,0.83588976,0.017333379,0.006500043,0.013544083,0.08154647],"study_design_scores_gemma":[0.0003659228,0.00037667278,0.00052069646,0.000013807065,0.000014050511,0.000103934006,0.018878167,0.97875726,0.00005058477,0.00035291305,0.000492027,0.0000739566],"about_ca_topic_score_codex":0.0029797086,"about_ca_topic_score_gemma":0.0018293551,"teacher_disagreement_score":0.27104625,"about_ca_system_score_codex":0.000038219263,"about_ca_system_score_gemma":0.000106981635,"threshold_uncertainty_score":0.9676005},"labels":[],"label_agreement":null},{"id":"W4400943839","doi":"10.1016/j.orl.2024.107146","title":"Optimal transport divergences induced by scoring functions","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.20069550021976904,"score_gpt":0.44795122965325973,"score_spread":0.2472557294334907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400943839","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.9145839,0.00022023212,0.07278749,0.007904499,0.0005113399,0.00038003948,0.000056569996,0.00014553212,0.003410353],"genre_scores_gemma":[0.9687338,0.000071699484,0.02107838,0.00017674528,0.00034807122,0.00029323544,0.0000492804,0.000042417265,0.009206363],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981857,0.00027592407,0.0002357706,0.00035460046,0.000551058,0.0003969649],"domain_scores_gemma":[0.9990827,0.0003656173,0.0000058164783,0.0002938845,0.00012336618,0.00012863579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748415,0.00012286306,0.0001335474,0.00027607943,0.0005733195,0.00024780055,0.00021432394,0.000062862215,0.00029991372],"category_scores_gemma":[0.00025471151,0.000105173334,0.0000913845,0.0006463968,0.00010249616,0.00031471666,0.00005067692,0.0005311432,0.000006812933],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019361029,0.00014353349,0.0001726476,0.00020814325,0.00018553667,0.00008802031,0.0032538453,0.0022313967,0.736622,0.022257157,0.22653395,0.008284448],"study_design_scores_gemma":[0.0017674443,0.0010303843,0.00041699648,0.0013787972,0.0003255776,0.00009204366,0.013044027,0.1930349,0.10615416,0.0010298858,0.6789113,0.0028144736],"about_ca_topic_score_codex":0.0002928344,"about_ca_topic_score_gemma":0.00020541807,"teacher_disagreement_score":0.6304678,"about_ca_system_score_codex":0.00009935661,"about_ca_system_score_gemma":0.000112135254,"threshold_uncertainty_score":0.44095677},"labels":[],"label_agreement":null},{"id":"W4403411684","doi":"10.1016/j.orl.2024.107194","title":"Structured pruning of neural networks for constraints learning","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Artificial neural network; Computer science; Artificial intelligence; Machine learning; Biology; Botany","score_opus":0.04766301081933947,"score_gpt":0.3484694934558907,"score_spread":0.3008064826365512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403411684","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.051780503,0.00034573762,0.9406917,0.006391283,0.00024484374,0.00027898647,0.000005598934,0.00011271652,0.00014863242],"genre_scores_gemma":[0.9610503,0.00000532019,0.038421545,0.00016780508,0.000114021896,0.00004279389,0.000024676201,0.000010859529,0.00016269268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986346,0.00024019035,0.00018330326,0.00028844803,0.000285307,0.0003681939],"domain_scores_gemma":[0.9989382,0.000623468,0.000011181088,0.00021089545,0.0001498773,0.00006637195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012121996,0.000081293,0.000098642144,0.00024601555,0.0004908443,0.0005942407,0.00041850744,0.000045499604,0.000023761833],"category_scores_gemma":[0.00018262076,0.00007403911,0.000050445316,0.00055954146,0.00015462976,0.00037653378,0.00009953258,0.0005338255,0.000004269478],"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.0000035560793,0.0000042061747,0.00015666938,0.0000413771,0.000022585557,0.000013501513,0.0011128829,0.9292481,0.014773823,0.015780002,0.003107511,0.035735805],"study_design_scores_gemma":[0.000095352945,0.000066631954,0.00006130319,0.000096678355,0.0000022372276,0.000009077974,0.000057229765,0.9974975,0.0007084408,0.00008257693,0.0012452552,0.000077744706],"about_ca_topic_score_codex":0.000036681464,"about_ca_topic_score_gemma":0.000010573537,"teacher_disagreement_score":0.9092698,"about_ca_system_score_codex":0.000036273486,"about_ca_system_score_gemma":0.00011729087,"threshold_uncertainty_score":0.5730277},"labels":[],"label_agreement":null},{"id":"W4405612061","doi":"10.1016/j.orl.2024.107235","title":"Extended formulations for the integer hull of strictly Δ-modular cographic polyhedral cones","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular design; Integer (computer science); Hull; Integer programming; Combinatorics; Mathematics; Computer science; Mathematical optimization; Engineering; Programming language","score_opus":0.06754138262976656,"score_gpt":0.3832531888124953,"score_spread":0.31571180618272876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405612061","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.0482544,0.00063522946,0.92415434,0.025828421,0.00034679126,0.0006134267,0.000023765839,0.000054941447,0.00008867092],"genre_scores_gemma":[0.9797291,0.00003929932,0.019038823,0.000422939,0.00017713338,0.0002445286,0.000046293422,0.000008800517,0.00029307528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985846,0.00013841233,0.00024738774,0.00028433552,0.00049215415,0.0002530659],"domain_scores_gemma":[0.9981962,0.0009278026,0.000013074199,0.00036057323,0.00045013233,0.000052262803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010284329,0.00008673853,0.0000885716,0.00059589633,0.00063207897,0.0005589438,0.0005108707,0.000034052922,0.000023421238],"category_scores_gemma":[0.00019757688,0.00006307749,0.00010595856,0.0018036043,0.00013869874,0.0006375123,0.000108611195,0.00020080672,0.000016350139],"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.000009350305,0.000064651766,0.000020264833,0.000038317285,0.000100439356,0.0000034301058,0.00083000894,0.16084172,0.074073024,0.7320148,0.007817005,0.02418703],"study_design_scores_gemma":[0.0001478597,0.00008331161,0.0012061123,0.000021415526,0.000008591206,0.0000063315397,0.000050373303,0.98023367,0.0041312845,0.0023592112,0.011668756,0.000083076724],"about_ca_topic_score_codex":0.00007203146,"about_ca_topic_score_gemma":0.000050819304,"teacher_disagreement_score":0.9314747,"about_ca_system_score_codex":0.000038916995,"about_ca_system_score_gemma":0.00020483445,"threshold_uncertainty_score":0.5389908},"labels":[],"label_agreement":null},{"id":"W4405987870","doi":"10.1016/j.orl.2024.107238","title":"Assortment optimization under the multinomial logit choice model with product-specific capacities","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 British Columbia","funders":"Canada Research Chairs","keywords":"Multinomial logistic regression; Product (mathematics); Econometrics; Logistic regression; Logit; Mathematical optimization; Mathematics; Statistics; Computer science","score_opus":0.07527177343834648,"score_gpt":0.29982151184174605,"score_spread":0.22454973840339956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405987870","genre_codex":"commentary","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.2607531,0.00020424799,0.26846212,0.4019145,0.00076556567,0.00406721,0.000009792459,0.00026299644,0.06356047],"genre_scores_gemma":[0.96785384,0.000032847583,0.0026719368,0.01659893,0.0012336189,0.000722295,0.00012993245,0.00003309386,0.010723487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848014,0.00005987762,0.00019657327,0.00035982428,0.0005289812,0.00037462128],"domain_scores_gemma":[0.99912125,0.000059824277,0.00002485751,0.00046059757,0.00032252652,0.00001093896],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076272973,0.00014465445,0.000103901264,0.0004248948,0.0011743454,0.0011147304,0.00038260032,0.000026306268,0.00021774678],"category_scores_gemma":[0.0000691374,0.00009761486,0.000036101348,0.0007636041,0.0003473218,0.00086836686,0.00019973768,0.0002655043,0.00008540144],"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.00001897452,0.000059377886,0.00019929656,0.000024878194,0.00003647588,0.0000012545324,0.00007555619,0.8585896,0.000665168,0.03270964,0.107385814,0.00023396625],"study_design_scores_gemma":[0.00059807784,0.000008679504,0.0006906015,0.000036209516,0.00002011716,2.4166283e-7,0.0016130958,0.8805297,0.00016278465,0.00010215029,0.11606575,0.00017257647],"about_ca_topic_score_codex":0.00064760534,"about_ca_topic_score_gemma":0.00039524282,"teacher_disagreement_score":0.70710075,"about_ca_system_score_codex":0.00018737881,"about_ca_system_score_gemma":0.00005577212,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W4408013772","doi":"10.1016/j.orl.2025.107257","title":"Single sample prophet inequality for uniform matroids of rank 2","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Rank (graph theory); Mathematics; Inequality; Sample (material); Combinatorics; Mathematical analysis; Physics","score_opus":0.09306778438594705,"score_gpt":0.38871001137835837,"score_spread":0.2956422269924113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408013772","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.01065181,0.000016411612,0.95569235,0.031321365,0.00007826344,0.00087841146,0.000030128764,0.000045090495,0.0012861476],"genre_scores_gemma":[0.48649836,0.00001913142,0.5099704,0.0016106548,0.000042175627,0.0004178247,0.00007125777,0.000010752319,0.0013594447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984353,0.00025677975,0.00028495907,0.00027406254,0.0004084422,0.00034041217],"domain_scores_gemma":[0.9982418,0.00040767598,0.000015746702,0.00053954124,0.0007301867,0.00006504008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016803727,0.000072355346,0.00012557064,0.00037907818,0.00040020482,0.00034396054,0.00070209126,0.000037649756,0.000041435815],"category_scores_gemma":[0.00088510866,0.00006488783,0.000052409086,0.0011278392,0.00014750483,0.00051221217,0.00023191416,0.00016029307,0.000008614405],"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.00005107286,0.00054517214,0.0003681649,0.00029262336,0.000069374,0.000001779331,0.0017244422,0.096401215,0.17802964,0.6579254,0.044662464,0.019928655],"study_design_scores_gemma":[0.0010702839,0.00025591304,0.00017217253,0.000054959037,0.0000030691767,7.1548624e-7,0.00011626448,0.9374853,0.02845961,0.0033676268,0.028855784,0.00015832987],"about_ca_topic_score_codex":0.00025643985,"about_ca_topic_score_gemma":0.00011731308,"teacher_disagreement_score":0.84108406,"about_ca_system_score_codex":0.00009733702,"about_ca_system_score_gemma":0.00027670414,"threshold_uncertainty_score":0.33168194},"labels":[],"label_agreement":null},{"id":"W4415313183","doi":"10.1016/j.orl.2025.107384","title":"Robust confidence bands for stochastic processes using simulation","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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 Toronto","funders":"Higher Education Commision, Pakistan; Government of Canada","keywords":"Stochastic optimization; Sample (material); Robust optimization; Stochastic process; Baseline (sea); Confidence interval; Stochastic modelling; Sample mean and sample covariance","score_opus":0.4345626140957993,"score_gpt":0.49836194601376044,"score_spread":0.06379933191796111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415313183","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.01807007,0.00008594035,0.97735715,0.0034135487,0.00018735399,0.0007043533,0.00001457521,0.00003232523,0.00013469253],"genre_scores_gemma":[0.97722626,0.0000014536452,0.020831013,0.00028023278,0.00009117445,0.0001340327,0.0000074457007,0.00000914741,0.0014192439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783945,0.00017028583,0.0003767801,0.00041392885,0.00086447434,0.0003350676],"domain_scores_gemma":[0.9929178,0.004839589,0.000020476673,0.00041358438,0.001737473,0.00007112244],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0033541638,0.000097220014,0.00015530032,0.00061080256,0.0008075278,0.00068581686,0.0005184205,0.000054965654,0.000065725384],"category_scores_gemma":[0.025742477,0.00007638532,0.000040771014,0.0018201459,0.00019282142,0.00039245078,0.00007664452,0.00017509471,0.000028327788],"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.000016399184,0.000018492647,0.000016246739,0.000022383265,0.000008304683,7.1120314e-7,0.0001225807,0.9866564,0.003917307,0.0056160977,0.003174392,0.00043068416],"study_design_scores_gemma":[0.00020312128,0.000023298584,0.000050260565,0.00006105196,0.0000065637773,7.7420634e-7,0.000149366,0.9962399,0.0002474258,0.002065638,0.00086873956,0.00008384607],"about_ca_topic_score_codex":0.00004018494,"about_ca_topic_score_gemma":0.000039063365,"teacher_disagreement_score":0.9591562,"about_ca_system_score_codex":0.0001204484,"about_ca_system_score_gemma":0.00056263176,"threshold_uncertainty_score":0.98246413},"labels":[],"label_agreement":null},{"id":"W4416510237","doi":"10.1016/j.orl.2025.107388","title":"A Frank-Wolfe algorithm for strongly monotone variational inequalities","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Variational inequality; Monotone polygon; Monotonic function; Inequality; Approximation algorithm","score_opus":0.046896952140906896,"score_gpt":0.36397876815767194,"score_spread":0.31708181601676505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416510237","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.0004175992,0.000029630455,0.94676375,0.05152204,0.00013310017,0.00037959666,0.000050696843,0.000056937526,0.00064663275],"genre_scores_gemma":[0.053541973,0.000025627529,0.9336235,0.0042110216,0.00020729435,0.0008579753,0.0002771752,0.00001131034,0.00724411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.00029411868,0.00028618495,0.00035610312,0.00053735333,0.00030220218],"domain_scores_gemma":[0.99824893,0.0004973168,0.000018062645,0.00035849007,0.0008107533,0.00006647025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012983364,0.000097007556,0.00012832605,0.0006293343,0.0008160909,0.00069937523,0.00058966817,0.000039224433,0.000109004424],"category_scores_gemma":[0.00033771698,0.00009411182,0.000079664125,0.0012969755,0.00006379908,0.0006753185,0.00015266026,0.00016340087,0.00003989886],"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.0000034701213,0.00008377408,0.000041500738,0.000007251695,0.000095627955,9.003359e-7,0.0003476222,0.20860454,0.0006923514,0.76902497,0.014966322,0.0061316527],"study_design_scores_gemma":[0.0003860244,0.000020286114,0.00043473026,0.000007658379,0.000006062136,4.493053e-7,0.000060333394,0.9885922,0.00018409145,0.0011524298,0.009062103,0.00009361728],"about_ca_topic_score_codex":0.00026367305,"about_ca_topic_score_gemma":0.000053164218,"teacher_disagreement_score":0.7799877,"about_ca_system_score_codex":0.00012872794,"about_ca_system_score_gemma":0.00036936352,"threshold_uncertainty_score":0.67440915},"labels":[],"label_agreement":null},{"id":"W4416643054","doi":"10.1016/j.orl.2025.107396","title":"The Condorcet dimension of metric spaces","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Condorcet method; Metric space; Dimension (graph theory); Norm (philosophy); Cardinality (data modeling); Metric (unit)","score_opus":0.061380198620925516,"score_gpt":0.3275535329859491,"score_spread":0.26617333436502355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416643054","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.9439565,0.0042899875,0.007338629,0.019500589,0.00056318514,0.00045708191,0.000032232285,0.000027143424,0.023834642],"genre_scores_gemma":[0.99360055,0.00013494538,0.000105555664,0.00014686502,0.000035901692,0.00003616138,0.000004654558,0.000005439706,0.0059299436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906164,0.00016970806,0.00031859046,0.00017757587,0.000061331775,0.0002111655],"domain_scores_gemma":[0.99883753,0.0007369356,0.0000239114,0.00030700196,0.00007075065,0.00002388016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003415047,0.000052227915,0.00013712535,0.0005100801,0.000532946,0.0002532195,0.00024935527,0.000032210464,0.000069848254],"category_scores_gemma":[0.0007804548,0.000041955576,0.00004746345,0.0010356747,0.00019955664,0.00012917782,0.000053046897,0.00017768567,0.00012961663],"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.000007622166,0.000017492419,0.001626178,0.000026853531,0.00004569843,9.3614346e-7,0.00022895126,0.0025574183,0.0045357803,0.9803051,0.010099156,0.0005488231],"study_design_scores_gemma":[0.0013183668,0.00022049925,0.01523972,0.00033714587,0.000011789144,0.000005092139,0.0019539092,0.10028348,0.01368473,0.015368626,0.8510869,0.0004897323],"about_ca_topic_score_codex":0.00043525704,"about_ca_topic_score_gemma":0.000042915646,"teacher_disagreement_score":0.96493644,"about_ca_system_score_codex":0.00005614967,"about_ca_system_score_gemma":0.00003402862,"threshold_uncertainty_score":0.40990436},"labels":[],"label_agreement":null},{"id":"W586461037","doi":"10.1016/j.orl.2015.06.006","title":"Robust binary optimization using a safe tractable approximation","year":2015,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Marriott International (Canada)","funders":"","keywords":"Robust optimization; Mathematical optimization; Binary number; Optimization problem; Mathematics; Nonlinear programming; Linear programming; Nonlinear system; Computer science; Algorithm","score_opus":0.4841275584469856,"score_gpt":0.4660255832628508,"score_spread":0.018101975184134755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W586461037","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.22105344,0.00007101121,0.7660603,0.0072393483,0.00028306627,0.0005902818,0.0000122234005,0.000046947993,0.0046434244],"genre_scores_gemma":[0.5898868,0.00013251862,0.40471593,0.00077267585,0.00047568048,0.000114296185,0.00024105163,0.000050734827,0.0036103504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948594,0.001013656,0.00062050734,0.00051209616,0.0025508252,0.00044350978],"domain_scores_gemma":[0.99698824,0.0002895359,0.0000679564,0.00064121315,0.0017405157,0.0002725483],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0075385524,0.00013710553,0.00019127292,0.0011023242,0.00082273094,0.0013664503,0.0005344909,0.00009796511,0.00040109587],"category_scores_gemma":[0.0033373367,0.00011433961,0.000058715897,0.0029601955,0.00016990678,0.0023118656,0.00012219274,0.00030108888,0.00036948305],"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.000024166238,0.00006165358,0.000513314,9.606737e-7,0.000005577911,0.000006331146,0.0006432175,0.9716787,0.0021076717,0.0003746247,0.023121282,0.0014625143],"study_design_scores_gemma":[0.0003599552,0.000049286933,0.00014223391,0.000008595813,0.000004919024,0.000012222282,0.00094539695,0.9921953,0.00026989155,0.00013401287,0.0057419315,0.00013622567],"about_ca_topic_score_codex":0.0004151563,"about_ca_topic_score_gemma":0.00005650728,"teacher_disagreement_score":0.36883336,"about_ca_system_score_codex":0.00026108485,"about_ca_system_score_gemma":0.00044165304,"threshold_uncertainty_score":0.9996702},"labels":[],"label_agreement":null}]}