{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13407707,0.00043467927,0.85090625,0.0005118817,0.00005133502,0.00014232393,0.0002557808,0.00018616967,0.013434457],"genre_scores_gemma":[0.91624844,0.0005126952,0.06908917,0.00015142036,0.000052289164,0.00029610778,0.000417351,0.000110861816,0.013121705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997687,0.0009509355,0.00010856115,0.00033782722,0.00044015597,0.00047546707],"domain_scores_gemma":[0.9845723,0.012333635,0.0010325772,0.0006239689,0.00072145584,0.0007159988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033094173,0.0012576962,0.0021615205,0.0018194468,0.00094797707,0.0038405857,0.0032027708,0.002130419,0.009958303],"category_scores_gemma":[0.02556804,0.0008595175,0.0011754916,0.0017933454,0.0024957696,0.004269493,0.002301265,0.002612127,0.0009395647],"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.00034089308,0.00014513607,0.0010534228,0.00014498652,0.00006718487,0.00015456005,0.00050796283,0.5299098,0.0008662277,0.45213443,0.0019800693,0.012695221],"study_design_scores_gemma":[0.000029738958,0.000033897755,0.00014302308,0.000028514327,0.000015629601,0.000040743038,0.0001163547,0.7856604,0.00021199863,0.21322006,0.00048837264,0.000011245421],"about_ca_topic_score_codex":0.004214103,"about_ca_topic_score_gemma":0.0040207994,"teacher_disagreement_score":0.009958303,"about_ca_system_score_codex":0.0033794153,"about_ca_system_score_gemma":0.0018979143,"threshold_uncertainty_score":0.03331381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006389156,0.00024757022,0.98353124,0.00032418582,0.00023876646,0.00008245467,0.00008513261,0.00032406065,0.008777414],"genre_scores_gemma":[0.16636607,0.00035181156,0.81707394,0.00021177481,0.0001800892,0.00029366126,0.00028639854,0.0003905513,0.014845752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882287,0.0004918422,0.00005760589,0.0001765969,0.00033646077,0.000114585055],"domain_scores_gemma":[0.998672,0.00067775365,0.00006504186,0.00017788129,0.0002958532,0.000111589485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002220654,0.0013214867,0.0021461996,0.0010427068,0.0009892946,0.0016976949,0.0025769693,0.0016586407,0.01531081],"category_scores_gemma":[0.0041648694,0.0007900098,0.0009066478,0.001579855,0.0012000432,0.0015550443,0.0018293808,0.00323019,0.0029398703],"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.0008226558,0.0002966884,0.00038611377,0.0003469611,0.00007885615,0.00014669335,0.00015696454,0.61275476,0.0035363417,0.19615033,0.017339213,0.16798449],"study_design_scores_gemma":[0.00007454732,0.00008414184,0.00005215351,0.000020501646,0.000011686445,0.00005751079,0.000019826091,0.9634959,0.0008723131,0.031638768,0.0036585506,0.000014118782],"about_ca_topic_score_codex":0.0021446776,"about_ca_topic_score_gemma":0.0024124691,"teacher_disagreement_score":0.01531081,"about_ca_system_score_codex":0.0014026574,"about_ca_system_score_gemma":0.0021784615,"threshold_uncertainty_score":0.05121982},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020528904,0.00041254624,0.98680055,0.0012254904,0.0002441311,0.000043118747,0.00023028125,0.00005647565,0.008934519],"genre_scores_gemma":[0.2308612,0.0024904744,0.6980071,0.0016242596,0.0023382024,0.00068774394,0.0014124294,0.00054667203,0.062031962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977799,0.0010140422,0.000097241566,0.00044040964,0.00041724296,0.00025107682],"domain_scores_gemma":[0.99672854,0.0019878496,0.00025538908,0.0002098859,0.0005585429,0.0002597889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053924,0.0016475753,0.0019625092,0.0012125613,0.0010822017,0.0033531934,0.0045468453,0.0035031408,0.020325854],"category_scores_gemma":[0.010846203,0.0010181371,0.0019936848,0.0023341186,0.0017072236,0.006662544,0.0032628542,0.0047537405,0.0015163413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004124626,0.000061741135,0.00029923808,0.000130305,0.000048290567,0.0000772805,0.000059572634,0.16786522,0.00026815906,0.80393356,0.0123294005,0.014885974],"study_design_scores_gemma":[0.000030198064,0.00002645126,0.000114108654,0.000029456496,0.000019319277,0.000047712634,0.000032178705,0.6319795,0.00013594113,0.3600181,0.0075461804,0.000020766645],"about_ca_topic_score_codex":0.004196019,"about_ca_topic_score_gemma":0.0054811253,"teacher_disagreement_score":0.020325854,"about_ca_system_score_codex":0.0028880017,"about_ca_system_score_gemma":0.0038104518,"threshold_uncertainty_score":0.0679968},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071083866,0.0029527985,0.93253493,0.0018282381,0.0003357929,0.00006606516,0.00038926827,0.00021934023,0.05456517],"genre_scores_gemma":[0.38725087,0.014801949,0.4829281,0.002738054,0.002436882,0.0015492409,0.0025660924,0.001365496,0.1043632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988686,0.00044221978,0.00004491771,0.00018811143,0.00030885052,0.00014731771],"domain_scores_gemma":[0.99688524,0.0021124363,0.00016019391,0.00023514016,0.00044890578,0.00015813386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027603447,0.0026970739,0.0014370983,0.0025464564,0.00091149355,0.0028474445,0.0014841909,0.0011269078,0.012692221],"category_scores_gemma":[0.007072828,0.0011697481,0.002844005,0.0028170992,0.002055175,0.005354489,0.002571296,0.0074247806,0.0023263022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030687675,0.0000546887,0.00013439743,0.00014592432,0.00004536374,0.000044434768,0.00012449187,0.013286182,0.0006594613,0.94717467,0.010866278,0.027433338],"study_design_scores_gemma":[0.000015693546,0.000015859288,0.00010723458,0.000043521402,0.000021168787,0.00003744691,0.000028016393,0.049344458,0.00028782702,0.9435565,0.00653344,0.000008786122],"about_ca_topic_score_codex":0.0018602269,"about_ca_topic_score_gemma":0.0015044665,"teacher_disagreement_score":0.012692221,"about_ca_system_score_codex":0.0019026082,"about_ca_system_score_gemma":0.0014218314,"threshold_uncertainty_score":0.042459667},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045176,0.0002233877,0.98916745,0.00013977618,0.00010809671,0.00003629211,0.000073419695,0.00019404262,0.005539851],"genre_scores_gemma":[0.55377036,0.0009320096,0.41054913,0.00036334567,0.00028382495,0.00068887766,0.00062256603,0.0006614499,0.032128435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.00012120932,0.0000067298347,0.000042802592,0.00006570012,0.000028234992],"domain_scores_gemma":[0.9994017,0.0003345152,0.000050671068,0.000062488594,0.00011638967,0.000034306042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756716,0.0011379025,0.001025479,0.0005905314,0.00052839826,0.00081611995,0.0008715006,0.00087929826,0.009472372],"category_scores_gemma":[0.0020915142,0.00049975124,0.00062358147,0.0007635953,0.0010441407,0.0007461164,0.0012407055,0.0017965629,0.0012360187],"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.000104301726,0.00007137521,0.0001306951,0.00016500484,0.000033011853,0.000038715094,0.00006483892,0.8358117,0.0035785022,0.08130731,0.008459978,0.07023459],"study_design_scores_gemma":[0.000009534352,0.000017951998,0.000022977032,0.000006544751,0.000003450638,0.000003879975,0.000005151094,0.9744221,0.00054265663,0.023895714,0.0010655543,0.000004467331],"about_ca_topic_score_codex":0.0036371201,"about_ca_topic_score_gemma":0.002507292,"teacher_disagreement_score":0.009472372,"about_ca_system_score_codex":0.0005767876,"about_ca_system_score_gemma":0.0007452804,"threshold_uncertainty_score":0.031688213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094365396,0.0010350794,0.86035347,0.002599451,0.00042952813,0.00068198104,0.0012412935,0.0039046803,0.03538908],"genre_scores_gemma":[0.25351572,0.00061469484,0.72523737,0.0006366468,0.00030500363,0.0005798443,0.003684311,0.00072017725,0.0147062335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985216,0.00032456362,0.00007165292,0.0003053081,0.00048500567,0.00029177498],"domain_scores_gemma":[0.99736637,0.0014612937,0.00010368208,0.00058966986,0.00030102947,0.00017801828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107148,0.0012717552,0.001692529,0.001936372,0.0015393045,0.0028731304,0.0032697795,0.002256257,0.009560433],"category_scores_gemma":[0.0044319322,0.00073651,0.0020452384,0.0027742486,0.0010013575,0.0038674981,0.0031574953,0.003157036,0.0023793797],"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.001516298,0.0013610465,0.0016065688,0.0006125284,0.0002113077,0.00031818784,0.0005143435,0.10579675,0.01614453,0.10062283,0.05029872,0.72099686],"study_design_scores_gemma":[0.00055696524,0.00027211034,0.0014598552,0.00008003944,0.00021002007,0.0004846489,0.00027820191,0.6715924,0.010251005,0.29670948,0.018033318,0.000071974006],"about_ca_topic_score_codex":0.0028096589,"about_ca_topic_score_gemma":0.003377288,"teacher_disagreement_score":0.009560433,"about_ca_system_score_codex":0.0015253912,"about_ca_system_score_gemma":0.0023105785,"threshold_uncertainty_score":0.03198284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28770816,0.00030280513,0.62121016,0.005527976,0.00011216685,0.0003309061,0.0020235418,0.00032971156,0.08245464],"genre_scores_gemma":[0.95752066,0.00015816622,0.024060937,0.0002862442,0.0000433889,0.00016392754,0.00034021752,0.000030644263,0.017395796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671113,0.001498093,0.00015609936,0.00050753256,0.00030072327,0.0008264253],"domain_scores_gemma":[0.9950681,0.0029986573,0.00048595713,0.0005360568,0.00034747765,0.0005637836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284923,0.00058797124,0.0020010285,0.0006199834,0.0011017433,0.0044796723,0.00375868,0.0037080578,0.021744728],"category_scores_gemma":[0.008489184,0.0006368701,0.0010391354,0.0014121587,0.002290465,0.005244117,0.0024820052,0.002281395,0.0021286984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052373897,0.00014430292,0.0016712619,0.00017327303,0.000078789875,0.00034444965,0.00021177744,0.15415713,0.0018136047,0.814794,0.0075721755,0.018515518],"study_design_scores_gemma":[0.00025885637,0.00013862072,0.000829133,0.000029301833,0.000043185206,0.0002840734,0.00025255833,0.44393396,0.0005046357,0.5492429,0.00441973,0.00006294956],"about_ca_topic_score_codex":0.0050308835,"about_ca_topic_score_gemma":0.003894619,"teacher_disagreement_score":0.021744728,"about_ca_system_score_codex":0.0024176787,"about_ca_system_score_gemma":0.0014943833,"threshold_uncertainty_score":0.072743356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43312702,0.0011385807,0.42398387,0.005845087,0.00048527485,0.00022374082,0.00072714605,0.000785769,0.13368352],"genre_scores_gemma":[0.91338396,0.0007445982,0.06374902,0.0014144842,0.00061547867,0.00033361316,0.0008609689,0.00050340226,0.018394476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765235,0.0008495528,0.00012114194,0.00048760787,0.0004926753,0.0003966116],"domain_scores_gemma":[0.99036574,0.00647996,0.0009795564,0.0008880869,0.0006134591,0.0006732103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028154457,0.0011739195,0.0014554656,0.00092995714,0.0013605264,0.0041791275,0.0018490058,0.0014372872,0.0085388385],"category_scores_gemma":[0.013539248,0.0009812929,0.0012214972,0.0015608126,0.0034074767,0.008209981,0.0031553751,0.0062693916,0.0005651588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013583104,0.00014891312,0.00021973287,0.00006614865,0.000013666333,0.00004129332,0.00033485488,0.014557751,0.0010803436,0.968298,0.0027564107,0.012347063],"study_design_scores_gemma":[0.000029760318,0.000045655976,0.00024608598,0.000013610008,0.000006295704,0.00004024041,0.0000878924,0.054259364,0.00031247127,0.9437576,0.001187854,0.000013132365],"about_ca_topic_score_codex":0.0015462855,"about_ca_topic_score_gemma":0.001304075,"teacher_disagreement_score":0.0085388385,"about_ca_system_score_codex":0.0020291805,"about_ca_system_score_gemma":0.0012597836,"threshold_uncertainty_score":0.028565288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24577573,0.0015925637,0.7218249,0.002532796,0.00061375933,0.00050873123,0.0022961146,0.00053685444,0.024318522],"genre_scores_gemma":[0.7583945,0.00096327433,0.21747287,0.00029085673,0.0003881522,0.00031841107,0.0011792266,0.00025109216,0.02074166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999252,0.00026320777,0.000036393878,0.0001860535,0.000094909636,0.00016728623],"domain_scores_gemma":[0.9985967,0.00086767104,0.00015866963,0.00010809231,0.00009138241,0.00017743093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015293704,0.0015758324,0.0024723539,0.00092603447,0.0013663,0.0022814407,0.0027248855,0.0032181754,0.013839926],"category_scores_gemma":[0.0032385944,0.0012419221,0.0010820486,0.0021285608,0.0009275339,0.0038288133,0.001778616,0.0017197464,0.0007920857],"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.0004958695,0.00036412067,0.0008269691,0.00048113093,0.00013601317,0.0007828556,0.00008883813,0.9053661,0.0029928181,0.037754226,0.0063271583,0.044383887],"study_design_scores_gemma":[0.00008826547,0.00013908652,0.0005064099,0.00002896967,0.0000389024,0.00021286843,0.00008152757,0.9489801,0.0013845968,0.045786604,0.0027261546,0.000026419104],"about_ca_topic_score_codex":0.0029562819,"about_ca_topic_score_gemma":0.0035512536,"teacher_disagreement_score":0.013839926,"about_ca_system_score_codex":0.0010182589,"about_ca_system_score_gemma":0.0014422025,"threshold_uncertainty_score":0.04629916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90444916,0.0001949216,0.09369361,0.00009907714,0.000029596731,0.00009013732,0.000052616208,0.00022204896,0.0011687252],"genre_scores_gemma":[0.99190253,0.00002077491,0.0072753592,0.000012265558,0.00000805452,0.000023195546,0.000026012389,0.0000144306,0.000717393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991856,0.000365987,0.00002752591,0.00008308872,0.00019018762,0.00014751083],"domain_scores_gemma":[0.9965844,0.002472704,0.00023893638,0.00018694188,0.00030845797,0.00020860763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00300557,0.0011206105,0.0012470898,0.00074963144,0.0005948291,0.0011293988,0.0010266047,0.0010418658,0.002117227],"category_scores_gemma":[0.0055313366,0.00047295634,0.00058415445,0.00031118878,0.00079210906,0.0012062782,0.0007936247,0.0007560516,0.00015772837],"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.001222719,0.00009500674,0.0014368475,0.000064216576,0.00005262636,0.0000741712,0.000030305222,0.9761177,0.008950104,0.0007333725,0.00014483591,0.011078147],"study_design_scores_gemma":[0.000049874427,0.0009318823,0.0013816318,0.000003782535,0.00006047273,0.00001819678,0.000024918798,0.99288803,0.0038991831,0.00067272777,0.00005823114,0.000010974718],"about_ca_topic_score_codex":0.003708352,"about_ca_topic_score_gemma":0.002984148,"teacher_disagreement_score":0.003708352,"about_ca_system_score_codex":0.0010868479,"about_ca_system_score_gemma":0.0010896153,"threshold_uncertainty_score":0.015895128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30974233,0.0064755734,0.4580531,0.014219001,0.000761073,0.00027131356,0.00042828365,0.00029565257,0.20975365],"genre_scores_gemma":[0.95946616,0.0023963877,0.023128523,0.00078938843,0.00066873553,0.00021600527,0.0002483004,0.00015459786,0.012931957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994879,0.0027300408,0.00018809717,0.00066432776,0.0005999195,0.00093868654],"domain_scores_gemma":[0.97143865,0.021217275,0.0020776014,0.0012385816,0.0019582964,0.0020695531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079853805,0.0014060597,0.0051519754,0.0022277092,0.0026220493,0.008693598,0.0032394966,0.0033501927,0.016154109],"category_scores_gemma":[0.035389952,0.0008547047,0.0021247428,0.003376845,0.00929566,0.014440182,0.0049482794,0.0062774024,0.0010718732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009558768,0.000037726622,0.00034664775,0.00006138669,0.000019383735,0.00006727826,0.00012479664,0.009525604,0.00018950799,0.984059,0.0017442385,0.0037287986],"study_design_scores_gemma":[0.000057888763,0.000050000937,0.00031460446,0.000027312086,0.000020147409,0.00006267373,0.00018254314,0.02963737,0.00011391806,0.9678324,0.0016820825,0.000019128305],"about_ca_topic_score_codex":0.0032606497,"about_ca_topic_score_gemma":0.0017692518,"teacher_disagreement_score":0.016154109,"about_ca_system_score_codex":0.0031642716,"about_ca_system_score_gemma":0.0028314337,"threshold_uncertainty_score":0.05404091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63620377,0.0006416908,0.35581177,0.0018981482,0.00020157422,0.00011430193,0.00030245387,0.00063973095,0.004186503],"genre_scores_gemma":[0.9893907,0.00018022305,0.0072674174,0.00010377497,0.000082609455,0.000038386057,0.000078725214,0.00005156008,0.0028066274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756694,0.0006866151,0.00010443767,0.00035734734,0.0005238958,0.0007608564],"domain_scores_gemma":[0.98151773,0.01412601,0.0015430287,0.000404045,0.0014448,0.0009643157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057306946,0.0008013269,0.0014341357,0.0009690574,0.0009985252,0.002278513,0.0021466948,0.002074552,0.0033782045],"category_scores_gemma":[0.017099448,0.0010565066,0.00056612515,0.0013733023,0.0014484656,0.0026509508,0.001070489,0.0014891955,0.0005449143],"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.0042556277,0.00035011664,0.006075838,0.00022272718,0.00012881773,0.00085359794,0.0006860788,0.8477638,0.013617242,0.10921386,0.0029371153,0.013895224],"study_design_scores_gemma":[0.00006656411,0.000113336435,0.00045087945,0.0000055822225,0.00002953052,0.000087545784,0.000059204704,0.98853344,0.00046298647,0.010057863,0.00011334746,0.000019616957],"about_ca_topic_score_codex":0.008253222,"about_ca_topic_score_gemma":0.005118763,"teacher_disagreement_score":0.008253222,"about_ca_system_score_codex":0.0031949044,"about_ca_system_score_gemma":0.002493553,"threshold_uncertainty_score":0.030307114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61314833,0.0012161037,0.1972581,0.002443468,0.0004814572,0.00015922793,0.001267651,0.00017989661,0.18384576],"genre_scores_gemma":[0.96084005,0.0006629665,0.018372348,0.00022141582,0.00032486804,0.00011600932,0.00073987443,0.00007636456,0.018646171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988959,0.00015013258,0.000057105543,0.00014199485,0.00047115897,0.0002836123],"domain_scores_gemma":[0.99766123,0.000983969,0.00038579735,0.0002744878,0.00032012834,0.00037434505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065441715,0.0007686495,0.001083292,0.0022193117,0.0011851212,0.0046001934,0.00089054153,0.0008636576,0.0072240657],"category_scores_gemma":[0.004627093,0.00049437344,0.000587904,0.0018493015,0.0029762988,0.0035376677,0.0027669643,0.002560369,0.0009879299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010262381,0.000026787213,0.0004802653,0.000052581934,0.000015308842,0.00016088123,0.00016663621,0.0007618039,0.0015107809,0.98773164,0.0015904855,0.007400339],"study_design_scores_gemma":[0.000036918653,0.000015845386,0.00057528605,0.000023114671,0.000011893978,0.00025949508,0.00020537266,0.0051403577,0.0011535765,0.98917496,0.0033878866,0.000015312362],"about_ca_topic_score_codex":0.0011504337,"about_ca_topic_score_gemma":0.0010736694,"teacher_disagreement_score":0.0072240657,"about_ca_system_score_codex":0.000895922,"about_ca_system_score_gemma":0.0006670096,"threshold_uncertainty_score":0.024166882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06631152,0.001122761,0.9116979,0.002362378,0.00029553153,0.0005287914,0.0014082149,0.00097360695,0.015299249],"genre_scores_gemma":[0.5615144,0.0024627505,0.37123337,0.0007815078,0.000990387,0.001496988,0.0024564804,0.0017083639,0.057355806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971307,0.0008063896,0.00013964158,0.0005923709,0.00071472017,0.0006161939],"domain_scores_gemma":[0.9904642,0.00740433,0.0005936157,0.00057147874,0.00051755836,0.00044884247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005199367,0.005142174,0.007249742,0.0025976596,0.0013776328,0.007574699,0.004544869,0.0065616164,0.016138548],"category_scores_gemma":[0.012130084,0.003858674,0.0036005531,0.004763905,0.0019161134,0.009522782,0.00275465,0.006725751,0.0022421468],"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.0002070859,0.00023080873,0.00045466516,0.00031468607,0.000114256436,0.00014697382,0.00007625948,0.9498272,0.0010944236,0.017044507,0.0035861244,0.026903015],"study_design_scores_gemma":[0.000047052232,0.00006794539,0.00033777358,0.00002740442,0.00005541624,0.000039703278,0.000042549564,0.9732108,0.0005208689,0.024902191,0.0007217439,0.000026550384],"about_ca_topic_score_codex":0.015025267,"about_ca_topic_score_gemma":0.011007646,"teacher_disagreement_score":0.016138548,"about_ca_system_score_codex":0.003961642,"about_ca_system_score_gemma":0.00638159,"threshold_uncertainty_score":0.053988814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84021163,0.0001699864,0.09489586,0.0010001208,0.00022432535,0.0005094571,0.0018758919,0.0025653928,0.058547292],"genre_scores_gemma":[0.9322682,0.00007152638,0.060114335,0.000062383566,0.000007769296,0.000045974197,0.0021967874,0.00029933001,0.004933723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830097,0.0005468816,0.00007388606,0.00025340717,0.0005482293,0.0002766103],"domain_scores_gemma":[0.9969072,0.0007963285,0.00018089497,0.000592005,0.0012624898,0.0002612291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019513394,0.00043927872,0.0004414069,0.00093468203,0.0013537607,0.0017758193,0.00091230206,0.001409369,0.01128619],"category_scores_gemma":[0.009598983,0.0004563953,0.0005710078,0.0009772624,0.0010167975,0.0010219101,0.00085190125,0.0007447468,0.0010575373],"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.001184893,0.0004933075,0.016399378,0.00045184637,0.000078166406,0.00080953666,0.00045866962,0.7445324,0.010923344,0.04299741,0.029280316,0.15239066],"study_design_scores_gemma":[0.0002291451,0.0004946132,0.012127476,0.00009202753,0.00003180483,0.000186965,0.0006737602,0.9509344,0.009582829,0.014109663,0.011496395,0.0000409653],"about_ca_topic_score_codex":0.05253322,"about_ca_topic_score_gemma":0.08927905,"teacher_disagreement_score":0.05253322,"about_ca_system_score_codex":0.0027115806,"about_ca_system_score_gemma":0.007812946,"threshold_uncertainty_score":0.104454875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7978242,0.00021247976,0.19797619,0.000111252404,0.0001212538,0.00014262005,0.00011904151,0.0009261733,0.0025666824],"genre_scores_gemma":[0.9701099,0.00002826599,0.02872828,0.000029838066,0.000020619245,0.0000538163,0.00006756252,0.000058663074,0.00090310536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993747,0.0016472728,0.0003186328,0.0015316503,0.0020939233,0.0006614303],"domain_scores_gemma":[0.9626557,0.025602957,0.001891244,0.0048815026,0.003972568,0.000996052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031552822,0.0014450103,0.0009751614,0.0014572899,0.0006256853,0.0015372656,0.0022921425,0.001036137,0.005350159],"category_scores_gemma":[0.024713647,0.00066426146,0.00097442954,0.0008955358,0.0013049273,0.003436567,0.0023641617,0.0008976122,0.00070101436],"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.012109644,0.0014571102,0.057559192,0.0008342385,0.0006533114,0.0025940249,0.0014059059,0.070814386,0.30719534,0.02085988,0.0016271725,0.5228898],"study_design_scores_gemma":[0.0005636844,0.010250918,0.031992216,0.0000896436,0.00054269773,0.0025078931,0.00064943807,0.63396,0.2749006,0.04112236,0.0032356754,0.00018494671],"about_ca_topic_score_codex":0.0012858148,"about_ca_topic_score_gemma":0.0015023842,"teacher_disagreement_score":0.005350159,"about_ca_system_score_codex":0.0006475158,"about_ca_system_score_gemma":0.001403278,"threshold_uncertainty_score":0.017898083},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2457168,0.008186309,0.4257844,0.018043414,0.0026916636,0.000060788592,0.00020235115,0.00019384357,0.29912043],"genre_scores_gemma":[0.91809624,0.0041487576,0.045304168,0.001406247,0.0021153528,0.000054791024,0.00009035219,0.00009173513,0.028692205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.00016856405,0.000025165924,0.000087794666,0.00014966255,0.00014710103],"domain_scores_gemma":[0.9991098,0.00040749423,0.00012176819,0.00016518531,0.00009267134,0.00010313459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011258284,0.0006940065,0.00086883415,0.0011920637,0.0016179756,0.0024254345,0.000889634,0.0012356697,0.009390048],"category_scores_gemma":[0.0038870622,0.00039176794,0.00092271715,0.0015796474,0.004474306,0.0052758306,0.0023572282,0.0038775546,0.0006355492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011860637,0.000005882353,0.000070609014,0.000013858331,0.0000019331035,0.000029897394,0.000064450265,0.0008038342,0.00021010512,0.9915631,0.0005376612,0.0066868644],"study_design_scores_gemma":[0.0000037230059,0.0000070994024,0.000092631424,0.000010664948,0.000002160909,0.000037142057,0.0000563817,0.0036446534,0.00008854467,0.9941818,0.0018714981,0.0000037071122],"about_ca_topic_score_codex":0.0017051136,"about_ca_topic_score_gemma":0.0010000112,"teacher_disagreement_score":0.009390048,"about_ca_system_score_codex":0.0010320619,"about_ca_system_score_gemma":0.0007305009,"threshold_uncertainty_score":0.03141284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88986933,0.0015619054,0.09805971,0.00049568136,0.00007395237,0.000023709836,0.00016049006,0.00022438486,0.009530774],"genre_scores_gemma":[0.99802715,0.00012732728,0.00157278,0.000011668244,0.000022177477,0.0000042471456,0.000018149369,0.000028883038,0.00018762541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985862,0.00072659866,0.000045885543,0.00025289934,0.00023983314,0.00014860339],"domain_scores_gemma":[0.7919413,0.1990034,0.0030931102,0.0030100234,0.001966772,0.0009854161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041897595,0.00052777265,0.0006532544,0.001598948,0.00042973435,0.0011427385,0.0006908696,0.00058999134,0.0016015162],"category_scores_gemma":[0.07107467,0.00030264255,0.00036823738,0.0008840422,0.0012671086,0.0014704403,0.00044320174,0.0008528291,0.000114989496],"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.0013331845,0.0001768523,0.032457266,0.00039866386,0.00031315174,0.000909182,0.000525574,0.81277895,0.041904297,0.059325915,0.0014141742,0.04846265],"study_design_scores_gemma":[0.000051850486,0.00048710487,0.044731446,0.00006374909,0.00032237943,0.0007932534,0.00020179474,0.8986533,0.015844285,0.037920855,0.0008226345,0.000107364496],"about_ca_topic_score_codex":0.0011784048,"about_ca_topic_score_gemma":0.0010246275,"teacher_disagreement_score":0.0041897595,"about_ca_system_score_codex":0.0006659168,"about_ca_system_score_gemma":0.0004471462,"threshold_uncertainty_score":0.022157848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048155457,0.0040121432,0.7156404,0.03803347,0.001972448,0.00012484916,0.00020284374,0.00013969527,0.1917187],"genre_scores_gemma":[0.8748474,0.001979429,0.04272056,0.0030398306,0.0006736859,0.00016022408,0.00008866728,0.00009965889,0.07639055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988242,0.0007927135,0.000029059342,0.00011275581,0.00013705007,0.00010419699],"domain_scores_gemma":[0.9977985,0.0016405634,0.00007430269,0.0001253904,0.00019728485,0.000163809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340676,0.0006828965,0.00089039135,0.0007439843,0.0013013211,0.002517331,0.0013177841,0.00279122,0.01138735],"category_scores_gemma":[0.007671194,0.00028412355,0.0007557138,0.0006462215,0.0041219695,0.0037722816,0.0015739774,0.0029294954,0.000977012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022173874,0.000019580342,0.00007168491,0.000035941364,0.000014883371,0.00004325989,0.00015352151,0.010603709,0.00006400785,0.97880816,0.0048324834,0.005330538],"study_design_scores_gemma":[0.000010045025,0.000012907221,0.00003076405,0.0000140529955,0.0000042743295,0.000021751679,0.00011122302,0.020757584,0.0000331218,0.9732674,0.005731477,0.0000055166424],"about_ca_topic_score_codex":0.0047286227,"about_ca_topic_score_gemma":0.002396602,"teacher_disagreement_score":0.01138735,"about_ca_system_score_codex":0.0017624912,"about_ca_system_score_gemma":0.0011613087,"threshold_uncertainty_score":0.03809446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4510576,0.0075075487,0.43961236,0.013580926,0.00049819506,0.000114617025,0.00048088605,0.00033463695,0.08681329],"genre_scores_gemma":[0.9778632,0.0029147388,0.007263902,0.0006742996,0.0005100704,0.000047112706,0.000105947394,0.000079507576,0.010541239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834704,0.0007976282,0.000062860374,0.00022461584,0.00026502355,0.00030279285],"domain_scores_gemma":[0.9838065,0.012100522,0.0013705217,0.0006974605,0.0010646362,0.000960382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006471168,0.0010891617,0.0024011014,0.0020143343,0.001373588,0.0022753184,0.0021741882,0.0023499494,0.008168563],"category_scores_gemma":[0.027425872,0.0011457087,0.001427413,0.0024361683,0.004963328,0.008522183,0.004002479,0.003697902,0.00067712774],"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.00031974903,0.000058921858,0.0030578233,0.00018742784,0.000102919454,0.00058914727,0.00036859984,0.09582234,0.0016324861,0.8755955,0.005489276,0.016775884],"study_design_scores_gemma":[0.0000459387,0.00005524517,0.0013908246,0.0000753745,0.000057337573,0.0002822868,0.00016658782,0.31519887,0.00030452933,0.6808695,0.0014949258,0.00005854255],"about_ca_topic_score_codex":0.0025111649,"about_ca_topic_score_gemma":0.0013209417,"teacher_disagreement_score":0.008168563,"about_ca_system_score_codex":0.0017972077,"about_ca_system_score_gemma":0.0010478667,"threshold_uncertainty_score":0.03422326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020908662,0.0005093387,0.992547,0.00036468462,0.000055358832,0.000014155334,0.00002423352,0.000027993077,0.004366348],"genre_scores_gemma":[0.23906222,0.005014163,0.72990376,0.0002787389,0.00048098492,0.00029248564,0.0002333641,0.00020664444,0.024527693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992219,0.00035655318,0.000033992786,0.00009990026,0.00021528322,0.000072406685],"domain_scores_gemma":[0.9993356,0.00039554213,0.00005443603,0.00003510822,0.00013539834,0.000043866152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011337099,0.0008764376,0.0015244358,0.001021874,0.0007943401,0.0025105283,0.0017517371,0.0017609273,0.0038608797],"category_scores_gemma":[0.0034746726,0.0007685214,0.0011540205,0.0025681562,0.001309123,0.002412757,0.0021467071,0.0032310174,0.0009153857],"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.000027228294,0.000061538056,0.00015772352,0.00013244478,0.000046410667,0.00008186804,0.00012290926,0.528404,0.0005627473,0.420754,0.0021229528,0.04752617],"study_design_scores_gemma":[0.000010652904,0.000022263837,0.000036892514,0.000021306856,0.000011941432,0.000026961963,0.00003274573,0.76232755,0.00016517277,0.2325595,0.004772835,0.000012197528],"about_ca_topic_score_codex":0.0036552867,"about_ca_topic_score_gemma":0.0026990368,"teacher_disagreement_score":0.0038608797,"about_ca_system_score_codex":0.00089629344,"about_ca_system_score_gemma":0.0017875886,"threshold_uncertainty_score":0.012915969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52171975,0.00037431036,0.45643938,0.002431903,0.0001786446,0.00009094033,0.00055729493,0.0006181548,0.01758967],"genre_scores_gemma":[0.9753146,0.00018902835,0.011995943,0.000094752024,0.000063929256,0.000033270353,0.00011737709,0.00003697557,0.012153988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993456,0.00019365428,0.000026937576,0.00015986117,0.00010389942,0.0001700286],"domain_scores_gemma":[0.9980831,0.0009424419,0.00020320968,0.00014747924,0.00028976685,0.00033402987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328027,0.00043667684,0.0014400918,0.0012477088,0.0014472496,0.0032703404,0.0022488816,0.0030461112,0.00760587],"category_scores_gemma":[0.003592179,0.00081096706,0.0012769111,0.001927862,0.0025564497,0.0029404114,0.001779029,0.0018552957,0.00056964153],"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.00029345043,0.00014511356,0.0041463934,0.00006648397,0.00011392244,0.0014191528,0.00035770674,0.60907865,0.004601031,0.37269875,0.0017195594,0.0053597917],"study_design_scores_gemma":[0.000041578634,0.00007413564,0.0008533034,0.0000051098054,0.000029230045,0.00011196732,0.00008009136,0.96129996,0.00026294476,0.03658351,0.00061258726,0.000045688936],"about_ca_topic_score_codex":0.01895683,"about_ca_topic_score_gemma":0.010051135,"teacher_disagreement_score":0.01895683,"about_ca_system_score_codex":0.0014600368,"about_ca_system_score_gemma":0.0015027663,"threshold_uncertainty_score":0.037693024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017768074,0.00043922424,0.9636018,0.00096473173,0.00048053247,0.000384922,0.00027499217,0.002389603,0.01369605],"genre_scores_gemma":[0.08392651,0.000388295,0.9041422,0.0004229007,0.00027976403,0.00029527393,0.00082462694,0.0006858902,0.0090345945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.00030133626,0.00012486022,0.00047039674,0.0006362459,0.00023568865],"domain_scores_gemma":[0.99624616,0.001824871,0.00015435531,0.0010908265,0.00050580513,0.00017796134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075981,0.0014888516,0.001708483,0.0015139241,0.0014240653,0.0028524282,0.004158315,0.0026944843,0.018369853],"category_scores_gemma":[0.0065768613,0.000821344,0.001887792,0.0029257468,0.0012890146,0.0060178344,0.004864136,0.003665065,0.0053423797],"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.0005934838,0.0005096423,0.00088334584,0.00078588893,0.00012329158,0.00041376802,0.00032882954,0.041915916,0.019247813,0.10548567,0.025321044,0.80439126],"study_design_scores_gemma":[0.00065374735,0.00043851338,0.0012218246,0.00017778162,0.00021609852,0.0009080508,0.00033188838,0.4978348,0.013470399,0.42504105,0.059586994,0.00011893765],"about_ca_topic_score_codex":0.002046986,"about_ca_topic_score_gemma":0.003946704,"teacher_disagreement_score":0.018369853,"about_ca_system_score_codex":0.0012754952,"about_ca_system_score_gemma":0.0021678838,"threshold_uncertainty_score":0.061453283},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15113407,0.00091306964,0.83275646,0.0015383333,0.00016419876,0.00014158773,0.000578043,0.00027946258,0.012494735],"genre_scores_gemma":[0.964703,0.0003144758,0.028474096,0.00009349435,0.00008846196,0.00011847842,0.00016770714,0.000047898196,0.005992336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838114,0.0007111541,0.000057063433,0.00032290214,0.0002656042,0.0002621753],"domain_scores_gemma":[0.99652904,0.0023571376,0.0004952339,0.00015356006,0.0002548942,0.00021011522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299864,0.00077701797,0.0013194694,0.0005418102,0.00040245912,0.0012855572,0.0016603266,0.0015522423,0.005233179],"category_scores_gemma":[0.004929939,0.00082502124,0.000996051,0.0011356891,0.0010479245,0.002384355,0.001101914,0.0017533612,0.00023689463],"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.00008761244,0.000039235918,0.00027596348,0.00008044886,0.000046918063,0.00026354982,0.000026589221,0.9377214,0.0007446166,0.053941626,0.00084570184,0.0059263124],"study_design_scores_gemma":[0.000019872725,0.00003167353,0.00012938134,0.000007989114,0.000011417606,0.00004593211,0.000016227628,0.9813525,0.00031077547,0.017458811,0.0006041265,0.000011301604],"about_ca_topic_score_codex":0.0032087485,"about_ca_topic_score_gemma":0.0033052203,"teacher_disagreement_score":0.005233179,"about_ca_system_score_codex":0.0016555538,"about_ca_system_score_gemma":0.0014528026,"threshold_uncertainty_score":0.017506719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019519677,0.0001755217,0.9767513,0.0003937822,0.000065140775,0.000071940936,0.00007248644,0.00020923461,0.0027409068],"genre_scores_gemma":[0.38364545,0.00048505812,0.6029009,0.0003824346,0.00023519379,0.0005928287,0.0005151145,0.00020169117,0.011041256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783915,0.0010260064,0.00014202697,0.00027762962,0.0004126568,0.00030256034],"domain_scores_gemma":[0.9921407,0.005305879,0.00043555087,0.0008884085,0.00084726134,0.00038209354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006519095,0.001500407,0.002865981,0.0015190438,0.0013419962,0.0029304412,0.0035656637,0.002332781,0.004628923],"category_scores_gemma":[0.01260618,0.00077461003,0.0011153118,0.002712616,0.0014666364,0.004497154,0.0035747457,0.0032874357,0.0009981024],"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.00095838134,0.0004407753,0.0016380649,0.00034088487,0.00017539572,0.00012707399,0.000409008,0.5117975,0.002753992,0.22702682,0.007862621,0.24646954],"study_design_scores_gemma":[0.00006079722,0.00008223331,0.0001395945,0.000017410095,0.00002720335,0.00003162751,0.000027988373,0.9018146,0.00063352403,0.09628325,0.00086959323,0.000012294215],"about_ca_topic_score_codex":0.001547847,"about_ca_topic_score_gemma":0.0013936774,"teacher_disagreement_score":0.006519095,"about_ca_system_score_codex":0.0014501839,"about_ca_system_score_gemma":0.002466869,"threshold_uncertainty_score":0.034476697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118607655,0.001407142,0.9803329,0.0004398976,0.000135481,0.000030873733,0.0001232837,0.00012428251,0.00554527],"genre_scores_gemma":[0.6045204,0.0057172338,0.3739176,0.0003260957,0.0009672379,0.00022292601,0.00041808555,0.00057518244,0.013335255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826765,0.0005232333,0.00006884713,0.00032602702,0.0005310047,0.00028318077],"domain_scores_gemma":[0.9913168,0.006754579,0.00052567775,0.0004732709,0.0005378802,0.0003917489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026757175,0.0016889813,0.0022722117,0.0018860067,0.0008791463,0.0028644144,0.0034709065,0.0014542976,0.0056929775],"category_scores_gemma":[0.014815925,0.0012043547,0.0013399132,0.0036764664,0.001190419,0.0073666135,0.0023315006,0.00409714,0.0006321474],"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.00014566383,0.000056988345,0.0002780394,0.00015883251,0.00004630359,0.0000774392,0.00007452669,0.82586116,0.0011799216,0.12664956,0.002430091,0.043041427],"study_design_scores_gemma":[0.00000736507,0.00001860753,0.00008396823,0.000018210147,0.00001672031,0.00002028612,0.000011455068,0.9445199,0.00035314003,0.053947683,0.0009948778,0.000007755767],"about_ca_topic_score_codex":0.0069736554,"about_ca_topic_score_gemma":0.0068568806,"teacher_disagreement_score":0.0069736554,"about_ca_system_score_codex":0.0021019152,"about_ca_system_score_gemma":0.0021785633,"threshold_uncertainty_score":0.019044936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073907964,0.032731414,0.53445655,0.04021977,0.006077147,0.0003572938,0.0023379154,0.0013528068,0.3085592],"genre_scores_gemma":[0.669572,0.0324809,0.20364946,0.014706049,0.014048659,0.0018496845,0.0025610551,0.0034010606,0.057731155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951138,0.0010082999,0.00020934413,0.0012089788,0.0012083149,0.0012512658],"domain_scores_gemma":[0.97713864,0.01743046,0.0009420301,0.0015978311,0.0014281436,0.001462981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061210115,0.0049881237,0.003982459,0.004509189,0.0037948575,0.009028651,0.006590199,0.0049585337,0.029599205],"category_scores_gemma":[0.03240124,0.002810975,0.0061057922,0.0070353467,0.0070935427,0.024437658,0.01268909,0.027194418,0.004894295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050930714,0.0003359972,0.0008332932,0.0013898218,0.0001415593,0.0003442807,0.0010051915,0.020885505,0.00500327,0.87792975,0.036802385,0.054819684],"study_design_scores_gemma":[0.00004717759,0.00008598174,0.00065121124,0.0002641452,0.00015240852,0.00024832776,0.00018215738,0.032632895,0.0021535968,0.9499666,0.013544478,0.000071006914],"about_ca_topic_score_codex":0.002166858,"about_ca_topic_score_gemma":0.0017440327,"teacher_disagreement_score":0.029599205,"about_ca_system_score_codex":0.006420056,"about_ca_system_score_gemma":0.0030180581,"threshold_uncertainty_score":0.09901923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05736671,0.0001710423,0.93186224,0.0009068028,0.00014674613,0.00008380758,0.00022173945,0.00015254543,0.009088395],"genre_scores_gemma":[0.8584936,0.00036573256,0.13360098,0.00021253328,0.00018541071,0.00017197571,0.00013995095,0.000040924006,0.006788834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982475,0.00070541404,0.000058164365,0.00033668848,0.00046444533,0.0001878226],"domain_scores_gemma":[0.996287,0.0019417815,0.00044550435,0.0005013275,0.00051389344,0.00031055158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964193,0.0008606464,0.0009396681,0.0009903508,0.0006032285,0.0024316565,0.0020694477,0.0014831066,0.0026931008],"category_scores_gemma":[0.0056565255,0.00071980525,0.0006646395,0.0010619259,0.0010938889,0.0022245338,0.0012626708,0.0016881716,0.0004579825],"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.00016756878,0.000115763505,0.00041510627,0.0001013346,0.00005315752,0.00013108933,0.000053856547,0.698648,0.004857791,0.2761223,0.0017596355,0.017574472],"study_design_scores_gemma":[0.000029041988,0.000030498326,0.000052806707,0.000005990455,0.000010403683,0.00003758072,0.000008588971,0.94345856,0.0006054134,0.055223495,0.0005285619,0.000009116044],"about_ca_topic_score_codex":0.0012662864,"about_ca_topic_score_gemma":0.0015919708,"teacher_disagreement_score":0.0026931008,"about_ca_system_score_codex":0.0018242456,"about_ca_system_score_gemma":0.0011240939,"threshold_uncertainty_score":0.013235867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020514015,0.00018190032,0.97309476,0.00032558283,0.00008586006,0.00007883246,0.00010087846,0.0005854598,0.005032774],"genre_scores_gemma":[0.26318616,0.00027885247,0.72486705,0.00023671785,0.00016310874,0.00037998962,0.00053903175,0.00044016377,0.009908952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988985,0.00041915168,0.00003351722,0.00016286262,0.00030606103,0.00018000037],"domain_scores_gemma":[0.9977525,0.0013042988,0.00013397088,0.00037247545,0.00030627954,0.00013056603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015922935,0.0009167232,0.0015989388,0.00076714944,0.0008520875,0.0016003242,0.0027765196,0.0014438151,0.008948724],"category_scores_gemma":[0.005616821,0.00057982,0.0007530284,0.0013064102,0.00077379844,0.0032860192,0.0026353488,0.0033600403,0.0014340209],"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.0005028733,0.00039773306,0.0006090375,0.00018113058,0.000040938656,0.00006718425,0.00022597318,0.57880735,0.0030269902,0.117818385,0.01340721,0.28491518],"study_design_scores_gemma":[0.00006359758,0.00004771459,0.000089079185,0.0000063673892,0.000008279304,0.000014398674,0.000019330351,0.9481564,0.00049803976,0.049446974,0.0016418387,0.000007996494],"about_ca_topic_score_codex":0.0031325046,"about_ca_topic_score_gemma":0.0051963073,"teacher_disagreement_score":0.008948724,"about_ca_system_score_codex":0.0012437932,"about_ca_system_score_gemma":0.0018024157,"threshold_uncertainty_score":0.029936433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29141164,0.002076659,0.6810519,0.0030715244,0.00056726905,0.00014599426,0.0004905219,0.0004916248,0.02069281],"genre_scores_gemma":[0.96622837,0.00050168077,0.01905985,0.00027117203,0.00023016092,0.000049917067,0.00021472515,0.00010717388,0.013336937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993413,0.00011047697,0.0000151456325,0.000062598985,0.00028379558,0.00018675528],"domain_scores_gemma":[0.9980659,0.0010080938,0.00016810658,0.00008512721,0.00047250523,0.0002002938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158495,0.00060695497,0.0007371342,0.0009953679,0.0006406051,0.0015368712,0.0012976626,0.00058937084,0.004750553],"category_scores_gemma":[0.004384043,0.00037099796,0.00057181553,0.00061368156,0.001050549,0.0013132998,0.00071632076,0.0011688521,0.0003753919],"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.00060052343,0.00024052167,0.0031140489,0.0002133159,0.00007870144,0.0002518357,0.00017943882,0.6217965,0.012214382,0.3335234,0.008548865,0.019238468],"study_design_scores_gemma":[0.000011971716,0.000017425955,0.00037051472,0.000003759699,0.0000063283187,0.000012773782,0.000014959851,0.984786,0.0002546083,0.014223648,0.00029231908,0.0000057298557],"about_ca_topic_score_codex":0.017092774,"about_ca_topic_score_gemma":0.008275886,"teacher_disagreement_score":0.017092774,"about_ca_system_score_codex":0.003009326,"about_ca_system_score_gemma":0.0032057394,"threshold_uncertainty_score":0.03398657},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009829577,0.0142445415,0.805834,0.06450569,0.0044442657,0.000051196857,0.0011793056,0.00032445465,0.099587046],"genre_scores_gemma":[0.70213157,0.034943398,0.11316995,0.01645801,0.030081399,0.0003093,0.0009966508,0.0015772952,0.10033239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495775,0.0023340178,0.00028248687,0.00066923205,0.0013027415,0.00045371376],"domain_scores_gemma":[0.9621686,0.031867266,0.000602856,0.0025470294,0.002406449,0.0004078361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070207953,0.002453728,0.0031392095,0.0022935846,0.0019738963,0.0055383756,0.0034567562,0.0051671723,0.012680516],"category_scores_gemma":[0.039715677,0.0016968935,0.0044465917,0.005678202,0.005377932,0.02117541,0.0038744283,0.011314981,0.0022910053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003178662,0.000014094634,0.00018611013,0.00011560702,0.000036690693,0.00020350843,0.00019782943,0.023536727,0.00019492644,0.94992065,0.014552993,0.011009103],"study_design_scores_gemma":[0.0000061565606,0.000008442946,0.00010997788,0.000045904708,0.00001724131,0.00007655379,0.0000572211,0.033170387,0.000102195176,0.95141643,0.014961472,0.000028175462],"about_ca_topic_score_codex":0.0094398465,"about_ca_topic_score_gemma":0.0030123633,"teacher_disagreement_score":0.012680516,"about_ca_system_score_codex":0.004289153,"about_ca_system_score_gemma":0.0015311292,"threshold_uncertainty_score":0.042420506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20305172,0.010848273,0.72067016,0.0062837848,0.00117788,0.00010676939,0.0005653721,0.0013455563,0.055950474],"genre_scores_gemma":[0.9276299,0.0036424533,0.05039295,0.00065870263,0.00048373686,0.00022719249,0.0005198472,0.0008447369,0.0156005705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731255,0.0006888179,0.00011351007,0.00044007154,0.00072349457,0.00072162505],"domain_scores_gemma":[0.9528764,0.036918774,0.0027217253,0.002832782,0.0018301549,0.0028201265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050838827,0.0016494793,0.002057492,0.001666679,0.0016926321,0.0035010956,0.0024984693,0.0024788785,0.0098445285],"category_scores_gemma":[0.03441999,0.0012069041,0.0013677223,0.001121106,0.0029894316,0.0060959957,0.0031178584,0.00492391,0.0010703651],"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.0017400272,0.00020778531,0.0015084322,0.00082340295,0.00019794292,0.00025168847,0.0005891586,0.35994968,0.024604483,0.5505407,0.010786455,0.048800215],"study_design_scores_gemma":[0.000053489344,0.00029317476,0.0015623354,0.00016671841,0.00008914666,0.00022230021,0.00029109235,0.73516387,0.007968845,0.2486005,0.0055029537,0.00008556691],"about_ca_topic_score_codex":0.00084406394,"about_ca_topic_score_gemma":0.0006718007,"teacher_disagreement_score":0.0098445285,"about_ca_system_score_codex":0.001983571,"about_ca_system_score_gemma":0.0012953102,"threshold_uncertainty_score":0.032933295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9758247,0.00023604835,0.001060386,0.0007436748,0.00002346938,0.000032702614,0.00012389976,0.000023857594,0.021931233],"genre_scores_gemma":[0.9987853,0.000028182132,0.00010827988,0.000024642739,0.0000095212845,0.000002060197,0.000016708223,0.0000032623434,0.0010220456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773884,0.0007935905,0.000080570644,0.00024027312,0.0002570993,0.00088964327],"domain_scores_gemma":[0.958338,0.029823575,0.003794924,0.0024913887,0.001640605,0.00391148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048389784,0.00037800762,0.00084533845,0.00055496953,0.0008711652,0.0032065166,0.0012562812,0.0018090206,0.024190888],"category_scores_gemma":[0.025581457,0.00033773368,0.00073101313,0.00068964605,0.0017690042,0.003733309,0.0020879426,0.0021754887,0.0007263086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.06100011,0.009282189,0.21781549,0.0009667711,0.0008082256,0.0026717256,0.0025093597,0.22720315,0.022869857,0.27011207,0.0071120197,0.177649],"study_design_scores_gemma":[0.0042519574,0.011400446,0.42983058,0.0002679213,0.00216934,0.0015303835,0.012612325,0.17708462,0.01700066,0.32791543,0.0154874455,0.00044885214],"about_ca_topic_score_codex":0.005790249,"about_ca_topic_score_gemma":0.005742605,"teacher_disagreement_score":0.024190888,"about_ca_system_score_codex":0.0029425805,"about_ca_system_score_gemma":0.002691494,"threshold_uncertainty_score":0.08092654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7633078,0.0015980926,0.10107927,0.01672652,0.00054350746,0.00025743645,0.0028284825,0.00046210358,0.113196686],"genre_scores_gemma":[0.9669125,0.0004125085,0.0013696519,0.0001482003,0.000056423596,0.00008370794,0.00020923742,0.000037844038,0.03076991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993678,0.00020997095,0.000020031812,0.00012402625,0.00005397671,0.00022431946],"domain_scores_gemma":[0.99904543,0.00040096202,0.0001101325,0.00003846134,0.00021835996,0.00018667436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011034475,0.0007851102,0.001978756,0.0011378543,0.0013746409,0.0027208184,0.0032132096,0.004425766,0.013377718],"category_scores_gemma":[0.0024380556,0.00082148885,0.0013858012,0.0012159507,0.0016971745,0.0033605418,0.0017366457,0.002232046,0.00048699175],"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.00009367901,0.00009313713,0.001554954,0.000052774307,0.000038280454,0.00031913206,0.00007344729,0.9090244,0.00024150862,0.08357466,0.0032140033,0.0017200655],"study_design_scores_gemma":[0.000069843736,0.000029091056,0.0006633248,0.000010410136,0.000039420753,0.00003642793,0.00012462231,0.9782074,0.000049001796,0.019982208,0.00076557545,0.000022733144],"about_ca_topic_score_codex":0.13361779,"about_ca_topic_score_gemma":0.054573953,"teacher_disagreement_score":0.13361779,"about_ca_system_score_codex":0.0049882424,"about_ca_system_score_gemma":0.004493697,"threshold_uncertainty_score":0.26568007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12806548,0.027433226,0.7467665,0.014756726,0.0032291473,0.0006058146,0.0045921947,0.005026421,0.069524534],"genre_scores_gemma":[0.76204747,0.01236873,0.18944752,0.003139042,0.0023823816,0.00085073995,0.0015355957,0.0027997673,0.025428737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942697,0.0011701885,0.00024503353,0.0010187079,0.0010877243,0.0022086634],"domain_scores_gemma":[0.9464102,0.04208922,0.0017222017,0.0052301777,0.002653646,0.0018945755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009013445,0.0052570705,0.006001925,0.0037839687,0.003299172,0.008695236,0.0061558504,0.005187835,0.030398315],"category_scores_gemma":[0.06829456,0.0026110166,0.002505337,0.0067754094,0.0050566145,0.021296484,0.007304707,0.009042829,0.0038070197],"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.004131096,0.00054283126,0.001907597,0.0029541973,0.00030582142,0.00047740142,0.0006120673,0.5783427,0.017683081,0.18903872,0.060527947,0.14347653],"study_design_scores_gemma":[0.00015532898,0.00032417287,0.00082921365,0.00047013848,0.00021285511,0.0004271028,0.0002348867,0.7687767,0.00747552,0.21408807,0.0068855244,0.0001205579],"about_ca_topic_score_codex":0.0035793057,"about_ca_topic_score_gemma":0.0033882535,"teacher_disagreement_score":0.030398315,"about_ca_system_score_codex":0.0038581975,"about_ca_system_score_gemma":0.0058366866,"threshold_uncertainty_score":0.1016925},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31840208,0.0018459476,0.5807339,0.014447163,0.00066688634,0.0002666501,0.0028654425,0.0054869363,0.075285],"genre_scores_gemma":[0.8927202,0.0008941451,0.082577646,0.0017671898,0.0008490118,0.00019322276,0.0024821975,0.001402501,0.017113965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922043,0.0014610433,0.0004231299,0.002206163,0.0020328432,0.0016724902],"domain_scores_gemma":[0.9361299,0.043916024,0.0040984447,0.010152914,0.0032301543,0.0024724929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045519136,0.0017710684,0.0035056134,0.0010203224,0.0020396584,0.0071957093,0.004233995,0.0027732407,0.018426813],"category_scores_gemma":[0.03835203,0.0011005438,0.0020614385,0.0020572972,0.003667364,0.022264553,0.00422103,0.007077055,0.0027784084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072613624,0.0009989283,0.007977693,0.0017137346,0.00035492764,0.00053225894,0.000664016,0.06682755,0.03051111,0.6749957,0.03425476,0.17390794],"study_design_scores_gemma":[0.00027159392,0.0002786297,0.0017334808,0.00006975116,0.00016304613,0.0010218703,0.00019531773,0.13447659,0.021120816,0.83317536,0.007407538,0.00008604941],"about_ca_topic_score_codex":0.0010731325,"about_ca_topic_score_gemma":0.0015453169,"teacher_disagreement_score":0.018426813,"about_ca_system_score_codex":0.0027185848,"about_ca_system_score_gemma":0.0031154526,"threshold_uncertainty_score":0.06164378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042158705,0.0009228656,0.9776913,0.0015360103,0.00043807045,0.00006996384,0.0001664862,0.000043656466,0.014915824],"genre_scores_gemma":[0.2115733,0.0037930475,0.74978906,0.0012230283,0.0017255904,0.000629308,0.0008246817,0.00043561825,0.030006299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973992,0.0011408989,0.00016477611,0.00024787916,0.0008050394,0.00024210426],"domain_scores_gemma":[0.9948849,0.0030994792,0.00037538374,0.00037252306,0.0010283376,0.0002393869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394697,0.0020527304,0.0015272122,0.0015298591,0.0012675384,0.005615032,0.003432263,0.0025703204,0.007334375],"category_scores_gemma":[0.015986837,0.0013045949,0.0022998673,0.0029209184,0.002241686,0.00672248,0.0033902987,0.008834081,0.0012225361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005731266,0.00012895779,0.00020286244,0.00019251577,0.000039680013,0.00018883719,0.0002040497,0.08682304,0.0011228585,0.8735639,0.006391994,0.03108403],"study_design_scores_gemma":[0.0000207933,0.00002433802,0.00007167367,0.000047986072,0.00002303963,0.00006655856,0.000062419036,0.48046827,0.0003166305,0.5125889,0.006286734,0.00002267173],"about_ca_topic_score_codex":0.003179334,"about_ca_topic_score_gemma":0.004272578,"teacher_disagreement_score":0.007334375,"about_ca_system_score_codex":0.0022875997,"about_ca_system_score_gemma":0.0021590127,"threshold_uncertainty_score":0.024535954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040041003,0.00053202815,0.94613874,0.00042538633,0.00016576736,0.00014108828,0.00017163673,0.0002829323,0.012101354],"genre_scores_gemma":[0.61750585,0.0009674036,0.34930512,0.0001907312,0.000096924814,0.00039940007,0.00040823026,0.00038910942,0.030737087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997278,0.000103650316,0.000008712535,0.000055572847,0.00006001773,0.000044195418],"domain_scores_gemma":[0.9997862,0.00011003217,0.00003188607,0.000016562433,0.000043106927,0.00001217646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778276,0.0013357054,0.0008570845,0.00079810794,0.00044351685,0.001022847,0.00092575786,0.0011142386,0.003662038],"category_scores_gemma":[0.0013715951,0.00070060894,0.0006828835,0.00096400606,0.0005074624,0.0009812817,0.00058161444,0.00070562144,0.00061929127],"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.000026518313,0.000020703952,0.00010440335,0.000032779397,0.000021885027,0.000012036885,0.000022773089,0.97217983,0.0011861952,0.009078309,0.0009839054,0.016330754],"study_design_scores_gemma":[0.000009844322,0.000030062469,0.000051078325,0.0000073450406,0.000010485145,0.0000075328385,0.000023756164,0.9902502,0.0007262637,0.007501679,0.0013776746,0.0000040732875],"about_ca_topic_score_codex":0.00595428,"about_ca_topic_score_gemma":0.005618275,"teacher_disagreement_score":0.00595428,"about_ca_system_score_codex":0.0012037158,"about_ca_system_score_gemma":0.0012331124,"threshold_uncertainty_score":0.012250781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8678124,0.0006663193,0.12707214,0.00090333854,0.0001280506,0.000066318025,0.00044821866,0.0005221931,0.0023809585],"genre_scores_gemma":[0.99687433,0.00011357819,0.0018559904,0.000038232443,0.000040437775,0.000014118025,0.00010088328,0.000021816788,0.0009406383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901414,0.00018182858,0.000054557575,0.00021145031,0.00020268607,0.00033529522],"domain_scores_gemma":[0.99392253,0.0031800556,0.00073678204,0.000313111,0.0011976062,0.00064990815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020982688,0.0006736289,0.0010870969,0.0012351807,0.0010079478,0.0020218128,0.0021540965,0.0016280162,0.0017570616],"category_scores_gemma":[0.006430951,0.0006149585,0.00044109437,0.0014420514,0.0013231605,0.0017092297,0.0010061273,0.0010120445,0.00038700821],"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.0027678863,0.00040398602,0.018209293,0.00037425864,0.00017607208,0.0023650455,0.0009594109,0.79488873,0.031841394,0.1282331,0.00566842,0.014112391],"study_design_scores_gemma":[0.000023150978,0.000049659284,0.0008239796,0.0000041822273,0.000020157528,0.00010062227,0.000049794722,0.9943634,0.00059393584,0.0038304562,0.000112351845,0.000028355056],"about_ca_topic_score_codex":0.0071784654,"about_ca_topic_score_gemma":0.0030816917,"teacher_disagreement_score":0.0071784654,"about_ca_system_score_codex":0.0022361553,"about_ca_system_score_gemma":0.0016410672,"threshold_uncertainty_score":0.016224563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052364152,0.0027223048,0.90973556,0.00135714,0.00065480894,0.0007036997,0.0013225462,0.003519027,0.027620686],"genre_scores_gemma":[0.22995658,0.0010793826,0.7447876,0.00046048954,0.00030373925,0.0005576915,0.0018807136,0.00067416613,0.020299604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902725,0.00031216396,0.000036278274,0.00011964476,0.00029287834,0.00021181011],"domain_scores_gemma":[0.99788946,0.0013270671,0.00010516828,0.00024461455,0.000279141,0.00015446328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233596,0.0012325088,0.0016615749,0.0030492365,0.0018069673,0.0024111175,0.002929427,0.0020849174,0.018960547],"category_scores_gemma":[0.004444561,0.0008601676,0.0013063865,0.0039254534,0.0008960479,0.002985817,0.0016665419,0.0015570942,0.0034658287],"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.00093721366,0.00058836414,0.00073194655,0.0006792611,0.00013496984,0.00027587963,0.00023234852,0.42485407,0.0050342404,0.05502602,0.039039966,0.4724658],"study_design_scores_gemma":[0.00022615315,0.00029120003,0.00030046693,0.00008739643,0.00009286583,0.00013000985,0.000097529475,0.9364215,0.002673084,0.04787636,0.011754163,0.000049277744],"about_ca_topic_score_codex":0.00689727,"about_ca_topic_score_gemma":0.009010439,"teacher_disagreement_score":0.018960547,"about_ca_system_score_codex":0.0026856612,"about_ca_system_score_gemma":0.0026603155,"threshold_uncertainty_score":0.063429296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06911109,0.0019316961,0.9138704,0.0038515227,0.0006969137,0.000104427985,0.00009466728,0.0001167954,0.010222482],"genre_scores_gemma":[0.84843135,0.0027421408,0.12117394,0.0007594239,0.0012908814,0.00024062472,0.00022016496,0.0001395421,0.025001967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.00042595103,0.00006164091,0.00017163854,0.000271918,0.0001396378],"domain_scores_gemma":[0.9905089,0.0070628924,0.0005210754,0.00017363639,0.0009676217,0.0007658604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00486131,0.0011216155,0.0015774643,0.0021935648,0.0015916124,0.0037188209,0.002557807,0.004188908,0.0032680302],"category_scores_gemma":[0.019290993,0.0008303741,0.0016889009,0.001955653,0.0032184706,0.004585161,0.0023979764,0.0036600465,0.00028438153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099494035,0.00016917728,0.00055599585,0.00013308226,0.00004850645,0.00046961545,0.00026386173,0.18349414,0.0029059371,0.8009896,0.002497378,0.008373234],"study_design_scores_gemma":[0.000023402981,0.000027018146,0.00009600595,0.000009198732,0.000013030927,0.0000681916,0.000037216585,0.88675326,0.0002116685,0.1121226,0.00062113383,0.000017220224],"about_ca_topic_score_codex":0.0060342858,"about_ca_topic_score_gemma":0.0031709867,"teacher_disagreement_score":0.0060342858,"about_ca_system_score_codex":0.002672983,"about_ca_system_score_gemma":0.0033794122,"threshold_uncertainty_score":0.02570939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018108161,0.0005130638,0.9374595,0.00083692407,0.0011412014,0.00016933576,0.0012568273,0.008215619,0.032299366],"genre_scores_gemma":[0.36329898,0.00036948966,0.5834458,0.00061938685,0.00057515496,0.00041548643,0.0031134705,0.0022237245,0.04593846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.00018342298,0.000058731046,0.00024760084,0.00045284722,0.00018000172],"domain_scores_gemma":[0.99753606,0.0007435087,0.000079869635,0.0010212167,0.00050629425,0.00011300953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085943274,0.0011096933,0.0011814209,0.0011935317,0.0013881836,0.002598758,0.0018867996,0.0013370438,0.05366155],"category_scores_gemma":[0.00689405,0.000613843,0.0010069362,0.0015435001,0.00068350596,0.00345462,0.003230388,0.0021358929,0.009826951],"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.0011766497,0.00017643403,0.0017748397,0.00033218492,0.00014497299,0.00025177814,0.00014505444,0.14962187,0.0079126675,0.20276988,0.06162962,0.5740641],"study_design_scores_gemma":[0.00008306551,0.000048923008,0.00047497626,0.000032726854,0.000023117178,0.00008186728,0.000042700394,0.8254284,0.006042909,0.15061983,0.017099036,0.000022517841],"about_ca_topic_score_codex":0.003583284,"about_ca_topic_score_gemma":0.0071050655,"teacher_disagreement_score":0.05366155,"about_ca_system_score_codex":0.0011232429,"about_ca_system_score_gemma":0.0022009632,"threshold_uncertainty_score":0.17951578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46562228,0.0005287904,0.50874656,0.0018690177,0.0001995537,0.00008408411,0.00025986036,0.0009810016,0.02170884],"genre_scores_gemma":[0.99458873,0.00011553868,0.0042234873,0.000035678215,0.000026322097,0.000009206298,0.00003487567,0.00002580006,0.00094027375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989318,0.0002680134,0.000038049988,0.0001808414,0.00023334888,0.0003477588],"domain_scores_gemma":[0.9959566,0.0015091385,0.000685227,0.0012118928,0.00043139537,0.00020584234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422423,0.000708836,0.00058912486,0.0012153056,0.00063364307,0.0017184739,0.0006857396,0.0011708841,0.0026419708],"category_scores_gemma":[0.009704191,0.00025421698,0.0005176594,0.00050360675,0.0012737396,0.0030777126,0.0019424815,0.0012523988,0.00034809316],"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.00059755374,0.00013310826,0.0053094844,0.00015629383,0.0001444944,0.00051626796,0.00047603078,0.51179457,0.04639366,0.32246837,0.004134601,0.10787549],"study_design_scores_gemma":[0.000014472819,0.000117970434,0.0015089851,0.000043702836,0.00004777992,0.0002854524,0.00015514257,0.7965528,0.015812881,0.18327431,0.002166715,0.000019782092],"about_ca_topic_score_codex":0.0006266148,"about_ca_topic_score_gemma":0.00029292062,"teacher_disagreement_score":0.0026419708,"about_ca_system_score_codex":0.00080246816,"about_ca_system_score_gemma":0.00085426663,"threshold_uncertainty_score":0.008838296},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047530293,0.001084905,0.73899454,0.008608253,0.00061774004,0.000149643,0.00044206582,0.00025768875,0.20231487],"genre_scores_gemma":[0.8448241,0.0011856455,0.10089228,0.002305839,0.00083904644,0.00033904,0.0003254824,0.00030002496,0.04898858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986908,0.00040601633,0.000060456376,0.00028931958,0.00031957243,0.00023387042],"domain_scores_gemma":[0.9969951,0.0017140076,0.00019883472,0.00031512938,0.0005621939,0.00021477272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029477738,0.0009174214,0.0013354135,0.0015583743,0.0018720654,0.0030866724,0.002993556,0.0025916586,0.020255694],"category_scores_gemma":[0.010366611,0.0007248448,0.0018301377,0.0020253593,0.0033512977,0.0071696006,0.0035531085,0.005328537,0.0023312634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007331372,0.000012266058,0.000032305543,0.000017315542,0.0000043410773,0.000016316148,0.000051955027,0.0005943126,0.00018258857,0.99590886,0.0011870285,0.0019855283],"study_design_scores_gemma":[0.0000072775183,0.00000506127,0.00004032559,0.000006933775,0.0000049449786,0.00001686231,0.000014988942,0.0051073846,0.000120004945,0.99312335,0.0015486379,0.0000042744805],"about_ca_topic_score_codex":0.001006798,"about_ca_topic_score_gemma":0.0009171015,"teacher_disagreement_score":0.020255694,"about_ca_system_score_codex":0.0023596515,"about_ca_system_score_gemma":0.0015445387,"threshold_uncertainty_score":0.06776202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48195234,0.0007383809,0.38667122,0.0031587451,0.00022914397,0.00017527623,0.00019394523,0.00016926257,0.12671167],"genre_scores_gemma":[0.96998805,0.00026850097,0.016217524,0.00012965818,0.00003507573,0.00004360036,0.000039780818,0.000018085528,0.0132596735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985195,0.00074604526,0.000056387777,0.00022086268,0.00023707832,0.00022004882],"domain_scores_gemma":[0.9984906,0.000662272,0.00027692842,0.00024156475,0.00013361545,0.00019495221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021873377,0.0005499678,0.0006904747,0.0007175581,0.0011392604,0.002768275,0.00088886556,0.0018926654,0.00975581],"category_scores_gemma":[0.004802589,0.00029047747,0.0007317366,0.0009089629,0.002181919,0.0039372747,0.0024271081,0.0010449751,0.00058445515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027061766,0.00013486689,0.0015598851,0.00010543689,0.0000726942,0.00040990676,0.00041344823,0.037777666,0.0052233865,0.93235886,0.0015274277,0.020145781],"study_design_scores_gemma":[0.0000898186,0.00025268592,0.0010190926,0.00006704852,0.000097789554,0.0005260759,0.0006318006,0.15115808,0.00352076,0.8295923,0.012983437,0.00006113704],"about_ca_topic_score_codex":0.0013242787,"about_ca_topic_score_gemma":0.0014484257,"teacher_disagreement_score":0.00975581,"about_ca_system_score_codex":0.0017175801,"about_ca_system_score_gemma":0.0011345434,"threshold_uncertainty_score":0.032636464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277056,0.0012692431,0.35673755,0.0015971379,0.00030304797,0.00005659889,0.0000670299,0.00044940182,0.011814447],"genre_scores_gemma":[0.99286896,0.00014006608,0.006366643,0.00008102438,0.0000673427,0.000009764261,0.000012792794,0.000020118729,0.00043331087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972779,0.00112051,0.000115513816,0.00033667206,0.0005764443,0.00057294656],"domain_scores_gemma":[0.9810244,0.012927107,0.0012421804,0.0018175754,0.0013597881,0.0016289362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004346468,0.00051998766,0.0012152363,0.00060748245,0.0015104193,0.003245687,0.0019657866,0.0014207055,0.0026391088],"category_scores_gemma":[0.02310245,0.00062635355,0.00060664496,0.000742643,0.0015207423,0.004392645,0.0017487304,0.0021191896,0.0004054271],"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.00291767,0.0007696246,0.007830514,0.00029782022,0.00016047881,0.0005348774,0.0010143658,0.33640623,0.024146607,0.54447776,0.0028714677,0.0785726],"study_design_scores_gemma":[0.000099651596,0.00038409463,0.0011854705,0.000017731752,0.000058813064,0.00024338359,0.00017299957,0.8791181,0.0019294493,0.11620332,0.00053386047,0.000053070686],"about_ca_topic_score_codex":0.0011749582,"about_ca_topic_score_gemma":0.0009982664,"teacher_disagreement_score":0.004346468,"about_ca_system_score_codex":0.0012964815,"about_ca_system_score_gemma":0.0018607954,"threshold_uncertainty_score":0.02298665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011727977,0.0009554722,0.9749145,0.00086036546,0.00022042185,0.00008144673,0.00014425952,0.00018385172,0.01091172],"genre_scores_gemma":[0.41554675,0.0017008467,0.5587169,0.000758323,0.0006420113,0.00052900385,0.00057455804,0.0004001567,0.021131475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985877,0.00070337544,0.000038019185,0.00013007056,0.0003508812,0.0001899821],"domain_scores_gemma":[0.9936878,0.0052034464,0.00021188299,0.00035005066,0.00038000394,0.00016677375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003026728,0.0014574523,0.0015059821,0.001232992,0.0009070794,0.0023580506,0.0019910007,0.0020654092,0.009560121],"category_scores_gemma":[0.016340112,0.00076862396,0.0010345381,0.0019654797,0.0017685362,0.0024752002,0.001821352,0.0037857923,0.0010255983],"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.00027810328,0.00018940106,0.0002828235,0.00026375955,0.000051096828,0.000078212186,0.00016540174,0.6831516,0.00093137915,0.21921542,0.010060296,0.08533246],"study_design_scores_gemma":[0.000017918026,0.000020113546,0.000027132774,0.000022765109,0.000008055956,0.000011844018,0.000018729621,0.92428845,0.00025771032,0.0742341,0.0010883779,0.00000480889],"about_ca_topic_score_codex":0.0044982666,"about_ca_topic_score_gemma":0.0056789424,"teacher_disagreement_score":0.009560121,"about_ca_system_score_codex":0.0018983803,"about_ca_system_score_gemma":0.0017374635,"threshold_uncertainty_score":0.031981766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47550687,0.006304508,0.42326564,0.018133441,0.0006617384,0.00015107193,0.0014365657,0.0003327898,0.074207395],"genre_scores_gemma":[0.94946545,0.0027911086,0.034030735,0.00047711257,0.00062811625,0.00014597233,0.0007291006,0.00019958086,0.011532847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985885,0.00052495516,0.00006748904,0.00015769666,0.0004210405,0.00024026707],"domain_scores_gemma":[0.97089314,0.02535667,0.001240188,0.0007856463,0.0008687476,0.00085562235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022809284,0.0009990195,0.001585475,0.0017239511,0.0011684959,0.0039047233,0.0018819788,0.0023859513,0.0069499034],"category_scores_gemma":[0.026902528,0.0006147001,0.0011202652,0.0014754744,0.0030218575,0.007871596,0.0030836745,0.0045189857,0.00038490637],"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.0002758877,0.00010673824,0.002227351,0.00022160528,0.00004663555,0.0001858339,0.00022247134,0.3255684,0.0007332937,0.65171045,0.005154263,0.013547063],"study_design_scores_gemma":[0.00002042739,0.000017720986,0.00043302335,0.000022810294,0.000010514737,0.000034131197,0.000049547394,0.54926157,0.00015604666,0.44919378,0.00078509987,0.00001536037],"about_ca_topic_score_codex":0.0041863965,"about_ca_topic_score_gemma":0.0031211562,"teacher_disagreement_score":0.0069499034,"about_ca_system_score_codex":0.0023866564,"about_ca_system_score_gemma":0.0016687997,"threshold_uncertainty_score":0.023249745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3082837,0.0021939173,0.6393716,0.005328939,0.00024104636,0.00032473804,0.0004455475,0.00036188055,0.04344869],"genre_scores_gemma":[0.9606075,0.0012497376,0.026928468,0.00042174518,0.00024609166,0.00019433544,0.000154595,0.00014024662,0.010057262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997561,0.00094418024,0.0001228666,0.0005422628,0.00029927125,0.00053044694],"domain_scores_gemma":[0.97405946,0.01970862,0.0021867668,0.0010536206,0.0020421678,0.0009494172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044130366,0.0019036625,0.003184045,0.0021078174,0.0012398178,0.006180797,0.002612753,0.0033260582,0.0057886518],"category_scores_gemma":[0.043455023,0.002527893,0.001762769,0.0015022061,0.006332776,0.00798305,0.0034569749,0.004204182,0.00046792824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036744482,0.00030902942,0.0012880972,0.00026123493,0.00011263199,0.00019457277,0.00025029926,0.09922487,0.003546581,0.8754883,0.0027940483,0.01616298],"study_design_scores_gemma":[0.00013629852,0.00008025922,0.0011052428,0.00006839606,0.00007099366,0.00013566231,0.00011881175,0.42899552,0.0015818997,0.56656176,0.0010629877,0.00008218759],"about_ca_topic_score_codex":0.0041060355,"about_ca_topic_score_gemma":0.0018843199,"teacher_disagreement_score":0.006180797,"about_ca_system_score_codex":0.0034822095,"about_ca_system_score_gemma":0.0046350583,"threshold_uncertainty_score":0.025265276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7409045,0.0014217694,0.11695572,0.0009940986,0.00059063203,0.00007571475,0.0005268472,0.0002020522,0.13832876],"genre_scores_gemma":[0.9483958,0.0023201061,0.019650672,0.00028086986,0.0002099253,0.00006469587,0.0005931154,0.00021908717,0.028265806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976486,0.00005494478,0.0000108628155,0.00003097658,0.00005863317,0.00007976841],"domain_scores_gemma":[0.9993424,0.00020938991,0.00012655032,0.0000619067,0.000106735904,0.0001530164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381683,0.0006115801,0.00034705983,0.0010737041,0.00083974237,0.001730793,0.0005102234,0.00036251664,0.007865684],"category_scores_gemma":[0.0014727679,0.00030131303,0.00023331509,0.0008831939,0.0012522294,0.0017259216,0.0012959156,0.0009975737,0.0011775414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016848817,0.0000320469,0.0011271911,0.000075413314,0.0000070713877,0.00020411758,0.00037858644,0.011518664,0.0040073106,0.95787233,0.00287801,0.021730723],"study_design_scores_gemma":[0.000030917952,0.000037031445,0.0009068478,0.00006324572,0.0000087801245,0.00012812177,0.0005470586,0.020024182,0.0020886671,0.9647061,0.011435319,0.000023702585],"about_ca_topic_score_codex":0.0012190946,"about_ca_topic_score_gemma":0.0019014213,"teacher_disagreement_score":0.007865684,"about_ca_system_score_codex":0.00068427174,"about_ca_system_score_gemma":0.00042537213,"threshold_uncertainty_score":0.026313365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33569884,0.0005561831,0.64086753,0.0046122065,0.0007646928,0.00018687845,0.00025169284,0.0005015912,0.016560376],"genre_scores_gemma":[0.9639447,0.00019515809,0.021417757,0.00049676496,0.00029395014,0.00005188578,0.00008385133,0.000072169256,0.013443857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560416,0.0009655068,0.00018861811,0.00084157847,0.0009450325,0.0014550966],"domain_scores_gemma":[0.9757311,0.013236124,0.0023201657,0.0028002572,0.0030341898,0.0028781167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007976882,0.0006967663,0.00203457,0.0011694902,0.0018692939,0.0050031887,0.0049423757,0.0031932297,0.009617152],"category_scores_gemma":[0.030519882,0.0013373755,0.0010973979,0.0017128551,0.0022489328,0.0070406827,0.0025583422,0.004443483,0.0010297033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013248766,0.00065806217,0.0071146465,0.00014610143,0.00010384922,0.0014404191,0.00080614304,0.122167066,0.004675364,0.81255,0.008308272,0.040705137],"study_design_scores_gemma":[0.00011004031,0.00015224278,0.00087223685,0.000018394894,0.000055458637,0.00037047462,0.00022220146,0.800262,0.0012223717,0.19543542,0.0012173529,0.00006181326],"about_ca_topic_score_codex":0.004791291,"about_ca_topic_score_gemma":0.0038758914,"teacher_disagreement_score":0.009617152,"about_ca_system_score_codex":0.003766056,"about_ca_system_score_gemma":0.0036676775,"threshold_uncertainty_score":0.04218626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40232298,0.0017134568,0.37138766,0.005280646,0.0006183668,0.00013877486,0.00075271446,0.00040837863,0.21737708],"genre_scores_gemma":[0.9359977,0.0006112412,0.0214381,0.00063860905,0.00044069948,0.000117873824,0.00053617806,0.00019201942,0.040027466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782443,0.000661076,0.00009187584,0.00040095043,0.00059691974,0.00042482634],"domain_scores_gemma":[0.99582195,0.0021486818,0.0005152117,0.00056986336,0.00036425228,0.0005800337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022730248,0.000841054,0.0012813129,0.0022345304,0.0021394407,0.0037259634,0.0013710434,0.0015200865,0.014299451],"category_scores_gemma":[0.00703647,0.0007232571,0.001498047,0.0008790043,0.005034558,0.0049275486,0.004351372,0.0037636538,0.0012924843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047053425,0.000017416893,0.00008662649,0.00001680108,0.000007087702,0.000024852705,0.00007807914,0.0013599988,0.00042553217,0.99586475,0.0005885014,0.0014833543],"study_design_scores_gemma":[0.000020690684,0.000027106063,0.00015189001,0.000010355702,0.000005560978,0.0000760568,0.000061706916,0.006326337,0.000427884,0.99076813,0.002112834,0.000011457919],"about_ca_topic_score_codex":0.0006474621,"about_ca_topic_score_gemma":0.00044521948,"teacher_disagreement_score":0.014299451,"about_ca_system_score_codex":0.0011042799,"about_ca_system_score_gemma":0.00062461046,"threshold_uncertainty_score":0.047836423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092538446,0.0063917735,0.814247,0.0049833497,0.00086502754,0.0001775269,0.0002704882,0.0006650248,0.07986133],"genre_scores_gemma":[0.6931373,0.0026953246,0.26626465,0.001381336,0.00062014576,0.000534492,0.00060754066,0.0009381424,0.033821147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982742,0.0009918945,0.000046760233,0.0001809581,0.000326732,0.00017941928],"domain_scores_gemma":[0.98687077,0.010462391,0.0004508583,0.0006564465,0.001066353,0.0004931878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053123436,0.0010479544,0.0015658082,0.002333801,0.0016601225,0.0026741999,0.0033140604,0.0031029151,0.008695159],"category_scores_gemma":[0.040003955,0.00074135786,0.0010189853,0.0015183396,0.0039785006,0.0030765631,0.004375337,0.0035840317,0.0012501767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005011487,0.00011963324,0.0017796365,0.0003288545,0.00008009972,0.00010176106,0.00021236474,0.19236827,0.0015213998,0.74386406,0.009302389,0.049820397],"study_design_scores_gemma":[0.000041266325,0.00004966971,0.00034810943,0.000089794354,0.000016246753,0.000050145947,0.000047616708,0.8400255,0.0003681637,0.15656339,0.0023772565,0.00002289888],"about_ca_topic_score_codex":0.007529614,"about_ca_topic_score_gemma":0.00614977,"teacher_disagreement_score":0.008695159,"about_ca_system_score_codex":0.0019541383,"about_ca_system_score_gemma":0.0028523917,"threshold_uncertainty_score":0.0290882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26462483,0.002385868,0.6919902,0.0043629245,0.0003027144,0.00036237636,0.0023508666,0.00076976046,0.032850493],"genre_scores_gemma":[0.91549176,0.00085204834,0.029124802,0.00021289979,0.00010395151,0.00024021373,0.00056864304,0.00018352093,0.053221982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964599,0.0018612396,0.00015721757,0.00052933436,0.0003487615,0.00064345874],"domain_scores_gemma":[0.99137866,0.006679506,0.00086065906,0.00024896977,0.0004333063,0.00039889527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006123065,0.0018299478,0.0048232335,0.0022862714,0.0011606213,0.0050511383,0.0026211669,0.0038451713,0.016140403],"category_scores_gemma":[0.010874551,0.0024468002,0.0025701663,0.0037670936,0.0018325958,0.0058646044,0.0027367922,0.0023476533,0.0014442502],"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.0001365067,0.00006742212,0.0005232837,0.00006934376,0.000067513174,0.000111338115,0.000033593235,0.97289014,0.00016377462,0.022119066,0.00058686035,0.0032311075],"study_design_scores_gemma":[0.000018419007,0.000035267512,0.00025902942,0.0000076038427,0.00002185937,0.000020911855,0.000024584137,0.9868709,0.000059093403,0.01241854,0.0002441739,0.000019585177],"about_ca_topic_score_codex":0.021357786,"about_ca_topic_score_gemma":0.015555554,"teacher_disagreement_score":0.021357786,"about_ca_system_score_codex":0.0037271297,"about_ca_system_score_gemma":0.002990434,"threshold_uncertainty_score":0.053995013},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003625812,0.00012134293,0.99485934,0.0001479521,0.00003915289,0.00007255314,0.000092951,0.00040384853,0.00063706003],"genre_scores_gemma":[0.12924612,0.00018025591,0.8661751,0.00034133374,0.00012836077,0.00081378873,0.0007936512,0.00031397297,0.0020074558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978531,0.0010980398,0.00010410849,0.00031320972,0.00045441787,0.0001771805],"domain_scores_gemma":[0.9891102,0.008183057,0.00028725548,0.0010211624,0.0010878068,0.00031055283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964388,0.0013643638,0.002648176,0.0015285675,0.0012453995,0.0018684275,0.0043117045,0.0029768604,0.0059030997],"category_scores_gemma":[0.019477956,0.001850145,0.0017945401,0.002259842,0.00231972,0.002046353,0.0034603195,0.005501296,0.0012737893],"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.00053005497,0.00015882614,0.0010798838,0.000222703,0.00010700253,0.00010199957,0.00017787633,0.8090268,0.0019650594,0.048103943,0.0071758167,0.13135001],"study_design_scores_gemma":[0.000016563152,0.0000113429305,0.000025030991,0.000007953167,0.0000038193316,0.0000065947092,0.0000037061363,0.9930106,0.00019334807,0.0063934736,0.00032291422,0.0000047532217],"about_ca_topic_score_codex":0.018194044,"about_ca_topic_score_gemma":0.017352566,"teacher_disagreement_score":0.018194044,"about_ca_system_score_codex":0.0014230941,"about_ca_system_score_gemma":0.004189127,"threshold_uncertainty_score":0.036176324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046251738,0.02967673,0.8318433,0.03577402,0.0063392017,0.000107687105,0.000598185,0.0002724519,0.09076332],"genre_scores_gemma":[0.15062216,0.02912472,0.7468079,0.015670566,0.021299643,0.0005139734,0.0009906361,0.0011481949,0.0338223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853616,0.006790385,0.00072356756,0.0013707991,0.004948458,0.00080525427],"domain_scores_gemma":[0.97738034,0.01657007,0.0005791446,0.002397776,0.0022679854,0.0008046145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019742286,0.0020836876,0.0035565575,0.00495399,0.0038294243,0.007398793,0.0055634314,0.0049965465,0.00949049],"category_scores_gemma":[0.04080918,0.0017428882,0.0049675526,0.0066833696,0.008267406,0.016194757,0.006879476,0.021077998,0.0025267894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035530604,0.00002658476,0.0000704511,0.00013145214,0.000037533267,0.00006116691,0.00014745913,0.0025616456,0.00025417397,0.9682198,0.013434575,0.015019652],"study_design_scores_gemma":[0.000019727557,0.000018500858,0.000116843075,0.00009472262,0.000018552926,0.00006217295,0.000039276583,0.01746567,0.00014195622,0.9670674,0.014911159,0.000044096767],"about_ca_topic_score_codex":0.004455635,"about_ca_topic_score_gemma":0.0055042757,"teacher_disagreement_score":0.019742286,"about_ca_system_score_codex":0.004804691,"about_ca_system_score_gemma":0.0023826791,"threshold_uncertainty_score":0.10440838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29589304,0.0020496727,0.5122699,0.008508605,0.0005954352,0.0005780964,0.0019173879,0.0020489767,0.1761389],"genre_scores_gemma":[0.89418185,0.0007763952,0.04747461,0.0019802288,0.0004333299,0.00058882363,0.0011251176,0.00069344987,0.052746236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99304754,0.0026763293,0.00031486948,0.0015548451,0.0009496327,0.0014567612],"domain_scores_gemma":[0.95177513,0.033195183,0.0025254425,0.0057346737,0.0030638687,0.0037057544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063241944,0.0016010047,0.005430844,0.0030961256,0.00463961,0.006371487,0.0055387644,0.0064459303,0.032833625],"category_scores_gemma":[0.06755746,0.0020977247,0.0030989512,0.0033302484,0.0044926032,0.011435409,0.008670525,0.008773774,0.005322437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005662258,0.00013505672,0.00062269333,0.00018292735,0.000095314885,0.00014865777,0.00039817384,0.011901182,0.0013623358,0.9605862,0.008712603,0.015288701],"study_design_scores_gemma":[0.00008215322,0.00003617396,0.0001129969,0.000023500868,0.000022960192,0.000058115584,0.000066214365,0.04406829,0.00036849012,0.9534834,0.0016633206,0.000014462595],"about_ca_topic_score_codex":0.0016403213,"about_ca_topic_score_gemma":0.0016215205,"teacher_disagreement_score":0.032833625,"about_ca_system_score_codex":0.0033312915,"about_ca_system_score_gemma":0.0025229705,"threshold_uncertainty_score":0.10983944},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17952311,0.0015092631,0.8063606,0.0012768178,0.00008458898,0.00016911078,0.0003345441,0.0007870312,0.009954944],"genre_scores_gemma":[0.83861023,0.0010621684,0.15618141,0.00037463065,0.000117322284,0.00025218655,0.00053430424,0.00029261856,0.0025751367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975938,0.0011492054,0.00008205918,0.00035409408,0.00045574026,0.00036508977],"domain_scores_gemma":[0.98896104,0.008079789,0.00080116984,0.0010189841,0.0006462964,0.0004926179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037129722,0.0022373227,0.0017730355,0.00081658637,0.0006451849,0.0019231645,0.0025011066,0.0018923222,0.002071487],"category_scores_gemma":[0.017426785,0.0005595712,0.0008788343,0.0014929433,0.0014342996,0.002715884,0.0020618583,0.0018147894,0.0006263732],"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.0009368425,0.00020810482,0.0013516513,0.0002575984,0.00009578579,0.000070997485,0.00014972684,0.86997247,0.0067862803,0.05269704,0.004428252,0.06304526],"study_design_scores_gemma":[0.000034331122,0.00013244346,0.00020815068,0.00001042453,0.000011818658,0.000034883004,0.000033822795,0.97877926,0.001721353,0.018707057,0.00031699348,0.000009453339],"about_ca_topic_score_codex":0.0016211848,"about_ca_topic_score_gemma":0.0015424922,"teacher_disagreement_score":0.0037129722,"about_ca_system_score_codex":0.0022173147,"about_ca_system_score_gemma":0.0019679319,"threshold_uncertainty_score":0.019636273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048968237,0.0005470378,0.94272345,0.0007650353,0.000084666506,0.00016691748,0.00039718967,0.0004213816,0.0059261145],"genre_scores_gemma":[0.6522718,0.0010490606,0.33410543,0.00024364467,0.0003459532,0.00051633373,0.00079724,0.0003327288,0.010337869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.00058243325,0.000058083988,0.00024482273,0.00023242658,0.00019400271],"domain_scores_gemma":[0.98697144,0.011104502,0.0006968986,0.0005763124,0.000373718,0.00027721876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033990375,0.0015860323,0.0029198856,0.0014538433,0.0010693291,0.002300256,0.003051355,0.0016299488,0.0069771004],"category_scores_gemma":[0.008841428,0.0016389567,0.0021820394,0.0033030927,0.0012958316,0.004979363,0.0014877971,0.0018940576,0.0005892161],"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.00021209582,0.000107018925,0.0004023954,0.00014183478,0.00007204699,0.00005417676,0.00004205559,0.9584119,0.00075038616,0.015139111,0.0020185972,0.022648372],"study_design_scores_gemma":[0.000023809047,0.000043807828,0.00014221147,0.000005784114,0.000019940024,0.000019637828,0.0000090256635,0.98261297,0.00021860363,0.016722172,0.00017442236,0.000007593003],"about_ca_topic_score_codex":0.004637292,"about_ca_topic_score_gemma":0.0056357165,"teacher_disagreement_score":0.0069771004,"about_ca_system_score_codex":0.0026069619,"about_ca_system_score_gemma":0.0032731926,"threshold_uncertainty_score":0.023340762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961688,0.0018137146,0.87393224,0.0018881389,0.00034094977,0.000050568502,0.0001644269,0.00014742774,0.025493827],"genre_scores_gemma":[0.8922851,0.001350727,0.077175334,0.00026762157,0.00034966884,0.00014258224,0.00015726284,0.00019525106,0.028076457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993962,0.00022998989,0.000022228069,0.000049407303,0.00018654035,0.000115559196],"domain_scores_gemma":[0.9968555,0.0022353781,0.00018385384,0.00018633586,0.00035599928,0.00018293894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029518087,0.00061455776,0.0007897749,0.0010845858,0.00068526017,0.00232632,0.0019084476,0.00076868915,0.0042528985],"category_scores_gemma":[0.010410721,0.00062205765,0.0006703218,0.0011206537,0.0014739732,0.0037715489,0.0014114215,0.0024945082,0.00039070332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008488038,0.00005188307,0.00039307887,0.000051154107,0.000021552969,0.00006619663,0.00021103397,0.10157879,0.0011916093,0.8876119,0.0014134783,0.007324422],"study_design_scores_gemma":[0.000012386415,0.000005062219,0.00009311622,0.00000893248,0.0000056971285,0.00000977936,0.000016569782,0.86931896,0.0001326079,0.1296882,0.0007010185,0.000007696836],"about_ca_topic_score_codex":0.005045261,"about_ca_topic_score_gemma":0.0037013558,"teacher_disagreement_score":0.005045261,"about_ca_system_score_codex":0.0025863133,"about_ca_system_score_gemma":0.00231691,"threshold_uncertainty_score":0.018765152},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002424718,0.0017839678,0.96705276,0.0055903816,0.0005682458,0.0013907128,0.0012723038,0.0023978774,0.017519103],"genre_scores_gemma":[0.01718924,0.00090780354,0.97165316,0.0012834024,0.00027108844,0.0029740294,0.0013667154,0.0009976702,0.0033570463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.94756186,0.03334121,0.00648848,0.0014418947,0.010311168,0.0008554549],"domain_scores_gemma":[0.79203403,0.13679744,0.004797647,0.023224842,0.041511584,0.0016345228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03480418,0.0028222518,0.0018826545,0.0050651454,0.0021167598,0.0054733274,0.009508629,0.0062874854,0.016307212],"category_scores_gemma":[0.22342108,0.0019115884,0.0024283149,0.0037764895,0.003831315,0.0048766276,0.004796619,0.009947669,0.009663689],"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.0003188351,0.0012034421,0.0023799767,0.002140524,0.00017872208,0.00094953616,0.0009797759,0.07924627,0.004850587,0.47966582,0.14235109,0.28573552],"study_design_scores_gemma":[0.00049203396,0.00039623195,0.0011474135,0.003254214,0.00008609419,0.0005663827,0.0005380748,0.28002393,0.009020852,0.55775213,0.14652206,0.0002006506],"about_ca_topic_score_codex":0.006499689,"about_ca_topic_score_gemma":0.009153382,"teacher_disagreement_score":0.03480418,"about_ca_system_score_codex":0.0018153706,"about_ca_system_score_gemma":0.0059181,"threshold_uncertainty_score":0.18406427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06884121,0.00038162826,0.894128,0.003721614,0.00020767178,0.00030466646,0.0010909861,0.00045341376,0.030870836],"genre_scores_gemma":[0.4710405,0.0013187337,0.4935309,0.0008867549,0.00035074324,0.00073743326,0.0033592721,0.0005252979,0.028250368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988158,0.00045906098,0.000039245406,0.00033867388,0.00018041441,0.00016686591],"domain_scores_gemma":[0.99592835,0.002715084,0.00029291198,0.00050137646,0.00025263306,0.00030965797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284814,0.00090115005,0.0008760969,0.0006685507,0.0012895016,0.0020115555,0.0021020442,0.0020957293,0.016090814],"category_scores_gemma":[0.008446761,0.00071562344,0.0011910332,0.0014983311,0.0012268154,0.006523738,0.0022339744,0.003023419,0.001121075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036293367,0.00031846747,0.0011021456,0.0006155012,0.00009651947,0.00023492893,0.00025195844,0.23229356,0.0031929393,0.58530253,0.029700013,0.14652851],"study_design_scores_gemma":[0.00013036423,0.00015627735,0.000542857,0.00006117184,0.000055090142,0.00020878046,0.00016069027,0.26232508,0.003100322,0.7189874,0.014243731,0.000028191089],"about_ca_topic_score_codex":0.0016168377,"about_ca_topic_score_gemma":0.0019596815,"teacher_disagreement_score":0.016090814,"about_ca_system_score_codex":0.0015099534,"about_ca_system_score_gemma":0.0020792987,"threshold_uncertainty_score":0.053829134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049187362,0.0022312917,0.88437915,0.0037228828,0.00045526904,0.00042830527,0.0013272297,0.00044092743,0.057827555],"genre_scores_gemma":[0.4150538,0.002822651,0.53989,0.002129568,0.0009919432,0.001158005,0.002465255,0.0011634168,0.03432534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987317,0.00053580204,0.00003249619,0.00022604332,0.0002448852,0.00022909533],"domain_scores_gemma":[0.9958352,0.0034170838,0.00015293407,0.00018947,0.00021650105,0.00018875887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021506543,0.0027606047,0.0021889282,0.0012347244,0.0009968356,0.0030507124,0.0029380429,0.0030992194,0.01774362],"category_scores_gemma":[0.009376697,0.0012440154,0.0016885913,0.0026269748,0.0016057556,0.0041186903,0.0033628226,0.0047600497,0.0016069333],"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.00046052597,0.00033451905,0.00054321653,0.0008142775,0.000109947076,0.00025811666,0.00035555716,0.77392125,0.0024367284,0.12831031,0.027746104,0.06470953],"study_design_scores_gemma":[0.00007697061,0.00009753075,0.00026392535,0.000107915315,0.000047422935,0.00008230146,0.00018264253,0.87245774,0.00051529024,0.12123847,0.0049130605,0.000016678812],"about_ca_topic_score_codex":0.005416098,"about_ca_topic_score_gemma":0.0058613946,"teacher_disagreement_score":0.01774362,"about_ca_system_score_codex":0.002241093,"about_ca_system_score_gemma":0.0016791575,"threshold_uncertainty_score":0.0593583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05125591,0.00062744465,0.9405293,0.00022761858,0.00015750508,0.00026986792,0.00027207404,0.0005618923,0.006098361],"genre_scores_gemma":[0.8837972,0.00042904884,0.1062094,0.00007276949,0.0000843354,0.00016975467,0.00022428013,0.00013192696,0.008881384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998226,0.0005660069,0.00012990086,0.00032154698,0.00045712176,0.00029939678],"domain_scores_gemma":[0.99613416,0.0025066973,0.00028985515,0.00043463433,0.00042633872,0.00020837742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032520366,0.0019928804,0.0042297333,0.0012834014,0.0008395175,0.0023985682,0.003983982,0.0015435213,0.0074062697],"category_scores_gemma":[0.006202985,0.001967047,0.0020293796,0.0026515322,0.0016668196,0.00404825,0.0014294249,0.001777382,0.00091520214],"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.00038326913,0.00009371405,0.0002015459,0.0001319828,0.000054759344,0.00009205777,0.000032937915,0.96156824,0.0012234991,0.016646348,0.0008068935,0.018764794],"study_design_scores_gemma":[0.00004075803,0.00008398171,0.00012509682,0.000008263905,0.000026311347,0.000029663466,0.0000074958803,0.986489,0.00045025581,0.012507155,0.00021144454,0.00002052394],"about_ca_topic_score_codex":0.006128985,"about_ca_topic_score_gemma":0.0062231733,"teacher_disagreement_score":0.0074062697,"about_ca_system_score_codex":0.0026252538,"about_ca_system_score_gemma":0.0023955626,"threshold_uncertainty_score":0.0247764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1602848,0.0019910308,0.70395243,0.008747812,0.0004323629,0.00032943385,0.0007883625,0.00018195825,0.12329187],"genre_scores_gemma":[0.8701417,0.003601371,0.09524261,0.0024869374,0.0011275162,0.0010456531,0.0008783954,0.00035787432,0.025117967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935324,0.003822914,0.0002762853,0.0007120442,0.0008278275,0.00082840165],"domain_scores_gemma":[0.9171444,0.07192392,0.0029944766,0.002380145,0.0036537393,0.0019032226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009236067,0.0014177819,0.0040411027,0.0022041188,0.0023264694,0.0046383464,0.004093204,0.0028240397,0.015821911],"category_scores_gemma":[0.05724398,0.0013248263,0.0028988502,0.0022313474,0.0062580123,0.010808274,0.0038571132,0.007598203,0.0013914104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008153761,0.00009152888,0.0008346844,0.000101646256,0.000042222844,0.0001077492,0.00030629156,0.016603071,0.0004410375,0.9704577,0.0031450859,0.007787508],"study_design_scores_gemma":[0.00003940015,0.000033525168,0.00036743112,0.00004108318,0.000017640712,0.00007656027,0.000096631,0.098847255,0.00015877157,0.8986565,0.0016435843,0.000021559896],"about_ca_topic_score_codex":0.004462847,"about_ca_topic_score_gemma":0.002687308,"teacher_disagreement_score":0.015821911,"about_ca_system_score_codex":0.0027234836,"about_ca_system_score_gemma":0.0029448743,"threshold_uncertainty_score":0.05292952},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005843328,0.0011335855,0.98999715,0.00057887245,0.00011279476,0.000053543103,0.00005856047,0.00024938677,0.0019728984],"genre_scores_gemma":[0.3821076,0.0026787664,0.59603304,0.0009567398,0.00083989685,0.00054766616,0.0008591215,0.0006354229,0.015341722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817824,0.0008673876,0.00007182534,0.00017974814,0.00050959707,0.00019307551],"domain_scores_gemma":[0.99451435,0.003608443,0.00027184834,0.00041520962,0.00089730974,0.0002927936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057403506,0.0017020312,0.0034662276,0.0012924697,0.00087189936,0.0021316034,0.0024067631,0.0024167716,0.0034578785],"category_scores_gemma":[0.0145587595,0.001445254,0.0011824341,0.0016050341,0.0017685025,0.0022900573,0.002299222,0.004170518,0.0011349892],"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.00026459325,0.00028557668,0.0010191167,0.00037753183,0.00013317318,0.00010061012,0.00007322412,0.71963334,0.0016674317,0.12439247,0.01455434,0.13749869],"study_design_scores_gemma":[0.000008966909,0.000014512609,0.000052979824,0.000011683863,0.000005936971,0.000008657548,0.0000029905023,0.97903216,0.00014704133,0.020239463,0.00047197982,0.0000036543422],"about_ca_topic_score_codex":0.004416898,"about_ca_topic_score_gemma":0.0040708045,"teacher_disagreement_score":0.0057403506,"about_ca_system_score_codex":0.0014190868,"about_ca_system_score_gemma":0.0021202818,"threshold_uncertainty_score":0.030358195},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036396082,0.0022220802,0.79868585,0.0013534883,0.00021164304,0.0003378336,0.0014003308,0.0019732758,0.15741931],"genre_scores_gemma":[0.26083225,0.0019964417,0.6961758,0.00062042807,0.00029681166,0.00028239316,0.002571729,0.00064952805,0.036574636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730885,0.00038393302,0.000139879,0.0003635745,0.001274695,0.00052902015],"domain_scores_gemma":[0.99808806,0.0005345499,0.00010696202,0.0005786803,0.00042148173,0.00027032776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515426,0.00082029426,0.0016587173,0.0026968112,0.0027438982,0.0045368746,0.0035026479,0.0013143221,0.02814529],"category_scores_gemma":[0.0038178295,0.0012318821,0.0016357228,0.0047527114,0.0013924185,0.005430167,0.0046084044,0.0047588795,0.005916173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020039621,0.0004156369,0.00077697943,0.0004242493,0.00006394318,0.00014547315,0.00044696467,0.057155587,0.003306978,0.6478795,0.024912305,0.264272],"study_design_scores_gemma":[0.000063261126,0.00018105848,0.0006944275,0.00018152613,0.000075325246,0.0002822746,0.0002711383,0.22265111,0.0033479037,0.7176238,0.05456321,0.0000650391],"about_ca_topic_score_codex":0.0045183552,"about_ca_topic_score_gemma":0.0057158144,"teacher_disagreement_score":0.02814529,"about_ca_system_score_codex":0.0024058188,"about_ca_system_score_gemma":0.0029997833,"threshold_uncertainty_score":0.09415537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21468644,0.0013507414,0.5764596,0.0076558506,0.00087787106,0.0005583085,0.0052832398,0.00083263364,0.19229539],"genre_scores_gemma":[0.7979107,0.0011460785,0.09496639,0.001046605,0.0005898106,0.0006337878,0.0052096387,0.00033435586,0.0981627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906725,0.00028707774,0.000042378062,0.00021900646,0.00019464354,0.00018970681],"domain_scores_gemma":[0.99794644,0.0012928352,0.00017828171,0.00014077485,0.0002294693,0.00021211797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011065677,0.0009945328,0.0016002747,0.00060832576,0.0009847024,0.0037199531,0.0013681444,0.0018158668,0.021035166],"category_scores_gemma":[0.004943867,0.00045654562,0.0008611907,0.001338465,0.0009033362,0.0025735425,0.0013823623,0.0027558082,0.0016574243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008601894,0.0005958628,0.0024052176,0.0009475638,0.00027537806,0.00074001105,0.00033085732,0.2697637,0.0033088587,0.45048577,0.10156287,0.16872369],"study_design_scores_gemma":[0.00025476716,0.0003463865,0.0015845479,0.00006381558,0.00003656584,0.00049077976,0.00020879353,0.44692698,0.0009850832,0.5253665,0.023703182,0.000032513963],"about_ca_topic_score_codex":0.0022657854,"about_ca_topic_score_gemma":0.0014536773,"teacher_disagreement_score":0.021035166,"about_ca_system_score_codex":0.000842436,"about_ca_system_score_gemma":0.001334739,"threshold_uncertainty_score":0.07036966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030348776,0.003827004,0.98460627,0.00046488302,0.00027732216,0.000041819425,0.00007180308,0.00021398041,0.0074620117],"genre_scores_gemma":[0.099409856,0.005172866,0.8848808,0.0003189005,0.00070421887,0.00035145544,0.00037186674,0.00041296094,0.008377084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972197,0.001230185,0.00013186429,0.00037963933,0.0008367208,0.00020201603],"domain_scores_gemma":[0.9906222,0.0075567956,0.00031010289,0.00067990564,0.0006323016,0.00019863246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004512551,0.0018496888,0.0021797235,0.0021265743,0.0008763653,0.0043414524,0.0033998664,0.0024384127,0.009194971],"category_scores_gemma":[0.016625842,0.0016679888,0.0013171805,0.006678598,0.002718506,0.0063089426,0.0020640101,0.009308201,0.0021383222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026718728,0.0002959985,0.00038629383,0.00064750126,0.00008964345,0.00006481515,0.00017090561,0.27201992,0.0014939735,0.49432418,0.012630085,0.21760957],"study_design_scores_gemma":[0.00007902507,0.000067783774,0.00013092469,0.00012252209,0.000025128646,0.000040465464,0.00003460521,0.7236337,0.0006830033,0.26572168,0.009439293,0.000021850725],"about_ca_topic_score_codex":0.0028357627,"about_ca_topic_score_gemma":0.0019424834,"teacher_disagreement_score":0.009194971,"about_ca_system_score_codex":0.0019282794,"about_ca_system_score_gemma":0.0016126857,"threshold_uncertainty_score":0.030760229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042153634,0.009812345,0.88613516,0.0054174936,0.00067058206,0.00011032682,0.00045665354,0.0005405639,0.054703254],"genre_scores_gemma":[0.81665814,0.009252368,0.13750072,0.0020529027,0.0024988004,0.0008332954,0.0012730806,0.00075383915,0.029176872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906036,0.0045318394,0.0003734527,0.00081208756,0.002526577,0.0011523438],"domain_scores_gemma":[0.9032485,0.08278548,0.0035189132,0.0027876706,0.0051633106,0.002496097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018833729,0.0044023613,0.003681124,0.0068874005,0.001831674,0.01265272,0.0049751545,0.0048108296,0.012020759],"category_scores_gemma":[0.07607376,0.0018194425,0.0026598854,0.0059173903,0.0059687165,0.010263801,0.0060506356,0.010717231,0.0014338851],"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.0003316628,0.0001934572,0.000595643,0.00031261786,0.00015788387,0.00012279487,0.00024636608,0.1586417,0.0011165825,0.8117369,0.004734814,0.021809645],"study_design_scores_gemma":[0.00003852924,0.000047618298,0.00036075932,0.00018816526,0.000059050817,0.00005563571,0.00004830051,0.5401648,0.0005144135,0.4566318,0.0018375174,0.00005337194],"about_ca_topic_score_codex":0.0027841588,"about_ca_topic_score_gemma":0.0023815664,"teacher_disagreement_score":0.018833729,"about_ca_system_score_codex":0.005103824,"about_ca_system_score_gemma":0.003009017,"threshold_uncertainty_score":0.099603474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40857267,0.0059676585,0.21526313,0.034018338,0.0011146211,0.00017036956,0.0016189402,0.0010984628,0.3321758],"genre_scores_gemma":[0.9550955,0.0019297239,0.022896476,0.0008913133,0.0010536779,0.00017441559,0.0006201206,0.0003599755,0.016978834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747366,0.00068179955,0.00010177165,0.0004131547,0.00098779,0.00034185316],"domain_scores_gemma":[0.9835284,0.011539178,0.0009052736,0.002596668,0.0007870953,0.00064338767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017645899,0.00074324734,0.0016678745,0.0017062698,0.0020912336,0.0057571423,0.0024049045,0.0024478203,0.017816417],"category_scores_gemma":[0.022758674,0.00079662894,0.0012051096,0.0027336031,0.0050227223,0.0135711795,0.0040994366,0.004870111,0.0014167966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004110715,0.000027144319,0.000381327,0.00005868935,0.000011120984,0.000042770935,0.0001059807,0.010541786,0.00023952141,0.9739817,0.0053989543,0.0091699455],"study_design_scores_gemma":[0.00001004685,0.0000042998763,0.0001909402,0.000006447447,0.000004119037,0.000029623006,0.00003966587,0.024486758,0.00010669272,0.9735204,0.001594125,0.0000069118914],"about_ca_topic_score_codex":0.0019256731,"about_ca_topic_score_gemma":0.0011213976,"teacher_disagreement_score":0.017816417,"about_ca_system_score_codex":0.0028204205,"about_ca_system_score_gemma":0.0014101214,"threshold_uncertainty_score":0.059601903},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2437465,0.009763708,0.64143974,0.0066913203,0.00065685913,0.00015179336,0.00046784946,0.0011876563,0.0958946],"genre_scores_gemma":[0.9598042,0.0031126358,0.024770774,0.00062139065,0.0010671386,0.00015230839,0.00024884997,0.00035788823,0.0098648835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980215,0.0008300145,0.0000961644,0.00021365503,0.00054528716,0.0002934839],"domain_scores_gemma":[0.97438127,0.019603536,0.0013713686,0.0012872064,0.0025950659,0.00076162664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00707472,0.001200635,0.0016473542,0.0038282096,0.0016395272,0.0039624567,0.0027309721,0.0019276161,0.004449826],"category_scores_gemma":[0.057855934,0.0008688378,0.0015941081,0.003003412,0.004066241,0.006163536,0.0024272418,0.005299285,0.0007658661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151063,0.00016425074,0.002341838,0.00017167378,0.000050089493,0.00038053512,0.0005101715,0.04173887,0.0020411562,0.9341866,0.0042422437,0.014021539],"study_design_scores_gemma":[0.000023449944,0.000026336176,0.0012957132,0.00008491376,0.000039400158,0.00024716012,0.00014426172,0.5528512,0.00059670064,0.44335592,0.0012778545,0.00005719589],"about_ca_topic_score_codex":0.0042594806,"about_ca_topic_score_gemma":0.0023756656,"teacher_disagreement_score":0.00707472,"about_ca_system_score_codex":0.0037444546,"about_ca_system_score_gemma":0.0019124318,"threshold_uncertainty_score":0.037415087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795125,0.00023775527,0.007906963,0.0009849455,0.000016673024,0.00027012933,0.0002971465,0.00006445276,0.010709283],"genre_scores_gemma":[0.98550767,0.00014172547,0.009112947,0.00007688151,0.000007150044,0.00008890371,0.00017152137,0.000018195768,0.004875046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805343,0.000813663,0.00003087181,0.00011534551,0.00008052898,0.00090618996],"domain_scores_gemma":[0.9956728,0.0032621843,0.00028716956,0.0001608514,0.00026624373,0.00035076364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002720416,0.0005905103,0.0006458093,0.0006534078,0.0024319156,0.002050733,0.0013659137,0.0018916486,0.004432742],"category_scores_gemma":[0.0057855626,0.00053163985,0.0009000568,0.00079454825,0.001138083,0.0008569697,0.000815732,0.000985302,0.0002072067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013214106,0.0017767935,0.051741954,0.00019762116,0.00023253485,0.003343183,0.0015120666,0.88108754,0.002117639,0.015248657,0.0068221167,0.03459842],"study_design_scores_gemma":[0.0007379484,0.0012632763,0.06602652,0.00010043158,0.00027951298,0.0005639585,0.0106813125,0.89972407,0.002774764,0.0073696487,0.010351345,0.00012724371],"about_ca_topic_score_codex":0.6903384,"about_ca_topic_score_gemma":0.7570958,"teacher_disagreement_score":0.30966163,"about_ca_system_score_codex":0.014493802,"about_ca_system_score_gemma":0.009633434,"threshold_uncertainty_score":0.6229706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05020734,0.0003342859,0.94036806,0.0008936157,0.000074914344,0.00007200986,0.00014867682,0.00019443777,0.007706744],"genre_scores_gemma":[0.83510536,0.0008090629,0.15168285,0.0005019771,0.00016927072,0.0004081016,0.00046524755,0.0004724281,0.01038579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951998,0.002455224,0.00027282452,0.00068527524,0.000998178,0.00038856026],"domain_scores_gemma":[0.9918853,0.0042163623,0.0008799243,0.0010292184,0.0010668265,0.00092241477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008086407,0.0015207212,0.0018576406,0.0017758827,0.0012063638,0.0033808611,0.0020574245,0.003410527,0.004341473],"category_scores_gemma":[0.023805663,0.00076157216,0.0012132284,0.0015209335,0.00440331,0.006808944,0.004808043,0.004343386,0.00075581495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056826928,0.000041878335,0.00044254132,0.00008215872,0.0000308453,0.00007835813,0.0001014104,0.13617323,0.0017964165,0.8481671,0.00097571994,0.0120535325],"study_design_scores_gemma":[0.000013583289,0.0000423933,0.00017776935,0.000027112857,0.0000074492914,0.000039313283,0.000025478725,0.44416496,0.00063586235,0.5540738,0.00076595624,0.000026308473],"about_ca_topic_score_codex":0.0015237065,"about_ca_topic_score_gemma":0.0012142285,"teacher_disagreement_score":0.008086407,"about_ca_system_score_codex":0.0036101337,"about_ca_system_score_gemma":0.0020534173,"threshold_uncertainty_score":0.042765558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01946552,0.00083633926,0.97374535,0.00032363372,0.000077453435,0.00006511109,0.00015045113,0.00036718877,0.0049689002],"genre_scores_gemma":[0.4888681,0.0009919502,0.4991387,0.00032668508,0.00018045056,0.0003430353,0.0008964027,0.00027412636,0.00898059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.0002238607,0.00004336833,0.00011471705,0.00023955578,0.00007908002],"domain_scores_gemma":[0.99758136,0.0015347095,0.000120205776,0.00027199351,0.00042185432,0.00006982514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475179,0.0006717226,0.0010844613,0.0009258068,0.00049730187,0.0009125898,0.0015377545,0.0011856994,0.00452272],"category_scores_gemma":[0.006840667,0.0006475161,0.00051807775,0.0009972284,0.00070385437,0.0015412743,0.0011515717,0.0021062063,0.00051529147],"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.00014580502,0.00009276367,0.000486345,0.00014532582,0.00007707677,0.00009221011,0.00006675937,0.75653344,0.0026301595,0.053086463,0.005432817,0.1812109],"study_design_scores_gemma":[0.000010823184,0.000016918035,0.000080047204,0.0000161215,0.00000951135,0.000012738096,0.0000047663107,0.9720008,0.0007167329,0.026367879,0.0007609603,0.0000027681926],"about_ca_topic_score_codex":0.0047368747,"about_ca_topic_score_gemma":0.010157982,"teacher_disagreement_score":0.0047368747,"about_ca_system_score_codex":0.0009533937,"about_ca_system_score_gemma":0.0012761246,"threshold_uncertainty_score":0.015129983},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03146433,0.00024289227,0.9477655,0.00029126706,0.0000680375,0.00012710666,0.00048210376,0.00013571064,0.019423015],"genre_scores_gemma":[0.4239106,0.0005459459,0.55446696,0.00033753805,0.00016582443,0.000641443,0.0010977319,0.00032022898,0.018513715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00010525709,0.000026984528,0.00009239834,0.00016581261,0.00008189428],"domain_scores_gemma":[0.9994301,0.00023618374,0.00007594037,0.00010277808,0.00011037894,0.000044731896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073451194,0.0010379737,0.00049922586,0.00039820073,0.000314518,0.0015001913,0.0015207545,0.00083404256,0.0064618853],"category_scores_gemma":[0.0017659528,0.00044990238,0.0010737332,0.00051821553,0.0007965751,0.0023389137,0.0012645068,0.0021601408,0.0006857962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083754574,0.00009981344,0.0003843671,0.00021134858,0.000029651987,0.0003112879,0.0002091215,0.34295985,0.005609695,0.6091939,0.004436424,0.036470786],"study_design_scores_gemma":[0.00004538532,0.000103745864,0.00018223426,0.00005503363,0.00001716653,0.00011202902,0.00011914809,0.7539609,0.0021206646,0.22942188,0.0138390595,0.000022794855],"about_ca_topic_score_codex":0.00120736,"about_ca_topic_score_gemma":0.0024465665,"teacher_disagreement_score":0.0064618853,"about_ca_system_score_codex":0.00092476176,"about_ca_system_score_gemma":0.00071527506,"threshold_uncertainty_score":0.021617174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24228086,0.001583232,0.7188909,0.0040503913,0.00023655497,0.00041107228,0.0029485945,0.00076567644,0.028832633],"genre_scores_gemma":[0.9064273,0.00074776146,0.03662097,0.00023162128,0.00009471503,0.00033580262,0.000866716,0.00023305888,0.05444201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954998,0.002536166,0.00016637745,0.0006032902,0.00038712812,0.0008071995],"domain_scores_gemma":[0.98782593,0.010041748,0.0008445426,0.00029135944,0.00048886955,0.0005076083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062178234,0.0018409096,0.0045162067,0.002110479,0.0011598582,0.0053001475,0.0029694848,0.0038402446,0.018705174],"category_scores_gemma":[0.012609771,0.0026971265,0.0024928772,0.0037321954,0.0022539468,0.0057497425,0.0027141452,0.0026425929,0.001708661],"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.000154194,0.00007357317,0.0005426014,0.00006649939,0.00006093593,0.00010300532,0.000039355422,0.9671271,0.00016710295,0.028168602,0.0007416255,0.0027553088],"study_design_scores_gemma":[0.000019613677,0.000027236167,0.00022945227,0.0000072339544,0.000015862672,0.00001739151,0.000023201166,0.9851394,0.00006721622,0.014223407,0.00021071672,0.000019302544],"about_ca_topic_score_codex":0.02586775,"about_ca_topic_score_gemma":0.018035602,"teacher_disagreement_score":0.02586775,"about_ca_system_score_codex":0.0044891303,"about_ca_system_score_gemma":0.003110414,"threshold_uncertainty_score":0.06257498},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08699347,0.002082554,0.856396,0.005773521,0.00024725444,0.00016814334,0.0012216886,0.0006220957,0.046495225],"genre_scores_gemma":[0.8397401,0.0024465437,0.12664825,0.0020723012,0.0008269059,0.00075474754,0.0010376849,0.0003893653,0.02608424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99258524,0.0028620928,0.00030605218,0.001157387,0.0019713677,0.0011177385],"domain_scores_gemma":[0.9283742,0.05505743,0.0046569016,0.006945042,0.0029407186,0.0020257286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010393507,0.0018079095,0.0023391563,0.0017376604,0.0018053306,0.0039066914,0.0042412304,0.003151018,0.015603382],"category_scores_gemma":[0.06251522,0.0011313171,0.0018607271,0.002178671,0.004615998,0.012332081,0.004461731,0.006572224,0.0020335694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003256534,0.00008977959,0.0011282635,0.0002843088,0.00007743766,0.00029023248,0.00022803126,0.041672584,0.001846223,0.93155384,0.004998498,0.017505134],"study_design_scores_gemma":[0.000048174614,0.00013564703,0.00044499946,0.000061447674,0.000023390689,0.0002284733,0.00004216062,0.1954127,0.00097146956,0.80030775,0.0022894891,0.000034255623],"about_ca_topic_score_codex":0.0011670764,"about_ca_topic_score_gemma":0.0012625139,"teacher_disagreement_score":0.015603382,"about_ca_system_score_codex":0.0030125924,"about_ca_system_score_gemma":0.001958849,"threshold_uncertainty_score":0.054966748},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029839203,0.00021517844,0.9958424,0.00010871537,0.000022610835,0.000019106552,0.000032677595,0.00015720872,0.0006181421],"genre_scores_gemma":[0.6050628,0.0013837275,0.3879477,0.0002466621,0.00023603355,0.000642299,0.00070642214,0.0004731689,0.0033011872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883541,0.0070144264,0.0005641197,0.0012679555,0.0020508221,0.00074854627],"domain_scores_gemma":[0.888639,0.095182575,0.0050888862,0.00599901,0.004297775,0.00079287286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022305503,0.0019346412,0.0032926542,0.004159004,0.00079764606,0.005229831,0.0030528521,0.003082883,0.0046652867],"category_scores_gemma":[0.11777235,0.0018668682,0.0024130808,0.0023377747,0.004245585,0.0054471716,0.004542037,0.004468384,0.0008981905],"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.00028739465,0.00005739983,0.0004726379,0.00017201705,0.00016080748,0.000035244226,0.0000786155,0.7318099,0.000899632,0.2412645,0.0007623669,0.023999445],"study_design_scores_gemma":[0.000021148817,0.000020827867,0.00010977509,0.000042877255,0.00001602209,0.000012387739,0.000006360627,0.9198921,0.00047188444,0.078967996,0.00041850767,0.000020058025],"about_ca_topic_score_codex":0.0028622905,"about_ca_topic_score_gemma":0.00090691523,"teacher_disagreement_score":0.022305503,"about_ca_system_score_codex":0.002051091,"about_ca_system_score_gemma":0.0023487268,"threshold_uncertainty_score":0.11796421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010774616,0.00006160023,0.9978835,0.00007823219,0.00003109405,0.000027710588,0.00001778469,0.00012200045,0.00070056226],"genre_scores_gemma":[0.05940892,0.00015602125,0.9370088,0.00012720209,0.000070430666,0.0001973217,0.000104249724,0.00011119625,0.0028158529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989568,0.0003844061,0.00005111522,0.00014304767,0.00038012242,0.000084493324],"domain_scores_gemma":[0.99888664,0.00055311254,0.0000687874,0.00013336209,0.00027366317,0.00008444308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001793634,0.00094348076,0.0010930201,0.00069751707,0.00042849165,0.0011044298,0.0014646022,0.0018003278,0.003991186],"category_scores_gemma":[0.004478624,0.00067992,0.0008429335,0.0006416047,0.0010381349,0.0013038787,0.0019072391,0.0022555958,0.0014967389],"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.00014731075,0.00012872159,0.00044345783,0.00023480866,0.00007371184,0.00019824029,0.00014542537,0.56109065,0.009498951,0.22673109,0.006572619,0.19473505],"study_design_scores_gemma":[0.000018798806,0.000042237174,0.000045829613,0.000010381479,0.0000033691194,0.00004884272,0.0000050395433,0.9786324,0.0009825609,0.017788325,0.0024103252,0.000011927547],"about_ca_topic_score_codex":0.0013597348,"about_ca_topic_score_gemma":0.001392638,"teacher_disagreement_score":0.003991186,"about_ca_system_score_codex":0.000550172,"about_ca_system_score_gemma":0.0013837934,"threshold_uncertainty_score":0.013351858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51302665,0.0040785717,0.42895782,0.0035103816,0.00024519552,0.00012884787,0.0018186454,0.00023119718,0.048002686],"genre_scores_gemma":[0.93793225,0.0014529817,0.054831453,0.00025414798,0.0003408776,0.00022740781,0.0008702834,0.000066770604,0.0040238104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99484056,0.0018980897,0.0003919349,0.0011611296,0.0011712492,0.000537045],"domain_scores_gemma":[0.98110044,0.010781024,0.0021623578,0.0020802552,0.001953753,0.0019220712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809977,0.00096466107,0.0011304789,0.0028488734,0.0021074624,0.0054747863,0.0015587177,0.0012603056,0.0028202315],"category_scores_gemma":[0.018807242,0.0005959075,0.0008330426,0.002434161,0.005957891,0.007541347,0.0040814937,0.0027574834,0.00061321526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009830642,0.000021696866,0.001321262,0.00008055884,0.00003416529,0.00006380397,0.00023493456,0.005559711,0.0009983781,0.98175836,0.0016262667,0.008202544],"study_design_scores_gemma":[0.00001741352,0.0000629442,0.0010496475,0.000030383071,0.000012108117,0.00024009435,0.00011129321,0.029054487,0.00088160025,0.9627384,0.005767215,0.000034446268],"about_ca_topic_score_codex":0.000814374,"about_ca_topic_score_gemma":0.00049425825,"teacher_disagreement_score":0.0054747863,"about_ca_system_score_codex":0.0016524792,"about_ca_system_score_gemma":0.00071671954,"threshold_uncertainty_score":0.014860749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033265173,0.0002115992,0.9893482,0.00054029474,0.000056604014,0.00003333289,0.00010564096,0.00015994265,0.006217903],"genre_scores_gemma":[0.38463724,0.0010684769,0.5877274,0.0006654786,0.0003961067,0.0005307707,0.0007082962,0.00050702185,0.02375926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998307,0.0006225207,0.000064154665,0.00024989335,0.00057611126,0.0001803483],"domain_scores_gemma":[0.99525875,0.0034348671,0.00023473479,0.0006308111,0.00032362028,0.000117203585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027269116,0.0015072919,0.0022394464,0.0010756416,0.0006865858,0.003015008,0.0017751051,0.002077648,0.008188088],"category_scores_gemma":[0.016163826,0.00086052995,0.0016627326,0.0013695236,0.0015135406,0.0033826097,0.002961808,0.0047407383,0.0016792823],"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.00017783669,0.000094366966,0.00024499206,0.000120706165,0.000052652318,0.00011628508,0.000067150046,0.5523002,0.0011275101,0.3918569,0.006357029,0.04748435],"study_design_scores_gemma":[0.000016728396,0.000016962073,0.00003334259,0.000016261443,0.000009468406,0.000019142819,0.0000070177784,0.836724,0.00024171216,0.16163474,0.0012751119,0.0000055578657],"about_ca_topic_score_codex":0.003626865,"about_ca_topic_score_gemma":0.0030392422,"teacher_disagreement_score":0.008188088,"about_ca_system_score_codex":0.0018995834,"about_ca_system_score_gemma":0.0021705993,"threshold_uncertainty_score":0.02739191},"labels":[],"label_agreement":null}]}