{"meta":{"query_hash":"6f8f446585a3","filters":{"venue":"4OR"},"cohort_total":26,"direct_labels_cover":0,"predictions_cover":26,"exported":26,"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/6f8f446585a3","api":"https://metacan.xera.ac/api/v1/cohort?venue=4OR"},"results":[{"id":"W1469087774","doi":"10.1007/s10288-015-0295-6","title":"A simple method to obtain the stochastic decomposition structure of the busy period in Geo/Geo/1/N vacation queue","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Correctness; Simple (philosophy); Computer science; Queue; Reliability (semiconductor); Period (music); Mathematics; Mathematical optimization; Applied mathematics; Algorithm; Computer network","score_opus":0.013834237448849592,"score_gpt":0.29374607956287,"score_spread":0.2799118421140204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1469087774","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.005840723,0.00010943331,0.991714,0.00009056305,0.00009581123,0.000068466274,0.00015271902,0.00017681284,0.0017514742],"genre_scores_gemma":[0.259244,0.00058363745,0.7243878,0.0002689982,0.00025983088,0.00045506732,0.0007069897,0.00020248063,0.013891216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997205,0.000049577986,0.000018917402,0.00006169632,0.00010196791,0.000047281665],"domain_scores_gemma":[0.99953115,0.00013645874,0.00004455389,0.00006293138,0.00017260351,0.000052233336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063139416,0.00062632194,0.00056034775,0.0011703126,0.00059815834,0.0007006948,0.00088754785,0.0005356628,0.0063084667],"category_scores_gemma":[0.001926312,0.000286211,0.0009097709,0.0010428146,0.00040459543,0.0009643845,0.000772518,0.0013681236,0.0011442504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000252808,0.00031990095,0.0046137595,0.00036721936,0.00017729978,0.0005441586,0.00047324988,0.19707629,0.059432793,0.43108085,0.016669644,0.28899208],"study_design_scores_gemma":[0.000035018715,0.00003544249,0.0016028106,0.000020257035,0.000034709832,0.00020218697,0.000039118397,0.92574227,0.0031462219,0.06404882,0.005046318,0.00004684199],"about_ca_topic_score_codex":0.0070053446,"about_ca_topic_score_gemma":0.009976555,"teacher_disagreement_score":0.0070053446,"about_ca_system_score_codex":0.00073905755,"about_ca_system_score_gemma":0.0016625688,"threshold_uncertainty_score":0.021103919},"labels":[],"label_agreement":null},{"id":"W1704392916","doi":"10.1007/s10288-003-0024-4","title":"Ten notes on equal-processing-time scheduling","year":2004,"lang":"en","type":"article","venue":"4OR","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"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":"Flow shop scheduling; Computer science; Scheduling (production processes); Time complexity; Parallel computing; Open shop; Job shop scheduling; Mathematical optimization; Distributed computing; Mathematics; Algorithm; Operating system; Schedule","score_opus":0.014533928400133062,"score_gpt":0.23617012641333024,"score_spread":0.22163619801319717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704392916","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.0063537094,0.03960274,0.66561365,0.061877415,0.023315927,0.00009038533,0.0005223018,0.000362848,0.20226106],"genre_scores_gemma":[0.30710456,0.070633195,0.33248934,0.024315266,0.047544513,0.00047092338,0.0009973965,0.0009534549,0.21549131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970995,0.00096196076,0.0001872084,0.0004649015,0.0010419732,0.00024445003],"domain_scores_gemma":[0.99010825,0.0067827255,0.00026216032,0.0015604026,0.000979107,0.00030746698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062724636,0.0016505568,0.0010348797,0.0016396921,0.0017779836,0.0038640078,0.0027292648,0.0025201964,0.021116272],"category_scores_gemma":[0.017726334,0.0005843641,0.000819784,0.004367762,0.0068909656,0.011460955,0.0031228245,0.010262988,0.0028703583],"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.00011151577,0.00003378578,0.000095365394,0.000108495406,0.000014191411,0.00003568905,0.000074057614,0.006984445,0.0001924183,0.90266573,0.027498372,0.062185947],"study_design_scores_gemma":[0.000018348606,0.000025511767,0.00008356119,0.00009956628,0.000010234953,0.00003554417,0.000047279795,0.013970879,0.00048469417,0.9082602,0.076943725,0.00002040612],"about_ca_topic_score_codex":0.003171748,"about_ca_topic_score_gemma":0.0027104304,"teacher_disagreement_score":0.021116272,"about_ca_system_score_codex":0.0036879529,"about_ca_system_score_gemma":0.0017939559,"threshold_uncertainty_score":0.07064104},"labels":[],"label_agreement":null},{"id":"W1966106967","doi":"10.1007/s10288-004-0056-4","title":"Solving the frequency assignment problem with polarization by local search and tabu","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":15,"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":"Tabu search; Mathematical optimization; Computer science; Algorithm; Polarization (electrochemistry); Guided Local Search; Frequency assignment; Mathematics; Telecommunications","score_opus":0.013188829925546852,"score_gpt":0.24808178778448514,"score_spread":0.2348929578589383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966106967","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.062304676,0.0003797431,0.9252407,0.0005659699,0.00008506467,0.00009441319,0.00013456446,0.0007639644,0.010430838],"genre_scores_gemma":[0.44390354,0.00021103972,0.5497869,0.0003054156,0.00009946006,0.00033954938,0.00032188417,0.00032561427,0.004706511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.00040252125,0.000019369687,0.00007875329,0.00012998508,0.00012080187],"domain_scores_gemma":[0.99793184,0.0015848136,0.0001098327,0.00016177374,0.00014743186,0.00006440342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091079,0.0008395431,0.0014100086,0.0013101832,0.0010170257,0.0011629742,0.0017061749,0.0019326076,0.0077746343],"category_scores_gemma":[0.0050207307,0.0007227128,0.0009239114,0.0015325908,0.0010228719,0.0019425886,0.001346851,0.0018957397,0.0011673516],"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.0002267556,0.00021307671,0.0005630402,0.00011170359,0.00006293984,0.00004859803,0.00009778762,0.86129886,0.0013347691,0.016664244,0.0041901316,0.115188114],"study_design_scores_gemma":[0.000074677606,0.000041709918,0.00008307271,0.000010302429,0.00001251621,0.000017126764,0.000040962903,0.98232496,0.00038513064,0.016484201,0.00051833177,0.000007059651],"about_ca_topic_score_codex":0.0030493292,"about_ca_topic_score_gemma":0.0030855543,"teacher_disagreement_score":0.0077746343,"about_ca_system_score_codex":0.0007841185,"about_ca_system_score_gemma":0.0013527606,"threshold_uncertainty_score":0.026008725},"labels":[],"label_agreement":null},{"id":"W1975320652","doi":"10.1007/s10288-005-0071-0","title":"Bilevel programming: A survey","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":453,"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; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Simple (philosophy); Mathematical optimization; Computer science; Nonlinear programming; Quadratic programming; Quadratic equation; Linear programming; Nonlinear system; Mathematics; Optimization problem; Artificial intelligence; Epistemology","score_opus":0.03416886300847194,"score_gpt":0.2682684370357858,"score_spread":0.23409957402731385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975320652","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.0037588575,0.42037314,0.5446454,0.0035847041,0.0005874702,0.00007505934,0.0003462503,0.0004048547,0.026224203],"genre_scores_gemma":[0.067457005,0.61249566,0.30126408,0.0016693403,0.0034517008,0.00024786562,0.0012187551,0.00062499393,0.011570564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982687,0.00049266824,0.00016539669,0.0004616823,0.0005173842,0.000094057024],"domain_scores_gemma":[0.99683136,0.0021726177,0.00011333104,0.00031566375,0.00046355915,0.00010348396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026091014,0.0017523109,0.0032907266,0.002194519,0.0008091701,0.0049182544,0.0023396183,0.002221325,0.00521886],"category_scores_gemma":[0.005621284,0.0016485763,0.0015571119,0.007537689,0.0014700274,0.0053350916,0.003097742,0.0045090434,0.002653187],"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.00009892738,0.00038498087,0.0014434939,0.003838329,0.00020246033,0.00008111071,0.00016549818,0.024264641,0.00057565735,0.1926196,0.02262275,0.7537026],"study_design_scores_gemma":[0.000068506735,0.00026509524,0.0015008274,0.0017225196,0.00017091399,0.00080681226,0.00033046628,0.16874075,0.0016806666,0.54010755,0.28449243,0.00011351014],"about_ca_topic_score_codex":0.0015083065,"about_ca_topic_score_gemma":0.0014825475,"teacher_disagreement_score":0.00521886,"about_ca_system_score_codex":0.0009416775,"about_ca_system_score_gemma":0.0017218221,"threshold_uncertainty_score":0.017458856},"labels":[],"label_agreement":null},{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"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":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","score_opus":0.015478581835785621,"score_gpt":0.3128095133241821,"score_spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976996892","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.00074130786,0.00015778313,0.99627495,0.000091497444,0.00008761384,0.000017038026,0.0000491024,0.00021056086,0.0023702472],"genre_scores_gemma":[0.06753274,0.00052115327,0.919757,0.00021115172,0.00022949437,0.00020487518,0.00027988164,0.0010370031,0.010226667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990816,0.0003203213,0.000038368107,0.00011562985,0.0003947131,0.000049330643],"domain_scores_gemma":[0.9987166,0.00051528984,0.00009436253,0.00026490103,0.00034988052,0.00005896896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202689,0.0013184401,0.0012505673,0.0009926845,0.0006606782,0.0012058618,0.0016454065,0.001709621,0.008823407],"category_scores_gemma":[0.005107614,0.00079048413,0.0011572719,0.0010619558,0.0010991467,0.0015421015,0.0021227673,0.003766106,0.0027108958],"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.00019100032,0.0000819739,0.00026020536,0.0004140666,0.000117108815,0.00013130659,0.00016921731,0.53865623,0.009509152,0.21344368,0.014160851,0.22286509],"study_design_scores_gemma":[0.000014414108,0.000032186817,0.000048533206,0.000024099685,0.000015364765,0.000028692324,0.00000976601,0.97118795,0.0013413382,0.020123603,0.0071594,0.000014596777],"about_ca_topic_score_codex":0.0024985431,"about_ca_topic_score_gemma":0.0031376698,"teacher_disagreement_score":0.008823407,"about_ca_system_score_codex":0.00054111134,"about_ca_system_score_gemma":0.0011750337,"threshold_uncertainty_score":0.029517174},"labels":[],"label_agreement":null},{"id":"W1978730351","doi":"10.1007/s10288-011-0169-5","title":"Locating a general minisum ‘circle’ on the plane","year":2011,"lang":"en","type":"article","venue":"4OR","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit circle; Norm (philosophy); Mathematics; Combinatorics; Regular polygon; Euclidean geometry; Convex body; Euclidean distance; Scaling; Boundary (topology); Unit sphere; Plane (geometry); Great circle; Geometry; Mathematical analysis; Convex hull","score_opus":0.05103679673092494,"score_gpt":0.23230245744426906,"score_spread":0.1812656607133441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978730351","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.14846046,0.000475994,0.7869186,0.0010474588,0.0005762461,0.0001620724,0.00026780803,0.0014173661,0.060674045],"genre_scores_gemma":[0.54919225,0.0002310922,0.42871553,0.00019033489,0.00008642271,0.00013469569,0.00027647542,0.0004965568,0.020676639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938285,0.0001238102,0.000031594023,0.00019731792,0.00017073315,0.00009372381],"domain_scores_gemma":[0.99927217,0.00019475514,0.00007181072,0.00022735485,0.00016020426,0.00007369533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046278,0.0006388114,0.0009837502,0.0012867888,0.0014981811,0.0017665253,0.0015682143,0.0023431377,0.012846611],"category_scores_gemma":[0.0033756725,0.00060501724,0.0005658102,0.0008296279,0.0013720086,0.0025376978,0.004334347,0.0011573419,0.0050389506],"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.0014316005,0.00010905044,0.0026382403,0.000607801,0.000064782755,0.0013967922,0.001898777,0.059163008,0.06448752,0.61458284,0.020146724,0.23347296],"study_design_scores_gemma":[0.00017134141,0.00058871164,0.0015646087,0.00021599703,0.000072678224,0.0025757907,0.0013334383,0.45819932,0.09673941,0.2622383,0.17612092,0.00017954098],"about_ca_topic_score_codex":0.000586219,"about_ca_topic_score_gemma":0.0007088975,"teacher_disagreement_score":0.012846611,"about_ca_system_score_codex":0.0006553081,"about_ca_system_score_gemma":0.0006406546,"threshold_uncertainty_score":0.0429762},"labels":[],"label_agreement":null},{"id":"W1979173729","doi":"10.1007/s10288-009-0108-x","title":"Attraction probabilities in variable neighborhood search","year":2009,"lang":"en","type":"article","venue":"4OR","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Attraction; Variable (mathematics); Context (archaeology); Mathematical optimization; Operator (biology); Variable neighborhood search; Mathematics; Local search (optimization); Convergence (economics); Current (fluid); Global optimization; Computer science; Metaheuristic; Geography; Mathematical analysis; Physics; Economics","score_opus":0.023488047299865797,"score_gpt":0.28500180224200083,"score_spread":0.261513754942135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979173729","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.043839507,0.0013203816,0.9347435,0.0008229009,0.0001821938,0.00008181546,0.000084769614,0.000156058,0.01876878],"genre_scores_gemma":[0.77596915,0.0010185384,0.20163937,0.000294602,0.00028362445,0.00038695612,0.00016572121,0.00020371775,0.020038372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909496,0.00051403226,0.000026141655,0.00009303959,0.00020439635,0.00006756952],"domain_scores_gemma":[0.99348664,0.0055501712,0.00028979033,0.00019792649,0.00032584084,0.00014964318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027567584,0.0003872931,0.0010512092,0.0015213034,0.0010095518,0.0013671226,0.0016591713,0.0017475904,0.006582774],"category_scores_gemma":[0.01889062,0.0006874386,0.00061168475,0.0012995023,0.001840179,0.003145163,0.0016453008,0.0015266925,0.0004658956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000703271,0.000032804222,0.00069439295,0.00010275953,0.000024857729,0.000047559563,0.00008968445,0.4763483,0.00026042244,0.4958504,0.0018542114,0.02462409],"study_design_scores_gemma":[0.00001207222,0.0000130733015,0.00016395726,0.000019085195,0.0000068035174,0.00001653246,0.000010767608,0.895899,0.000121337696,0.102878,0.00085144275,0.000007904255],"about_ca_topic_score_codex":0.0034436109,"about_ca_topic_score_gemma":0.0026791797,"teacher_disagreement_score":0.006582774,"about_ca_system_score_codex":0.001246708,"about_ca_system_score_gemma":0.0007802232,"threshold_uncertainty_score":0.022021532},"labels":[],"label_agreement":null},{"id":"W2010203453","doi":"10.1007/s10288-014-0260-9","title":"Approximating the length of Chinese postman tours","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Unit square; Combinatorics; Square (algebra); Simple (philosophy); Mathematics; Function (biology); Planar; Unit (ring theory); Arc length; Computer science; Discrete mathematics; Geometry; Arc (geometry)","score_opus":0.007203520721262863,"score_gpt":0.23812299029064365,"score_spread":0.23091946956938078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010203453","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.17260563,0.00089271757,0.80984324,0.00074896775,0.00021933223,0.00010227627,0.0007267501,0.00037574008,0.014485317],"genre_scores_gemma":[0.74886805,0.00079258974,0.2263874,0.00017487201,0.00013071464,0.00024523167,0.0011325608,0.00042611323,0.02184254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955887,0.0001399504,0.000014966215,0.000098753284,0.00009316912,0.000094179115],"domain_scores_gemma":[0.9972289,0.001876646,0.0002156972,0.00016075211,0.00035364708,0.00016431896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014897444,0.0010755812,0.0007489599,0.0016867002,0.00065876206,0.0012033341,0.0019384099,0.0012958365,0.0068016597],"category_scores_gemma":[0.0074257366,0.0007496411,0.0007781205,0.0015396754,0.0010039413,0.0018145597,0.0013499935,0.0014556464,0.00049818226],"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.0001494232,0.000031479605,0.0014745313,0.00009273643,0.000023558434,0.000046080066,0.00008334852,0.93596154,0.00068645255,0.03794826,0.0027434402,0.020759009],"study_design_scores_gemma":[0.0000038793482,0.000011454047,0.00016514267,0.000008283531,0.0000031599034,0.0000066430616,0.000014799418,0.99284405,0.00017471811,0.006318259,0.0004461762,0.0000034030902],"about_ca_topic_score_codex":0.019442324,"about_ca_topic_score_gemma":0.023456195,"teacher_disagreement_score":0.019442324,"about_ca_system_score_codex":0.0033470115,"about_ca_system_score_gemma":0.0023326387,"threshold_uncertainty_score":0.03865832},"labels":[],"label_agreement":null},{"id":"W2017383000","doi":"10.1007/s10288-002-0009-8","title":"The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":334,"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":"Set (abstract data type); Computer science; Plan (archaeology); Destinations; Operations research; Algorithm; Mathematical optimization; Engineering; Mathematics; Geography; Programming language","score_opus":0.012774431787790521,"score_gpt":0.2283156917083634,"score_spread":0.21554125992057288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017383000","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.018679872,0.003876516,0.9613453,0.0042107026,0.00036939388,0.00013384072,0.00085484766,0.00017895033,0.010350545],"genre_scores_gemma":[0.54643947,0.007971244,0.41416177,0.0008860312,0.0014270175,0.0005570328,0.0019941113,0.0003070986,0.026256256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966492,0.0016791697,0.00015537262,0.00090988824,0.0002997157,0.00030652608],"domain_scores_gemma":[0.9929765,0.0051940214,0.00061769504,0.0004723416,0.00038930148,0.00035012414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047966396,0.0016511707,0.003860016,0.0012940236,0.0014829604,0.0057351827,0.005864343,0.006763476,0.0076272534],"category_scores_gemma":[0.016603429,0.0016330307,0.00213064,0.0045678676,0.003070304,0.011790108,0.0043856874,0.0041540833,0.00082789967],"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.0000893316,0.00013584341,0.00097113976,0.0003679986,0.00009699129,0.00015655429,0.00013513377,0.4745326,0.00015581,0.4711137,0.0149201555,0.03732466],"study_design_scores_gemma":[0.00002682704,0.000033608267,0.00019001598,0.000050310824,0.000028947004,0.00013189578,0.00011332401,0.64218813,0.00010710929,0.35168704,0.005411539,0.00003120672],"about_ca_topic_score_codex":0.009737788,"about_ca_topic_score_gemma":0.006790852,"teacher_disagreement_score":0.009737788,"about_ca_system_score_codex":0.0020879922,"about_ca_system_score_gemma":0.0020587887,"threshold_uncertainty_score":0.025515676},"labels":[],"label_agreement":null},{"id":"W2022150528","doi":"10.1007/s10288-004-0057-3","title":"Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Bounding overwatch; Mathematical optimization; CONTEST; Polarization (electrochemistry); Frequency assignment; Computer science; Assignment problem; Mathematics; Algorithm; Artificial intelligence","score_opus":0.01363488760412227,"score_gpt":0.24705524196518353,"score_spread":0.23342035436106126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022150528","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.009944898,0.0006624335,0.97183627,0.00067710807,0.000116587406,0.00018976576,0.00039784695,0.0009853152,0.015189827],"genre_scores_gemma":[0.108384,0.0004986978,0.88096255,0.0003554459,0.00013074963,0.0008070896,0.0009623577,0.00081887434,0.0070802174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704677,0.0015600999,0.000083696876,0.00018532801,0.0007235632,0.0004005678],"domain_scores_gemma":[0.9909615,0.007240686,0.00032128402,0.0006369996,0.00069248467,0.0001469741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003606599,0.0015554583,0.0019156457,0.0027241586,0.0016605826,0.0027437052,0.0029246872,0.0026758295,0.019147629],"category_scores_gemma":[0.01773713,0.0011141256,0.0017454321,0.0045075607,0.0015627183,0.0027678353,0.0020273535,0.004604132,0.0030211965],"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.00021063608,0.00029376434,0.00034717078,0.00025771224,0.000055043216,0.000051490762,0.00019332134,0.66525626,0.0011241218,0.12026702,0.015445638,0.19649789],"study_design_scores_gemma":[0.000048962836,0.00003182131,0.00012131381,0.000048949623,0.0000135533,0.00001897506,0.000034893717,0.94588304,0.00051091245,0.050836917,0.0024352488,0.000015482105],"about_ca_topic_score_codex":0.009088437,"about_ca_topic_score_gemma":0.011636366,"teacher_disagreement_score":0.019147629,"about_ca_system_score_codex":0.0021299648,"about_ca_system_score_gemma":0.0032983173,"threshold_uncertainty_score":0.064055204},"labels":[],"label_agreement":null},{"id":"W2029358090","doi":"10.1007/s10288-008-0088-2","title":"Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Markov chain; Discrete time and continuous time; Queue; Computer science; Epoch (astronomy); Queueing theory; Renewal theory; Applied mathematics; Markov process; Bulk queue; Mathematics; Mathematical optimization; Statistics; Computer network","score_opus":0.00906742964980874,"score_gpt":0.2118071467518994,"score_spread":0.20273971710209066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029358090","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.19527735,0.002409662,0.7855613,0.0018881062,0.00032905547,0.000111850575,0.00033994985,0.00047210619,0.013610619],"genre_scores_gemma":[0.97525966,0.0006196227,0.016992364,0.00020441935,0.00016681214,0.000043898228,0.00015192605,0.0000878279,0.006473514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990526,0.0002101986,0.00003133439,0.00015201498,0.0002589887,0.00029484474],"domain_scores_gemma":[0.9967417,0.0017701025,0.00031990712,0.00010844836,0.0007609396,0.0002989522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025444466,0.001041129,0.0012167756,0.0016869763,0.0010845647,0.002281411,0.0027012497,0.0009556996,0.0034861001],"category_scores_gemma":[0.006507974,0.00065071357,0.0010956278,0.0009950598,0.0018039992,0.0023170433,0.0014250741,0.0014349452,0.00027732304],"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.00027585906,0.00013944332,0.0027525898,0.00024049911,0.00010382776,0.0005297259,0.00028539964,0.6357976,0.0072458317,0.33963355,0.003797299,0.009198408],"study_design_scores_gemma":[0.0000048662064,0.000011109703,0.00016502931,0.0000046298405,0.000009292204,0.000021745169,0.00001735734,0.992137,0.00018769043,0.0073310663,0.000103842154,0.0000062400613],"about_ca_topic_score_codex":0.017448027,"about_ca_topic_score_gemma":0.008590983,"teacher_disagreement_score":0.017448027,"about_ca_system_score_codex":0.004649709,"about_ca_system_score_gemma":0.0034348592,"threshold_uncertainty_score":0.034692943},"labels":[],"label_agreement":null},{"id":"W2043306426","doi":"10.1007/s10288-002-0008-9","title":"Chemical trees enumeration algorithms","year":2003,"lang":"en","type":"article","venue":"4OR","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":17,"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; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Enumeration; Computer science; Algorithm; Data structure; Computational complexity theory; Theoretical computer science; Scheme (mathematics); Point (geometry); Mathematics; Discrete mathematics; Programming language","score_opus":0.02231578831565209,"score_gpt":0.2953709018991213,"score_spread":0.27305511358346923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043306426","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.012327979,0.0031716067,0.8351288,0.0031729573,0.0006864928,0.00040476816,0.002467,0.004000317,0.1386401],"genre_scores_gemma":[0.12657802,0.00340194,0.7861274,0.0014724791,0.00043185405,0.0006237315,0.0070082895,0.0012507103,0.07310559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.00028215596,0.00005498357,0.00022082646,0.0003518091,0.00011634329],"domain_scores_gemma":[0.99835134,0.0007476492,0.00008265263,0.00047974856,0.00026155714,0.00007713806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096258527,0.00091159693,0.0011114787,0.002328952,0.0017110548,0.0027422612,0.0023190668,0.001881155,0.047045384],"category_scores_gemma":[0.004646962,0.0007063194,0.0017241341,0.0035055284,0.0007793037,0.003816444,0.0023515911,0.0033530644,0.013634469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014069918,0.00025229785,0.00048971985,0.00037318654,0.000067085064,0.0000623687,0.000080209036,0.038036875,0.001559167,0.48361477,0.05688777,0.4184359],"study_design_scores_gemma":[0.00010170375,0.000056766297,0.00021532264,0.00013158594,0.000060787504,0.00017013843,0.00005548215,0.21803473,0.0042699883,0.67715144,0.099728875,0.000023204822],"about_ca_topic_score_codex":0.0015369992,"about_ca_topic_score_gemma":0.003497258,"teacher_disagreement_score":0.047045384,"about_ca_system_score_codex":0.0014354193,"about_ca_system_score_gemma":0.0023197157,"threshold_uncertainty_score":0.15738249},"labels":[],"label_agreement":null},{"id":"W2065109168","doi":"10.1007/s10288-006-0009-1","title":"An exact algorithm for team orienteering problems","year":2006,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":219,"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":"Orienteering; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Operations research; Work (physics); Artificial intelligence; Mathematics; Engineering; Computer network","score_opus":0.010941555900898292,"score_gpt":0.2544370093960222,"score_spread":0.24349545349512391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065109168","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.0041669263,0.00010581077,0.9902148,0.000100421916,0.000073888885,0.000049378014,0.000049270107,0.00035239154,0.00488707],"genre_scores_gemma":[0.11392288,0.00018855296,0.87799424,0.0001391053,0.00006869551,0.00030712297,0.00019148973,0.00020308651,0.006984822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00012245344,0.000025200483,0.00010096096,0.00019092832,0.00009006378],"domain_scores_gemma":[0.99933463,0.00034641038,0.000042046173,0.00010605001,0.00012554848,0.00004528361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009539129,0.00094104564,0.001118109,0.0008362254,0.0007414589,0.0009945784,0.0017571569,0.0017047274,0.009491019],"category_scores_gemma":[0.0031275856,0.0006103619,0.0008199707,0.0011135478,0.00069653994,0.0015217997,0.0019308295,0.0013560486,0.0014685876],"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.00011816024,0.000097199845,0.00030581866,0.00011247779,0.000037602797,0.00005777985,0.0000785982,0.73276126,0.0013411565,0.0380314,0.005523747,0.22153479],"study_design_scores_gemma":[0.000039505318,0.000025885152,0.000058269266,0.0000092549235,0.00000829496,0.000017350369,0.0000123967575,0.981361,0.00025402472,0.016420508,0.0017877499,0.0000057185166],"about_ca_topic_score_codex":0.0071793627,"about_ca_topic_score_gemma":0.008318025,"teacher_disagreement_score":0.009491019,"about_ca_system_score_codex":0.0010734955,"about_ca_system_score_gemma":0.0018694878,"threshold_uncertainty_score":0.03175062},"labels":[],"label_agreement":null},{"id":"W2069736946","doi":"10.1007/s10288-013-0238-z","title":"A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration","year":2013,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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":"TRIPS architecture; Vehicle routing problem; Duration (music); Column generation; Computer science; Set (abstract data type); Routing (electronic design automation); Mathematical optimization; Time complexity; Variable (mathematics); Algorithm; Mathematics; Parallel computing; Computer network","score_opus":0.011790345112066511,"score_gpt":0.22661559542183235,"score_spread":0.21482525030976585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069736946","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.0028851375,0.00016845275,0.99429435,0.00007139496,0.00010696262,0.000040636936,0.000040984294,0.00029873734,0.002093274],"genre_scores_gemma":[0.07213869,0.00023720988,0.92191464,0.0001266796,0.00009163186,0.00023855013,0.0001633234,0.00013255807,0.004956712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953055,0.00008664564,0.00002482491,0.000096520365,0.00019328471,0.00006826594],"domain_scores_gemma":[0.99942446,0.0002927074,0.000043381908,0.000062881954,0.00014180833,0.000034784054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081442326,0.0008267137,0.0011840425,0.0007597284,0.00052238884,0.0008895861,0.0018271236,0.0014426132,0.0059561427],"category_scores_gemma":[0.0023927414,0.00060527795,0.00072218536,0.0010855229,0.00044655858,0.0016464054,0.0011397284,0.0013139629,0.0010066278],"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.00012431356,0.00012237331,0.00031888526,0.0001414764,0.000051444076,0.00006927761,0.000055768785,0.7321978,0.0024405087,0.021592222,0.005126282,0.2377597],"study_design_scores_gemma":[0.00003256025,0.000022827431,0.000042271688,0.0000065716986,0.0000060742464,0.000020063939,0.0000062488434,0.99422234,0.00026842,0.0038744728,0.0014927171,0.000005389398],"about_ca_topic_score_codex":0.0070835585,"about_ca_topic_score_gemma":0.008469872,"teacher_disagreement_score":0.0070835585,"about_ca_system_score_codex":0.0008126027,"about_ca_system_score_gemma":0.002206006,"threshold_uncertainty_score":0.019925296},"labels":[],"label_agreement":null},{"id":"W2074959750","doi":"10.1007/s10288-004-0043-9","title":"Variations on the Roy-Gallai theorem","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Generalization; Mathematics; Chromatic scale; Simple (philosophy); Combinatorics; Graph; Extension (predicate logic); Elementary proof; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.032770678829612626,"score_gpt":0.2873123825077866,"score_spread":0.25454170367817397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074959750","genre_codex":"other","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.042078275,0.01491443,0.27386564,0.023471061,0.003923781,0.000082446546,0.0008159998,0.000777581,0.6400708],"genre_scores_gemma":[0.69081837,0.012000073,0.10802886,0.0070114452,0.006536813,0.00032904552,0.00060044666,0.0011308013,0.17354405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768186,0.00096779765,0.00008624924,0.00045870757,0.00061820314,0.00018718737],"domain_scores_gemma":[0.996738,0.0015640905,0.00025236266,0.00060254754,0.00052798825,0.00031492522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354128,0.0012486664,0.0015503375,0.0038006378,0.002262189,0.0035379601,0.0024666474,0.0021007333,0.018113527],"category_scores_gemma":[0.009663516,0.00051934744,0.0016651447,0.0026848912,0.0053122127,0.009250031,0.0053810296,0.0053820168,0.0038878212],"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.000007811961,0.0000044584235,0.000038397175,0.000023081795,0.000004817681,0.000018852848,0.000066558576,0.00022089561,0.00010470524,0.994736,0.0023045086,0.002469826],"study_design_scores_gemma":[0.0000059188674,0.0000055760115,0.00007588269,0.0000124607695,0.0000063043103,0.000043239295,0.000024595854,0.0011770709,0.00009268632,0.98791015,0.010636751,0.000009475785],"about_ca_topic_score_codex":0.0026429498,"about_ca_topic_score_gemma":0.0020553833,"teacher_disagreement_score":0.018113527,"about_ca_system_score_codex":0.0026922992,"about_ca_system_score_gemma":0.0008872578,"threshold_uncertainty_score":0.06059575},"labels":[],"label_agreement":null},{"id":"W2075014621","doi":"10.1007/s10288-012-0208-x","title":"Bicriteria optimization in the newsvendor problem with uniformly distributed demand","year":2012,"lang":"en","type":"article","venue":"4OR","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Newsvendor model; Mathematical optimization; Computer science; Key (lock); Simple (philosophy); Variable (mathematics); Profit (economics); Optimization problem; Mathematics; Economics","score_opus":0.01635557901820086,"score_gpt":0.20775028255169553,"score_spread":0.19139470353349466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075014621","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.14751452,0.003981116,0.80162567,0.0054306174,0.00035441192,0.00017563463,0.0009926552,0.0005087195,0.03941668],"genre_scores_gemma":[0.9262711,0.001510375,0.041524343,0.00042634452,0.00019155256,0.00021918319,0.0004937721,0.00019715738,0.029166112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.0010815283,0.00006779995,0.00026699982,0.00015211347,0.00021099983],"domain_scores_gemma":[0.99208003,0.0063564843,0.0005776354,0.0002654237,0.00041104763,0.00030938804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004134818,0.0014844941,0.003967805,0.0011203388,0.00064327964,0.0029988207,0.0017906978,0.002978558,0.007957247],"category_scores_gemma":[0.012736168,0.0015405377,0.0008819061,0.001397882,0.002414756,0.002941895,0.0016010901,0.002529904,0.000988151],"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.00047738376,0.00007831848,0.00034885132,0.00018056876,0.00010457628,0.00017192667,0.0000926786,0.8484869,0.00035795162,0.13673636,0.0047738487,0.008190637],"study_design_scores_gemma":[0.0000897941,0.000059533944,0.00014257118,0.00002634896,0.000018572644,0.000036706777,0.000048398033,0.92255235,0.00012788437,0.07601716,0.0008565415,0.000024082648],"about_ca_topic_score_codex":0.0044885846,"about_ca_topic_score_gemma":0.0027189662,"teacher_disagreement_score":0.007957247,"about_ca_system_score_codex":0.0020228107,"about_ca_system_score_gemma":0.0011691544,"threshold_uncertainty_score":0.026619673},"labels":[],"label_agreement":null},{"id":"W2083976288","doi":"10.1007/s10288-007-0060-6","title":"A linear programming approach to highly precise clock synchronization over a packet network","year":2007,"lang":"en","type":"article","venue":"4OR","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Clock synchronization; Computer science; Network packet; Synchronization (alternating current); Clock drift; Real-time computing; Computer network; Parallel computing","score_opus":0.010821818547927615,"score_gpt":0.24299557191756538,"score_spread":0.23217375336963778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083976288","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.0015068984,0.00006066063,0.9967713,0.000113602524,0.000020001024,0.000009932501,0.000015016979,0.000042928234,0.0014597389],"genre_scores_gemma":[0.39066106,0.0009511271,0.5831636,0.0003687623,0.00032733465,0.0003589155,0.00013928102,0.00022763906,0.023802131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999271,0.00029582775,0.000025467081,0.000115644485,0.00021187474,0.000080138976],"domain_scores_gemma":[0.99871397,0.0009885415,0.00007537868,0.0000450984,0.00013725493,0.000039710936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012709602,0.0007818517,0.0007425893,0.000461971,0.0004537113,0.00115197,0.0011861873,0.0008813415,0.003929578],"category_scores_gemma":[0.0030721626,0.0006553793,0.00063227216,0.0009597263,0.000817542,0.001277245,0.001273736,0.0020252706,0.0003734866],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026547234,0.00003290449,0.00008930525,0.00004503317,0.000020089532,0.000035244175,0.000048883558,0.87397563,0.0010713697,0.105442084,0.0011255036,0.018087381],"study_design_scores_gemma":[0.0000036367765,0.000011612065,0.000011091039,0.000002570505,0.0000038602975,0.000003277492,0.000004740958,0.9826592,0.00017484909,0.016681107,0.0004414276,0.0000025785482],"about_ca_topic_score_codex":0.0062650437,"about_ca_topic_score_gemma":0.004893366,"teacher_disagreement_score":0.0062650437,"about_ca_system_score_codex":0.0010195718,"about_ca_system_score_gemma":0.0014687106,"threshold_uncertainty_score":0.013145745},"labels":[],"label_agreement":null},{"id":"W2088243692","doi":"10.1007/s10288-008-0089-1","title":"Variable neighbourhood search: methods and applications","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"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":"Metaheuristic; Heuristics; Neighbourhood (mathematics); Mathematical optimization; Computer science; Variable neighborhood search; Tabu search; Variable (mathematics); Heuristic; Simulated annealing; Local search (optimization); Mathematics","score_opus":0.03730997085608331,"score_gpt":0.31946399162222655,"score_spread":0.28215402076614327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088243692","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.0026147913,0.0028258779,0.98958135,0.00020822274,0.00013438871,0.000023314158,0.000052569892,0.000105698615,0.0044538206],"genre_scores_gemma":[0.16395876,0.005924525,0.8004272,0.00020282723,0.00036923357,0.00039564222,0.00029560144,0.0002614584,0.02816475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.00032983965,0.000020715033,0.00008203197,0.00015216102,0.000029149542],"domain_scores_gemma":[0.99853563,0.0010362514,0.00008548537,0.00010496385,0.00020505389,0.00003259682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014756275,0.00069474994,0.001042906,0.0012021558,0.000482896,0.0010681236,0.0012245697,0.0016256805,0.004807254],"category_scores_gemma":[0.005246222,0.00045528464,0.0007011039,0.0018581703,0.0008759905,0.0013895035,0.0010064427,0.0012235652,0.0011351818],"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.000089001725,0.00007178227,0.00070544047,0.00042817128,0.00009937433,0.000059052007,0.00015453981,0.4518483,0.0011027266,0.24918802,0.008991936,0.2872617],"study_design_scores_gemma":[0.00002014391,0.000022677305,0.0001726921,0.000042665324,0.00001449791,0.0000292084,0.000018494015,0.91835225,0.00032886653,0.07247429,0.008510866,0.000013243395],"about_ca_topic_score_codex":0.0033492995,"about_ca_topic_score_gemma":0.003381332,"teacher_disagreement_score":0.004807254,"about_ca_system_score_codex":0.0005329819,"about_ca_system_score_gemma":0.0006317463,"threshold_uncertainty_score":0.01608187},"labels":[],"label_agreement":null},{"id":"W2142847239","doi":"10.1007/s10288-005-0065-y","title":"Sensitivity of trust-region algorithms to their parameters","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":52,"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":"Sensitivity (control systems); Trust region; Context (archaeology); Algorithm; Computer science; Basis (linear algebra); Mathematics; Engineering; Computer security","score_opus":0.07648040350217998,"score_gpt":0.3576830103733677,"score_spread":0.2812026068711877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142847239","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.038503315,0.0020508901,0.95191205,0.001168217,0.0001857475,0.00022185824,0.000282426,0.000621062,0.005054445],"genre_scores_gemma":[0.72694033,0.001759056,0.26502797,0.00042923496,0.00021063519,0.0005735082,0.00052078447,0.0007960585,0.0037424152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98006976,0.012552621,0.00080516475,0.0020505674,0.0035391862,0.0009826156],"domain_scores_gemma":[0.6236502,0.33663726,0.010368586,0.013719269,0.012834818,0.0027898352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027475994,0.002295046,0.0028086181,0.0027494493,0.0013914302,0.004559305,0.003027193,0.004749334,0.004005685],"category_scores_gemma":[0.3209106,0.0017395117,0.0014789568,0.0019442627,0.005080184,0.0084874295,0.0062475293,0.0056816386,0.0009846434],"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.000786257,0.00011670268,0.0017778765,0.0004396696,0.00017879407,0.00009371386,0.00027206374,0.8782306,0.0022115125,0.07477852,0.002750772,0.038363483],"study_design_scores_gemma":[0.00004810029,0.00013045582,0.00044144256,0.00008036767,0.00003746015,0.00010036958,0.00005530885,0.95975864,0.0024616653,0.03599607,0.00085598935,0.00003415629],"about_ca_topic_score_codex":0.0037054725,"about_ca_topic_score_gemma":0.0015839331,"teacher_disagreement_score":0.027475994,"about_ca_system_score_codex":0.0037058513,"about_ca_system_score_gemma":0.0029120871,"threshold_uncertainty_score":0.14530867},"labels":[],"label_agreement":null},{"id":"W2159913713","doi":"10.1007/s10288-010-0145-5","title":"A large neighbourhood search heuristic for the aircraft and passenger recovery problem","year":2010,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"HEC Montréal","keywords":"Iterated local search; Operations research; Schedule; Computer science; Heuristic; Context (archaeology); Neighbourhood (mathematics); Set (abstract data type); Vehicle routing problem; Randomness; Mathematical optimization; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence","score_opus":0.012263228661227093,"score_gpt":0.2616284954726309,"score_spread":0.2493652668114038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159913713","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.049703524,0.0010271366,0.934738,0.00048952707,0.00021645518,0.00015045752,0.0001313636,0.0004013027,0.013142139],"genre_scores_gemma":[0.5154577,0.0004468369,0.4680098,0.00025407766,0.00012338551,0.00040078026,0.0003125414,0.00021372338,0.014781244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951863,0.00025757292,0.000016189466,0.000060607206,0.000092767725,0.000054152282],"domain_scores_gemma":[0.9985488,0.0011282034,0.00008389558,0.000065369604,0.000098811586,0.00007487462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011348758,0.00053365546,0.0011470567,0.0011164364,0.00057837804,0.00071140827,0.0015398155,0.0018205158,0.0059087044],"category_scores_gemma":[0.003536076,0.0005133812,0.00077469676,0.00097315706,0.0008358104,0.0012895457,0.0011572543,0.0009446965,0.0005701643],"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.00015173531,0.00009568384,0.00020572846,0.00007204399,0.00003517844,0.00007430292,0.000051694806,0.9415246,0.0008170345,0.012531572,0.0020461287,0.042394217],"study_design_scores_gemma":[0.00004304429,0.000036455654,0.000060566803,0.000008737783,0.000007139982,0.000013678617,0.000009883751,0.9947001,0.00011627169,0.004339546,0.00065876567,0.0000058139717],"about_ca_topic_score_codex":0.0057026353,"about_ca_topic_score_gemma":0.0067827296,"teacher_disagreement_score":0.0059087044,"about_ca_system_score_codex":0.0010353058,"about_ca_system_score_gemma":0.0011165784,"threshold_uncertainty_score":0.01976657},"labels":[],"label_agreement":null},{"id":"W2179770505","doi":"10.1007/s10288-015-0301-z","title":"Shared mobility systems","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":110,"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é Laval; HEC Montréal","funders":"","keywords":"Popularity; Incentive; Dimensioning; Computer science; Operations research; Open research; Transport engineering; Engineering; World Wide Web; Political science","score_opus":0.041769099620281656,"score_gpt":0.24007361989549858,"score_spread":0.19830452027521692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179770505","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.07403068,0.0014618626,0.67523825,0.002835022,0.001590774,0.00062897266,0.0024829966,0.0065844366,0.23514707],"genre_scores_gemma":[0.81599444,0.00088449864,0.083074704,0.0005050422,0.00036805414,0.0005049637,0.0028945308,0.00035866516,0.095415145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762887,0.0004823212,0.00015915842,0.00056628225,0.0006202164,0.0005432744],"domain_scores_gemma":[0.99657464,0.00035980242,0.00020951254,0.0018306392,0.00064881274,0.0003766007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014425438,0.0010766545,0.0009043903,0.001237938,0.0026180334,0.004765798,0.0028351168,0.0017352526,0.03322919],"category_scores_gemma":[0.004165538,0.00049745146,0.0008294936,0.0017730489,0.0012593084,0.006934903,0.01173811,0.0016868213,0.0073431674],"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.00039312243,0.00023645608,0.0021818327,0.00025721957,0.00016474734,0.00049673487,0.00086077815,0.06340215,0.004792965,0.65598506,0.047646128,0.22358279],"study_design_scores_gemma":[0.00014531748,0.00036366057,0.0013971587,0.00016348684,0.00018782295,0.00064990704,0.0011469228,0.25635105,0.005921304,0.39851907,0.3350257,0.00012868104],"about_ca_topic_score_codex":0.0041625425,"about_ca_topic_score_gemma":0.0041169515,"teacher_disagreement_score":0.03322919,"about_ca_system_score_codex":0.0016548693,"about_ca_system_score_gemma":0.0035446873,"threshold_uncertainty_score":0.11116278},"labels":[],"label_agreement":null},{"id":"W2768981582","doi":"10.1007/s10288-017-0362-2","title":"The inventory replenishment planning and staggering problem: a bi-objective approach","year":2017,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Mathematical optimization; Pareto principle; Multi-objective optimization; Computer science; Decision maker; Population; Pareto optimal; Order (exchange); Space (punctuation); Operations research; Mathematics; Economics","score_opus":0.02579070386469375,"score_gpt":0.287191586310707,"score_spread":0.2614008824460133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768981582","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.014886259,0.0020949203,0.97007316,0.00075775245,0.00019548117,0.00023804046,0.00052302744,0.00020346686,0.011027868],"genre_scores_gemma":[0.34905076,0.0034400413,0.62477624,0.00057241635,0.00040359684,0.00096249185,0.00090907817,0.00031281332,0.019572554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703765,0.0013251669,0.00014024536,0.0002969904,0.00093130406,0.00026860466],"domain_scores_gemma":[0.9981762,0.0010401169,0.00018851442,0.00009996755,0.0003228608,0.00017239354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047970675,0.0030650264,0.003552308,0.003933615,0.0008950317,0.004244426,0.0036699488,0.0039032935,0.0068627866],"category_scores_gemma":[0.0052796556,0.0017765446,0.0020773613,0.0051194117,0.000969939,0.0035257465,0.002719023,0.002861651,0.0008810591],"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.00007428718,0.00018654096,0.00037477954,0.00028712963,0.00018037784,0.00009729106,0.000028875982,0.95497507,0.0005770908,0.013847312,0.0013813843,0.027989853],"study_design_scores_gemma":[0.0000083667055,0.00003745077,0.00009813547,0.000018309247,0.000022727194,0.000017604136,0.0000098655655,0.9954743,0.00010933864,0.0036928211,0.00050300354,0.0000082111255],"about_ca_topic_score_codex":0.0064506354,"about_ca_topic_score_gemma":0.0058035636,"teacher_disagreement_score":0.0068627866,"about_ca_system_score_codex":0.0015468053,"about_ca_system_score_gemma":0.002613167,"threshold_uncertainty_score":0.025369644},"labels":[],"label_agreement":null},{"id":"W2915617487","doi":"10.1007/s10288-019-00399-w","title":"A selective survey of game-theoretic models of closed-loop supply chains","year":2019,"lang":"en","type":"article","venue":"4OR","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Closed loop; Key (lock); Loop (graph theory); Function (biology); Mechanism (biology); Computer science; Business; Feedback loop; Process management; Industrial organization; Marketing; Engineering; Mathematics; Control engineering; Physics; Biology; Computer security","score_opus":0.013951605916420284,"score_gpt":0.21558814066027882,"score_spread":0.20163653474385854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915617487","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.04841242,0.077908084,0.73837173,0.011710232,0.00044393208,0.0001601137,0.0008045124,0.0003091936,0.121879876],"genre_scores_gemma":[0.83188725,0.08666725,0.06153047,0.0014547426,0.0012404767,0.00024940752,0.0007032378,0.0001365472,0.016130552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975465,0.0011806438,0.000121922974,0.00032509255,0.0005621104,0.0002637575],"domain_scores_gemma":[0.993378,0.0051829843,0.0003023594,0.00045169643,0.0004997764,0.00018528535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033863843,0.001477796,0.0017252318,0.0018820148,0.001280196,0.0061421394,0.0029851058,0.0033924489,0.0061281603],"category_scores_gemma":[0.009236961,0.0012570567,0.0019316293,0.004392368,0.0029963697,0.008571827,0.001710418,0.0031371478,0.00085087697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021462054,0.000056301007,0.0003321584,0.0002292845,0.000034398923,0.000044677385,0.00014190891,0.060953643,0.00014924878,0.9255032,0.0018763415,0.010657433],"study_design_scores_gemma":[0.000011113018,0.00004345557,0.00020607641,0.00016192843,0.00002085733,0.00007380299,0.00010059822,0.14184973,0.000094428506,0.8427121,0.014701077,0.000024786177],"about_ca_topic_score_codex":0.006253746,"about_ca_topic_score_gemma":0.004269629,"teacher_disagreement_score":0.006253746,"about_ca_system_score_codex":0.0041925516,"about_ca_system_score_gemma":0.0026439202,"threshold_uncertainty_score":0.03041917},"labels":[],"label_agreement":null},{"id":"W3175105319","doi":"10.1007/s10288-021-00486-x","title":"Measures of balance in combinatorial optimization","year":2021,"lang":"en","type":"article","venue":"4OR","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Balance (ability); Computer science; Measure (data warehouse); Balance problems; Risk analysis (engineering); Psychology; Data mining; Business","score_opus":0.016674304008264203,"score_gpt":0.22979742081215712,"score_spread":0.21312311680389293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175105319","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.11011715,0.0053381645,0.8235773,0.0027085312,0.00035076562,0.0001406887,0.00093058846,0.00040000968,0.05643678],"genre_scores_gemma":[0.86693496,0.0022487328,0.116825886,0.00042185138,0.0006114532,0.00042688308,0.0008672139,0.0002800788,0.01138294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946122,0.0026075193,0.00024141993,0.00054161507,0.0016558713,0.00034139043],"domain_scores_gemma":[0.98208606,0.012580593,0.001715645,0.0013045206,0.001476677,0.00083653425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008477011,0.0016305107,0.0017017891,0.00770422,0.0013294176,0.00470772,0.001618639,0.0016059116,0.0077322703],"category_scores_gemma":[0.039226048,0.00073018874,0.00084690744,0.0075173024,0.0038943843,0.011209645,0.0026509142,0.0025162485,0.00061813695],"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.00016298305,0.00007169991,0.0017245586,0.00014469148,0.00009391194,0.000029008836,0.00013777515,0.04427546,0.00072205125,0.9038051,0.0027941915,0.04603876],"study_design_scores_gemma":[0.00001741564,0.00008280566,0.001052262,0.000067641144,0.00002829011,0.000041200045,0.00009213532,0.10317641,0.00047360305,0.8917128,0.0032340644,0.00002133642],"about_ca_topic_score_codex":0.0012466849,"about_ca_topic_score_gemma":0.00094546005,"teacher_disagreement_score":0.008477011,"about_ca_system_score_codex":0.002894337,"about_ca_system_score_gemma":0.0008682118,"threshold_uncertainty_score":0.044831276},"labels":[],"label_agreement":null},{"id":"W4292074987","doi":"10.1007/s10288-022-00520-6","title":"A bilevel optimization model for the newsvendor problem with the focus theory of choice","year":2022,"lang":"en","type":"article","venue":"4OR","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Newsvendor model; Bilevel optimization; Focus (optics); Mathematical optimization; Economic order quantity; Minimax; Order (exchange); Perspective (graphical); Computer science; Upper and lower bounds; Optimization problem; Mathematical economics; Mathematics; Economics; Artificial intelligence","score_opus":0.03215700315270644,"score_gpt":0.21292385917679382,"score_spread":0.18076685602408737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292074987","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.03577723,0.0021329394,0.9191143,0.004749245,0.00017270935,0.00007505934,0.0005115419,0.00021190965,0.037254985],"genre_scores_gemma":[0.858548,0.0022577234,0.07883862,0.0004155241,0.00026069302,0.00026907967,0.0004363622,0.00012935897,0.058844704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907637,0.00045131485,0.000034846034,0.00018934885,0.0001141967,0.00013385777],"domain_scores_gemma":[0.9976246,0.0017436303,0.00018324637,0.000070982,0.00019570239,0.00018181375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019138695,0.0011146192,0.0026193983,0.00084270176,0.00073867664,0.003880049,0.0018340434,0.0041255844,0.010310295],"category_scores_gemma":[0.0065756836,0.0010381195,0.0011516601,0.001574739,0.0018613907,0.0039657946,0.002200312,0.0031384185,0.0010408562],"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.00011756048,0.00007631881,0.00030981304,0.00012769457,0.00007285309,0.00019670052,0.00015557531,0.45993364,0.00033730178,0.5262989,0.0035565882,0.008817121],"study_design_scores_gemma":[0.00005792776,0.000042727883,0.00009287239,0.00002211345,0.000023946212,0.00003501852,0.000051447583,0.79626924,0.0000660784,0.20109111,0.0022253161,0.00002215723],"about_ca_topic_score_codex":0.0061858124,"about_ca_topic_score_gemma":0.00385863,"teacher_disagreement_score":0.010310295,"about_ca_system_score_codex":0.00215068,"about_ca_system_score_gemma":0.0017132335,"threshold_uncertainty_score":0.03449136},"labels":[],"label_agreement":null},{"id":"W4389131017","doi":"10.1007/s10288-023-00556-2","title":"A survey of attended home delivery and service problems with a focus on applications","year":2023,"lang":"en","type":"article","venue":"4OR","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Work (physics); Coronavirus disease 2019 (COVID-19); Service (business); Service delivery framework; Focus (optics); Pandemic; Engineering; Business; Marketing; Medicine","score_opus":0.024031435490344904,"score_gpt":0.220609661804598,"score_spread":0.19657822631425312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389131017","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.9583839,0.014156898,0.0012470682,0.003853668,0.00011042654,0.00018901369,0.002889963,0.00007398473,0.019095037],"genre_scores_gemma":[0.9217177,0.040168058,0.0028134857,0.0025554064,0.00021871644,0.00019748928,0.0055496898,0.00009553574,0.026683796],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99773264,0.00052503345,0.00035812557,0.0002122354,0.00074180297,0.00043012956],"domain_scores_gemma":[0.99234045,0.003104576,0.0018784646,0.00016750222,0.0015747021,0.0009343059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011646914,0.0003113814,0.00037070716,0.005107145,0.0011692513,0.0012172022,0.0008372798,0.0011562548,0.009460732],"category_scores_gemma":[0.0071647866,0.00030366398,0.00069087686,0.007282697,0.0005992188,0.0015991392,0.0011506062,0.00094057457,0.0012242601],"study_design_candidate":"observational","study_design_consensus":"observational","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.00025775068,0.0009586432,0.76082027,0.0014980708,0.00008093583,0.0019552347,0.009954054,0.0004196832,0.001112732,0.0018669246,0.022930486,0.19814515],"study_design_scores_gemma":[0.000011301578,0.00054302,0.875877,0.00062579627,0.000070070746,0.0046987967,0.038604446,0.00046849347,0.00045859633,0.000348729,0.07825455,0.000039098184],"about_ca_topic_score_codex":0.011918082,"about_ca_topic_score_gemma":0.016609456,"teacher_disagreement_score":0.011918082,"about_ca_system_score_codex":0.0012033827,"about_ca_system_score_gemma":0.0021916546,"threshold_uncertainty_score":0.031649232},"labels":[],"label_agreement":null}]}