{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8349398,0.00003160191,0.16213153,0.0021374293,0.00011469883,0.00038329687,0.0000058676624,0.000033502314,0.00022229739],"genre_scores_gemma":[0.9970939,1.0561775e-7,0.0016164923,0.00095837296,0.00022718064,0.000016214764,0.000016131542,0.000014494156,0.000057066052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.0000792887,0.00021080486,0.00017619455,0.00019171838,0.00015468174],"domain_scores_gemma":[0.99924767,0.000081475075,0.00018271587,0.00032350025,0.00015404637,0.000010593192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917315,0.00010971197,0.00015315581,0.00012870065,0.00011385738,0.00006235989,0.0003103527,0.00004186526,0.00005066348],"category_scores_gemma":[0.00042665753,0.00006877026,0.00005579747,0.00079828483,0.000028394927,0.00029400157,0.00015284083,0.000117117816,0.000018430856],"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.000252269,0.00008874792,0.004419666,0.00009705276,0.00007181817,0.0000023009673,0.0023852957,0.8825068,0.026590476,0.06698136,0.00091954885,0.015684674],"study_design_scores_gemma":[0.0018684984,0.000049258622,0.05448481,0.00021543316,0.0005228656,0.000010024753,0.011427559,0.32853588,0.0037077777,0.58633554,0.012038958,0.0008034136],"about_ca_topic_score_codex":0.0005520174,"about_ca_topic_score_gemma":0.00073323946,"teacher_disagreement_score":0.55397093,"about_ca_system_score_codex":0.00006155248,"about_ca_system_score_gemma":0.000022659933,"threshold_uncertainty_score":0.280437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21941154,0.001099951,0.76263756,0.00085951516,0.00075033435,0.0001804795,0.000011819684,0.0027178798,0.012330959],"genre_scores_gemma":[0.78622776,0.000014792288,0.21305355,0.00020887704,0.00023880796,0.000007533219,0.000011322525,0.000045626966,0.0001917182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994501,0.0000039680085,0.000121861485,0.0001252369,0.00011941751,0.0001794381],"domain_scores_gemma":[0.9997391,0.000027626138,0.000015871463,0.00012461729,0.000028909819,0.00006387362],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006544985,0.00011445266,0.00010460245,0.00006835733,0.000053650496,0.000054265103,0.00008999245,0.00006798136,0.00008151209],"category_scores_gemma":[0.00006961979,0.00010551337,0.000033917593,0.00015752934,0.000014726024,0.000076084,0.00000929484,0.000120985234,0.00086840364],"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.000002499835,0.000015164279,0.00001654822,0.000016598775,0.000007993742,0.000003478355,0.00018079797,0.9850173,0.0009123525,0.00017985387,0.00000952778,0.013637912],"study_design_scores_gemma":[0.0007655117,0.000047823643,0.00011300135,0.00014648179,0.000014301115,0.0000056232434,0.000045442648,0.9696729,0.027834978,0.0006024198,0.00041873095,0.00033278164],"about_ca_topic_score_codex":0.000003174283,"about_ca_topic_score_gemma":4.079481e-7,"teacher_disagreement_score":0.5668162,"about_ca_system_score_codex":0.000045380668,"about_ca_system_score_gemma":0.000018846195,"threshold_uncertainty_score":0.9999095},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073553245,0.00071026507,0.9769704,0.013064726,0.000009881384,0.00027378032,8.397973e-7,0.000060716353,0.0015541121],"genre_scores_gemma":[0.9569238,0.0000734944,0.042269215,0.00021540072,0.00003068431,0.000032883392,0.000003483603,0.000007716551,0.0004433386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890715,0.00015437075,0.000110753994,0.00019743487,0.00038866606,0.00024161894],"domain_scores_gemma":[0.9991691,0.00010194579,0.00002653362,0.0005584569,0.00007429477,0.0000696397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004617253,0.00007075922,0.000060295057,0.000033397682,0.0002726435,0.00024309971,0.00081807544,0.000032772587,0.000014995918],"category_scores_gemma":[0.000007002729,0.00004517525,0.000009039345,0.00029198398,0.00012290465,0.0003773679,0.00035298875,0.00022526756,0.000019275882],"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.000011666866,0.00019399449,0.007861004,0.000028304128,0.000041344498,0.0000034812585,0.002979316,0.0118614845,0.010169721,0.09904737,0.004310733,0.8634916],"study_design_scores_gemma":[0.0003633615,0.00012123983,0.0033292659,0.00004412601,0.0000027573622,0.000015915572,0.000094689254,0.9861473,0.002306102,0.00051135087,0.0068969163,0.00016697838],"about_ca_topic_score_codex":0.00008358358,"about_ca_topic_score_gemma":0.000057842106,"teacher_disagreement_score":0.97428584,"about_ca_system_score_codex":0.00007104551,"about_ca_system_score_gemma":0.0000772876,"threshold_uncertainty_score":0.23442161},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070863805,0.00002182892,0.9946747,0.0030959093,0.00004864489,0.000041048108,0.0000018303754,0.000090481466,0.0013169576],"genre_scores_gemma":[0.52682996,0.0000040067252,0.4685086,0.00083324325,0.00007459611,0.000008535329,0.000014123031,0.0000032628984,0.0037236456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995583,0.000030065492,0.000084501065,0.00012550098,0.00011744373,0.00008413508],"domain_scores_gemma":[0.99967104,0.000031654905,0.000027994092,0.00015189637,0.00007717928,0.00004020739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020080605,0.00003765842,0.000047357957,0.00004855373,0.000046368797,0.000090224836,0.00023122416,0.000016101114,0.0000948573],"category_scores_gemma":[0.000048668728,0.00003157074,0.000026717538,0.00037435186,0.0000057623224,0.00018637917,0.000044441662,0.000023365932,0.00025857176],"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.000005034245,0.0003750113,0.025723645,0.0000052294167,0.0000694852,0.0000022917475,0.000654463,0.011805348,0.00004936471,0.18878251,0.010637271,0.76189035],"study_design_scores_gemma":[0.00018742529,0.00001616099,0.099027246,0.0000017754273,0.0000038703697,0.0000018792446,0.0000020499288,0.7515683,0.00009215343,0.00032426455,0.14865129,0.00012355026],"about_ca_topic_score_codex":0.000033269287,"about_ca_topic_score_gemma":0.000051970215,"teacher_disagreement_score":0.7617668,"about_ca_system_score_codex":0.000012353665,"about_ca_system_score_gemma":0.000029248351,"threshold_uncertainty_score":0.33235028},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000108086715,0.000020153293,0.9952934,0.0015337733,0.00037459968,0.00013176475,0.0000013875023,0.00010973944,0.0025243792],"genre_scores_gemma":[0.00031699022,0.0000027885103,0.99860644,0.00042633986,0.00013764162,0.000027369782,0.0000030038054,0.0000043690675,0.00047503732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.00006543026,0.00012114432,0.00022301562,0.000099804354,0.0001451368],"domain_scores_gemma":[0.9994628,0.0001234255,0.00006995922,0.00022276175,0.00007056968,0.000050506467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449524,0.000062390216,0.00009983478,0.000016835507,0.0000706423,0.00006716914,0.00023398995,0.000037880403,0.000009167503],"category_scores_gemma":[0.00030439332,0.000052432304,0.00004024309,0.0002720658,0.0000065146705,0.00018427317,0.000052809366,0.0000293587,0.000009667716],"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.000004912661,0.000025906282,0.000024544071,0.000008353161,0.0000037498985,1.6885267e-7,0.000020322304,0.025316138,0.000117474236,0.16278027,0.00088377047,0.8108144],"study_design_scores_gemma":[0.00022548833,0.000099102035,0.00010594022,0.000005199128,0.0000036039348,0.0000020310788,0.0000012432232,0.9220957,0.00039327817,0.03640828,0.04058841,0.00007173343],"about_ca_topic_score_codex":0.000014888372,"about_ca_topic_score_gemma":4.2663982e-7,"teacher_disagreement_score":0.89677954,"about_ca_system_score_codex":0.000027812897,"about_ca_system_score_gemma":0.000014627524,"threshold_uncertainty_score":0.21381274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48547614,0.00007437826,0.48932016,0.00231649,0.0008018996,0.00017408702,0.0000020888083,0.00012736575,0.021707417],"genre_scores_gemma":[0.9725483,9.934614e-7,0.025242904,0.0013755964,0.0001731915,0.000011040549,0.0000029743828,0.000002964254,0.00064200594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994858,0.00003540725,0.00008610668,0.00015007613,0.00013543975,0.00010720352],"domain_scores_gemma":[0.9996254,0.00006414694,0.00003424657,0.0002157346,0.000030263927,0.000030223366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017547769,0.000050402774,0.00004071323,0.000036592646,0.00011376432,0.000044995006,0.00030606383,0.000020308962,0.000045645935],"category_scores_gemma":[0.000029317785,0.00003744951,0.000021775551,0.00017499582,0.000012697668,0.000084783096,0.00005403081,0.0000606962,0.00019552524],"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.000017453021,0.00017797558,0.00039037893,0.00001192207,0.000025100342,0.000022235205,0.0037623292,0.0014600185,0.0039015948,0.688497,0.009321704,0.29241225],"study_design_scores_gemma":[0.0011187223,0.001015648,0.14708224,0.00007010289,0.00002251593,0.00014007145,0.00019311154,0.54688406,0.19238475,0.062063914,0.04800187,0.001022992],"about_ca_topic_score_codex":0.000015116577,"about_ca_topic_score_gemma":0.0000032479327,"teacher_disagreement_score":0.62643313,"about_ca_system_score_codex":0.000008365511,"about_ca_system_score_gemma":0.000027749218,"threshold_uncertainty_score":0.25131467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014192014,0.000053393804,0.9709004,0.0024761518,0.00015055948,0.00028162354,0.0000014503429,0.00011313212,0.024604093],"genre_scores_gemma":[0.43190354,0.000036674668,0.56226426,0.0004000226,0.00011693742,0.000031081945,0.0000062763656,0.000009898932,0.005231339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987147,0.00012814596,0.00018769022,0.0002828739,0.00038986458,0.000296723],"domain_scores_gemma":[0.99927855,0.00010210017,0.000023440787,0.00039387966,0.00012437398,0.00007765726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071099174,0.00007398715,0.00010760438,0.0001787066,0.00005771174,0.00017216842,0.00046439288,0.000046016106,0.00017876331],"category_scores_gemma":[0.00019320997,0.00006994485,0.00001899287,0.00078993203,0.000020454374,0.0005562751,0.00006916651,0.00018323706,0.00011804619],"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.000024560597,0.000735686,0.0017306913,0.000057604637,0.000011920771,0.00004338007,0.0014643971,0.025328316,0.0009277734,0.69339526,0.002042175,0.27423823],"study_design_scores_gemma":[0.00042304245,0.00015405445,0.009637134,0.000017559292,0.0000011326041,0.00001265293,0.000039892737,0.9634698,0.0006316169,0.02279631,0.002664646,0.00015213265],"about_ca_topic_score_codex":0.000029355791,"about_ca_topic_score_gemma":0.0000013713532,"teacher_disagreement_score":0.9381415,"about_ca_system_score_codex":0.00007816572,"about_ca_system_score_gemma":0.00015467867,"threshold_uncertainty_score":0.28522682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6787324,0.00006473,0.302231,0.00016354393,0.00020509592,0.000104692546,0.0000018172323,0.00024456275,0.018252166],"genre_scores_gemma":[0.89913076,0.0000022712875,0.10065616,0.000035850368,0.000082527666,0.000003944386,0.0000014310231,0.000020075971,0.00006695748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.000051237814,0.0001508584,0.000058920254,0.000082204926,0.00010353908],"domain_scores_gemma":[0.99958044,0.00014544795,0.000034538123,0.00019737658,0.000021983617,0.000020220703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046959223,0.00006579348,0.0000967266,0.00002454506,0.000036068985,0.00001123998,0.00012698636,0.000028625622,0.000023953562],"category_scores_gemma":[0.00028819745,0.00004482125,0.000029512312,0.00013166857,0.000017563969,0.000037159836,0.00002045103,0.0000820317,0.000008606738],"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.0000038284547,0.000018915112,0.015140334,0.000157383,0.000043491073,3.3151963e-7,0.0026482635,0.88744754,0.009441249,0.0027274718,0.00034582906,0.082025364],"study_design_scores_gemma":[0.00012192831,0.000010884168,0.0073186494,0.000011476592,0.000005311137,0.0000020418336,0.00004166627,0.9897613,0.0017981115,0.00033354314,0.0005232056,0.000071891074],"about_ca_topic_score_codex":0.0000038486087,"about_ca_topic_score_gemma":0.0000010265416,"teacher_disagreement_score":0.22039841,"about_ca_system_score_codex":0.000007803878,"about_ca_system_score_gemma":0.000002835619,"threshold_uncertainty_score":0.18277575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4340312,0.004927665,0.5269641,0.0024724975,0.0012350002,0.0010584581,0.00006886179,0.0011923884,0.028049804],"genre_scores_gemma":[0.98962986,0.00032739952,0.009438293,0.00004575157,0.00003588316,0.000036174977,0.000007968618,0.000015525186,0.00046311333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.0000075661724,0.00013399073,0.000072072886,0.000058122663,0.00010923166],"domain_scores_gemma":[0.9998161,0.000020230023,0.000007543263,0.00010134093,0.00002971213,0.000025083735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001371411,0.000058668455,0.00005357043,0.00001899583,0.00010320039,0.000036025915,0.000036290367,0.000026467982,0.000019925634],"category_scores_gemma":[0.000016386779,0.000045923975,0.000012756721,0.00009605316,0.000015610778,0.00006461376,0.0000016973983,0.00006583569,0.000009342646],"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.000011927592,0.00010155912,0.002040456,0.0002341623,0.00023746295,0.000012481166,0.005556066,0.41959664,0.007969773,0.4657399,0.004866477,0.093633085],"study_design_scores_gemma":[0.0009164175,0.000032688982,0.0052411268,0.000049007896,0.000049455222,0.000015559586,0.000830124,0.6679586,0.0030103328,0.016686887,0.30470294,0.00050682283],"about_ca_topic_score_codex":0.000021855347,"about_ca_topic_score_gemma":0.000043620148,"teacher_disagreement_score":0.55559874,"about_ca_system_score_codex":0.000007746425,"about_ca_system_score_gemma":0.000009576843,"threshold_uncertainty_score":0.18727253},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003899344,0.00004931876,0.9898759,0.0045990017,0.000060992814,0.00057401456,0.0000029536402,0.00006038907,0.00087805756],"genre_scores_gemma":[0.8553477,0.000012361393,0.14407453,0.00026979935,0.000043486856,0.000043040447,0.0000025026563,0.000005247887,0.00020134113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938965,0.000016801214,0.00010338621,0.00018673507,0.00015434403,0.0001491053],"domain_scores_gemma":[0.99965197,0.00006883425,0.000042122963,0.000119699595,0.000073727526,0.00004363278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018692516,0.000071837225,0.000053681,0.00004213186,0.0002548699,0.00022239143,0.00012017242,0.000027751717,0.00004124876],"category_scores_gemma":[0.000023918821,0.000047256053,0.000013221674,0.00012818376,0.00009820744,0.0003462755,0.000025752757,0.000057726622,0.0000035819996],"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.00003214371,0.0001073306,0.021381108,0.000089255904,0.0000709816,0.0000025632864,0.0030959595,0.0049375086,0.005470413,0.32237235,0.00042774348,0.64201266],"study_design_scores_gemma":[0.0051602176,0.0010673204,0.08774534,0.00037649568,0.00009784988,0.00037100856,0.0011057782,0.877745,0.0074358196,0.006758037,0.010881258,0.0012558931],"about_ca_topic_score_codex":0.0000060969633,"about_ca_topic_score_gemma":0.000049360744,"teacher_disagreement_score":0.87280744,"about_ca_system_score_codex":0.000039685674,"about_ca_system_score_gemma":0.0001363034,"threshold_uncertainty_score":0.21445256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856413,0.00008367349,0.008134868,0.00025480086,0.000017724518,0.00011145962,0.000022799864,0.00008560127,0.005647798],"genre_scores_gemma":[0.99736756,0.000019780744,0.0009323611,0.00043311485,0.00007457245,0.000008035579,0.00015424602,0.000019417448,0.0009909366],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991444,0.000015978234,0.00023237513,0.00024183362,0.00020523291,0.00016019944],"domain_scores_gemma":[0.9991939,0.00017379527,0.00024752857,0.00024139414,0.0001289912,0.000014361133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016310182,0.00014567345,0.0003352836,0.00062719604,0.00014770965,0.0000306987,0.00011459193,0.000034753255,0.00040597402],"category_scores_gemma":[0.00012694664,0.00011999941,0.00008976056,0.0016001363,0.00017690555,0.0006951517,0.000069510264,0.00006952158,0.00005052906],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010665273,0.00027156042,0.65986085,0.00032447348,0.006266734,0.00017589529,0.0011203235,0.2967065,0.0015752922,0.025072314,0.00085033267,0.0067092055],"study_design_scores_gemma":[0.0022137784,0.00011106943,0.34660986,0.00014663413,0.008773718,0.000007810425,0.0009735983,0.6120622,0.00021213814,0.00803138,0.01947117,0.0013866657],"about_ca_topic_score_codex":0.000171409,"about_ca_topic_score_gemma":0.00006208266,"teacher_disagreement_score":0.3153557,"about_ca_system_score_codex":0.000011232805,"about_ca_system_score_gemma":0.000012192899,"threshold_uncertainty_score":0.4893434},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026626667,0.00006623225,0.9674854,0.0003860684,0.00030162468,0.000054314925,8.0235907e-7,0.000077773824,0.0050011063],"genre_scores_gemma":[0.43681377,0.000001783138,0.56253636,0.00027735555,0.00007114258,0.000010594786,0.0000029389,0.000005042255,0.0002809874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931794,0.00008738505,0.000103102204,0.00019915914,0.00017655245,0.00011586875],"domain_scores_gemma":[0.9995795,0.00012020182,0.000025722755,0.00019520255,0.000035157147,0.000044203553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022186547,0.000061901505,0.00006463579,0.00003507017,0.000038969116,0.0000834537,0.00022460186,0.000025131372,0.00002742527],"category_scores_gemma":[0.00012293897,0.000059149348,0.00003507027,0.00019250526,0.000014675083,0.0002765991,0.000042373304,0.000053071344,0.00008213641],"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.000002780274,0.000117037045,0.0001916507,0.000005997011,0.000015894595,0.000011822299,0.0005336159,0.0054327864,0.012889308,0.72872317,0.0017735396,0.2503024],"study_design_scores_gemma":[0.00065406825,0.000047294197,0.0036895054,0.000012983479,0.0000071130967,0.00006988313,0.000020458812,0.6592433,0.17328879,0.10926897,0.05326294,0.0004346985],"about_ca_topic_score_codex":0.0000029080063,"about_ca_topic_score_gemma":5.1824804e-7,"teacher_disagreement_score":0.6538105,"about_ca_system_score_codex":0.000026459511,"about_ca_system_score_gemma":0.00005760895,"threshold_uncertainty_score":0.24120404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009668559,0.00007010685,0.9866262,0.000009031806,0.00027430532,0.00023616654,0.000013710152,0.00067593646,0.0024259626],"genre_scores_gemma":[0.101093486,0.000003805939,0.89793646,0.000013324872,0.00035071833,0.000073036885,0.00003845947,0.0000684939,0.0004222315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994071,0.000013391071,0.000157053,0.00013193644,0.00007611054,0.00021438731],"domain_scores_gemma":[0.9997081,0.000031671385,0.000018662598,0.00016415952,0.000035400793,0.00004196636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020429684,0.000098073826,0.00010032638,0.000049661852,0.00005116448,0.00004037285,0.00009135233,0.00005285738,0.000020216376],"category_scores_gemma":[0.000013638947,0.000104423896,0.000032576016,0.000119228214,0.000008448051,0.00012747612,0.000007440984,0.000060190116,0.000008888351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.511787e-7,0.000025256093,0.0003116299,0.000043674772,0.000008379337,5.1533635e-7,0.00008591337,0.8910508,0.0057480233,0.00018675636,0.00091022643,0.101627946],"study_design_scores_gemma":[0.00025360176,0.000028094018,0.00036639065,0.000012006774,0.0000064491114,0.000002649645,0.00001393211,0.9738943,0.006445786,0.00015126374,0.018686755,0.00013876501],"about_ca_topic_score_codex":0.000014690233,"about_ca_topic_score_gemma":0.0000026683529,"teacher_disagreement_score":0.10148919,"about_ca_system_score_codex":0.000044366992,"about_ca_system_score_gemma":0.0000064739347,"threshold_uncertainty_score":0.42582828},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051210616,0.00005507725,0.9462666,0.00069552293,0.000045876925,0.00087156275,0.0000025901586,0.00040763614,0.00044450827],"genre_scores_gemma":[0.07440457,0.000004355293,0.9244876,0.00015493575,0.000113075104,0.00006101099,0.0000061036617,0.000055050517,0.00071332516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991913,0.00004045445,0.00020695697,0.00018148073,0.00013094067,0.0002489034],"domain_scores_gemma":[0.99946946,0.00010197556,0.00004390033,0.00019553197,0.00006552569,0.0001235804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025707332,0.00014789571,0.00013424584,0.00005543892,0.00011173377,0.000154648,0.00010398037,0.00006159545,0.00008062124],"category_scores_gemma":[0.00006653072,0.00010653874,0.00001926038,0.00030230437,0.000015015493,0.00022471375,0.000036283942,0.00014147861,0.00014036532],"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.000014825771,0.000031877982,0.0016616759,0.000041742067,0.0001049079,0.000004608669,0.004588134,0.4235827,0.033072162,0.00005501843,0.002610543,0.5342318],"study_design_scores_gemma":[0.000564494,0.00004740663,0.006275844,0.000040032704,0.00001592698,0.00001089877,0.00007816911,0.9891842,0.0030802817,0.000014952584,0.0005166891,0.00017109873],"about_ca_topic_score_codex":0.000101533646,"about_ca_topic_score_gemma":0.000007636083,"teacher_disagreement_score":0.56560147,"about_ca_system_score_codex":0.000041233856,"about_ca_system_score_gemma":0.000020508445,"threshold_uncertainty_score":0.43445238},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3035161,0.00009682719,0.0039473125,0.0132511025,0.0006363608,0.0005051017,0.000027001886,0.00024717493,0.677773],"genre_scores_gemma":[0.9917047,0.0000049606874,0.0031437564,0.0014490088,0.00036150456,0.000012952899,8.657077e-7,0.000014529028,0.003307697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946684,0.00006233554,0.000115372895,0.000097396696,0.00013052508,0.00012752635],"domain_scores_gemma":[0.9989072,0.000614903,0.000044217282,0.00038412338,0.000023943188,0.000025605077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029591983,0.000079890626,0.000075736454,0.000025572888,0.0002716579,0.00002426874,0.00020801435,0.000044481993,0.0012860959],"category_scores_gemma":[0.00030110942,0.00004212222,0.00006314107,0.00006685759,0.000048899903,0.000029287054,0.00004164544,0.00012006727,0.00010330762],"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.000005931725,0.000025831216,0.00001747263,0.000002718216,0.000019332145,3.9814856e-7,0.00092678564,0.0000073691767,0.000031097636,0.9856867,0.010367742,0.002908583],"study_design_scores_gemma":[0.000099089375,0.00001726829,0.00038559063,0.000007743612,0.000015509255,0.0000025142037,0.000056332552,0.00023161847,0.00048281765,0.95022136,0.04841205,0.000068106085],"about_ca_topic_score_codex":0.0000011035742,"about_ca_topic_score_gemma":0.0000049467144,"teacher_disagreement_score":0.6881886,"about_ca_system_score_codex":0.0000149425605,"about_ca_system_score_gemma":0.000008930089,"threshold_uncertainty_score":0.9996269},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.609353,0.00074292574,0.12321315,0.022725042,0.0018096131,0.005702866,0.000032920616,0.00068314624,0.23573732],"genre_scores_gemma":[0.9959062,0.000005633774,0.0008645244,0.0021738233,0.00056283176,0.00007573918,0.00018127079,0.000015664398,0.00021435705],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.999295,0.000013536209,0.00014503462,0.00011287929,0.00016063842,0.000272935],"domain_scores_gemma":[0.999705,0.000011812426,0.00007772214,0.00016641186,0.000030269399,0.000008743101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038344008,0.00011079808,0.00008845739,0.000107164116,0.000094204755,0.00019375127,0.00017943629,0.000025296558,0.00030347714],"category_scores_gemma":[0.000014502821,0.000067960034,0.000022191918,0.00044029226,0.000025674435,0.0009939093,0.000059490303,0.000059922804,0.00008363831],"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.0004821315,0.001837701,0.56269026,0.0012780391,0.00016284,0.00005548863,0.0022139768,0.050668683,0.00015974906,0.19482926,0.17642556,0.009196317],"study_design_scores_gemma":[0.0020098973,0.000037773174,0.05624573,0.000113287366,0.000101400314,0.0000051929405,0.0022951572,0.033538938,0.000031144915,0.00067595294,0.9044844,0.00046115232],"about_ca_topic_score_codex":0.00012696926,"about_ca_topic_score_gemma":0.00004355,"teacher_disagreement_score":0.7280588,"about_ca_system_score_codex":0.00002276875,"about_ca_system_score_gemma":0.0000045988622,"threshold_uncertainty_score":0.33228618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029694075,0.00033754678,0.9916419,0.00029719496,0.00035362563,0.00073082454,9.331991e-7,0.0015332439,0.0021353464],"genre_scores_gemma":[0.37854686,0.000010392609,0.62003857,0.00026585304,0.00048027455,0.00005833455,0.0000128728225,0.000029302153,0.00055752776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792325,0.000038865826,0.00035990652,0.0005932794,0.0003830574,0.00070160814],"domain_scores_gemma":[0.9986686,0.000075342345,0.00013381243,0.0008314626,0.00014427312,0.0001465233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006302711,0.00021417663,0.00020437014,0.00017516252,0.00018959215,0.00018898491,0.0010032647,0.00016921986,0.000012833111],"category_scores_gemma":[0.00013157101,0.00020501709,0.000055699264,0.0023554733,0.000052294123,0.0003827059,0.0005173656,0.00017984268,0.00015354904],"study_design_candidate":"design_other","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.000022045073,0.00023539554,0.0029988708,0.00004369329,0.00003965336,0.000016523749,0.000632303,0.032340102,0.00005520474,0.06444511,0.02412683,0.8750443],"study_design_scores_gemma":[0.000983078,0.00043544735,0.0039849803,0.00015610768,0.00002649177,0.000041597574,0.00007233691,0.6854237,0.0022665092,0.003777062,0.3017077,0.0011250074],"about_ca_topic_score_codex":0.000008419065,"about_ca_topic_score_gemma":0.000008137581,"teacher_disagreement_score":0.87391925,"about_ca_system_score_codex":0.00016063293,"about_ca_system_score_gemma":0.00007105079,"threshold_uncertainty_score":0.83603543},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016395075,0.00031766557,0.9750223,0.000035395668,0.000046217338,0.00012541724,0.0000037290208,0.00032527136,0.022484465],"genre_scores_gemma":[0.028484428,0.00009282793,0.9707927,0.00004443954,0.000087471286,0.00004008429,0.000003600685,0.000026945056,0.00042748117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950105,0.00006481849,0.00010890336,0.00011267694,0.00006218191,0.00015039554],"domain_scores_gemma":[0.9995874,0.0001250665,0.000009226621,0.00017623657,0.00002874028,0.00007329177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032625906,0.000069923415,0.000093973664,0.00005017252,0.00010245529,0.000014975791,0.00007115699,0.00004964714,0.00013772512],"category_scores_gemma":[0.000041026666,0.00007452644,0.000013865976,0.0002458149,0.000030383646,0.00006337685,0.000026172309,0.00010578874,0.000024029727],"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.0000055503633,0.00006360917,0.0037680694,0.0002006616,0.00011055433,0.0000059997715,0.0013380861,0.5954016,0.03152893,0.046475854,0.0016283956,0.3194727],"study_design_scores_gemma":[0.00046613274,0.000020493122,0.006489823,0.000012342577,0.000023706378,0.00010126921,0.00006076237,0.9047142,0.013694962,0.0018046302,0.07226645,0.00034520857],"about_ca_topic_score_codex":0.0000059763934,"about_ca_topic_score_gemma":1.3955858e-7,"teacher_disagreement_score":0.3191275,"about_ca_system_score_codex":0.000019327377,"about_ca_system_score_gemma":0.000015614074,"threshold_uncertainty_score":0.30391},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10081301,0.000019106084,0.89619356,0.001336181,0.00006168592,0.00045107177,0.000020363244,0.00009944393,0.0010055883],"genre_scores_gemma":[0.21182488,0.000016457576,0.7857874,0.00020960554,0.000095998796,0.00002364089,0.0000040136965,0.00003772266,0.002000285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897003,0.00010326486,0.00022766841,0.00020003147,0.0002540614,0.00024492186],"domain_scores_gemma":[0.99883586,0.00046058642,0.00007677323,0.00034980063,0.0001592377,0.00011773111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237124,0.00011780496,0.00021823119,0.000118030184,0.00004459876,0.000012532883,0.000106959495,0.00005830286,0.000054174827],"category_scores_gemma":[0.0007195105,0.00010120111,0.00006670739,0.0002787277,0.00005546161,0.00011872539,0.00007407666,0.00011231708,0.00005817181],"study_design_candidate":"design_other","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.00014654039,0.0006976979,0.00037636078,0.00014600644,0.000119905126,0.0000442213,0.004543606,0.04252972,0.0045861243,0.006447425,0.0072195814,0.9331428],"study_design_scores_gemma":[0.0019740455,0.00035602917,0.00079015095,0.00015358752,0.00004088809,0.00010427896,0.0014571884,0.7511777,0.20057909,0.01904519,0.02346187,0.0008599488],"about_ca_topic_score_codex":0.000012229638,"about_ca_topic_score_gemma":0.000015565607,"teacher_disagreement_score":0.93228287,"about_ca_system_score_codex":0.00007119999,"about_ca_system_score_gemma":0.000028591574,"threshold_uncertainty_score":0.41268617},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09258533,0.00026498732,0.9026478,0.0010249477,0.00060566654,0.00067938905,0.000045768582,0.0003531085,0.001792981],"genre_scores_gemma":[0.80510306,0.00004850313,0.19384263,0.000094898016,0.00025099586,0.00008607373,0.000005554095,0.000056726924,0.0005115237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.000026061469,0.000119278666,0.00012270728,0.00008073212,0.00024046592],"domain_scores_gemma":[0.9992325,0.00046480124,0.000013418153,0.00019354692,0.000044074208,0.000051708084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060023356,0.0000877775,0.00009276084,0.000033569097,0.00011416479,0.00006310352,0.00009739697,0.00007102785,0.00009528753],"category_scores_gemma":[0.00018101408,0.00006740261,0.000032323045,0.00009563691,0.000019406541,0.000062522755,0.000030886604,0.00023678677,0.000011808614],"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.00016460998,0.0003187858,0.01589145,0.0021845882,0.0007102853,0.000019736925,0.008122005,0.39748606,0.07717497,0.026565898,0.02648244,0.44487917],"study_design_scores_gemma":[0.0006677374,0.000043116954,0.0074672587,0.000018182507,0.000034920206,0.000014625906,0.00009983268,0.9674323,0.0015951842,0.00073874765,0.021675372,0.00021270079],"about_ca_topic_score_codex":0.0000036761078,"about_ca_topic_score_gemma":0.000015242513,"teacher_disagreement_score":0.71251774,"about_ca_system_score_codex":0.000009657122,"about_ca_system_score_gemma":0.000015780039,"threshold_uncertainty_score":0.27485988},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577312,0.00027640813,0.011782209,0.0001045465,0.0012719947,0.00030499388,0.00009762845,0.0010340967,0.027396949],"genre_scores_gemma":[0.99940115,7.91359e-7,0.00021027088,0.000018750045,0.000032172873,0.000034607856,0.00003783796,0.0000064399433,0.0002580059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997134,0.0000032767875,0.00010731822,0.00005195632,0.00006237395,0.00006162478],"domain_scores_gemma":[0.99976397,0.000005397076,0.000005569621,0.00012295459,0.000054394164,0.000047726746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007473136,0.000038392358,0.000049236096,0.000021559323,0.000010013792,0.000013680787,0.000038904902,0.000025054002,0.00003339326],"category_scores_gemma":[0.000010123437,0.00003837822,0.000012301462,0.000106026266,0.00000802071,0.00006293113,0.0000013729298,0.00003782585,0.000117456824],"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.00004099349,0.00048274372,0.06213892,0.0009854969,0.00024896246,0.00002238965,0.007856123,0.55718523,0.011785923,0.12984043,0.22148445,0.007928295],"study_design_scores_gemma":[0.0017779127,0.00006698097,0.25270215,0.000050512455,0.000037627764,0.000008533872,0.001967186,0.10814526,0.0019886438,0.0010010725,0.6316156,0.00063855934],"about_ca_topic_score_codex":0.000022398252,"about_ca_topic_score_gemma":0.000016071075,"teacher_disagreement_score":0.44904,"about_ca_system_score_codex":0.0000280458,"about_ca_system_score_gemma":0.000012593648,"threshold_uncertainty_score":0.15650183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014451144,0.00040154145,0.98737866,0.00036045205,0.00024346325,0.00041673356,0.0000011757212,0.00013130628,0.009621551],"genre_scores_gemma":[0.26229665,0.000082553095,0.7348196,0.00015591354,0.00013242086,0.0002231513,0.0000019137362,0.000029866069,0.0022579336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893504,0.000043627773,0.0001493339,0.0004211134,0.0001949865,0.00025591286],"domain_scores_gemma":[0.9987906,0.00005768759,0.00021470412,0.00077360775,0.00008456537,0.00007884179],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033211664,0.00012623469,0.00011628262,0.000043214815,0.0013093074,0.0005636212,0.0006963252,0.000034579472,8.4237087e-7],"category_scores_gemma":[0.00014362212,0.00009467088,0.000027311859,0.00006937128,0.00014896457,0.0006979502,0.00060415623,0.00014256236,0.0000039209535],"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.00016802762,0.0006093354,0.036292218,0.00024506755,0.00050695654,0.00016378364,0.054358974,0.087232664,0.00199097,0.14998007,0.0022233974,0.66622853],"study_design_scores_gemma":[0.0012079936,0.0001286748,0.017239986,0.00008226297,0.000010487808,0.000049010345,0.00078342407,0.962984,0.0015605779,0.005260721,0.010213141,0.0004796828],"about_ca_topic_score_codex":0.000020307969,"about_ca_topic_score_gemma":0.0000026702216,"teacher_disagreement_score":0.8757514,"about_ca_system_score_codex":0.000074396026,"about_ca_system_score_gemma":0.000047160567,"threshold_uncertainty_score":0.9999909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96508634,0.000097516604,0.0014029209,0.00020023764,0.0002210735,0.001017427,0.000020519772,0.00007175558,0.031882204],"genre_scores_gemma":[0.9961182,0.0000107045225,0.000083674,0.00031640468,0.000097735996,0.00002914744,0.00006355988,0.00004700578,0.0032336079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99842924,0.000045140452,0.0004039693,0.00034141543,0.00038904336,0.0003912018],"domain_scores_gemma":[0.9983855,0.00013073088,0.00036315504,0.0004795033,0.00062851154,0.000012593422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998814,0.00020897313,0.00042613866,0.00044046313,0.00003186681,0.00004779729,0.0004069231,0.000073330615,0.00057022553],"category_scores_gemma":[0.00021732952,0.00020113068,0.00010236337,0.0010113708,0.000097359465,0.0005529662,0.00028921806,0.00011277263,0.0001328081],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007109436,0.0007183642,0.41397393,0.0048037455,0.0004094895,0.000016951783,0.0008740725,0.011608566,0.0012811967,0.5519824,0.008900641,0.0047197086],"study_design_scores_gemma":[0.0053775683,0.00025850465,0.56552774,0.00041169688,0.00029213534,0.0000013226245,0.0045656883,0.34330875,0.0025993139,0.07166965,0.004618739,0.0013688932],"about_ca_topic_score_codex":0.0042848405,"about_ca_topic_score_gemma":0.00015070655,"teacher_disagreement_score":0.48031273,"about_ca_system_score_codex":0.000058647962,"about_ca_system_score_gemma":0.000051132047,"threshold_uncertainty_score":0.8201871},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024954234,0.000051461884,0.99320364,0.00042449433,0.00059703155,0.000041628027,8.04322e-7,0.000029908148,0.0031556028],"genre_scores_gemma":[0.90630126,0.000032562584,0.093518056,0.00006710003,0.00001898814,0.0000025994757,0.0000034684658,0.0000021765954,0.000053800868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995738,0.000035949553,0.00011615912,0.000106519234,0.00011055437,0.000056987843],"domain_scores_gemma":[0.9996992,0.000021353539,0.000037660295,0.00013182282,0.000093213355,0.00001679825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008030963,0.00003255458,0.00006478215,0.000041646246,0.000014516845,0.00002129824,0.00008701879,0.000025567952,0.000053097494],"category_scores_gemma":[0.00007733677,0.000035455567,0.000016069134,0.000301408,0.00001144667,0.00015332534,0.00002883915,0.000033585336,0.0000028331804],"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.000015250295,0.00020531264,0.040463638,0.00003199776,0.000014664915,0.000027320879,0.0008827046,0.5508402,0.0029267017,0.31951922,0.0004617331,0.08461126],"study_design_scores_gemma":[0.0012084544,0.000024684092,0.022065401,0.00003585856,0.00000255858,0.000010451075,0.00003701192,0.96144164,0.011548196,0.0024126677,0.0010757489,0.0001373506],"about_ca_topic_score_codex":0.0000066167504,"about_ca_topic_score_gemma":0.000007789545,"teacher_disagreement_score":0.90380585,"about_ca_system_score_codex":0.000016159662,"about_ca_system_score_gemma":0.00007387919,"threshold_uncertainty_score":0.1445836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019688907,0.0002981142,0.95985556,0.016736776,0.000252301,0.003029735,0.000021562342,0.000104708095,0.017732352],"genre_scores_gemma":[0.9781897,0.00000684036,0.0029054324,0.0058369786,0.0005176194,0.001896138,0.000034356897,0.00005470892,0.010558219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.000015403717,0.00013183308,0.00014710425,0.00021916408,0.00015295121],"domain_scores_gemma":[0.9993993,0.000116591655,0.00016708158,0.00024792147,0.00006533391,0.0000037958287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058180204,0.00009428101,0.00008746135,0.0000653904,0.00044761584,0.00007097327,0.0003699134,0.000010493778,0.00033055615],"category_scores_gemma":[0.000027716655,0.000049473136,0.000058754333,0.00026655267,0.00004903769,0.00020764356,0.0002163758,0.00006859181,0.0000035033631],"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.0001254831,0.000068341724,0.00013371458,0.000074972006,0.00005800818,2.6729205e-7,0.00022290384,0.8668567,0.000012246692,0.10088498,0.024443831,0.007118561],"study_design_scores_gemma":[0.000582124,0.000021529808,0.000063702595,0.000006433297,0.000093418355,2.4656117e-7,0.0009924724,0.86815995,0.0000061985693,0.005104514,0.1248864,0.00008298114],"about_ca_topic_score_codex":0.000107372856,"about_ca_topic_score_gemma":0.000038708262,"teacher_disagreement_score":0.9762208,"about_ca_system_score_codex":0.000020703166,"about_ca_system_score_gemma":0.000017796192,"threshold_uncertainty_score":0.3619358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961994,0.000023508908,0.0022333355,0.00028485744,0.000014087217,0.0002955729,0.00016046983,0.00024817797,0.00054057344],"genre_scores_gemma":[0.9995344,0.000015557016,0.00013412477,0.000037173853,0.0000035507414,0.00012561804,0.00010555138,0.000009387574,0.000034622244],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997252,0.0000040894047,0.000091031856,0.00006642628,0.000052860887,0.00006034029],"domain_scores_gemma":[0.99976116,0.000033024633,0.000011531605,0.00009918725,0.00007647004,0.00001863341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059708207,0.000043110977,0.00005821315,0.0000638513,0.000018396457,0.00000439468,0.000030603387,0.000019212608,0.000007734689],"category_scores_gemma":[0.0000016915824,0.000039334016,0.0000053210447,0.0006330826,0.000011074311,0.000026497864,0.0000021690307,0.000036064568,0.0000203302],"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.00026123665,0.0008427789,0.42651257,0.005301979,0.0010396879,0.000013037412,0.012355589,0.3186181,0.061158895,0.04937823,0.0071168444,0.11740104],"study_design_scores_gemma":[0.0002643908,0.000023896142,0.99570304,0.00001807036,0.0000074385866,4.0472634e-7,0.00004329121,0.0025735574,0.00037060984,0.00014201546,0.00078544015,0.00006783774],"about_ca_topic_score_codex":0.0001357862,"about_ca_topic_score_gemma":0.0025423176,"teacher_disagreement_score":0.56919044,"about_ca_system_score_codex":0.0000050428157,"about_ca_system_score_gemma":0.000010115554,"threshold_uncertainty_score":0.16039945},"labels":[],"label_agreement":null}]}