{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":58,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":58,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3c29a04d9409","filters":{"venue":"Discrete Optimization"}},"results":[{"id":"W1992769367","doi":"10.1016/j.disopt.2014.03.001","title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Mathematics; Upper and lower bounds; Algorithm; Branch and cut; Computer science; Linear programming","retraction":null,"screen_n_in":null,"score":{"opus":0.02244022931863883,"gpt":0.2567384899092984,"spread":0.2342982605906596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728916,0.0002335159,0.0002132236,0.0000580319,0.0002816804,0.000177938,0.000149092,0.0001302753,0.00003126754],"category_scores_gemma":[0.0001633348,0.0001984911,0.00006194803,0.0002056574,0.00008324117,0.0002750282,0.00004001522,0.0001739979,0.000002415621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006732005,"about_ca_system_score_gemma":0.0000271129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004917153,"about_ca_topic_score_gemma":0.00001120429,"domain_scores_codex":[0.9987642,0.0001126712,0.0003349766,0.0002926137,0.0001561221,0.0003394526],"domain_scores_gemma":[0.9990881,0.0003551917,0.000101339,0.0002453136,0.00008818936,0.0001218316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002741908,0.00000518919,0.0001835761,0.00002022924,0.0000409158,8.767663e-8,0.0003288847,0.889507,0.0001256492,0.0007839664,0.00003766554,0.1089641],"study_design_scores_gemma":[0.001087617,0.0000252518,0.0004906297,0.00003776944,0.00005809483,0.0000057035,0.0001431237,0.9971173,0.0004856923,0.000121615,0.0001723056,0.0002548579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006707916,0.00007005527,0.9973019,0.0002099704,0.000181108,0.000637273,0.00002525652,0.00037809,0.0005255567],"genre_scores_gemma":[0.1594348,0.00004275813,0.8400558,0.00007686715,0.0001252011,0.00003826369,0.00003975519,0.00007175963,0.00011478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.158764,"threshold_uncertainty_score":0.809423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002576503","doi":"10.1016/j.disopt.2005.03.001","title":"A semidefinite optimization approach for the single-row layout problem with unequal dimensions","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematical optimization; Relaxation (psychology); Mathematics; Heuristic; Upper and lower bounds; Linear programming; Linear programming relaxation; Simple (philosophy); Matrix (chemical analysis); Space (punctuation); Facility location problem; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01482290958933528,"gpt":0.2092666094721759,"spread":0.1944436998828406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001319514,0.0002665272,0.0001827636,0.00009283417,0.0003073773,0.0001172174,0.0001477996,0.0001131495,0.0000213268],"category_scores_gemma":[0.00004989019,0.0001934822,0.00005512459,0.0002734814,0.00006616258,0.0003749312,0.00002482153,0.0001413256,0.00000187983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009951637,"about_ca_system_score_gemma":0.00001754321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002983486,"about_ca_topic_score_gemma":0.000005130736,"domain_scores_codex":[0.9988678,0.00002449899,0.0002996477,0.0002920293,0.0001907838,0.0003253043],"domain_scores_gemma":[0.9992503,0.0001334486,0.0001021005,0.0003054348,0.0001378183,0.00007090391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004151504,0.00003457156,0.000005923182,0.00003959694,0.0000433555,2.06489e-7,0.0002461735,0.9972475,0.00001626619,0.0008836663,0.0001287683,0.001312449],"study_design_scores_gemma":[0.0006173698,0.00007654323,0.000002830163,0.00002536236,0.00009448903,0.000003828751,0.0001195758,0.9978583,0.0003072831,0.00002707723,0.0005693954,0.0002979182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003257845,0.0002081937,0.994094,0.0001618239,0.00007767681,0.0008538017,0.00004357022,0.0005156951,0.00401269],"genre_scores_gemma":[0.1510077,0.0001408154,0.8471633,0.00007164814,0.000138205,0.0002403072,0.0009167684,0.00009588218,0.0002253493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1509751,"threshold_uncertainty_score":0.7889977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064816527","doi":"10.1016/j.disopt.2008.04.001","title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tardiness; Travelling salesman problem; Sequence (biology); Mathematical optimization; Single-machine scheduling; Scheduling (production processes); Computation; Branch and bound; Integer programming; Computer science; Job shop scheduling; Linear programming relaxation; Mathematics; Algorithm; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01172588068999795,"gpt":0.1993286561662797,"spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460116,0.0002848532,0.0002022007,0.00007219983,0.0005810566,0.0001919867,0.0001740354,0.0001044534,0.00004050029],"category_scores_gemma":[0.00002839473,0.0002117633,0.00003384281,0.0002644313,0.0001213549,0.000329369,0.00003874699,0.0002278657,0.00001726554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007847133,"about_ca_system_score_gemma":0.00003629341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001628321,"about_ca_topic_score_gemma":0.00001759303,"domain_scores_codex":[0.9985631,0.00005038154,0.0003517607,0.0003339689,0.000344485,0.0003563243],"domain_scores_gemma":[0.9993445,0.00006695664,0.00009761749,0.0002505655,0.0001164729,0.0001239485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001617408,0.00001536477,0.0002440248,0.00003061182,0.00004728239,0.000007513815,0.0005149206,0.9976181,0.0004549061,0.00006309851,0.000008551435,0.0009794261],"study_design_scores_gemma":[0.0005595281,0.00007166697,0.00001871623,0.00008681413,0.00003428416,0.0001285756,0.000116456,0.9975072,0.001081247,0.00004465852,0.00003159177,0.0003193356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01241708,0.001326781,0.9811237,0.0002417907,0.0001222928,0.0006192916,0.00002495681,0.000698143,0.003425999],"genre_scores_gemma":[0.5418719,0.001262103,0.4552725,0.0000438612,0.00009265327,0.0000771334,0.000242617,0.0001393104,0.0009978941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5294548,"threshold_uncertainty_score":0.8635458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","retraction":null,"screen_n_in":null,"score":{"opus":0.01236291145485941,"gpt":0.2336600920583558,"spread":0.2212971806034964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002046362,0.0001010384,0.00007731058,0.00004758408,0.0005363298,0.000382949,0.0003111552,0.00004227783,0.00001468648],"category_scores_gemma":[0.00004249289,0.00006896999,0.00001936673,0.0002715356,0.0001627801,0.0004047397,0.00009345962,0.0001490525,0.000002393177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004621429,"about_ca_system_score_gemma":0.00004623387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005133616,"about_ca_topic_score_gemma":0.00002627683,"domain_scores_codex":[0.9992623,0.00003375835,0.0001389482,0.0002335985,0.0001564085,0.0001749926],"domain_scores_gemma":[0.9993632,0.0001234921,0.00008947663,0.0002463799,0.0001125983,0.00006483585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001010129,0.00002517217,0.0003425946,0.000009005592,0.00003693014,0.000003704293,0.001607748,0.01803707,0.0004528281,0.9492612,0.00008114103,0.03013249],"study_design_scores_gemma":[0.0002955045,0.00004828156,0.0008016586,0.00001384304,0.000008495686,0.00002481898,0.00004821374,0.9959275,0.0001317824,0.001753001,0.0008190952,0.0001278344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001592169,0.0000426987,0.9897717,0.001648249,0.0001610871,0.0002411111,0.000005158003,0.00009464808,0.006443175],"genre_scores_gemma":[0.5328751,0.00004044624,0.4666281,0.0001009801,0.00005606125,0.00003381513,0.00001610333,0.00001065485,0.0002387359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778904,"threshold_uncertainty_score":0.4125069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970402125","doi":"10.1016/j.disopt.2013.07.005","title":"A computational comparison of flow formulations for the capacitated location-routing problem","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; HEC Montréal; Transport Canada; École de Technologie Supérieure; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Flow (mathematics); Mathematical optimization; Index (typography); Routing (electronic design automation); Mathematics; Flow routing; Scale (ratio); Computer science; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0230630677586105,"gpt":0.2875200500293179,"spread":0.2644569822707074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500692,0.0001421367,0.000180123,0.00009081279,0.0002287806,0.00007661102,0.0001408366,0.00007495007,0.00008354113],"category_scores_gemma":[0.0001787558,0.0001212481,0.00005866179,0.000517956,0.00005014903,0.0003261155,0.00001633809,0.00008891718,0.000006358015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005190436,"about_ca_system_score_gemma":0.0000292945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002155626,"about_ca_topic_score_gemma":0.000003257308,"domain_scores_codex":[0.9989101,0.00004645019,0.0005284508,0.0001415244,0.0001805577,0.0001928876],"domain_scores_gemma":[0.9985369,0.0004973196,0.0001534684,0.0001760937,0.0005946123,0.00004154025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003121528,0.00001314342,0.0005822707,0.00005523504,0.00004367635,7.604618e-9,0.001074293,0.9928979,0.00006160797,0.001584684,0.000372073,0.003311959],"study_design_scores_gemma":[0.0003525619,0.00001977786,0.0006957095,0.00003509859,0.00003708344,6.046824e-7,0.0003265719,0.9975382,0.0002196642,0.0006034106,0.00003278276,0.0001385281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001249797,0.00007572761,0.9964208,0.0002200013,0.000115174,0.00107746,0.00002479113,0.0002139712,0.0006022507],"genre_scores_gemma":[0.486584,0.000003137136,0.51294,0.00001272715,0.00002356248,0.0001421212,0.0002438014,0.00002723906,0.00002332152],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4853342,"threshold_uncertainty_score":0.4944354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030028156","doi":"10.1016/j.disopt.2004.12.001","title":"Facility location problems with uncertainty on the plane","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Minimax; Mathematics; Ackermann function; Interval (graph theory); Euclidean geometry; Mathematical optimization; Combinatorics; Function (biology); Facility location problem; Euclidean distance; Inverse; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01848136077061519,"gpt":0.2049505661645586,"spread":0.1864692053939434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003033129,0.0001449539,0.00008583332,0.00008272759,0.0002503816,0.0001661704,0.000165759,0.00003341896,0.001028934],"category_scores_gemma":[0.00006058652,0.00009150859,0.00002609675,0.0004635595,0.00004811163,0.000605597,0.00003676491,0.00007812992,0.0004502689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004801088,"about_ca_system_score_gemma":0.00001148478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00041964,"about_ca_topic_score_gemma":0.0006501616,"domain_scores_codex":[0.9990685,0.00001521847,0.0002047745,0.0002533579,0.000286018,0.0001721234],"domain_scores_gemma":[0.9994213,0.00001256484,0.0000740622,0.0003098462,0.0001727628,0.000009494125],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003897714,0.00004427686,0.0003752138,0.00004475093,0.00001245276,1.063901e-7,0.00006070046,0.9819416,0.000003392834,0.01317315,0.002253871,0.002051547],"study_design_scores_gemma":[0.0002922482,0.00001663445,0.001274468,0.00002809564,0.00002500678,1.540211e-7,0.0002504104,0.9329316,0.00001296906,0.00009170177,0.0648963,0.0001804191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07553337,0.00006866013,0.7106835,0.07604997,0.0005221128,0.003542868,0.00004384221,0.0008459051,0.1327097],"genre_scores_gemma":[0.9951908,0.00001132808,0.0004857565,0.002560626,0.0001900093,0.00008993335,0.0006351628,0.00001048792,0.0008258825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9196575,"threshold_uncertainty_score":0.9998842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020257725","doi":"10.1016/j.disopt.2006.05.006","title":"Algorithms for time-dependent bicriteria shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Shortest path problem; K shortest path routing; Yen's algorithm; Constrained Shortest Path First; Path (computing); Mathematical optimization; Algorithm; Computer science; Euclidean shortest path; Shortest Path Faster Algorithm; Travel time; Mathematics; Dijkstra's algorithm; Theoretical computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.0143382204143877,"gpt":0.2744137807614725,"spread":0.2600755603470848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750913,0.0001251364,0.0001293763,0.00008845861,0.0005085746,0.0001954318,0.0001216072,0.0001187913,0.0002380448],"category_scores_gemma":[0.00005210311,0.0001300681,0.00006002594,0.0002605832,0.00006889451,0.0004204998,0.000005083765,0.00004701237,0.00001708229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000560503,"about_ca_system_score_gemma":0.00007694175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000622718,"about_ca_topic_score_gemma":0.0002021682,"domain_scores_codex":[0.9988123,0.00006566128,0.0002882988,0.0002714202,0.0002877288,0.0002745917],"domain_scores_gemma":[0.9994003,0.00005485574,0.0001286208,0.000110864,0.0002385134,0.00006681911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001334091,0.00003930904,0.001188085,0.000007549077,0.000006841592,7.350832e-7,0.001147863,0.9932056,0.00008134489,0.002577159,0.001279688,0.0004524685],"study_design_scores_gemma":[0.0009106224,0.00009024787,0.001258847,0.00005973823,0.00007215713,7.941072e-7,0.0005919997,0.9790028,0.0001239759,0.00092676,0.01649948,0.0004625884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001005293,0.00006947979,0.9847389,0.0005828374,0.0002750726,0.0007669163,0.0001392131,0.0003052025,0.01211713],"genre_scores_gemma":[0.6741499,0.0001679375,0.2933035,0.0001967869,0.001073703,0.0003856691,0.009865349,0.0001121936,0.02074496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6914354,"threshold_uncertainty_score":0.5304025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098775996","doi":"10.1016/j.disopt.2009.04.001","title":"Rectangle packing with one-dimensional resource augmentation","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Rectangle; Bin packing problem; Mathematics; Combinatorics; Packing problems; Approximation algorithm; Set packing; Constant (computer programming); Mathematical optimization; Square (algebra); Bin; Algorithm; Set (abstract data type); Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008249441214177488,"gpt":0.2028664908287158,"spread":0.1946170496145383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000863405,0.0001462103,0.0001164569,0.0001042793,0.0001084765,0.00008392952,0.00006584555,0.00006810923,0.0001515299],"category_scores_gemma":[0.0000103631,0.0001406845,0.00002678332,0.0003342442,0.00001704345,0.0002875747,0.000006056087,0.00009450581,0.00001395818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005966212,"about_ca_system_score_gemma":0.0000111219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002096499,"about_ca_topic_score_gemma":0.000002653077,"domain_scores_codex":[0.9992068,0.00002667704,0.0001855681,0.0001754936,0.000218045,0.0001873954],"domain_scores_gemma":[0.9996576,0.00001751147,0.00004905828,0.0001542019,0.00005643536,0.00006524683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000256541,0.00001409148,0.0000682614,0.000009119767,0.00001461631,0.000001193266,0.0002144238,0.9964524,0.0003211737,0.0003668515,0.0006956907,0.001816537],"study_design_scores_gemma":[0.0005812672,0.0001044164,0.0003272823,0.00008961975,0.00002381886,0.000005869243,0.00004741199,0.9961895,0.001306772,0.00007802503,0.0009916611,0.0002543345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00570073,0.0001411232,0.9507948,0.0006341761,0.0001288731,0.0003620868,0.00001005892,0.0009286642,0.04129949],"genre_scores_gemma":[0.8359119,0.00004973165,0.1621702,0.0004181144,0.00009738463,0.00001487252,0.0007446456,0.00006432853,0.0005287465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8302112,"threshold_uncertainty_score":0.5736946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1211367297478479,"gpt":0.3512656153859113,"spread":0.2301288856380634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668913,0.0001036996,0.0001909567,0.0002660585,0.000538885,0.0000953307,0.0001119244,0.00006464822,0.0000138192],"category_scores_gemma":[0.001486432,0.00008878815,0.0000467071,0.0006802664,0.0001624564,0.0004699276,0.00007687978,0.00007021131,0.000002051135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001188396,"about_ca_system_score_gemma":0.00003035978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008590375,"about_ca_topic_score_gemma":0.00002404806,"domain_scores_codex":[0.9986044,0.00004576988,0.0004660437,0.0003082292,0.0004014891,0.0001741301],"domain_scores_gemma":[0.9987611,0.0004837135,0.0002304427,0.0002350641,0.0002005359,0.00008910615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006053655,0.00001603401,0.02629151,0.000006062977,0.0000233746,0.000002281662,0.003698709,0.9666119,0.00004936731,0.002427669,0.0001371925,0.0006754046],"study_design_scores_gemma":[0.0008068979,0.00006701797,0.02757397,0.00003283606,0.00002427132,0.00002639361,0.0005708608,0.9685028,0.000186712,0.001812817,0.0002415364,0.0001538623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.51648,0.0002018354,0.4812478,0.0004803266,0.0001546122,0.0001614425,0.0001082829,0.00005102097,0.001114679],"genre_scores_gemma":[0.9294695,0.0001837998,0.07008627,0.00001428541,0.00003160469,0.000004525096,0.00004137777,0.000008658678,0.0001600101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4129895,"threshold_uncertainty_score":0.4144723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088165054","doi":"10.1016/j.disopt.2009.04.004","title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Heuristic; Benchmark (surveying); Mathematical optimization; Variable neighborhood search; Mathematics; Local search (optimization); Variable (mathematics); Scale (ratio); Incremental heuristic search; Beam search; Algorithm; Search algorithm; Computer science; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.02201980069949839,"gpt":0.2781955289469787,"spread":0.2561757282474803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228369,0.0002789936,0.0002755582,0.0001199935,0.0003640782,0.0001884099,0.0003242025,0.0001848251,0.0001084977],"category_scores_gemma":[0.00006094073,0.000231932,0.0001068213,0.0005522025,0.00005254812,0.0002311302,0.00006530378,0.0002980578,0.000008129137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001894767,"about_ca_system_score_gemma":0.00005358389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000121125,"about_ca_topic_score_gemma":0.000001862068,"domain_scores_codex":[0.9979452,0.0002066968,0.0004303588,0.0003841133,0.0003837883,0.0006498168],"domain_scores_gemma":[0.9989017,0.0002144515,0.00005316631,0.0004563049,0.0002371381,0.0001372242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005123817,0.0000512546,0.00006571642,0.00003722892,0.00005255341,6.434843e-7,0.0006749187,0.9923336,0.0005204395,0.001280794,0.0005536294,0.004378011],"study_design_scores_gemma":[0.001523759,0.00007687167,0.00007790971,0.00003949053,0.00005363287,0.000003386434,0.0005773804,0.9940298,0.00211534,0.00004214043,0.0011741,0.0002861613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001663974,0.0002031214,0.9957844,0.0006144092,0.0001423497,0.00112505,0.00004507416,0.0004076051,0.001511599],"genre_scores_gemma":[0.1278366,0.00009212217,0.870411,0.0003839585,0.0001397981,0.0001153372,0.0003480818,0.0001061746,0.0005669452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1276702,"threshold_uncertainty_score":0.9457913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984167047","doi":"10.1016/j.disopt.2005.07.001","title":"Computing and minimizing the relative regret in combinatorial optimization with interval data","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematical optimization; Mathematics; Interval (graph theory); Minimax; Function (biology); Set (abstract data type); Minification; Computer science; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06296760241526711,"gpt":0.3605790427625292,"spread":0.2976114403472621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002322264,0.0002174301,0.0002922986,0.0002719841,0.0003310204,0.0005150644,0.0007436599,0.0001174849,0.00007247719],"category_scores_gemma":[0.001116341,0.0001365301,0.00003134893,0.001206506,0.0001778008,0.00227309,0.0003604052,0.000235365,0.00000771503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005561071,"about_ca_system_score_gemma":0.00007219997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000480604,"about_ca_topic_score_gemma":0.00006939826,"domain_scores_codex":[0.9970641,0.0004195464,0.0007666958,0.0007033073,0.0007804183,0.0002659034],"domain_scores_gemma":[0.9976083,0.0006778223,0.0005045413,0.0008541893,0.0002759294,0.00007921239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008909644,0.00002392612,0.00525439,0.000001210032,0.00001169067,0.000001975143,0.001536071,0.9814086,8.501218e-7,0.002118602,0.0003443006,0.009209283],"study_design_scores_gemma":[0.00101634,0.00006711279,0.001128832,0.00004711923,0.0000261216,0.00001124199,0.0008185401,0.9949862,0.00001018208,0.0004414539,0.00125068,0.00019615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00731531,0.0001953245,0.9851884,0.0025839,0.0002848866,0.0004762826,0.00002287503,0.00005159154,0.003881425],"genre_scores_gemma":[0.6895655,0.0003577175,0.3090052,0.0001907444,0.0002366189,0.000007763082,0.0004035181,0.00003366317,0.0001992206],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6822502,"threshold_uncertainty_score":0.5567534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084046657","doi":"10.1016/j.disopt.2012.01.001","title":"Emergency path restoration problems","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Scheduling (production processes); Computer science; Path (computing); Time complexity; Node (physics); Computer network; Distributed computing; Mathematical optimization; Mathematics; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02471990667949928,"gpt":0.2708562861310064,"spread":0.2461363794515072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004384249,0.0001351027,0.000102211,0.000123662,0.0002016381,0.0001227157,0.0003541439,0.00007312315,0.0002579122],"category_scores_gemma":[0.00006793436,0.0001253711,0.00004775721,0.0006464201,0.00001838017,0.002549633,0.0001127547,0.00009310598,0.00009888375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004621119,"about_ca_system_score_gemma":0.00003312211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009646862,"about_ca_topic_score_gemma":0.000001589901,"domain_scores_codex":[0.9986262,0.0001263844,0.0002970582,0.0002454737,0.0003322665,0.0003726293],"domain_scores_gemma":[0.9991111,0.00001311959,0.0001301428,0.0004044706,0.0001647709,0.0001764658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002932874,0.00008609896,0.002920632,0.00002203896,0.000009745966,3.362431e-7,0.001688988,0.9158221,0.0001375055,0.07406121,0.003189594,0.002058752],"study_design_scores_gemma":[0.000189185,0.00004144222,0.0005430616,0.0000113452,0.000004134723,0.000002614811,0.00002744273,0.9946676,0.00008001074,0.0004243473,0.00380818,0.0002006195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001596968,0.0002244505,0.9864433,0.0006331061,0.0005907208,0.0003215567,0.000002277864,0.0002694088,0.01135546],"genre_scores_gemma":[0.4131606,0.0006472453,0.5833369,0.0002125457,0.0002574722,0.0001153531,0.0002190646,0.00003685572,0.002013952],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4130009,"threshold_uncertainty_score":0.5112484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068748054","doi":"10.1016/j.disopt.2011.05.002","title":"Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Matching (statistics); Integer (computer science); Graph; Constructive; Mathematical optimization; Discrete mathematics; Graph coloring; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05271715870122828,"gpt":0.2790077682209249,"spread":0.2262906095196967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003816825,0.0002226701,0.0002022866,0.0001873165,0.0003151978,0.0001206522,0.0001240434,0.0001302408,0.000162855],"category_scores_gemma":[0.0001081244,0.0002420397,0.00004950493,0.0003435646,0.00005130019,0.0006269599,0.00006282007,0.0001793016,0.000006673576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001091565,"about_ca_system_score_gemma":0.00002173231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001149184,"about_ca_topic_score_gemma":0.00001432352,"domain_scores_codex":[0.9987544,0.0001089329,0.0003341353,0.000260067,0.0001527477,0.0003897565],"domain_scores_gemma":[0.9994308,0.00007419768,0.00008597912,0.0002133606,0.00007667999,0.0001190312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008812529,0.000009882788,0.0007133554,0.00004935832,0.00002822081,0.00000231801,0.001660003,0.9954739,0.0006251348,0.0005663254,0.00001413266,0.0008485134],"study_design_scores_gemma":[0.0002710455,0.00001118401,0.0003237609,0.0001096267,0.00005105129,0.00001088393,0.0004599603,0.9973753,0.000972072,0.0001053385,0.00002087624,0.0002888714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03588385,0.0001352984,0.9603801,0.00002908441,0.0002713708,0.0002531891,0.000009183523,0.0003765376,0.002661397],"genre_scores_gemma":[0.6282443,0.00007419266,0.371456,0.00002417787,0.00004829127,0.0000133321,0.00003763864,0.00006570903,0.00003637921],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5923604,"threshold_uncertainty_score":0.9870093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114675299","doi":"10.1016/j.disopt.2010.06.002","title":"The Delivery Man Problem with time windows","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Travelling salesman problem; Heuristic; Integer programming; Window (computing); Computer science; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.004443702601807077,"gpt":0.2073381164278795,"spread":0.2028944138260724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000292749,0.0001608318,0.0001092026,0.00005087367,0.0002552971,0.0001605237,0.0001930467,0.00009035366,0.0001309507],"category_scores_gemma":[0.0000354471,0.0001133254,0.00003154452,0.000286501,0.00006742566,0.0002456927,0.00002623443,0.000240193,0.00004342236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002327015,"about_ca_system_score_gemma":0.00002066607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003712311,"about_ca_topic_score_gemma":0.00001181412,"domain_scores_codex":[0.9991516,0.00004747345,0.0001997665,0.0001678692,0.0001820651,0.0002512075],"domain_scores_gemma":[0.9993715,0.00008424199,0.00005342299,0.0003200938,0.0001009186,0.00006976978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001078876,0.000003844435,0.0001939315,0.000007599917,0.00002070124,8.764058e-7,0.00008570444,0.9952537,0.001103973,0.0002672437,0.0003184074,0.002733178],"study_design_scores_gemma":[0.0002584758,0.00002112688,0.0001489899,0.00001230401,0.00001905506,0.00000863436,0.00002173137,0.9962091,0.0009268818,0.00002991472,0.002160989,0.0001827879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0138803,0.00004771307,0.9590134,0.0003055004,0.0002375351,0.0004991359,0.000008232161,0.0008180517,0.02519011],"genre_scores_gemma":[0.1261815,0.00007392123,0.8718902,0.00006391288,0.0001507899,0.00006991058,0.0001053464,0.0001330401,0.001331343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1123012,"threshold_uncertainty_score":0.4621278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013219867","doi":"10.1016/j.disopt.2010.09.003","title":"An exact algorithm for the network pricing problem","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal; Wilfrid Laurier University","funders":"","keywords":"Column generation; Network topology; Scheme (mathematics); Mathematical optimization; Algorithm; Computer science; Mathematics; Work (physics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005526421708420291,"gpt":0.2278157221231009,"spread":0.2222893004146806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001231435,0.0001259296,0.00009823575,0.00001751641,0.0001620234,0.00006174541,0.0002131727,0.0001132192,0.00001931719],"category_scores_gemma":[0.00003024582,0.00009224648,0.00003318852,0.0002159324,0.00005243912,0.0002510065,0.00002245338,0.0002168868,0.000002187807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000161061,"about_ca_system_score_gemma":0.000004628047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001128842,"about_ca_topic_score_gemma":0.000006842261,"domain_scores_codex":[0.9993381,0.000005938979,0.0001484265,0.0001493735,0.00007691294,0.0002812301],"domain_scores_gemma":[0.9994774,0.0001148508,0.00002940982,0.0003004544,0.00004217916,0.00003571871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001658086,0.000002944011,0.00001978769,0.000004923098,0.000009787014,1.660112e-7,0.00001879184,0.8902695,0.000120376,0.00194668,0.0001502813,0.1074551],"study_design_scores_gemma":[0.0001161593,0.00003024691,0.00004443458,0.000008250072,0.00001576469,0.000001340579,0.00003523328,0.9962278,0.0001478042,0.001606056,0.001629858,0.0001370434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000312011,0.0001040457,0.9970236,0.00009418635,0.0003477319,0.0004985542,0.000005427471,0.0009165739,0.0006978167],"genre_scores_gemma":[0.04597283,0.00009193987,0.9533262,0.0000254039,0.0003166869,0.0001394136,0.00005283185,0.0000511104,0.0000236373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.107318,"threshold_uncertainty_score":0.3761702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980190773","doi":"10.1016/j.disopt.2013.02.003","title":"A linear time algorithm for the Koopmans–Beckmann QAP linearization and related problems","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadratic assignment problem; Mathematics; Weapon target assignment problem; Mathematical optimization; Multiplicative function; Linearization; Assignment problem; Linear bottleneck assignment problem; Generalized assignment problem; Optimization problem; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.005582494992715322,"gpt":0.1959777075951276,"spread":0.1903952126024123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009231987,0.0001675886,0.0001267388,0.00006132412,0.0001896916,0.00009606239,0.0000850104,0.0001136547,0.00009333799],"category_scores_gemma":[0.00005721086,0.0001318851,0.00003380214,0.0001519168,0.00004876491,0.0003223834,0.00002164666,0.0001033147,0.00002730818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002755455,"about_ca_system_score_gemma":0.000006689215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009845711,"about_ca_topic_score_gemma":6.235223e-7,"domain_scores_codex":[0.9992543,0.00001515519,0.0002451398,0.0001915165,0.00009551459,0.0001983414],"domain_scores_gemma":[0.9995056,0.00009287324,0.00006133907,0.0001729863,0.0001160284,0.00005118135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001223258,0.000005277759,0.000003720334,0.00002457712,0.0000275743,9.028217e-8,0.0001329235,0.9869198,0.00004307713,0.0001214713,0.0002605847,0.01245964],"study_design_scores_gemma":[0.0003489055,0.00003256588,0.00005655687,0.00001908764,0.00003951677,0.000002780049,0.00002493112,0.9979522,0.0001955777,0.0005995759,0.0005488894,0.0001794083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009462376,0.0002361288,0.9973571,0.000187623,0.0001696633,0.0009347134,0.00001956093,0.0003749465,0.0006256111],"genre_scores_gemma":[0.09064643,0.001438402,0.9009346,0.00009768407,0.0002844897,0.0006936515,0.001930029,0.0002114782,0.003763232],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09642252,"threshold_uncertainty_score":0.5378119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894812324","doi":"10.1016/j.disopt.2023.100795","title":"Principled deep neural network training through linear programming","year":2023,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Office of Naval Research; Institut de Valorisation des Données; National Science Foundation","keywords":"Computer science; Deep learning; Polyhedron; Artificial intelligence; Artificial neural network; Linear programming; Perspective (graphical); Dependency (UML); Task (project management); Representation (politics); Sample (material); Function (biology); Machine learning; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04017734624734458,"gpt":0.2895398856964629,"spread":0.2493625394491183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378717,0.0002128354,0.0002051654,0.0001379996,0.0003138495,0.0002227489,0.000615901,0.00009880913,0.00001916953],"category_scores_gemma":[0.0001722186,0.0002119005,0.00008418348,0.002416539,0.00005187233,0.000908109,0.0002759902,0.0001361203,0.00002416529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004414388,"about_ca_system_score_gemma":0.00003597606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004824495,"about_ca_topic_score_gemma":0.000001781258,"domain_scores_codex":[0.998116,0.00007808072,0.0003756795,0.00051254,0.0003568407,0.0005609294],"domain_scores_gemma":[0.9990093,0.00008996257,0.0001831591,0.0004910667,0.000134621,0.00009184995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003862131,0.000008088374,0.00008195752,0.000007055783,0.00001048897,0.000005998399,0.001612352,0.955761,0.000003943111,0.03175353,0.00008937803,0.01066234],"study_design_scores_gemma":[0.0002319761,0.00007015122,0.00007238414,0.00002524846,0.00000911098,0.000007590823,0.0000997778,0.9972309,0.00003805693,0.001479221,0.0004936107,0.0002419125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001871664,0.00004300162,0.9942153,0.0005607739,0.0004408024,0.0005386477,0.000001395622,0.002790446,0.001222432],"genre_scores_gemma":[0.0510679,0.00003382201,0.9480601,0.0001942266,0.0001787391,0.0001478244,0.0001580378,0.0000407762,0.0001185773],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05088073,"threshold_uncertainty_score":0.8641052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2923556723","doi":"10.1016/j.disopt.2019.03.004","title":"Combinatorial optimization with interaction costs: Complexity and solvable cases","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Parameterized complexity; Combinatorial optimization; Matroid; Mathematics; Quadratic assignment problem; Diagonal; Combinatorics; Matrix (chemical analysis); Mathematical optimization; Intersection (aeronautics); Rank (graph theory); Optimization problem; Computational complexity theory; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0148475165915815,"gpt":0.239395156831513,"spread":0.2245476402399315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001249623,0.0001340222,0.0001314243,0.0001000047,0.0001292293,0.0004940979,0.0002393721,0.00003706784,0.00008537112],"category_scores_gemma":[0.0000177969,0.0001171226,0.00001702438,0.0003062956,0.00004011503,0.002565645,0.0001802842,0.0000704629,0.00001615947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005710165,"about_ca_system_score_gemma":0.00001674526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007948567,"about_ca_topic_score_gemma":0.000005669909,"domain_scores_codex":[0.9990652,0.00004635282,0.0001526732,0.0003610928,0.0002095226,0.0001652174],"domain_scores_gemma":[0.999366,0.00003907188,0.0001216511,0.0003280105,0.00009191054,0.00005333994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000533781,0.00004902344,0.0010999,0.00002379565,0.00002508998,0.000006064646,0.00009222897,0.9061905,0.000006719705,0.09039252,0.0002388433,0.00182198],"study_design_scores_gemma":[0.0007985167,0.0001860358,0.000148212,0.00003389612,0.00001198824,0.00001025528,0.00009641975,0.997822,0.00004326311,0.0002168895,0.0004554027,0.000177078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002153324,0.00001729327,0.9892972,0.0002386199,0.0005798664,0.0003635479,0.000008628362,0.0001455233,0.007196018],"genre_scores_gemma":[0.5039415,0.00009309174,0.4945109,0.0001922899,0.0001004843,0.0000252373,0.0007411702,0.00002667844,0.0003685645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5017882,"threshold_uncertainty_score":0.4776119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070134421","doi":"10.1016/j.disopt.2010.09.002","title":"Strengthening lattice-free cuts using non-negativity","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Negativity effect; Lattice (music); Algorithm; Cognitive psychology; Psychology; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01331334693684623,"gpt":0.2658952204674746,"spread":0.2525818735306284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003803287,0.0002275255,0.0002034038,0.0001443212,0.0001739052,0.0001218024,0.0002672225,0.0001777612,0.0002026492],"category_scores_gemma":[0.0003743549,0.0002499199,0.00006347978,0.0004450704,0.00005038331,0.0005040528,0.00008008471,0.000371314,0.000009517537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004780588,"about_ca_system_score_gemma":0.00002732982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001821722,"about_ca_topic_score_gemma":0.00001240938,"domain_scores_codex":[0.9988106,0.00005781472,0.0003331101,0.0002533269,0.0002258604,0.0003192316],"domain_scores_gemma":[0.999042,0.0001049456,0.00009204416,0.0005437571,0.000103181,0.0001140329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003557193,0.000008318727,0.0008038559,0.00002347252,0.00001912487,0.000001168057,0.0002409237,0.9872496,0.01033712,0.0001799583,0.00006345793,0.0010695],"study_design_scores_gemma":[0.0004028547,0.000008804565,0.000272337,0.00002575446,0.00003325237,0.000006219895,0.00003992092,0.9914193,0.007294088,0.0001041445,0.0001032199,0.0002900806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1049424,0.00001242881,0.8870531,0.00003871847,0.0006417223,0.0001836454,0.0000172461,0.0004164581,0.006694266],"genre_scores_gemma":[0.385296,0.000008692391,0.6143687,0.0000159052,0.0001353093,0.000007107777,0.00003655844,0.00006977809,0.00006190988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2803535,"threshold_uncertainty_score":0.9999953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163661406","doi":"10.1016/j.disopt.2012.10.002","title":"A bad example for the iterative rounding method for mincost <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si52.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected spanning subgraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Norm (philosophy); Algorithm; Discrete mathematics; Iterative method; Iterative refinement; Relaxation (psychology); Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02173933753129435,"gpt":0.2639957199895441,"spread":0.2422563824582497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007623275,0.0003115947,0.0002087316,0.000127518,0.0005156173,0.0003015388,0.0002719599,0.0003106475,0.00002251252],"category_scores_gemma":[0.000320588,0.0003121226,0.0002940497,0.0003051417,0.00006413725,0.000816663,0.00008605369,0.000221736,0.0000143446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002930746,"about_ca_system_score_gemma":0.00004217385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009959757,"about_ca_topic_score_gemma":0.00002852665,"domain_scores_codex":[0.9983074,0.00006355561,0.0004419438,0.0003469365,0.0002554895,0.0005846597],"domain_scores_gemma":[0.9983281,0.000805949,0.0002295151,0.0004239844,0.00008737166,0.0001250581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001236831,0.00003031602,0.00002004251,0.0001793561,0.0002230201,0.00000262111,0.002143817,0.1113006,0.003221133,0.8808284,0.0004714951,0.001455514],"study_design_scores_gemma":[0.000492869,0.0001586106,0.00002914139,0.0001609985,0.0002266107,0.00002036902,0.0004430785,0.9800216,0.01638635,0.0002018305,0.001523428,0.0003351181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1764479,0.0003800692,0.821523,0.00005582605,0.0004276618,0.0002740093,0.0001246789,0.0003319612,0.0004348665],"genre_scores_gemma":[0.7591885,0.000129768,0.2380632,0.000135982,0.0004526024,0.001034017,0.0007784248,0.0001752309,0.00004229787],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8806266,"threshold_uncertainty_score":0.9999331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008488464","doi":"10.1016/j.disopt.2007.11.003","title":"Solving mirrored traveling tournament problem benchmark instances with eight teams","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Mathematical optimization; Mathematics; Travelling salesman problem; Computer science; Tournament selection; Operations research; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05474765679449342,"gpt":0.3143357916928812,"spread":0.2595881348983878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064921,0.0002051893,0.0002869747,0.0002319628,0.0008845376,0.0002813005,0.000410066,0.00008384445,0.0003895995],"category_scores_gemma":[0.0004892153,0.0001398515,0.00009913357,0.00123826,0.0001541541,0.0007035015,0.00004716985,0.0001725057,0.00004635176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000752917,"about_ca_system_score_gemma":0.0001929385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006235853,"about_ca_topic_score_gemma":0.0000449761,"domain_scores_codex":[0.9970905,0.000127252,0.0006283617,0.0005519423,0.001209361,0.0003926395],"domain_scores_gemma":[0.9983963,0.0002366873,0.0003478669,0.0004309998,0.0004335014,0.0001545899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004564511,0.00004900317,0.007040879,0.000002920464,0.00002884898,0.000009457528,0.001605296,0.9886822,0.00007449938,0.0004701262,0.0004999269,0.00149125],"study_design_scores_gemma":[0.001310707,0.0002147681,0.004068654,0.0001662091,0.00006744394,0.00008633085,0.002590092,0.9853888,0.0006078221,0.002292826,0.002605051,0.0006013445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1130983,0.0004110846,0.8681722,0.0009884197,0.0002758168,0.0003648154,0.00001741902,0.0001234338,0.01654842],"genre_scores_gemma":[0.6650531,0.00009179959,0.3333602,0.0000727994,0.00006777324,0.00002269089,0.00004435941,0.00001838953,0.001268964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5519547,"threshold_uncertainty_score":0.6803237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115713772","doi":"10.1016/j.disopt.2008.01.001","title":"A sequential elimination algorithm for computing bounds on the clique number of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Clique graph; Clique problem; Mathematics; Clique; Block graph; Simplex graph; Upper and lower bounds; Split graph; Branch and bound; Combinatorics; Graph; Computation; Algorithm; Discrete mathematics; Line graph; Graph power; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.03037697177775578,"gpt":0.2851965819208649,"spread":0.2548196101431092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003229784,0.0001270241,0.0001406443,0.0000928116,0.0004440852,0.00007193668,0.0004426467,0.00005924912,0.00001653445],"category_scores_gemma":[0.00005744183,0.0001015071,0.0001355175,0.000509405,0.0001275155,0.0002735122,0.00009547338,0.0000934137,0.000002491728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002456526,"about_ca_system_score_gemma":0.00004679623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002208726,"about_ca_topic_score_gemma":0.000001544946,"domain_scores_codex":[0.9989036,0.0000907933,0.0002743238,0.0002718506,0.0002692525,0.0001901185],"domain_scores_gemma":[0.9990168,0.0002178795,0.0001907132,0.0003292191,0.0002108543,0.0000344979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003186111,0.0002131696,0.0002035859,0.00003468681,0.00008148729,0.000005381215,0.003198231,0.2544032,0.00006478233,0.6738814,0.000853181,0.06702907],"study_design_scores_gemma":[0.0003096027,0.00009023795,0.0002465321,0.00002794316,0.00000729985,0.00001899049,0.00003460756,0.991401,0.0008190744,0.006806163,0.0001128017,0.0001258179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002777471,0.00001094202,0.9948063,0.0006982392,0.0002746339,0.0003451415,0.00001508044,0.00007943479,0.000992767],"genre_scores_gemma":[0.311536,0.00002783201,0.6879593,0.0002280484,0.00009373495,0.00002953513,0.00005399735,0.00001251736,0.00005899628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7369977,"threshold_uncertainty_score":0.4139341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090914983","doi":"10.1016/j.disopt.2011.01.001","title":"Valid inequalities and branch-and-cut for the clique pricing problem","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; HEC Montréal","funders":"","keywords":"Branch and cut; Mathematics; Polyhedron; Clique; Integer programming; Mathematical optimization; Inequality; Linear programming; Embedding; Flow network; Cutting-plane method; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04587999302022705,"gpt":0.2986937075859502,"spread":0.2528137145657231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004555589,0.00007024152,0.0000768738,0.00003753749,0.0005686823,0.00007696164,0.00005722251,0.00006081179,0.00003026329],"category_scores_gemma":[0.00008671486,0.00005437969,0.00002006242,0.0001122358,0.0001216191,0.0002822984,0.000005967252,0.00004125083,3.873102e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001030528,"about_ca_system_score_gemma":0.00003535779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006212598,"about_ca_topic_score_gemma":0.0002902607,"domain_scores_codex":[0.9993992,0.00006743337,0.0001576077,0.0001379061,0.0001046688,0.0001331969],"domain_scores_gemma":[0.9995687,0.0001497428,0.00008816181,0.00006017322,0.00009189454,0.00004133571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001453422,0.00003158209,0.0268856,0.0001273912,0.00006301232,5.406197e-7,0.2981934,0.2960869,0.00001643196,0.3708266,0.0002567832,0.007366382],"study_design_scores_gemma":[0.004534669,0.000736515,0.06022049,0.0005292789,0.0007396126,0.00000642243,0.09854063,0.7790857,0.0009026443,0.03432583,0.01834946,0.002028748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007962426,0.0001789795,0.9821081,0.0009808035,0.0001025935,0.0006223628,0.00001696101,0.0001022991,0.007925496],"genre_scores_gemma":[0.9434117,0.0006932203,0.0547088,0.0001730322,0.00007039579,0.00007669467,0.00007194981,0.00001484592,0.0007793625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9354493,"threshold_uncertainty_score":0.4373902,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986491739","doi":"10.1016/j.disopt.2008.09.001","title":"Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi; Memorial University of Newfoundland","funders":"","keywords":"Divide and conquer algorithms; Computer science; Scheduling (production processes); Parallel computing; Conjecture; Schedule; Class (philosophy); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01772737265669138,"gpt":0.2472389947255821,"spread":0.2295116220688907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243109,0.0002093932,0.0002784552,0.0001466781,0.0001442275,0.00003559324,0.0001150865,0.000138724,0.00002772377],"category_scores_gemma":[0.0002341649,0.0002065567,0.00009089785,0.0002668825,0.0001041444,0.000242518,0.00002189626,0.0001195725,0.000003089818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002373756,"about_ca_system_score_gemma":0.00002349096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003986732,"about_ca_topic_score_gemma":6.990094e-7,"domain_scores_codex":[0.9987555,0.00002723443,0.0004675286,0.0002728876,0.0002319596,0.0002449314],"domain_scores_gemma":[0.9993358,0.00009465736,0.0001008451,0.0001970002,0.0001675016,0.0001042309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004652612,0.00002680394,0.0006013679,0.0001004343,0.00004435323,0.00000112385,0.000282707,0.9967763,0.00003524984,0.001754703,0.00004849553,0.000281923],"study_design_scores_gemma":[0.0008058599,0.00006731578,0.0003681399,0.00006238395,0.00003868281,0.000006660208,0.00005080805,0.9972374,0.0007005297,0.0003962058,0.00002173854,0.0002442661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03495982,0.000213156,0.9632294,0.0001314945,0.000174764,0.0004646277,0.00003770839,0.0002287003,0.0005602943],"genre_scores_gemma":[0.5654709,0.0002470952,0.433852,0.00004349603,0.00004917876,0.00008272401,0.0001605443,0.00004527095,0.00004883275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5305111,"threshold_uncertainty_score":0.8423138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976051387","doi":"10.1016/j.disopt.2008.12.004","title":"A Benders approach for computing lower bounds for the mirrored traveling tournament problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Tournament; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Mathematics; Tournament selection; Upper and lower bounds; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.107184687758087,"gpt":0.382185916378766,"spread":0.275001228620679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002574597,0.0001500874,0.0002071653,0.0001102137,0.0009957278,0.0006207232,0.0004300314,0.00007782656,0.00001819756],"category_scores_gemma":[0.001043413,0.00009651772,0.0002331033,0.000531185,0.00005241294,0.0002108154,0.00002264412,0.00009353835,0.000002197469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004735213,"about_ca_system_score_gemma":0.00007091594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007874716,"about_ca_topic_score_gemma":0.000002074074,"domain_scores_codex":[0.9980841,0.00005868141,0.0005429601,0.0004327815,0.0005174792,0.0003639922],"domain_scores_gemma":[0.9981214,0.0007702323,0.0002721612,0.0003461842,0.0004153757,0.0000746087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005616245,0.00004765323,0.00002235971,0.000002864944,0.00002253001,5.647117e-8,0.0006428819,0.9862167,0.0000273687,0.002623122,0.0007964669,0.009541853],"study_design_scores_gemma":[0.0006663783,0.0001186358,0.0001055401,0.00001293053,0.00006071318,0.000001978197,0.001326025,0.9915622,0.00003316566,0.004966252,0.001005998,0.0001401832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006502611,0.0001616261,0.993755,0.003061305,0.0002606387,0.001032345,0.00002136403,0.00006178504,0.000995675],"genre_scores_gemma":[0.4400842,0.000005655114,0.5590467,0.0002393343,0.0001125166,0.0000424902,0.00006403602,0.00001159991,0.0003934804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4394339,"threshold_uncertainty_score":0.7658435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3081538319","doi":"10.1016/j.disopt.2020.100610","title":"BDD-based optimization for the quadratic stable set problem","year":2020,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary decision diagram; Quadratic programming; Solver; Mathematical optimization; Quadratic equation; Mathematics; Integer programming; Representation (politics); Set (abstract data type); Quadratic unconstrained binary optimization; Computer science; Optimization problem; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.08705139819538114,"gpt":0.3602594812897527,"spread":0.2732080830943715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354025,0.0002897172,0.0003042887,0.00009392267,0.0005127824,0.0002297936,0.0004120735,0.0001293109,0.0007986609],"category_scores_gemma":[0.001592269,0.0002247069,0.0001281824,0.000862108,0.0001005375,0.0005014417,0.00007665592,0.0001998915,0.0000133146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001005798,"about_ca_system_score_gemma":0.000200813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005955298,"about_ca_topic_score_gemma":0.000004047506,"domain_scores_codex":[0.9977933,0.0001484342,0.0005635663,0.0004883711,0.0005515482,0.0004547433],"domain_scores_gemma":[0.9975981,0.0008974341,0.0003084518,0.0004377316,0.0005744328,0.0001838832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001132095,0.00003737241,0.00001401429,0.0001738518,0.00003831022,7.377215e-7,0.0004253886,0.9917393,0.00001469497,0.00420909,0.002743431,0.0004905487],"study_design_scores_gemma":[0.001280152,0.0001409003,9.74901e-7,0.00003238872,0.00007669815,8.38004e-7,0.0003562518,0.9947708,0.000347301,0.00148504,0.001227494,0.0002811153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001214228,0.00007582751,0.9885487,0.007474998,0.00007564727,0.002643809,0.0001161276,0.0003006198,0.0007521485],"genre_scores_gemma":[0.004708489,0.00006577653,0.9923094,0.0008269899,0.000163133,0.0006206809,0.0006674067,0.0001359426,0.0005022016],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006648007,"threshold_uncertainty_score":0.9163283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968959377","doi":"10.1016/j.disopt.2005.10.007","title":"How to recycle your facets","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Educational Foundation of America; HEC Montréal; Belgian American Educational Foundation","keywords":"Facet (psychology); Polytope; Mathematics; Construct (python library); Combinatorics; Polyhedral combinatorics; Mathematical optimization; Computer science; Geometry; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01748651244667104,"gpt":0.2802205927815007,"spread":0.2627340803348296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001505181,0.0001024644,0.00008974989,0.0001493119,0.0001305334,0.0003349527,0.0005304511,0.00003962816,0.00001380158],"category_scores_gemma":[0.00006797445,0.0000973815,0.00003671803,0.0007213426,0.00002458786,0.0008311907,0.0001758304,0.00006978113,0.00003425012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003834758,"about_ca_system_score_gemma":0.00001755354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001204649,"about_ca_topic_score_gemma":0.000005088852,"domain_scores_codex":[0.9989257,0.00006174183,0.0001083881,0.0003414177,0.0002778049,0.0002849645],"domain_scores_gemma":[0.9992808,0.00002560438,0.00004307454,0.0004582316,0.0001049862,0.0000873012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008388226,0.00001700403,0.000172499,0.000003518284,0.000003165809,0.000003626477,0.0001136315,0.8956466,0.001312274,0.09707227,0.0007049796,0.004942047],"study_design_scores_gemma":[0.0003662697,0.0000968069,0.0008188788,0.00001572279,0.000002833302,0.000005723576,0.00005860907,0.9611083,0.007315007,0.02388349,0.005986789,0.0003415261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001499202,0.00003665076,0.989228,0.003625886,0.00009879256,0.0002306975,0.000003868201,0.0001772925,0.005099601],"genre_scores_gemma":[0.4082297,0.000006881015,0.586693,0.0001368306,0.00006943197,0.00003415538,0.00002686536,0.00001818834,0.004784865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4067305,"threshold_uncertainty_score":0.3971102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3187519750","doi":"10.1016/j.disopt.2021.100657","title":"The Bipartite Boolean Quadric Polytope","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Quadric; Combinatorics; Discrete mathematics; Bipartite graph; Clique; Duality (order theory); Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.004837548440651212,"gpt":0.1978723109585278,"spread":0.1930347625178766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007215102,0.0000818691,0.00006620461,0.00002384732,0.0001167485,0.0001009293,0.00008282963,0.00004532211,0.00007442736],"category_scores_gemma":[0.0000253089,0.00006420299,0.0000374161,0.0002158819,0.00001843424,0.0001181243,0.00001778222,0.00006958542,0.0000216175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000218222,"about_ca_system_score_gemma":0.00001065843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003224342,"about_ca_topic_score_gemma":0.000007772815,"domain_scores_codex":[0.9995132,0.00002425867,0.000128035,0.0000955112,0.0000884345,0.0001505748],"domain_scores_gemma":[0.9996733,0.0000239641,0.00001602842,0.0002113579,0.00004053592,0.00003480706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004135953,0.000008419239,0.00026414,0.00001883485,0.0000355788,0.000009897046,0.0001687746,0.9670947,0.003865148,0.004362117,0.007710049,0.01645825],"study_design_scores_gemma":[0.00009938059,0.00001327952,0.0002180938,0.00001857452,0.00001471232,0.000006557165,0.00007048294,0.9580578,0.02398422,0.0002885869,0.01705266,0.0001756696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009865656,0.001536586,0.9722475,0.0002724307,0.0002211682,0.0001053236,0.00000571393,0.0006387547,0.02398599],"genre_scores_gemma":[0.9662557,0.002976264,0.02782762,0.0001477211,0.000169124,0.00005552914,0.0001412091,0.00007752267,0.002349257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9652692,"threshold_uncertainty_score":0.2618122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077167828","doi":"10.1016/j.disopt.2010.10.003","title":"Charge and reduce: A fixed-parameter algorithm for String-to-String Correction","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"String (physics); String searching algorithm; String metric; Algorithm; Boyer–Moore string search algorithm; Mathematics; Approximate string matching; Character (mathematics); Commentz-Walter algorithm; Computer science; Discrete mathematics; Pattern matching; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01030520164605645,"gpt":0.2627092934732544,"spread":0.252404091827198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001789593,0.0001352434,0.0001250631,0.0001179397,0.0002299212,0.0002943852,0.0002714862,0.00008648187,0.00001795613],"category_scores_gemma":[0.0001080909,0.0001247671,0.00003532953,0.0002384758,0.00001868837,0.0007658858,0.000196644,0.0001329156,0.000007318369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158799,"about_ca_system_score_gemma":0.00002415228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001705274,"about_ca_topic_score_gemma":0.000002691392,"domain_scores_codex":[0.9989918,0.00001813272,0.0001798062,0.0004355437,0.0001516963,0.0002230013],"domain_scores_gemma":[0.9992567,0.00007300564,0.00008506013,0.0003535347,0.000104891,0.0001268246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002595147,0.0000637394,0.0002018291,0.00002123596,0.00002102769,0.000002148218,0.0005385537,0.02194977,0.005255904,0.003675286,0.003806061,0.9644385],"study_design_scores_gemma":[0.0003195628,0.00008198355,0.0001955492,0.00002377579,0.000006521702,0.000009952775,0.00001121069,0.9916376,0.005137717,0.0001127511,0.00228909,0.0001742696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003797338,0.00001943471,0.9937357,0.0002054308,0.001589814,0.0004030049,0.00002510631,0.000129542,0.00009461177],"genre_scores_gemma":[0.02958014,0.00002123109,0.9695107,0.0001007015,0.0002138722,0.00008010321,0.0001170707,0.0000179671,0.000358267],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9696879,"threshold_uncertainty_score":0.5087856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023058821","doi":"10.1016/j.disopt.2009.05.003","title":"Chip firing and all-terminal network reliability bounds","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Reliability (semiconductor); Bounding overwatch; Terminal (telecommunication); Computer science; Chip; Reliability theory; Graph; Mathematics; Graph theory; Reliability engineering; Algorithm; Combinatorics; Theoretical computer science; Failure rate; Engineering; Statistics; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02141643991881777,"gpt":0.3003653373785734,"spread":0.2789488974597557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731769,0.00009952352,0.0001108173,0.00002310617,0.0001937107,0.00005520321,0.00007525214,0.00005812281,0.00004391486],"category_scores_gemma":[0.00008012222,0.00009127744,0.00003627908,0.0001377159,0.00004719511,0.0001379635,0.00001933017,0.00007814742,0.000002296699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001162562,"about_ca_system_score_gemma":0.000006813739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.772453e-7,"about_ca_topic_score_gemma":0.000001185051,"domain_scores_codex":[0.9993386,0.00004589471,0.0001821367,0.000191499,0.00008182225,0.000160013],"domain_scores_gemma":[0.9995157,0.00008085041,0.00007658009,0.0002406491,0.00003059959,0.00005567381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005411108,0.0001094668,0.0009762539,0.00004575891,0.00002590398,0.000002142596,0.000658372,0.1300828,0.0001080414,0.8627055,0.001493843,0.003737789],"study_design_scores_gemma":[0.0002459341,0.00005837865,0.002461225,0.00003710315,0.00006817723,0.00001044418,0.00002771363,0.1180077,0.00007147535,0.8781995,0.0006244032,0.0001879549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4642242,0.0001896141,0.5170193,0.002128881,0.0001149385,0.0007569846,0.00001317467,0.0003507573,0.01520221],"genre_scores_gemma":[0.9062754,0.00003665199,0.09319792,0.0001490111,0.00008648246,0.00001621925,0.00003992498,0.00001092028,0.0001874964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4420512,"threshold_uncertainty_score":0.3722186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087975652","doi":"10.1016/j.disopt.2008.10.002","title":"On the polyhedral lift-and-project methods and the fractional stable set polytope","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Mathematics; Conjecture; Combinatorics; Lift (data mining); Operator (biology); Polyhedral combinatorics; Set (abstract data type); Polyhedron; Symmetry (geometry); Birkhoff polytope; Discrete mathematics; Computer science; Geometry; Regular polygon","retraction":null,"screen_n_in":null,"score":{"opus":0.08774811797470744,"gpt":0.4213729508608465,"spread":0.3336248328861391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009441262,0.0001798903,0.0002119011,0.0001020173,0.0007858965,0.0001004223,0.0001639254,0.00007937811,0.0002807364],"category_scores_gemma":[0.001941854,0.00009985884,0.00004990805,0.0003824595,0.0004368935,0.0002895864,0.0001235703,0.0002917892,0.000005036257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004115125,"about_ca_system_score_gemma":0.00007267009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000042407,"about_ca_topic_score_gemma":0.000002546586,"domain_scores_codex":[0.9982032,0.000601595,0.0002666808,0.0002830239,0.0003955114,0.0002499656],"domain_scores_gemma":[0.997016,0.002299706,0.0001456622,0.0003377878,0.0001415978,0.00005928904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00079567,0.0000940918,0.0001393217,0.00004510434,0.0001848745,0.000009507422,0.00455312,0.4561091,0.00004219153,0.5285299,0.006890368,0.00260676],"study_design_scores_gemma":[0.001129527,0.00004724229,0.00005326193,0.00001573974,0.00002490935,0.00005404987,0.000532626,0.9769164,0.0001429616,0.02029046,0.0006310538,0.0001617734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001321551,0.0001676549,0.9901849,0.00365545,0.00007191705,0.0007425355,0.00002772504,0.00007199442,0.003756274],"genre_scores_gemma":[0.02376612,0.001343312,0.9690571,0.0008541615,0.0001333722,0.0001880509,0.00007312296,0.00007851607,0.004506242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5208073,"threshold_uncertainty_score":0.604456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999004550","doi":"10.1016/j.disopt.2014.01.001","title":"The quadratic balanced optimization problem","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Quadratic equation; Sequential quadratic programming; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.007785666697622099,"gpt":0.2354429841984911,"spread":0.227657317500869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007704856,0.0001925635,0.0001577145,0.00009560929,0.0007481205,0.00085799,0.0008714455,0.00008404893,0.00005113382],"category_scores_gemma":[0.0002211938,0.0001392038,0.00006583469,0.0007415091,0.00008238824,0.0009862737,0.000167993,0.0001413126,0.00004147338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004931087,"about_ca_system_score_gemma":0.00006669731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008087029,"about_ca_topic_score_gemma":0.000005786737,"domain_scores_codex":[0.9980121,0.0003093431,0.0004037752,0.000425094,0.0004431669,0.0004065554],"domain_scores_gemma":[0.9984979,0.0001822423,0.0002013131,0.0007050864,0.0002800428,0.0001334199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004803047,0.00001471427,0.00003809469,0.000007510818,0.00000782426,2.150475e-7,0.0001697177,0.9165211,0.00001004377,0.07848099,0.0004641814,0.004280759],"study_design_scores_gemma":[0.000400867,0.00007420227,0.00002498263,0.00001826968,0.000005121281,0.000002750061,0.00002414782,0.9949742,0.00005113534,0.001449299,0.002776656,0.0001983602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009022885,0.00004629393,0.9763978,0.003991984,0.0002401279,0.0004787383,0.000001202402,0.0003419399,0.01849291],"genre_scores_gemma":[0.04415144,0.0002764262,0.9529487,0.0006275635,0.00009620572,0.00013181,0.00009409658,0.00003605301,0.001637687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07845306,"threshold_uncertainty_score":0.8273617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986446280","doi":"10.1016/j.disopt.2012.05.002","title":"Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Clique problem; Clique; Combinatorics; Approximation algorithm; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Time complexity; Integer (computer science); Branch and bound; Mathematical optimization; Discrete mathematics; Algorithm; Chordal graph; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02307915925681601,"gpt":0.2736800363920509,"spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203407,0.0001182558,0.0001867827,0.0001844111,0.0002853432,0.0001226843,0.0004862555,0.00005117041,0.00002214024],"category_scores_gemma":[0.00001934861,0.00009084869,0.0001552613,0.001187603,0.00007063785,0.0009961926,0.0001097323,0.00006582205,7.796485e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001742505,"about_ca_system_score_gemma":0.00001883942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003714985,"about_ca_topic_score_gemma":0.00001039688,"domain_scores_codex":[0.9989417,0.0000769939,0.0002799813,0.0002326934,0.0001915345,0.0002771401],"domain_scores_gemma":[0.9990117,0.0001096084,0.0001897506,0.0004716793,0.0001439231,0.00007334605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007317036,0.0001425496,0.0006800777,0.00002263011,0.0003587156,2.304355e-7,0.001748594,0.7772338,0.00001643919,0.06157649,0.00002929017,0.1581839],"study_design_scores_gemma":[0.0001582351,0.00005109292,0.0007612508,0.000007965163,0.0002024628,0.000001385805,0.0000862766,0.9956384,0.000224166,0.002581936,0.0001597091,0.0001271401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002466929,0.000104265,0.9985096,0.0001756937,0.0001660354,0.0003654426,0.00003802273,0.00007906991,0.0003152119],"genre_scores_gemma":[0.05510808,0.00002646655,0.9443288,0.00007708454,0.00009315988,0.0001248001,0.0002002288,0.00001113229,0.00003020297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2184046,"threshold_uncertainty_score":0.3704702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02012742426041067,"gpt":0.2707476361752828,"spread":0.2506202119148722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00100084,0.0003917059,0.0002739925,0.0001542644,0.002051993,0.000804919,0.001260694,0.0002850931,0.000009203649],"category_scores_gemma":[0.0003261277,0.0003462219,0.0002874557,0.0003085718,0.0004523656,0.001074598,0.000597143,0.0004511661,0.00009175299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001806125,"about_ca_system_score_gemma":0.0001495544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004427515,"about_ca_topic_score_gemma":0.00002014772,"domain_scores_codex":[0.9970631,0.0001222722,0.0005112562,0.0009097264,0.0006770201,0.0007166523],"domain_scores_gemma":[0.9969477,0.0006037748,0.0005255494,0.001497247,0.0001814796,0.0002442361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001373662,0.00007808116,0.000002881558,0.00005656667,0.0001070473,0.00003798695,0.000478996,0.0880162,0.0002918996,0.9038758,0.00007392748,0.006843215],"study_design_scores_gemma":[0.000859103,0.0003875118,0.00004268718,0.0002248715,0.00008533859,0.00006024826,0.00008626396,0.993951,0.0008261456,0.002588198,0.0005328686,0.0003557606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09048519,0.0002313863,0.9067416,0.000984285,0.000290291,0.0004499979,0.0002355001,0.0001881826,0.0003935493],"genre_scores_gemma":[0.3006951,0.001211677,0.6943742,0.0006180558,0.0006474738,0.0007759868,0.0006981443,0.0002661918,0.0007131788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9059348,"threshold_uncertainty_score":0.999899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919667091","doi":"10.1016/j.disopt.2019.03.002","title":"On the intrinsic volumes of intersections of congruent balls","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ball (mathematics); Mathematics; Combinatorics; Intersection (aeronautics); Pairwise comparison; Convex body; Euclidean space; Euclidean geometry; Geometry; Discrete mathematics; Regular polygon; Convex hull","retraction":null,"screen_n_in":null,"score":{"opus":0.02363428599131756,"gpt":0.2764234025157367,"spread":0.2527891165244192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002052668,0.00006989381,0.0001536436,0.0001148384,0.00002615077,0.00001093172,0.0001060302,0.00003472952,0.0006694751],"category_scores_gemma":[0.0005599454,0.00004614016,0.00006003552,0.0003221615,0.00003865586,0.00007794232,0.0000311342,0.0000534178,0.0000081193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001583456,"about_ca_system_score_gemma":0.00002002809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004027199,"about_ca_topic_score_gemma":0.000006409191,"domain_scores_codex":[0.9993645,0.00003749717,0.0002687231,0.0000863166,0.0001619069,0.00008106474],"domain_scores_gemma":[0.9989794,0.0004170925,0.0002147418,0.0002072474,0.0001683537,0.00001319018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000634747,0.0001072944,0.0005869049,0.0003506345,0.00009354547,1.530179e-7,0.001730406,0.05235502,0.0001115617,0.9428156,0.001141586,0.0006437981],"study_design_scores_gemma":[0.003654833,0.002689964,0.001467973,0.001804563,0.0004178629,0.00001070393,0.03155985,0.5539004,0.04491523,0.3570286,0.001374623,0.001175401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7493834,0.00007542448,0.2124678,0.0004618734,0.0003867651,0.000627371,0.00005993662,0.00004166895,0.03649568],"genre_scores_gemma":[0.9966126,0.00003118582,0.002252622,0.00003796062,0.00001261709,0.000008117278,0.00001218662,0.000009547244,0.001023168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.585787,"threshold_uncertainty_score":0.7330282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981813514","doi":"10.1016/j.disopt.2005.03.005","title":"Multiroute flows: Cut-trees and realizability","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Realizability; Mathematics; Characterization (materials science); Combinatorics; Diagonal; Simple (philosophy); Context (archaeology); Discrete mathematics; Tree (set theory); Matrix (chemical analysis); Flow network; Integer (computer science); Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006429571201527289,"gpt":0.215421699780067,"spread":0.2089921285785397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007608257,0.0001061634,0.00009789769,0.00004492513,0.00004173977,0.00003726056,0.0000532132,0.00007174211,0.00005255138],"category_scores_gemma":[0.00001616895,0.00010246,0.00002330736,0.00008184054,0.00002141437,0.0002539297,0.00001531388,0.00005678135,0.000005249075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003311498,"about_ca_system_score_gemma":0.000002970594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001607108,"about_ca_topic_score_gemma":0.00003367019,"domain_scores_codex":[0.9995159,0.00001581995,0.0001420989,0.0001326993,0.00006946523,0.0001240162],"domain_scores_gemma":[0.9997468,0.00001346098,0.00001522617,0.0001547361,0.00002191662,0.00004789005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004003396,0.000008283042,0.0006006711,0.00002256774,0.00001019566,5.130915e-7,0.0002755391,0.9756317,0.0007751755,0.0001506175,0.0004176386,0.02210313],"study_design_scores_gemma":[0.0001246855,0.00001361494,0.0007799493,0.00001276436,0.000009498379,0.000001837229,0.00001988664,0.9952716,0.002500131,0.00006635375,0.001065192,0.000134476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01924948,0.0003330469,0.9705532,0.00009936393,0.00005399534,0.0002164408,0.00001708346,0.0009509937,0.008526454],"genre_scores_gemma":[0.8721289,0.0004564991,0.1271614,0.00002778643,0.00006866045,0.00002136156,0.00005810302,0.00002563605,0.00005163675],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8528794,"threshold_uncertainty_score":0.4178198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036207413","doi":"10.1016/j.disopt.2011.02.004","title":"New bounds on the average distance from the Fermat–Weber center of a planar convex body","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convex body; Mathematics; Fermat's Last Theorem; Combinatorics; Conjecture; Regular polygon; Center (category theory); Planar; Upper and lower bounds; Plane (geometry); Geometry; Mathematical analysis; Convex hull; Crystallography","retraction":null,"screen_n_in":null,"score":{"opus":0.05430893569011083,"gpt":0.2672022445530197,"spread":0.2128933088629088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001930905,0.000135997,0.000170433,0.00003580555,0.0001218317,0.00005196474,0.0002682432,0.00005598093,0.001060883],"category_scores_gemma":[0.0002709685,0.00007242124,0.00007023515,0.0002331912,0.00005471359,0.0001410809,0.00003375904,0.0001041641,0.00001354317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001788797,"about_ca_system_score_gemma":0.00003086287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002072033,"about_ca_topic_score_gemma":0.0000234949,"domain_scores_codex":[0.9990827,0.00007176551,0.0002884592,0.0001467606,0.0002498268,0.0001604408],"domain_scores_gemma":[0.9988806,0.0004177796,0.0002139454,0.0003793789,0.00007360965,0.00003465545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002962884,0.0001504341,0.001843939,0.0001056034,0.0001932586,0.000003972707,0.0165496,0.0009841262,0.00001691208,0.9533573,0.0262028,0.0002956984],"study_design_scores_gemma":[0.004802504,0.0006583886,0.006184672,0.001263195,0.0004822001,0.00001357835,0.01049867,0.1019778,0.007970606,0.8375069,0.02695018,0.001691215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01686083,0.0001664934,0.9393926,0.001251513,0.0002400407,0.0004189489,0.0003100584,0.00005985801,0.0412996],"genre_scores_gemma":[0.9843713,0.0000990211,0.01197588,0.0006302323,0.0001207786,0.0000189603,0.0001412215,0.00003211678,0.002610517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9675105,"threshold_uncertainty_score":0.9998523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996281476","doi":"10.1016/j.disopt.2009.03.001","title":"The bipartite margin shop and maximum red matchings free of blue–red alternating cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Margin (machine learning); Mathematical optimization; Algorithm; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.006651385411043069,"gpt":0.2180696223689897,"spread":0.2114182369579466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001812124,0.0001418354,0.0001409675,0.0000722406,0.0001430469,0.0001038179,0.000175199,0.00006501185,0.00001910871],"category_scores_gemma":[0.0001014133,0.0001184357,0.0000381119,0.0002020363,0.00003661212,0.0001872758,0.00002923191,0.00009754179,0.000001188074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001874514,"about_ca_system_score_gemma":0.000006191824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006793438,"about_ca_topic_score_gemma":0.000002420462,"domain_scores_codex":[0.9991567,0.00002749214,0.0003017069,0.0001520074,0.0001734472,0.0001886887],"domain_scores_gemma":[0.9994867,0.00005438861,0.00008649963,0.0002540476,0.00006165956,0.00005668034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001134966,0.000005235074,0.0001884271,0.00001160032,0.00001722374,6.94328e-7,0.0002953883,0.9934813,0.0002666705,0.0002604393,0.0001277133,0.005333956],"study_design_scores_gemma":[0.0003996154,0.00002196341,0.0006812649,0.00004477262,0.00001686954,0.000002906237,0.000176843,0.9964903,0.001373512,0.000556737,0.00009357248,0.0001416521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09638609,0.0008982212,0.8959013,0.001996492,0.0003723629,0.0003197725,0.00002527217,0.000469734,0.003630803],"genre_scores_gemma":[0.6552184,0.001066489,0.3432166,0.00007808281,0.000112488,0.00001280429,0.00008598991,0.00005412671,0.0001550101],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5588323,"threshold_uncertainty_score":0.4829667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081923266","doi":"10.1016/j.disopt.2005.11.001","title":"Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Edmond de Rothschild Foundation; University of Haifa","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Transitive relation; Vertex (graph theory); Discrete mathematics; Time complexity; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01092403794040013,"gpt":0.2639048718195904,"spread":0.2529808338791902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002378845,0.0001681373,0.0001815248,0.0003509352,0.0001581628,0.0001427614,0.000308198,0.00007022441,0.00001222357],"category_scores_gemma":[0.00002639554,0.0001656767,0.00004182166,0.0008952197,0.000114734,0.0008711408,0.00009719954,0.0001544143,0.000003300742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004638874,"about_ca_system_score_gemma":0.00002251941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006630516,"about_ca_topic_score_gemma":0.00005940466,"domain_scores_codex":[0.9985307,0.0001463612,0.0002480313,0.0004708122,0.0002464992,0.000357607],"domain_scores_gemma":[0.9993797,0.0001377321,0.00007079874,0.0002805372,0.00006411535,0.00006714257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000197766,0.0003867597,0.01526835,0.00008641653,0.00004626711,0.0001115356,0.002767106,0.2750591,0.0139191,0.6678979,0.00007437456,0.02418538],"study_design_scores_gemma":[0.000729121,0.00007212375,0.01401504,0.00005993808,0.000004274228,0.00001042733,0.00008096675,0.9417709,0.001491013,0.04147549,0.00002782129,0.0002628807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05734142,0.0001963737,0.9398792,0.0002699375,0.00005178426,0.0002731009,0.00001022944,0.0001172734,0.00186065],"genre_scores_gemma":[0.9238585,0.00007779236,0.07584306,0.0000399538,0.00001531463,0.00002508715,0.00006502044,0.00001713652,0.00005809456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8665171,"threshold_uncertainty_score":0.6756099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2507811569","doi":"10.1016/j.disopt.2018.08.003","title":"Additive stabilizers for unstable graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Matching (statistics); Approximation algorithm; Chordal graph; Vertex cover; Maximal independent set; Edge cover; Discrete mathematics; Graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02361287613948265,"gpt":0.2739444552874977,"spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003358752,0.0003434126,0.0003441891,0.0002606721,0.0003197978,0.000477354,0.001269364,0.0002588945,0.0001119887],"category_scores_gemma":[0.0001148895,0.0003528284,0.000283427,0.0004391629,0.0001827449,0.0004749316,0.001049654,0.00025646,0.000008366823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008158947,"about_ca_system_score_gemma":0.0001893076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003366305,"about_ca_topic_score_gemma":0.00001072065,"domain_scores_codex":[0.9978424,0.00009015902,0.000374653,0.0009584319,0.0003228282,0.0004115347],"domain_scores_gemma":[0.997921,0.0001480706,0.0003113904,0.001017435,0.0004869096,0.0001152071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006009967,0.0001320455,0.00004306519,0.0002469021,0.0002120131,0.000005139083,0.001606869,0.7822602,0.000008302079,0.1865118,0.01384411,0.01506954],"study_design_scores_gemma":[0.0003143632,0.0001040806,0.00001658505,0.00009988493,0.00002848077,0.000001902402,0.00004499521,0.8825914,0.0002115884,0.1129759,0.003185087,0.000425739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00010529,0.0001201722,0.992031,0.0003822329,0.001775138,0.001027248,0.000483444,0.0003383564,0.003737116],"genre_scores_gemma":[0.008198366,0.000203228,0.9889076,0.0001952592,0.0002441181,0.0004104901,0.001485723,0.00004446569,0.0003107837],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1003312,"threshold_uncertainty_score":0.9998924,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006549279","doi":"10.1016/j.disopt.2007.12.002","title":"Minimum cycle factors in quasi-transitive digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006986559510435831,"gpt":0.189187229400176,"spread":0.1822006698897402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005688422,0.0001312165,0.0001440377,0.0001381339,0.00006053342,0.00001241662,0.00006985429,0.00007710901,0.00004659355],"category_scores_gemma":[0.000008413016,0.0001284648,0.00005918494,0.0003300799,0.00003730076,0.000221035,0.000004583814,0.00008234705,0.000008139655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002220465,"about_ca_system_score_gemma":0.000005264064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002493269,"about_ca_topic_score_gemma":0.00001739279,"domain_scores_codex":[0.9993641,0.0000418751,0.0001879501,0.0001321127,0.00009600016,0.000177921],"domain_scores_gemma":[0.9997663,0.00002649461,0.00002027221,0.0001226744,0.00001641082,0.00004779159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001013508,0.00001832788,0.00737045,0.0000189421,0.00001546856,0.00000864394,0.003462648,0.9879148,0.0004532804,0.0006412019,0.00003266483,0.00005342419],"study_design_scores_gemma":[0.0005985959,0.00005146659,0.01501747,0.00006003356,0.00001170097,0.000009235708,0.001239207,0.9796914,0.002554758,0.0002821531,0.00009119717,0.0003927489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8769119,0.0001374673,0.1136796,0.00001395015,0.0002517546,0.0001949857,0.00001998804,0.0002266321,0.008563748],"genre_scores_gemma":[0.999384,0.00008592539,0.0003282327,0.000007780572,0.00001987065,0.00001504684,0.00008421097,0.00002653644,0.00004835572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1224721,"threshold_uncertainty_score":0.5238642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015967296","doi":"10.1016/j.disopt.2005.08.008","title":"Berge’s theorem for the maximum charge problem","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Mathematics; Generalization; Combinatorics; Charge (physics); Graph; Matching (statistics); Discrete mathematics; Mathematical analysis; Statistics; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01185349235856581,"gpt":0.2624375729190806,"spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004488966,0.000118034,0.00009082053,0.0000721235,0.000348855,0.0001705101,0.0007493675,0.00004263081,0.00004222969],"category_scores_gemma":[0.00003986136,0.00007956,0.00007469219,0.0004412951,0.0000793549,0.0005069401,0.0001317729,0.00007919474,0.00001621613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002679589,"about_ca_system_score_gemma":0.0000269787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001230884,"about_ca_topic_score_gemma":0.00000538228,"domain_scores_codex":[0.9988921,0.00006185612,0.0001782319,0.000305575,0.0002364664,0.0003258183],"domain_scores_gemma":[0.9990562,0.0001858741,0.00008127585,0.0004999866,0.0001407595,0.00003587119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001372622,0.00001501206,0.00004056226,0.000006921211,0.000007052126,4.105553e-7,0.00006619934,0.2800309,0.00009977879,0.715303,0.0005500233,0.003866465],"study_design_scores_gemma":[0.0002730982,0.00003836011,0.00004181915,0.00000640331,0.000004989813,0.000001931837,0.00001387144,0.802227,0.0008378217,0.1928086,0.003628142,0.0001180013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004269584,0.0001556908,0.9901495,0.002011525,0.0001176698,0.00072748,0.00001047584,0.0001369387,0.006648043],"genre_scores_gemma":[0.1568438,0.00008280433,0.836946,0.000299849,0.0002716009,0.0006361507,0.000139568,0.00005886228,0.004721412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5224944,"threshold_uncertainty_score":0.3244362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975310381","doi":"10.1016/j.disopt.2013.07.004","title":"A polynomial time algorithm for unloading boxes off a gravity conveyor","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi; Polytechnique Montréal","funders":"","keywords":"Algorithm; Set (abstract data type); Time complexity; Mathematics; Polynomial; Dynamic programming; Mathematical optimization; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0061230829875364,"gpt":0.2052522143263091,"spread":0.1991291313387727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007074403,0.0001391625,0.0001466175,0.00005785554,0.0000793017,0.00009919885,0.0001032637,0.0000764669,0.000434783],"category_scores_gemma":[0.00001967075,0.0001336896,0.000061199,0.00009834574,0.00002310099,0.0002601052,0.00001612593,0.00005844602,0.0001087738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000376962,"about_ca_system_score_gemma":0.000008909207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000382928,"about_ca_topic_score_gemma":0.000001232703,"domain_scores_codex":[0.9993209,0.00001264646,0.0001887241,0.0001645701,0.00008648257,0.0002266634],"domain_scores_gemma":[0.999658,0.00002716979,0.0000313305,0.0001435279,0.00006789952,0.00007209356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003235871,0.000008486413,0.00001772017,0.00002331425,0.00002690708,4.31003e-7,0.0001402384,0.9154328,0.001416281,0.00003469848,0.005783732,0.07711221],"study_design_scores_gemma":[0.000169374,0.00002672619,0.00003072615,0.00001204997,0.00001395977,0.000001766643,0.00002115749,0.994987,0.003458704,0.00003881661,0.001058093,0.0001816362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002420223,0.000131976,0.9954543,0.0000608288,0.0002303714,0.0005160567,0.00003857816,0.0002039602,0.0009437194],"genre_scores_gemma":[0.4222231,0.0001723927,0.5728885,0.0001552526,0.0005188495,0.0004798851,0.0007146631,0.0001662528,0.002681076],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4225658,"threshold_uncertainty_score":0.5451705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088470271","doi":"10.1016/j.disopt.2012.07.004","title":"Total domination and the Caccetta–Häggkvist conjecture","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.00744222266980682,"gpt":0.2617487429915411,"spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000510285,0.00008804251,0.00008885794,0.00006150728,0.000220036,0.0001501179,0.0002422233,0.00003954644,0.00001956242],"category_scores_gemma":[0.0001204111,0.00005685789,0.00003031001,0.0002907039,0.0001623168,0.001015719,0.0001561473,0.00009979907,0.000006437936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002082477,"about_ca_system_score_gemma":0.00001139774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005787086,"about_ca_topic_score_gemma":8.032125e-7,"domain_scores_codex":[0.9991564,0.0001503602,0.0001113982,0.00015844,0.0001978586,0.0002255305],"domain_scores_gemma":[0.9993926,0.0001453368,0.00006068784,0.0002788114,0.00005487071,0.00006767052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000048473,0.00001349163,0.0003392818,0.000007680066,0.00001255162,5.586224e-7,0.001556772,0.0565654,0.00004443048,0.9330786,0.00008992276,0.008242778],"study_design_scores_gemma":[0.001445133,0.00003013466,0.001444085,0.00000824061,0.000009772786,0.00003637619,0.0001060097,0.9810867,0.0004405421,0.01488441,0.0003358666,0.0001727217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003422524,0.0003326095,0.9922551,0.001501644,0.0001431074,0.0002716853,0.000002037789,0.00005826254,0.002013043],"genre_scores_gemma":[0.9599212,0.00003705149,0.03954818,0.0001217791,0.00007389548,0.00003035974,0.00001443399,0.000008791705,0.0002442364],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9564987,"threshold_uncertainty_score":0.2318597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2509691293","doi":"10.1016/j.disopt.2017.10.001","title":"Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypercube; Polytope; Mathematics; Semidefinite programming; Combinatorics; Vertex (graph theory); Lift (data mining); Operator (biology); Regular polygon; Polyhedron; Discrete mathematics; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02309696272240792,"gpt":0.2800881309899574,"spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000287796,0.0004020897,0.0004134687,0.0002202952,0.0006390857,0.001124172,0.001047476,0.0001814696,0.00001302446],"category_scores_gemma":[0.00003535495,0.0003504372,0.0001131922,0.0001327451,0.000165675,0.0006756444,0.001196099,0.0003373172,8.357142e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005888913,"about_ca_system_score_gemma":0.0002168201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006484031,"about_ca_topic_score_gemma":0.00005362893,"domain_scores_codex":[0.9980119,0.00009193194,0.0003181643,0.0009163271,0.0003105046,0.0003511493],"domain_scores_gemma":[0.9983209,0.0001051124,0.0003637505,0.0009084482,0.0002154488,0.00008629985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003266572,0.0001385428,0.001235104,0.0003999179,0.0008442619,0.00003029799,0.003150728,0.8006693,0.00002273485,0.1508083,0.000772087,0.04160209],"study_design_scores_gemma":[0.001239601,0.0003509393,0.0006124368,0.0004758491,0.0001289974,0.000009775055,0.0001151404,0.9912133,0.0004590692,0.004332006,0.0002634472,0.0007994758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002074893,0.0002817861,0.9935789,0.0008693097,0.0005327465,0.001269793,0.0005421406,0.0001439089,0.0007065558],"genre_scores_gemma":[0.1054497,0.0003609903,0.8915211,0.0002533452,0.000227445,0.000303713,0.001689384,0.00004950022,0.0001448275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.190544,"threshold_uncertainty_score":0.9999127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090424186","doi":"10.1016/j.disopt.2007.08.005","title":"The travelling preacher, projection, and a lower bound for the stability number of a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Emmanuel Bible College; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Graph; Interpretation (philosophy); Independent set; Enhanced Data Rates for GSM Evolution; Projection (relational algebra); Stability (learning theory); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02439590165167475,"gpt":0.315726119814678,"spread":0.2913302181630033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001708796,0.00007588561,0.00007096311,0.00003112857,0.0004249659,0.0001126151,0.0003087338,0.00003502524,0.000004494607],"category_scores_gemma":[0.0001882765,0.00004387145,0.00004803386,0.0004292484,0.000239223,0.0002902473,0.00006330529,0.00008092382,2.333207e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001656517,"about_ca_system_score_gemma":0.0000294869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001334492,"about_ca_topic_score_gemma":0.00002510758,"domain_scores_codex":[0.9991273,0.00006579408,0.000196226,0.0002133739,0.0001903283,0.0002069764],"domain_scores_gemma":[0.9985304,0.0007637942,0.00009120645,0.0003661826,0.0002155086,0.00003289949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001473191,0.0002335667,0.009292975,0.000182752,0.0002422455,0.000001660557,0.01438618,0.1482619,0.001585215,0.6685717,0.000124155,0.1556444],"study_design_scores_gemma":[0.0005003808,0.0001185389,0.001313574,0.00001602658,0.00001560051,0.000007028231,0.0007234169,0.9233694,0.003264659,0.0700316,0.0004910532,0.0001487049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008361168,0.000168363,0.9900421,0.0002404199,0.000096241,0.00067147,0.000002793954,0.00002678727,0.0003906434],"genre_scores_gemma":[0.8136248,0.0002149805,0.1857846,0.0000298766,0.00004212005,0.00009972251,0.000004695336,0.00001712823,0.0001820715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8052636,"threshold_uncertainty_score":0.3268537,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W6625772","doi":"10.1016/j.disopt.2007.12.001","title":"A Special Issue in Memory of George B. Dantzig","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Academic and Historical Perspectives in Psychology","field":"Psychology","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"George (robot); Mathematics; Mathematical economics; Operations research; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01855816165973135,"gpt":0.3103188918491556,"spread":0.2917607301894242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001131222,0.0001084719,0.0002241785,0.0001753402,0.00005306446,0.00000146769,0.0001656186,0.0002095805,0.007850826],"category_scores_gemma":[0.00005808286,0.000110586,0.00005413597,0.0003266867,0.0002360791,0.00008235122,0.00002725003,0.0002209739,0.0001243737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008483232,"about_ca_system_score_gemma":0.00001865896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001117944,"about_ca_topic_score_gemma":0.000004829271,"domain_scores_codex":[0.9989536,0.0001010198,0.0003267182,0.00029246,0.0001206589,0.0002054746],"domain_scores_gemma":[0.9995112,0.00004431761,0.0001293049,0.0002294203,0.0000397555,0.00004597503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001742107,0.001258264,0.03046462,0.00004121863,0.0001749864,0.0002682903,0.1123818,0.07193776,0.0002233668,0.0936102,0.67513,0.01276732],"study_design_scores_gemma":[0.01838892,0.00183046,0.1912457,0.0001648786,0.0001924169,0.0006104963,0.0233985,0.02456591,0.0003150834,0.006659197,0.7296467,0.002981742],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.008990467,0.0003163433,0.02768843,0.0003281913,0.002529776,0.0002204602,0.00001199593,0.00003782867,0.9598765],"genre_scores_gemma":[0.8900777,0.0007917368,0.01739056,0.0008765031,0.0128615,0.00009153653,0.0001373608,0.0001133272,0.07765984],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8822167,"threshold_uncertainty_score":0.9930561,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2745314127","doi":"10.1016/j.disopt.2018.06.004","title":"The generalized vertex cover problem and some variations","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Vertex cover; Mathematics; Vertex (graph theory); Generalization; Combinatorics; Cover (algebra); Edge cover; Mathematical optimization; Quadratic equation; Linear programming; Integer programming; Discrete mathematics; Approximation algorithm; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01554961387666857,"gpt":0.2494159079872457,"spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003246463,0.0002141356,0.0001797273,0.00008385352,0.0006662394,0.001036474,0.0008544025,0.0001548361,0.00002531114],"category_scores_gemma":[0.00005000524,0.0001646349,0.00008183726,0.0002104973,0.0001545477,0.0004201008,0.001418056,0.0002299491,0.00001241761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003845503,"about_ca_system_score_gemma":0.0001092474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004204561,"about_ca_topic_score_gemma":0.000005415027,"domain_scores_codex":[0.9985352,0.0001377448,0.0002887496,0.0005281425,0.0002736547,0.0002365201],"domain_scores_gemma":[0.9986565,0.0001034376,0.0002161635,0.0007873541,0.000165445,0.00007109851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008237298,0.00002441633,0.00002873156,0.00003353745,0.000083377,0.000001226647,0.0005884331,0.3045964,0.000004172054,0.686292,0.003108385,0.005231073],"study_design_scores_gemma":[0.0001766013,0.00002055706,0.00009306108,0.00003315073,0.00001725155,0.000002261736,0.000003006034,0.7998325,0.00001007398,0.1978324,0.001795184,0.0001840366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009329079,0.000443611,0.9934698,0.002184769,0.00106245,0.0004460064,0.00002883089,0.0001591877,0.002112002],"genre_scores_gemma":[0.008376775,0.001840494,0.9874742,0.0004555397,0.000373311,0.0001750224,0.000266251,0.00003369043,0.0010047],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4952361,"threshold_uncertainty_score":0.9994743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041745502","doi":"10.1016/j.disopt.2010.08.004","title":"Generalized resolution search","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Resolution (logic); Mathematics; Mathematical optimization; Branch and bound; Flexibility (engineering); Process (computing); Guided Local Search; Algorithm; Search algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01181640871950965,"gpt":0.2546175475482703,"spread":0.2428011388287607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002304497,0.0001064094,0.00008753308,0.0001486767,0.0002021041,0.0002219455,0.0002840653,0.00009349344,0.000379947],"category_scores_gemma":[0.00005654201,0.0001054221,0.0000478052,0.0004426069,0.00004779292,0.0007774445,0.00008047161,0.0001768784,0.00004474948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002344611,"about_ca_system_score_gemma":0.00006415806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002469147,"about_ca_topic_score_gemma":0.00002542018,"domain_scores_codex":[0.9990025,0.00006247719,0.0001918633,0.0002993164,0.0002440372,0.0001998502],"domain_scores_gemma":[0.9992739,0.00002309349,0.00006128454,0.0003978838,0.0001484319,0.00009540353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006647,0.00001580504,0.0004885508,0.000003307666,0.000006343714,0.000001540254,0.000225623,0.8628638,0.002142423,0.1212478,0.0002974743,0.01270065],"study_design_scores_gemma":[0.0003189393,0.00001524335,0.001125424,0.00000301915,0.000003232001,0.00001123149,0.00001398041,0.9965625,0.0008374019,0.0002213885,0.0007495973,0.0001380782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004244527,0.000008267522,0.9873836,0.001360821,0.0006043422,0.000169758,0.000002683735,0.0002935957,0.005932389],"genre_scores_gemma":[0.3730896,0.00002970259,0.6261147,0.0001915731,0.00008361483,0.00001328751,0.00007173539,0.00001142621,0.0003944075],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.368845,"threshold_uncertainty_score":0.429899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000678401","doi":"10.1016/j.disopt.2009.04.003","title":"On stars and Steiner stars","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Star (game theory); Combinatorics; Stars; Plane (geometry); Mathematics; Matching (statistics); Point (geometry); Line (geometry); Center (category theory); Physics; Mathematical analysis; Geometry; Astrophysics","retraction":null,"screen_n_in":null,"score":{"opus":0.00380459814755335,"gpt":0.1846824485308133,"spread":0.18087785038326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006205594,0.00009355565,0.00008269633,0.00005851524,0.00004103948,0.00003390907,0.00003911112,0.00004386161,0.00004317407],"category_scores_gemma":[0.000007077138,0.00008593677,0.0000194804,0.0000990917,0.00001139668,0.0001213093,0.000003111316,0.00005181114,0.000007151445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001228189,"about_ca_system_score_gemma":0.000001787106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001148473,"about_ca_topic_score_gemma":7.792742e-7,"domain_scores_codex":[0.9995878,0.00001885248,0.0001044374,0.000100311,0.00007631211,0.0001122591],"domain_scores_gemma":[0.9998047,0.00001228211,0.00001473587,0.0001123924,0.00001205935,0.00004378579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001295531,0.000004743127,0.00002708547,0.000009332726,0.000008057647,0.000001365171,0.0001585733,0.9848409,0.0004809269,0.01251353,0.0003796149,0.001562863],"study_design_scores_gemma":[0.0005140448,0.0001883998,0.001494748,0.00006205543,0.00001704837,0.000003489664,0.0001323926,0.9937773,0.0007223976,0.002136949,0.0006510364,0.0003001592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7255949,0.0005167913,0.2238552,0.000234185,0.0004775426,0.0004317184,0.00003168303,0.0006764092,0.04818152],"genre_scores_gemma":[0.9985301,0.00004929702,0.001124179,0.00006620292,0.00002267372,0.000003726818,0.00003507978,0.00001401421,0.0001546519],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2729352,"threshold_uncertainty_score":0.35044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}