{"meta":{"query_hash":"3c29a04d9409","filters":{"venue":"Discrete Optimization"},"cohort_total":58,"direct_labels_cover":0,"predictions_cover":58,"exported":58,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3c29a04d9409","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Optimization"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017486512446671036,"score_gpt":0.2802205927815007,"score_spread":0.26273408033482964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968959377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023853617,0.0028160156,0.62104917,0.030123971,0.009185428,0.00040883635,0.0013925718,0.009763449,0.30140695],"genre_scores_gemma":[0.18265446,0.0042150407,0.47864628,0.008103607,0.0017209315,0.00036964237,0.0018442458,0.009646675,0.31279913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989737,0.00018410612,0.000058203183,0.00013124484,0.0004909988,0.00016176156],"domain_scores_gemma":[0.9932922,0.0010567919,0.00015931268,0.004036362,0.0011439129,0.0003114462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014147708,0.00085137377,0.0013118933,0.0011896543,0.00189177,0.0047291364,0.0017086099,0.0014222343,0.08081825],"category_scores_gemma":[0.014791591,0.00075583905,0.0021178266,0.0013100373,0.0017443597,0.008106131,0.0033969255,0.005424735,0.0333136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003329149,0.00032120274,0.0010945097,0.00040483387,0.00009930072,0.00048450654,0.0005829224,0.0050269295,0.005272404,0.22031109,0.23839381,0.52767557],"study_design_scores_gemma":[0.00009070271,0.000087266635,0.0006213328,0.00026640404,0.00007258638,0.0007124802,0.0006256733,0.015279194,0.008084051,0.59289473,0.38118264,0.00008274169],"about_ca_topic_score_codex":0.0027034006,"about_ca_topic_score_gemma":0.0037334438,"teacher_disagreement_score":0.08081825,"about_ca_system_score_codex":0.00070588035,"about_ca_system_score_gemma":0.0017490892,"threshold_uncertainty_score":0.270364},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023063067758610504,"score_gpt":0.2875200500293179,"score_spread":0.2644569822707074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970402125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12607312,0.0018582313,0.8194142,0.0020007775,0.00044232473,0.00026620764,0.00060745404,0.0007179122,0.04861972],"genre_scores_gemma":[0.54245734,0.0013572661,0.4471776,0.00032055823,0.0001367316,0.00040648616,0.000680742,0.0004917387,0.0069716494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.00045293407,0.000033711774,0.00006466598,0.00018362865,0.000058812493],"domain_scores_gemma":[0.9941943,0.004652399,0.00015942058,0.00033933442,0.00053205405,0.00012246454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024881647,0.0008602795,0.001063016,0.0010994326,0.00067904836,0.0018837568,0.0016816844,0.0018062957,0.007859287],"category_scores_gemma":[0.008986499,0.00045542637,0.00082449435,0.0015403405,0.0006825461,0.0021433043,0.0012002662,0.0020852012,0.00059956533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025949127,0.0003209259,0.00047198302,0.00019019056,0.000033868404,0.000028032784,0.00007168417,0.8914173,0.00034333076,0.050757587,0.0031260324,0.052979477],"study_design_scores_gemma":[0.000027916478,0.000031608663,0.00006370486,0.000013563818,0.0000057703155,0.000007471888,0.000027177703,0.9942521,0.00012956563,0.004710167,0.00072650274,0.000004428007],"about_ca_topic_score_codex":0.007678181,"about_ca_topic_score_gemma":0.00921828,"teacher_disagreement_score":0.007859287,"about_ca_system_score_codex":0.0018056098,"about_ca_system_score_gemma":0.002070485,"threshold_uncertainty_score":0.026291966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0061230829875364,"score_gpt":0.2052522143263091,"score_spread":0.19912913133877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975310381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034163572,0.00009540055,0.9565785,0.00018054842,0.00007321118,0.00015855218,0.000106894615,0.0025160636,0.0061272117],"genre_scores_gemma":[0.2924614,0.00006541299,0.7013174,0.000080466714,0.00003160693,0.0002559501,0.00031314205,0.00024306573,0.0052314275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996488,0.00004439168,0.000015121309,0.00011874178,0.000082909515,0.000090000336],"domain_scores_gemma":[0.99964786,0.00017428878,0.000037663092,0.00006017839,0.000040731436,0.000039252598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036813927,0.0014974645,0.001339672,0.00055238785,0.0008654873,0.000844364,0.0015597749,0.0015324974,0.0083828075],"category_scores_gemma":[0.00095029664,0.0006233417,0.00087331317,0.00075831404,0.00074164406,0.0010724989,0.0013741219,0.0012684979,0.0011926816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000437048,0.00024010136,0.0005077224,0.00021074543,0.000050913215,0.000098362674,0.00011379211,0.67620903,0.013557457,0.01219308,0.0057480023,0.29063374],"study_design_scores_gemma":[0.000113505565,0.00008159796,0.0001547818,0.0000060224284,0.000011328144,0.000018935407,0.000025913496,0.9904619,0.0016557866,0.0065240497,0.000936312,0.000009944344],"about_ca_topic_score_codex":0.008226763,"about_ca_topic_score_gemma":0.00977245,"teacher_disagreement_score":0.0083828075,"about_ca_system_score_codex":0.0011355376,"about_ca_system_score_gemma":0.0017319435,"threshold_uncertainty_score":0.02804327},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10718468775808698,"score_gpt":0.382185916378766,"score_spread":0.275001228620679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976051387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012033731,0.0002404625,0.98212343,0.00026596218,0.00007740037,0.00007773844,0.00014688962,0.0005008062,0.004533546],"genre_scores_gemma":[0.18306708,0.0005638121,0.8067288,0.0003179923,0.00024400017,0.00045529532,0.00093598576,0.00044370117,0.0072432887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983834,0.0005903241,0.00008784239,0.00030849656,0.00043005848,0.00019999918],"domain_scores_gemma":[0.9953715,0.0033022014,0.00032406836,0.00041083116,0.0003980809,0.0001932948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035258115,0.002018841,0.0019076539,0.0025772944,0.0009995741,0.0030858712,0.0030249215,0.0021188254,0.012749592],"category_scores_gemma":[0.0140286805,0.0014895678,0.0024042663,0.00271563,0.0013997948,0.0037730539,0.002014805,0.004417202,0.0016811459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031905225,0.0002683692,0.00061681337,0.00019084603,0.00013036444,0.00006248349,0.00012332162,0.7639374,0.0020819795,0.09951786,0.0058643585,0.12688717],"study_design_scores_gemma":[0.00003903243,0.00007009875,0.00010083348,0.000021202935,0.000022848353,0.000012978348,0.000015543688,0.93770146,0.0004940509,0.06062101,0.00088737794,0.000013593438],"about_ca_topic_score_codex":0.004477689,"about_ca_topic_score_gemma":0.0046933666,"teacher_disagreement_score":0.012749592,"about_ca_system_score_codex":0.0019241341,"about_ca_system_score_gemma":0.001995798,"threshold_uncertainty_score":0.042651594},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.005582494992715322,"score_gpt":0.1959777075951276,"score_spread":0.19039521260241227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980190773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012900168,0.00006623768,0.99572146,0.00007433784,0.000045448054,0.000028121924,0.000017745258,0.00019913257,0.0025574958],"genre_scores_gemma":[0.17080575,0.00023668142,0.8165635,0.00019752968,0.00008912093,0.00036311056,0.00018217062,0.00027804033,0.011284157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997446,0.00007393986,0.0000136599265,0.00005147313,0.000084928964,0.00003131381],"domain_scores_gemma":[0.99961746,0.0002297869,0.000022576283,0.000027818684,0.00008037629,0.000021938897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964641,0.0009809115,0.00087488437,0.00045102744,0.00065080536,0.0008654893,0.0010635144,0.0011864161,0.011151983],"category_scores_gemma":[0.0017238805,0.00043996095,0.0006364541,0.00059126917,0.0006355503,0.0010593882,0.0014598131,0.00160084,0.0024358262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001968611,0.00015115688,0.00023555796,0.00027138737,0.000051749663,0.00014039876,0.00022160333,0.6259084,0.007703423,0.091191486,0.008018091,0.26590988],"study_design_scores_gemma":[0.00003206249,0.000041436542,0.00004302625,0.000011288325,0.0000078824605,0.000027534436,0.000020896094,0.98017335,0.0009614065,0.015905602,0.0027614327,0.000014045829],"about_ca_topic_score_codex":0.0048187696,"about_ca_topic_score_gemma":0.005070418,"teacher_disagreement_score":0.011151983,"about_ca_system_score_codex":0.00065938424,"about_ca_system_score_gemma":0.0013345852,"threshold_uncertainty_score":0.037307084},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006429571201527289,"score_gpt":0.215421699780067,"score_spread":0.20899212857853972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981813514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030945797,0.0005701728,0.9537155,0.00033191819,0.000040217124,0.00002959836,0.00009661784,0.00022530295,0.014044822],"genre_scores_gemma":[0.530034,0.0012953185,0.4553094,0.00015062356,0.00012081666,0.00012856575,0.0004329455,0.00033198565,0.012196332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996811,0.00007547153,0.000015819662,0.000057979436,0.00013147012,0.000038141006],"domain_scores_gemma":[0.9987184,0.00085031707,0.00012869935,0.00014867494,0.000105491396,0.00004850344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006958055,0.00048516304,0.00046048212,0.00070836226,0.0005166496,0.0014393184,0.0008128847,0.0008658539,0.006977339],"category_scores_gemma":[0.0035077194,0.00049931987,0.00045938976,0.000829057,0.00097628107,0.0026483296,0.00074919435,0.0017836909,0.00043106446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012933169,0.00008611553,0.0006877715,0.00013792598,0.000016659045,0.00011078711,0.00013579048,0.08907205,0.003684751,0.762876,0.00230848,0.14075439],"study_design_scores_gemma":[0.0000313257,0.00004990327,0.00040612664,0.00004983621,0.000018661542,0.00015472062,0.000052131807,0.2335156,0.004043256,0.75591594,0.005748316,0.000014089925],"about_ca_topic_score_codex":0.00066864304,"about_ca_topic_score_gemma":0.0016178117,"teacher_disagreement_score":0.006977339,"about_ca_system_score_codex":0.0005269272,"about_ca_system_score_gemma":0.0005005341,"threshold_uncertainty_score":0.023341537},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01236291145485941,"score_gpt":0.23366009205835583,"score_spread":0.22129718060349643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05027585,0.0067553697,0.9160095,0.0032744373,0.00030854405,0.00006524428,0.0005294501,0.00015319129,0.022628378],"genre_scores_gemma":[0.5958053,0.008354646,0.37535635,0.0008041437,0.0016704473,0.00031247476,0.0010431408,0.00035149138,0.01630199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984176,0.0006336678,0.00007909257,0.00028817824,0.00045881976,0.00012256746],"domain_scores_gemma":[0.9940252,0.004437894,0.00058319664,0.00039019366,0.00031007506,0.00025343307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021239857,0.0010015406,0.0018998601,0.001165006,0.0008828785,0.0029108205,0.0026513075,0.0022932235,0.0034911947],"category_scores_gemma":[0.010137032,0.00071158155,0.0010240274,0.0047167055,0.001709621,0.00757996,0.0022225736,0.0037479675,0.00044573075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020429552,0.00018355262,0.00048626933,0.0003603371,0.00008751558,0.0001681802,0.00014333628,0.39287776,0.0012329817,0.5328387,0.010457985,0.060958955],"study_design_scores_gemma":[0.00003559254,0.0000276556,0.00023192634,0.000024767349,0.00002203694,0.00015486075,0.000040718027,0.51382864,0.00025246124,0.48069304,0.004668837,0.00001945087],"about_ca_topic_score_codex":0.0018004366,"about_ca_topic_score_gemma":0.0015353485,"teacher_disagreement_score":0.0034911947,"about_ca_system_score_codex":0.0013234284,"about_ca_system_score_gemma":0.001183654,"threshold_uncertainty_score":0.011679232},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06296760241526711,"score_gpt":0.3605790427625292,"score_spread":0.2976114403472621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984167047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041051313,0.0007682897,0.9560551,0.00064097514,0.000059987677,0.00003592945,0.00007843636,0.0002434125,0.001066593],"genre_scores_gemma":[0.48590195,0.00080476206,0.5100491,0.00023111791,0.00028141012,0.00020905657,0.0004323156,0.00028363592,0.0018067011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606735,0.0024376737,0.00019741531,0.00044977345,0.00065171876,0.00019597953],"domain_scores_gemma":[0.97830164,0.018516937,0.0009410809,0.0010222573,0.0008414265,0.00037672682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009926562,0.0015515278,0.0034096243,0.0015948093,0.0005729216,0.0033068764,0.0028248418,0.0026028473,0.0015199967],"category_scores_gemma":[0.038370177,0.0013976801,0.0013299551,0.0017990873,0.0019519634,0.0047226637,0.002041446,0.0034953405,0.00034585063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016124477,0.00008341338,0.000696905,0.000119129385,0.00008189759,0.000037248177,0.000042561718,0.94864726,0.00038948533,0.021424873,0.00080061227,0.027515257],"study_design_scores_gemma":[0.000009316036,0.000027652408,0.00009323312,0.000007981913,0.0000072174425,0.000010001799,0.000006903812,0.9849429,0.00020532511,0.014596337,0.000088355475,0.000004860242],"about_ca_topic_score_codex":0.002413431,"about_ca_topic_score_gemma":0.0015968455,"teacher_disagreement_score":0.009926562,"about_ca_system_score_codex":0.0017165027,"about_ca_system_score_gemma":0.0015089263,"threshold_uncertainty_score":0.052497268},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.023079159256816015,"score_gpt":0.27368003639205085,"score_spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986446280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04525423,0.0009644039,0.9388779,0.0011872969,0.00014586902,0.00026257377,0.00026123872,0.00064611156,0.012400422],"genre_scores_gemma":[0.4084664,0.00078827265,0.5818174,0.0005878717,0.00028414602,0.0006412001,0.0009366729,0.00051257253,0.005965492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975756,0.00087931886,0.00008121794,0.00030177852,0.000807421,0.00035467467],"domain_scores_gemma":[0.9912122,0.006778435,0.0003677931,0.00065250456,0.000704014,0.00028497548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026964429,0.0014166792,0.0017754177,0.0012480464,0.0011566927,0.0026371954,0.0033846293,0.0021630062,0.007301682],"category_scores_gemma":[0.015428658,0.0008173044,0.0011847949,0.0023501394,0.0013876435,0.0033294302,0.0023310115,0.002136458,0.00096889085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009094432,0.0003473931,0.0017246946,0.00043296567,0.00013319713,0.00011798755,0.00020863183,0.7743114,0.0046892413,0.09559946,0.012311639,0.10921391],"study_design_scores_gemma":[0.000057814545,0.00005021559,0.00019955142,0.000013466991,0.000022520211,0.00004465181,0.00003104051,0.97069776,0.00040199928,0.027604008,0.0008695076,0.0000075107155],"about_ca_topic_score_codex":0.004313074,"about_ca_topic_score_gemma":0.0053474084,"teacher_disagreement_score":0.007301682,"about_ca_system_score_codex":0.0028463332,"about_ca_system_score_gemma":0.004276153,"threshold_uncertainty_score":0.02442658},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017727372656691377,"score_gpt":0.24723899472558208,"score_spread":0.2295116220688907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986491739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1783005,0.00097431685,0.7926099,0.0012828943,0.00021422186,0.00035838824,0.0007134335,0.0012132684,0.024333086],"genre_scores_gemma":[0.84726185,0.00033431518,0.14550453,0.00028959868,0.00012920245,0.00024222133,0.0006791503,0.00036388577,0.0051952847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878865,0.00042892803,0.00005308285,0.00014386862,0.00022234258,0.0003631809],"domain_scores_gemma":[0.9958476,0.0030586175,0.00021862131,0.00030834106,0.0003523243,0.00021442202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028631042,0.0008669003,0.0017128697,0.0012883659,0.0008382002,0.0013424455,0.0010843533,0.0011342143,0.0064115534],"category_scores_gemma":[0.009612884,0.0005010854,0.00048593615,0.0009535749,0.0010727354,0.0018229696,0.0010831502,0.0011844097,0.00053986796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006377224,0.00016713905,0.00057485106,0.0001626385,0.000026462947,0.00003288007,0.00008398919,0.92662466,0.0023757117,0.018331844,0.0042277854,0.046754375],"study_design_scores_gemma":[0.000039106762,0.000063136875,0.00019692445,0.000007433459,0.0000058380174,0.000005931084,0.00002605057,0.98817307,0.0005690923,0.010650809,0.00025863122,0.000003966005],"about_ca_topic_score_codex":0.010471595,"about_ca_topic_score_gemma":0.010676121,"teacher_disagreement_score":0.010471595,"about_ca_system_score_codex":0.0021364356,"about_ca_system_score_gemma":0.0034258578,"threshold_uncertainty_score":0.021448791},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02244022931863883,"score_gpt":0.25673848990929843,"score_spread":0.2342982605906596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992769367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002527856,0.00012761343,0.99428976,0.00010182617,0.00010309015,0.000042855227,0.000050384104,0.0003457993,0.0024108437],"genre_scores_gemma":[0.058380738,0.00021078702,0.93588305,0.00013953527,0.00009040764,0.00020442496,0.00020658351,0.00016771592,0.0047167297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936396,0.00011177239,0.000029786064,0.00012880393,0.0002892607,0.000076452634],"domain_scores_gemma":[0.99915254,0.00044359828,0.000056900022,0.000110676694,0.00018586351,0.00005041596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096126104,0.0009078022,0.001520271,0.0009199791,0.00060531055,0.0013849133,0.0021081364,0.0016162882,0.0070868325],"category_scores_gemma":[0.0028747031,0.0007413279,0.00075433595,0.0014953193,0.00062048377,0.0020193078,0.0014721742,0.0017601573,0.0012342805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001461773,0.00013997495,0.0002779543,0.00016045145,0.00004634264,0.00006232237,0.000066125845,0.68552136,0.0027071086,0.031027293,0.0066196523,0.27322525],"study_design_scores_gemma":[0.000050315037,0.00002278929,0.00004596514,0.000008924653,0.000006706189,0.000023864597,0.000008537439,0.98947924,0.00034356437,0.007781419,0.002221734,0.0000068538916],"about_ca_topic_score_codex":0.0056064785,"about_ca_topic_score_gemma":0.0076849083,"teacher_disagreement_score":0.0070868325,"about_ca_system_score_codex":0.0012759962,"about_ca_system_score_gemma":0.0023234487,"threshold_uncertainty_score":0.023707867},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0066513854110430695,"score_gpt":0.21806962236898966,"score_spread":0.2114182369579466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996281476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27541974,0.0010037837,0.6757914,0.002288968,0.00029515012,0.00015450704,0.00071771257,0.00058867416,0.043740053],"genre_scores_gemma":[0.86480385,0.00035422493,0.105237424,0.00051825464,0.00020302324,0.00018533914,0.00042810096,0.00022465168,0.028045116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860054,0.0006062689,0.0000434625,0.00031896448,0.00015717397,0.0002736226],"domain_scores_gemma":[0.9962953,0.0020840596,0.00046436087,0.00042208546,0.00021099897,0.0005231751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023962294,0.00096806587,0.0020742854,0.0008382054,0.0013996476,0.0023321272,0.0025014835,0.0018716387,0.011098218],"category_scores_gemma":[0.00787595,0.0013636285,0.0012100581,0.0012752423,0.0021577617,0.0038059186,0.0022299592,0.0021692694,0.00091200956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015266881,0.0003013652,0.0009667765,0.00046165212,0.00015944886,0.00031762244,0.00032644754,0.33293712,0.0041192938,0.61312246,0.010273323,0.035487793],"study_design_scores_gemma":[0.0001626321,0.00012926271,0.00049058034,0.00004189504,0.000043155113,0.000108828004,0.0000978253,0.5366646,0.0009733167,0.45824426,0.0030041928,0.000039490933],"about_ca_topic_score_codex":0.0020220908,"about_ca_topic_score_gemma":0.0019578936,"teacher_disagreement_score":0.011098218,"about_ca_system_score_codex":0.0013733023,"about_ca_system_score_gemma":0.0014665736,"threshold_uncertainty_score":0.037127197},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007785666697622099,"score_gpt":0.23544298419849105,"score_spread":0.22765731750086896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999004550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011042398,0.0012741331,0.9476455,0.0013640504,0.00018154152,0.000051108662,0.00031251053,0.00009447991,0.038034365],"genre_scores_gemma":[0.56637853,0.0034354948,0.33811644,0.00096921343,0.0006282884,0.0005248565,0.0016167613,0.00055606867,0.08777437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991315,0.00031164233,0.000028221839,0.00020102001,0.00023251711,0.00009516028],"domain_scores_gemma":[0.99909496,0.0005499792,0.00007816121,0.000062146115,0.00013305499,0.000081749924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015654356,0.00093850266,0.0011958936,0.0006308742,0.0004848147,0.0020783956,0.0009833425,0.0016288131,0.014235674],"category_scores_gemma":[0.006393753,0.00051396503,0.00041224007,0.00113584,0.0011094486,0.0024084614,0.0018479729,0.001604908,0.0016811129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025064536,0.0001100938,0.0004769554,0.00037238427,0.000056709818,0.000077774814,0.000066791574,0.2383388,0.0030938413,0.61593056,0.01910693,0.12211851],"study_design_scores_gemma":[0.000069908856,0.00008140751,0.00032074994,0.000044827295,0.000018138486,0.00009955695,0.000038927174,0.6126769,0.0009814152,0.36934876,0.016302135,0.000017240025],"about_ca_topic_score_codex":0.0013195556,"about_ca_topic_score_gemma":0.0010251,"teacher_disagreement_score":0.014235674,"about_ca_system_score_codex":0.0009837816,"about_ca_system_score_gemma":0.0009773946,"threshold_uncertainty_score":0.047623098},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00380459814755335,"score_gpt":0.1846824485308133,"score_spread":0.18087785038325996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000678401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10678633,0.009528638,0.7078673,0.010081063,0.0013468382,0.00008446954,0.00050803385,0.00017673025,0.16362056],"genre_scores_gemma":[0.73563915,0.012745369,0.13870141,0.0030247942,0.0021734813,0.00022283268,0.0008925612,0.00037595612,0.106224395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915195,0.00042018428,0.000027893855,0.00012293973,0.00018797952,0.000089082685],"domain_scores_gemma":[0.997124,0.0019226444,0.00020754512,0.00023102426,0.0002589079,0.00025592645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011896703,0.00092165265,0.0016169909,0.0014318901,0.0014091771,0.002348757,0.0013003579,0.0016851567,0.00983331],"category_scores_gemma":[0.0062701493,0.00064603856,0.0010345944,0.0036179174,0.0029536309,0.004958879,0.0025724422,0.0036995518,0.0010831233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026108126,0.000017979875,0.00012962472,0.00003930864,0.000009218777,0.000016997177,0.000069955175,0.01012773,0.00014383071,0.975019,0.0050860043,0.009314249],"study_design_scores_gemma":[0.00000719055,0.000008925839,0.0000656679,0.000013333267,0.0000034940956,0.00001586035,0.000036608853,0.016097639,0.000059614456,0.9800488,0.0036393348,0.0000034634013],"about_ca_topic_score_codex":0.0013853216,"about_ca_topic_score_gemma":0.001590031,"teacher_disagreement_score":0.00983331,"about_ca_system_score_codex":0.001520811,"about_ca_system_score_gemma":0.0007707088,"threshold_uncertainty_score":0.032895684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01482290958933528,"score_gpt":0.2092666094721759,"score_spread":0.19444369988284063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002576503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001271377,0.000078103105,0.99580103,0.00012744869,0.000031209125,0.00002057516,0.00006663606,0.00007283399,0.0025308302],"genre_scores_gemma":[0.1412568,0.0005245837,0.8441227,0.00034277493,0.00017179764,0.00040570216,0.00054181076,0.0004506798,0.012183207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919456,0.0003703532,0.000023512977,0.0001145724,0.0002453293,0.000051634146],"domain_scores_gemma":[0.9980884,0.0013338318,0.00011188275,0.00012764696,0.0002541741,0.000084138075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569336,0.0014919817,0.0014559549,0.0005713083,0.0004002164,0.0014330695,0.0018302186,0.0015105753,0.009667464],"category_scores_gemma":[0.0040979553,0.0010842729,0.0010656086,0.0010743553,0.00094118016,0.0019292487,0.0015262892,0.0026383006,0.0014893125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005465229,0.00010775389,0.00010504708,0.00018435405,0.00003690205,0.000078940655,0.00004740477,0.9037552,0.0019218049,0.06256823,0.0062058666,0.024933899],"study_design_scores_gemma":[0.000010118101,0.000017460934,0.000017365446,0.0000062430768,0.0000038572384,0.000017164344,0.0000070376655,0.98771834,0.00017288569,0.01118734,0.0008376126,0.0000045496386],"about_ca_topic_score_codex":0.0019760074,"about_ca_topic_score_gemma":0.0029009169,"teacher_disagreement_score":0.009667464,"about_ca_system_score_codex":0.00080265244,"about_ca_system_score_gemma":0.0012777834,"threshold_uncertainty_score":0.032340884},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","score_opus":0.1211367297478479,"score_gpt":0.3512656153859113,"score_spread":0.23012888563806339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004802557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865524,0.0018596769,0.96155226,0.0011523146,0.00037914238,0.00022361959,0.00040228423,0.00021597857,0.02434907],"genre_scores_gemma":[0.22249278,0.0062500527,0.7278253,0.0012171209,0.0016668277,0.0015208368,0.0018413467,0.0010326074,0.03615311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971486,0.001087529,0.00010472313,0.00042631404,0.00080455095,0.0004283846],"domain_scores_gemma":[0.9897065,0.0080322055,0.00047172137,0.0007105263,0.0007570957,0.0003219377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036476415,0.003747964,0.0036554034,0.0024527586,0.0017622262,0.006103266,0.0046178764,0.0036406987,0.013064525],"category_scores_gemma":[0.015694572,0.0024839644,0.0039767795,0.0072102323,0.0030350161,0.008708119,0.0032290325,0.009220511,0.0017521956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022555821,0.0003394868,0.00032111158,0.0005890022,0.00008453647,0.000056011344,0.00037028707,0.42163756,0.0008932846,0.4698707,0.019924179,0.08568825],"study_design_scores_gemma":[0.000048555303,0.00007137011,0.00013912396,0.000083999956,0.000042087006,0.00005117508,0.000073880634,0.6464001,0.00077216525,0.34718975,0.0050979513,0.000029894176],"about_ca_topic_score_codex":0.008639455,"about_ca_topic_score_gemma":0.006711199,"teacher_disagreement_score":0.013064525,"about_ca_system_score_codex":0.0056019556,"about_ca_system_score_gemma":0.0031228082,"threshold_uncertainty_score":0.043705225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","score_opus":0.006986559510435831,"score_gpt":0.18918722940017602,"score_spread":0.18220066988974018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006549279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41164362,0.0015373006,0.5227658,0.0010387165,0.00013026108,0.00023491871,0.0013989169,0.00060910825,0.060641237],"genre_scores_gemma":[0.87527704,0.0012765201,0.09798282,0.0002752725,0.00011297871,0.00024069255,0.00093392294,0.00033085505,0.023569876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993856,0.00015259995,0.000036077443,0.00017066703,0.00013167402,0.00012337856],"domain_scores_gemma":[0.99672663,0.001915178,0.00035698604,0.00033095476,0.00029996832,0.00037021967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231121,0.0008000325,0.0012979376,0.0019405484,0.0013534429,0.0027874215,0.0010539929,0.0009889591,0.009466467],"category_scores_gemma":[0.0046650385,0.00092058466,0.0007904029,0.0020117317,0.0012011239,0.0033116671,0.0009238216,0.0013086101,0.0008574022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017736558,0.0000694575,0.0007453845,0.00020201925,0.000042150245,0.00013511266,0.0003589546,0.028063433,0.003310898,0.93364894,0.0037454346,0.02950089],"study_design_scores_gemma":[0.00005411096,0.000053962543,0.00042470213,0.000058637543,0.00003241919,0.00013805981,0.00014183218,0.059781175,0.001738816,0.93248004,0.005075141,0.000021270373],"about_ca_topic_score_codex":0.0028325107,"about_ca_topic_score_gemma":0.004934629,"teacher_disagreement_score":0.009466467,"about_ca_system_score_codex":0.0015200713,"about_ca_system_score_gemma":0.0009836705,"threshold_uncertainty_score":0.031668484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05474765679449342,"score_gpt":0.31433579169288123,"score_spread":0.25958813489838783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008488464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94633365,0.00035699081,0.034076285,0.00057063566,0.00023606219,0.00031217557,0.0014830609,0.00054874795,0.016082369],"genre_scores_gemma":[0.92848486,0.00010715347,0.06470279,0.000101160265,0.000051463423,0.0002672278,0.0015753072,0.00009676227,0.0046131783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991567,0.00033999435,0.000040969026,0.0001670052,0.000116588635,0.00017872466],"domain_scores_gemma":[0.99694854,0.002132875,0.00021638663,0.00022787797,0.00022871597,0.0002456705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017099598,0.001176909,0.0012760698,0.0009843047,0.000707788,0.0013642769,0.0019491331,0.0018093219,0.0055359337],"category_scores_gemma":[0.0061390433,0.0005263908,0.0008306298,0.0011689878,0.00043696185,0.001128274,0.00071037246,0.0011611754,0.00029322322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011355116,0.0009437566,0.002392687,0.00032578094,0.00018436895,0.00020788332,0.00006394435,0.93506217,0.0016064361,0.006023791,0.008017663,0.044036042],"study_design_scores_gemma":[0.00028531946,0.00041665244,0.0007536644,0.000011976079,0.000031482763,0.000036286478,0.00005638584,0.993453,0.0013223772,0.002674402,0.000949473,0.000009037777],"about_ca_topic_score_codex":0.0066909813,"about_ca_topic_score_gemma":0.0069282963,"teacher_disagreement_score":0.0066909813,"about_ca_system_score_codex":0.0015517665,"about_ca_system_score_gemma":0.0014138886,"threshold_uncertainty_score":0.01851952},"labels":[],"label_agreement":null},{"id":"W2010049762","doi":"10.1016/j.disopt.2006.01.001","title":"Facets of the independent path-matching polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Matching (statistics); Mathematics; Combinatorics; Path (computing); Birkhoff polytope; Convex polytope; Independent set; Convex hull; Intersection (aeronautics); Matroid; Regular polygon; Convex set; Computer science; Convex optimization; Graph","score_opus":0.007936245868375578,"score_gpt":0.2477247421725551,"score_spread":0.23978849630417953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010049762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2948464,0.001334479,0.49676433,0.001645313,0.00020502541,0.00034372185,0.0044392026,0.00038428264,0.2000372],"genre_scores_gemma":[0.837739,0.00231117,0.100171365,0.0002928028,0.00031341278,0.000534986,0.005022324,0.00042001266,0.053195067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993808,0.00010484381,0.00002213613,0.00012544142,0.00025781384,0.000108929176],"domain_scores_gemma":[0.9990507,0.0004244855,0.00015404439,0.000094771225,0.00009549312,0.00018058786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045176604,0.0008311935,0.0014266865,0.0012700792,0.0010580593,0.0040884656,0.0015331475,0.0011574185,0.01815318],"category_scores_gemma":[0.0027418544,0.00071895996,0.0009373374,0.0018236665,0.0014421132,0.002670493,0.0019297953,0.0026020885,0.0017777864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025083765,0.00016188086,0.0017072128,0.0002976272,0.00007302772,0.00023985094,0.0002490979,0.09438392,0.0028731339,0.84865034,0.013555108,0.037558053],"study_design_scores_gemma":[0.00007428816,0.000062375926,0.0016060924,0.00007364309,0.00003313332,0.00024228967,0.00023152251,0.2179206,0.0015350741,0.766916,0.011273847,0.000031232623],"about_ca_topic_score_codex":0.003912771,"about_ca_topic_score_gemma":0.0023574291,"teacher_disagreement_score":0.01815318,"about_ca_system_score_codex":0.0012961156,"about_ca_system_score_gemma":0.0009530027,"threshold_uncertainty_score":0.06072849},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005526421708420291,"score_gpt":0.22781572212310086,"score_spread":0.22228930041468056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013219867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004664165,0.00019686407,0.9866866,0.0004883439,0.0001455735,0.00007827635,0.00011577578,0.0004669058,0.0071575292],"genre_scores_gemma":[0.14180258,0.0003422462,0.84864277,0.0002918574,0.00017648276,0.00035141376,0.00034694228,0.00024906243,0.007796768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990606,0.00023723507,0.00004154841,0.00016251215,0.00035589468,0.00014220543],"domain_scores_gemma":[0.99805164,0.0012527858,0.00007695658,0.00023835344,0.00029442433,0.00008581992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014214268,0.0009722225,0.0016724007,0.0009349474,0.00090457697,0.0022584554,0.0022770208,0.0022079926,0.0137165],"category_scores_gemma":[0.0069013415,0.00077840674,0.0007721673,0.0019285062,0.0010908922,0.002775944,0.001939472,0.0026657663,0.001875832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026878962,0.00027913513,0.0003571149,0.00018535204,0.000046023157,0.00008530336,0.00010312223,0.5790452,0.0014216171,0.13212886,0.015672721,0.2704068],"study_design_scores_gemma":[0.00011807958,0.00002243803,0.00006403409,0.000011896785,0.000009182451,0.00003340433,0.00001468942,0.9419381,0.00025474807,0.055469424,0.0020555921,0.000008344211],"about_ca_topic_score_codex":0.006225226,"about_ca_topic_score_gemma":0.006790134,"teacher_disagreement_score":0.0137165,"about_ca_system_score_codex":0.0019797122,"about_ca_system_score_gemma":0.003529702,"threshold_uncertainty_score":0.04588622},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011853492358565813,"score_gpt":0.2624375729190806,"score_spread":0.2505840805605148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015967296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022380486,0.006463703,0.61823255,0.025867408,0.0017276802,0.00014152344,0.0007357322,0.0003115726,0.32413927],"genre_scores_gemma":[0.6043118,0.012187117,0.21057191,0.0109692635,0.004367849,0.0010846809,0.0011186855,0.00110178,0.15428688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888545,0.0002933838,0.00004405513,0.00023480847,0.0003559097,0.00018634708],"domain_scores_gemma":[0.99722123,0.0019927842,0.000096630385,0.00020935657,0.00029717822,0.0001827964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025636565,0.0014897735,0.001894447,0.0023932185,0.0019560542,0.004400865,0.0030589201,0.0036958402,0.022513729],"category_scores_gemma":[0.011761908,0.0007632276,0.0018270515,0.002796119,0.003931021,0.009844839,0.0041295635,0.0076659364,0.0025141276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002111231,0.000020169364,0.000058285506,0.00008803292,0.000015079771,0.000021794434,0.000057481666,0.0025578002,0.0003641837,0.9812639,0.007171996,0.008360308],"study_design_scores_gemma":[0.000018266828,0.000005396663,0.00006664024,0.000015101721,0.000005825842,0.000030149584,0.000017346403,0.006274305,0.00015230205,0.9874325,0.0059742536,0.000007911871],"about_ca_topic_score_codex":0.0016001748,"about_ca_topic_score_gemma":0.0014241346,"teacher_disagreement_score":0.022513729,"about_ca_system_score_codex":0.0022044312,"about_ca_system_score_gemma":0.0012968824,"threshold_uncertainty_score":0.07531589},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014338220414387697,"score_gpt":0.2744137807614725,"score_spread":0.2600755603470848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020257725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060824375,0.00063076266,0.98826396,0.00026765262,0.00009828443,0.000084303,0.00011585011,0.00033315402,0.0041237175],"genre_scores_gemma":[0.151686,0.000947319,0.83856976,0.00019263543,0.00011098842,0.0005179486,0.00074996223,0.0003250765,0.0069003897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854195,0.00046778732,0.00009079868,0.00031112865,0.00037458815,0.00021374975],"domain_scores_gemma":[0.99575895,0.0026515962,0.00033173224,0.00042600094,0.00062411866,0.00020752168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022879338,0.0015984717,0.002323388,0.0018574037,0.0012734927,0.0023557765,0.0038499795,0.0021464578,0.0073386747],"category_scores_gemma":[0.010163463,0.0012480101,0.0013218649,0.0036270272,0.0011633519,0.0031920993,0.0032313094,0.0031005132,0.0015896866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024270212,0.00014697468,0.0005149404,0.00029018166,0.000081218226,0.000042089036,0.00018484188,0.78347945,0.00060356176,0.07090334,0.0072576585,0.13625295],"study_design_scores_gemma":[0.00007010893,0.000030354258,0.00008758302,0.00003053578,0.00001602334,0.000028768363,0.000043893637,0.94737333,0.00029314362,0.049072016,0.0029414676,0.000012840292],"about_ca_topic_score_codex":0.008852746,"about_ca_topic_score_gemma":0.0105732465,"teacher_disagreement_score":0.008852746,"about_ca_system_score_codex":0.0019446533,"about_ca_system_score_gemma":0.0025870476,"threshold_uncertainty_score":0.024550319},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02141643991881777,"score_gpt":0.3003653373785734,"score_spread":0.27894889745975565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023058821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097677425,0.0018411139,0.8602396,0.0011125539,0.0002365346,0.00004560087,0.00027483224,0.00045165923,0.03812062],"genre_scores_gemma":[0.91445863,0.0018105318,0.069293976,0.00032600752,0.00017339493,0.00012188646,0.00024297436,0.0004322392,0.013140322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.00034160702,0.00003898093,0.0002195411,0.00035824458,0.00022038566],"domain_scores_gemma":[0.9883084,0.007878407,0.0008062187,0.0013115546,0.0011257149,0.0005696989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031172761,0.0014874373,0.0015581249,0.0013801825,0.0009759853,0.0018659321,0.0033274624,0.0014110537,0.007827712],"category_scores_gemma":[0.016026516,0.00072139606,0.0012249757,0.0013856166,0.002030272,0.004179969,0.002267853,0.00391606,0.0007899089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023560105,0.0000718122,0.00063483807,0.00017987867,0.000059289636,0.00010828902,0.0001347716,0.6215197,0.0034833665,0.3490681,0.003242963,0.021261452],"study_design_scores_gemma":[0.00001336506,0.000051162224,0.00043494796,0.00006183118,0.000050522984,0.00007586872,0.000040114897,0.7364299,0.0030905604,0.25866482,0.0010638513,0.000023008888],"about_ca_topic_score_codex":0.0017711165,"about_ca_topic_score_gemma":0.0023657482,"teacher_disagreement_score":0.007827712,"about_ca_system_score_codex":0.0019452409,"about_ca_system_score_gemma":0.0011209623,"threshold_uncertainty_score":0.026186287},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018481360770615185,"score_gpt":0.20495056616455862,"score_spread":0.18646920539394343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030028156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08176689,0.004611571,0.8918443,0.0056736222,0.00021876046,0.00007456768,0.0017406867,0.00015689968,0.013912704],"genre_scores_gemma":[0.931114,0.0032149325,0.053835575,0.00026611518,0.00036261865,0.00017627157,0.000978096,0.0000872308,0.009965287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977704,0.0012546235,0.00008351945,0.0003151919,0.0003286313,0.00024764906],"domain_scores_gemma":[0.9857723,0.011745171,0.0013537349,0.00023824118,0.00047472885,0.00041572098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037244307,0.0012935601,0.0033076624,0.0014829434,0.0007505543,0.004018228,0.0021344847,0.0034864133,0.0037281462],"category_scores_gemma":[0.017001638,0.0016160659,0.0011278995,0.0036090757,0.0027128845,0.0042977002,0.0019772085,0.003232609,0.00026387532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108877866,0.00002542394,0.00048151176,0.000082736755,0.00004329999,0.00009605863,0.000038247472,0.8954266,0.000102531405,0.098662205,0.0014059736,0.003526546],"study_design_scores_gemma":[0.00003401988,0.000019789626,0.00022629829,0.00002059869,0.000013793756,0.00002948809,0.00003846394,0.9082029,0.000077846664,0.09037945,0.0009423661,0.000015011499],"about_ca_topic_score_codex":0.011379022,"about_ca_topic_score_gemma":0.004443924,"teacher_disagreement_score":0.011379022,"about_ca_system_score_codex":0.0039501656,"about_ca_system_score_gemma":0.0013819397,"threshold_uncertainty_score":0.028660595},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05430893569011083,"score_gpt":0.26720224455301966,"score_spread":0.21289330886290883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036207413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04162883,0.0062010125,0.9236201,0.0014201542,0.0005460738,0.000049570852,0.0002747778,0.00029780343,0.025961619],"genre_scores_gemma":[0.72235394,0.0071194735,0.24786246,0.00096742547,0.002205178,0.00039055885,0.0007377564,0.0008711227,0.017492095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978703,0.0004891173,0.00011217365,0.0006130513,0.0006628507,0.00025244514],"domain_scores_gemma":[0.9787416,0.014886172,0.0018814142,0.001327486,0.0017578334,0.0014055293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00472937,0.002866713,0.0023091084,0.0059104552,0.0016893165,0.004043462,0.0049265483,0.0028530143,0.008191349],"category_scores_gemma":[0.02581836,0.0011304758,0.0021071807,0.0031491313,0.0057489215,0.009273829,0.0065307855,0.008162477,0.0013861253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003393012,0.0001115907,0.0014923367,0.0004781728,0.00014069265,0.00020648357,0.00032142518,0.11885947,0.008007524,0.8195214,0.004763978,0.045757573],"study_design_scores_gemma":[0.000022700222,0.00016044936,0.0015560224,0.00014312149,0.00009264982,0.00022995238,0.00011472389,0.5419329,0.0052707377,0.44138628,0.008949024,0.00014149293],"about_ca_topic_score_codex":0.0009253933,"about_ca_topic_score_gemma":0.0010631791,"teacher_disagreement_score":0.008191349,"about_ca_system_score_codex":0.003597739,"about_ca_system_score_gemma":0.0010476311,"threshold_uncertainty_score":0.027402759},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011816408719509652,"score_gpt":0.2546175475482703,"score_spread":0.24280113882876067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041745502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069855107,0.0014121559,0.94521946,0.00063300447,0.00027120102,0.00013336021,0.00033821852,0.0013466413,0.043660473],"genre_scores_gemma":[0.18046694,0.0011382055,0.7786574,0.00076654035,0.00023612197,0.00031003254,0.0013214917,0.0009815838,0.0361217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980621,0.00080629624,0.0000633094,0.00043058168,0.0005227207,0.00011505998],"domain_scores_gemma":[0.9985537,0.0006196625,0.00006644579,0.00052628474,0.00017313108,0.00006082424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013861451,0.0012450621,0.0019384263,0.0018734783,0.0010353709,0.0024419727,0.0022239455,0.001928844,0.030444436],"category_scores_gemma":[0.0055998606,0.0007429492,0.0015456025,0.0028366498,0.00153296,0.0025298586,0.0035619033,0.0028281289,0.005108092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001783481,0.00014118159,0.00034763128,0.0004392519,0.00017799248,0.0002310143,0.00014699281,0.11376403,0.00323752,0.5332203,0.025749695,0.3223661],"study_design_scores_gemma":[0.00011535417,0.00008939265,0.00024278084,0.000113366004,0.00008563185,0.0002574593,0.00008927704,0.48098338,0.0030532235,0.46298307,0.051945083,0.000041929947],"about_ca_topic_score_codex":0.0014201609,"about_ca_topic_score_gemma":0.0029460397,"teacher_disagreement_score":0.030444436,"about_ca_system_score_codex":0.00089886686,"about_ca_system_score_gemma":0.0011899616,"threshold_uncertainty_score":0.101846814},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011725880689997945,"score_gpt":0.19932865616627973,"score_spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064816527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043441918,0.0055135177,0.93329495,0.0024694877,0.0007294106,0.00012139442,0.00058990717,0.00015772806,0.013681766],"genre_scores_gemma":[0.7128755,0.011401211,0.23192035,0.00071734545,0.0021122533,0.00057228206,0.0016063402,0.00038499365,0.038409762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795556,0.0009536584,0.00007583642,0.00045100658,0.00039735786,0.00016659427],"domain_scores_gemma":[0.99395657,0.004388363,0.0007395567,0.00024494724,0.000341601,0.00032894334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026733123,0.00208024,0.0025357192,0.0012354202,0.00090557593,0.0028140885,0.0033301518,0.0038394057,0.0069484757],"category_scores_gemma":[0.012404587,0.0018802431,0.0017365185,0.0041746153,0.0019998366,0.0061093816,0.0014890373,0.0038556603,0.00082458195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002654161,0.00017629593,0.00041959144,0.00043952028,0.000108576736,0.00021587132,0.00008084088,0.784559,0.00093667535,0.18379383,0.0060063675,0.022997959],"study_design_scores_gemma":[0.000036035806,0.000051778257,0.00024723803,0.000020542551,0.000026579677,0.000062800944,0.000039226175,0.8890653,0.00028467455,0.108014,0.002127706,0.00002402756],"about_ca_topic_score_codex":0.003090469,"about_ca_topic_score_gemma":0.002728084,"teacher_disagreement_score":0.0069484757,"about_ca_system_score_codex":0.0020941175,"about_ca_system_score_gemma":0.0020791395,"threshold_uncertainty_score":0.023244977},"labels":[],"label_agreement":null},{"id":"W2065255395","doi":"10.1016/j.disopt.2009.01.004","title":"On the feedback vertex set polytope of a series–parallel graph","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Chordal graph; Polytope; Pathwidth; Indifference graph; Feedback vertex set; Discrete mathematics; Subdivision; Graph; Line graph","score_opus":0.016480448800378945,"score_gpt":0.2701992797922433,"score_spread":0.2537188309918643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065255395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.347326,0.0009199039,0.57005715,0.0021097704,0.0002634404,0.00030220192,0.002033721,0.00047004735,0.076517746],"genre_scores_gemma":[0.8441724,0.0014119972,0.108877495,0.00039363655,0.00023801085,0.0006080429,0.0015912085,0.0003874477,0.04231974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999413,0.00016006496,0.00001441904,0.00013149556,0.00018501062,0.000096048636],"domain_scores_gemma":[0.9982838,0.00096016587,0.00025975917,0.00009142768,0.00014643873,0.00025833078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063384965,0.0014666609,0.0020364667,0.0013553868,0.0013249126,0.0021440724,0.0019626915,0.0018493694,0.016261961],"category_scores_gemma":[0.0030035349,0.0007766892,0.0009082391,0.0016330386,0.0019610436,0.0018832613,0.001577706,0.0021561761,0.001044888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018594672,0.00014910776,0.00046638216,0.00024997655,0.00004675616,0.00020572515,0.00012777944,0.65163857,0.0024216443,0.32391983,0.0064747594,0.014113444],"study_design_scores_gemma":[0.00005772416,0.00006758711,0.0003018497,0.00003850164,0.000013788421,0.00007948965,0.000072175644,0.7513703,0.00061437703,0.2452726,0.0020906136,0.000020925574],"about_ca_topic_score_codex":0.0060419613,"about_ca_topic_score_gemma":0.0047736955,"teacher_disagreement_score":0.016261961,"about_ca_system_score_codex":0.002272152,"about_ca_system_score_gemma":0.0011302367,"threshold_uncertainty_score":0.054401696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05271715870122828,"score_gpt":0.27900776822092493,"score_spread":0.22629060951969665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068748054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08711562,0.00018024085,0.8967322,0.00022565738,0.000053340915,0.0001441997,0.0002743212,0.0002330304,0.015041337],"genre_scores_gemma":[0.45200437,0.00025883433,0.536721,0.00011027437,0.000035618345,0.00024856318,0.00047088775,0.00018885739,0.009961507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997036,0.00009080675,0.000011140798,0.000053186588,0.00007995713,0.00006134736],"domain_scores_gemma":[0.99952257,0.0003010497,0.000052801235,0.000050306036,0.000045430297,0.000027908885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046030545,0.0009961687,0.0009609817,0.0010172316,0.00072758505,0.0012466338,0.0014308542,0.0012184845,0.007250597],"category_scores_gemma":[0.0026504153,0.0005205205,0.0009229603,0.0016862032,0.0005627021,0.0015870754,0.0013174332,0.0011302878,0.0006309656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003435812,0.00020257397,0.0006400365,0.00033311005,0.00005813263,0.00016339097,0.00020928877,0.7735553,0.0068926862,0.111339,0.0037600517,0.10250294],"study_design_scores_gemma":[0.00003499975,0.000067022076,0.00016575772,0.000016451853,0.000012623183,0.00003741478,0.000049489914,0.9428978,0.0018043272,0.053549685,0.0013553675,0.000009009019],"about_ca_topic_score_codex":0.0036165528,"about_ca_topic_score_gemma":0.00401831,"teacher_disagreement_score":0.007250597,"about_ca_system_score_codex":0.00090054964,"about_ca_system_score_gemma":0.00090483675,"threshold_uncertainty_score":0.024255693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Negativity effect; Lattice (music); Algorithm; Cognitive psychology; Psychology; Physics","score_opus":0.013313346936846226,"score_gpt":0.2658952204674746,"score_spread":0.2525818735306284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070134421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008136279,0.00014852732,0.98521173,0.00025104068,0.00013832867,0.000032573556,0.000045121586,0.0001052356,0.005931075],"genre_scores_gemma":[0.40222135,0.00059925136,0.58103746,0.0007902751,0.00034223896,0.00040819688,0.00034672552,0.00056840834,0.0136860525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962203,0.0018772859,0.000154834,0.0005740589,0.00094652956,0.00022696676],"domain_scores_gemma":[0.9873009,0.009248726,0.0005754013,0.0012628413,0.001129742,0.0004823175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006871967,0.0019516876,0.0017707009,0.0016342984,0.0013782063,0.002310948,0.0029389479,0.0018770732,0.007937814],"category_scores_gemma":[0.023011582,0.001433954,0.0015944828,0.001117271,0.004352667,0.004893753,0.005665614,0.005873953,0.001007202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034885228,0.00011278173,0.00031893674,0.0002973835,0.00008372543,0.000106398504,0.00024370564,0.2113907,0.005116203,0.7381828,0.003065629,0.04073282],"study_design_scores_gemma":[0.000052349595,0.000070179754,0.00007342434,0.000042362914,0.000027557217,0.0000464236,0.000050768882,0.3830202,0.0015748298,0.61185735,0.003165027,0.000019591562],"about_ca_topic_score_codex":0.0014213232,"about_ca_topic_score_gemma":0.002025905,"teacher_disagreement_score":0.007937814,"about_ca_system_score_codex":0.0013751953,"about_ca_system_score_gemma":0.0011171572,"threshold_uncertainty_score":0.03634286},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010305201646056453,"score_gpt":0.26270929347325445,"score_spread":0.252404091827198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077167828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036516837,0.000253385,0.98564076,0.0002176069,0.0002139123,0.000090546186,0.00017500672,0.0075968215,0.002160394],"genre_scores_gemma":[0.05715771,0.00017904575,0.93273777,0.00019769117,0.00013703726,0.00019633576,0.00045169692,0.001889155,0.0070536337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986822,0.00024137483,0.00007593501,0.00022897609,0.0006630131,0.00010843455],"domain_scores_gemma":[0.9981231,0.0006049723,0.00007053803,0.0007731775,0.000357553,0.00007058297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009993503,0.0016513144,0.0016852643,0.0021240928,0.001059367,0.0018809858,0.0032736592,0.001949469,0.016356232],"category_scores_gemma":[0.0061242613,0.0006615269,0.0010576788,0.0026007832,0.0013147533,0.0022803685,0.003122378,0.0025034144,0.0068126502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006474525,0.00013764683,0.00038479333,0.00016541455,0.000099473924,0.00012574022,0.00010707603,0.05464084,0.009656232,0.03617456,0.03353797,0.8643229],"study_design_scores_gemma":[0.00024215438,0.0001546705,0.0004014804,0.00004157798,0.00006969033,0.00034702037,0.00007683019,0.8379079,0.036637962,0.09617268,0.027842477,0.000105597086],"about_ca_topic_score_codex":0.003499331,"about_ca_topic_score_gemma":0.005146152,"teacher_disagreement_score":0.016356232,"about_ca_system_score_codex":0.0009709098,"about_ca_system_score_gemma":0.0018517605,"threshold_uncertainty_score":0.054717064},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010924037940400132,"score_gpt":0.2639048718195904,"score_spread":0.25298083387919024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081923266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6039449,0.00041605456,0.38478726,0.0005140217,0.000064844506,0.0002567594,0.001285538,0.00038956103,0.008341034],"genre_scores_gemma":[0.78730744,0.0003657086,0.20130406,0.00017777456,0.000046614394,0.0002051372,0.0015396511,0.0002277161,0.008825887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.0001538443,0.00003378087,0.00017175343,0.00008910978,0.00009655872],"domain_scores_gemma":[0.99525285,0.0031218522,0.0004496333,0.00041336313,0.00030679014,0.0004554611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089633313,0.0011153101,0.0016674561,0.0020664306,0.0010873553,0.0021771332,0.0019239079,0.0013115323,0.005562891],"category_scores_gemma":[0.0059163556,0.0012326504,0.00108259,0.0019967165,0.0010877858,0.0038043098,0.001524634,0.00158139,0.0003739166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011228609,0.00062544853,0.006453107,0.0011701065,0.00036130482,0.00075087795,0.00103203,0.4009295,0.010134067,0.4409981,0.0083185155,0.12810393],"study_design_scores_gemma":[0.00010728362,0.00013091683,0.0008426612,0.00007117749,0.00007745277,0.00013236543,0.0002427657,0.5455662,0.0026607856,0.44855675,0.0015852936,0.000026433881],"about_ca_topic_score_codex":0.0027828682,"about_ca_topic_score_gemma":0.0063097016,"teacher_disagreement_score":0.005562891,"about_ca_system_score_codex":0.0012396076,"about_ca_system_score_gemma":0.0011230242,"threshold_uncertainty_score":0.018609762},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024719906679499283,"score_gpt":0.27085628613100643,"score_spread":0.24613637945150715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084046657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023028644,0.0016509439,0.89660305,0.0023655875,0.00057505653,0.0001809594,0.00062036637,0.00041928398,0.07455624],"genre_scores_gemma":[0.59920925,0.0027045317,0.26190585,0.00070000655,0.0006392369,0.00043807251,0.0015282274,0.0005436123,0.13233119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993917,0.0001713161,0.000018806899,0.00016184777,0.00014789584,0.000108459535],"domain_scores_gemma":[0.99925727,0.00036556428,0.00008655885,0.000081295984,0.00010751035,0.000101741876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175296,0.00096174097,0.0012350578,0.0008282015,0.0008549935,0.0019517785,0.0014214646,0.002264851,0.01791007],"category_scores_gemma":[0.003165204,0.00050492835,0.0008550133,0.00095107657,0.0012245236,0.001846067,0.0017346456,0.0027164978,0.0013709312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017578299,0.00014380434,0.00039754622,0.0002972299,0.000051694868,0.0002744343,0.00011878537,0.5189404,0.0009589979,0.36151895,0.0318101,0.0853123],"study_design_scores_gemma":[0.000059761205,0.00007159742,0.00025048456,0.000066625355,0.000026213247,0.0003476112,0.00016164144,0.6455126,0.001080376,0.32101157,0.031386957,0.000024592397],"about_ca_topic_score_codex":0.0020405962,"about_ca_topic_score_gemma":0.0016844886,"teacher_disagreement_score":0.01791007,"about_ca_system_score_codex":0.0012042772,"about_ca_system_score_gemma":0.0012705517,"threshold_uncertainty_score":0.059915125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08774811797470744,"score_gpt":0.42137295086084653,"score_spread":0.3336248328861391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087975652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009404512,0.0008786396,0.97758,0.0005663809,0.00019806916,0.000049996026,0.000060879138,0.000038354818,0.011223197],"genre_scores_gemma":[0.4690076,0.004075466,0.48918426,0.00064248254,0.00068629545,0.00067762483,0.00036148334,0.0004268069,0.03493799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932694,0.00033479236,0.000020105444,0.00007100155,0.00019150448,0.000055556127],"domain_scores_gemma":[0.9985683,0.0010194384,0.00008106356,0.00009046062,0.0001524817,0.0000881852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074002,0.001331429,0.0016358241,0.0015999341,0.0010355283,0.0015855061,0.0013606444,0.0015755832,0.0058977525],"category_scores_gemma":[0.0063919625,0.00061718596,0.0012888476,0.001438501,0.002893964,0.0019164017,0.003582227,0.00279242,0.0005235266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008880922,0.00006244541,0.0003007384,0.00021453926,0.000050843875,0.00005282184,0.00011120617,0.44875756,0.0009996317,0.5066649,0.002822977,0.039873447],"study_design_scores_gemma":[0.000011559643,0.000025762727,0.00006076653,0.000029619678,0.000008510023,0.000013092047,0.00002652947,0.84751135,0.00018858457,0.1499861,0.002127151,0.000010863651],"about_ca_topic_score_codex":0.003953837,"about_ca_topic_score_gemma":0.0034822526,"teacher_disagreement_score":0.0058977525,"about_ca_system_score_codex":0.0011430068,"about_ca_system_score_gemma":0.0011893733,"threshold_uncertainty_score":0.019729972},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022019800699498385,"score_gpt":0.2781955289469787,"score_spread":0.2561757282474803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088165054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031311303,0.0004066845,0.9636924,0.00022293186,0.00005531803,0.000046518788,0.00004892509,0.0002503719,0.003965503],"genre_scores_gemma":[0.6736957,0.0002778553,0.32032973,0.00020435332,0.000082124476,0.00026150103,0.0001490282,0.000148044,0.004851568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960095,0.00022895365,0.000010404353,0.00004095149,0.00008543257,0.000033411045],"domain_scores_gemma":[0.99930596,0.00044576748,0.000049050745,0.00007846679,0.00008571293,0.00003496264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012681832,0.00048918265,0.0011008043,0.00039471465,0.00031812236,0.0006698811,0.0012986913,0.0009909996,0.0025473917],"category_scores_gemma":[0.003043305,0.00034520664,0.00047121482,0.0005862466,0.0006437862,0.0011342765,0.0012079668,0.0011229737,0.00026847594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011954563,0.00007553633,0.0002640191,0.000076341574,0.000036408317,0.000050645125,0.000051924224,0.9273531,0.0011578626,0.02025425,0.0027181269,0.047842264],"study_design_scores_gemma":[0.00001587738,0.000018474657,0.0000363319,0.0000033155184,0.0000035763014,0.0000062993736,0.0000043412792,0.996494,0.00012256615,0.0030684613,0.00022500473,0.00000184437],"about_ca_topic_score_codex":0.0022822374,"about_ca_topic_score_gemma":0.0028971347,"teacher_disagreement_score":0.0025473917,"about_ca_system_score_codex":0.00054376863,"about_ca_system_score_gemma":0.00064342277,"threshold_uncertainty_score":0.008521855},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00744222266980682,"score_gpt":0.2617487429915411,"score_spread":0.2543065203217343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088470271","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37366208,0.0049404814,0.17637064,0.042150952,0.00090574316,0.000098880126,0.0010798611,0.00050528126,0.4002861],"genre_scores_gemma":[0.95072985,0.0014393404,0.013258081,0.0023745054,0.000609168,0.00016401884,0.0004532724,0.00019231916,0.030779429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981914,0.00058697734,0.000038297854,0.0003549681,0.00043306572,0.0003953303],"domain_scores_gemma":[0.9882365,0.008342726,0.00046196807,0.0015655746,0.0006852579,0.0007079894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024977173,0.00061990274,0.0016525147,0.0015898356,0.0035446808,0.004166626,0.0021655343,0.003262003,0.01255256],"category_scores_gemma":[0.01676644,0.00061109185,0.0014349718,0.002247657,0.006385897,0.006452118,0.0032703949,0.00533975,0.0009709594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049474835,0.000021983635,0.00041934985,0.00004169267,0.000012392381,0.000045534252,0.00018442428,0.0045062476,0.00020900642,0.9843997,0.0062646014,0.0038457124],"study_design_scores_gemma":[0.000019959225,0.0000030215306,0.00015151566,0.000011618732,0.000004626101,0.000027276734,0.000036978203,0.009000808,0.000076065255,0.98890054,0.0017623996,0.0000051139023],"about_ca_topic_score_codex":0.0057501784,"about_ca_topic_score_gemma":0.006082568,"teacher_disagreement_score":0.01255256,"about_ca_system_score_codex":0.0028415408,"about_ca_system_score_gemma":0.0016041257,"threshold_uncertainty_score":0.041992486},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024395901651674753,"score_gpt":0.315726119814678,"score_spread":0.29133021816300325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090424186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18374239,0.0036970712,0.73451537,0.006674966,0.00057995686,0.0001879934,0.00065417134,0.00051973114,0.069428355],"genre_scores_gemma":[0.8281397,0.0030619083,0.13821103,0.00077940914,0.0009672745,0.00067721214,0.00065698085,0.00051043386,0.026996003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851614,0.0005624004,0.000044021792,0.0003785866,0.00029772279,0.0002011623],"domain_scores_gemma":[0.98027635,0.01573199,0.0007558228,0.0009128795,0.0009834819,0.0013394494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026909346,0.0017467812,0.002009885,0.0035635806,0.002576495,0.0033028242,0.003349403,0.003445927,0.014290058],"category_scores_gemma":[0.025930898,0.0010064006,0.0017717336,0.0026348275,0.0060456195,0.008400262,0.0037621327,0.0070412527,0.0013446503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002947641,0.00006771368,0.0006311082,0.00021923857,0.000044207758,0.00010082614,0.00028780903,0.053195044,0.0033936233,0.9159792,0.007504233,0.018282345],"study_design_scores_gemma":[0.000034208417,0.00012635738,0.00045428742,0.00006766016,0.000034396777,0.00013499724,0.00010439174,0.29955322,0.001975319,0.6951921,0.002275,0.000048008533],"about_ca_topic_score_codex":0.0013637987,"about_ca_topic_score_gemma":0.0014020095,"teacher_disagreement_score":0.014290058,"about_ca_system_score_codex":0.0024747362,"about_ca_system_score_gemma":0.0016940371,"threshold_uncertainty_score":0.04780501},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; 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","score_opus":0.04587999302022705,"score_gpt":0.29869370758595015,"score_spread":0.2528137145657231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090914983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018371616,0.0015279006,0.93776953,0.004745903,0.00037511063,0.00022360864,0.0011049839,0.00011869265,0.03576269],"genre_scores_gemma":[0.5206113,0.004154524,0.4408825,0.001536055,0.0011057123,0.00095302815,0.002550077,0.0004168301,0.02778997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995031,0.0027255265,0.00015414557,0.00035621907,0.0012394399,0.00049354794],"domain_scores_gemma":[0.9819826,0.014508913,0.00068613497,0.00072968507,0.0015000564,0.0005927106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062627257,0.0016976787,0.0019388628,0.001778582,0.002227457,0.005255667,0.00390316,0.0030820009,0.011115386],"category_scores_gemma":[0.027362807,0.0014501198,0.002055399,0.0041253455,0.0038561109,0.007716883,0.0027821618,0.009310774,0.000907113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013585477,0.00013202868,0.00039535938,0.0001724618,0.000060205046,0.00011955768,0.00015776798,0.10340422,0.00046204988,0.86306405,0.010733185,0.021163216],"study_design_scores_gemma":[0.000031806263,0.000014503909,0.00011192495,0.000039526305,0.000020146692,0.000027652057,0.00003276702,0.25655317,0.0001998969,0.74055606,0.002399272,0.000013353678],"about_ca_topic_score_codex":0.014055847,"about_ca_topic_score_gemma":0.012973336,"teacher_disagreement_score":0.014055847,"about_ca_system_score_codex":0.0046570613,"about_ca_system_score_gemma":0.0052803596,"threshold_uncertainty_score":0.037184596},"labels":[],"label_agreement":null},{"id":"W2094860999","doi":"10.1016/j.disopt.2005.08.003","title":"Wavelength routing of uniform instances in all-optical rings","year":2005,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Wavelength; Routing (electronic design automation); Computer science; Computer network; Optoelectronics; Materials science","score_opus":0.010179135015785585,"score_gpt":0.233660605169615,"score_spread":0.22348147015382944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094860999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36225328,0.00088496,0.6139825,0.001430563,0.00019075446,0.00023101695,0.00081741833,0.00037294184,0.019836584],"genre_scores_gemma":[0.8152747,0.0005539594,0.17292204,0.00020397294,0.00013573501,0.00018900716,0.0006352202,0.00019909632,0.009886164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887687,0.0005522769,0.000049328486,0.00020331117,0.00011486829,0.00020336354],"domain_scores_gemma":[0.99674964,0.0021387928,0.00035302635,0.00026046697,0.0001621449,0.00033591533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023594552,0.00089151313,0.0018144716,0.000700068,0.0009732906,0.0028326723,0.002251195,0.0013497717,0.0048819943],"category_scores_gemma":[0.0076576886,0.00090337236,0.0009302261,0.0012906503,0.0012205783,0.002990239,0.0015367497,0.0014284824,0.00024460684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005738382,0.00018850638,0.00096635,0.00018639979,0.00008885062,0.00012595805,0.00012146953,0.7953977,0.00093067024,0.17732088,0.004500599,0.019598752],"study_design_scores_gemma":[0.0000503026,0.00004937065,0.00013414398,0.000013691442,0.000016805994,0.000020933396,0.00004096864,0.92192656,0.0003904948,0.07678911,0.00056035235,0.000007174764],"about_ca_topic_score_codex":0.0029350256,"about_ca_topic_score_gemma":0.003648789,"teacher_disagreement_score":0.0048819943,"about_ca_system_score_codex":0.001981252,"about_ca_system_score_gemma":0.0010931554,"threshold_uncertainty_score":0.01633197},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008249441214177488,"score_gpt":0.20286649082871577,"score_spread":0.1946170496145383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098775996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035250407,0.0008838175,0.9472937,0.00038307623,0.00018658483,0.00010008162,0.00020214266,0.00043658068,0.015263624],"genre_scores_gemma":[0.50668323,0.0013541401,0.47306085,0.00023223132,0.00022012564,0.0003375596,0.00038835168,0.0002552638,0.01746816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983986,0.0007476714,0.00008286222,0.00025341456,0.00029114395,0.0002263387],"domain_scores_gemma":[0.9979808,0.0011814722,0.00017533255,0.00039552324,0.00013508137,0.00013184402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485467,0.0012992567,0.0025904705,0.0007491362,0.0005789389,0.0022551634,0.0021167004,0.0014122422,0.005778567],"category_scores_gemma":[0.005131416,0.0010253878,0.0011619417,0.0024871966,0.0012062972,0.0036292092,0.0022290875,0.0018384956,0.0009164338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036492004,0.0001843034,0.00023666244,0.0002683006,0.00004653396,0.00019796209,0.00006172125,0.82402414,0.003456286,0.1204975,0.0046120253,0.04604962],"study_design_scores_gemma":[0.00002771033,0.00007801658,0.00009097018,0.000013323945,0.000014215616,0.00009234813,0.000020362288,0.9557646,0.0011605027,0.040873323,0.0018466543,0.000017873244],"about_ca_topic_score_codex":0.0014629742,"about_ca_topic_score_gemma":0.0011922965,"teacher_disagreement_score":0.005778567,"about_ca_system_score_codex":0.0009716862,"about_ca_system_score_gemma":0.0008040097,"threshold_uncertainty_score":0.019331276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Travelling salesman problem; Heuristic; Integer programming; Window (computing); Computer science; Mathematics; Algorithm","score_opus":0.004443702601807077,"score_gpt":0.20733811642787947,"score_spread":0.2028944138260724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114675299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020170989,0.0014569093,0.9707619,0.0011531627,0.00023658642,0.00007806124,0.00027407418,0.000102642254,0.005765632],"genre_scores_gemma":[0.7091216,0.0055606524,0.21258052,0.00048724073,0.00082468474,0.00058592367,0.000672271,0.00036045143,0.06980665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987502,0.0006271725,0.000041109033,0.00023544508,0.00016490962,0.00018112971],"domain_scores_gemma":[0.99746096,0.0019024104,0.00025639532,0.00009354794,0.000108026834,0.00017856006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00296941,0.0017106703,0.002143072,0.0008306982,0.0005942607,0.0021122121,0.0028595089,0.0022429896,0.0052883253],"category_scores_gemma":[0.006970747,0.0014099792,0.0010700235,0.0016603036,0.0014368307,0.0037439917,0.0017263448,0.0026067856,0.0005324325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019938967,0.00008096669,0.00034399805,0.00019619604,0.00008054873,0.00012906622,0.00006618009,0.8242376,0.0005645948,0.15512232,0.003375468,0.015603726],"study_design_scores_gemma":[0.00003405898,0.000035464982,0.0000995929,0.000011568187,0.000025336254,0.00003138235,0.000028772369,0.9554594,0.00023372693,0.04227832,0.0017517229,0.000010592296],"about_ca_topic_score_codex":0.00531926,"about_ca_topic_score_gemma":0.002808124,"teacher_disagreement_score":0.00531926,"about_ca_system_score_codex":0.0020033629,"about_ca_system_score_gemma":0.0016348097,"threshold_uncertainty_score":0.017691255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03037697177775578,"score_gpt":0.28519658192086494,"score_spread":0.25481961014310917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115713772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012097916,0.00014966688,0.9830525,0.00020116405,0.000059071717,0.00013443768,0.00023539126,0.0008875181,0.003182351],"genre_scores_gemma":[0.1315447,0.00018574567,0.8613989,0.00016291116,0.00013140877,0.00042322834,0.0012701132,0.00040612274,0.0044768737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827874,0.0003619277,0.0000952099,0.00040241657,0.0006429474,0.00021869632],"domain_scores_gemma":[0.99303955,0.0042737103,0.00028209665,0.0012186279,0.00091154705,0.0002744831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218727,0.0016505804,0.0017430659,0.0024972789,0.0012326104,0.0018576707,0.0031694619,0.0012787733,0.007947572],"category_scores_gemma":[0.00773118,0.0009776964,0.0014658455,0.0034475045,0.0013473372,0.0035232527,0.0024241265,0.0027679512,0.0015218657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014264556,0.0007176199,0.0024013969,0.00047010294,0.0002518146,0.00012838014,0.00024751984,0.26922482,0.016398948,0.09464179,0.018556131,0.59553504],"study_design_scores_gemma":[0.00019173171,0.00013574916,0.0006076219,0.000021434806,0.00006074715,0.00008984271,0.00003465579,0.91365176,0.0048476793,0.076217376,0.0041139033,0.000027432534],"about_ca_topic_score_codex":0.0063067754,"about_ca_topic_score_gemma":0.012231028,"teacher_disagreement_score":0.007947572,"about_ca_system_score_codex":0.0018142685,"about_ca_system_score_gemma":0.0035451287,"threshold_uncertainty_score":0.026587248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021739337531294353,"score_gpt":0.2639957199895441,"score_spread":0.2422563824582497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163661406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004292153,0.0005117236,0.9644447,0.002003352,0.00042001932,0.000046118945,0.00016168051,0.00089404295,0.027226262],"genre_scores_gemma":[0.0853888,0.00050715747,0.8918282,0.0006920713,0.00018682583,0.00012715822,0.00020068619,0.0008185298,0.02025058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.00020918736,0.000033800945,0.00010187543,0.0002763982,0.00007139574],"domain_scores_gemma":[0.998965,0.00051137316,0.000035162604,0.00021668084,0.00023619026,0.000035688485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096619077,0.00080710626,0.00057469227,0.00069945416,0.0010932351,0.0012601148,0.0011075373,0.001214837,0.019762173],"category_scores_gemma":[0.006198298,0.00033649022,0.0008830038,0.001299948,0.0010290296,0.0017109701,0.0011257998,0.0028044186,0.0046340576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024778998,0.00007903253,0.0003432964,0.00030606182,0.000046327204,0.0003668681,0.00019112862,0.057609495,0.005715989,0.65697724,0.064441815,0.21367498],"study_design_scores_gemma":[0.00008985004,0.000091198846,0.00029710762,0.000120520555,0.000039328377,0.00070837233,0.00010522591,0.339837,0.0077596647,0.55883634,0.092054576,0.00006084447],"about_ca_topic_score_codex":0.0022849045,"about_ca_topic_score_gemma":0.0049106176,"teacher_disagreement_score":0.019762173,"about_ca_system_score_codex":0.00075530156,"about_ca_system_score_gemma":0.00086107623,"threshold_uncertainty_score":0.06611109},"labels":[],"label_agreement":null},{"id":"W2298220966","doi":"10.1016/j.disopt.2017.09.003","title":"The quadratic minimum spanning tree problem and its variations","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Distributed minimum spanning tree; Combinatorics; Euclidean minimum spanning tree; Matroid; Mathematics; Context (archaeology); Kruskal's algorithm; Bottleneck; k-minimum spanning tree; Quadratic equation; Tree (set theory); Simple (philosophy); Minimum degree spanning tree; Discrete mathematics; Binary tree; K-ary tree; Computer science; Tree structure","score_opus":0.02206177484825251,"score_gpt":0.28212960636901624,"score_spread":0.26006783152076374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298220966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013364469,0.004794541,0.96660286,0.0015428725,0.0003101139,0.000022237013,0.00015681626,0.00006574594,0.013140401],"genre_scores_gemma":[0.54691434,0.013395399,0.39133948,0.0009803608,0.001967686,0.00025490185,0.00075094425,0.00043262352,0.04396438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993525,0.00026414183,0.000022196977,0.00015661471,0.00017128147,0.000033303753],"domain_scores_gemma":[0.99859554,0.0008816175,0.00015990337,0.00008787614,0.00019093227,0.0000841293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015170765,0.0008392276,0.00091076695,0.00077601115,0.00049317186,0.0014674608,0.0014595148,0.0015728342,0.0030674855],"category_scores_gemma":[0.0060268315,0.00041168812,0.00055662525,0.0017227132,0.0014808233,0.0030655318,0.0015253694,0.00272954,0.0005187792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068704285,0.00008210124,0.00031765844,0.00027781777,0.00003970346,0.00006828056,0.00009951907,0.26145014,0.0012654748,0.6656554,0.008661376,0.062013775],"study_design_scores_gemma":[0.000012043503,0.000020852354,0.00016917451,0.000019204523,0.000011115965,0.000063240324,0.000023680881,0.6408992,0.00015088984,0.35114974,0.0074691763,0.000011669902],"about_ca_topic_score_codex":0.0023410576,"about_ca_topic_score_gemma":0.002094812,"teacher_disagreement_score":0.0030674855,"about_ca_system_score_codex":0.0008440414,"about_ca_system_score_gemma":0.00075969304,"threshold_uncertainty_score":0.010261774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023612876139482653,"score_gpt":0.27394445528749767,"score_spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507811569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3835131,0.0009862586,0.56834,0.0029749232,0.00026669342,0.00008283891,0.00052795425,0.0005173207,0.0427909],"genre_scores_gemma":[0.9520741,0.0005168863,0.023454081,0.00031728018,0.00037240592,0.00014160246,0.0004148417,0.00018147695,0.022527413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00024716218,0.000028691897,0.00017511335,0.00020401803,0.00010199826],"domain_scores_gemma":[0.99674326,0.0018952986,0.00039067483,0.00027858806,0.00029149567,0.0004007464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084389985,0.0010721596,0.00088734017,0.0016330548,0.0011748184,0.0034932154,0.0010876568,0.0011318398,0.008028037],"category_scores_gemma":[0.006095933,0.00035860017,0.0006784348,0.0009877039,0.0019473425,0.0032172105,0.002051217,0.0025911678,0.0007254588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005366087,0.000029258583,0.0003975956,0.00004708423,0.000017204466,0.000045249384,0.00012534404,0.01900255,0.0010330834,0.970446,0.0023267744,0.0064761853],"study_design_scores_gemma":[0.000012288153,0.000013012959,0.00015328078,0.000007616032,0.00000894105,0.000015292359,0.000042405634,0.07410585,0.00047785908,0.9242567,0.000898535,0.000008214289],"about_ca_topic_score_codex":0.0012410169,"about_ca_topic_score_gemma":0.0017260144,"teacher_disagreement_score":0.008028037,"about_ca_system_score_codex":0.0014708457,"about_ca_system_score_gemma":0.00072813744,"threshold_uncertainty_score":0.026856422},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02309696272240792,"score_gpt":0.2800881309899574,"score_spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509691293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2614407,0.00048127872,0.674408,0.0015303324,0.0002963622,0.00015057901,0.0008707372,0.00065650104,0.06016554],"genre_scores_gemma":[0.8811969,0.0005608783,0.0818416,0.0005547098,0.00044008397,0.000316522,0.0011645532,0.0006407014,0.033284068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.0003289194,0.000056704117,0.0002837516,0.00042430215,0.0002515099],"domain_scores_gemma":[0.9955219,0.0024208233,0.00042415137,0.00048050476,0.00038017673,0.00077255303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753772,0.0014138597,0.0014557469,0.001527968,0.0013760836,0.004610181,0.0016006503,0.0016070267,0.02017899],"category_scores_gemma":[0.0066912407,0.00096401194,0.0014742104,0.0010646761,0.0031111594,0.0059670336,0.0031746423,0.0054139565,0.0020362786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006427096,0.00007378961,0.00025378988,0.00008160915,0.000013858022,0.00008025079,0.0000968363,0.009082842,0.0011177122,0.98059213,0.0032516364,0.005291264],"study_design_scores_gemma":[0.000017394956,0.000023545115,0.0001522335,0.0000129767095,0.000006367572,0.000049629994,0.000041942894,0.03856443,0.0005153141,0.9595261,0.0010765682,0.000013514325],"about_ca_topic_score_codex":0.00041204641,"about_ca_topic_score_gemma":0.000873895,"teacher_disagreement_score":0.02017899,"about_ca_system_score_codex":0.00095777196,"about_ca_system_score_gemma":0.0008369819,"threshold_uncertainty_score":0.06750548},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015549613876668566,"score_gpt":0.24941590798724567,"score_spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745314127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13227151,0.027146157,0.7225216,0.013507492,0.001501995,0.00016371148,0.0012073313,0.0003983685,0.101281874],"genre_scores_gemma":[0.76716113,0.013058389,0.16917019,0.0022112236,0.0044510486,0.0003723648,0.0013556392,0.0005560673,0.041664004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771774,0.0007848532,0.00006343524,0.0005787895,0.0005861183,0.00026917033],"domain_scores_gemma":[0.9957918,0.002583971,0.00033649275,0.0006816933,0.00027891065,0.00032698456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178104,0.0015698194,0.0025340612,0.0018561534,0.0014577286,0.004683056,0.0040378436,0.0032500064,0.0068157353],"category_scores_gemma":[0.009072319,0.0007079205,0.002066402,0.0058393157,0.0034825571,0.007885827,0.0035827274,0.0065924195,0.00068862183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012953798,0.00012140266,0.00040739813,0.00027014155,0.00007265605,0.00010360617,0.00013519842,0.07359941,0.00067055953,0.87964493,0.011320108,0.033525027],"study_design_scores_gemma":[0.000032168016,0.0000228078,0.00033800534,0.000031766005,0.00002712681,0.00009440876,0.000047112477,0.15809114,0.00020891416,0.8329742,0.008108732,0.000023586237],"about_ca_topic_score_codex":0.004335263,"about_ca_topic_score_gemma":0.004276356,"teacher_disagreement_score":0.0068157353,"about_ca_system_score_codex":0.0035279884,"about_ca_system_score_gemma":0.0013950785,"threshold_uncertainty_score":0.025597453},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.020127424260410667,"score_gpt":0.2707476361752828,"score_spread":0.25062021191487216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783589701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006411565,0.00042933002,0.9476553,0.0015063165,0.0003785913,0.0007085226,0.0015045606,0.011986163,0.02941965],"genre_scores_gemma":[0.06612011,0.00034198398,0.8998302,0.0005054634,0.00022520554,0.0010301835,0.004015265,0.0019272987,0.026004298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981577,0.00023362768,0.000139448,0.00069839595,0.00048361532,0.00028732256],"domain_scores_gemma":[0.99714726,0.00157829,0.00014866688,0.0005544894,0.00036721159,0.00020402065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013568824,0.0029582684,0.0018053227,0.0019468525,0.001825326,0.003545457,0.004435689,0.0030194032,0.06520268],"category_scores_gemma":[0.0059744315,0.0011544549,0.0026189736,0.0026127966,0.0012757806,0.004899599,0.0038162156,0.00367861,0.02332064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088718307,0.00096830126,0.0007970208,0.0010125872,0.0001754696,0.00029307685,0.00042743527,0.08166296,0.008747185,0.08564517,0.16175576,0.6576279],"study_design_scores_gemma":[0.00093478087,0.00040412348,0.00077936525,0.0001447968,0.00013271623,0.0006459915,0.00037601602,0.65581125,0.0072405827,0.2814659,0.0519237,0.00014075631],"about_ca_topic_score_codex":0.00787008,"about_ca_topic_score_gemma":0.015026409,"teacher_disagreement_score":0.06520268,"about_ca_system_score_codex":0.0033144082,"about_ca_system_score_gemma":0.0050313515,"threshold_uncertainty_score":0.21812469},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04017734624734458,"score_gpt":0.28953988569646294,"score_spread":0.24936253944911835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894812324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015256425,0.000063422776,0.99693394,0.00013786528,0.000021841992,0.000017270877,0.000021710868,0.0001868987,0.0010913475],"genre_scores_gemma":[0.20624392,0.00028119682,0.7820092,0.00036074172,0.00011756017,0.00044401363,0.00018522999,0.00058566337,0.009772485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950564,0.00019235734,0.000019799165,0.00008117711,0.00016627117,0.000034805533],"domain_scores_gemma":[0.9989153,0.00074041256,0.00006729219,0.000084089654,0.00014516951,0.00004781233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014503981,0.0009229489,0.0009681083,0.0003809315,0.00039728638,0.0010033676,0.0015032192,0.0014231278,0.0048761046],"category_scores_gemma":[0.0037827292,0.0010811471,0.0005469181,0.0005608174,0.001183353,0.0014148395,0.0020713087,0.0028338283,0.0009597789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066949025,0.000057181536,0.0001845737,0.00013412126,0.000039661107,0.000027951444,0.00004516065,0.85331416,0.001639038,0.069175646,0.0039352425,0.07138035],"study_design_scores_gemma":[0.0000037442696,0.000005984513,0.0000090412495,0.0000037618006,0.0000015583049,0.000003683279,0.000001097775,0.99273586,0.00020962769,0.0067884047,0.00023590031,0.0000013214257],"about_ca_topic_score_codex":0.001873661,"about_ca_topic_score_gemma":0.003124789,"teacher_disagreement_score":0.0048761046,"about_ca_system_score_codex":0.00080688205,"about_ca_system_score_gemma":0.0014620022,"threshold_uncertainty_score":0.016312182},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02363428599131756,"score_gpt":0.2764234025157367,"score_spread":0.25278911652441916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919667091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30131072,0.003905075,0.6296552,0.0021217559,0.00029418006,0.00010242566,0.00053087797,0.00015628971,0.061923586],"genre_scores_gemma":[0.9197169,0.0025139174,0.06455981,0.0002210736,0.0006310601,0.00020294072,0.0005824663,0.00028296892,0.011288849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963709,0.0015232482,0.00016080937,0.00045670324,0.0010526994,0.0004355834],"domain_scores_gemma":[0.974572,0.018876733,0.0024771874,0.000889291,0.0016738486,0.0015109334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048742425,0.0015554989,0.0022071009,0.005802202,0.001493239,0.0059099006,0.0045276796,0.0017996861,0.0067645176],"category_scores_gemma":[0.037389804,0.0013898934,0.0017079812,0.0028104044,0.0074281157,0.009775642,0.006351898,0.0050351867,0.0005316832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052321753,0.000018595696,0.0005882951,0.000062491716,0.000020669402,0.00003413849,0.0001716808,0.018511182,0.00032513367,0.9756589,0.0004753142,0.004081166],"study_design_scores_gemma":[0.000015080234,0.000031165222,0.000717158,0.000052315205,0.000019229949,0.00007144186,0.0001466714,0.11993347,0.00049672625,0.8770212,0.0014745224,0.00002109579],"about_ca_topic_score_codex":0.0014709682,"about_ca_topic_score_gemma":0.0011058911,"teacher_disagreement_score":0.0067645176,"about_ca_system_score_codex":0.00299731,"about_ca_system_score_gemma":0.0010331105,"threshold_uncertainty_score":0.025777757},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014847516591581499,"score_gpt":0.23939515683151302,"score_spread":0.2245476402399315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923556723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14929736,0.002233523,0.7184098,0.007861599,0.00028706394,0.0003558491,0.0013980676,0.00037206837,0.11978469],"genre_scores_gemma":[0.8376357,0.0016542259,0.12985075,0.0006441153,0.0009038901,0.0007495942,0.0010944072,0.0003169,0.027150406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994221,0.002575626,0.00023848706,0.0006940922,0.0014523393,0.00081854506],"domain_scores_gemma":[0.9553624,0.0392213,0.0017603299,0.0019167616,0.00095700915,0.0007822088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050290865,0.0019360374,0.0028692028,0.0021152887,0.0016229701,0.007898756,0.0039465837,0.0046473104,0.016037527],"category_scores_gemma":[0.040436953,0.0012986636,0.0026762737,0.004772198,0.0034036152,0.008504356,0.0038362027,0.0062046517,0.00094468833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024031583,0.00038381692,0.0010460359,0.00040480116,0.00014615575,0.00052276836,0.00015918314,0.19455053,0.00042654396,0.7711115,0.009722346,0.021286024],"study_design_scores_gemma":[0.00007301324,0.000034326484,0.0002796338,0.000032674347,0.000045121913,0.00017758408,0.00007171988,0.41204554,0.00024446088,0.58527696,0.0016930348,0.000025879823],"about_ca_topic_score_codex":0.0031408481,"about_ca_topic_score_gemma":0.0026073845,"teacher_disagreement_score":0.016037527,"about_ca_system_score_codex":0.0028695017,"about_ca_system_score_gemma":0.0023059598,"threshold_uncertainty_score":0.053650856},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08705139819538114,"score_gpt":0.36025948128975266,"score_spread":0.2732080830943715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081538319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045606587,0.00021147239,0.9889938,0.00028731595,0.00005719709,0.000023110066,0.00007990347,0.00006722466,0.0057193055],"genre_scores_gemma":[0.5419098,0.00084915065,0.43764666,0.0003391629,0.00018515141,0.00031561824,0.00068960444,0.00037471662,0.017690146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925965,0.00022818329,0.000028803657,0.000094690666,0.00033858424,0.000050036095],"domain_scores_gemma":[0.9986143,0.0009359624,0.000078593046,0.00007850039,0.00023438189,0.00005818657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013812549,0.000907257,0.001303158,0.0008430033,0.00056861574,0.0015906389,0.001064412,0.00093162304,0.006207695],"category_scores_gemma":[0.0041574477,0.0005060302,0.0008497904,0.001010825,0.0012697466,0.0012886985,0.0018277968,0.0020547456,0.000735847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011372746,0.00007893223,0.0003271394,0.00019946013,0.000042714026,0.00003479106,0.000049632225,0.7104136,0.0014474207,0.2242313,0.0042994265,0.058761947],"study_design_scores_gemma":[0.000007368659,0.000013242933,0.000029155035,0.0000070968663,0.000003185198,0.000005485299,0.00000428174,0.95218563,0.0001923407,0.046884976,0.0006638697,0.0000033624563],"about_ca_topic_score_codex":0.0036842157,"about_ca_topic_score_gemma":0.004068246,"teacher_disagreement_score":0.006207695,"about_ca_system_score_codex":0.0015174847,"about_ca_system_score_gemma":0.0013491529,"threshold_uncertainty_score":0.020766854},"labels":[],"label_agreement":null},{"id":"W3184586842","doi":"10.1016/j.disopt.2021.100658","title":"Preface: Optimization and Discrete Geometry","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Discrete geometry; Geometry; Mathematical optimization","score_opus":0.006629734632258789,"score_gpt":0.21738132398167087,"score_spread":0.21075158934941207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184586842","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021224858,0.1301462,0.09084881,0.079766996,0.53504014,0.00014087142,0.0021210979,0.00046866183,0.15934472],"genre_scores_gemma":[0.046259593,0.09059759,0.02726748,0.016017813,0.5330732,0.00023493485,0.0022782984,0.0015921567,0.28267887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891794,0.0003453203,0.00008900383,0.00022435132,0.00037671448,0.000046630645],"domain_scores_gemma":[0.99322,0.002932625,0.0002296878,0.00048304512,0.0025764115,0.0005582755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020785143,0.0025689893,0.0017804641,0.0037485606,0.0017169507,0.0038145084,0.0013310658,0.0019420489,0.0460397],"category_scores_gemma":[0.014245348,0.00054974086,0.0012028493,0.004464693,0.0017723048,0.0037708483,0.0014060149,0.0062944456,0.020342728],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026040187,0.00004897977,0.00015884542,0.0004227052,0.000020191848,0.0000730614,0.00008786409,0.002615177,0.00026665026,0.09703079,0.84711754,0.052132163],"study_design_scores_gemma":[0.00002297927,0.000070101836,0.0012040097,0.0006288474,0.00003371725,0.00022247,0.00014948084,0.005018248,0.000372152,0.18387909,0.8083538,0.00004525635],"about_ca_topic_score_codex":0.0036693648,"about_ca_topic_score_gemma":0.0043541347,"teacher_disagreement_score":0.0460397,"about_ca_system_score_codex":0.0032804282,"about_ca_system_score_gemma":0.0019325855,"threshold_uncertainty_score":0.15401816},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004837548440651212,"score_gpt":0.1978723109585278,"score_spread":0.1930347625178766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187519750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18085054,0.00080447755,0.6638568,0.0012114207,0.00013095677,0.00009792349,0.000852102,0.00019169506,0.15200414],"genre_scores_gemma":[0.85047376,0.0009511141,0.10845545,0.00040998572,0.00009465207,0.00010928496,0.00083343114,0.00013503351,0.038537167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997595,0.000074292475,0.000005984745,0.000038044414,0.000087569824,0.000034621342],"domain_scores_gemma":[0.9997938,0.00008560713,0.000020261486,0.000023764444,0.000049158956,0.000027451853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031702573,0.00030528576,0.00045707537,0.00058312505,0.0003696201,0.0009374401,0.00039734357,0.00037836764,0.011540327],"category_scores_gemma":[0.0010841525,0.00020421599,0.00024063712,0.0006415579,0.00074398215,0.0006480909,0.0006436712,0.0006637264,0.0008189096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006766782,0.000044427354,0.00070691865,0.0001276498,0.000023353725,0.00009023025,0.000048974878,0.09281965,0.003144419,0.84852785,0.0076049236,0.046794046],"study_design_scores_gemma":[0.000053896307,0.00011462406,0.0016524608,0.000059360395,0.000016187685,0.00030539813,0.000111017165,0.48199803,0.0022136928,0.49040362,0.023044985,0.000026708893],"about_ca_topic_score_codex":0.002548373,"about_ca_topic_score_gemma":0.0026477769,"teacher_disagreement_score":0.011540327,"about_ca_system_score_codex":0.0005002782,"about_ca_system_score_gemma":0.0004329642,"threshold_uncertainty_score":0.038606226},"labels":[],"label_agreement":null},{"id":"W4399114203","doi":"10.1016/j.disopt.2024.100845","title":"Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Single-machine scheduling; Computer science; Sequence (biology); Mathematical optimization; Simulated annealing; Schedule; Set (abstract data type); Job shop; Scheduling (production processes); Due date; Flow shop scheduling; Algorithm; Mathematics","score_opus":0.01598366804719975,"score_gpt":0.25198201115861185,"score_spread":0.2359983431114121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399114203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26862422,0.00089081016,0.7198055,0.0018663235,0.00044768106,0.000385808,0.001132585,0.00055029383,0.00629684],"genre_scores_gemma":[0.93860996,0.00023027335,0.052580513,0.000115683535,0.00017287597,0.00027727595,0.00042963488,0.00010273663,0.0074809887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780315,0.0007411012,0.00011592502,0.00059540075,0.00026919926,0.00047514253],"domain_scores_gemma":[0.993454,0.0045512095,0.000517449,0.00036003286,0.0004024668,0.0007149444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035645915,0.0019839846,0.0045297923,0.00085792644,0.001183547,0.002579016,0.0038889586,0.004020005,0.004444711],"category_scores_gemma":[0.0071824696,0.0021260728,0.0017567187,0.0014750017,0.0015147654,0.00275046,0.0017314291,0.0025596044,0.00048445826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011546712,0.0002852498,0.0006756457,0.0003271007,0.000119174096,0.0005794587,0.00008718197,0.9743595,0.003044449,0.0122809075,0.0010070101,0.0060796374],"study_design_scores_gemma":[0.00009199405,0.00011801979,0.00039568281,0.0000062071977,0.00002474735,0.000054283842,0.00001999989,0.9939667,0.00056901947,0.0045830854,0.00014916879,0.000021007772],"about_ca_topic_score_codex":0.0027606413,"about_ca_topic_score_gemma":0.002003215,"teacher_disagreement_score":0.0045297923,"about_ca_system_score_codex":0.0014255783,"about_ca_system_score_gemma":0.0021936721,"threshold_uncertainty_score":0.018851638},"labels":[],"label_agreement":null},{"id":"W4401688606","doi":"10.1016/j.disopt.2024.100858","title":"Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Binary number; Mathematical optimization; Constraint (computer-aided design); Quadratic equation; Quadratic programming; Applied mathematics; Geometry; Arithmetic","score_opus":0.007762357146174873,"score_gpt":0.21547855321190684,"score_spread":0.20771619606573197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401688606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00871206,0.002293998,0.9141945,0.002098006,0.0005203282,0.000055600503,0.0002827294,0.00015274988,0.07169],"genre_scores_gemma":[0.42484105,0.009365339,0.45739946,0.0025383781,0.0023925558,0.00035170725,0.00091953645,0.00080450025,0.10138755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990728,0.00038204467,0.00004524878,0.00014792143,0.00027962716,0.000072277086],"domain_scores_gemma":[0.9989203,0.0005473336,0.00012114098,0.00014120522,0.00021934397,0.00005071365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018764971,0.0012718169,0.00090301904,0.0014288499,0.0011037434,0.0021177046,0.002269673,0.0011859626,0.015327411],"category_scores_gemma":[0.005489894,0.000792839,0.0013279465,0.0025283645,0.0021730566,0.0049934257,0.0021733472,0.0031384588,0.002840621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002437198,0.00006304007,0.00015112219,0.00021551266,0.000019021834,0.00008779048,0.00014582704,0.07817558,0.0006657663,0.8855823,0.008311773,0.026557766],"study_design_scores_gemma":[0.000010506421,0.000033422246,0.00016587846,0.00006428768,0.000012154082,0.00006352986,0.00008862997,0.20747876,0.0006810892,0.77394,0.01743358,0.000028133565],"about_ca_topic_score_codex":0.0041756956,"about_ca_topic_score_gemma":0.004352264,"teacher_disagreement_score":0.015327411,"about_ca_system_score_codex":0.001546762,"about_ca_system_score_gemma":0.0010901121,"threshold_uncertainty_score":0.051275313},"labels":[],"label_agreement":null},{"id":"W4402564803","doi":"10.1016/j.disopt.2024.100860","title":"Approximation schemes for Min-Sum <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si35.svg\" display=\"inline\" id=\"d1e488\"><mml:mi>k</mml:mi></mml:math>-Clustering","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Mathematics; Algorithm; Computer science; Combinatorics; Computer graphics (images); Statistics","score_opus":0.020656615144146215,"score_gpt":0.2545916724953852,"score_spread":0.233935057351239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402564803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030178376,0.0038615821,0.9488713,0.0021969604,0.00029007392,0.00025531446,0.001315782,0.0024956653,0.010534901],"genre_scores_gemma":[0.3554804,0.0023326117,0.62609833,0.0010565609,0.00042595773,0.00048265516,0.0036005522,0.0010846654,0.00943819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530184,0.0010128644,0.00029648267,0.0012194936,0.0014097034,0.00075964804],"domain_scores_gemma":[0.9918201,0.003850221,0.00067374896,0.0022808823,0.0009948935,0.00038013706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039706402,0.0031747087,0.0031769187,0.0020474126,0.0017297938,0.0041626985,0.005996537,0.0028749628,0.008235549],"category_scores_gemma":[0.017334573,0.00091042597,0.0029411495,0.004336632,0.0016084012,0.009193225,0.0047572968,0.0046891207,0.0038838976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014754352,0.00046819396,0.0027710688,0.0014213804,0.00033493244,0.00019503596,0.0007561756,0.5279212,0.0049931398,0.1537429,0.03377086,0.27214968],"study_design_scores_gemma":[0.000059739297,0.00013957643,0.00038077973,0.000089170084,0.00007414163,0.00026955965,0.00017394472,0.84458464,0.0028230504,0.1439499,0.007418457,0.00003703726],"about_ca_topic_score_codex":0.0048559103,"about_ca_topic_score_gemma":0.007288126,"teacher_disagreement_score":0.008235549,"about_ca_system_score_codex":0.0053838347,"about_ca_system_score_gemma":0.0031213167,"threshold_uncertainty_score":0.03906262},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"George (robot); Mathematics; Mathematical economics; Operations research; Computer science; Artificial intelligence","score_opus":0.01855816165973135,"score_gpt":0.31031889184915556,"score_spread":0.2917607301894242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6625772","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028067638,0.032563336,0.0007872611,0.1829975,0.7700052,0.00002114239,0.00019848345,0.00007245237,0.013073879],"genre_scores_gemma":[0.004086626,0.02651672,0.0003591856,0.040446956,0.865436,0.000029817244,0.00015379232,0.00017912335,0.06279185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865794,0.00025765586,0.00013339146,0.0004052784,0.00041362314,0.00013221487],"domain_scores_gemma":[0.9935626,0.0024659669,0.00047071677,0.00033049838,0.0018383194,0.0013319249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022999954,0.001481736,0.0022074233,0.0016362633,0.0018436216,0.004721178,0.0018118264,0.0051918724,0.041253485],"category_scores_gemma":[0.011516615,0.00046845956,0.0009189905,0.0011022893,0.001544249,0.0049364464,0.0018114496,0.00739054,0.021449808],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003078331,0.000013401081,0.000048977246,0.00008649752,0.000007097942,0.00005348274,0.000017375,0.000043000666,0.00004578593,0.00234943,0.9873375,0.009966653],"study_design_scores_gemma":[0.000013476941,0.000021469852,0.0001900913,0.00013256838,0.000008818674,0.00013214124,0.000028799624,0.00011420079,0.000109740395,0.0034513506,0.9957866,0.000010783187],"about_ca_topic_score_codex":0.0010696857,"about_ca_topic_score_gemma":0.0018979865,"teacher_disagreement_score":0.041253485,"about_ca_system_score_codex":0.002223331,"about_ca_system_score_gemma":0.0014335063,"threshold_uncertainty_score":0.13800663},"labels":[],"label_agreement":null}]}