{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":82,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":82,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"5fc4432d917b","filters":{"venue":"Operations Research Letters"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Natashia Boland","is_ca":false},{"name":"John Dethridge","is_ca":false},{"name":"Irina Dumitrescu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07945066765209823,"gpt":0.3697209552786762,"spread":0.2902702876265779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592293,0.0009167232,0.001598939,0.0007671494,0.0008520875,0.001600324,0.00277652,0.001443815,0.008948724],"category_scores_gemma":[0.005616821,0.00057982,0.0007530284,0.00130641,0.0007737984,0.003286019,0.002635349,0.00336004,0.001434021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001243793,"about_ca_system_score_gemma":0.001802416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003132505,"about_ca_topic_score_gemma":0.005196307,"domain_scores_codex":[0.9988985,0.0004191517,0.00003351722,0.0001628626,0.000306061,0.0001800004],"domain_scores_gemma":[0.9977525,0.001304299,0.0001339709,0.0003724754,0.0003062795,0.000130566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005028733,0.0003977331,0.0006090375,0.0001811306,0.00004093866,0.00006718425,0.0002259732,0.5788074,0.00302699,0.1178184,0.01340721,0.2849152],"study_design_scores_gemma":[0.00006359758,0.00004771459,0.00008907919,0.000006367389,0.000008279304,0.00001439867,0.00001933035,0.9481564,0.0004980398,0.04944697,0.001641839,0.000007996494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02051402,0.0001819003,0.9730948,0.0003255828,0.00008586006,0.00007883246,0.0001008785,0.0005854598,0.005032774],"genre_scores_gemma":[0.2631862,0.0002788525,0.724867,0.0002367179,0.0001631087,0.0003799896,0.0005390318,0.0004401638,0.009908952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008948724,"threshold_uncertainty_score":0.02993643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Applegate","is_ca":false},{"name":"Robert E. Bixby","is_ca":false},{"name":"Vašek Chvátal","is_ca":true},{"name":"William J. Cook","is_ca":false},{"name":"Daniel G. Espinoza","is_ca":false},{"name":"Marcos Goycoolea","is_ca":false},{"name":"Keld Helsgaun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1210279980760836,"gpt":0.374011808626763,"spread":0.2529838105506794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001951339,0.0004392787,0.0004414069,0.000934682,0.001353761,0.001775819,0.0009123021,0.001409369,0.01128619],"category_scores_gemma":[0.009598983,0.0004563953,0.0005710078,0.0009772624,0.001016797,0.00102191,0.0008519012,0.0007447468,0.001057537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002711581,"about_ca_system_score_gemma":0.007812946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05253322,"about_ca_topic_score_gemma":0.08927905,"domain_scores_codex":[0.998301,0.0005468816,0.00007388606,0.0002534072,0.0005482293,0.0002766103],"domain_scores_gemma":[0.9969072,0.0007963285,0.000180895,0.000592005,0.00126249,0.0002612291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001184893,0.0004933075,0.01639938,0.0004518464,0.00007816641,0.0008095367,0.0004586696,0.7445324,0.01092334,0.04299741,0.02928032,0.1523907],"study_design_scores_gemma":[0.0002291451,0.0004946132,0.01212748,0.00009202753,0.00003180483,0.000186965,0.0006737602,0.9509344,0.009582829,0.01410966,0.01149639,0.0000409653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8402116,0.0001699864,0.09489586,0.001000121,0.0002243254,0.0005094571,0.001875892,0.002565393,0.05854729],"genre_scores_gemma":[0.9322682,0.00007152638,0.06011434,0.00006238357,0.000007769296,0.0000459742,0.002196787,0.00029933,0.004933723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05253322,"threshold_uncertainty_score":0.1044549,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Dominique Feillet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06313064214832748,"gpt":0.3542777629418464,"spread":0.291147120793519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756716,0.001137902,0.001025479,0.0005905314,0.0005283983,0.00081612,0.0008715006,0.0008792983,0.009472372],"category_scores_gemma":[0.002091514,0.0004997512,0.0006235815,0.0007635953,0.001044141,0.0007461164,0.001240705,0.001796563,0.001236019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005767876,"about_ca_system_score_gemma":0.0007452804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00363712,"about_ca_topic_score_gemma":0.002507292,"domain_scores_codex":[0.9997354,0.0001212093,0.000006729835,0.00004280259,0.00006570012,0.00002823499],"domain_scores_gemma":[0.9994017,0.0003345152,0.00005067107,0.00006248859,0.0001163897,0.00003430604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001043017,0.00007137521,0.0001306951,0.0001650048,0.00003301185,0.00003871509,0.00006483892,0.8358117,0.003578502,0.08130731,0.008459978,0.07023459],"study_design_scores_gemma":[0.000009534352,0.000017952,0.00002297703,0.000006544751,0.000003450638,0.000003879975,0.000005151094,0.9744221,0.0005426566,0.02389571,0.001065554,0.000004467331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0045176,0.0002233877,0.9891675,0.0001397762,0.0001080967,0.00003629211,0.00007341969,0.0001940426,0.005539851],"genre_scores_gemma":[0.5537704,0.0009320096,0.4105491,0.0003633457,0.0002838249,0.0006888777,0.000622566,0.0006614499,0.03212843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009472372,"threshold_uncertainty_score":0.03168821,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daya Ram Gaur","is_ca":true},{"name":"Apurva Mudgal","is_ca":false},{"name":"Rishi Ranjan Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06715273491549184,"gpt":0.352071978879783,"spread":0.2849192439642912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778276,0.001335705,0.0008570845,0.0007981079,0.0004435169,0.001022847,0.0009257579,0.001114239,0.003662038],"category_scores_gemma":[0.001371595,0.0007006089,0.0006828835,0.0009640061,0.0005074624,0.0009812817,0.0005816144,0.0007056214,0.0006192913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203716,"about_ca_system_score_gemma":0.001233112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00595428,"about_ca_topic_score_gemma":0.005618275,"domain_scores_codex":[0.9997278,0.0001036503,0.000008712535,0.00005557285,0.00006001773,0.00004419542],"domain_scores_gemma":[0.9997862,0.0001100322,0.00003188607,0.00001656243,0.00004310693,0.00001217646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002651831,0.00002070395,0.0001044033,0.0000327794,0.00002188503,0.00001203688,0.00002277309,0.9721798,0.001186195,0.009078309,0.0009839054,0.01633075],"study_design_scores_gemma":[0.000009844322,0.00003006247,0.00005107832,0.000007345041,0.00001048515,0.000007532838,0.00002375616,0.9902502,0.0007262637,0.007501679,0.001377675,0.000004073288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.040041,0.0005320281,0.9461387,0.0004253863,0.0001657674,0.0001410883,0.0001716367,0.0002829323,0.01210135],"genre_scores_gemma":[0.6175058,0.0009674036,0.3493051,0.0001907312,0.00009692481,0.0003994001,0.0004082303,0.0003891094,0.03073709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00595428,"threshold_uncertainty_score":0.01225078,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Sophie Dewez","is_ca":false},{"name":"Martine Labbé","is_ca":false},{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.135590153453481,"gpt":0.4340305973277018,"spread":0.2984404438742209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394697,0.00205273,0.001527212,0.001529859,0.001267538,0.005615032,0.003432263,0.00257032,0.007334375],"category_scores_gemma":[0.01598684,0.001304595,0.002299867,0.002920918,0.002241686,0.00672248,0.003390299,0.008834081,0.001222536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0022876,"about_ca_system_score_gemma":0.002159013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003179334,"about_ca_topic_score_gemma":0.004272578,"domain_scores_codex":[0.9973992,0.001140899,0.0001647761,0.0002478792,0.0008050394,0.0002421043],"domain_scores_gemma":[0.9948849,0.003099479,0.0003753837,0.0003725231,0.001028338,0.0002393869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005731266,0.0001289578,0.0002028624,0.0001925158,0.00003968001,0.0001888372,0.0002040497,0.08682304,0.001122858,0.8735639,0.006391994,0.03108403],"study_design_scores_gemma":[0.0000207933,0.00002433802,0.00007167367,0.00004798607,0.00002303963,0.00006655856,0.00006241904,0.4804683,0.0003166305,0.5125889,0.006286734,0.00002267173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004215871,0.0009228656,0.9776913,0.00153601,0.0004380704,0.00006996384,0.0001664862,0.00004365647,0.01491582],"genre_scores_gemma":[0.2115733,0.003793048,0.7497891,0.001223028,0.00172559,0.000629308,0.0008246817,0.0004356182,0.0300063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007334375,"threshold_uncertainty_score":0.02453595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Dachuan Xu","is_ca":false},{"name":"Donglei Du","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1621553426125074,"gpt":0.3297216512856123,"spread":0.1675663086731049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001628492,0.0005879712,0.002001029,0.0006199834,0.001101743,0.004479672,0.00375868,0.003708058,0.02174473],"category_scores_gemma":[0.008489184,0.0006368701,0.001039135,0.001412159,0.002290465,0.005244117,0.002482005,0.002281395,0.002128698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002417679,"about_ca_system_score_gemma":0.001494383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005030883,"about_ca_topic_score_gemma":0.003894619,"domain_scores_codex":[0.9967111,0.001498093,0.0001560994,0.0005075326,0.0003007233,0.0008264253],"domain_scores_gemma":[0.9950681,0.002998657,0.0004859571,0.0005360568,0.0003474776,0.0005637836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000523739,0.0001443029,0.001671262,0.000173273,0.00007878988,0.0003444497,0.0002117774,0.1541571,0.001813605,0.814794,0.007572175,0.01851552],"study_design_scores_gemma":[0.0002588564,0.0001386207,0.000829133,0.00002930183,0.00004318521,0.0002840734,0.0002525583,0.443934,0.0005046357,0.5492429,0.00441973,0.00006294956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2877082,0.0003028051,0.6212102,0.005527976,0.0001121668,0.0003309061,0.002023542,0.0003297116,0.08245464],"genre_scores_gemma":[0.9575207,0.0001581662,0.02406094,0.0002862442,0.0000433889,0.0001639275,0.0003402175,0.00003064426,0.0173958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02174473,"threshold_uncertainty_score":0.07274336,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Laijun Zhao","is_ca":false},{"name":"Ying Qian","is_ca":false},{"name":"Rongbing Huang","is_ca":true},{"name":"Changmin Li","is_ca":false},{"name":"Jian Xue","is_ca":false},{"name":"Yue Hu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06665134195146924,"gpt":0.3497308808681951,"spread":0.2830795389167259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103448,0.0007851102,0.001978756,0.001137854,0.001374641,0.002720818,0.00321321,0.004425766,0.01337772],"category_scores_gemma":[0.002438056,0.0008214889,0.001385801,0.001215951,0.001697175,0.003360542,0.001736646,0.002232046,0.0004869917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004988242,"about_ca_system_score_gemma":0.004493697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1336178,"about_ca_topic_score_gemma":0.05457395,"domain_scores_codex":[0.9993678,0.000209971,0.00002003181,0.0001240262,0.00005397671,0.0002243195],"domain_scores_gemma":[0.9990454,0.000400962,0.0001101325,0.00003846134,0.00021836,0.0001866744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009367901,0.00009313713,0.001554954,0.00005277431,0.00003828045,0.0003191321,0.00007344729,0.9090244,0.0002415086,0.08357466,0.003214003,0.001720065],"study_design_scores_gemma":[0.00006984374,0.00002909106,0.0006633248,0.00001041014,0.00003942075,0.00003642793,0.0001246223,0.9782074,0.0000490018,0.01998221,0.0007655754,0.00002273314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7633078,0.001598093,0.1010793,0.01672652,0.0005435075,0.0002574364,0.002828483,0.0004621036,0.1131967],"genre_scores_gemma":[0.9669125,0.0004125085,0.001369652,0.0001482003,0.0000564236,0.00008370794,0.0002092374,0.00003784404,0.03076991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1336178,"threshold_uncertainty_score":0.2656801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Xiaohu Li","is_ca":false},{"name":"Rongfang Yan","is_ca":false},{"name":"Ming J. Zuo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1038903510729244,"gpt":0.3509936052648227,"spread":0.2471032541918983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00300557,0.001120611,0.00124709,0.0007496314,0.0005948291,0.001129399,0.001026605,0.001041866,0.002117227],"category_scores_gemma":[0.005531337,0.0004729563,0.0005841544,0.0003111888,0.0007921091,0.001206278,0.0007936247,0.0007560516,0.0001577284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086848,"about_ca_system_score_gemma":0.001089615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003708352,"about_ca_topic_score_gemma":0.002984148,"domain_scores_codex":[0.9991856,0.000365987,0.00002752591,0.00008308872,0.0001901876,0.0001475108],"domain_scores_gemma":[0.9965844,0.002472704,0.0002389364,0.0001869419,0.000308458,0.0002086076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001222719,0.00009500674,0.001436847,0.00006421658,0.00005262636,0.0000741712,0.00003030522,0.9761177,0.008950104,0.0007333725,0.0001448359,0.01107815],"study_design_scores_gemma":[0.00004987443,0.0009318823,0.001381632,0.000003782535,0.00006047273,0.00001819678,0.0000249188,0.992888,0.003899183,0.0006727278,0.00005823114,0.00001097472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9044492,0.0001949216,0.09369361,0.00009907714,0.00002959673,0.00009013732,0.00005261621,0.000222049,0.001168725],"genre_scores_gemma":[0.9919025,0.00002077491,0.007275359,0.00001226556,0.00000805452,0.00002319555,0.00002601239,0.0000144306,0.000717393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003708352,"threshold_uncertainty_score":0.01589513,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Oded Berman","is_ca":true},{"name":"Zvi Drezner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1198496466162401,"gpt":0.3206096362429959,"spread":0.2007599896267557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053924,0.001647575,0.001962509,0.001212561,0.001082202,0.003353193,0.004546845,0.003503141,0.02032585],"category_scores_gemma":[0.0108462,0.001018137,0.001993685,0.002334119,0.001707224,0.006662544,0.003262854,0.004753741,0.001516341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002888002,"about_ca_system_score_gemma":0.003810452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004196019,"about_ca_topic_score_gemma":0.005481125,"domain_scores_codex":[0.9977799,0.001014042,0.00009724157,0.0004404096,0.000417243,0.0002510768],"domain_scores_gemma":[0.9967285,0.00198785,0.0002553891,0.0002098859,0.0005585429,0.0002597889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004124626,0.00006174114,0.0002992381,0.000130305,0.00004829057,0.0000772805,0.00005957263,0.1678652,0.0002681591,0.8039336,0.0123294,0.01488597],"study_design_scores_gemma":[0.00003019806,0.00002645126,0.0001141087,0.0000294565,0.00001931928,0.00004771263,0.0000321787,0.6319795,0.0001359411,0.3600181,0.00754618,0.00002076665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00205289,0.0004125462,0.9868006,0.00122549,0.0002441311,0.00004311875,0.0002302812,0.00005647565,0.008934519],"genre_scores_gemma":[0.2308612,0.002490474,0.6980071,0.00162426,0.002338202,0.0006877439,0.001412429,0.000546672,0.06203196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02032585,"threshold_uncertainty_score":0.0679968,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Luca Accorsi","is_ca":false},{"name":"Andrea Lodi","is_ca":true},{"name":"Daniele Vigo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3807223978616506,"gpt":0.3906359972719764,"spread":0.009913599410325769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03480418,0.002822252,0.001882654,0.005065145,0.00211676,0.005473327,0.009508629,0.006287485,0.01630721],"category_scores_gemma":[0.2234211,0.001911588,0.002428315,0.00377649,0.003831315,0.004876628,0.004796619,0.009947669,0.009663689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001815371,"about_ca_system_score_gemma":0.0059181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006499689,"about_ca_topic_score_gemma":0.009153382,"domain_scores_codex":[0.9475619,0.03334121,0.00648848,0.001441895,0.01031117,0.0008554549],"domain_scores_gemma":[0.792034,0.1367974,0.004797647,0.02322484,0.04151158,0.001634523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003188351,0.001203442,0.002379977,0.002140524,0.0001787221,0.0009495362,0.0009797759,0.07924627,0.004850587,0.4796658,0.1423511,0.2857355],"study_design_scores_gemma":[0.000492034,0.0003962319,0.001147414,0.003254214,0.00008609419,0.0005663827,0.0005380748,0.2800239,0.009020852,0.5577521,0.1465221,0.0002006506],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002424718,0.001783968,0.9670528,0.005590382,0.0005682458,0.001390713,0.001272304,0.002397877,0.0175191],"genre_scores_gemma":[0.01718924,0.0009078035,0.9716532,0.001283402,0.0002710884,0.002974029,0.001366715,0.0009976702,0.003357046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03480418,"threshold_uncertainty_score":0.1840643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Snežana Mitrović-Minić","is_ca":true},{"name":"Ramesh Krishnamurti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0257977929190062,"gpt":0.3082450610410842,"spread":0.282447268122078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002675717,0.001688981,0.002272212,0.001886007,0.0008791463,0.002864414,0.003470907,0.001454298,0.005692977],"category_scores_gemma":[0.01481592,0.001204355,0.001339913,0.003676466,0.001190419,0.007366613,0.002331501,0.00409714,0.0006321474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002101915,"about_ca_system_score_gemma":0.002178563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006973655,"about_ca_topic_score_gemma":0.006856881,"domain_scores_codex":[0.9982677,0.0005232333,0.00006884713,0.000326027,0.0005310047,0.0002831808],"domain_scores_gemma":[0.9913168,0.006754579,0.0005256778,0.0004732709,0.0005378802,0.0003917489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001456638,0.00005698835,0.0002780394,0.0001588325,0.00004630359,0.0000774392,0.00007452669,0.8258612,0.001179922,0.1266496,0.002430091,0.04304143],"study_design_scores_gemma":[0.00000736507,0.00001860753,0.00008396823,0.00001821015,0.00001672031,0.00002028612,0.00001145507,0.9445199,0.00035314,0.05394768,0.0009948778,0.000007755767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01186077,0.001407142,0.9803329,0.0004398976,0.000135481,0.00003087373,0.0001232837,0.0001242825,0.00554527],"genre_scores_gemma":[0.6045204,0.005717234,0.3739176,0.0003260957,0.0009672379,0.000222926,0.0004180855,0.0005751824,0.01333525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006973655,"threshold_uncertainty_score":0.01904494,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Tatsiana Levina","is_ca":true},{"name":"Yuri Levin","is_ca":true},{"name":"Jeff McGill","is_ca":true},{"name":"Mikhail Nediak","is_ca":true},{"name":"Vladimir Vovk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1251349721004983,"gpt":0.4507296444040477,"spread":0.3255946723035494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006519095,0.001500407,0.002865981,0.001519044,0.001341996,0.002930441,0.003565664,0.002332781,0.004628923],"category_scores_gemma":[0.01260618,0.00077461,0.001115312,0.002712616,0.001466636,0.004497154,0.003574746,0.003287436,0.0009981024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001450184,"about_ca_system_score_gemma":0.002466869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547847,"about_ca_topic_score_gemma":0.001393677,"domain_scores_codex":[0.9978392,0.001026006,0.000142027,0.0002776296,0.0004126568,0.0003025603],"domain_scores_gemma":[0.9921407,0.005305879,0.0004355509,0.0008884085,0.0008472613,0.0003820935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009583813,0.0004407753,0.001638065,0.0003408849,0.0001753957,0.000127074,0.000409008,0.5117975,0.002753992,0.2270268,0.007862621,0.2464695],"study_design_scores_gemma":[0.00006079722,0.00008223331,0.0001395945,0.0000174101,0.00002720335,0.00003162751,0.00002798837,0.9018146,0.000633524,0.09628325,0.0008695932,0.00001229421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01951968,0.0001755217,0.9767513,0.0003937822,0.00006514078,0.00007194094,0.00007248644,0.0002092346,0.002740907],"genre_scores_gemma":[0.3836454,0.0004850581,0.6029009,0.0003824346,0.0002351938,0.0005928287,0.0005151145,0.0002016912,0.01104126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006519095,"threshold_uncertainty_score":0.0344767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Patrice Marcotte","is_ca":true},{"name":"Gilles Savard","is_ca":true},{"name":"Frédéric Semet","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07996579037548483,"gpt":0.3380938230751212,"spread":0.2581280326996364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00113371,0.0008764376,0.001524436,0.001021874,0.0007943401,0.002510528,0.001751737,0.001760927,0.00386088],"category_scores_gemma":[0.003474673,0.0007685214,0.001154021,0.002568156,0.001309123,0.002412757,0.002146707,0.003231017,0.0009153857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008962934,"about_ca_system_score_gemma":0.001787589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003655287,"about_ca_topic_score_gemma":0.002699037,"domain_scores_codex":[0.9992219,0.0003565532,0.00003399279,0.00009990026,0.0002152832,0.00007240668],"domain_scores_gemma":[0.9993356,0.0003955421,0.00005443603,0.00003510822,0.0001353983,0.00004386615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002722829,0.00006153806,0.0001577235,0.0001324448,0.00004641067,0.00008186804,0.0001229093,0.528404,0.0005627473,0.420754,0.002122953,0.04752617],"study_design_scores_gemma":[0.0000106529,0.00002226384,0.00003689251,0.00002130686,0.00001194143,0.00002696196,0.00003274573,0.7623276,0.0001651728,0.2325595,0.004772835,0.00001219753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002090866,0.0005093387,0.992547,0.0003646846,0.00005535883,0.00001415533,0.00002423352,0.00002799308,0.004366348],"genre_scores_gemma":[0.2390622,0.005014163,0.7299038,0.0002787389,0.0004809849,0.0002924856,0.0002333641,0.0002066444,0.02452769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00386088,"threshold_uncertainty_score":0.01291597,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Adam Diamant","is_ca":false},{"name":"Opher Baron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03104915051129636,"gpt":0.3234884503273505,"spread":0.2924392998160542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007976882,0.0006967663,0.00203457,0.00116949,0.001869294,0.005003189,0.004942376,0.00319323,0.009617152],"category_scores_gemma":[0.03051988,0.001337375,0.001097398,0.001712855,0.002248933,0.007040683,0.002558342,0.004443483,0.001029703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003766056,"about_ca_system_score_gemma":0.003667678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004791291,"about_ca_topic_score_gemma":0.003875891,"domain_scores_codex":[0.9956042,0.0009655068,0.0001886181,0.0008415785,0.0009450325,0.001455097],"domain_scores_gemma":[0.9757311,0.01323612,0.002320166,0.002800257,0.00303419,0.002878117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001324877,0.0006580622,0.007114646,0.0001461014,0.0001038492,0.001440419,0.000806143,0.1221671,0.004675364,0.81255,0.008308272,0.04070514],"study_design_scores_gemma":[0.0001100403,0.0001522428,0.0008722369,0.00001839489,0.00005545864,0.0003704746,0.0002222015,0.800262,0.001222372,0.1954354,0.001217353,0.00006181326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3356988,0.0005561831,0.6408675,0.004612206,0.0007646928,0.0001868784,0.0002516928,0.0005015912,0.01656038],"genre_scores_gemma":[0.9639447,0.0001951581,0.02141776,0.000496765,0.0002939501,0.00005188578,0.00008385133,0.00007216926,0.01344386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009617152,"threshold_uncertainty_score":0.04218626,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M. L. Chaudhry","is_ca":true},{"name":"Seok Ho Chang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02512876416846612,"gpt":0.3082282290858865,"spread":0.2830994649174204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158495,0.000606955,0.0007371342,0.0009953679,0.0006406051,0.001536871,0.001297663,0.0005893708,0.004750553],"category_scores_gemma":[0.004384043,0.000370998,0.0005718155,0.0006136816,0.001050549,0.0013133,0.0007163208,0.001168852,0.0003753919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003009326,"about_ca_system_score_gemma":0.003205739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01709277,"about_ca_topic_score_gemma":0.008275886,"domain_scores_codex":[0.9993413,0.000110477,0.00001514563,0.00006259899,0.0002837956,0.0001867553],"domain_scores_gemma":[0.9980659,0.001008094,0.0001681066,0.00008512721,0.0004725052,0.0002002938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006005234,0.0002405217,0.003114049,0.0002133159,0.00007870144,0.0002518357,0.0001794388,0.6217965,0.01221438,0.3335234,0.008548865,0.01923847],"study_design_scores_gemma":[0.00001197172,0.00001742595,0.0003705147,0.000003759699,0.000006328319,0.00001277378,0.00001495985,0.984786,0.0002546083,0.01422365,0.0002923191,0.000005729856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2914116,0.002076659,0.6810519,0.003071524,0.000567269,0.0001459943,0.0004905219,0.0004916248,0.02069281],"genre_scores_gemma":[0.9662284,0.0005016808,0.01905985,0.000271172,0.0002301609,0.00004991707,0.0002147252,0.0001071739,0.01333694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01709277,"threshold_uncertainty_score":0.03398657,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Avis","is_ca":true},{"name":"Tomokazu Imamura","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05137916255268932,"gpt":0.3526719316432403,"spread":0.301292769090551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233596,0.001232509,0.001661575,0.003049236,0.001806967,0.002411118,0.002929427,0.002084917,0.01896055],"category_scores_gemma":[0.004444561,0.0008601676,0.001306387,0.003925453,0.0008960479,0.002985817,0.001666542,0.001557094,0.003465829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002685661,"about_ca_system_score_gemma":0.002660315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00689727,"about_ca_topic_score_gemma":0.009010439,"domain_scores_codex":[0.9990273,0.000312164,0.00003627827,0.0001196448,0.0002928783,0.0002118101],"domain_scores_gemma":[0.9978895,0.001327067,0.0001051683,0.0002446146,0.000279141,0.0001544633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009372137,0.0005883641,0.0007319466,0.0006792611,0.0001349698,0.0002758796,0.0002323485,0.4248541,0.00503424,0.05502602,0.03903997,0.4724658],"study_design_scores_gemma":[0.0002261531,0.0002912,0.0003004669,0.00008739643,0.00009286583,0.0001300099,0.00009752948,0.9364215,0.002673084,0.04787636,0.01175416,0.00004927774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05236415,0.002722305,0.9097356,0.00135714,0.0006548089,0.0007036997,0.001322546,0.003519027,0.02762069],"genre_scores_gemma":[0.2299566,0.001079383,0.7447876,0.0004604895,0.0003037392,0.0005576915,0.001880714,0.0006741661,0.0202996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01896055,"threshold_uncertainty_score":0.0634293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Espinoza","is_ca":false},{"name":"Ricardo Fukasawa","is_ca":true},{"name":"Marcos Goycoolea","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08743048111281011,"gpt":0.4442686572291453,"spread":0.3568381761163352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125828,0.0006940065,0.0008688341,0.001192064,0.001617976,0.002425435,0.000889634,0.00123567,0.009390048],"category_scores_gemma":[0.003887062,0.0003917679,0.0009227172,0.001579647,0.004474306,0.005275831,0.002357228,0.003877555,0.0006355492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001032062,"about_ca_system_score_gemma":0.0007305009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001705114,"about_ca_topic_score_gemma":0.001000011,"domain_scores_codex":[0.9994218,0.000168564,0.00002516592,0.00008779467,0.0001496625,0.000147101],"domain_scores_gemma":[0.9991098,0.0004074942,0.0001217682,0.0001651853,0.00009267134,0.0001031346],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001186064,0.000005882353,0.00007060901,0.00001385833,0.000001933103,0.00002989739,0.00006445027,0.0008038342,0.0002101051,0.9915631,0.0005376612,0.006686864],"study_design_scores_gemma":[0.000003723006,0.000007099402,0.00009263142,0.00001066495,0.000002160909,0.00003714206,0.0000563817,0.003644653,0.00008854467,0.9941818,0.001871498,0.000003707112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2457168,0.008186309,0.4257844,0.01804341,0.002691664,0.00006078859,0.0002023511,0.0001938436,0.2991204],"genre_scores_gemma":[0.9180962,0.004148758,0.04530417,0.001406247,0.002115353,0.00005479102,0.00009035219,0.00009173513,0.0286922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009390048,"threshold_uncertainty_score":0.03141284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Elena Parilina","is_ca":false},{"name":"Georges Zaccour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3516116309144722,"gpt":0.5185068786424022,"spread":0.16689524772793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003309417,0.001257696,0.002161521,0.001819447,0.0009479771,0.003840586,0.003202771,0.002130419,0.009958303],"category_scores_gemma":[0.02556804,0.0008595175,0.001175492,0.001793345,0.00249577,0.004269493,0.002301265,0.002612127,0.0009395647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003379415,"about_ca_system_score_gemma":0.001897914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004214103,"about_ca_topic_score_gemma":0.004020799,"domain_scores_codex":[0.997687,0.0009509355,0.0001085612,0.0003378272,0.000440156,0.0004754671],"domain_scores_gemma":[0.9845723,0.01233364,0.001032577,0.0006239689,0.0007214558,0.0007159988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003408931,0.0001451361,0.001053423,0.0001449865,0.00006718487,0.0001545601,0.0005079628,0.5299098,0.0008662277,0.4521344,0.001980069,0.01269522],"study_design_scores_gemma":[0.00002973896,0.00003389776,0.0001430231,0.00002851433,0.0000156296,0.00004074304,0.0001163547,0.7856604,0.0002119986,0.2132201,0.0004883726,0.00001124542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1340771,0.0004346793,0.8509063,0.0005118817,0.00005133502,0.0001423239,0.0002557808,0.0001861697,0.01343446],"genre_scores_gemma":[0.9162484,0.0005126952,0.06908917,0.0001514204,0.00005228916,0.0002961078,0.000417351,0.0001108618,0.0131217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009958303,"threshold_uncertainty_score":0.03331381,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Benny Van Houdt","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02084687635789415,"gpt":0.3171079521990768,"spread":0.2962610758411826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005730695,0.0008013269,0.001434136,0.0009690574,0.0009985252,0.002278513,0.002146695,0.002074552,0.003378205],"category_scores_gemma":[0.01709945,0.001056507,0.0005661251,0.001373302,0.001448466,0.002650951,0.001070489,0.001489196,0.0005449143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003194904,"about_ca_system_score_gemma":0.002493553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008253222,"about_ca_topic_score_gemma":0.005118763,"domain_scores_codex":[0.9975669,0.0006866151,0.0001044377,0.0003573473,0.0005238958,0.0007608564],"domain_scores_gemma":[0.9815177,0.01412601,0.001543029,0.000404045,0.0014448,0.0009643157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004255628,0.0003501166,0.006075838,0.0002227272,0.0001288177,0.0008535979,0.0006860788,0.8477638,0.01361724,0.1092139,0.002937115,0.01389522],"study_design_scores_gemma":[0.00006656411,0.0001133364,0.0004508795,0.000005582222,0.00002953052,0.00008754578,0.0000592047,0.9885334,0.0004629865,0.01005786,0.0001133475,0.00001961696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6362038,0.0006416908,0.3558118,0.001898148,0.0002015742,0.0001143019,0.0003024539,0.0006397309,0.004186503],"genre_scores_gemma":[0.9893907,0.0001802231,0.007267417,0.000103775,0.00008260945,0.00003838606,0.00007872521,0.00005156008,0.002806627],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008253222,"threshold_uncertainty_score":0.03030711,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Thomas McCormick","is_ca":true},{"name":"Akiyoshi Shioura","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07014629511236242,"gpt":0.3576475601690094,"spread":0.287501265056647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004551914,0.001771068,0.003505613,0.001020322,0.002039658,0.007195709,0.004233995,0.002773241,0.01842681],"category_scores_gemma":[0.03835203,0.001100544,0.002061439,0.002057297,0.003667364,0.02226455,0.00422103,0.007077055,0.002778408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002718585,"about_ca_system_score_gemma":0.003115453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073133,"about_ca_topic_score_gemma":0.001545317,"domain_scores_codex":[0.9922043,0.001461043,0.0004231299,0.002206163,0.002032843,0.00167249],"domain_scores_gemma":[0.9361299,0.04391602,0.004098445,0.01015291,0.003230154,0.002472493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.007261362,0.0009989283,0.007977693,0.001713735,0.0003549276,0.0005322589,0.000664016,0.06682755,0.03051111,0.6749957,0.03425476,0.1739079],"study_design_scores_gemma":[0.0002715939,0.0002786297,0.001733481,0.00006975116,0.0001630461,0.00102187,0.0001953177,0.1344766,0.02112082,0.8331754,0.007407538,0.00008604941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3184021,0.001845948,0.5807339,0.01444716,0.0006668863,0.0002666501,0.002865443,0.005486936,0.075285],"genre_scores_gemma":[0.8927202,0.0008941451,0.08257765,0.00176719,0.0008490118,0.0001932228,0.002482197,0.001402501,0.01711397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01842681,"threshold_uncertainty_score":0.06164378,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Venus Lo","is_ca":false},{"name":"Hüseyin Topaloğlu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05254429056906057,"gpt":0.2816712590283065,"spread":0.2291269684592459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006123065,0.001829948,0.004823233,0.002286271,0.001160621,0.005051138,0.002621167,0.003845171,0.0161404],"category_scores_gemma":[0.01087455,0.0024468,0.002570166,0.003767094,0.001832596,0.005864604,0.002736792,0.002347653,0.00144425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00372713,"about_ca_system_score_gemma":0.002990434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02135779,"about_ca_topic_score_gemma":0.01555555,"domain_scores_codex":[0.9964599,0.00186124,0.0001572176,0.0005293344,0.0003487615,0.0006434587],"domain_scores_gemma":[0.9913787,0.006679506,0.0008606591,0.0002489698,0.0004333063,0.0003988953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001365067,0.00006742212,0.0005232837,0.00006934376,0.00006751317,0.0001113381,0.00003359323,0.9728901,0.0001637746,0.02211907,0.0005868603,0.003231107],"study_design_scores_gemma":[0.00001841901,0.00003526751,0.0002590294,0.000007603843,0.00002185937,0.00002091186,0.00002458414,0.9868709,0.0000590934,0.01241854,0.0002441739,0.00001958518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2646248,0.002385868,0.6919902,0.004362924,0.0003027144,0.0003623764,0.002350867,0.0007697605,0.03285049],"genre_scores_gemma":[0.9154918,0.0008520483,0.0291248,0.0002128998,0.0001039515,0.0002402137,0.000568643,0.0001835209,0.05322198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02135779,"threshold_uncertainty_score":0.05399501,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Harish Krishnan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03633866740808209,"gpt":0.2979967812589659,"spread":0.2616581138508838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007020795,0.002453728,0.003139209,0.002293585,0.001973896,0.005538376,0.003456756,0.005167172,0.01268052],"category_scores_gemma":[0.03971568,0.001696893,0.004446592,0.005678202,0.005377932,0.02117541,0.003874428,0.01131498,0.002291005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004289153,"about_ca_system_score_gemma":0.001531129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009439847,"about_ca_topic_score_gemma":0.003012363,"domain_scores_codex":[0.9949577,0.002334018,0.0002824869,0.000669232,0.001302741,0.0004537138],"domain_scores_gemma":[0.9621686,0.03186727,0.000602856,0.002547029,0.002406449,0.0004078361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003178662,0.00001409463,0.0001861101,0.000115607,0.00003669069,0.0002035084,0.0001978294,0.02353673,0.0001949264,0.9499207,0.01455299,0.0110091],"study_design_scores_gemma":[0.000006156561,0.000008442946,0.0001099779,0.00004590471,0.00001724131,0.00007655379,0.0000572211,0.03317039,0.0001021952,0.9514164,0.01496147,0.00002817546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009829577,0.01424454,0.805834,0.06450569,0.004444266,0.00005119686,0.001179306,0.0003244547,0.09958705],"genre_scores_gemma":[0.7021316,0.0349434,0.11317,0.01645801,0.0300814,0.0003093,0.0009966508,0.001577295,0.1003324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01268052,"threshold_uncertainty_score":0.04242051,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hangjun Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0806537895905129,"gpt":0.2914829584913931,"spread":0.2108291689008802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004838978,0.0003780076,0.0008453385,0.0005549695,0.0008711652,0.003206517,0.001256281,0.001809021,0.02419089],"category_scores_gemma":[0.02558146,0.0003377337,0.0007310131,0.0006896461,0.001769004,0.003733309,0.002087943,0.002175489,0.0007263086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00294258,"about_ca_system_score_gemma":0.002691494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005790249,"about_ca_topic_score_gemma":0.005742605,"domain_scores_codex":[0.9977388,0.0007935905,0.00008057064,0.0002402731,0.0002570993,0.0008896433],"domain_scores_gemma":[0.958338,0.02982358,0.003794924,0.002491389,0.001640605,0.00391148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.06100011,0.009282189,0.2178155,0.0009667711,0.0008082256,0.002671726,0.00250936,0.2272031,0.02286986,0.2701121,0.00711202,0.177649],"study_design_scores_gemma":[0.004251957,0.01140045,0.4298306,0.0002679213,0.00216934,0.001530383,0.01261233,0.1770846,0.01700066,0.3279154,0.01548745,0.0004488521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9758247,0.0002360483,0.001060386,0.0007436748,0.00002346938,0.00003270261,0.0001238998,0.00002385759,0.02193123],"genre_scores_gemma":[0.9987853,0.00002818213,0.0001082799,0.00002464274,0.000009521284,0.000002060197,0.00001670822,0.000003262343,0.001022046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02419089,"threshold_uncertainty_score":0.08092654,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M. L. Chaudhry","is_ca":true},{"name":"Bong K. Yoon","is_ca":false},{"name":"Kyung C. Chae","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02083138433353086,"gpt":0.2590667789316579,"spread":0.238235394598127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002098269,0.0006736289,0.001087097,0.001235181,0.001007948,0.002021813,0.002154096,0.001628016,0.001757062],"category_scores_gemma":[0.006430951,0.0006149585,0.0004410944,0.001442051,0.00132316,0.00170923,0.001006127,0.001012044,0.0003870082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002236155,"about_ca_system_score_gemma":0.001641067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007178465,"about_ca_topic_score_gemma":0.003081692,"domain_scores_codex":[0.9990141,0.0001818286,0.00005455757,0.0002114503,0.0002026861,0.0003352952],"domain_scores_gemma":[0.9939225,0.003180056,0.000736782,0.000313111,0.001197606,0.0006499082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002767886,0.000403986,0.01820929,0.0003742586,0.0001760721,0.002365045,0.0009594109,0.7948887,0.03184139,0.1282331,0.00566842,0.01411239],"study_design_scores_gemma":[0.00002315098,0.00004965928,0.0008239796,0.000004182227,0.00002015753,0.0001006223,0.00004979472,0.9943634,0.0005939358,0.003830456,0.0001123518,0.00002835506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8678124,0.0006663193,0.1270721,0.0009033385,0.0001280506,0.00006631803,0.0004482187,0.0005221931,0.002380959],"genre_scores_gemma":[0.9968743,0.0001135782,0.00185599,0.00003823244,0.00004043778,0.00001411803,0.0001008833,0.00002181679,0.0009406383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007178465,"threshold_uncertainty_score":0.01622456,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tamer Boyacı","is_ca":true},{"name":"Guillermo Gallego","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2700245598731367,"gpt":0.4598726996339618,"spread":0.1898481397608251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005199367,0.005142174,0.007249742,0.00259766,0.001377633,0.007574699,0.004544869,0.006561616,0.01613855],"category_scores_gemma":[0.01213008,0.003858674,0.003600553,0.004763905,0.001916113,0.009522782,0.00275465,0.006725751,0.002242147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003961642,"about_ca_system_score_gemma":0.00638159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01502527,"about_ca_topic_score_gemma":0.01100765,"domain_scores_codex":[0.9971307,0.0008063896,0.0001396416,0.0005923709,0.0007147202,0.0006161939],"domain_scores_gemma":[0.9904642,0.00740433,0.0005936157,0.0005714787,0.0005175584,0.0004488425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002070859,0.0002308087,0.0004546652,0.0003146861,0.0001142564,0.0001469738,0.00007625948,0.9498272,0.001094424,0.01704451,0.003586124,0.02690301],"study_design_scores_gemma":[0.00004705223,0.00006794539,0.0003377736,0.00002740442,0.00005541624,0.00003970328,0.00004254956,0.9732108,0.0005208689,0.02490219,0.0007217439,0.00002655038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06631152,0.001122761,0.9116979,0.002362378,0.0002955315,0.0005287914,0.001408215,0.0009736069,0.01529925],"genre_scores_gemma":[0.5615144,0.002462751,0.3712334,0.0007815078,0.0009903871,0.001496988,0.00245648,0.001708364,0.05735581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01613855,"threshold_uncertainty_score":0.05398881,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Josep Freixas","is_ca":false},{"name":"Montserrat Pons","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04816845958036342,"gpt":0.2923257338945415,"spread":0.2441572743141781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004189759,0.0005277726,0.0006532544,0.001598948,0.0004297344,0.001142739,0.0006908696,0.0005899913,0.001601516],"category_scores_gemma":[0.07107467,0.0003026426,0.0003682374,0.0008840422,0.001267109,0.00147044,0.0004432017,0.0008528291,0.0001149895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006659168,"about_ca_system_score_gemma":0.0004471462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001178405,"about_ca_topic_score_gemma":0.001024627,"domain_scores_codex":[0.9985862,0.0007265987,0.00004588554,0.0002528993,0.0002398331,0.0001486034],"domain_scores_gemma":[0.7919413,0.1990034,0.00309311,0.003010023,0.001966772,0.0009854161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001333185,0.0001768523,0.03245727,0.0003986639,0.0003131517,0.000909182,0.000525574,0.8127789,0.0419043,0.05932591,0.001414174,0.04846265],"study_design_scores_gemma":[0.00005185049,0.0004871049,0.04473145,0.00006374909,0.0003223794,0.0007932534,0.0002017947,0.8986533,0.01584429,0.03792085,0.0008226345,0.0001073645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8898693,0.001561905,0.09805971,0.0004956814,0.00007395237,0.00002370984,0.0001604901,0.0002243849,0.009530774],"genre_scores_gemma":[0.9980271,0.0001273273,0.00157278,0.00001166824,0.00002217748,0.000004247146,0.00001814937,0.00002888304,0.0001876254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004189759,"threshold_uncertainty_score":0.02215785,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Deeparnab Chakrabarty","is_ca":false},{"name":"Jochen Könemann","is_ca":true},{"name":"David Pritchard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06305174887661538,"gpt":0.3385172516865786,"spread":0.2754655028099633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006121011,0.004988124,0.003982459,0.004509189,0.003794858,0.009028651,0.006590199,0.004958534,0.0295992],"category_scores_gemma":[0.03240124,0.002810975,0.006105792,0.007035347,0.007093543,0.02443766,0.01268909,0.02719442,0.004894295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006420056,"about_ca_system_score_gemma":0.003018058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166858,"about_ca_topic_score_gemma":0.001744033,"domain_scores_codex":[0.9951138,0.0010083,0.0002093441,0.001208979,0.001208315,0.001251266],"domain_scores_gemma":[0.9771386,0.01743046,0.0009420301,0.001597831,0.001428144,0.001462981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005093071,0.0003359972,0.0008332932,0.001389822,0.0001415593,0.0003442807,0.001005191,0.0208855,0.00500327,0.8779297,0.03680239,0.05481968],"study_design_scores_gemma":[0.00004717759,0.00008598174,0.0006512112,0.0002641452,0.0001524085,0.0002483278,0.0001821574,0.03263289,0.002153597,0.9499666,0.01354448,0.00007100691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07390796,0.03273141,0.5344566,0.04021977,0.006077147,0.0003572938,0.002337915,0.001352807,0.3085592],"genre_scores_gemma":[0.669572,0.0324809,0.2036495,0.01470605,0.01404866,0.001849685,0.002561055,0.003401061,0.05773116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0295992,"threshold_uncertainty_score":0.09901923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Salihah Alwadani","is_ca":true},{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":false},{"name":"Xianfu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03923236557992851,"gpt":0.3265307217875624,"spread":0.2872983562076339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005312344,0.001047954,0.001565808,0.002333801,0.001660123,0.0026742,0.00331406,0.003102915,0.008695159],"category_scores_gemma":[0.04000396,0.0007413579,0.001018985,0.00151834,0.003978501,0.003076563,0.004375337,0.003584032,0.001250177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954138,"about_ca_system_score_gemma":0.002852392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007529614,"about_ca_topic_score_gemma":0.00614977,"domain_scores_codex":[0.9982742,0.0009918945,0.00004676023,0.0001809581,0.000326732,0.0001794193],"domain_scores_gemma":[0.9868708,0.01046239,0.0004508583,0.0006564465,0.001066353,0.0004931878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005011487,0.0001196332,0.001779636,0.0003288545,0.00008009972,0.0001017611,0.0002123647,0.1923683,0.0015214,0.7438641,0.009302389,0.0498204],"study_design_scores_gemma":[0.00004126632,0.00004966971,0.0003481094,0.00008979435,0.00001624675,0.00005014595,0.00004761671,0.8400255,0.0003681637,0.1565634,0.002377257,0.00002289888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09253845,0.006391773,0.814247,0.00498335,0.0008650275,0.0001775269,0.0002704882,0.0006650248,0.07986133],"genre_scores_gemma":[0.6931373,0.002695325,0.2662646,0.001381336,0.0006201458,0.000534492,0.0006075407,0.0009381424,0.03382115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008695159,"threshold_uncertainty_score":0.0290882,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean Bertrand Gauthier","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Marco E. Lübbecke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05506757424898105,"gpt":0.390566865604166,"spread":0.335499291355185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760345,0.002697074,0.001437098,0.002546456,0.0009114936,0.002847444,0.001484191,0.001126908,0.01269222],"category_scores_gemma":[0.007072828,0.001169748,0.002844005,0.002817099,0.002055175,0.005354489,0.002571296,0.007424781,0.002326302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902608,"about_ca_system_score_gemma":0.001421831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001860227,"about_ca_topic_score_gemma":0.001504467,"domain_scores_codex":[0.9988686,0.0004422198,0.00004491771,0.0001881114,0.0003088505,0.0001473177],"domain_scores_gemma":[0.9968852,0.002112436,0.0001601939,0.0002351402,0.0004489058,0.0001581339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003068768,0.0000546887,0.0001343974,0.0001459243,0.00004536374,0.00004443477,0.0001244919,0.01328618,0.0006594613,0.9471747,0.01086628,0.02743334],"study_design_scores_gemma":[0.00001569355,0.00001585929,0.0001072346,0.0000435214,0.00002116879,0.00003744691,0.00002801639,0.04934446,0.000287827,0.9435565,0.00653344,0.000008786122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007108387,0.002952799,0.9325349,0.001828238,0.0003357929,0.00006606516,0.0003892683,0.0002193402,0.05456517],"genre_scores_gemma":[0.3872509,0.01480195,0.4829281,0.002738054,0.002436882,0.001549241,0.002566092,0.001365496,0.1043632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01269222,"threshold_uncertainty_score":0.04245967,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"David Perry","is_ca":false},{"name":"M. J. M. Posner","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03403268896689165,"gpt":0.2893857000473459,"spread":0.2553530110804542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732803,0.0004366768,0.001440092,0.001247709,0.00144725,0.00327034,0.002248882,0.003046111,0.00760587],"category_scores_gemma":[0.003592179,0.0008109671,0.001276911,0.001927862,0.00255645,0.002940411,0.001779029,0.001855296,0.0005696415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001460037,"about_ca_system_score_gemma":0.001502766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01895683,"about_ca_topic_score_gemma":0.01005113,"domain_scores_codex":[0.9993456,0.0001936543,0.00002693758,0.0001598612,0.0001038994,0.0001700286],"domain_scores_gemma":[0.9980831,0.0009424419,0.0002032097,0.0001474792,0.0002897668,0.0003340299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002934504,0.0001451136,0.004146393,0.00006648397,0.0001139224,0.001419153,0.0003577067,0.6090786,0.004601031,0.3726988,0.001719559,0.005359792],"study_design_scores_gemma":[0.00004157863,0.00007413564,0.0008533034,0.000005109805,0.00002923004,0.0001119673,0.00008009136,0.9613,0.0002629448,0.03658351,0.0006125873,0.00004568894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5217198,0.0003743104,0.4564394,0.002431903,0.0001786446,0.00009094033,0.0005572949,0.0006181548,0.01758967],"genre_scores_gemma":[0.9753146,0.0001890283,0.01199594,0.00009475202,0.00006392926,0.00003327035,0.0001173771,0.00003697557,0.01215399],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01895683,"threshold_uncertainty_score":0.03769302,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Matteo Cacciola","is_ca":true},{"name":"Antonio Frangioni","is_ca":false},{"name":"Andrea Lodi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04766301081933947,"gpt":0.3484694934558907,"spread":0.3008064826365512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147518,0.0006717226,0.001084461,0.0009258068,0.0004973019,0.0009125898,0.001537755,0.001185699,0.00452272],"category_scores_gemma":[0.006840667,0.0006475161,0.0005180778,0.0009972284,0.0007038544,0.001541274,0.001151572,0.002106206,0.0005152915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009533937,"about_ca_system_score_gemma":0.001276125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004736875,"about_ca_topic_score_gemma":0.01015798,"domain_scores_codex":[0.9992994,0.0002238607,0.00004336833,0.000114717,0.0002395558,0.00007908002],"domain_scores_gemma":[0.9975814,0.001534709,0.0001202058,0.0002719935,0.0004218543,0.00006982514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000145805,0.00009276367,0.000486345,0.0001453258,0.00007707677,0.00009221011,0.00006675937,0.7565334,0.002630159,0.05308646,0.005432817,0.1812109],"study_design_scores_gemma":[0.00001082318,0.00001691803,0.0000800472,0.0000161215,0.00000951135,0.0000127381,0.000004766311,0.9720008,0.0007167329,0.02636788,0.0007609603,0.000002768193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01946552,0.0008363393,0.9737453,0.0003236337,0.00007745343,0.00006511109,0.0001504511,0.0003671888,0.0049689],"genre_scores_gemma":[0.4888681,0.0009919502,0.4991387,0.0003266851,0.0001804506,0.0003430353,0.0008964027,0.0002741264,0.00898059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004736875,"threshold_uncertainty_score":0.01512998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M. Mahdi Tajbakhsh","is_ca":true},{"name":"Chi-Guhn Lee","is_ca":true},{"name":"Saeed Zolfaghari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08486870141100007,"gpt":0.2964477325248592,"spread":0.2115790311138591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006471168,0.001089162,0.002401101,0.002014334,0.001373588,0.002275318,0.002174188,0.002349949,0.008168563],"category_scores_gemma":[0.02742587,0.001145709,0.001427413,0.002436168,0.004963328,0.008522183,0.004002479,0.003697902,0.0006771277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797208,"about_ca_system_score_gemma":0.001047867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002511165,"about_ca_topic_score_gemma":0.001320942,"domain_scores_codex":[0.998347,0.0007976282,0.00006286037,0.0002246158,0.0002650236,0.0003027928],"domain_scores_gemma":[0.9838065,0.01210052,0.001370522,0.0006974605,0.001064636,0.000960382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000319749,0.00005892186,0.003057823,0.0001874278,0.0001029195,0.0005891473,0.0003685998,0.09582234,0.001632486,0.8755955,0.005489276,0.01677588],"study_design_scores_gemma":[0.0000459387,0.00005524517,0.001390825,0.0000753745,0.00005733757,0.0002822868,0.0001665878,0.3151989,0.0003045293,0.6808695,0.001494926,0.00005854255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4510576,0.007507549,0.4396124,0.01358093,0.0004981951,0.000114617,0.0004808861,0.0003346369,0.08681329],"genre_scores_gemma":[0.9778632,0.002914739,0.007263902,0.0006742996,0.0005100704,0.00004711271,0.0001059474,0.00007950758,0.01054124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008168563,"threshold_uncertainty_score":0.03422326,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","authors":[{"name":"Kevin K. H. Cheung","is_ca":true},{"name":"Kyle Harvey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05934213711343048,"gpt":0.3612582802058003,"spread":0.3019161430923698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075981,0.001488852,0.001708483,0.001513924,0.001424065,0.002852428,0.004158315,0.002694484,0.01836985],"category_scores_gemma":[0.006576861,0.000821344,0.001887792,0.002925747,0.001289015,0.006017834,0.004864136,0.003665065,0.00534238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275495,"about_ca_system_score_gemma":0.002167884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002046986,"about_ca_topic_score_gemma":0.003946704,"domain_scores_codex":[0.9982315,0.0003013363,0.0001248602,0.0004703967,0.0006362459,0.0002356887],"domain_scores_gemma":[0.9962462,0.001824871,0.0001543553,0.001090826,0.0005058051,0.0001779613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005934838,0.0005096423,0.0008833458,0.0007858889,0.0001232916,0.000413768,0.0003288295,0.04191592,0.01924781,0.1054857,0.02532104,0.8043913],"study_design_scores_gemma":[0.0006537474,0.0004385134,0.001221825,0.0001777816,0.0002160985,0.0009080508,0.0003318884,0.4978348,0.0134704,0.425041,0.05958699,0.0001189376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01776807,0.0004392242,0.9636018,0.0009647317,0.0004805325,0.000384922,0.0002749922,0.002389603,0.01369605],"genre_scores_gemma":[0.08392651,0.000388295,0.9041422,0.0004229007,0.000279764,0.0002952739,0.0008246269,0.0006858902,0.009034595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01836985,"threshold_uncertainty_score":0.06145328,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Deeparnab Chakrabarty","is_ca":true},{"name":"Nikhil R. Devanur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1668413364227684,"gpt":0.4718000991088989,"spread":0.3049587626861305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00798538,0.00140606,0.005151975,0.002227709,0.002622049,0.008693598,0.003239497,0.003350193,0.01615411],"category_scores_gemma":[0.03538995,0.0008547047,0.002124743,0.003376845,0.00929566,0.01444018,0.004948279,0.006277402,0.001071873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003164272,"about_ca_system_score_gemma":0.002831434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00326065,"about_ca_topic_score_gemma":0.001769252,"domain_scores_codex":[0.994879,0.002730041,0.0001880972,0.0006643278,0.0005999195,0.0009386865],"domain_scores_gemma":[0.9714386,0.02121728,0.002077601,0.001238582,0.001958296,0.002069553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009558768,0.00003772662,0.0003466478,0.00006138669,0.00001938373,0.00006727826,0.0001247966,0.009525604,0.000189508,0.984059,0.001744239,0.003728799],"study_design_scores_gemma":[0.00005788876,0.00005000094,0.0003146045,0.00002731209,0.00002014741,0.00006267373,0.0001825431,0.02963737,0.0001139181,0.9678324,0.001682083,0.00001912831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3097423,0.006475573,0.4580531,0.014219,0.000761073,0.0002713136,0.0004282836,0.0002956526,0.2097536],"genre_scores_gemma":[0.9594662,0.002396388,0.02312852,0.0007893884,0.0006687355,0.0002160053,0.0002483004,0.0001545979,0.01293196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01615411,"threshold_uncertainty_score":0.05404091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Salomon Bendayan","is_ca":true},{"name":"Joseph Cheriyan","is_ca":true},{"name":"Kevin K. H. Cheung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09799900504041466,"gpt":0.3645096889024662,"spread":0.2665106838620516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106568,0.0009945328,0.001600275,0.0006083258,0.0009847024,0.003719953,0.001368144,0.001815867,0.02103517],"category_scores_gemma":[0.004943867,0.0004565456,0.0008611907,0.001338465,0.0009033362,0.002573543,0.001382362,0.002755808,0.001657424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000842436,"about_ca_system_score_gemma":0.001334739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002265785,"about_ca_topic_score_gemma":0.001453677,"domain_scores_codex":[0.9990672,0.0002870777,0.00004237806,0.0002190065,0.0001946435,0.0001897068],"domain_scores_gemma":[0.9979464,0.001292835,0.0001782817,0.0001407748,0.0002294693,0.000212118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008601894,0.0005958628,0.002405218,0.0009475638,0.0002753781,0.000740011,0.0003308573,0.2697637,0.003308859,0.4504858,0.1015629,0.1687237],"study_design_scores_gemma":[0.0002547672,0.0003463865,0.001584548,0.00006381558,0.00003656584,0.0004907798,0.0002087935,0.446927,0.0009850832,0.5253665,0.02370318,0.00003251396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2146864,0.001350741,0.5764596,0.007655851,0.0008778711,0.0005583085,0.00528324,0.0008326336,0.1922954],"genre_scores_gemma":[0.7979107,0.001146078,0.09496639,0.001046605,0.0005898106,0.0006337878,0.005209639,0.0003343559,0.0981627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02103517,"threshold_uncertainty_score":0.07036966,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Martin Groß","is_ca":false},{"name":"Martin Skutella","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1471800480679098,"gpt":0.3804564062101811,"spread":0.2332763581422713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009013445,0.005257071,0.006001925,0.003783969,0.003299172,0.008695236,0.00615585,0.005187835,0.03039831],"category_scores_gemma":[0.06829456,0.002611017,0.002505337,0.006775409,0.005056615,0.02129648,0.007304707,0.009042829,0.00380702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003858197,"about_ca_system_score_gemma":0.005836687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003579306,"about_ca_topic_score_gemma":0.003388254,"domain_scores_codex":[0.9942697,0.001170189,0.0002450335,0.001018708,0.001087724,0.002208663],"domain_scores_gemma":[0.9464102,0.04208922,0.001722202,0.005230178,0.002653646,0.001894576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004131096,0.0005428313,0.001907597,0.002954197,0.0003058214,0.0004774014,0.0006120673,0.5783427,0.01768308,0.1890387,0.06052795,0.1434765],"study_design_scores_gemma":[0.000155329,0.0003241729,0.0008292136,0.0004701385,0.0002128551,0.0004271028,0.0002348867,0.7687767,0.00747552,0.2140881,0.006885524,0.0001205579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1280655,0.02743323,0.7467665,0.01475673,0.003229147,0.0006058146,0.004592195,0.005026421,0.06952453],"genre_scores_gemma":[0.7620475,0.01236873,0.1894475,0.003139042,0.002382382,0.0008507399,0.001535596,0.002799767,0.02542874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03039831,"threshold_uncertainty_score":0.1016925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Tissue expansion; Mathematics; Mathematical optimization; Computer science; Medicine; Surgery","authors":[{"name":"Majid Taghavi","is_ca":true},{"name":"Kai Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07668023595771185,"gpt":0.2631691389677981,"spread":0.1864889030100863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002299864,0.000777018,0.001319469,0.0005418102,0.0004024591,0.001285557,0.001660327,0.001552242,0.005233179],"category_scores_gemma":[0.004929939,0.0008250212,0.000996051,0.001135689,0.001047925,0.002384355,0.001101914,0.001753361,0.0002368946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001655554,"about_ca_system_score_gemma":0.001452803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003208749,"about_ca_topic_score_gemma":0.00330522,"domain_scores_codex":[0.9983811,0.0007111541,0.00005706343,0.0003229021,0.0002656042,0.0002621753],"domain_scores_gemma":[0.996529,0.002357138,0.0004952339,0.0001535601,0.0002548942,0.0002101152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008761244,0.00003923592,0.0002759635,0.00008044886,0.00004691806,0.0002635498,0.00002658922,0.9377214,0.0007446166,0.05394163,0.0008457018,0.005926312],"study_design_scores_gemma":[0.00001987272,0.00003167353,0.0001293813,0.000007989114,0.00001141761,0.00004593211,0.00001622763,0.9813525,0.0003107755,0.01745881,0.0006041265,0.0000113016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1511341,0.0009130696,0.8327565,0.001538333,0.0001641988,0.0001415877,0.000578043,0.0002794626,0.01249474],"genre_scores_gemma":[0.964703,0.0003144758,0.0284741,0.00009349435,0.00008846196,0.0001184784,0.0001677071,0.0000478982,0.005992336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005233179,"threshold_uncertainty_score":0.01750672,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shinji Mizuno","is_ca":false},{"name":"Noriyoshi Sukegawa","is_ca":false},{"name":"Antoine Deza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2905634287283733,"gpt":0.4823722494864992,"spread":0.1918088207581259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002220654,0.001321487,0.0021462,0.001042707,0.0009892946,0.001697695,0.002576969,0.001658641,0.01531081],"category_scores_gemma":[0.004164869,0.0007900098,0.0009066478,0.001579855,0.001200043,0.001555044,0.001829381,0.00323019,0.00293987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001402657,"about_ca_system_score_gemma":0.002178462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144678,"about_ca_topic_score_gemma":0.002412469,"domain_scores_codex":[0.9988229,0.0004918422,0.00005760589,0.0001765969,0.0003364608,0.0001145851],"domain_scores_gemma":[0.998672,0.0006777536,0.00006504186,0.0001778813,0.0002958532,0.0001115895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008226558,0.0002966884,0.0003861138,0.0003469611,0.00007885615,0.0001466933,0.0001569645,0.6127548,0.003536342,0.1961503,0.01733921,0.1679845],"study_design_scores_gemma":[0.00007454732,0.00008414184,0.00005215351,0.00002050165,0.00001168644,0.00005751079,0.00001982609,0.9634959,0.0008723131,0.03163877,0.003658551,0.00001411878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006389156,0.0002475702,0.9835312,0.0003241858,0.0002387665,0.00008245467,0.00008513261,0.0003240606,0.008777414],"genre_scores_gemma":[0.1663661,0.0003518116,0.8170739,0.0002117748,0.0001800892,0.0002936613,0.0002863985,0.0003905513,0.01484575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01531081,"threshold_uncertainty_score":0.05121982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maxwell Levit","is_ca":true},{"name":"L. Sunil Chandran","is_ca":false},{"name":"Joseph Cheriyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1056014198098545,"gpt":0.3706132696872155,"spread":0.265011849877361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003381683,0.0006115801,0.0003470598,0.001073704,0.0008397424,0.001730793,0.0005102234,0.0003625166,0.007865684],"category_scores_gemma":[0.001472768,0.000301313,0.0002333151,0.0008831939,0.001252229,0.001725922,0.001295916,0.0009975737,0.001177541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006842717,"about_ca_system_score_gemma":0.0004253721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219095,"about_ca_topic_score_gemma":0.001901421,"domain_scores_codex":[0.9997649,0.00005494478,0.00001086282,0.00003097658,0.00005863317,0.00007976841],"domain_scores_gemma":[0.9993424,0.0002093899,0.0001265503,0.0000619067,0.0001067359,0.0001530164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001684882,0.0000320469,0.001127191,0.00007541331,0.000007071388,0.0002041176,0.0003785864,0.01151866,0.004007311,0.9578723,0.00287801,0.02173072],"study_design_scores_gemma":[0.00003091795,0.00003703144,0.0009068478,0.00006324572,0.000008780125,0.0001281218,0.0005470586,0.02002418,0.002088667,0.9647061,0.01143532,0.00002370259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7409045,0.001421769,0.1169557,0.0009940986,0.000590632,0.00007571475,0.0005268472,0.0002020522,0.1383288],"genre_scores_gemma":[0.9483958,0.002320106,0.01965067,0.0002808699,0.0002099253,0.00006469587,0.0005931154,0.0002190872,0.02826581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007865684,"threshold_uncertainty_score":0.02631336,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Zhentao Li","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0580586038922692,"gpt":0.3224082306799817,"spread":0.2643496267877125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005083883,0.001649479,0.002057492,0.001666679,0.001692632,0.003501096,0.002498469,0.002478878,0.009844529],"category_scores_gemma":[0.03441999,0.001206904,0.001367722,0.001121106,0.002989432,0.006095996,0.003117858,0.00492391,0.001070365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001983571,"about_ca_system_score_gemma":0.00129531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008440639,"about_ca_topic_score_gemma":0.0006718007,"domain_scores_codex":[0.9973125,0.0006888179,0.0001135101,0.0004400715,0.0007234946,0.0007216251],"domain_scores_gemma":[0.9528764,0.03691877,0.002721725,0.002832782,0.001830155,0.002820126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001740027,0.0002077853,0.001508432,0.000823403,0.0001979429,0.0002516885,0.0005891586,0.3599497,0.02460448,0.5505407,0.01078646,0.04880022],"study_design_scores_gemma":[0.00005348934,0.0002931748,0.001562335,0.0001667184,0.00008914666,0.0002223002,0.0002910924,0.7351639,0.007968845,0.2486005,0.005502954,0.00008556691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2030517,0.01084827,0.7206702,0.006283785,0.00117788,0.0001067694,0.0005653721,0.001345556,0.05595047],"genre_scores_gemma":[0.9276299,0.003642453,0.05039295,0.0006587026,0.0004837369,0.0002271925,0.0005198472,0.0008447369,0.01560057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009844529,"threshold_uncertainty_score":0.03293329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrew Butler","is_ca":true},{"name":"Roy H. Kwon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2601772201591964,"gpt":0.4724558772527916,"spread":0.2122786570935952,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005740351,0.001702031,0.003466228,0.00129247,0.0008718994,0.002131603,0.002406763,0.002416772,0.003457878],"category_scores_gemma":[0.01455876,0.001445254,0.001182434,0.001605034,0.001768503,0.002290057,0.002299222,0.004170518,0.001134989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419087,"about_ca_system_score_gemma":0.002120282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004416898,"about_ca_topic_score_gemma":0.004070804,"domain_scores_codex":[0.9981782,0.0008673876,0.00007182534,0.0001797481,0.0005095971,0.0001930755],"domain_scores_gemma":[0.9945143,0.003608443,0.0002718483,0.0004152096,0.0008973097,0.0002927936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002645933,0.0002855767,0.001019117,0.0003775318,0.0001331732,0.0001006101,0.00007322412,0.7196333,0.001667432,0.1243925,0.01455434,0.1374987],"study_design_scores_gemma":[0.000008966909,0.00001451261,0.00005297982,0.00001168386,0.000005936971,0.000008657548,0.000002990502,0.9790322,0.0001470413,0.02023946,0.0004719798,0.000003654342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005843328,0.001133585,0.9899971,0.0005788725,0.0001127948,0.0000535431,0.00005856047,0.0002493868,0.001972898],"genre_scores_gemma":[0.3821076,0.002678766,0.596033,0.0009567398,0.0008398968,0.0005476662,0.0008591215,0.0006354229,0.01534172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005740351,"threshold_uncertainty_score":0.0303582,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ahmad Abdi","is_ca":false},{"name":"Gérard Cornuéjols","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03179020033189318,"gpt":0.3315998570981613,"spread":0.2998096567662681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002273025,0.000841054,0.001281313,0.00223453,0.002139441,0.003725963,0.001371043,0.001520087,0.01429945],"category_scores_gemma":[0.00703647,0.0007232571,0.001498047,0.0008790043,0.005034558,0.004927549,0.004351372,0.003763654,0.001292484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110428,"about_ca_system_score_gemma":0.0006246105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006474621,"about_ca_topic_score_gemma":0.0004452195,"domain_scores_codex":[0.9978244,0.000661076,0.00009187584,0.0004009504,0.0005969197,0.0004248263],"domain_scores_gemma":[0.995822,0.002148682,0.0005152117,0.0005698634,0.0003642523,0.0005800337],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004705343,0.00001741689,0.00008662649,0.00001680108,0.000007087702,0.0000248527,0.00007807914,0.001359999,0.0004255322,0.9958647,0.0005885014,0.001483354],"study_design_scores_gemma":[0.00002069068,0.00002710606,0.00015189,0.0000103557,0.000005560978,0.0000760568,0.00006170692,0.006326337,0.000427884,0.9907681,0.002112834,0.00001145792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.402323,0.001713457,0.3713877,0.005280646,0.0006183668,0.0001387749,0.0007527145,0.0004083786,0.2173771],"genre_scores_gemma":[0.9359977,0.0006112412,0.0214381,0.0006386091,0.0004406995,0.0001178738,0.0005361781,0.0001920194,0.04002747],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01429945,"threshold_uncertainty_score":0.04783642,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Binary number; Group (periodic table); Mathematics; Combinatorics; Binary data; Discrete mathematics; Arithmetic; Physics","authors":[{"name":"Yan Shu","is_ca":false},{"name":"Sunil Chopra","is_ca":true},{"name":"Ellis L. Johnson","is_ca":false},{"name":"Sangho Shim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1354584550971923,"gpt":0.3894642043212603,"spread":0.254005749224068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544171,0.0007686495,0.001083292,0.002219312,0.001185121,0.004600193,0.0008905415,0.0008636576,0.007224066],"category_scores_gemma":[0.004627093,0.0004943734,0.000587904,0.001849302,0.002976299,0.003537668,0.002766964,0.002560369,0.0009879299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000895922,"about_ca_system_score_gemma":0.0006670096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001150434,"about_ca_topic_score_gemma":0.001073669,"domain_scores_codex":[0.9988959,0.0001501326,0.00005710554,0.0001419949,0.000471159,0.0002836123],"domain_scores_gemma":[0.9976612,0.000983969,0.0003857973,0.0002744878,0.0003201283,0.0003743451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001026238,0.00002678721,0.0004802653,0.00005258193,0.00001530884,0.0001608812,0.0001666362,0.0007618039,0.001510781,0.9877316,0.001590485,0.007400339],"study_design_scores_gemma":[0.00003691865,0.00001584539,0.000575286,0.00002311467,0.00001189398,0.0002594951,0.0002053727,0.005140358,0.001153577,0.989175,0.003387887,0.00001531236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6131483,0.001216104,0.1972581,0.002443468,0.0004814572,0.0001592279,0.001267651,0.0001798966,0.1838458],"genre_scores_gemma":[0.96084,0.0006629665,0.01837235,0.0002214158,0.000324868,0.0001160093,0.0007398744,0.00007636456,0.01864617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007224066,"threshold_uncertainty_score":0.02416688,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Qiaoming Han","is_ca":false},{"name":"Abraham P. Punnen","is_ca":true},{"name":"Yinyu Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05798311254050664,"gpt":0.3598596864221159,"spread":0.3018765738816093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107148,0.001271755,0.001692529,0.001936372,0.001539305,0.00287313,0.003269779,0.002256257,0.009560433],"category_scores_gemma":[0.004431932,0.00073651,0.002045238,0.002774249,0.001001357,0.003867498,0.003157495,0.003157036,0.00237938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525391,"about_ca_system_score_gemma":0.002310578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002809659,"about_ca_topic_score_gemma":0.003377288,"domain_scores_codex":[0.9985216,0.0003245636,0.00007165292,0.0003053081,0.0004850057,0.000291775],"domain_scores_gemma":[0.9973664,0.001461294,0.0001036821,0.0005896699,0.0003010295,0.0001780183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001516298,0.001361046,0.001606569,0.0006125284,0.0002113077,0.0003181878,0.0005143435,0.1057967,0.01614453,0.1006228,0.05029872,0.7209969],"study_design_scores_gemma":[0.0005569652,0.0002721103,0.001459855,0.00008003944,0.0002100201,0.0004846489,0.0002782019,0.6715924,0.01025101,0.2967095,0.01803332,0.00007197401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0943654,0.001035079,0.8603535,0.002599451,0.0004295281,0.000681981,0.001241294,0.00390468,0.03538908],"genre_scores_gemma":[0.2535157,0.0006146948,0.7252374,0.0006366468,0.0003050036,0.0005798443,0.003684311,0.0007201773,0.01470623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009560433,"threshold_uncertainty_score":0.03198284,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ruken Düzgün","is_ca":true},{"name":"Aurélie Thiele","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4841275584469856,"gpt":0.4660255832628508,"spread":0.01810197518413476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002726912,0.001507292,0.002239446,0.001075642,0.0006865858,0.003015008,0.001775105,0.002077648,0.008188088],"category_scores_gemma":[0.01616383,0.00086053,0.001662733,0.001369524,0.001513541,0.00338261,0.002961808,0.004740738,0.001679282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899583,"about_ca_system_score_gemma":0.002170599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626865,"about_ca_topic_score_gemma":0.003039242,"domain_scores_codex":[0.998307,0.0006225207,0.00006415466,0.0002498933,0.0005761113,0.0001803483],"domain_scores_gemma":[0.9952587,0.003434867,0.0002347348,0.0006308111,0.0003236203,0.0001172036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001778367,0.00009436697,0.0002449921,0.0001207062,0.00005265232,0.0001162851,0.00006715005,0.5523002,0.00112751,0.3918569,0.006357029,0.04748435],"study_design_scores_gemma":[0.0000167284,0.00001696207,0.00003334259,0.00001626144,0.000009468406,0.00001914282,0.000007017778,0.836724,0.0002417122,0.1616347,0.001275112,0.000005557866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003326517,0.0002115992,0.9893482,0.0005402947,0.00005660401,0.00003333289,0.000105641,0.0001599426,0.006217903],"genre_scores_gemma":[0.3846372,0.001068477,0.5877274,0.0006654786,0.0003961067,0.0005307707,0.0007082962,0.0005070218,0.02375926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008188088,"threshold_uncertainty_score":0.02739191,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Timothy C. Y. Chan","is_ca":true},{"name":"Adam Diamant","is_ca":true},{"name":"Rafid Mahmood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2966483137067856,"gpt":0.4570154344034947,"spread":0.1603671206967091,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003964388,0.001364364,0.002648176,0.001528568,0.001245399,0.001868427,0.004311705,0.00297686,0.0059031],"category_scores_gemma":[0.01947796,0.001850145,0.00179454,0.002259842,0.00231972,0.002046353,0.003460319,0.005501296,0.001273789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001423094,"about_ca_system_score_gemma":0.004189127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01819404,"about_ca_topic_score_gemma":0.01735257,"domain_scores_codex":[0.9978531,0.00109804,0.0001041085,0.0003132097,0.0004544179,0.0001771805],"domain_scores_gemma":[0.9891102,0.008183057,0.0002872555,0.001021162,0.001087807,0.0003105528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000530055,0.0001588261,0.001079884,0.000222703,0.0001070025,0.0001019996,0.0001778763,0.8090268,0.001965059,0.04810394,0.007175817,0.13135],"study_design_scores_gemma":[0.00001656315,0.00001134293,0.00002503099,0.000007953167,0.000003819332,0.000006594709,0.000003706136,0.9930106,0.0001933481,0.006393474,0.0003229142,0.000004753222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003625812,0.0001213429,0.9948593,0.0001479521,0.00003915289,0.00007255314,0.000092951,0.0004038485,0.00063706],"genre_scores_gemma":[0.1292461,0.0001802559,0.8661751,0.0003413337,0.0001283608,0.0008137887,0.0007936512,0.000313973,0.002007456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01819404,"threshold_uncertainty_score":0.03617632,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Silvana M. Pesenti","is_ca":true},{"name":"Steven Vanduffel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.200695500219769,"gpt":0.4479512296532597,"spread":0.2472557294334907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008086407,0.001520721,0.001857641,0.001775883,0.001206364,0.003380861,0.002057425,0.003410527,0.004341473],"category_scores_gemma":[0.02380566,0.0007615722,0.001213228,0.001520933,0.00440331,0.006808944,0.004808043,0.004343386,0.000755815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003610134,"about_ca_system_score_gemma":0.002053417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001523706,"about_ca_topic_score_gemma":0.001214228,"domain_scores_codex":[0.9951998,0.002455224,0.0002728245,0.0006852752,0.000998178,0.0003885603],"domain_scores_gemma":[0.9918853,0.004216362,0.0008799243,0.001029218,0.001066827,0.0009224148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005682693,0.00004187833,0.0004425413,0.00008215872,0.0000308453,0.00007835813,0.0001014104,0.1361732,0.001796416,0.8481671,0.0009757199,0.01205353],"study_design_scores_gemma":[0.00001358329,0.0000423933,0.0001777694,0.00002711286,0.000007449291,0.00003931328,0.00002547872,0.444165,0.0006358624,0.5540738,0.0007659562,0.00002630847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05020734,0.0003342859,0.9403681,0.0008936157,0.00007491434,0.00007200986,0.0001486768,0.0001944378,0.007706744],"genre_scores_gemma":[0.8351054,0.0008090629,0.1516829,0.0005019771,0.0001692707,0.0004081016,0.0004652475,0.0004724281,0.01038579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008086407,"threshold_uncertainty_score":0.04276556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianpaolo Oriolo","is_ca":false},{"name":"Laura Sanità","is_ca":true},{"name":"Rico Zenklusen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07737951602445946,"gpt":0.3222089761203714,"spread":0.2448294600959119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001296419,0.0008606464,0.0009396681,0.0009903508,0.0006032285,0.002431656,0.002069448,0.001483107,0.002693101],"category_scores_gemma":[0.005656525,0.0007198052,0.0006646395,0.001061926,0.001093889,0.002224534,0.001262671,0.001688172,0.0004579825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001824246,"about_ca_system_score_gemma":0.001124094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001266286,"about_ca_topic_score_gemma":0.001591971,"domain_scores_codex":[0.9982475,0.000705414,0.00005816437,0.0003366885,0.0004644453,0.0001878226],"domain_scores_gemma":[0.996287,0.001941781,0.0004455044,0.0005013275,0.0005138934,0.0003105516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001675688,0.0001157635,0.0004151063,0.0001013346,0.00005315752,0.0001310893,0.00005385655,0.698648,0.004857791,0.2761223,0.001759636,0.01757447],"study_design_scores_gemma":[0.00002904199,0.00003049833,0.00005280671,0.000005990455,0.00001040368,0.00003758072,0.000008588971,0.9434586,0.0006054134,0.05522349,0.0005285619,0.000009116044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05736671,0.0001710423,0.9318622,0.0009068028,0.0001467461,0.00008380758,0.0002217395,0.0001525454,0.009088395],"genre_scores_gemma":[0.8584936,0.0003657326,0.133601,0.0002125333,0.0001854107,0.0001719757,0.0001399509,0.00004092401,0.006788834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002693101,"threshold_uncertainty_score":0.01323587,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Binyamin Oz","is_ca":false},{"name":"Moshe Haviv","is_ca":false},{"name":"Martin L. Puterman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08374648839579794,"gpt":0.3626902892683113,"spread":0.2789438008725134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004346468,0.0005199877,0.001215236,0.0006074824,0.001510419,0.003245687,0.001965787,0.001420705,0.002639109],"category_scores_gemma":[0.02310245,0.0006263535,0.000606645,0.000742643,0.001520742,0.004392645,0.00174873,0.00211919,0.0004054271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001296481,"about_ca_system_score_gemma":0.001860795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001174958,"about_ca_topic_score_gemma":0.0009982664,"domain_scores_codex":[0.9972779,0.00112051,0.0001155138,0.0003366721,0.0005764443,0.0005729466],"domain_scores_gemma":[0.9810244,0.01292711,0.00124218,0.001817575,0.001359788,0.001628936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00291767,0.0007696246,0.007830514,0.0002978202,0.0001604788,0.0005348774,0.001014366,0.3364062,0.02414661,0.5444778,0.002871468,0.0785726],"study_design_scores_gemma":[0.0000996516,0.0003840946,0.00118547,0.00001773175,0.00005881306,0.0002433836,0.0001729996,0.8791181,0.001929449,0.1162033,0.0005338605,0.00005307069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6277056,0.001269243,0.3567376,0.001597138,0.000303048,0.00005659889,0.0000670299,0.0004494018,0.01181445],"genre_scores_gemma":[0.992869,0.0001400661,0.006366643,0.00008102438,0.0000673427,0.000009764261,0.00001279279,0.00002011873,0.0004333109],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004346468,"threshold_uncertainty_score":0.02298665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Geoffrey W. Brown","is_ca":true},{"name":"N. Balakrishnan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03858907018433338,"gpt":0.3290342602465398,"spread":0.2904451900622064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002951809,0.0006145578,0.0007897749,0.001084586,0.0006852602,0.00232632,0.001908448,0.0007686891,0.004252899],"category_scores_gemma":[0.01041072,0.0006220576,0.0006703218,0.001120654,0.001473973,0.003771549,0.001411421,0.002494508,0.0003907033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002586313,"about_ca_system_score_gemma":0.00231691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005045261,"about_ca_topic_score_gemma":0.003701356,"domain_scores_codex":[0.9993962,0.0002299899,0.00002222807,0.0000494073,0.0001865403,0.0001155592],"domain_scores_gemma":[0.9968555,0.002235378,0.0001838538,0.0001863359,0.0003559993,0.0001829389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008488038,0.00005188307,0.0003930789,0.00005115411,0.00002155297,0.00006619663,0.000211034,0.1015788,0.001191609,0.8876119,0.001413478,0.007324422],"study_design_scores_gemma":[0.00001238641,0.000005062219,0.00009311622,0.00000893248,0.000005697128,0.00000977936,0.00001656978,0.869319,0.0001326079,0.1296882,0.0007010185,0.000007696836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0961688,0.001813715,0.8739322,0.001888139,0.0003409498,0.0000505685,0.0001644269,0.0001474277,0.02549383],"genre_scores_gemma":[0.8922851,0.001350727,0.07717533,0.0002676216,0.0003496688,0.0001425822,0.0001572628,0.0001952511,0.02807646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005045261,"threshold_uncertainty_score":0.01876515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}