{"meta":{"query_hash":"381b769beff3","filters":{"venue":"Top"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/381b769beff3","api":"https://metacan.xera.ac/api/v1/cohort?venue=Top"},"results":[{"id":"W1983527657","doi":"10.1007/s11750-012-0248-6","title":"Locating an axis-parallel rectangle on a Manhattan plane","year":2012,"lang":"en","type":"article","venue":"Top","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Rectangle; Plane (geometry); Computer science; Geometry; Computer graphics (images); Mathematics; Combinatorics","score_opus":0.028607151975653985,"score_gpt":0.27747706825262436,"score_spread":0.24886991627697036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983527657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04267592,0.00017518678,0.9455155,0.00019814665,0.00009829956,0.00015805705,0.00021705423,0.0012987434,0.009663024],"genre_scores_gemma":[0.2093336,0.00018538567,0.7847786,0.00004865245,0.00002292363,0.00009971027,0.00040809377,0.0003689303,0.004754129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990784,0.0002119986,0.00003887379,0.00017991589,0.00035872354,0.00013210124],"domain_scores_gemma":[0.99926,0.00026293795,0.0000735343,0.00016702629,0.00017763702,0.00005891676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069154747,0.0010467761,0.0009100019,0.0011976492,0.0008940085,0.0014300621,0.0016754902,0.0012438281,0.005747303],"category_scores_gemma":[0.0029244868,0.0007885428,0.00069626054,0.0012071622,0.00072059047,0.0012550069,0.0023742984,0.0009655158,0.0026752406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016583893,0.0003051557,0.0075222263,0.0006068231,0.000118339936,0.0019071233,0.0010089932,0.384606,0.107166044,0.11209474,0.018973732,0.36403242],"study_design_scores_gemma":[0.00007502958,0.00020952955,0.0010731412,0.000056457557,0.000030168037,0.0005600279,0.0003609855,0.92960286,0.037173443,0.01525117,0.015562513,0.000044645807],"about_ca_topic_score_codex":0.0028448852,"about_ca_topic_score_gemma":0.0032614665,"teacher_disagreement_score":0.005747303,"about_ca_system_score_codex":0.0006740264,"about_ca_system_score_gemma":0.00096425036,"threshold_uncertainty_score":0.01922661},"labels":[],"label_agreement":null},{"id":"W1997272816","doi":"10.1007/s11750-015-0383-y","title":"An optimization model for aggregation of prescribed burn units","year":2015,"lang":"en","type":"article","venue":"Top","topic":"Fire effects on ecosystems","field":"Environmental Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Computer science; Environmental science; Prescribed burn; Integer programming; Reduction (mathematics); Burn units; Firefighting; Operations research; Environmental resource management; Engineering; Mathematics; Ecology; Geography; Algorithm","score_opus":0.030525591141152893,"score_gpt":0.24772343623865162,"score_spread":0.21719784509749873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997272816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107689805,0.0008965787,0.8753475,0.00086868106,0.00018380808,0.00013963273,0.0008480699,0.000334446,0.013691514],"genre_scores_gemma":[0.84481853,0.00059268257,0.1310092,0.00024599957,0.00012618996,0.00039033208,0.00064056134,0.00023632427,0.021940162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938583,0.00022706001,0.00002990444,0.00013483172,0.00007816756,0.00014420292],"domain_scores_gemma":[0.99846315,0.0009094599,0.00017656326,0.0000636014,0.00018501308,0.00020226887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016424342,0.0013187634,0.0027566326,0.0008607797,0.0010450882,0.0022594924,0.0025157603,0.0031752128,0.0049373456],"category_scores_gemma":[0.0038033882,0.0013028155,0.0014103203,0.0017148808,0.0013353823,0.0018146529,0.0015694175,0.0017456157,0.000404857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001276708,0.000007712244,0.00010776751,0.0000072221555,0.000010209554,0.000012477149,0.0000067941833,0.9965888,0.00006348382,0.0020223018,0.00018998863,0.0009704877],"study_design_scores_gemma":[0.000004122912,0.000004060549,0.0000408934,0.0000016510353,0.0000038105295,0.0000021533233,0.0000029125513,0.99878186,0.000018042641,0.0010436322,0.00009510929,0.0000018405037],"about_ca_topic_score_codex":0.03996482,"about_ca_topic_score_gemma":0.018578993,"teacher_disagreement_score":0.03996482,"about_ca_system_score_codex":0.0027978788,"about_ca_system_score_gemma":0.0018384807,"threshold_uncertainty_score":0.079464436},"labels":[],"label_agreement":null},{"id":"W2005484777","doi":"10.1007/bf02578956","title":"On self-regular IPMs","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Duality gap; Conic section; Duality (order theory); Conic optimization; Dual (grammatical number); Mathematical optimization; Semidefinite programming; Interior point method; Optimization problem; Point (geometry); Discrete mathematics; Convex optimization; Subderivative","score_opus":0.031515506881294245,"score_gpt":0.3562669717050758,"score_spread":0.3247514648237816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005484777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15483083,0.0012661283,0.73547477,0.003065569,0.0004913516,0.00007747637,0.00044281466,0.0011138285,0.10323719],"genre_scores_gemma":[0.8500853,0.001044748,0.08208533,0.0011889915,0.00069776515,0.0001473011,0.0005933411,0.00074705476,0.06341009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935216,0.00019286467,0.000028632732,0.00011983363,0.00020485414,0.00010168723],"domain_scores_gemma":[0.99773127,0.0010479566,0.0002320396,0.00042806813,0.00028943524,0.0002712704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753332,0.000659608,0.0009646004,0.0012287361,0.0011946469,0.0017950482,0.0012453011,0.0010693963,0.011752435],"category_scores_gemma":[0.008354628,0.00040270263,0.00072521094,0.0009860285,0.0018709726,0.0035507118,0.0035176673,0.0026123729,0.0014058481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048744827,0.000023230705,0.000277196,0.00005544856,0.000013377498,0.000058715395,0.00008177356,0.010994837,0.00046105232,0.9707381,0.0050713825,0.012176229],"study_design_scores_gemma":[0.000008945642,0.000016819147,0.00012488021,0.000011732591,0.0000064070723,0.00006242502,0.000029162577,0.05681073,0.00028014087,0.9398485,0.0027950096,0.0000053416156],"about_ca_topic_score_codex":0.0005617373,"about_ca_topic_score_gemma":0.000543608,"teacher_disagreement_score":0.011752435,"about_ca_system_score_codex":0.0007954627,"about_ca_system_score_gemma":0.000502346,"threshold_uncertainty_score":0.03931576},"labels":[],"label_agreement":null},{"id":"W2006474481","doi":"10.1007/s11750-013-0276-x","title":"Comments on: Multicriteria decision systems for financial problems","year":2013,"lang":"en","type":"article","venue":"Top","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Computer science; Mathematical economics; Management science; Economics","score_opus":0.08747867990037758,"score_gpt":0.37442683384914804,"score_spread":0.2869481539487705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006474481","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016346796,0.0016775116,0.0006944196,0.89727485,0.09737334,0.00003557904,0.00036014096,0.00008548629,0.0023352562],"genre_scores_gemma":[0.0031218808,0.0020256208,0.0014126359,0.83075684,0.14455278,0.00010036801,0.00019813144,0.00016004963,0.017671756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994402,0.0014745294,0.0010245815,0.00069770846,0.0019220489,0.00047923267],"domain_scores_gemma":[0.9531361,0.02455112,0.0021086806,0.0012712819,0.017037917,0.0018947741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072862143,0.0017468459,0.002129971,0.0020472684,0.0035667722,0.004280805,0.004146708,0.03246241,0.033058744],"category_scores_gemma":[0.0637293,0.00095356716,0.0021289578,0.0022936424,0.0027328713,0.005064737,0.002589197,0.027476845,0.01643042],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016954451,0.000004595108,0.00004930525,0.000040923813,0.000004542323,0.000054225435,0.00003470113,0.00005436078,0.000039145045,0.00064982555,0.9977781,0.0012732003],"study_design_scores_gemma":[0.000059451886,0.000021566613,0.0011203919,0.00028433595,0.000026332851,0.00018077077,0.00021292936,0.00087140163,0.00018040102,0.0054021175,0.9915593,0.000080909405],"about_ca_topic_score_codex":0.022824518,"about_ca_topic_score_gemma":0.021231834,"teacher_disagreement_score":0.033058744,"about_ca_system_score_codex":0.005115282,"about_ca_system_score_gemma":0.004310746,"threshold_uncertainty_score":0.110592484},"labels":[],"label_agreement":null},{"id":"W2029570945","doi":"10.1007/s11750-011-0188-6","title":"A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"National University of Defense Technology","keywords":"Heuristics; Vehicle routing problem; Heuristic; Variable neighborhood search; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Local search (optimization); Service (business); Mathematics; Metaheuristic","score_opus":0.03343292112571488,"score_gpt":0.24563083175669856,"score_spread":0.21219791063098367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029570945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04190881,0.00060240785,0.9519478,0.00025743406,0.00016128537,0.00008751138,0.0000723378,0.00025695894,0.0047055306],"genre_scores_gemma":[0.5394343,0.0004328814,0.45305166,0.00019478475,0.00011819104,0.00029869887,0.00023253929,0.00018540444,0.0060515055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957484,0.00019116655,0.000011468832,0.000054760054,0.000113773305,0.000054000197],"domain_scores_gemma":[0.99938107,0.00037565723,0.000056500518,0.000039452596,0.00010148294,0.00004585747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083033065,0.0005297569,0.0012630275,0.0006580346,0.0004500015,0.0007214679,0.001459405,0.0011863591,0.002770436],"category_scores_gemma":[0.0020622115,0.00047105917,0.0006498205,0.0008458574,0.0005468425,0.00093832304,0.00085316517,0.0007500552,0.00026030355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006492038,0.000043593252,0.0001631012,0.000033339962,0.000023032595,0.000028426546,0.000024302923,0.9621239,0.00048127802,0.009108674,0.0013080284,0.026597485],"study_design_scores_gemma":[0.000009797707,0.000013179228,0.000025372368,0.0000027432147,0.0000031656973,0.000004604512,0.0000037520124,0.99820614,0.00005054548,0.0014346953,0.00024406082,0.000002022847],"about_ca_topic_score_codex":0.0071134963,"about_ca_topic_score_gemma":0.00690274,"teacher_disagreement_score":0.0071134963,"about_ca_system_score_codex":0.000939865,"about_ca_system_score_gemma":0.0013146452,"threshold_uncertainty_score":0.014144182},"labels":[],"label_agreement":null},{"id":"W2053246538","doi":"10.1007/bf02579086","title":"Location and sizing of facilities on a line","year":2001,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Sizing; Computer science; Facility location problem; Line (geometry); Process (computing); Mathematical optimization; Operations research; Dynamic programming; Decision process; Location-allocation; Algorithm; Management science; Mathematics; Economics","score_opus":0.018838951536420782,"score_gpt":0.22815453669800587,"score_spread":0.20931558516158508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053246538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6292533,0.00025718042,0.3474168,0.0003011292,0.00010140587,0.0002661226,0.0015500161,0.0009120273,0.01994204],"genre_scores_gemma":[0.92309403,0.00010131939,0.07005674,0.000018349572,0.000023637478,0.00006642173,0.00046563247,0.000058000896,0.0061158333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964356,0.0000855688,0.000014500563,0.000092214585,0.000087511915,0.00007658569],"domain_scores_gemma":[0.9994636,0.00016216704,0.00015639316,0.000064276785,0.00008707338,0.00006640664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038361456,0.0011098752,0.0010447516,0.0009784889,0.0005405938,0.0016775852,0.00095870736,0.0008444199,0.0064629964],"category_scores_gemma":[0.0016407977,0.00072960794,0.00053711457,0.0012827091,0.0005103671,0.001144148,0.0005991583,0.0005881865,0.00084673474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031169798,0.00007012866,0.002481905,0.000074222735,0.000034607125,0.00011448622,0.00003383364,0.9612349,0.007797754,0.003377028,0.0009615551,0.0235079],"study_design_scores_gemma":[0.000036540943,0.00024231606,0.002745641,0.000008078842,0.000025970734,0.000053537475,0.00006602099,0.9885308,0.0041021174,0.0032341178,0.0009381015,0.00001673263],"about_ca_topic_score_codex":0.006599812,"about_ca_topic_score_gemma":0.0077522425,"teacher_disagreement_score":0.006599812,"about_ca_system_score_codex":0.0008879944,"about_ca_system_score_gemma":0.00076812314,"threshold_uncertainty_score":0.02162087},"labels":[],"label_agreement":null},{"id":"W2053637459","doi":"10.1007/s11750-007-0015-2","title":"Rejoinder on: Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Scheme (mathematics); Pickup; Computer science; Classification scheme; Mathematical optimization; Operations research; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03547897311900935,"score_gpt":0.24262768928204104,"score_spread":0.20714871616303168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053637459","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719006,0.2747777,0.41982672,0.09794721,0.014244216,0.00047527716,0.003931872,0.0010672729,0.11053964],"genre_scores_gemma":[0.3739104,0.19410008,0.2254664,0.026847964,0.029659586,0.000619528,0.014892424,0.0012708108,0.1332328],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978397,0.00029225135,0.0002259035,0.0006660789,0.0008060335,0.00017006228],"domain_scores_gemma":[0.9918737,0.0028041587,0.00045905684,0.0010374978,0.0033373793,0.00048828754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002875898,0.001103786,0.0025013266,0.0043623447,0.001374885,0.0042114845,0.0029044086,0.00290566,0.007931279],"category_scores_gemma":[0.009437128,0.00034194623,0.0013551041,0.009706515,0.0017492599,0.0071703577,0.0028429085,0.0042315917,0.0048084655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688436,0.00033861722,0.008325592,0.0013593053,0.000110632645,0.00023522555,0.00061600853,0.008431261,0.0018148087,0.120981224,0.2727452,0.58477336],"study_design_scores_gemma":[0.00008075689,0.00051898794,0.009615592,0.00077144493,0.0001606165,0.0017235606,0.00089622464,0.026644642,0.0029220036,0.18314256,0.7733788,0.0001448168],"about_ca_topic_score_codex":0.0031661007,"about_ca_topic_score_gemma":0.003375586,"teacher_disagreement_score":0.007931279,"about_ca_system_score_codex":0.0013020588,"about_ca_system_score_gemma":0.0016886749,"threshold_uncertainty_score":0.026532829},"labels":[],"label_agreement":null},{"id":"W2064073889","doi":"10.1007/bf02579017","title":"Tabu Search heuristics for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Set (abstract data type); Point (geometry); Routing (electronic design automation); Interval (graph theory); Metaheuristic; Mathematics","score_opus":0.024233844463323818,"score_gpt":0.2493872648064071,"score_spread":0.22515342034308328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064073889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0286471,0.0040760813,0.95313,0.00043794574,0.00022211076,0.00016843158,0.00035253447,0.0013312515,0.0116344765],"genre_scores_gemma":[0.30184552,0.002391837,0.68482244,0.00027127008,0.00015409355,0.0005501301,0.0005877214,0.0006118024,0.00876527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930453,0.00039638588,0.000023310591,0.00006464965,0.000103784645,0.00010737414],"domain_scores_gemma":[0.9981686,0.0014883017,0.00010167242,0.00008538112,0.00010617819,0.000049990565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013369024,0.00093815895,0.0010901401,0.0013348521,0.00073602545,0.0012742582,0.0014262357,0.0013248206,0.006596752],"category_scores_gemma":[0.0039672265,0.00093282486,0.0008989062,0.0026931597,0.0007723862,0.0017707446,0.0007444155,0.0017543364,0.0009817741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981358,0.0000823825,0.00019576341,0.00012399485,0.00005568095,0.000028760556,0.000058307127,0.885099,0.0004097166,0.020058528,0.0053494046,0.08840861],"study_design_scores_gemma":[0.000044958528,0.00003186493,0.00007731655,0.000019982921,0.00001767942,0.000011336939,0.000021830172,0.98231816,0.00022623962,0.0153671885,0.0018562895,0.000007079039],"about_ca_topic_score_codex":0.009562253,"about_ca_topic_score_gemma":0.009118099,"teacher_disagreement_score":0.009562253,"about_ca_system_score_codex":0.0013174703,"about_ca_system_score_gemma":0.0017514079,"threshold_uncertainty_score":0.022068322},"labels":[],"label_agreement":null},{"id":"W2070102492","doi":"10.1007/s11750-007-0018-z","title":"Nonhomogeneous geometric distributions with relations to birth and death processes","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Birth–death process; Queueing theory; Limiting; Geometric distribution; Applied mathematics; Random variable; Computer science; Mathematics; Probability distribution; Statistics; Demography; Population","score_opus":0.022625265294669513,"score_gpt":0.29601620654602384,"score_spread":0.2733909412513543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070102492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22131953,0.0023058131,0.74887794,0.0036386612,0.00042532795,0.00013318678,0.00052708836,0.00032540347,0.022447113],"genre_scores_gemma":[0.9255586,0.0027706285,0.03150131,0.0006932555,0.0011736951,0.00021673896,0.00037431676,0.00016222661,0.037549164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857926,0.0004868285,0.000066163004,0.0003565134,0.00030165864,0.00020961168],"domain_scores_gemma":[0.97996485,0.012971124,0.003634043,0.0010230639,0.0011607276,0.0012461873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030612054,0.0012612172,0.0019014593,0.0037089493,0.0017226492,0.0042169453,0.0022015267,0.0021771768,0.009863999],"category_scores_gemma":[0.017206777,0.00096499344,0.001128604,0.003007132,0.0055523887,0.0055672135,0.0030231518,0.0037580174,0.0010757113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016297205,0.00001643101,0.00028323702,0.000019921343,0.000008307438,0.00009040556,0.000110494904,0.0044316077,0.00023013659,0.99208003,0.00049406174,0.0022191186],"study_design_scores_gemma":[0.000019182784,0.000019921406,0.00035100116,0.000011274728,0.000012614796,0.00017077939,0.00008583126,0.048939943,0.00017699576,0.94911665,0.001076262,0.000019504334],"about_ca_topic_score_codex":0.0017187292,"about_ca_topic_score_gemma":0.0015350553,"teacher_disagreement_score":0.009863999,"about_ca_system_score_codex":0.002108,"about_ca_system_score_gemma":0.0011471207,"threshold_uncertainty_score":0.032998383},"labels":[],"label_agreement":null},{"id":"W2079045924","doi":"10.1007/s11750-011-0184-x","title":"Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical physics; Computer science; Applied mathematics; Mathematics; Mathematical economics; Physics; Computer network","score_opus":0.04618520478188533,"score_gpt":0.2826010092351892,"score_spread":0.2364158044533039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079045924","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010733602,0.0017629719,0.0044162404,0.93466365,0.050515313,0.000046862,0.0006907391,0.0003226319,0.0065082293],"genre_scores_gemma":[0.0397908,0.0036750375,0.0067940652,0.75421375,0.1623158,0.00022852494,0.00039839567,0.00070667954,0.031876937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9911698,0.0018847252,0.0011513141,0.0014477498,0.0035977454,0.0007486069],"domain_scores_gemma":[0.9345827,0.04030546,0.0031246343,0.0024621633,0.018163292,0.0013617062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930109,0.0018243497,0.0020700023,0.0025692582,0.0041231127,0.003031166,0.006530402,0.022498071,0.029159943],"category_scores_gemma":[0.08991901,0.00097468065,0.002156639,0.00272445,0.005890189,0.008838984,0.0030738863,0.02022404,0.011241174],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008255531,0.0000235334,0.000256904,0.00015501103,0.000020831032,0.00037186913,0.0003336032,0.00055473985,0.0003128661,0.024214325,0.9695488,0.004125066],"study_design_scores_gemma":[0.00014547202,0.00006777411,0.0041582338,0.0007151461,0.00010079801,0.0007829178,0.0008879251,0.011197547,0.0016189128,0.16276406,0.81705993,0.000501297],"about_ca_topic_score_codex":0.036123313,"about_ca_topic_score_gemma":0.0134264175,"teacher_disagreement_score":0.036123313,"about_ca_system_score_codex":0.0063552093,"about_ca_system_score_gemma":0.0032722482,"threshold_uncertainty_score":0.09754968},"labels":[],"label_agreement":null},{"id":"W2082772228","doi":"10.1007/s11750-007-0009-0","title":"Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":698,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Scheme (mathematics); Computer science; Vehicle routing problem; Class (philosophy); Classification scheme; Routing (electronic design automation); Field (mathematics); Operations research; Mathematical optimization; Artificial intelligence; Data science; Computer network; Mathematics","score_opus":0.043283522705910266,"score_gpt":0.2781970216619149,"score_spread":0.23491349895600463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082772228","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026025837,0.27562743,0.6511909,0.003877621,0.0009138039,0.0003262002,0.00061166444,0.00032282845,0.041103825],"genre_scores_gemma":[0.1977803,0.5082449,0.25487694,0.0013711568,0.004898686,0.00045704353,0.0024752659,0.00028723496,0.029608488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998473,0.00022390242,0.0001421542,0.0004126121,0.0006025203,0.00014582802],"domain_scores_gemma":[0.9981939,0.0009195559,0.00023323968,0.00013767915,0.00041574275,0.000099850884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001720403,0.0017195564,0.002199367,0.004572636,0.00095483084,0.0030981943,0.0028647766,0.0020366856,0.0028117865],"category_scores_gemma":[0.0027479043,0.00083422614,0.0020162114,0.008736901,0.0012801357,0.0046634157,0.0014973376,0.002074168,0.0011623878],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098383614,0.0006001611,0.0058601857,0.0031592732,0.00018101091,0.00018891554,0.00020648373,0.058908153,0.0014956804,0.089128904,0.026341092,0.8138318],"study_design_scores_gemma":[0.00006195868,0.0007916961,0.00902904,0.0015903005,0.0003849045,0.0033223352,0.0010476258,0.5006545,0.0031663645,0.20250612,0.27724916,0.00019595544],"about_ca_topic_score_codex":0.0018272932,"about_ca_topic_score_gemma":0.0018411005,"teacher_disagreement_score":0.004572636,"about_ca_system_score_codex":0.0009122725,"about_ca_system_score_gemma":0.0012556423,"threshold_uncertainty_score":0.009406388},"labels":[],"label_agreement":null},{"id":"W2092214701","doi":"10.1007/bf02578926","title":"Performance analysis of a call center with interactive voice response units","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Center (category theory); Interactive voice response; Speech recognition; Telecommunications","score_opus":0.010601963183506742,"score_gpt":0.23429033216820486,"score_spread":0.22368836898469813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092214701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96179175,0.0002437619,0.031832505,0.00031763938,0.000049779926,0.0000468309,0.0001294632,0.0007048862,0.0048833727],"genre_scores_gemma":[0.99751663,0.000023260809,0.0017300859,0.000016108557,0.000015813075,0.0000071842755,0.000038186652,0.00002212128,0.0006305863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979194,0.0007001103,0.00005381861,0.00026228934,0.00044395446,0.00062050944],"domain_scores_gemma":[0.9935588,0.0041666226,0.00026765288,0.0002321387,0.00124284,0.0005320097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019354296,0.0009257262,0.0011749543,0.0008311567,0.001462312,0.0017798744,0.001319776,0.0012435877,0.0038395312],"category_scores_gemma":[0.00395999,0.0003714554,0.00042639274,0.0013770013,0.0010619451,0.0011054197,0.000782155,0.0009002622,0.0003919777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046259663,0.00048510585,0.0070406646,0.00009318745,0.00013632339,0.00030749178,0.00017711887,0.93606275,0.023862688,0.006003039,0.0019278079,0.019277792],"study_design_scores_gemma":[0.000023826018,0.00034731312,0.0017263873,0.0000014248747,0.00003997881,0.00002655329,0.000055898017,0.9941778,0.0032011918,0.00029915903,0.000084676154,0.000015747435],"about_ca_topic_score_codex":0.025252042,"about_ca_topic_score_gemma":0.0077896933,"teacher_disagreement_score":0.025252042,"about_ca_system_score_codex":0.0035779898,"about_ca_system_score_gemma":0.002090981,"threshold_uncertainty_score":0.05021012},"labels":[],"label_agreement":null},{"id":"W2626188202","doi":"10.1007/s11750-017-0451-6","title":"On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Integer programming; Artificial intelligence; Branching (polymer chemistry); Heuristic; Machine learning; Field (mathematics); Branch and bound; Variable (mathematics); Computational learning theory; Mathematical optimization; Theoretical computer science; Active learning (machine learning); Algorithm; Mathematics","score_opus":0.016824630452904037,"score_gpt":0.2971222359018433,"score_spread":0.2802976054489392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626188202","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075634895,0.5649549,0.3722674,0.008646648,0.0012943035,0.00008890792,0.0008131784,0.00091262336,0.043458607],"genre_scores_gemma":[0.10674843,0.6345876,0.22923413,0.0039404538,0.009996878,0.00026799348,0.0020699603,0.00077074044,0.012383837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971571,0.00070584274,0.00021839145,0.0006857795,0.0009692444,0.000263644],"domain_scores_gemma":[0.98844135,0.008725218,0.00030793448,0.001145113,0.0009977891,0.00038266784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041823415,0.0019745757,0.004471516,0.0043278984,0.0019474428,0.007631264,0.0036167696,0.0028601668,0.013658224],"category_scores_gemma":[0.014026551,0.0014905971,0.0018518948,0.014408626,0.0036417523,0.015404751,0.0042542536,0.006183392,0.0051511154],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012747319,0.00021795128,0.0029714464,0.002671805,0.0001072246,0.00007634316,0.00021393507,0.011750478,0.00036465353,0.3565806,0.03494106,0.5899771],"study_design_scores_gemma":[0.000048963597,0.00013096904,0.0013098859,0.0010006903,0.00011518022,0.000538503,0.0002087748,0.03665902,0.0006745448,0.7973435,0.1619077,0.00006224491],"about_ca_topic_score_codex":0.003547651,"about_ca_topic_score_gemma":0.0030280135,"teacher_disagreement_score":0.013658224,"about_ca_system_score_codex":0.0029396915,"about_ca_system_score_gemma":0.003384621,"threshold_uncertainty_score":0.04569131},"labels":[],"label_agreement":null},{"id":"W2626465488","doi":"10.1007/s11750-017-0452-5","title":"Rejoinder on: On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Mathematical economics; Mathematics; Chemistry","score_opus":0.062619957460186,"score_gpt":0.3566546196720717,"score_spread":0.2940346622118857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626465488","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007930438,0.25081933,0.67771024,0.009391351,0.001898302,0.000121429985,0.00035036477,0.0012943726,0.050484184],"genre_scores_gemma":[0.12717165,0.2045265,0.62425673,0.005273104,0.006893762,0.00033063398,0.0014631909,0.002277618,0.027806869],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973182,0.0007915945,0.00017634669,0.0006200815,0.000866097,0.00022770432],"domain_scores_gemma":[0.99172145,0.0057968805,0.0002446569,0.0011033342,0.0008292477,0.0003045301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003903744,0.0018182988,0.003399865,0.0028694062,0.001562083,0.0062079667,0.0044306046,0.0029277604,0.013187001],"category_scores_gemma":[0.014518056,0.0009297547,0.0015340158,0.008966528,0.0028501456,0.009970298,0.004167948,0.0063134367,0.004667537],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637111,0.00019571064,0.001183862,0.0015418207,0.00008992303,0.00005511251,0.000342102,0.026529338,0.00054911023,0.22223279,0.03786782,0.7092661],"study_design_scores_gemma":[0.00007453006,0.00019556053,0.00066399353,0.0014444124,0.00015648497,0.00039210852,0.00030228117,0.11252376,0.0018904434,0.57815033,0.3041348,0.000071329414],"about_ca_topic_score_codex":0.0031163977,"about_ca_topic_score_gemma":0.003264756,"teacher_disagreement_score":0.013187001,"about_ca_system_score_codex":0.002057299,"about_ca_system_score_gemma":0.0027768645,"threshold_uncertainty_score":0.044114888},"labels":[],"label_agreement":null},{"id":"W2750960109","doi":"10.1007/s11750-017-0459-y","title":"Rejoinder on: Continuous approximation models in freight distribution management","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Distribution (mathematics); Operations research; Mathematical optimization; Mathematics","score_opus":0.029326255314128854,"score_gpt":0.20870147299232875,"score_spread":0.1793752176781999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750960109","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031967787,0.015967801,0.06296111,0.84909064,0.05563945,0.000036474863,0.0004386827,0.00036523366,0.012303812],"genre_scores_gemma":[0.18544208,0.038084127,0.10775406,0.31977656,0.21709387,0.00046261118,0.0009789809,0.0021864537,0.12822108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948315,0.0021624686,0.0002978689,0.000989582,0.0014775697,0.00024105232],"domain_scores_gemma":[0.95160633,0.03256359,0.0009437524,0.0036977264,0.009792162,0.0013964626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007617583,0.0012434307,0.0029167996,0.0015983339,0.0022996957,0.0061649354,0.005454231,0.01635396,0.015034888],"category_scores_gemma":[0.042155728,0.0005982663,0.0012927584,0.0021179928,0.0052157817,0.015057854,0.0060024834,0.019780526,0.0058829146],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016624393,0.00009218842,0.00043528894,0.0002397143,0.000061646264,0.00013102141,0.00023071043,0.0069472664,0.00021115548,0.2112129,0.7497577,0.030514227],"study_design_scores_gemma":[0.000109081375,0.000052889653,0.00032411693,0.00045919523,0.000056283345,0.00014008142,0.00036218704,0.034128644,0.00060478365,0.6195812,0.3440452,0.0001363503],"about_ca_topic_score_codex":0.00706327,"about_ca_topic_score_gemma":0.005877148,"teacher_disagreement_score":0.01635396,"about_ca_system_score_codex":0.00258659,"about_ca_system_score_gemma":0.0027948872,"threshold_uncertainty_score":0.050296724},"labels":[],"label_agreement":null},{"id":"W2790139429","doi":"10.1007/s11750-018-0468-5","title":"Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review","year":2018,"lang":"en","type":"review","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Scheduling (production processes); Transport engineering; Operations research; Routing (electronic design automation); Operations management; Computer network; Engineering","score_opus":0.0571982485782732,"score_gpt":0.3558061633112891,"score_spread":0.2986079147330159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790139429","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029707013,0.6583299,0.0015092021,0.17552403,0.15398619,0.000083401355,0.0012427033,0.00016019176,0.008867312],"genre_scores_gemma":[0.0026454516,0.72067094,0.001475512,0.15750103,0.09268248,0.00009540265,0.00090353366,0.00011012712,0.023915635],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985777,0.00024685843,0.00023967242,0.00018828365,0.00063678715,0.00011078066],"domain_scores_gemma":[0.9877686,0.004444941,0.0013574966,0.00020050182,0.005648703,0.0005796334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029232441,0.00089296175,0.0015487766,0.0028510713,0.0006011085,0.0023155105,0.001704746,0.003604351,0.028646015],"category_scores_gemma":[0.015351425,0.0003409913,0.0012360981,0.0037012412,0.0008215068,0.00472926,0.0014391636,0.003883705,0.013167618],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049331982,0.000017705497,0.000084983636,0.0057526343,0.00003804152,0.000058575584,0.000035808924,0.00011675771,0.00019209196,0.0015867786,0.89454013,0.09752711],"study_design_scores_gemma":[0.000018597368,0.000032042542,0.0003619451,0.0035994228,0.00006270832,0.00011039102,0.0000542449,0.000044121574,0.00009262468,0.0016571963,0.99394727,0.000019389652],"about_ca_topic_score_codex":0.0021998032,"about_ca_topic_score_gemma":0.005721359,"teacher_disagreement_score":0.028646015,"about_ca_system_score_codex":0.0009934016,"about_ca_system_score_gemma":0.0039866073,"threshold_uncertainty_score":0.0958305},"labels":[],"label_agreement":null},{"id":"W2942743594","doi":"10.1007/s11750-019-00509-1","title":"A 2-class maintenance model with dynamic server behavior","year":2019,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polling system; Computer science; Queue; Polling; Bernoulli's principle; Function (biology); Mathematical optimization; Mathematics; Computer network; Engineering","score_opus":0.006847424993105401,"score_gpt":0.21478272409440638,"score_spread":0.20793529910130099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942743594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27302703,0.00061116606,0.7047926,0.002591537,0.0003243446,0.00023736416,0.0013863902,0.0014421821,0.015587406],"genre_scores_gemma":[0.95523953,0.00024297234,0.023170771,0.00021567091,0.00016434219,0.00014649553,0.00032728008,0.00013925078,0.020353772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980471,0.00040922104,0.00007714148,0.00059706037,0.0003256853,0.00054388796],"domain_scores_gemma":[0.99701715,0.0014041346,0.00037690898,0.0003359164,0.0005428253,0.00032316044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281015,0.0011668302,0.0017803708,0.0011417494,0.0011210698,0.0037165617,0.0047009774,0.0036372412,0.0074355025],"category_scores_gemma":[0.0044417074,0.0010395581,0.0012008043,0.0016074138,0.001334347,0.0043823617,0.0014353326,0.0022698552,0.001429714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038892258,0.0002959049,0.002292089,0.00009120134,0.00007671651,0.0005220871,0.00024944489,0.9100796,0.002494681,0.06562287,0.0033926913,0.014493704],"study_design_scores_gemma":[0.000019948116,0.000022585753,0.00019317615,0.0000034299544,0.000017095235,0.00003739234,0.000013967381,0.9938881,0.00011806482,0.00537313,0.0003027805,0.000010481776],"about_ca_topic_score_codex":0.018094718,"about_ca_topic_score_gemma":0.011507623,"teacher_disagreement_score":0.018094718,"about_ca_system_score_codex":0.003550582,"about_ca_system_score_gemma":0.0021900316,"threshold_uncertainty_score":0.035978794},"labels":[],"label_agreement":null},{"id":"W3004178692","doi":"10.1007/s11750-020-00539-0","title":"Sharing pollution permits under welfare upper bounds","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Upper and lower bounds; Production (economics); Welfare; Mathematical optimization; Mathematical economics; Shapley value; Computer science; Economics; Game theory; Microeconomics; Mathematics","score_opus":0.053221146046040065,"score_gpt":0.2280521492269449,"score_spread":0.17483100318090483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004178692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25918418,0.0010528124,0.60831237,0.006270741,0.00026791188,0.00017705234,0.00084766734,0.0005140005,0.12337334],"genre_scores_gemma":[0.9838209,0.00022465287,0.0066580707,0.00040042328,0.00011277796,0.00009558406,0.000065056476,0.000049837166,0.008572572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911163,0.0037060054,0.00035510937,0.0011344941,0.0013124584,0.0023756702],"domain_scores_gemma":[0.9677385,0.022976277,0.0024248457,0.0040252563,0.0015857548,0.0012493576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077339974,0.001162808,0.0038026965,0.0015246193,0.002141923,0.009520961,0.002856552,0.0037804942,0.0114152655],"category_scores_gemma":[0.03141908,0.0009722817,0.0014689561,0.0015894315,0.0050445767,0.008764224,0.0042357426,0.0045344136,0.0006487685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019268278,0.00009009037,0.00081876555,0.000112153495,0.000081778424,0.000097261465,0.00013099,0.064807184,0.0007712686,0.9174679,0.002464462,0.0129655255],"study_design_scores_gemma":[0.000033181474,0.000035359004,0.0003051402,0.000024876459,0.000028948463,0.000030399673,0.000099274264,0.07473691,0.00037852192,0.9228758,0.0014322624,0.000019403169],"about_ca_topic_score_codex":0.0042405017,"about_ca_topic_score_gemma":0.0030183655,"teacher_disagreement_score":0.0114152655,"about_ca_system_score_codex":0.0035663703,"about_ca_system_score_gemma":0.0024126468,"threshold_uncertainty_score":0.04090178},"labels":[],"label_agreement":null},{"id":"W3019304728","doi":"10.1007/s11750-020-00556-z","title":"Integrated cross-dock door assignment and truck scheduling with handling times","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; DOCK; Doors; Computer science; Scheduling (production processes); Metaheuristic; Job shop scheduling; Material handling; Operations research; Mathematical optimization; Engineering; Automotive engineering; Algorithm; Industrial engineering; Routing (electronic design automation); Computer network; Mathematics; Operating system; Marine engineering","score_opus":0.011780555120201514,"score_gpt":0.220412502604642,"score_spread":0.2086319474844405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019304728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07852993,0.00038875968,0.91245615,0.00018896702,0.000234752,0.00017201426,0.0002860818,0.00074008846,0.0070032123],"genre_scores_gemma":[0.7796156,0.00021442666,0.20976415,0.000071220085,0.00012196045,0.00016554807,0.00035880817,0.00023311848,0.00945527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845076,0.00048219587,0.00005130729,0.00028125726,0.0003548183,0.0003796048],"domain_scores_gemma":[0.9990897,0.0003250792,0.00014397074,0.00010871481,0.00018591332,0.00014658266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994108,0.0015771278,0.0020336253,0.0010320393,0.0006278732,0.0019962785,0.002382372,0.0012930514,0.006239272],"category_scores_gemma":[0.0034755147,0.0012291436,0.001373057,0.0025581939,0.0005072322,0.0021158454,0.0014905126,0.0020194743,0.0009789696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036708117,0.0002661582,0.00053734874,0.00005002538,0.000051065,0.000026212962,0.000018959556,0.9624676,0.0016648227,0.0020406512,0.000615687,0.03189442],"study_design_scores_gemma":[0.00001763223,0.00008543578,0.00025304203,0.0000025371473,0.000016307506,0.0000058342785,0.000006919384,0.99788874,0.0005280547,0.000910801,0.00027940766,0.0000052813875],"about_ca_topic_score_codex":0.010805811,"about_ca_topic_score_gemma":0.012651469,"teacher_disagreement_score":0.010805811,"about_ca_system_score_codex":0.0013065167,"about_ca_system_score_gemma":0.0038228724,"threshold_uncertainty_score":0.021485865},"labels":[],"label_agreement":null},{"id":"W3029444715","doi":"10.1007/s11750-020-00569-8","title":"Stability of utility functions and apportionment rules in location models","year":2020,"lang":"en","type":"article","venue":"Top","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Apportionment; Expected utility hypothesis; Utility theory; Process (computing); Stability (learning theory); Computer science; Operations research; Mathematical economics; Mathematical optimization; Economics; Mathematics; Machine learning","score_opus":0.06143634744202692,"score_gpt":0.2376720738271291,"score_spread":0.17623572638510218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029444715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26641038,0.0014886478,0.70815915,0.004173885,0.00009728481,0.00010336219,0.0007214182,0.00038317117,0.018462677],"genre_scores_gemma":[0.9757091,0.0007713963,0.014047616,0.00015778764,0.000078183286,0.000099750774,0.00031888878,0.00016627279,0.008651094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976044,0.0013560652,0.00010466235,0.0003722357,0.00022743801,0.00033522403],"domain_scores_gemma":[0.96821076,0.026330324,0.0020890574,0.0011404795,0.0012251264,0.0010041882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062159966,0.0011352564,0.003422748,0.0020836955,0.0018923158,0.006043771,0.0034866403,0.0030912624,0.0061491206],"category_scores_gemma":[0.04444147,0.0018833615,0.0023856813,0.002077834,0.0042735855,0.007659203,0.002749414,0.0042729243,0.00069242093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012669477,0.00006822005,0.0016384502,0.00006148596,0.00007448399,0.00011860152,0.0003278787,0.38489872,0.00027315327,0.6057586,0.0020960225,0.004557714],"study_design_scores_gemma":[0.000015887288,0.000014691603,0.00024821205,0.0000135363325,0.000014887155,0.000024093297,0.00005564916,0.7489365,0.00005670525,0.2503409,0.0002600243,0.000018969042],"about_ca_topic_score_codex":0.018836385,"about_ca_topic_score_gemma":0.008845942,"teacher_disagreement_score":0.018836385,"about_ca_system_score_codex":0.004050341,"about_ca_system_score_gemma":0.0016847654,"threshold_uncertainty_score":0.037453473},"labels":[],"label_agreement":null},{"id":"W3143150125","doi":"10.1007/s11750-021-00599-w","title":"Less is more: discrete starting solutions in the planar p-median problem","year":2021,"lang":"en","type":"article","venue":"Top","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"","keywords":"Planar; Fraction (chemistry); Context (archaeology); Mathematical optimization; Heuristic; Space (punctuation); Function (biology); Mathematics; Computer science; Quality (philosophy); Algorithm","score_opus":0.04703577719182994,"score_gpt":0.2531011366591965,"score_spread":0.20606535946736654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143150125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09964575,0.0016930092,0.85021067,0.0039278013,0.00031363865,0.00014852843,0.00063349924,0.00035902823,0.043068066],"genre_scores_gemma":[0.69296324,0.0016393977,0.2815666,0.00075461454,0.00027238866,0.0003165627,0.0009930949,0.0003563493,0.021137865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999268,0.00033828014,0.000022084714,0.00011662319,0.00012906427,0.00012605214],"domain_scores_gemma":[0.99589276,0.0031228783,0.00025912735,0.00017019143,0.00020093613,0.00035397476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016910882,0.0009930965,0.0019156692,0.0009043989,0.0012293871,0.0025466853,0.0019257427,0.0023381629,0.010315089],"category_scores_gemma":[0.011083898,0.00070485694,0.0012558115,0.0015168425,0.001475312,0.0027251719,0.0030549793,0.0030079929,0.0006829339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005200239,0.00018158609,0.0006203173,0.0003096918,0.00008558775,0.0001392156,0.00024680264,0.52483916,0.0007284303,0.4175697,0.014363664,0.040395793],"study_design_scores_gemma":[0.00012711175,0.000118102136,0.00016415367,0.00006048461,0.000025117184,0.000049551043,0.00017257826,0.5460486,0.00025228324,0.44949317,0.0034665188,0.000022404698],"about_ca_topic_score_codex":0.004134239,"about_ca_topic_score_gemma":0.003723909,"teacher_disagreement_score":0.010315089,"about_ca_system_score_codex":0.0012573901,"about_ca_system_score_gemma":0.0015340538,"threshold_uncertainty_score":0.034507394},"labels":[],"label_agreement":null},{"id":"W4210677236","doi":"10.1007/s11750-021-00621-1","title":"A robust optimization approach for the unrelated parallel machine scheduling problem","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Robust optimization; Scheduling (production processes); Optimization problem; Algorithm; Schedule; Mathematics","score_opus":0.022118782462847,"score_gpt":0.21242867411420843,"score_spread":0.19030989165136142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210677236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011713554,0.00017007707,0.99668914,0.00011277906,0.000046144105,0.00001560656,0.000024235414,0.00008823146,0.001682455],"genre_scores_gemma":[0.24147457,0.00091284,0.74536854,0.00033081407,0.00056809705,0.00025712425,0.00037681952,0.0005117048,0.010199455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895453,0.0003525802,0.00004163745,0.00021063688,0.00036040484,0.00008021398],"domain_scores_gemma":[0.9987105,0.0007530092,0.0001511228,0.00011580095,0.00020981225,0.00005977704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017960903,0.0013301255,0.0016433969,0.00094311405,0.00049875287,0.0011518487,0.0018350212,0.0014536884,0.004337894],"category_scores_gemma":[0.004998365,0.0007843202,0.0012291359,0.0010909494,0.0008657595,0.0013643892,0.0015702561,0.0019949803,0.0008964707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005010937,0.00004109262,0.000067772504,0.0000872543,0.000049694194,0.00005419107,0.000018968742,0.92301065,0.0018476131,0.04475623,0.0018509623,0.028165502],"study_design_scores_gemma":[0.0000046903656,0.000013611544,0.000019136207,0.000003381754,0.0000056860476,0.00000733057,0.0000016237195,0.9905979,0.00017326094,0.008618092,0.00055147003,0.0000037860486],"about_ca_topic_score_codex":0.0032119148,"about_ca_topic_score_gemma":0.0024107047,"teacher_disagreement_score":0.004337894,"about_ca_system_score_codex":0.00094886485,"about_ca_system_score_gemma":0.0013862989,"threshold_uncertainty_score":0.014511764},"labels":[],"label_agreement":null},{"id":"W4224271542","doi":"10.1007/s11750-022-00632-6","title":"Analysis of the selective traveling salesman problem with time-dependent profits","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Andalucía; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Solver; Profit (economics); Mathematical optimization; Computer science; Time horizon; Graph; Piecewise; Mathematics; Combinatorics; Operations research; Economics","score_opus":0.007919825672221409,"score_gpt":0.22200185495626706,"score_spread":0.21408202928404566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224271542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853734,0.0008537528,0.5953319,0.0008511838,0.000068400244,0.00020260003,0.0005517504,0.00024179374,0.016525155],"genre_scores_gemma":[0.92341566,0.0004576623,0.07181604,0.00006718888,0.000040559684,0.00012785372,0.00033187683,0.0000783319,0.003664867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952734,0.00015907275,0.000016938397,0.000070359194,0.00010077105,0.00012547214],"domain_scores_gemma":[0.99834573,0.0012161504,0.0001600852,0.000061600906,0.00012885749,0.00008749946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041028,0.0007171394,0.0005973951,0.00054248114,0.00039861831,0.0007971119,0.0011951239,0.00070615247,0.003889022],"category_scores_gemma":[0.0028469504,0.00037852835,0.00073372386,0.0008310984,0.00068945513,0.0011570421,0.00074199506,0.00069971185,0.00016413255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405774,0.000028614642,0.00048081024,0.000053844367,0.000025009549,0.00009825338,0.000024535859,0.98046726,0.0004808506,0.012261749,0.00055923086,0.005479326],"study_design_scores_gemma":[0.0000080685595,0.000024194429,0.0001748273,0.000004566068,0.000007856834,0.000030470615,0.000026757305,0.99297214,0.00021064683,0.0061503635,0.00038752233,0.0000025940585],"about_ca_topic_score_codex":0.006865553,"about_ca_topic_score_gemma":0.00485068,"teacher_disagreement_score":0.006865553,"about_ca_system_score_codex":0.0012385177,"about_ca_system_score_gemma":0.0013090526,"threshold_uncertainty_score":0.013651192},"labels":[],"label_agreement":null},{"id":"W4289890653","doi":"10.1007/s11750-022-00638-0","title":"The robust multi-plant capacitated lot-sizing problem","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Sizing; Mathematical optimization; Robust optimization; Computer science; Duality (order theory); Integer programming; Production (economics); Mathematics","score_opus":0.03978123903138762,"score_gpt":0.20592293030426959,"score_spread":0.16614169127288198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289890653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04680216,0.000765631,0.94091237,0.0008163128,0.000093431314,0.00009869481,0.00058582216,0.00039630773,0.009529235],"genre_scores_gemma":[0.88371015,0.00046755408,0.106105626,0.00016662484,0.00011699564,0.00014190971,0.0004466963,0.00017546937,0.008668836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931157,0.00025762615,0.000023762766,0.00017326759,0.00014009228,0.00009374035],"domain_scores_gemma":[0.9986211,0.0008906741,0.00018612656,0.00009282834,0.00010771934,0.00010156169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013475138,0.0012274536,0.0017272409,0.0006378389,0.00042398457,0.001746245,0.0016706858,0.00209321,0.004382657],"category_scores_gemma":[0.0036668535,0.0009261576,0.00079654396,0.0010689883,0.00093087513,0.0014487919,0.0010387157,0.0011820585,0.00043093713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077270386,0.0000213002,0.000101741694,0.000089954716,0.0000300667,0.00005160337,0.000010405101,0.9845828,0.00089565956,0.0056622736,0.00081999623,0.007657016],"study_design_scores_gemma":[0.000013548682,0.000033690925,0.00008304348,0.000005571796,0.0000073305705,0.00001616129,0.000005162878,0.9936579,0.000294447,0.0056171063,0.0002602935,0.000005802118],"about_ca_topic_score_codex":0.0042309044,"about_ca_topic_score_gemma":0.002915086,"teacher_disagreement_score":0.004382657,"about_ca_system_score_codex":0.0012877758,"about_ca_system_score_gemma":0.001604756,"threshold_uncertainty_score":0.014661491},"labels":[],"label_agreement":null},{"id":"W4400005792","doi":"10.1007/s11750-024-00678-8","title":"Gaining insight into crew rostering instances through ML-based sequential assignment","year":2024,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Crew; Operations research; Mathematical optimization; Mathematics; Aeronautics; Engineering","score_opus":0.20289949668711652,"score_gpt":0.4339951749443921,"score_spread":0.2310956782572756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400005792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050211057,0.00016837714,0.9400388,0.0003957369,0.000046050805,0.00010693765,0.00042621745,0.0009613931,0.007645507],"genre_scores_gemma":[0.4802414,0.00016257718,0.5138103,0.00020451206,0.00007359331,0.00015951325,0.00094265037,0.00040621453,0.0039992994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.00026446042,0.000027494038,0.0001635834,0.000204632,0.00012165764],"domain_scores_gemma":[0.99631244,0.0026272722,0.00027623895,0.00028555482,0.00036266886,0.00013580002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011889095,0.00086283014,0.00086604414,0.0010444805,0.0005874388,0.001454774,0.0014368363,0.00078657834,0.010182222],"category_scores_gemma":[0.0076855016,0.0006394095,0.0007890858,0.0012646448,0.0005623788,0.002255377,0.0013005103,0.0015219331,0.0008896387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020091691,0.00018036716,0.0011668297,0.00016966808,0.000029741814,0.000060214457,0.00011440129,0.88431156,0.0024369129,0.012168314,0.0033511901,0.0958099],"study_design_scores_gemma":[0.000008264925,0.000021992497,0.00012285115,0.000007809694,0.0000047663593,0.000008071167,0.000028801518,0.9920993,0.00043269634,0.006694677,0.0005682254,0.0000025864942],"about_ca_topic_score_codex":0.0067978282,"about_ca_topic_score_gemma":0.011617039,"teacher_disagreement_score":0.010182222,"about_ca_system_score_codex":0.0009859251,"about_ca_system_score_gemma":0.0018939927,"threshold_uncertainty_score":0.03406298},"labels":[],"label_agreement":null}]}