{"meta":{"query_hash":"1eb0e76dabac","filters":{"venue":"Networks"},"cohort_total":145,"direct_labels_cover":0,"predictions_cover":145,"exported":145,"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/1eb0e76dabac","api":"https://metacan.xera.ac/api/v1/cohort?venue=Networks"},"results":[{"id":"W1595340722","doi":"10.1002/net.21626","title":"Multilayer variable neighborhood search for two‐level uncapacitated facility location problems with single assignment","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Ministère de l'Enseignement Supérieur et de la Recherche","keywords":"Variable neighborhood search; Mathematical optimization; Solver; Heuristic; Metaheuristic; Modular design; Integer programming; Variable (mathematics); Set (abstract data type); Class (philosophy); Facility location problem; Computer science; Integer (computer science); Mathematics; Local search (optimization); Artificial intelligence","score_opus":0.10973809488479432,"score_gpt":0.2532086931541283,"score_spread":0.143470598269334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595340722","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.07752019,0.00064031,0.916515,0.00022563523,0.00004338882,0.00007216056,0.00010808539,0.00021739499,0.0046578147],"genre_scores_gemma":[0.71004206,0.00030902817,0.28638068,0.000077653196,0.00003164638,0.00023639618,0.00021248173,0.00006637774,0.0026436993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996675,0.00013531678,0.00001416935,0.000044820972,0.000071880175,0.0000663341],"domain_scores_gemma":[0.9995103,0.00030391337,0.00007674766,0.000028030201,0.000041083076,0.00003987426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077359274,0.000687043,0.0012277144,0.0006184572,0.00036205072,0.0007690452,0.0010003682,0.0007006157,0.0017239413],"category_scores_gemma":[0.0018166312,0.0004759668,0.0007167325,0.0009010427,0.0004741324,0.0008491364,0.0010651844,0.0006740993,0.00018477911],"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.000019497504,0.000014512271,0.00021536405,0.000024527008,0.00001308107,0.000017969036,0.000010927976,0.9875963,0.00019807804,0.0035508426,0.00023088844,0.008108036],"study_design_scores_gemma":[0.0000053988324,0.000012379069,0.00004484071,0.0000023338328,0.0000022955605,0.0000044351636,0.0000038020064,0.99778795,0.00006333869,0.0019041135,0.00016728103,0.000001692679],"about_ca_topic_score_codex":0.004750202,"about_ca_topic_score_gemma":0.004831599,"teacher_disagreement_score":0.004750202,"about_ca_system_score_codex":0.00089264405,"about_ca_system_score_gemma":0.0008889651,"threshold_uncertainty_score":0.009445071},"labels":[],"label_agreement":null},{"id":"W1965979685","doi":"10.1002/net.21519","title":"The split delivery capacitated team orienteering problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"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; HEC Montréal","funders":"","keywords":"Orienteering; Computer science; Operations research; Profit (economics); Mathematical optimization; Set (abstract data type); Benchmark (surveying); Mathematics; Economics; Microeconomics","score_opus":0.006827192193179859,"score_gpt":0.197415121976764,"score_spread":0.19058792978358413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965979685","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.38088378,0.0014508558,0.5872883,0.0013228088,0.00019091957,0.00047858432,0.0013003495,0.00037570368,0.02670869],"genre_scores_gemma":[0.89498246,0.00064467365,0.09283089,0.00015203311,0.00008295693,0.00030297713,0.00094776344,0.00012332358,0.009932817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884295,0.00044239534,0.000047974154,0.0002232258,0.00019049627,0.0002529224],"domain_scores_gemma":[0.99880004,0.000662986,0.0001345017,0.00008213882,0.000112873044,0.00020743096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608254,0.0015766579,0.0013923628,0.00078588235,0.0007205489,0.0017047678,0.0019802472,0.0018066801,0.0074985055],"category_scores_gemma":[0.0025853713,0.00052155205,0.000844341,0.0017366542,0.00076408044,0.0018781286,0.0014503795,0.001110193,0.00055612944],"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.00036458395,0.0002730501,0.0012012555,0.00036479195,0.00015420887,0.0008814152,0.0002147655,0.90916646,0.00206389,0.031141374,0.0064401585,0.047734138],"study_design_scores_gemma":[0.000089623514,0.00021460826,0.00042643168,0.000037451464,0.000046256446,0.00032726367,0.00027397685,0.9586525,0.0012995545,0.034466416,0.0041412953,0.000024588104],"about_ca_topic_score_codex":0.0034910087,"about_ca_topic_score_gemma":0.0018257822,"teacher_disagreement_score":0.0074985055,"about_ca_system_score_codex":0.0013055034,"about_ca_system_score_gemma":0.0009208566,"threshold_uncertainty_score":0.025084972},"labels":[],"label_agreement":null},{"id":"W1971036791","doi":"10.1002/net.21580","title":"Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Branch and cut; Maximum cut; Mathematics; Minimum spanning tree; Linear programming relaxation; Integer programming; Linear programming; Linearization; Branch and bound; Cutting-plane method; Quadratic equation; Combinatorics; Relaxation (psychology); Branch and price; Mathematical optimization; Algorithm; Graph; Nonlinear system","score_opus":0.02871880323920883,"score_gpt":0.266627552590149,"score_spread":0.23790874935094014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971036791","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.01817067,0.0009757949,0.96804494,0.00070506457,0.00012186547,0.0002071555,0.00019444579,0.00049867755,0.011081417],"genre_scores_gemma":[0.22427557,0.0010661939,0.76426154,0.00042394327,0.00019599323,0.0006756249,0.0010936613,0.00039189318,0.007615593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841654,0.0005567747,0.00006842189,0.00028491672,0.00039391316,0.00027942137],"domain_scores_gemma":[0.99824995,0.0010751773,0.0001721787,0.00016795007,0.00018879697,0.00014586108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018733534,0.0018301272,0.0018367505,0.0011074097,0.0008880317,0.0020045615,0.0023728576,0.0018028506,0.008194085],"category_scores_gemma":[0.006192899,0.00076908036,0.0016107186,0.002366938,0.000978626,0.0033083982,0.0021146708,0.0044515184,0.0012167437],"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.00024337514,0.00047952397,0.0006163049,0.00036697768,0.00008313767,0.00013601036,0.00019335691,0.6924917,0.0012473732,0.12281862,0.013568055,0.16775556],"study_design_scores_gemma":[0.000045674187,0.000064840184,0.000115546376,0.000018350407,0.000015205712,0.00003642756,0.000028445367,0.95798004,0.00033681036,0.03946965,0.0018788498,0.000010131932],"about_ca_topic_score_codex":0.0048453477,"about_ca_topic_score_gemma":0.005360178,"teacher_disagreement_score":0.008194085,"about_ca_system_score_codex":0.0018112952,"about_ca_system_score_gemma":0.0033628806,"threshold_uncertainty_score":0.027411938},"labels":[],"label_agreement":null},{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","score_opus":0.01131194124672325,"score_gpt":0.22609503827198374,"score_spread":0.2147830970252605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972661641","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.1099164,0.0011870861,0.8700362,0.0023844922,0.000117228745,0.0001931867,0.00035918623,0.00044340533,0.015362842],"genre_scores_gemma":[0.6444521,0.0010085502,0.343343,0.000299284,0.0002193359,0.00033400772,0.00054884143,0.00018764076,0.009607235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986401,0.00071545906,0.000040546158,0.0002331682,0.00020916297,0.00016146054],"domain_scores_gemma":[0.9964085,0.0027126262,0.000334645,0.0001985423,0.0002069947,0.00013860302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015784363,0.0007204442,0.0012673398,0.0009586256,0.0007008133,0.001492261,0.0015959259,0.0017994154,0.0058145816],"category_scores_gemma":[0.0065203765,0.00054112554,0.00065895804,0.0013001647,0.0010952809,0.003318929,0.0013216453,0.0015552205,0.0004282619],"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.0002614705,0.00018016223,0.0008329727,0.00041084486,0.00006742817,0.00035589433,0.00022675033,0.69217116,0.001233997,0.2090727,0.007486448,0.08770015],"study_design_scores_gemma":[0.00007310779,0.000047557227,0.00026718577,0.000031162985,0.000014927714,0.00021107064,0.00005538375,0.83882254,0.0007519532,0.15440714,0.005304244,0.000013769956],"about_ca_topic_score_codex":0.0021704114,"about_ca_topic_score_gemma":0.0020750398,"teacher_disagreement_score":0.0058145816,"about_ca_system_score_codex":0.0013757665,"about_ca_system_score_gemma":0.00087461807,"threshold_uncertainty_score":0.019451737},"labels":[],"label_agreement":null},{"id":"W1982676876","doi":"10.1002/net.1034","title":"<i>k</i>‐Broadcasting in trees","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Broadcasting (networking); Vertex (graph theory); Computer science; Focus (optics); Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Computer network; Graph; Physics","score_opus":0.015188709972557767,"score_gpt":0.2276185526352694,"score_spread":0.21242984266271162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982676876","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.40268955,0.0033382822,0.5150899,0.0018172112,0.00010988321,0.0001244602,0.0006788686,0.0011771536,0.07497458],"genre_scores_gemma":[0.9103961,0.0015034439,0.081438154,0.00023830034,0.00007764374,0.00007724131,0.0003643925,0.00016504647,0.0057398602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.000103789156,0.000020328673,0.00007561134,0.000097827244,0.00012563771],"domain_scores_gemma":[0.99757713,0.0012425706,0.00039231687,0.00034483112,0.00031455222,0.00012865211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731247,0.0001856524,0.00035171394,0.000446681,0.000755257,0.0016077214,0.00072626915,0.00047001077,0.003318945],"category_scores_gemma":[0.003602023,0.00024582798,0.00020277784,0.0008187524,0.00076960603,0.001960761,0.0006161025,0.00067831075,0.0008676383],"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.0005379766,0.000113790426,0.0040537743,0.0005918051,0.000050463677,0.00026471363,0.00083837454,0.18302248,0.055134706,0.5873361,0.022331856,0.14572401],"study_design_scores_gemma":[0.00005616884,0.00014477095,0.002615505,0.000108639375,0.000040175684,0.0008237229,0.00034441202,0.4366259,0.024525149,0.50889426,0.025775917,0.000045420507],"about_ca_topic_score_codex":0.001904468,"about_ca_topic_score_gemma":0.0019676585,"teacher_disagreement_score":0.003318945,"about_ca_system_score_codex":0.0011359066,"about_ca_system_score_gemma":0.0005830453,"threshold_uncertainty_score":0.011102974},"labels":[],"label_agreement":null},{"id":"W1985050732","doi":"10.1002/net.10042","title":"Fast permutation routing in a class of interconnection networks","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Permutation (music); Routing (electronic design automation); Class (philosophy); Upper and lower bounds; Computer science; Interconnection; Time complexity; Permutation graph; Combinatorics; Mathematics; Theoretical computer science; Mathematical optimization; Discrete mathematics; Computer network; Graph; Artificial intelligence","score_opus":0.016087987533575578,"score_gpt":0.21796019163249497,"score_spread":0.2018722040989194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985050732","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.3325624,0.00063026225,0.6447396,0.00057880813,0.00008154546,0.00014356608,0.00031041284,0.00081695465,0.020136409],"genre_scores_gemma":[0.87364227,0.00043538288,0.11882867,0.000088209104,0.00007733399,0.00012629865,0.00047230153,0.00006199748,0.0062675495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.000115593124,0.000025889509,0.00012177125,0.000112120615,0.00009041671],"domain_scores_gemma":[0.99894994,0.0005572342,0.0001724352,0.00019228578,0.00008593494,0.00004212509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414934,0.00044268413,0.00045290886,0.00068116916,0.00071655324,0.0013309283,0.00064662285,0.0007012442,0.003780774],"category_scores_gemma":[0.0015455377,0.00024233032,0.0005421426,0.00093323324,0.0007539859,0.0017847735,0.0006120828,0.00070958585,0.00033306598],"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.00037738032,0.00013059365,0.002120629,0.00020107729,0.000052418836,0.00048139977,0.00016012027,0.6028955,0.0113643175,0.23519528,0.0037747698,0.14324656],"study_design_scores_gemma":[0.000029804145,0.00010208997,0.00048472063,0.000011802251,0.000011023992,0.00019535572,0.00004281724,0.8281245,0.002334143,0.1615679,0.007084502,0.000011315981],"about_ca_topic_score_codex":0.001084341,"about_ca_topic_score_gemma":0.0010489818,"teacher_disagreement_score":0.003780774,"about_ca_system_score_codex":0.0006932403,"about_ca_system_score_gemma":0.00044968823,"threshold_uncertainty_score":0.012647986},"labels":[],"label_agreement":null},{"id":"W1988551609","doi":"10.1002/net.21453","title":"Deterministic rendezvous in networks: A comprehensive survey","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Task (project management); Graph; Terrain; Undirected graph; Theoretical computer science; Mathematical optimization; Operations research; Mathematics; Geography; Engineering","score_opus":0.04834175643551917,"score_gpt":0.2885700570184015,"score_spread":0.24022830058288233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988551609","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152222635,0.6943859,0.24252656,0.0021215412,0.00045772543,0.00007253445,0.00037102113,0.00019022515,0.04465221],"genre_scores_gemma":[0.23106787,0.7000549,0.059445225,0.00048019466,0.0015415716,0.00016172395,0.00063389627,0.00012111559,0.006493522],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990289,0.00026144678,0.000071930845,0.00023590933,0.00030277466,0.00009900468],"domain_scores_gemma":[0.99751675,0.0019241548,0.00014409488,0.00013079225,0.00022687539,0.00005726191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014919555,0.0010657274,0.0015938568,0.0021323976,0.00060167507,0.0022043923,0.0016046483,0.0012111835,0.0025207049],"category_scores_gemma":[0.003499244,0.00080047286,0.0008850873,0.0043658586,0.0011746158,0.0035066314,0.0014031142,0.0011802927,0.0008368288],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011618388,0.00018490276,0.0032116594,0.006451476,0.00025648717,0.00021985173,0.00020256743,0.23242925,0.0009554238,0.2961106,0.01660085,0.44326082],"study_design_scores_gemma":[0.000043858105,0.00023686877,0.0030044594,0.0020733112,0.00019971542,0.0010141317,0.00034267316,0.26758084,0.0015147548,0.46204096,0.26185,0.000098418706],"about_ca_topic_score_codex":0.0025165922,"about_ca_topic_score_gemma":0.0017705811,"teacher_disagreement_score":0.0025207049,"about_ca_system_score_codex":0.0014429773,"about_ca_system_score_gemma":0.001146521,"threshold_uncertainty_score":0.010469615},"labels":[],"label_agreement":null},{"id":"W1989850675","doi":"10.1002/net.3","title":"The capacitated arc routing problem with intermediate facilities","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Arc routing; Benchmark (surveying); Arc (geometry); Mathematical optimization; Routing (electronic design automation); Computer science; Relaxation (psychology); Set (abstract data type); Integer programming; Integer (computer science); Upper and lower bounds; Mathematics; Computer network; Geography","score_opus":0.011514392974517382,"score_gpt":0.2159405566209453,"score_spread":0.2044261636464279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989850675","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.081032746,0.0018751107,0.8567891,0.0013065686,0.00027332918,0.00028040458,0.0011957017,0.0007505998,0.056496445],"genre_scores_gemma":[0.8166336,0.0010989439,0.16149321,0.00018702428,0.00020926718,0.0002421999,0.0014025846,0.00016936327,0.018563874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866724,0.00048548827,0.000052822154,0.0002588283,0.00024633727,0.00028928462],"domain_scores_gemma":[0.998701,0.0007412077,0.00014507622,0.00010952526,0.00015130307,0.00015180546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009860566,0.0010364465,0.00072451157,0.0007913173,0.00065121584,0.0021224136,0.0026286845,0.001577718,0.0099625625],"category_scores_gemma":[0.0025242069,0.0004420657,0.0006746845,0.001560572,0.00088764296,0.0020743941,0.0012402566,0.0013805703,0.0007806211],"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.00017777471,0.000121040976,0.0004379846,0.00036172292,0.000055845274,0.00037758035,0.00006239896,0.81954974,0.001798255,0.12766255,0.008857795,0.040537395],"study_design_scores_gemma":[0.00004675151,0.00010215355,0.00023067162,0.000060046565,0.000039213104,0.000301516,0.00010724914,0.8938522,0.0018050151,0.085973255,0.017457059,0.00002491365],"about_ca_topic_score_codex":0.003299978,"about_ca_topic_score_gemma":0.0029140136,"teacher_disagreement_score":0.0099625625,"about_ca_system_score_codex":0.001269428,"about_ca_system_score_gemma":0.0013307579,"threshold_uncertainty_score":0.033328056},"labels":[],"label_agreement":null},{"id":"W1992144665","doi":"10.1002/net.21557","title":"Substitutes, complements, and ripples in multicommodity flows on suspension graphs","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":3,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-commodity flow problem; Mathematics; Graph; Enumeration; Flow network; Combinatorics; Suspension (topology); Flow (mathematics); Discrete mathematics; Mathematical optimization; Pure mathematics; Geometry","score_opus":0.012807817476858125,"score_gpt":0.20968118597408356,"score_spread":0.19687336849722542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992144665","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.6525346,0.00051045034,0.31604895,0.0005273584,0.000057124642,0.000087851244,0.00012307403,0.00013433532,0.029976286],"genre_scores_gemma":[0.9586375,0.00045405133,0.03615845,0.000061748295,0.000019863151,0.00006667713,0.00009881475,0.000043887936,0.004459073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946266,0.00018397941,0.000020893047,0.00008067138,0.00014844304,0.00010340831],"domain_scores_gemma":[0.9974617,0.0016467464,0.00038875188,0.0001440648,0.00021001985,0.00014874186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695192,0.0006385974,0.00048735976,0.0017030361,0.0012137238,0.001757648,0.0006737117,0.00082961295,0.0026704622],"category_scores_gemma":[0.005564719,0.0006803267,0.00088263414,0.0012478906,0.003087042,0.0033334026,0.001049504,0.0008294707,0.00018385048],"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.00017117457,0.000067668545,0.0028458852,0.00012631809,0.00003032224,0.00038866713,0.00034475367,0.3011172,0.0027349275,0.6691414,0.0008553315,0.02217634],"study_design_scores_gemma":[0.000015005344,0.00006511277,0.0010531027,0.00005156413,0.000037566362,0.00016910485,0.0003709975,0.47376746,0.0031731406,0.51880664,0.0024598534,0.00003042649],"about_ca_topic_score_codex":0.004207565,"about_ca_topic_score_gemma":0.003950997,"teacher_disagreement_score":0.004207565,"about_ca_system_score_codex":0.0014311493,"about_ca_system_score_gemma":0.00080987863,"threshold_uncertainty_score":0.010383785},"labels":[],"label_agreement":null},{"id":"W1992432313","doi":"10.1002/net.1022","title":"Efficient communication in unknown networks","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Broadcasting (networking); Computer science; Dissemination; Node (physics); Synchronization (alternating current); Overhead (engineering); Computer network; Constant (computer programming); Simple (philosophy); Network topology; State (computer science); Limit (mathematics); Binary logarithm; Distributed computing; Broadcast communication network; Telecommunications network; Theoretical computer science; Algorithm; Topology (electrical circuits); Mathematics; Discrete mathematics; Telecommunications; Combinatorics; Channel (broadcasting)","score_opus":0.007117616545489455,"score_gpt":0.2589590344058749,"score_spread":0.25184141786038544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992432313","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.03768561,0.0020918443,0.9479945,0.0015760387,0.00011814395,0.00008483822,0.000109849134,0.0006655121,0.009673627],"genre_scores_gemma":[0.7275169,0.002871057,0.25731775,0.00038050904,0.0003052075,0.00032205207,0.00041313085,0.0001935624,0.010679882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997436,0.0011404842,0.00011210932,0.0004714441,0.00051896647,0.00032102386],"domain_scores_gemma":[0.99089277,0.006671513,0.000575601,0.0012875064,0.00041439655,0.00015816519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022673178,0.0007024442,0.0011689629,0.0010096134,0.0014026699,0.0025294528,0.0018571094,0.001976486,0.004069179],"category_scores_gemma":[0.012245647,0.00059229234,0.0004558944,0.0015626826,0.0023290087,0.0063468018,0.002969961,0.0013690263,0.0010005706],"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.00040901502,0.00008381194,0.00054490555,0.00055419933,0.00009141386,0.00022412816,0.0005150523,0.5794903,0.0069448957,0.25947475,0.009061082,0.14260633],"study_design_scores_gemma":[0.00007363261,0.00007251725,0.00019799107,0.00004642928,0.000024603132,0.00013300784,0.000113447575,0.74738127,0.0035938893,0.23478669,0.013555548,0.000021037633],"about_ca_topic_score_codex":0.0009815225,"about_ca_topic_score_gemma":0.00078701397,"teacher_disagreement_score":0.004069179,"about_ca_system_score_codex":0.001115656,"about_ca_system_score_gemma":0.00080021593,"threshold_uncertainty_score":0.013612747},"labels":[],"label_agreement":null},{"id":"W1993924585","doi":"10.1002/net.20448","title":"Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Pickup; Travelling salesman problem; Benchmark (surveying); Stack (abstract data type); Constraint (computer-aided design); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Artificial intelligence; Computer network","score_opus":0.014590875047121185,"score_gpt":0.21152627650574535,"score_spread":0.19693540145862415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993924585","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.29458106,0.003084448,0.69137937,0.0009199819,0.0001273917,0.00018611297,0.00026266847,0.00030823264,0.009150792],"genre_scores_gemma":[0.77033067,0.0007751132,0.22200674,0.000103785125,0.000089993526,0.0002570684,0.00035109953,0.00007736663,0.0060081547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950004,0.00028804966,0.00001694498,0.00007375854,0.000073700954,0.00004749474],"domain_scores_gemma":[0.9984981,0.0012447116,0.00010373471,0.00002701801,0.00006304171,0.00006340305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011971468,0.00064981374,0.0015600518,0.0007917639,0.00061287347,0.00074144127,0.0010286097,0.0010033533,0.0023848335],"category_scores_gemma":[0.0030225224,0.0005580473,0.0006177265,0.0008468554,0.0004590928,0.0012364732,0.0006758554,0.00066580763,0.00023676525],"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.00008419151,0.00007951753,0.00035226767,0.000054289063,0.000037739806,0.00006328141,0.000025863492,0.9792987,0.00025594875,0.006528934,0.0009214941,0.012297836],"study_design_scores_gemma":[0.000015000715,0.000030221527,0.000058004556,0.0000035123326,0.0000052873543,0.00000912629,0.000010266356,0.99728453,0.00006514908,0.002310686,0.0002058139,0.0000024838187],"about_ca_topic_score_codex":0.005856001,"about_ca_topic_score_gemma":0.0047717947,"teacher_disagreement_score":0.005856001,"about_ca_system_score_codex":0.0009148699,"about_ca_system_score_gemma":0.00072515913,"threshold_uncertainty_score":0.011643827},"labels":[],"label_agreement":null},{"id":"W1994505045","doi":"10.1002/net.20015","title":"Probabilistic location problems with discrete demand weights","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Mathematical optimization; Computer science; Mathematics; Artificial intelligence","score_opus":0.011725078169225347,"score_gpt":0.19628348771171292,"score_spread":0.18455840954248756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994505045","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.10273431,0.0006460009,0.88411874,0.003350386,0.00011022043,0.00010130902,0.0005474505,0.00017491546,0.008216732],"genre_scores_gemma":[0.92193854,0.0008094865,0.06576004,0.0002772553,0.00025378016,0.000299579,0.0004913205,0.00007240477,0.010097668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961463,0.0018573642,0.00016008144,0.00072515145,0.0006336932,0.00047738466],"domain_scores_gemma":[0.98756695,0.009272523,0.0015738527,0.00047628005,0.00066323945,0.00044705477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045513306,0.0012237633,0.0023992187,0.0015167175,0.0010552342,0.0029862768,0.0032759958,0.0044552796,0.005915758],"category_scores_gemma":[0.01611421,0.0017013013,0.0017122608,0.002681632,0.0031324897,0.0054588993,0.0025843682,0.0032343392,0.00044638387],"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.00010213631,0.00004671604,0.000540565,0.000099022334,0.000052038482,0.00011600148,0.00007404614,0.7627528,0.00031341196,0.2291996,0.0015277795,0.0051758345],"study_design_scores_gemma":[0.00006653748,0.000029274188,0.00023045045,0.000017966962,0.000018520826,0.000060360115,0.00005925409,0.7608465,0.0001989026,0.23752724,0.00091572676,0.000029253704],"about_ca_topic_score_codex":0.004141899,"about_ca_topic_score_gemma":0.003152753,"teacher_disagreement_score":0.005915758,"about_ca_system_score_codex":0.0037506872,"about_ca_system_score_gemma":0.001033949,"threshold_uncertainty_score":0.027213216},"labels":[],"label_agreement":null},{"id":"W1995554557","doi":"10.1002/net.10016","title":"Deterministic radio broadcasting at low cost","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Université du Québec à Montréal","funders":"","keywords":"Broadcasting (networking); Computer science; Node (physics); Computer network; Focus (optics); Wireless ad hoc network; Network topology; Radio networks; Upper and lower bounds; Distributed computing; Topology (electrical circuits); Wireless network; Telecommunications; Wireless; Mathematics; Combinatorics","score_opus":0.04961796621044182,"score_gpt":0.2585936795697521,"score_spread":0.20897571335931028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995554557","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.18167405,0.0010387737,0.7979049,0.00084237655,0.000054087675,0.000096639975,0.00010493182,0.0007398915,0.01754433],"genre_scores_gemma":[0.9315729,0.00043214872,0.06427648,0.00009205343,0.00005072312,0.00010951347,0.00008274114,0.000084570114,0.0032987883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833846,0.0006154365,0.00005426794,0.00019443312,0.0005216787,0.0002757865],"domain_scores_gemma":[0.9886254,0.00893704,0.00070643245,0.0009894666,0.000548192,0.0001935204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013556115,0.00038912747,0.00077323354,0.00055501104,0.00057805347,0.0013772261,0.0010422217,0.0006885697,0.002151761],"category_scores_gemma":[0.010878213,0.00029789028,0.0002781492,0.0008763624,0.0013139328,0.0015713008,0.00088503596,0.00066305813,0.00036754084],"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.00056606345,0.00008238354,0.0010409236,0.00028033773,0.000048210142,0.00016006497,0.00023737425,0.7453332,0.019075423,0.17684112,0.0028136517,0.05352126],"study_design_scores_gemma":[0.000063643136,0.000075340766,0.00032107538,0.000014206123,0.000023587678,0.000071043694,0.0000389713,0.9474784,0.0054400126,0.04464853,0.0018134299,0.000011796747],"about_ca_topic_score_codex":0.0022133738,"about_ca_topic_score_gemma":0.0017799058,"teacher_disagreement_score":0.0022133738,"about_ca_system_score_codex":0.0017524294,"about_ca_system_score_gemma":0.00095317524,"threshold_uncertainty_score":0.012714863},"labels":[],"label_agreement":null},{"id":"W2004151710","doi":"10.1002/net.20090","title":"Distributed delay constrained multicast routing algorithm with efficient fault recovery","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Inter-domain; IP multicast; Algorithm; Reliable multicast; Tree (set theory); Mathematics","score_opus":0.005435958961519562,"score_gpt":0.2012463873339291,"score_spread":0.19581042837240956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004151710","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.05080917,0.00021290917,0.944687,0.00026356545,0.000054842483,0.00010836776,0.000073892006,0.0012855566,0.002504722],"genre_scores_gemma":[0.5782884,0.00007190108,0.41908568,0.00007703862,0.000026022923,0.00014532315,0.00018201204,0.000050465373,0.0020732183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995302,0.000113677335,0.000033455744,0.0000994889,0.00015378768,0.000069339025],"domain_scores_gemma":[0.99936146,0.00020432397,0.000098282566,0.00012765774,0.0001664866,0.0000418334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056899444,0.0004101637,0.0005384953,0.0006407721,0.0005351451,0.0006671688,0.001201267,0.00073604507,0.0014864617],"category_scores_gemma":[0.0017510834,0.00019493187,0.00028675018,0.0006046402,0.00031466494,0.00084968674,0.0008803378,0.0005061443,0.00034472632],"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.00068494177,0.00023417504,0.0016690741,0.00016485514,0.000075985714,0.00028161908,0.00018761207,0.52787346,0.030401353,0.03208743,0.006192858,0.40014666],"study_design_scores_gemma":[0.000065838794,0.000051625586,0.00011516464,0.000004956035,0.000009121978,0.00008904429,0.000018488177,0.9870331,0.004973099,0.0057907426,0.001840724,0.000008111553],"about_ca_topic_score_codex":0.0018339971,"about_ca_topic_score_gemma":0.0014348761,"teacher_disagreement_score":0.0018339971,"about_ca_system_score_codex":0.00086405355,"about_ca_system_score_gemma":0.0009889144,"threshold_uncertainty_score":0.0062692165},"labels":[],"label_agreement":null},{"id":"W2006429817","doi":"10.1002/net.21490","title":"Shortest paths avoiding forbidden subpaths","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Distance; K shortest path routing; Combinatorics; Yen's algorithm; Longest path problem; Euclidean shortest path; Constrained Shortest Path First; Shortest Path Faster Algorithm; Widest path problem; Path (computing); Mathematics; Discrete mathematics; Computer science; Graph; Dijkstra's algorithm; Computer network","score_opus":0.01678287490000113,"score_gpt":0.25743815220359384,"score_spread":0.2406552773035927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006429817","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.29106057,0.0003520849,0.7035205,0.0002758702,0.00004856269,0.000119774115,0.00027016416,0.00035664698,0.0039958474],"genre_scores_gemma":[0.70068175,0.00033847126,0.2931855,0.00008674918,0.000043683587,0.00019991749,0.00052874914,0.00018526692,0.004749924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.0001972626,0.000050544826,0.0002254813,0.00016361818,0.00010590353],"domain_scores_gemma":[0.9955069,0.0028613696,0.0005720556,0.00043837755,0.00038458518,0.0002367592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935676,0.00052036246,0.00073919527,0.0009028212,0.00069320993,0.00089516223,0.0011203998,0.0008457865,0.0026172628],"category_scores_gemma":[0.006578774,0.00043965763,0.00072786555,0.0008087144,0.0009861487,0.0020572843,0.0014513534,0.0010265342,0.0002786198],"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.00039266035,0.00011388979,0.0036308207,0.00038050328,0.0001338269,0.0006397299,0.0004887427,0.70318216,0.009099549,0.1888394,0.0025964705,0.09050222],"study_design_scores_gemma":[0.000039764443,0.00007289992,0.0004192113,0.00002755272,0.000025984495,0.00016187534,0.00009962167,0.7235097,0.002867743,0.26947764,0.0032805903,0.000017322482],"about_ca_topic_score_codex":0.0016766103,"about_ca_topic_score_gemma":0.0014579903,"teacher_disagreement_score":0.0026172628,"about_ca_system_score_codex":0.0006793559,"about_ca_system_score_gemma":0.00076457387,"threshold_uncertainty_score":0.008755624},"labels":[],"label_agreement":null},{"id":"W2016083649","doi":"10.1002/net.20456","title":"Progressive hedging‐based metaheuristics for stochastic network design","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; École de Technologie Supérieure; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematical optimization; Stochastic programming; Computer science; Metaheuristic; Network planning and design; Decomposition; Mathematics","score_opus":0.07614022353364325,"score_gpt":0.3012108241517992,"score_spread":0.22507060061815592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016083649","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.04202054,0.00044715797,0.95388937,0.00023235446,0.000039241917,0.000100356076,0.000057624038,0.00016703241,0.003046283],"genre_scores_gemma":[0.67970055,0.0003185713,0.3174026,0.00017798923,0.000040299652,0.00028761546,0.00012267848,0.00005711993,0.0018926323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.00023005524,0.000015402853,0.000045676985,0.00008052489,0.000050198465],"domain_scores_gemma":[0.99886465,0.0008127711,0.000106081025,0.0000697488,0.000093571725,0.000053120064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016094176,0.0008713316,0.0010448691,0.00076974026,0.0003297966,0.0006311625,0.0011251839,0.00087600085,0.001655569],"category_scores_gemma":[0.0021740184,0.00051359064,0.00086515717,0.0008102773,0.0007460311,0.0006269063,0.0007761987,0.00096041826,0.00013079113],"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.000015115663,0.0000143881025,0.00009120963,0.000012250753,0.000016512378,0.000010587361,0.000008671424,0.9906296,0.00017440092,0.002816071,0.00011347305,0.006097686],"study_design_scores_gemma":[0.000009855293,0.000015287997,0.000017559563,0.000002437626,0.00000348543,0.000002411576,0.0000023672426,0.9973659,0.0000852261,0.002363833,0.00013018675,0.0000013114575],"about_ca_topic_score_codex":0.0035663145,"about_ca_topic_score_gemma":0.0037922752,"teacher_disagreement_score":0.0035663145,"about_ca_system_score_codex":0.0010188101,"about_ca_system_score_gemma":0.0010441208,"threshold_uncertainty_score":0.008511484},"labels":[],"label_agreement":null},{"id":"W2016722709","doi":"10.1002/net.1033","title":"Minimum linear gossip graphs and maximal linear (Δ, <i>k</i>)‐gossip graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Gossip; Combinatorics; Graph; Mathematics; Discrete mathematics; Computer science; Node (physics)","score_opus":0.0185127435136274,"score_gpt":0.23728207396649753,"score_spread":0.21876933045287014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016722709","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.6578131,0.00034892577,0.31736568,0.0007544945,0.000022978073,0.00012922635,0.0008301831,0.0006742647,0.022061273],"genre_scores_gemma":[0.9607081,0.000108414475,0.035713222,0.0001109737,0.000016250071,0.000097911994,0.000595851,0.000053148004,0.0025960696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959403,0.00011488314,0.000025935935,0.00007694559,0.00008811639,0.000100061436],"domain_scores_gemma":[0.9965502,0.0017555881,0.00062246964,0.00026464195,0.00049188134,0.00031520598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034614236,0.00028186847,0.00027441804,0.0006137722,0.000761085,0.00079525163,0.0007336938,0.0004073688,0.0027905963],"category_scores_gemma":[0.0025706554,0.0002758971,0.00040732062,0.0005072013,0.00084064173,0.0011919689,0.00065084785,0.00064950844,0.00027114557],"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.00088843796,0.00020844671,0.006680901,0.00070527004,0.00009979469,0.0007941177,0.0014750845,0.18517996,0.050284766,0.6739157,0.010802031,0.06896548],"study_design_scores_gemma":[0.00012906808,0.00028709066,0.00396426,0.000084868,0.000073031275,0.00092648854,0.0008055577,0.45754206,0.026111657,0.49739787,0.012608217,0.00006976492],"about_ca_topic_score_codex":0.0015824784,"about_ca_topic_score_gemma":0.001338388,"teacher_disagreement_score":0.0027905963,"about_ca_system_score_codex":0.0010035535,"about_ca_system_score_gemma":0.00044765175,"threshold_uncertainty_score":0.009335458},"labels":[],"label_agreement":null},{"id":"W2017571998","doi":"10.1002/net.10062","title":"An improved algorithm for the minmax regret median problem on a tree","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":42,"is_retracted":false,"has_abstract":true,"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; Tree (set theory); Node (physics); Mathematical optimization; Mathematics; Algorithm; Function (biology); Interval (graph theory); Computer science; Combinatorics; Statistics","score_opus":0.019361797807546342,"score_gpt":0.2328850661918709,"score_spread":0.21352326838432456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017571998","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.014826088,0.0002671391,0.9798854,0.00030047723,0.00006586183,0.00009395278,0.0002078629,0.0013457575,0.0030074841],"genre_scores_gemma":[0.12440764,0.00018468127,0.87061155,0.00013024978,0.00009992371,0.00026824107,0.0006618842,0.00023866483,0.0033971274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989893,0.00025264724,0.000057098303,0.00025124694,0.00024225353,0.00020755574],"domain_scores_gemma":[0.99901366,0.00048301832,0.00010553386,0.0001551623,0.00016145501,0.00008109646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013298026,0.00091276417,0.0018488439,0.0010730574,0.00082956,0.0016275978,0.0020527195,0.001902359,0.008636365],"category_scores_gemma":[0.003618411,0.00048674073,0.000952214,0.001699587,0.0004987911,0.0027444046,0.002257032,0.0015901717,0.0018456436],"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.00053228333,0.00022035217,0.0009966798,0.00020319529,0.00008315536,0.000168982,0.00023401021,0.58050036,0.003901056,0.03596112,0.013897409,0.36330143],"study_design_scores_gemma":[0.00008796723,0.000056662928,0.00015067476,0.000015740896,0.000012878072,0.000062945146,0.00003978254,0.96281713,0.0007973432,0.03267144,0.0032757919,0.000011713872],"about_ca_topic_score_codex":0.003490743,"about_ca_topic_score_gemma":0.0039335387,"teacher_disagreement_score":0.008636365,"about_ca_system_score_codex":0.0013901019,"about_ca_system_score_gemma":0.0017186514,"threshold_uncertainty_score":0.028891504},"labels":[],"label_agreement":null},{"id":"W2026533796","doi":"10.1002/net.21529","title":"Incomplete service and split deliveries in a routing problem with profits","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"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; HEC Montréal","funders":"","keywords":"Orienteering; Heuristics; Computer science; Vehicle routing problem; Mathematical optimization; Operations research; Profit (economics); Constraint (computer-aided design); Service (business); Routing (electronic design automation); Mathematics; Business; Computer network; Economics; Microeconomics; Marketing","score_opus":0.008552179507714286,"score_gpt":0.19779935634048604,"score_spread":0.18924717683277176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026533796","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.5012534,0.0010158506,0.48847437,0.0009619347,0.00007246865,0.00015598448,0.0003564334,0.00013304196,0.007576481],"genre_scores_gemma":[0.92908573,0.00037683413,0.06702576,0.00006684464,0.00005648392,0.00010325767,0.0002339725,0.000070063805,0.0029810986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856704,0.00061270234,0.000054584772,0.00024837846,0.0002644956,0.00025276525],"domain_scores_gemma":[0.9963744,0.0026871373,0.0003015152,0.00015962547,0.00017990118,0.00029735887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019440758,0.0011642012,0.0013319199,0.00064791925,0.0007081513,0.001820385,0.0013507387,0.001210582,0.002766526],"category_scores_gemma":[0.0054695862,0.0006407804,0.00093564513,0.0011204131,0.0013786232,0.0026952059,0.0013460648,0.0014267884,0.00021293404],"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.000167992,0.0000722803,0.0006426077,0.00009039201,0.000050810315,0.00028387512,0.00009549639,0.9660256,0.0013332976,0.020773167,0.0006494491,0.009815072],"study_design_scores_gemma":[0.00003423874,0.00011987545,0.00037102052,0.000015764854,0.00003186958,0.00017993893,0.00011840036,0.96293354,0.001285146,0.034035295,0.0008614619,0.00001335893],"about_ca_topic_score_codex":0.0020391839,"about_ca_topic_score_gemma":0.0012735085,"teacher_disagreement_score":0.002766526,"about_ca_system_score_codex":0.0016524948,"about_ca_system_score_gemma":0.0010083757,"threshold_uncertainty_score":0.011989713},"labels":[],"label_agreement":null},{"id":"W2029341065","doi":"10.1002/net.20033","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":665,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Shortest path problem; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Computation; K shortest path routing; Longest path problem; Constrained Shortest Path First; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.008733564536156346,"score_gpt":0.2388332489582275,"score_spread":0.23009968442207115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029341065","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.025419181,0.00008671012,0.9714353,0.00015681001,0.000026672436,0.00009335057,0.00006803677,0.0006087402,0.0021051248],"genre_scores_gemma":[0.14613193,0.0000717707,0.8519684,0.000060751463,0.000019176152,0.00012909452,0.0001682304,0.00010097478,0.0013497251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.00018538006,0.000022854114,0.000095398726,0.00013317517,0.0000730422],"domain_scores_gemma":[0.99835443,0.0010783563,0.00009562864,0.00023209708,0.00019490333,0.000044461012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118218,0.0006259591,0.0007390344,0.0005149218,0.0005305457,0.00056111335,0.0010019477,0.0008630053,0.0043133157],"category_scores_gemma":[0.0032225759,0.00035264666,0.00045658284,0.00085510866,0.000597324,0.0010227998,0.000792757,0.0010982424,0.00041064984],"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.00012155989,0.00011177281,0.00045909395,0.00013324793,0.00002460926,0.00008006347,0.00010895176,0.79709077,0.0031571786,0.02831965,0.0028533142,0.16753973],"study_design_scores_gemma":[0.00005670058,0.00004036829,0.00008031318,0.0000059795148,0.0000059760546,0.000038854916,0.000020052823,0.98410416,0.0012087941,0.013206194,0.0012260642,0.0000065495437],"about_ca_topic_score_codex":0.004946777,"about_ca_topic_score_gemma":0.006324674,"teacher_disagreement_score":0.004946777,"about_ca_system_score_codex":0.0006947512,"about_ca_system_score_gemma":0.001624104,"threshold_uncertainty_score":0.01442951},"labels":[],"label_agreement":null},{"id":"W2031669620","doi":"10.1002/net.21605","title":"A railroad maintenance problem solved with a cut and column generation matheuristic","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Integer programming; Arc routing; Computer science; Scheduling (production processes); Mathematical optimization; Routing (electronic design automation); Schedule; Vehicle routing problem; Heuristic; Graph; Operations research; Artificial intelligence; Algorithm; Mathematics; Theoretical computer science","score_opus":0.021355889310019804,"score_gpt":0.2254491847852068,"score_spread":0.204093295475187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031669620","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.07291273,0.00049319095,0.9147197,0.0006103299,0.00011849266,0.00023745393,0.0012509545,0.00064380164,0.009013389],"genre_scores_gemma":[0.30550927,0.00031203,0.6849216,0.00019643955,0.00008778076,0.00032500588,0.0018087326,0.00016730856,0.0066717505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997389,0.00007493469,0.000011000687,0.00009199771,0.00004455444,0.000038701666],"domain_scores_gemma":[0.99924195,0.00053258066,0.0000689654,0.000053442982,0.00007217614,0.00003085303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055216,0.0008462399,0.0006031662,0.00078581227,0.0004239187,0.00081621174,0.00075094524,0.0010716006,0.006092293],"category_scores_gemma":[0.0015278778,0.00041584385,0.0007700792,0.0009748492,0.00041799323,0.00080626074,0.00051254925,0.000826164,0.00044474317],"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.00014463718,0.00022339952,0.0010687,0.00026891238,0.00006567307,0.00015283827,0.00007146723,0.85975564,0.002285753,0.014307669,0.009052786,0.11260261],"study_design_scores_gemma":[0.00002290934,0.00004619335,0.00022559597,0.00000987742,0.000012343961,0.000053665255,0.000023813109,0.99090344,0.00065999164,0.006522052,0.0015145623,0.0000054549387],"about_ca_topic_score_codex":0.0059336675,"about_ca_topic_score_gemma":0.0069135777,"teacher_disagreement_score":0.006092293,"about_ca_system_score_codex":0.00084858725,"about_ca_system_score_gemma":0.0012564857,"threshold_uncertainty_score":0.020380735},"labels":[],"label_agreement":null},{"id":"W2031698396","doi":"10.1002/net.20095","title":"Black hole search in common interconnection networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Hypercube; Star (game theory); Interconnection; Polygon mesh; Black hole (networking); Topology (electrical circuits); TRACE (psycholinguistics); Chordal graph; Network topology; Torus; Host (biology); Routing (electronic design automation); Theoretical computer science; Combinatorics; Computer network; Mathematics; Parallel computing; Routing protocol; Graph","score_opus":0.0211345147778055,"score_gpt":0.2741044860498077,"score_spread":0.2529699712720022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031698396","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.53012645,0.0011177306,0.45365658,0.000964358,0.00005268287,0.00011821449,0.00012552057,0.00018082806,0.013657578],"genre_scores_gemma":[0.95231116,0.00023988083,0.04442328,0.000058297435,0.00001599124,0.00007156477,0.000073416595,0.000020100515,0.002786343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928004,0.00031517667,0.0000241769,0.00013064564,0.000099781515,0.00015020464],"domain_scores_gemma":[0.99705386,0.002101907,0.00034274327,0.00016323189,0.0001805622,0.00015767249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012428801,0.0004841785,0.0008999187,0.0009971928,0.00079651014,0.0008835547,0.0009802273,0.001082177,0.0019137429],"category_scores_gemma":[0.005031762,0.00030838922,0.00035779635,0.0010436161,0.0015077788,0.0016031219,0.0014783865,0.0004591061,0.00013635634],"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.00022277376,0.000057380734,0.0011081923,0.00008328886,0.000057985795,0.00021495736,0.00016444693,0.85614306,0.0008142608,0.11436667,0.0017453999,0.025021618],"study_design_scores_gemma":[0.000049917744,0.000047820093,0.00020923222,0.00001193708,0.000012574423,0.000059521473,0.00006832987,0.8699843,0.000504603,0.1277795,0.0012645641,0.00000771015],"about_ca_topic_score_codex":0.003546559,"about_ca_topic_score_gemma":0.0026791578,"teacher_disagreement_score":0.003546559,"about_ca_system_score_codex":0.0010091177,"about_ca_system_score_gemma":0.000531062,"threshold_uncertainty_score":0.0073217154},"labels":[],"label_agreement":null},{"id":"W2038039225","doi":"10.1002/net.20383","title":"Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Heuristics; Computer science; Flow network; Mathematical optimization; Integer programming; Digraph; Cutting-plane method; Mathematics; Algorithm","score_opus":0.00464616798209775,"score_gpt":0.20868945803766262,"score_spread":0.20404329005556487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038039225","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.30982953,0.0005952337,0.679442,0.00056856696,0.00007065286,0.00013569562,0.00034722476,0.0002544739,0.008756661],"genre_scores_gemma":[0.8898326,0.00026499698,0.10465037,0.000042708634,0.000037145488,0.00020045303,0.00023800776,0.000056583795,0.004677156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996146,0.00017281591,0.000011312535,0.000071437724,0.000040991752,0.000088829656],"domain_scores_gemma":[0.99931526,0.00045383465,0.0000842109,0.000028435099,0.00005673794,0.00006149519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010194324,0.0010207983,0.00091541314,0.000604948,0.00061308115,0.0014909251,0.0009107778,0.0015135919,0.0034826149],"category_scores_gemma":[0.0018246243,0.00059191283,0.001020215,0.0009492411,0.00076568656,0.0012497737,0.00083186774,0.0009443765,0.00024274981],"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.000019170036,0.000014912166,0.00014551434,0.000011977794,0.00000827058,0.00003459721,0.000011464541,0.99553597,0.00016330935,0.0018962084,0.0001225337,0.0020360437],"study_design_scores_gemma":[0.000004599601,0.000011607625,0.00003808535,0.000001675506,0.0000034662808,0.000004310122,0.000012389078,0.99854136,0.00007592995,0.0011808232,0.00012383236,0.0000018663976],"about_ca_topic_score_codex":0.022173211,"about_ca_topic_score_gemma":0.014451139,"teacher_disagreement_score":0.022173211,"about_ca_system_score_codex":0.0015058509,"about_ca_system_score_gemma":0.001432289,"threshold_uncertainty_score":0.044088304},"labels":[],"label_agreement":null},{"id":"W2039700046","doi":"10.1002/net.21530","title":"Nonexistence of optimal graphs for all terminal reliability","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Undirected graph; Discrete mathematics; Multigraph","score_opus":0.007172499954143852,"score_gpt":0.2076871176198089,"score_spread":0.20051461766566506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039700046","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.67647827,0.00058659207,0.3016655,0.0021057145,0.00008250348,0.00011938061,0.0007484032,0.00046580762,0.017747864],"genre_scores_gemma":[0.9551897,0.00018297056,0.042836346,0.00024277462,0.00005377478,0.000090557645,0.00023907663,0.00007292482,0.001091841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823606,0.0005534731,0.00008522443,0.0005025339,0.00037768247,0.00024505422],"domain_scores_gemma":[0.9815677,0.011612587,0.0023763406,0.0018295229,0.0014111695,0.0012026067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021549412,0.00065195665,0.0011359444,0.0012897281,0.0010032706,0.001282639,0.0010900788,0.001076029,0.0022770066],"category_scores_gemma":[0.017604778,0.00090883556,0.0007591068,0.0006437273,0.002058435,0.002349215,0.0014281336,0.00161951,0.00027304504],"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.0007468721,0.00026764165,0.009105949,0.0007623812,0.00025036212,0.00091981294,0.0006932473,0.21915242,0.021869168,0.69651216,0.011062557,0.038657464],"study_design_scores_gemma":[0.0000915441,0.00017409267,0.003139263,0.00007576963,0.00009995136,0.0009303853,0.0002337832,0.19354284,0.0075654327,0.7903074,0.00378912,0.00005040405],"about_ca_topic_score_codex":0.00040969715,"about_ca_topic_score_gemma":0.0005461552,"teacher_disagreement_score":0.0022770066,"about_ca_system_score_codex":0.0010474275,"about_ca_system_score_gemma":0.0008810469,"threshold_uncertainty_score":0.011396587},"labels":[],"label_agreement":null},{"id":"W2047226187","doi":"10.1002/net.21525","title":"Solving the close‐enough arc routing problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Arc routing; Computer science; Routing (electronic design automation); Arc (geometry); Mathematical optimization; Mathematics; Computer network","score_opus":0.010267781984480634,"score_gpt":0.22271240807114842,"score_spread":0.21244462608666778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047226187","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.09178353,0.00085335184,0.88447356,0.0017837834,0.00022261882,0.00014511442,0.00045608665,0.0003840975,0.019897768],"genre_scores_gemma":[0.69703996,0.00061654946,0.28974217,0.00034439485,0.0001694693,0.00020605669,0.0007470828,0.00025887406,0.010875451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985078,0.0007101162,0.00005413633,0.00031827917,0.00024415646,0.00016553004],"domain_scores_gemma":[0.9965029,0.0026752874,0.00024909823,0.00018998873,0.00020818555,0.00017449731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016361495,0.00093768706,0.0015119324,0.0009069403,0.0007518629,0.0018432199,0.0017324374,0.0023970031,0.012162841],"category_scores_gemma":[0.0071136383,0.00073589076,0.0010779795,0.0012830024,0.00095958274,0.003414325,0.0015967208,0.002131719,0.00061784306],"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.0001488387,0.00016428737,0.00060067815,0.00021882776,0.00006879552,0.00021730919,0.00011478429,0.8846968,0.0009219858,0.07607539,0.0060600797,0.03071219],"study_design_scores_gemma":[0.00003502382,0.000045438665,0.00013339268,0.000023442342,0.000014317859,0.000093776434,0.000092615344,0.9130706,0.00041711997,0.083497465,0.0025649697,0.0000118050775],"about_ca_topic_score_codex":0.0024718929,"about_ca_topic_score_gemma":0.0019614217,"teacher_disagreement_score":0.012162841,"about_ca_system_score_codex":0.0009032987,"about_ca_system_score_gemma":0.0009449742,"threshold_uncertainty_score":0.040688753},"labels":[],"label_agreement":null},{"id":"W2052058646","doi":"10.1002/net.21503","title":"Analysis of an exact algorithm for the vessel speed optimization problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Maritime Transport Emissions and Efficiency","field":"Environmental Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Port (circuit theory); Quadratic equation; Mathematical optimization; Computer science; Sequence (biology); Function (biology); Regular polygon; Window (computing); Algorithm; Convex function; Optimization problem; Mathematics; Engineering; Electrical engineering","score_opus":0.006801423789339931,"score_gpt":0.21482276912069254,"score_spread":0.2080213453313526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052058646","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.018303081,0.00033274124,0.96837765,0.00042899197,0.000104357256,0.00014264435,0.000118859636,0.0007562337,0.011435445],"genre_scores_gemma":[0.3339667,0.00029740794,0.6569098,0.00030648836,0.00014029624,0.00044017698,0.0004150077,0.00037703424,0.0071470374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874324,0.0003481567,0.000060290095,0.00023849063,0.00035699573,0.00025295964],"domain_scores_gemma":[0.995619,0.003328722,0.00018886932,0.0002929805,0.0004538727,0.000116630974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967736,0.0012578148,0.0012298409,0.00077743415,0.0007962756,0.0017487628,0.0017030629,0.0018790656,0.011700915],"category_scores_gemma":[0.0093168365,0.00063131744,0.00081375963,0.0010944215,0.0010782003,0.0017131966,0.0019741415,0.0017383107,0.0016899019],"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.0002560058,0.00015835752,0.00066317036,0.0001621888,0.00003996512,0.00009447396,0.00009303128,0.86963654,0.0019225006,0.035053726,0.0054626544,0.08645742],"study_design_scores_gemma":[0.00005193831,0.000029270908,0.00008182295,0.000009107093,0.000005994153,0.000022277012,0.00001248898,0.9861953,0.00024688442,0.012696202,0.0006446289,0.0000041152443],"about_ca_topic_score_codex":0.007803356,"about_ca_topic_score_gemma":0.0066842157,"teacher_disagreement_score":0.011700915,"about_ca_system_score_codex":0.001657086,"about_ca_system_score_gemma":0.0035244932,"threshold_uncertainty_score":0.039143503},"labels":[],"label_agreement":null},{"id":"W2053173245","doi":"10.1002/net.21531","title":"Minisum multipurpose trip location problem on trees","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"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":"Facility location problem; Type (biology); Computer science; Node (physics); Type of service; Service (business); Tree (set theory); Mathematical optimization; Flow network; Transportation theory; 1-center problem; Fixed cost; Operations research; Mathematics; Combinatorics; Engineering; Business","score_opus":0.017969521395963566,"score_gpt":0.20929971246062465,"score_spread":0.1913301910646611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053173245","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.31240842,0.0028593407,0.6406591,0.0028813877,0.00029612388,0.0004737539,0.0043068784,0.0006520876,0.035462927],"genre_scores_gemma":[0.80711544,0.0014552113,0.16462664,0.000330255,0.0002271402,0.00035543347,0.0028867011,0.00018474172,0.022818437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929535,0.00025978195,0.000042529013,0.00013769575,0.000099915604,0.00016464094],"domain_scores_gemma":[0.99867094,0.00081337907,0.0001418043,0.00010460012,0.00012034372,0.00014895157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083943474,0.0009099377,0.0015441468,0.0011480565,0.0010862423,0.0017875647,0.0020528778,0.0019525747,0.009963757],"category_scores_gemma":[0.0027775997,0.00066653424,0.00082780025,0.0029283992,0.0006517174,0.0032472797,0.0018605262,0.0009574075,0.0011542422],"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.0006019589,0.00029019633,0.0013673325,0.0007104243,0.000114450086,0.00061209034,0.00023395066,0.80413663,0.0028237714,0.08999597,0.023370929,0.07574233],"study_design_scores_gemma":[0.00007264703,0.000112000394,0.000601155,0.000046932368,0.000034599092,0.0003706368,0.00023315323,0.9083505,0.0011225335,0.08187937,0.007151907,0.00002450457],"about_ca_topic_score_codex":0.002942733,"about_ca_topic_score_gemma":0.0031086362,"teacher_disagreement_score":0.009963757,"about_ca_system_score_codex":0.0013410252,"about_ca_system_score_gemma":0.0005855073,"threshold_uncertainty_score":0.03333205},"labels":[],"label_agreement":null},{"id":"W2055572845","doi":"10.1002/net.20450","title":"Proximity and remoteness in graphs: Results and conjectures","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Independence number; Vertex (graph theory); Upper and lower bounds; Matching (statistics); Graph; Order (exchange); Connectivity; Discrete mathematics; Statistics","score_opus":0.02974784007176186,"score_gpt":0.25870406774043736,"score_spread":0.2289562276686755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055572845","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.6751546,0.016317455,0.2510732,0.008525638,0.00027054021,0.000079716985,0.0005820337,0.0006513596,0.047345486],"genre_scores_gemma":[0.9855387,0.0020737913,0.009934866,0.0002185289,0.00062605075,0.00004089525,0.00015686444,0.00006564275,0.0013446604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954346,0.0012663943,0.0002626119,0.0014088068,0.0012394697,0.0003880938],"domain_scores_gemma":[0.90842813,0.07462793,0.007042942,0.005068421,0.0020559363,0.0027766326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051155076,0.0008453965,0.0016656155,0.00455146,0.0019644538,0.0040619425,0.0027761962,0.0020391624,0.005649029],"category_scores_gemma":[0.043425184,0.0008752967,0.0010200536,0.0043416605,0.0067900703,0.016908413,0.0051933234,0.0036454604,0.000744013],"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.0013025055,0.00043481612,0.019376226,0.001207233,0.0001547792,0.00072723516,0.002994637,0.067564644,0.0064264205,0.8378381,0.0046465676,0.057326913],"study_design_scores_gemma":[0.0000553613,0.0002993711,0.006052748,0.00013400521,0.00007950532,0.0009313673,0.0008495835,0.05673743,0.0031826084,0.9277935,0.0038278303,0.000056677563],"about_ca_topic_score_codex":0.0006370892,"about_ca_topic_score_gemma":0.00041270643,"teacher_disagreement_score":0.005649029,"about_ca_system_score_codex":0.0015289984,"about_ca_system_score_gemma":0.00036643425,"threshold_uncertainty_score":0.027053714},"labels":[],"label_agreement":null},{"id":"W2055943982","doi":"10.1002/net.10094","title":"Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Clique; Computer network; Advice (programming); Bounded function; Theoretical computer science; Pointer (user interface); Mathematics; Artificial intelligence","score_opus":0.007708517376898164,"score_gpt":0.21699970336270394,"score_spread":0.20929118598580576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055943982","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.55060554,0.0011597356,0.43982944,0.0022412306,0.000044409702,0.00012897346,0.00032416894,0.00040048786,0.005266024],"genre_scores_gemma":[0.9704663,0.00029623538,0.026454734,0.0001125537,0.000041563497,0.00009658579,0.000089652756,0.000038041926,0.0024043766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976852,0.000695714,0.0001344805,0.00060280616,0.00040044094,0.00048127025],"domain_scores_gemma":[0.96985686,0.022801364,0.0027174128,0.0025682107,0.001197447,0.0008587306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003077954,0.0007400629,0.0018526281,0.0013156121,0.0016328216,0.0024704237,0.0037537122,0.002874304,0.0030650117],"category_scores_gemma":[0.025471244,0.0010301886,0.0008049265,0.002089291,0.0033028806,0.007487927,0.0032082666,0.0014858596,0.00031027518],"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.00047891654,0.00007021008,0.0019761214,0.00013179478,0.00006840215,0.0004284097,0.0004271666,0.91816694,0.0010044856,0.059316423,0.0008898265,0.017041286],"study_design_scores_gemma":[0.000042621392,0.00004959828,0.0002924556,0.000015381764,0.000024480492,0.00009403917,0.000109436616,0.92997503,0.0006559954,0.06826943,0.0004516513,0.000019846208],"about_ca_topic_score_codex":0.008850705,"about_ca_topic_score_gemma":0.004927009,"teacher_disagreement_score":0.008850705,"about_ca_system_score_codex":0.0020467765,"about_ca_system_score_gemma":0.0010627223,"threshold_uncertainty_score":0.017598331},"labels":[],"label_agreement":null},{"id":"W2060798327","doi":"10.1002/net.20408","title":"Big segment small segment global optimization algorithm on networks","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; 1-center problem; Computer science; Cover (algebra); Mathematical optimization; Algorithm; Function (biology); Optimization problem; Mathematics","score_opus":0.01670503028694023,"score_gpt":0.21339814296546267,"score_spread":0.19669311267852244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060798327","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.020827299,0.00018877286,0.9749945,0.00015420097,0.000022631268,0.00004716356,0.00007594552,0.00046445406,0.0032249878],"genre_scores_gemma":[0.47741684,0.00021022701,0.5125094,0.00014287293,0.000072060524,0.00033824713,0.0005208018,0.00033878203,0.008450746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996013,0.00016444855,0.00001269433,0.00008518893,0.0000809301,0.000055381024],"domain_scores_gemma":[0.999353,0.00037219035,0.00005639853,0.000061592174,0.00011448417,0.000042418615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010329516,0.0010278578,0.0012147155,0.0009257853,0.00054076075,0.00081126,0.0012986406,0.0010491222,0.0055833026],"category_scores_gemma":[0.0018767847,0.00048705487,0.0005440486,0.0013408574,0.0007873261,0.0014715175,0.0013779209,0.0008869172,0.0006681848],"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.0001137064,0.00003269726,0.0002857197,0.000037013873,0.000022155366,0.000026517839,0.000035415924,0.9520563,0.0007187172,0.006966734,0.0014877892,0.03821727],"study_design_scores_gemma":[0.000009407516,0.000023025734,0.000045760356,0.000002208937,0.0000025955756,0.0000042399924,0.0000058134947,0.99618477,0.00016356124,0.0032646335,0.0002921509,0.0000017837514],"about_ca_topic_score_codex":0.0061444715,"about_ca_topic_score_gemma":0.005523421,"teacher_disagreement_score":0.0061444715,"about_ca_system_score_codex":0.0012134104,"about_ca_system_score_gemma":0.0008942841,"threshold_uncertainty_score":0.01867807},"labels":[],"label_agreement":null},{"id":"W2066008390","doi":"10.1002/net.10027","title":"Parallel NC‐algorithms for multifacility location problems with mutual communication and their applications","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"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":"Minimax; Computer science; Tree (set theory); Algorithm; Scheme (mathematics); Mathematical optimization; Parametric statistics; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.04057189479512446,"score_gpt":0.22103669907289286,"score_spread":0.1804648042777684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066008390","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.025459863,0.00028802827,0.9666823,0.00038587788,0.000046196372,0.00009472148,0.000087786124,0.00049413217,0.0064610858],"genre_scores_gemma":[0.39232397,0.0002484228,0.6011799,0.0001237225,0.000093491064,0.000389376,0.00031176215,0.00011485305,0.0052144756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988996,0.00030537823,0.00007831125,0.00023306003,0.00033289628,0.0001507147],"domain_scores_gemma":[0.99618775,0.0020293416,0.00040113716,0.0005448071,0.0007147545,0.00012218868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020252003,0.00082237966,0.0010488643,0.0008711768,0.0010324711,0.0010354473,0.0018991331,0.0011050923,0.0035178058],"category_scores_gemma":[0.006431429,0.00044115537,0.00055447593,0.0018383687,0.0010077496,0.0021208962,0.0018061617,0.0011143395,0.00053261674],"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.00021281057,0.000092255534,0.00058073434,0.00008899083,0.000024153713,0.00003658064,0.00010292319,0.84134245,0.0012779855,0.047187466,0.0025318838,0.10652193],"study_design_scores_gemma":[0.000035055324,0.000022435897,0.00007855454,0.000004735602,0.0000058081932,0.000019560113,0.000015055855,0.976227,0.0006826574,0.02181753,0.0010869466,0.0000047335066],"about_ca_topic_score_codex":0.009842655,"about_ca_topic_score_gemma":0.009267641,"teacher_disagreement_score":0.009842655,"about_ca_system_score_codex":0.0019082469,"about_ca_system_score_gemma":0.0020794699,"threshold_uncertainty_score":0.019570768},"labels":[],"label_agreement":null},{"id":"W2066613498","doi":"10.1002/1097-0037(200103)37:2<94::aid-net4>3.0.co;2-6","title":"Improved upper and lower bounds fork-broadcasting","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Brandon University","funders":"","keywords":"Upper and lower bounds; Vertex (graph theory); Broadcasting (networking); Graph; Combinatorics; Computer science; Mathematics; Computer network","score_opus":0.022723227146079272,"score_gpt":0.25938346006956736,"score_spread":0.2366602329234881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066613498","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.05965567,0.013165638,0.7615104,0.0048140204,0.0009728659,0.00028906853,0.0024397776,0.0035457094,0.15360697],"genre_scores_gemma":[0.5655164,0.01156108,0.36567068,0.0016934809,0.0017426814,0.00062979304,0.0029862807,0.0021327275,0.04806688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949479,0.00067263993,0.00018027742,0.0009329014,0.0017638258,0.0015023843],"domain_scores_gemma":[0.98115575,0.0111770425,0.0009072484,0.0030991577,0.0026976261,0.00096307934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004146937,0.002205177,0.0020738374,0.0027919195,0.0029454217,0.003379033,0.005874699,0.00195718,0.022865452],"category_scores_gemma":[0.02351966,0.0010463494,0.0015496063,0.0034272303,0.0026179736,0.012148738,0.0049058176,0.005103502,0.0053300564],"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.00083558774,0.0003596287,0.0023981582,0.000994842,0.00008453145,0.0002826839,0.0010385441,0.10577215,0.012371354,0.6739661,0.050004683,0.15189178],"study_design_scores_gemma":[0.00007866179,0.00021938258,0.0012900452,0.00031294915,0.0001581192,0.0006299612,0.00040313552,0.29604614,0.010226459,0.6405958,0.04991318,0.00012616153],"about_ca_topic_score_codex":0.0077424073,"about_ca_topic_score_gemma":0.010299489,"teacher_disagreement_score":0.022865452,"about_ca_system_score_codex":0.0056183496,"about_ca_system_score_gemma":0.0031725878,"threshold_uncertainty_score":0.07649255},"labels":[],"label_agreement":null},{"id":"W2066877252","doi":"10.1002/net.20076","title":"Reliable broadcasting in double loop networks","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Broadcasting (networking); Atomic broadcast; Construct (python library); Broadcast communication network; Broadcast domain; Computer network; Tree (set theory); Interconnection; Distributed computing; Tree network; Loop (graph theory); Port (circuit theory); Broadcast radiation; Mathematics; Algorithm; Time complexity","score_opus":0.016738661673204744,"score_gpt":0.23666142579852317,"score_spread":0.21992276412531842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066877252","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.16761516,0.001822761,0.81012267,0.00044486427,0.00011269384,0.000047079764,0.00015963588,0.00068046997,0.018994661],"genre_scores_gemma":[0.94627523,0.00094213156,0.047933083,0.00007892434,0.00008732072,0.00006432586,0.00013721948,0.00008132234,0.0044003674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952793,0.00009238339,0.000020247811,0.00008672659,0.00018807499,0.00008471022],"domain_scores_gemma":[0.9992422,0.000302398,0.0001343895,0.00012515779,0.00015853978,0.000037414367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045399,0.00021490516,0.00039826948,0.0004617029,0.0004159305,0.0009841514,0.00055599085,0.00049281237,0.001234114],"category_scores_gemma":[0.002048541,0.00022648426,0.00016438942,0.0005349577,0.00079042464,0.0012894253,0.0006023421,0.000523884,0.00034908866],"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.00022382745,0.000033194956,0.0009605972,0.00022100688,0.000023891289,0.0001656399,0.0002819132,0.37790433,0.018910205,0.5138881,0.003728151,0.08365915],"study_design_scores_gemma":[0.000037132293,0.000106907515,0.00032886866,0.000022929837,0.000018599934,0.000121261364,0.000050067036,0.61601496,0.0068976055,0.3657693,0.0106116235,0.000020772892],"about_ca_topic_score_codex":0.0009526554,"about_ca_topic_score_gemma":0.000620378,"teacher_disagreement_score":0.001234114,"about_ca_system_score_codex":0.0006064325,"about_ca_system_score_gemma":0.00038862976,"threshold_uncertainty_score":0.004400015},"labels":[],"label_agreement":null},{"id":"W2067136846","doi":"10.1002/net.20471","title":"Cutting planes for branch‐and‐price algorithms","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Algorithm; Computer science; Cutting-plane method; Mathematical optimization; Mathematics; Integer programming","score_opus":0.028313248287365478,"score_gpt":0.24163975919374486,"score_spread":0.21332651090637939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067136846","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.0019412619,0.0006561755,0.9906883,0.00022542916,0.000065427426,0.00009492003,0.00011950094,0.00032420584,0.0058846883],"genre_scores_gemma":[0.09857567,0.0021061113,0.8913774,0.00024026688,0.00019247801,0.0007592478,0.00091665215,0.00038192162,0.0054503093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997413,0.001152266,0.00015657512,0.0002624862,0.0007788915,0.00023679076],"domain_scores_gemma":[0.9975841,0.0017098278,0.00016798665,0.00023107993,0.00025825066,0.000048622158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035159176,0.0019485478,0.0016080361,0.0022592,0.0007932418,0.0034815625,0.0017606156,0.0017300443,0.012563807],"category_scores_gemma":[0.008336409,0.0009744625,0.001676983,0.0034601977,0.00163773,0.002887444,0.0016807849,0.0037056715,0.002262752],"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.00007818985,0.00007907878,0.00018621473,0.00021082176,0.00006849353,0.00007163084,0.000087450644,0.42054406,0.0008347961,0.42561963,0.0077827587,0.14443687],"study_design_scores_gemma":[0.00004240583,0.000033608278,0.0000519158,0.000074856485,0.000020598181,0.00002674765,0.000021300937,0.70317554,0.00066851906,0.2856241,0.010249517,0.000010876084],"about_ca_topic_score_codex":0.0042106826,"about_ca_topic_score_gemma":0.0029229245,"teacher_disagreement_score":0.012563807,"about_ca_system_score_codex":0.0024321575,"about_ca_system_score_gemma":0.0021264045,"threshold_uncertainty_score":0.042030096},"labels":[],"label_agreement":null},{"id":"W2071941627","doi":"10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n","title":"Impact of topographic information on graph exploration efficiency","year":2000,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Traverse; Graph; A priori and a posteriori; Computer science; Biconnected graph; Theoretical computer science; Strength of a graph; Knowledge graph; Combinatorics; Algorithm; Line graph; Artificial intelligence; Mathematics; Voltage graph; Geography","score_opus":0.013144953852214782,"score_gpt":0.2557916865583918,"score_spread":0.242646732706177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071941627","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.93753356,0.001329889,0.05128863,0.0008137019,0.000029334962,0.00003723564,0.00030048913,0.0005589351,0.008108283],"genre_scores_gemma":[0.9924827,0.00029835774,0.0064210985,0.00003280278,0.000011021652,0.000017511042,0.00016207836,0.00007129798,0.00050312234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794024,0.0008388593,0.000110905654,0.00031056182,0.00043053244,0.00036891806],"domain_scores_gemma":[0.9661954,0.028693587,0.0011375662,0.0025993648,0.0009148821,0.00045926822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023473576,0.0005815208,0.0010502982,0.00092720566,0.00073906785,0.0016921987,0.000863737,0.0012767798,0.00216766],"category_scores_gemma":[0.042695034,0.00043902418,0.0004125558,0.0014800542,0.0011706265,0.005285787,0.0016350743,0.0007842675,0.0004648418],"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.0006905005,0.00017262691,0.008295046,0.00014316954,0.000089844245,0.00022155717,0.00014961488,0.9140038,0.0041940627,0.003430753,0.00082559686,0.06778334],"study_design_scores_gemma":[0.00006873405,0.00049699156,0.0071818354,0.000042282103,0.00011769764,0.00048054193,0.0002642019,0.96779364,0.010939817,0.011657046,0.0009151392,0.000042061067],"about_ca_topic_score_codex":0.002289211,"about_ca_topic_score_gemma":0.002637015,"teacher_disagreement_score":0.0023473576,"about_ca_system_score_codex":0.0007390555,"about_ca_system_score_gemma":0.0010577857,"threshold_uncertainty_score":0.012414217},"labels":[],"label_agreement":null},{"id":"W2072442357","doi":"10.1002/net.21550","title":"A comparison of several models for the hamiltonian <i>p</i>‐median problem","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Median; Disjoint sets; Mathematics; Combinatorics; Hamiltonian (control theory); Linear programming; Benchmark (surveying); Hamiltonian path problem; Mathematical optimization; Graph; Computer science; Hamiltonian path; Discrete mathematics; Algorithm","score_opus":0.03947672229659012,"score_gpt":0.26368034098324594,"score_spread":0.22420361868665584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072442357","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.22323717,0.008641695,0.7030629,0.005232837,0.00056544936,0.0007595482,0.0035445325,0.0012573908,0.053698517],"genre_scores_gemma":[0.66627526,0.008481125,0.31123132,0.0007843627,0.00047576003,0.0012610883,0.003330696,0.00051860395,0.007641746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979455,0.0010324055,0.00008775229,0.00030684427,0.0003488317,0.00027863693],"domain_scores_gemma":[0.9872339,0.010381682,0.00083374744,0.000654732,0.00046136562,0.00043467997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044200905,0.001971903,0.0017468951,0.002376952,0.0009108967,0.003761025,0.004892286,0.0029703758,0.0061561386],"category_scores_gemma":[0.010611251,0.0009641934,0.0022812083,0.0034133096,0.0012609119,0.0055626584,0.0017323161,0.0030310652,0.00059126073],"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.0004535636,0.0004782039,0.0011211701,0.00037296122,0.000097246644,0.000049851238,0.00009031715,0.92146134,0.00032065407,0.04290572,0.0058452417,0.026803777],"study_design_scores_gemma":[0.00009799658,0.00022453663,0.00040172733,0.00006695022,0.000041945663,0.00004020353,0.000084095394,0.97300774,0.0003080779,0.024173593,0.0015230208,0.000030101775],"about_ca_topic_score_codex":0.0072492617,"about_ca_topic_score_gemma":0.011233884,"teacher_disagreement_score":0.0072492617,"about_ca_system_score_codex":0.005491519,"about_ca_system_score_gemma":0.0035520212,"threshold_uncertainty_score":0.039843976},"labels":[],"label_agreement":null},{"id":"W2074413296","doi":"10.1002/net.21587","title":"Timing problems and algorithms: Time decisions for sequences of activities","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Concatenation (mathematics); Vehicle routing problem; Inference; Combinatorial optimization; Algorithm; Mathematical optimization; Routing (electronic design automation); Artificial intelligence; Mathematics","score_opus":0.06351391128462434,"score_gpt":0.2892708729540661,"score_spread":0.22575696166944176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074413296","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.0029701663,0.0013810206,0.989193,0.000595267,0.00012916008,0.00009746187,0.0001311903,0.000097876364,0.005404821],"genre_scores_gemma":[0.15588312,0.0047979215,0.82522047,0.0004135239,0.00082902116,0.0008145852,0.00076027354,0.00034089768,0.0109402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958002,0.0018168986,0.00031870033,0.001025176,0.0008081596,0.00023080822],"domain_scores_gemma":[0.992235,0.005984904,0.0006981214,0.00055544765,0.0003562474,0.00017028229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046368893,0.0021250308,0.0013707575,0.0012564205,0.0009887499,0.0040512024,0.0024276334,0.0024898814,0.0081112785],"category_scores_gemma":[0.018946923,0.0009033766,0.001729826,0.002909261,0.0027790836,0.0063635223,0.0022662254,0.0033038256,0.0014113777],"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.00009089349,0.000060773156,0.00057810114,0.00030735048,0.00006760889,0.000071567454,0.0001840559,0.345994,0.0006110591,0.5639596,0.0044678464,0.08360721],"study_design_scores_gemma":[0.000034487555,0.000059908416,0.00013824378,0.000082235456,0.000026943804,0.00006946079,0.00006125247,0.4872042,0.0005639063,0.49946693,0.012270013,0.000022435746],"about_ca_topic_score_codex":0.0020984085,"about_ca_topic_score_gemma":0.0015339997,"teacher_disagreement_score":0.0081112785,"about_ca_system_score_codex":0.0023117883,"about_ca_system_score_gemma":0.002662452,"threshold_uncertainty_score":0.027134895},"labels":[],"label_agreement":null},{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","score_opus":0.01747177441735967,"score_gpt":0.25795359369669935,"score_spread":0.24048181927933968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075240586","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.24454233,0.0010190145,0.73222435,0.0011296044,0.00024164771,0.00023860317,0.0013227754,0.0009880338,0.018293729],"genre_scores_gemma":[0.7373891,0.00080510817,0.249925,0.00037714958,0.00013649088,0.00017360772,0.000992333,0.00034501695,0.0098562995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.00025238824,0.000029254732,0.0002499181,0.000111160865,0.00025601927],"domain_scores_gemma":[0.9983961,0.0009026932,0.000163816,0.00026034616,0.00010327974,0.00017381772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951148,0.0013569955,0.0014430418,0.00047600426,0.0006827784,0.0012635629,0.001758464,0.0012543949,0.005026551],"category_scores_gemma":[0.0035827481,0.0005532048,0.0006812107,0.0014261941,0.00077795883,0.0024561677,0.0009373673,0.0012375094,0.0007584181],"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.0004425199,0.00021469734,0.0011361768,0.00030336555,0.00006427561,0.0002115781,0.00010597914,0.8738826,0.0076410426,0.05925254,0.0073341248,0.04941114],"study_design_scores_gemma":[0.00007429695,0.00010837777,0.000342313,0.000014644175,0.00002771058,0.00010057249,0.00006359811,0.91165036,0.00244925,0.08215043,0.002999077,0.00001931863],"about_ca_topic_score_codex":0.0037631642,"about_ca_topic_score_gemma":0.004544936,"teacher_disagreement_score":0.005026551,"about_ca_system_score_codex":0.0015275576,"about_ca_system_score_gemma":0.0013915627,"threshold_uncertainty_score":0.016815484},"labels":[],"label_agreement":null},{"id":"W2078190972","doi":"10.1002/net.20451","title":"The preemptive swapping problem on a tree","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Canada Research Chairs","keywords":"Vertex (graph theory); Object (grammar); Computer science; Tree (set theory); Heuristic; Mathematical optimization; Combinatorics; Mathematics; Routing (electronic design automation); Type (biology); Graph; Computer network; Artificial intelligence","score_opus":0.025470249201273908,"score_gpt":0.22639831072444183,"score_spread":0.20092806152316792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078190972","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.30827448,0.0007941563,0.6703728,0.00082624756,0.00010729016,0.00022509141,0.00074683665,0.00045391513,0.018199246],"genre_scores_gemma":[0.784559,0.00064215425,0.20220701,0.00018479179,0.00007125561,0.00018575069,0.0011851192,0.0001613493,0.010803453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941254,0.00020361195,0.00002796421,0.00010237588,0.00009610906,0.0001574029],"domain_scores_gemma":[0.9991416,0.000502275,0.0000877021,0.00008908762,0.00007071243,0.0001086819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057579204,0.00056712807,0.00085180986,0.0005009338,0.0009226719,0.0009439416,0.0011115479,0.0009653654,0.006429598],"category_scores_gemma":[0.0016837368,0.00036267683,0.0006816481,0.0011350104,0.00065582787,0.0022026717,0.0010573358,0.0008842217,0.00073624187],"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.00043961906,0.00026787145,0.001236943,0.00038179892,0.000083027706,0.0010204478,0.00027988615,0.7544895,0.014724542,0.10784203,0.00975352,0.109480806],"study_design_scores_gemma":[0.00005456846,0.00016414898,0.00047034453,0.000026347501,0.000028974624,0.000368351,0.00016852826,0.8572374,0.0038885423,0.12771544,0.009860787,0.00001656948],"about_ca_topic_score_codex":0.0019185789,"about_ca_topic_score_gemma":0.0014421159,"teacher_disagreement_score":0.006429598,"about_ca_system_score_codex":0.00064599543,"about_ca_system_score_gemma":0.00067727204,"threshold_uncertainty_score":0.02150917},"labels":[],"label_agreement":null},{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","score_opus":0.22542077035339705,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082259377","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.002655867,0.00046491897,0.99229324,0.00024141563,0.000032585485,0.00009232761,0.00009986889,0.00008818444,0.004031612],"genre_scores_gemma":[0.0789391,0.0019493189,0.91520643,0.00021947372,0.00014406207,0.0004711377,0.00048922264,0.00012857962,0.0024526864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788374,0.00077393034,0.00012941977,0.0003044135,0.0007030291,0.00020548029],"domain_scores_gemma":[0.9969259,0.0020309074,0.00029656678,0.00031784005,0.00035866932,0.00007018417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027502093,0.0019284328,0.0009946086,0.0012861063,0.0006938279,0.002813861,0.0022641434,0.0017726151,0.00623301],"category_scores_gemma":[0.009639959,0.00094699935,0.001306014,0.00258785,0.0010786986,0.004054203,0.0018091835,0.004204781,0.0008638708],"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.00008196949,0.00022673009,0.00039980852,0.00044714005,0.000051763276,0.0000798078,0.00018341544,0.5727537,0.0017203449,0.27801538,0.004380669,0.14165927],"study_design_scores_gemma":[0.000039636434,0.000055906457,0.00010045529,0.000063743995,0.000023487819,0.00006592645,0.00008366574,0.8426584,0.0011752974,0.15052705,0.005190363,0.00001606215],"about_ca_topic_score_codex":0.0025240711,"about_ca_topic_score_gemma":0.0030927204,"teacher_disagreement_score":0.00623301,"about_ca_system_score_codex":0.0019198403,"about_ca_system_score_gemma":0.0026054806,"threshold_uncertainty_score":0.020851493},"labels":[],"label_agreement":null},{"id":"W2082613046","doi":"10.1002/net.10098","title":"On the power of BFS to determine a graph's diameter","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lexicographical order; Upper and lower bounds; Graph; Mathematics; Constant (computer programming); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.020818701944480714,"score_gpt":0.27063153885149,"score_spread":0.24981283690700928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082613046","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.34390962,0.004592921,0.63133407,0.0022831191,0.00012336376,0.0001014095,0.0010566217,0.0021921664,0.0144067155],"genre_scores_gemma":[0.7766128,0.0012921209,0.21834883,0.00030268784,0.00018093226,0.00013188773,0.0009900235,0.00035412586,0.0017865533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980009,0.0007114465,0.000099540004,0.00040952655,0.0005421264,0.00023641258],"domain_scores_gemma":[0.9721281,0.022508455,0.0011249431,0.0024051482,0.0011424895,0.0006909188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028928625,0.00081919454,0.001431402,0.0038347873,0.0009235633,0.0016026878,0.0017129227,0.0011679088,0.0033746746],"category_scores_gemma":[0.026694834,0.0008725089,0.00072641205,0.0019821357,0.0018051647,0.0050748726,0.001614797,0.0018031887,0.0010705506],"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.002036217,0.00026202502,0.042048894,0.0008261831,0.00026933203,0.00035752295,0.000815466,0.4733166,0.038269106,0.14644453,0.016760113,0.27859405],"study_design_scores_gemma":[0.000039824998,0.00007395805,0.0022620591,0.00006731511,0.000022702596,0.00022138539,0.00009926778,0.8836356,0.0054561994,0.104339086,0.0037581103,0.00002449271],"about_ca_topic_score_codex":0.00413882,"about_ca_topic_score_gemma":0.0034626615,"teacher_disagreement_score":0.00413882,"about_ca_system_score_codex":0.0014840623,"about_ca_system_score_gemma":0.00083255296,"threshold_uncertainty_score":0.015299141},"labels":[],"label_agreement":null},{"id":"W2090707215","doi":"10.1002/net.21594","title":"Reaching the elementary lower bound in the vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Vehicle routing problem; Upper and lower bounds; Relaxation (psychology); Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Shortest path problem; State space; Computer science; Mathematics; Tree (set theory); Branch and bound; State (computer science); Space (punctuation); Algorithm; Combinatorics","score_opus":0.015640875985707885,"score_gpt":0.23722605952330764,"score_spread":0.22158518353759976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090707215","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.13611655,0.00129279,0.840011,0.00055844913,0.00007048268,0.00024971936,0.00019463972,0.00030728092,0.021199092],"genre_scores_gemma":[0.65061206,0.0016531842,0.3417238,0.00022003452,0.000082986684,0.00036823715,0.00042215758,0.00030292253,0.004614623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837863,0.00067785894,0.00005775108,0.00022911595,0.0002996834,0.00035702283],"domain_scores_gemma":[0.98855954,0.00984872,0.0004952559,0.0005425562,0.00029519742,0.00025863145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035471842,0.001771559,0.001437101,0.00081788213,0.0008258684,0.0020983955,0.0015303326,0.0012657613,0.0051966547],"category_scores_gemma":[0.011792526,0.00049664883,0.0011443654,0.0010108342,0.0012172603,0.0039579836,0.0017304972,0.0027447753,0.0005570586],"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.000306792,0.00022949999,0.0006274851,0.00032533528,0.00008346413,0.000087953136,0.00019037163,0.8540173,0.0039448547,0.09512674,0.0016292551,0.0434309],"study_design_scores_gemma":[0.000058089387,0.00023117286,0.00032790456,0.000045807054,0.000052300922,0.000059089758,0.000090318004,0.93677676,0.0038370406,0.056381468,0.0021232306,0.00001689226],"about_ca_topic_score_codex":0.002475676,"about_ca_topic_score_gemma":0.0031693322,"teacher_disagreement_score":0.0051966547,"about_ca_system_score_codex":0.001291607,"about_ca_system_score_gemma":0.0022053742,"threshold_uncertainty_score":0.018759489},"labels":[],"label_agreement":null},{"id":"W2094078700","doi":"10.1002/net.10081","title":"Solving the <i>p</i>‐Center problem with Tabu Search and Variable Neighborhood Search","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Tabu search; Heuristics; Variable neighborhood search; Mathematical optimization; Vertex (graph theory); Guided Local Search; Metaheuristic; Variable (mathematics); Mathematics; Center (category theory); Local search (optimization); Computer science; Algorithm; Combinatorics; Graph","score_opus":0.01495553087688913,"score_gpt":0.20241243218071964,"score_spread":0.1874569013038305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094078700","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.16252923,0.0006949155,0.82565904,0.00030959124,0.00005024728,0.00024332631,0.00013961211,0.00083129073,0.0095427735],"genre_scores_gemma":[0.43364185,0.00025369978,0.56342775,0.00008110511,0.000027228229,0.00026322788,0.00026602778,0.00015056667,0.0018885002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.0004962598,0.000024558567,0.000076420336,0.0000972633,0.00010921734],"domain_scores_gemma":[0.99828476,0.0012435534,0.00015778572,0.00011918517,0.00012860606,0.00006597918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040969,0.00071583764,0.00095125457,0.0010201465,0.00079922256,0.0010306367,0.0016221019,0.0012871915,0.0031801562],"category_scores_gemma":[0.0042015575,0.0004748927,0.0005952791,0.001532563,0.0007830894,0.0013897166,0.00074041774,0.0007135948,0.0003927845],"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.00022631542,0.00017187522,0.0013454917,0.00011409868,0.000048861497,0.000056076427,0.000095102274,0.90524495,0.00094094354,0.015437522,0.0021231056,0.074195616],"study_design_scores_gemma":[0.000051745414,0.000074743984,0.00016546361,0.0000089880095,0.000012521148,0.000024640947,0.000041474297,0.9922655,0.0009125407,0.0057412363,0.0006947506,0.0000062364966],"about_ca_topic_score_codex":0.008466912,"about_ca_topic_score_gemma":0.006079034,"teacher_disagreement_score":0.008466912,"about_ca_system_score_codex":0.00097286224,"about_ca_system_score_gemma":0.0016326249,"threshold_uncertainty_score":0.016835213},"labels":[],"label_agreement":null},{"id":"W2094626628","doi":"10.1002/net.20485","title":"Branch‐and‐cut and hybrid local search for the multi‐level capacitated minimum spanning tree problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minimum spanning tree; Spanning tree; GRASP; Benchmark (surveying); Mathematical optimization; Branch and cut; Branch and bound; Polyhedron; Mathematics; Tree (set theory); Computer science; Cutting-plane method; Combinatorics; Linear programming; Integer programming","score_opus":0.06862574685694278,"score_gpt":0.26602709596399476,"score_spread":0.19740134910705198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094626628","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.03583719,0.0004271654,0.95868313,0.00024484444,0.000023121142,0.00007332434,0.0000729468,0.000495382,0.004142909],"genre_scores_gemma":[0.4598446,0.00024037824,0.5367218,0.00011879471,0.00003974619,0.00042451682,0.0002747537,0.00018713885,0.0021483882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909353,0.00040322446,0.00002965371,0.00011039535,0.0002435274,0.00011968614],"domain_scores_gemma":[0.9983937,0.0010957619,0.00015356479,0.00013302085,0.00014799,0.000075960575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018937702,0.00085182366,0.0011497485,0.0010478416,0.00054588926,0.0011843144,0.0013473711,0.0012010965,0.004097934],"category_scores_gemma":[0.004442106,0.0005881453,0.0006339031,0.0014700888,0.00086277915,0.0016008324,0.0014666218,0.0015441006,0.0006106453],"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.00008984581,0.000069866226,0.0003227518,0.00007903461,0.000031872172,0.000022569759,0.00005385972,0.9255297,0.0010670639,0.015313976,0.0014925072,0.055926863],"study_design_scores_gemma":[0.000019111265,0.000026553413,0.000060495866,0.000006923444,0.000004639717,0.0000074661716,0.000008441775,0.9940402,0.00045179238,0.0050062495,0.00036472734,0.0000033567221],"about_ca_topic_score_codex":0.0026981425,"about_ca_topic_score_gemma":0.0027982765,"teacher_disagreement_score":0.004097934,"about_ca_system_score_codex":0.0011188756,"about_ca_system_score_gemma":0.0011751838,"threshold_uncertainty_score":0.013708949},"labels":[],"label_agreement":null},{"id":"W2094814392","doi":"10.1002/net.10001","title":"Maximizing residual flow under an arc destruction","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Windsor","funders":"","keywords":"Residual; Arc (geometry); Flow (mathematics); Flow network; Maximum flow problem; Mathematics; Multi-commodity flow problem; Mathematical optimization; Computer science; Algorithm; Geometry","score_opus":0.01790803809284282,"score_gpt":0.21797649310930473,"score_spread":0.2000684550164619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094814392","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.31253445,0.0005674284,0.6697515,0.0007073556,0.000055149856,0.00011291417,0.0001917795,0.00056136877,0.015517991],"genre_scores_gemma":[0.8971141,0.00031387154,0.09639832,0.00008458218,0.000041829866,0.00007370216,0.0001885018,0.00013597126,0.0056492276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.00034239356,0.000038328068,0.00018714281,0.00013589957,0.00018863345],"domain_scores_gemma":[0.9981762,0.0008828847,0.00028052425,0.00028849594,0.00015196233,0.00021989139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017967664,0.00071114494,0.0011144854,0.0008148895,0.00051774626,0.0010997357,0.0012820996,0.0009390724,0.0039034826],"category_scores_gemma":[0.0035132724,0.0004354672,0.0005374946,0.0009868828,0.0017612015,0.0027531476,0.0015262018,0.0009999727,0.00038380479],"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.00047171343,0.00014301266,0.00082374585,0.00019632893,0.00005149246,0.00017190643,0.00014632609,0.87053514,0.0095611755,0.07330229,0.0026808546,0.041915983],"study_design_scores_gemma":[0.00006149302,0.00020269341,0.00039209143,0.00002071179,0.00002974113,0.00014799062,0.00008031851,0.9249985,0.007792317,0.06377143,0.0024862443,0.000016475251],"about_ca_topic_score_codex":0.0011632595,"about_ca_topic_score_gemma":0.00074623665,"teacher_disagreement_score":0.0039034826,"about_ca_system_score_codex":0.00095011323,"about_ca_system_score_gemma":0.0006918886,"threshold_uncertainty_score":0.013058424},"labels":[],"label_agreement":null},{"id":"W2100641445","doi":"10.1002/net.20437","title":"Lagrangean decomposition/relaxation for the routing and wavelength assignment problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Subgradient method; Mathematical optimization; Relaxation (psychology); Path (computing); Node (physics); Computation; Shortest path problem; Arc routing; Decomposition; Column generation; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Routing (electronic design automation); Algorithm; Combinatorics; Graph; Physics","score_opus":0.016444781169880577,"score_gpt":0.22049030369445163,"score_spread":0.20404552252457106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100641445","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.011938336,0.0006757242,0.9705375,0.00065091555,0.000097299126,0.000093201255,0.00015835435,0.000053413136,0.01579519],"genre_scores_gemma":[0.34813783,0.0017710893,0.6322658,0.0003584973,0.00026956594,0.0005479156,0.0004836673,0.00016582629,0.015999867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998841,0.0006612095,0.000031384003,0.0001047653,0.00023614854,0.00012550896],"domain_scores_gemma":[0.99885595,0.00078208494,0.00009362054,0.000051317194,0.00016732457,0.00004981685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002696915,0.0011768405,0.00075944513,0.00071894046,0.00051636825,0.0011978864,0.00073593436,0.00094544736,0.004788945],"category_scores_gemma":[0.0035671333,0.00050407567,0.0006971104,0.0010330244,0.0010202373,0.0011878185,0.0011387244,0.0020853162,0.00076190394],"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.00009400797,0.00009137958,0.00022388887,0.00021553248,0.00003243411,0.00009872944,0.00010404524,0.8344404,0.0013763723,0.12926501,0.0046780948,0.02938008],"study_design_scores_gemma":[0.000019800547,0.000029316578,0.00009023075,0.000022185079,0.000005227863,0.000029260662,0.000029000988,0.95847195,0.0003874266,0.038342834,0.0025645571,0.000008047579],"about_ca_topic_score_codex":0.0045466493,"about_ca_topic_score_gemma":0.0031020935,"teacher_disagreement_score":0.004788945,"about_ca_system_score_codex":0.001553116,"about_ca_system_score_gemma":0.0021774657,"threshold_uncertainty_score":0.016020596},"labels":[],"label_agreement":null},{"id":"W2102346823","doi":"10.1002/net.21562","title":"Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Routing (electronic design automation); Truck; Traverse; Computer science; Mathematical optimization; Arc routing; Vehicle routing problem; Operations research; Mathematics; Engineering; Automotive engineering; Computer network; Geography","score_opus":0.01909616450260213,"score_gpt":0.23929610966925796,"score_spread":0.22019994516665584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102346823","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.037907016,0.00077379704,0.9562663,0.00033757713,0.000046754754,0.00009334748,0.00007240765,0.0001523284,0.0043505663],"genre_scores_gemma":[0.5641348,0.0005416382,0.42735094,0.00013687316,0.000075328404,0.0005424343,0.0002099941,0.00010315228,0.006904919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.00024318261,0.00001770978,0.00007940675,0.00006952245,0.000042626],"domain_scores_gemma":[0.9983494,0.0013291598,0.00014428531,0.00003720589,0.000083131046,0.00005680811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702889,0.00079048186,0.0010729638,0.0008602324,0.0005400927,0.00066177465,0.0013062995,0.0010477827,0.0019511544],"category_scores_gemma":[0.003195934,0.000607649,0.0005752948,0.0009080094,0.0007072651,0.0011479306,0.00084207964,0.00084026426,0.00019116208],"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.000029552195,0.000031622018,0.00020271189,0.000034094133,0.000020207117,0.000032394055,0.000025997351,0.9820877,0.00018765619,0.008323383,0.00047332732,0.008551375],"study_design_scores_gemma":[0.000007256474,0.000014125656,0.00002271381,0.0000024092533,0.0000027921615,0.000005879202,0.0000053187505,0.9967303,0.000038164304,0.0029729705,0.00019615675,0.0000018813347],"about_ca_topic_score_codex":0.0057819374,"about_ca_topic_score_gemma":0.0066649397,"teacher_disagreement_score":0.0057819374,"about_ca_system_score_codex":0.0011588136,"about_ca_system_score_gemma":0.0009738902,"threshold_uncertainty_score":0.0114966035},"labels":[],"label_agreement":null},{"id":"W2107686563","doi":"10.1002/net.21549","title":"Cooperative covering problems on networks","year":2014,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"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":"Heuristics; Mathematical optimization; Integer programming; Linear programming; SIGNAL (programming language); Facility location problem; Signal strength; Computer science; Piecewise; Set (abstract data type); Piecewise linear function; Point (geometry); Polynomial; Function (biology); Algorithm; Mathematics; Wireless sensor network","score_opus":0.01631197117293037,"score_gpt":0.20259445050924724,"score_spread":0.18628247933631686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107686563","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.08180426,0.003511913,0.8756124,0.0016138852,0.00017763805,0.00024855416,0.0007129095,0.000271868,0.03604664],"genre_scores_gemma":[0.82058793,0.004526531,0.15404584,0.00046248324,0.0004417606,0.0007428067,0.0012536471,0.0001678571,0.01777112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725866,0.0014379482,0.00009717612,0.00045426868,0.0003598458,0.00039207868],"domain_scores_gemma":[0.99498063,0.0039797015,0.00034261885,0.0002687134,0.00023136238,0.00019685533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020968425,0.0018436015,0.0015150027,0.0011348936,0.0011045923,0.0024583708,0.0017718737,0.0022600202,0.005102306],"category_scores_gemma":[0.006977319,0.00075285364,0.0013671643,0.0028545829,0.0016774446,0.0032040074,0.002320793,0.0014505693,0.00050309027],"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.000110877765,0.00008458318,0.00050611777,0.00027641712,0.00010040162,0.00033512022,0.00030908146,0.7426326,0.0008896343,0.22570397,0.0057614036,0.023289822],"study_design_scores_gemma":[0.00006145354,0.00006893466,0.00028313306,0.000047606554,0.00003433975,0.00022446872,0.000176551,0.7563358,0.00046427423,0.23125504,0.011027038,0.000021395079],"about_ca_topic_score_codex":0.0039289603,"about_ca_topic_score_gemma":0.0023759084,"teacher_disagreement_score":0.005102306,"about_ca_system_score_codex":0.002837346,"about_ca_system_score_gemma":0.00086192583,"threshold_uncertainty_score":0.02058649},"labels":[],"label_agreement":null},{"id":"W2108063243","doi":"10.1002/net.20396","title":"Nonadaptive broadcasting in trees","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Upper and lower bounds; Tree (set theory); Combinatorics; Time complexity; Graph; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Computer network","score_opus":0.008583573358192428,"score_gpt":0.2169697974588081,"score_spread":0.20838622410061566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108063243","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.06428947,0.0032477034,0.91442215,0.00070723245,0.00017050724,0.00017308122,0.0002679635,0.0005405013,0.016181404],"genre_scores_gemma":[0.6246461,0.0060134213,0.35158274,0.00047252153,0.00040238033,0.0004265856,0.0008739632,0.0004038096,0.015178472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989116,0.00030994878,0.000067574256,0.00023523958,0.00024730817,0.00022837131],"domain_scores_gemma":[0.9941539,0.0034835583,0.00068613974,0.0009404239,0.0005313221,0.00020467809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009776349,0.0005896658,0.00089483726,0.0008044235,0.001525206,0.001885025,0.0017208019,0.0008585214,0.0041022566],"category_scores_gemma":[0.005781096,0.0004405101,0.00079051015,0.0018182823,0.0012807974,0.0045534954,0.0013745184,0.0016645256,0.0010594775],"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.00032353713,0.00017626044,0.0015161979,0.0008620592,0.00008886985,0.00043543987,0.00092841184,0.20954184,0.022793632,0.6161122,0.010998044,0.13622357],"study_design_scores_gemma":[0.00007907128,0.00027711707,0.0006106826,0.00007257533,0.00008792953,0.0006080437,0.0002550828,0.4734296,0.009019933,0.4800264,0.03549383,0.00003971611],"about_ca_topic_score_codex":0.0017964245,"about_ca_topic_score_gemma":0.0020195032,"teacher_disagreement_score":0.0041022566,"about_ca_system_score_codex":0.0012736522,"about_ca_system_score_gemma":0.00076705153,"threshold_uncertainty_score":0.013723433},"labels":[],"label_agreement":null},{"id":"W2110105948","doi":"10.1002/net.10009","title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Polytope; Spanning tree; Heuristics; Combinatorics; Mathematics; Tree (set theory); Mathematical optimization; Computer science","score_opus":0.03965971433503258,"score_gpt":0.31007744587188296,"score_spread":0.2704177315368504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110105948","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.3056823,0.013298571,0.6046217,0.001568566,0.00025642378,0.00054294337,0.00054493116,0.0008132865,0.07267134],"genre_scores_gemma":[0.6780815,0.006928303,0.3090059,0.00027426518,0.00013512344,0.00039154864,0.00087421155,0.00036156425,0.0039475868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997692,0.001245341,0.000073280054,0.0001190256,0.0006581975,0.00021227109],"domain_scores_gemma":[0.9939752,0.0047168424,0.00040965085,0.00024068342,0.00056051585,0.000097143304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004240834,0.0008150468,0.00068587,0.001432257,0.0006346385,0.001931007,0.0009380816,0.0009315583,0.0038147783],"category_scores_gemma":[0.010527223,0.00036164833,0.0010030197,0.002077304,0.0005589965,0.0019898375,0.0007534116,0.001109642,0.0003551255],"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.00042277083,0.00028137735,0.0010477478,0.0007285362,0.00012520928,0.000108400636,0.00018102741,0.77417797,0.0018559087,0.07043598,0.0052004624,0.14543462],"study_design_scores_gemma":[0.000087201544,0.00046793153,0.0009078441,0.00015411736,0.00008838128,0.00014883204,0.0002718174,0.96887153,0.0015974111,0.020367466,0.007012289,0.000025134672],"about_ca_topic_score_codex":0.0024846226,"about_ca_topic_score_gemma":0.0038734458,"teacher_disagreement_score":0.004240834,"about_ca_system_score_codex":0.0020491935,"about_ca_system_score_gemma":0.0016857103,"threshold_uncertainty_score":0.022427976},"labels":[],"label_agreement":null},{"id":"W2118555996","doi":"10.1002/net.21496","title":"The orienteering problem with variable profits","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Orienteering; Vertex (graph theory); Profit (economics); Operations research; Mathematical optimization; Mathematics; Graph; Combinatorics; Computer science; Travel time; Time limit; Mathematical economics; Economics; Microeconomics; Transport engineering; Engineering","score_opus":0.005110104516139893,"score_gpt":0.19108211177042117,"score_spread":0.18597200725428129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118555996","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.26237115,0.0011853096,0.7002815,0.0012322601,0.00012100146,0.00014757867,0.00042286213,0.00020952427,0.0340287],"genre_scores_gemma":[0.93149406,0.00071134313,0.058321204,0.00013732178,0.00007438311,0.000092931994,0.00031050594,0.00007971517,0.008778573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988176,0.00049487886,0.000038531794,0.0002318713,0.00017237556,0.000244559],"domain_scores_gemma":[0.9990175,0.0005598157,0.0001261759,0.000090851114,0.00008893819,0.00011674617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012094796,0.0009835426,0.0010979061,0.0005096508,0.00056584197,0.0018312093,0.0012410701,0.0012773502,0.003430166],"category_scores_gemma":[0.0029739381,0.00040198484,0.00073511177,0.0011159499,0.0013700619,0.0025312088,0.0015163053,0.0011115305,0.0002520293],"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.00015960363,0.00010167293,0.0012227606,0.00013121215,0.00006715993,0.00055701117,0.00015452389,0.7217768,0.0014025946,0.23000626,0.0043150377,0.04010535],"study_design_scores_gemma":[0.000042177515,0.00009018324,0.0004179768,0.000022094431,0.0000288679,0.00021903591,0.00016449319,0.8126063,0.0008483931,0.17992961,0.0056057503,0.000025047904],"about_ca_topic_score_codex":0.0053612487,"about_ca_topic_score_gemma":0.0029369364,"teacher_disagreement_score":0.0053612487,"about_ca_system_score_codex":0.0015726209,"about_ca_system_score_gemma":0.0007967656,"threshold_uncertainty_score":0.011475027},"labels":[],"label_agreement":null},{"id":"W2121031403","doi":"10.1002/net.10088","title":"Broadcasting in generalized chordal rings","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Broadcasting (networking); Undirected graph; Mathematics; Node (physics); Combinatorics; Ring (chemistry); Link (geometry); Graph; Treewidth; Discrete mathematics; Computer science; Pathwidth; Computer network; Line graph","score_opus":0.012615665083055854,"score_gpt":0.22121145617798488,"score_spread":0.208595791094929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121031403","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.6716507,0.0022180371,0.29747263,0.0006400499,0.00012213767,0.00016610962,0.0003504837,0.000572188,0.026807753],"genre_scores_gemma":[0.96351576,0.0004710006,0.034340795,0.000057502544,0.00004798308,0.00004441444,0.0000960805,0.000018257313,0.0014082316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993261,0.00016413633,0.000042830834,0.00013753671,0.00013597391,0.00019343806],"domain_scores_gemma":[0.99737954,0.0011405023,0.0004697748,0.00049903267,0.0003573698,0.00015379918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161454,0.00015623377,0.00042759822,0.00031831377,0.0006266414,0.0010188562,0.0006541184,0.00028586466,0.0014456229],"category_scores_gemma":[0.003239512,0.0001506122,0.00022244755,0.00051393005,0.0007287692,0.0013782536,0.0007361191,0.00040488923,0.00019340854],"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.001040851,0.000060621463,0.0028039424,0.0005509172,0.000074482596,0.00030939732,0.0006759838,0.19944924,0.04298833,0.654271,0.004464362,0.0933109],"study_design_scores_gemma":[0.0001820216,0.00045799348,0.0018005214,0.00004988434,0.00008205547,0.0007461121,0.0005481715,0.5328988,0.026256546,0.41236728,0.024546992,0.000063610874],"about_ca_topic_score_codex":0.0017946664,"about_ca_topic_score_gemma":0.0013774945,"teacher_disagreement_score":0.0017946664,"about_ca_system_score_codex":0.00085414166,"about_ca_system_score_gemma":0.00045645816,"threshold_uncertainty_score":0.006197214},"labels":[],"label_agreement":null},{"id":"W2133241632","doi":"10.1002/net.10114","title":"The Ring Star Problem: Polyhedral analysis and exact algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":164,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Ring (chemistry); Algorithm; Star (game theory); Integer programming; Network planning and design; Mathematics; Integer (computer science); Computer science; Mathematical optimization; Graph; Branch and cut; Combinatorics","score_opus":0.00989145699610171,"score_gpt":0.2084014050369466,"score_spread":0.19850994804084487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133241632","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.017232828,0.00046163137,0.96688217,0.0005400562,0.000073211195,0.0001786151,0.00023313114,0.0004042476,0.0139941005],"genre_scores_gemma":[0.29964933,0.0006642372,0.6900631,0.00022491104,0.00011530047,0.00050153123,0.000738419,0.00020021979,0.007842964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.0003678047,0.00003438259,0.0001470943,0.00023377595,0.00016674344],"domain_scores_gemma":[0.99777466,0.0016097537,0.00013306913,0.00018839615,0.00019325603,0.000100747675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015360233,0.0009941648,0.0016130772,0.0011142243,0.000796938,0.0022826141,0.0018817612,0.0015030039,0.010355072],"category_scores_gemma":[0.0040933946,0.00070428685,0.0010688951,0.002135335,0.0011223006,0.0022658438,0.0014968821,0.0018021368,0.001153444],"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.000089908935,0.00011187694,0.00029547585,0.00008051511,0.00001667584,0.000031683474,0.000037808066,0.91409075,0.0002546775,0.043712255,0.003579246,0.037699077],"study_design_scores_gemma":[0.000019290143,0.000011251884,0.00002883827,0.0000071190666,0.0000031289633,0.000006587207,0.000012735556,0.98128295,0.0000887454,0.017942784,0.0005941921,0.0000025277764],"about_ca_topic_score_codex":0.009572993,"about_ca_topic_score_gemma":0.00891344,"teacher_disagreement_score":0.010355072,"about_ca_system_score_codex":0.001979162,"about_ca_system_score_gemma":0.0021870567,"threshold_uncertainty_score":0.034641206},"labels":[],"label_agreement":null},{"id":"W2134465458","doi":"10.1002/net.20447","title":"A branch‐and‐cut algorithm for the preemptive swapping problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"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","funders":"","keywords":"Vertex (graph theory); Algorithm; Computer science; Graph; Integer programming; Branch and cut; Object (grammar); Combinatorics; Integer (computer science); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.02521659239295936,"score_gpt":0.23731270554829037,"score_spread":0.212096113155331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134465458","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.028542345,0.0004929569,0.9619425,0.00048063783,0.00008547683,0.00027903213,0.0002535744,0.0009050329,0.007018424],"genre_scores_gemma":[0.18192302,0.00027215446,0.8115914,0.00017396918,0.00006820649,0.0005220374,0.00075862074,0.00023985798,0.0044507408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.0002689839,0.000027381595,0.00013049928,0.00013366014,0.00011384912],"domain_scores_gemma":[0.9986594,0.0009714519,0.000090476984,0.0000632764,0.0001277976,0.00008771865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013163553,0.001300187,0.0014570784,0.0011510289,0.00088235614,0.0011161662,0.0017517597,0.0017400135,0.008412174],"category_scores_gemma":[0.0026034652,0.00074064214,0.0007452062,0.0016955868,0.0006481675,0.001434359,0.001177649,0.0019837362,0.00097071833],"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.000269896,0.00034844095,0.00048751073,0.0001662039,0.00005348777,0.00012683666,0.000090953836,0.78009135,0.0010666666,0.024381002,0.009426748,0.18349092],"study_design_scores_gemma":[0.000063538435,0.00004177317,0.0000513213,0.000007963682,0.000007357661,0.000019832616,0.000013155184,0.9880562,0.00026217144,0.010495087,0.0009776374,0.000004038115],"about_ca_topic_score_codex":0.0057662493,"about_ca_topic_score_gemma":0.0050410046,"teacher_disagreement_score":0.008412174,"about_ca_system_score_codex":0.001382451,"about_ca_system_score_gemma":0.0021678715,"threshold_uncertainty_score":0.028141558},"labels":[],"label_agreement":null},{"id":"W2148386181","doi":"10.1002/net.21653","title":"SRLG failure localization using nested m‐trails and their application to adaptive probing","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Traverse; Computer science; Integer programming; Heuristic; Node (physics); Topology (electrical circuits); Latency (audio); Computer network; Distributed computing; Algorithm; Mathematics; Physics; Artificial intelligence; Combinatorics; Telecommunications","score_opus":0.017512057860011636,"score_gpt":0.22102773838222334,"score_spread":0.2035156805222117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148386181","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.018184995,0.000097520955,0.9804693,0.00006094953,0.000019164814,0.000043337604,0.000021748747,0.00026158834,0.0008413842],"genre_scores_gemma":[0.49932167,0.00017049695,0.49862736,0.0000583436,0.000027618582,0.00010707876,0.00007821358,0.00006672275,0.0015425202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00013017649,0.00003184203,0.00007671527,0.00014286378,0.00005443108],"domain_scores_gemma":[0.9984717,0.0007372205,0.00027435654,0.00023523757,0.00018893256,0.00009259166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076953636,0.0005620838,0.00042988552,0.00090808247,0.00042938054,0.0005827797,0.0012096541,0.00047217816,0.0015636762],"category_scores_gemma":[0.003304088,0.0002839505,0.00048018302,0.0006958197,0.0007324273,0.0014780373,0.0010944731,0.000590063,0.00017959987],"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.00028989944,0.00012748473,0.0027203995,0.00018861663,0.00004309141,0.00025789367,0.000314409,0.6737936,0.02136647,0.03162397,0.0015506401,0.26772347],"study_design_scores_gemma":[0.0000117869495,0.000054872326,0.00012568933,0.0000081570315,0.000007200285,0.00005168246,0.000023893408,0.98979735,0.0024150736,0.006530472,0.0009659446,0.000007887142],"about_ca_topic_score_codex":0.0016483394,"about_ca_topic_score_gemma":0.0022083363,"teacher_disagreement_score":0.0016483394,"about_ca_system_score_codex":0.0006349207,"about_ca_system_score_gemma":0.00078300474,"threshold_uncertainty_score":0.005230963},"labels":[],"label_agreement":null},{"id":"W2156398306","doi":"10.1002/net.21459","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Stack (abstract data type); Computer science; Constraint (computer-aided design); Algorithm; 2-opt; Branch and cut; Mathematical optimization; Mathematics; Integer programming; Artificial intelligence","score_opus":0.01037015660828235,"score_gpt":0.1923077332894443,"score_spread":0.18193757668116195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156398306","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.0681204,0.0010924562,0.91854346,0.00066836027,0.0001371296,0.00039796732,0.0004156766,0.00091942365,0.009705156],"genre_scores_gemma":[0.15721086,0.00051996595,0.83677155,0.00012390762,0.000074414624,0.00040487436,0.00094054267,0.00019220311,0.003761708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994443,0.00018597096,0.000027415394,0.00011468577,0.00011433173,0.000113213195],"domain_scores_gemma":[0.99888915,0.0007888373,0.000076307806,0.00004724775,0.00011327458,0.00008521913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011284256,0.0012745649,0.0016651794,0.0012718108,0.0011311215,0.0013859015,0.0016089473,0.0020470999,0.007487654],"category_scores_gemma":[0.0026536463,0.00083743106,0.000853244,0.0020315507,0.0005477559,0.0018427058,0.0010837358,0.0017582027,0.0009489363],"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.00033639293,0.00040021015,0.0006706331,0.00020900978,0.00009425807,0.00018692737,0.00012284322,0.7546445,0.0014532624,0.020040723,0.009705349,0.21213584],"study_design_scores_gemma":[0.00008119854,0.00007475126,0.000102942686,0.00001276611,0.000016270697,0.000036124533,0.00002671354,0.9882754,0.00040971796,0.0095845815,0.0013722152,0.0000073647843],"about_ca_topic_score_codex":0.00690271,"about_ca_topic_score_gemma":0.005449513,"teacher_disagreement_score":0.007487654,"about_ca_system_score_codex":0.0014106655,"about_ca_system_score_gemma":0.0019787098,"threshold_uncertainty_score":0.025048673},"labels":[],"label_agreement":null},{"id":"W2162838679","doi":"10.1002/net.21463","title":"Distributed tree comparison with nodes of limited memory","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Tree (set theory); Task (project management); Class (philosophy); Automaton; Binary logarithm; Enhanced Data Rates for GSM Evolution; Theoretical computer science; State (computer science); Discrete mathematics; Shared memory; Parallel computing; Combinatorics; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.015946542808643993,"score_gpt":0.23702053338625434,"score_spread":0.22107399057761035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162838679","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.5831999,0.0007441557,0.40833116,0.00053828966,0.00009350897,0.00014988819,0.00016590826,0.0012047755,0.0055723162],"genre_scores_gemma":[0.90019166,0.00009936787,0.096625485,0.0000610498,0.000042837808,0.00011420746,0.00012699966,0.00010832421,0.0026299648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99793977,0.000592632,0.00015224512,0.0005705926,0.00045539296,0.00028937982],"domain_scores_gemma":[0.98458856,0.009667278,0.0012636777,0.0028515833,0.0009778233,0.00065113604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515139,0.0005106255,0.0014164755,0.00070999545,0.0010500406,0.0021137975,0.0029318277,0.0012753378,0.0053317756],"category_scores_gemma":[0.011876881,0.00047336836,0.00060630793,0.0011485065,0.001187181,0.005672121,0.0021397837,0.001003361,0.00065623055],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004651527,0.00050174503,0.0051579,0.000556824,0.0001753485,0.00079345517,0.0008004474,0.6351975,0.0625192,0.09271314,0.0027946248,0.19413824],"study_design_scores_gemma":[0.00014042006,0.0004223066,0.0005222938,0.000021735112,0.000055566583,0.00013893865,0.00011195988,0.91042817,0.020854563,0.06527229,0.0020000576,0.00003164241],"about_ca_topic_score_codex":0.00095100765,"about_ca_topic_score_gemma":0.0009988729,"teacher_disagreement_score":0.0053317756,"about_ca_system_score_codex":0.0013360083,"about_ca_system_score_gemma":0.0009636314,"threshold_uncertainty_score":0.01783657},"labels":[],"label_agreement":null},{"id":"W2163513576","doi":"10.1002/net.21520","title":"A branch‐price‐and‐cut algorithm for the min‐max <i>k</i>‐vehicle windy rural postman problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Set (abstract data type); Branch and cut; Computer science; Mathematical optimization; Algorithm; Graph; Vehicle routing problem; Mathematics; Combinatorics; Integer programming; Routing (electronic design automation)","score_opus":0.007274112739817685,"score_gpt":0.21954171832004143,"score_spread":0.21226760558022376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163513576","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.03805892,0.00054904475,0.9496461,0.00049585366,0.0000812015,0.0003547811,0.00035496792,0.00046196475,0.009996989],"genre_scores_gemma":[0.18763426,0.00034858758,0.8046831,0.00013866623,0.00005964927,0.00047884765,0.0006971882,0.00018332837,0.0057762805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.00014213198,0.000017659964,0.00008294534,0.0000694564,0.000087639],"domain_scores_gemma":[0.9988921,0.00078210025,0.000091030764,0.000045076,0.00009921739,0.000090495734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042551,0.0011567936,0.0013834211,0.000902915,0.00080544176,0.0010831429,0.0015372772,0.0015245401,0.009351803],"category_scores_gemma":[0.0021706459,0.0006641403,0.000707646,0.001461039,0.00055747235,0.0013528476,0.0011147169,0.0015855922,0.0008811308],"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.000254314,0.00029020951,0.000733569,0.00022041642,0.000058609865,0.00016115264,0.000113309696,0.81887895,0.0013131263,0.02069612,0.009441944,0.14783831],"study_design_scores_gemma":[0.00006142507,0.00006203496,0.00010596138,0.000012514835,0.000010175362,0.00003818821,0.000029438557,0.98582065,0.00037951206,0.012003711,0.0014693775,0.000006943555],"about_ca_topic_score_codex":0.0057224436,"about_ca_topic_score_gemma":0.0058414782,"teacher_disagreement_score":0.009351803,"about_ca_system_score_codex":0.0010621172,"about_ca_system_score_gemma":0.0019030619,"threshold_uncertainty_score":0.03128487},"labels":[],"label_agreement":null},{"id":"W2164043220","doi":"10.1002/net.10023","title":"Efficient algorithms for centers and medians in interval and circular‐arc graphs","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan; Simon Fraser University","funders":"","keywords":"Interval graph; Combinatorics; Median; Mathematics; Interval (graph theory); Graph; Vertex (graph theory); Algorithm; Arc (geometry); Time complexity; Discrete mathematics; Line graph; Pathwidth; Geometry","score_opus":0.027632691525661546,"score_gpt":0.22102037075949504,"score_spread":0.1933876792338335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164043220","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.03037395,0.00045013684,0.96128947,0.00042176893,0.00006774231,0.00022237598,0.00061661634,0.00208853,0.0044693663],"genre_scores_gemma":[0.19854873,0.00042191645,0.7943477,0.000095802345,0.00008699077,0.0003731291,0.0015812032,0.00046985547,0.0040746336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.0005215991,0.00013877398,0.0005495483,0.0003904723,0.00031882222],"domain_scores_gemma":[0.9964574,0.0018397797,0.00057069917,0.00048967585,0.0004279642,0.00021452407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020826745,0.0016764532,0.0020850434,0.0025249477,0.0016261355,0.0036666044,0.003021162,0.0019892703,0.0093224365],"category_scores_gemma":[0.0077007245,0.0010874382,0.0013242005,0.003566684,0.0011536815,0.0061345617,0.0034599116,0.0017065924,0.0018866586],"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.00065452454,0.00026860085,0.0015962524,0.00034586346,0.00010490275,0.00011381592,0.00048624858,0.58231485,0.0017474008,0.13780427,0.01739333,0.25716993],"study_design_scores_gemma":[0.00014271589,0.00006870005,0.00023156304,0.000031801395,0.000024423563,0.000086469394,0.00021265313,0.8166921,0.0016989876,0.17555928,0.005226746,0.000024544746],"about_ca_topic_score_codex":0.005206712,"about_ca_topic_score_gemma":0.0056492807,"teacher_disagreement_score":0.0093224365,"about_ca_system_score_codex":0.0027790929,"about_ca_system_score_gemma":0.0023700115,"threshold_uncertainty_score":0.03118664},"labels":[],"label_agreement":null},{"id":"W2167459401","doi":"10.1002/net.10105","title":"The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Steiner tree problem; Spanning tree; Branch and cut; k-minimum spanning tree; Tabu search; Vertex (graph theory); Mathematics; Integer programming; Combinatorics; Kruskal's algorithm; Euclidean geometry; Heuristic; Algorithm; Graph; Mathematical optimization; Tree structure; K-ary tree; Binary tree","score_opus":0.007846760493643152,"score_gpt":0.2338371477629094,"score_spread":0.22599038726926624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167459401","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.011841389,0.0005074108,0.9808301,0.00028494943,0.000049311788,0.0000935694,0.00010112161,0.00016670863,0.0061254594],"genre_scores_gemma":[0.22253124,0.0009454387,0.7710676,0.00014250622,0.00010963531,0.0003437739,0.00057391135,0.00016708081,0.00411874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999276,0.0003113823,0.000022836846,0.00009419881,0.0002049288,0.000090638845],"domain_scores_gemma":[0.9992605,0.000476835,0.00006881964,0.00005423845,0.00010099146,0.000038530354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010090071,0.0008960795,0.0012392848,0.00080988166,0.00058774545,0.0014112997,0.001090056,0.0012255312,0.0045191552],"category_scores_gemma":[0.0030208244,0.00047012593,0.00077603373,0.0017683996,0.0008189178,0.0013923794,0.00094249885,0.0012722658,0.0005789682],"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.00005241888,0.00005136869,0.00022184025,0.00011292056,0.000028440703,0.000053027114,0.000052526415,0.8524824,0.0007760806,0.06494136,0.0042671026,0.076960474],"study_design_scores_gemma":[0.000014784903,0.000014188445,0.000046193723,0.000014242917,0.000005742565,0.000024796846,0.000012849941,0.9639839,0.00022047295,0.033992115,0.0016674502,0.0000033796807],"about_ca_topic_score_codex":0.004785267,"about_ca_topic_score_gemma":0.0038152407,"teacher_disagreement_score":0.004785267,"about_ca_system_score_codex":0.0010666201,"about_ca_system_score_gemma":0.0012409082,"threshold_uncertainty_score":0.015118122},"labels":[],"label_agreement":null},{"id":"W2169825170","doi":"10.1002/net.1012","title":"A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regent College","funders":"","keywords":"Maximum flow problem; Minimum cut; Algorithm; Closure (psychology); Mathematics; Context (archaeology); Minimum-cost flow problem; Flow (mathematics); Maximum cut; Time complexity; Flow network; Graph; Computer science; Combinatorics","score_opus":0.009186957762735095,"score_gpt":0.20309567310143778,"score_spread":0.1939087153387027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169825170","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.005900069,0.00012078778,0.9907698,0.00022815545,0.00005675919,0.00012183222,0.000084910935,0.00080390915,0.0019137985],"genre_scores_gemma":[0.047095004,0.000095409516,0.9501872,0.0000915527,0.000056429588,0.00015722902,0.00027730095,0.00017865893,0.0018612411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878556,0.0002593992,0.00009306206,0.00033172348,0.00038956647,0.00014067143],"domain_scores_gemma":[0.9984086,0.0007747045,0.0001365462,0.00027791367,0.00031945866,0.00008283113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449696,0.0009817933,0.0009278542,0.0014447812,0.0008736099,0.0014993015,0.0018929599,0.0015083762,0.0058803638],"category_scores_gemma":[0.005419032,0.0005444994,0.00115018,0.0011414515,0.0011081167,0.003836806,0.0016461061,0.0018020305,0.0012389566],"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.00035127596,0.00034208203,0.0011875334,0.0003504597,0.00007328628,0.00016648437,0.00032481397,0.12563057,0.010666336,0.13292311,0.015851142,0.71213293],"study_design_scores_gemma":[0.00022396451,0.00015828239,0.00040464144,0.000074257376,0.00003775122,0.00033347294,0.000082705425,0.7892478,0.011531114,0.17356968,0.024293287,0.000043112832],"about_ca_topic_score_codex":0.0022669197,"about_ca_topic_score_gemma":0.0023217516,"teacher_disagreement_score":0.0058803638,"about_ca_system_score_codex":0.0013646452,"about_ca_system_score_gemma":0.0022051453,"threshold_uncertainty_score":0.019671738},"labels":[],"label_agreement":null},{"id":"W2324935025","doi":"10.1142/9789812776730_0028","title":"STOCHASTIC UPPER BOUNDS FOR AGGREGATE NETWORK TRAFFIC WITH MODELING BASED ON FRACTIONAL STABLE NOISE","year":2002,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Adaptive Filtering Techniques","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":"University of Ottawa","funders":"","keywords":"Aggregate (composite); Noise (video); Upper and lower bounds; Computer science; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.016966547770931005,"score_gpt":0.2123403502374469,"score_spread":0.1953738024665159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324935025","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.025896078,0.0015932459,0.96572256,0.0007771336,0.00018186106,0.00003235209,0.00012966568,0.00033045883,0.005336782],"genre_scores_gemma":[0.9230312,0.0031565914,0.06646066,0.000446684,0.0007249947,0.00026431677,0.00039458237,0.00024948354,0.00527152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963456,0.0009980045,0.00014545182,0.0005117397,0.0013705139,0.0006287034],"domain_scores_gemma":[0.96748424,0.025348663,0.0018205032,0.0013271411,0.0033023485,0.0007170913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009097675,0.0031994404,0.0025438936,0.003852288,0.0018205937,0.0054104323,0.0026758271,0.0032730976,0.0031686258],"category_scores_gemma":[0.034995694,0.0012009168,0.001685919,0.0028147735,0.0034371093,0.005935946,0.003664431,0.0042562457,0.00046253254],"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.00013171256,0.00006480464,0.00044201923,0.00013183332,0.00006988299,0.00008171918,0.00012646528,0.8325654,0.0028861728,0.15089375,0.0010717519,0.011534352],"study_design_scores_gemma":[0.00000234383,0.000009695024,0.000070591785,0.000019388228,0.000012384478,0.000013171922,0.000008958833,0.9777549,0.0004909436,0.021393782,0.00021285306,0.000011084067],"about_ca_topic_score_codex":0.0053101396,"about_ca_topic_score_gemma":0.0044259634,"teacher_disagreement_score":0.009097675,"about_ca_system_score_codex":0.0048931125,"about_ca_system_score_gemma":0.0021603454,"threshold_uncertainty_score":0.048113704},"labels":[],"label_agreement":null},{"id":"W2503583255","doi":"10.1002/net.21697","title":"On the roots of the node reliability polynomial","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Robustness (evolution); Reliability (semiconductor); Mathematics; Graph; Polynomial; Discrete mathematics; Time complexity; Computer science; Combinatorics; Mathematical analysis","score_opus":0.02047053038089776,"score_gpt":0.2588936726890206,"score_spread":0.23842314230812284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503583255","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.24491727,0.002042159,0.72343135,0.002248516,0.00014726797,0.00005188109,0.0005155949,0.00025733246,0.026388643],"genre_scores_gemma":[0.9575593,0.0031052635,0.030562116,0.00019452814,0.00047500993,0.00011112255,0.00034745428,0.00021382615,0.0074315607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.00037863426,0.000029138931,0.00023086663,0.00028806337,0.00017670497],"domain_scores_gemma":[0.9825482,0.013927331,0.0012093853,0.00087802263,0.0009752407,0.00046196565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693792,0.0008126031,0.0009829464,0.0017257459,0.0005971,0.0013815811,0.0009049364,0.0007195896,0.0034720283],"category_scores_gemma":[0.023210645,0.0003553068,0.00057632575,0.0011836952,0.0036615753,0.0046407073,0.0018234217,0.0031124344,0.00083017396],"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.00009694912,0.000024078268,0.00094188505,0.000118424294,0.000017131953,0.00014223931,0.00032773247,0.06343544,0.0017227996,0.9180186,0.0023278354,0.012826866],"study_design_scores_gemma":[0.000018810404,0.000039846662,0.00068881206,0.000047910253,0.000013992469,0.00014279495,0.00010401173,0.20633318,0.0007471011,0.7890785,0.002753555,0.00003149585],"about_ca_topic_score_codex":0.0012294931,"about_ca_topic_score_gemma":0.0005501101,"teacher_disagreement_score":0.0034720283,"about_ca_system_score_codex":0.0012036638,"about_ca_system_score_gemma":0.00074829994,"threshold_uncertainty_score":0.0116150975},"labels":[],"label_agreement":null},{"id":"W2514737704","doi":"10.1002/net.21700","title":"The Rainbow Cycle Cover Problem","year":2016,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rainbow; Mathematics; Disjoint sets; Cover (algebra); Integer programming; Combinatorics; Graph; Computer science; Algorithm","score_opus":0.009872359546378906,"score_gpt":0.2553044581065949,"score_spread":0.245432098560216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514737704","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.093200356,0.0022338761,0.8464018,0.003345849,0.00037951724,0.00065873365,0.0029379576,0.00097536016,0.04986652],"genre_scores_gemma":[0.6018946,0.003605376,0.36298048,0.0008344783,0.00041799486,0.0006632047,0.004506688,0.00045581174,0.024641281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854773,0.00034629361,0.00006093669,0.00037791787,0.00034094628,0.00032617914],"domain_scores_gemma":[0.9986462,0.0007349529,0.00019349199,0.0001729674,0.000109698,0.00014283351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084677106,0.0015041914,0.0009773541,0.0009219544,0.0012214244,0.0019983097,0.0024493856,0.001914694,0.009919311],"category_scores_gemma":[0.0038782305,0.00057196134,0.0013590999,0.0020053783,0.0011403614,0.00449477,0.0023900783,0.0018575026,0.0008557526],"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.00026174582,0.0003305286,0.0015747786,0.0005873271,0.00019372323,0.0006673825,0.00028149603,0.4765333,0.0037288426,0.3876677,0.03412294,0.09405035],"study_design_scores_gemma":[0.00010278508,0.00015211047,0.00040259142,0.0000915018,0.00009544837,0.0005755318,0.000184801,0.5181438,0.002912097,0.43618366,0.041119397,0.00003631487],"about_ca_topic_score_codex":0.004000755,"about_ca_topic_score_gemma":0.0047702235,"teacher_disagreement_score":0.009919311,"about_ca_system_score_codex":0.0018522191,"about_ca_system_score_gemma":0.0021982393,"threshold_uncertainty_score":0.033183396},"labels":[],"label_agreement":null},{"id":"W2519829944","doi":"10.1002/net.20233","title":"Approximation bounds for Black Hole Search problems","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Node (physics); Computer science; Black hole (networking); Black box; Set (abstract data type); Time complexity; Process (computing); Task (project management); Approximation algorithm; Theoretical computer science; Algorithm; Computer network; Artificial intelligence; Physics","score_opus":0.04569803779833919,"score_gpt":0.2672764333897557,"score_spread":0.2215783955914165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519829944","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.14232229,0.009391626,0.768687,0.0122745875,0.00064404093,0.0005543108,0.0022080282,0.003897461,0.06002072],"genre_scores_gemma":[0.67675585,0.0035552566,0.2984015,0.0018185118,0.00065106706,0.0008072711,0.003403295,0.0012063106,0.013400939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529713,0.0014867436,0.00022410248,0.00084796274,0.0010189158,0.0011251153],"domain_scores_gemma":[0.978693,0.016679926,0.0009134464,0.0021403953,0.00075687945,0.00081644976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005030249,0.0029214018,0.0028270117,0.0017432352,0.002046162,0.0051978063,0.0042743324,0.002951806,0.012909384],"category_scores_gemma":[0.023036858,0.0008669325,0.002536654,0.0025325827,0.002547989,0.010395797,0.004122124,0.0058968524,0.0020244468],"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.002769681,0.00091149216,0.0046674474,0.0013409252,0.00042298072,0.00027625967,0.000891641,0.5960666,0.0037860607,0.24078816,0.036389597,0.11168915],"study_design_scores_gemma":[0.00018614264,0.00013345481,0.0005101138,0.00010569375,0.00011708429,0.00015962856,0.00017012106,0.7376651,0.0012204017,0.25387,0.005839984,0.000022297669],"about_ca_topic_score_codex":0.004371668,"about_ca_topic_score_gemma":0.0043143826,"teacher_disagreement_score":0.012909384,"about_ca_system_score_codex":0.00526238,"about_ca_system_score_gemma":0.0033058913,"threshold_uncertainty_score":0.043186188},"labels":[],"label_agreement":null},{"id":"W2603251541","doi":"10.1002/net.20332","title":"A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"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":"Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Heuristic; Set (abstract data type); Computer science; Diversification (marketing strategy); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.009967092434046134,"score_gpt":0.24213027695610406,"score_spread":0.23216318452205792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603251541","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.055927396,0.0007552603,0.93719923,0.00032536793,0.000055898385,0.00017449107,0.000086170185,0.00037025954,0.0051059625],"genre_scores_gemma":[0.36354306,0.00034022468,0.6305243,0.00009100266,0.000048135193,0.0005303119,0.0002742233,0.00008938885,0.0045593223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00017988464,0.0000136661265,0.000058837315,0.00007589481,0.00003978665],"domain_scores_gemma":[0.99945956,0.00037956025,0.0000477751,0.00002182921,0.00005426768,0.000037027672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955823,0.0005275292,0.0012864475,0.000811434,0.00050363096,0.00066521304,0.001217187,0.00086942833,0.002653736],"category_scores_gemma":[0.0018076814,0.00044123904,0.0004399895,0.0009612215,0.00046093093,0.0010830015,0.0007461175,0.00066361827,0.00032517037],"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.00021170676,0.00014774146,0.00045102602,0.00007103723,0.000044388722,0.000052648902,0.000073265706,0.8778724,0.0009377545,0.015503888,0.0026769405,0.10195711],"study_design_scores_gemma":[0.000038442562,0.0000332078,0.00004205184,0.0000037200462,0.000004808252,0.000009687506,0.0000063383277,0.997308,0.00014997672,0.001981919,0.0004191949,0.0000027261717],"about_ca_topic_score_codex":0.005556566,"about_ca_topic_score_gemma":0.0050350716,"teacher_disagreement_score":0.005556566,"about_ca_system_score_codex":0.00084777863,"about_ca_system_score_gemma":0.0012432194,"threshold_uncertainty_score":0.011048436},"labels":[],"label_agreement":null},{"id":"W2611167225","doi":"10.1002/net.21810","title":"Deterministic gathering with crash faults","year":2018,"lang":"en","type":"preprint","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Traverse; Computer science; Node (physics); Crash; Asynchrony (computer programming); Fault (geology); Enhanced Data Rates for GSM Evolution; Real-time computing; Distributed computing; Computer network; Computer security; Artificial intelligence; Engineering; Asynchronous communication","score_opus":0.018497622520054307,"score_gpt":0.2539627596083782,"score_spread":0.23546513708832392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611167225","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.26799327,0.0011828009,0.71725327,0.00173164,0.0001315321,0.00016453808,0.0006155759,0.00037729382,0.010550119],"genre_scores_gemma":[0.94775397,0.00050584064,0.04368841,0.00016673587,0.000077759316,0.00023096126,0.0004732284,0.00008265068,0.007020485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882835,0.00044750498,0.000058514375,0.00028552258,0.00012839599,0.00025181522],"domain_scores_gemma":[0.9936871,0.00407673,0.0010085044,0.00043910474,0.0004030251,0.0003855394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015081313,0.0009189607,0.0010603939,0.0005248029,0.0008614874,0.0011037403,0.0013267739,0.0018234624,0.0029155891],"category_scores_gemma":[0.00956158,0.0006272759,0.0007953001,0.0006142298,0.0012565677,0.0018425462,0.0016418166,0.0011127976,0.000340038],"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.00021013372,0.00004084392,0.0012597862,0.00013627225,0.00004975174,0.00020113631,0.00011904335,0.9532893,0.00079541584,0.033391356,0.0017458694,0.008761088],"study_design_scores_gemma":[0.00004504276,0.00006232706,0.0003714926,0.000013861986,0.000017653725,0.00005455869,0.00007497937,0.96190083,0.00048076623,0.035949886,0.001017273,0.000011341868],"about_ca_topic_score_codex":0.0042795087,"about_ca_topic_score_gemma":0.0023796798,"teacher_disagreement_score":0.0042795087,"about_ca_system_score_codex":0.0014350361,"about_ca_system_score_gemma":0.00072890293,"threshold_uncertainty_score":0.010411978},"labels":[],"label_agreement":null},{"id":"W2626724472","doi":"10.1002/net.21750","title":"Minimizing the makespan in multiserver network restoration problems","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"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":"Server; Computer science; Node (physics); Enhanced Data Rates for GSM Evolution; Computer network; Time complexity; Point (geometry); Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Engineering","score_opus":0.01925238439715593,"score_gpt":0.23652738013302543,"score_spread":0.2172749957358695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626724472","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.32455325,0.0042028367,0.64770365,0.0026955532,0.00051576353,0.00079695147,0.0014550908,0.0014899384,0.016587026],"genre_scores_gemma":[0.8189757,0.0018058679,0.16811003,0.00037887937,0.00030101987,0.00060412847,0.001193261,0.0006258669,0.008005184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838674,0.0005133206,0.00006796027,0.00033891623,0.00020689082,0.00048622105],"domain_scores_gemma":[0.9969632,0.0020707494,0.0002960921,0.0001718915,0.00016370325,0.000334441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026606,0.0023115594,0.0024480668,0.0010472883,0.0013449711,0.0022422236,0.0027999962,0.0019683477,0.003813851],"category_scores_gemma":[0.0052751075,0.0011099286,0.001201267,0.0019000139,0.001192434,0.002686194,0.0015119641,0.0017751355,0.00051418657],"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.00028926856,0.00011966162,0.0003999325,0.0003646664,0.00009001773,0.00017507434,0.000102717335,0.966694,0.0017672239,0.008607733,0.0028799672,0.018509759],"study_design_scores_gemma":[0.00005162792,0.00013882996,0.0003043003,0.000029684084,0.000035991845,0.00009546567,0.0001000031,0.97134733,0.0010064815,0.02564598,0.0012304913,0.0000138492405],"about_ca_topic_score_codex":0.0044930363,"about_ca_topic_score_gemma":0.0035533516,"teacher_disagreement_score":0.0044930363,"about_ca_system_score_codex":0.002392671,"about_ca_system_score_gemma":0.0019392004,"threshold_uncertainty_score":0.017360091},"labels":[],"label_agreement":null},{"id":"W2679747200","doi":"10.1002/net.21747","title":"Adaptive large neighborhood search algorithm for the rural postman problem with time windows","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"New Jersey Department of Transportation","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Algorithm; Running time; Vehicle routing problem; Mathematics; Routing (electronic design automation)","score_opus":0.013644993020114597,"score_gpt":0.2563775742917052,"score_spread":0.24273258127159061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2679747200","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.049996577,0.0007176519,0.94145155,0.00029995112,0.00007004885,0.00017962852,0.000091687536,0.00029155888,0.006901275],"genre_scores_gemma":[0.45805076,0.00035846524,0.53347415,0.00018721995,0.0000663566,0.0004787358,0.00033742393,0.00012380254,0.006923133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.00018774021,0.00001689127,0.00009047045,0.00010365556,0.00006396921],"domain_scores_gemma":[0.9991503,0.0005807759,0.00008721851,0.000032024815,0.00009530738,0.00005445184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784323,0.0007026832,0.0012941277,0.0006697126,0.0006212208,0.00057579455,0.0015755676,0.0010330155,0.0029234625],"category_scores_gemma":[0.0020894452,0.00036046407,0.00054371863,0.00091019005,0.000452387,0.0009490878,0.0008495633,0.0009047165,0.0003549796],"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.00018414514,0.00016248411,0.00062014535,0.00007723293,0.00005620556,0.000072675706,0.00005924065,0.9153376,0.0009006606,0.017020494,0.0033513024,0.062157836],"study_design_scores_gemma":[0.000025816622,0.000038488157,0.00005529872,0.0000031248676,0.0000050880226,0.000014536578,0.0000093639665,0.9969722,0.0001154391,0.0022108173,0.000547045,0.0000028639295],"about_ca_topic_score_codex":0.0077917087,"about_ca_topic_score_gemma":0.00875541,"teacher_disagreement_score":0.0077917087,"about_ca_system_score_codex":0.0007772882,"about_ca_system_score_gemma":0.0016302841,"threshold_uncertainty_score":0.015492678},"labels":[],"label_agreement":null},{"id":"W2748787255","doi":"10.1002/net.21759","title":"Solving the large‐scale min–max K‐rural postman problem for snow plowing","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc routing; Computer science; Solver; Mathematical optimization; Arc (geometry); Vehicle routing problem; Travelling salesman problem; Variable (mathematics); Deck; Graph; Transformation (genetics); Heuristics; Enhanced Data Rates for GSM Evolution; Routing (electronic design automation); Mathematics; Algorithm; Theoretical computer science; Computer network; Artificial intelligence; Engineering","score_opus":0.01386496700881961,"score_gpt":0.2647827661948654,"score_spread":0.2509177991860458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748787255","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.15142103,0.00049009407,0.840859,0.00043292186,0.000065079104,0.00017232566,0.00022409477,0.0003016619,0.0060337447],"genre_scores_gemma":[0.5932454,0.00030392918,0.39856473,0.00012002149,0.000046110647,0.00026751074,0.00039165205,0.00020946297,0.0068512144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997073,0.00012560967,0.000010957912,0.00006926354,0.000030263729,0.000056561665],"domain_scores_gemma":[0.9992805,0.00052332465,0.00008491318,0.000030543102,0.000037879057,0.00004276533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010008204,0.001266234,0.0010674609,0.00047547187,0.0007938709,0.0006978219,0.0012261723,0.0012487462,0.0049034697],"category_scores_gemma":[0.0016024054,0.00056179106,0.00084552856,0.0008431146,0.0006801358,0.001346699,0.00080606865,0.00072552933,0.0002927478],"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.00006305151,0.000047255664,0.0004769213,0.000093629504,0.00003077596,0.00006884136,0.000045820805,0.97933024,0.000625872,0.0042497236,0.00071010116,0.014257719],"study_design_scores_gemma":[0.00001935439,0.000046049932,0.00015366291,0.0000057073376,0.000009429338,0.000020976919,0.000059691385,0.99345195,0.00040117896,0.0051082755,0.0007184811,0.0000052165906],"about_ca_topic_score_codex":0.008183206,"about_ca_topic_score_gemma":0.010158605,"teacher_disagreement_score":0.008183206,"about_ca_system_score_codex":0.00092000235,"about_ca_system_score_gemma":0.0013785214,"threshold_uncertainty_score":0.016403735},"labels":[],"label_agreement":null},{"id":"W2749062520","doi":"10.1002/net.20192","title":"A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Consiglio Nazionale delle Ricerche; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Tabu search; Heuristics; Mathematical optimization; Computer science; Minification; Heuristic; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.014262556199855739,"score_gpt":0.2389436817591051,"score_spread":0.22468112555924935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749062520","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.13520901,0.0016888011,0.8395484,0.0006334932,0.00016274974,0.0005401283,0.0005744358,0.0021519477,0.01949097],"genre_scores_gemma":[0.42623618,0.00056415104,0.5664696,0.00025980908,0.000050440434,0.0007702634,0.00072343706,0.00029436097,0.004631804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.00043459708,0.000017078344,0.00005407384,0.00007883214,0.00010646741],"domain_scores_gemma":[0.99834394,0.0012256865,0.00012543933,0.00008275653,0.00014955674,0.000072527706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013157385,0.00090784155,0.0012376945,0.0016025673,0.0009766765,0.0014844949,0.0015034067,0.0014831729,0.0077281888],"category_scores_gemma":[0.0034340709,0.0007042241,0.0005880769,0.0022249583,0.0009781725,0.001080537,0.0007515802,0.0007635786,0.0010942364],"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.00008880216,0.000093098664,0.00030828675,0.00006181855,0.00002616831,0.000053825286,0.0000526425,0.95110875,0.00042193275,0.0066194055,0.0025985404,0.038566794],"study_design_scores_gemma":[0.000042262796,0.000035440058,0.0000692939,0.00001295742,0.000008015867,0.000014243203,0.000024930581,0.9961826,0.00018636465,0.002649646,0.00076826685,0.0000059250233],"about_ca_topic_score_codex":0.009768316,"about_ca_topic_score_gemma":0.007756586,"teacher_disagreement_score":0.009768316,"about_ca_system_score_codex":0.0015544416,"about_ca_system_score_gemma":0.0021172473,"threshold_uncertainty_score":0.025853395},"labels":[],"label_agreement":null},{"id":"W2770845104","doi":"10.1002/net.21792","title":"Open shortest path first routing under random early detection","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Open Shortest Path First; Path vector protocol; Shortest path problem; Equal-cost multi-path routing; Static routing; Private Network-to-Network Interface; Routing (electronic design automation); Constrained Shortest Path First; Link-state routing protocol; Computer network; Routing Information Protocol; Routing protocol; Mathematical optimization; Distributed computing; K shortest path routing; Mathematics; Theoretical computer science; Graph","score_opus":0.01773501321753399,"score_gpt":0.24342181495283888,"score_spread":0.2256868017353049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770845104","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.047921825,0.00019909583,0.94808066,0.00023647293,0.00008103548,0.00010816551,0.00010849694,0.00040893516,0.0028553952],"genre_scores_gemma":[0.6975444,0.0002282501,0.29711184,0.00015308706,0.00006896333,0.00019265637,0.00020075437,0.00012949876,0.0043706424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813277,0.00063381944,0.0000708533,0.00036679677,0.00042887533,0.0003670109],"domain_scores_gemma":[0.9962858,0.002144508,0.0005174178,0.00039720902,0.00048502808,0.00017000256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029763777,0.0010661631,0.0012278114,0.0007317704,0.00081324717,0.0014018454,0.0019369638,0.00089925196,0.0013832907],"category_scores_gemma":[0.00705061,0.0005060534,0.00075990625,0.00080307474,0.0011096954,0.0027181196,0.0012826127,0.0014510432,0.00016043012],"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.00009709183,0.00008602098,0.0003638394,0.00004559773,0.000029952273,0.000086448126,0.000051750172,0.93390936,0.0014074689,0.0434639,0.000964537,0.019494042],"study_design_scores_gemma":[0.000020298541,0.000049302012,0.000059286445,0.00000363134,0.000010390781,0.000023986739,0.000009987914,0.975966,0.00078913994,0.022492912,0.00056621694,0.000008865882],"about_ca_topic_score_codex":0.0037577425,"about_ca_topic_score_gemma":0.0039801938,"teacher_disagreement_score":0.0037577425,"about_ca_system_score_codex":0.0018135468,"about_ca_system_score_gemma":0.0027760721,"threshold_uncertainty_score":0.015740752},"labels":[],"label_agreement":null},{"id":"W2808356940","doi":"10.1002/net.21928","title":"Minimum shared‐power edge cut","year":2020,"lang":"en","type":"preprint","venue":"Networks","topic":"Mobile Ad Hoc Networks","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 Saskatchewan; University of Waterloo; Collège Boréal","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Rectangle; Combinatorics; Time complexity; Mathematics; Unit disk graph; Undirected graph; Polynomial-time approximation scheme; Enhanced Data Rates for GSM Evolution; Bounded function; Dominating set; Matching (statistics); Approximation algorithm; Graph; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Wireless network; Wireless; Geometry; Vertex (graph theory)","score_opus":0.022143382076043324,"score_gpt":0.2493531432810017,"score_spread":0.22720976120495837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808356940","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.15192671,0.00080209714,0.8293485,0.0016313016,0.00018786006,0.00029340066,0.0012248573,0.0005513038,0.014033994],"genre_scores_gemma":[0.7010105,0.00039179545,0.28730354,0.00031379974,0.00012809539,0.0002679095,0.0018207213,0.00024281355,0.008520835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998643,0.0003570351,0.00007588352,0.00034305357,0.00035292332,0.00022811837],"domain_scores_gemma":[0.99750644,0.0014378316,0.00019732362,0.00033972846,0.00029818146,0.00022054836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090962386,0.0009204075,0.0012355967,0.0006997581,0.000795008,0.0016739044,0.002125051,0.0015550642,0.007876982],"category_scores_gemma":[0.004143878,0.00047219187,0.00077291485,0.0013876891,0.00091452344,0.0030942687,0.0018358032,0.0013785214,0.00053120527],"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.0007615201,0.00038110022,0.0026831685,0.00069310213,0.00023761422,0.00067703676,0.00031239667,0.64437026,0.009358731,0.14272928,0.021794697,0.17600112],"study_design_scores_gemma":[0.00010183753,0.00014221085,0.00069335505,0.000052231295,0.000048064892,0.00045908714,0.00019445593,0.7698555,0.0052476875,0.21339886,0.009786395,0.000020274467],"about_ca_topic_score_codex":0.0010471311,"about_ca_topic_score_gemma":0.0010427162,"teacher_disagreement_score":0.007876982,"about_ca_system_score_codex":0.00080433075,"about_ca_system_score_gemma":0.00074254075,"threshold_uncertainty_score":0.026351154},"labels":[],"label_agreement":null},{"id":"W2808768722","doi":"10.1002/net.21826","title":"Integer programming formulations for minimum deficiency interval coloring","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Edge coloring; Interval graph; Fractional coloring; Integer programming; Greedy coloring; Vertex (graph theory); Graph; Line graph; Pathwidth; Graph power; Algorithm","score_opus":0.025214227599909756,"score_gpt":0.2909210732592273,"score_spread":0.2657068456593175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808768722","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.008373642,0.0003792962,0.98316735,0.00037376705,0.000049175116,0.00008770276,0.00026154335,0.00006295031,0.0072445],"genre_scores_gemma":[0.28584477,0.0013360672,0.70281935,0.0003145178,0.00018746172,0.0007978318,0.0007408851,0.0001725852,0.0077865548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886334,0.000483792,0.000053709573,0.00018064596,0.0002824893,0.00013604696],"domain_scores_gemma":[0.99598855,0.003101811,0.00029219728,0.00014672297,0.00037004045,0.000100623634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026335632,0.0015997917,0.0011436729,0.00095858215,0.00049395656,0.0020568303,0.00163052,0.0013566194,0.004246611],"category_scores_gemma":[0.008590885,0.00079176424,0.0010465757,0.0016841767,0.0011041383,0.0021192783,0.0010469008,0.0029416152,0.0005066712],"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.0000429565,0.00008698738,0.0003642983,0.00013570342,0.000018403683,0.00008148587,0.00010683214,0.83875203,0.000599328,0.1407152,0.0023820158,0.01671476],"study_design_scores_gemma":[0.000013978621,0.00002228135,0.00006596931,0.000021192871,0.0000061519927,0.000022664759,0.00003180814,0.9451454,0.00018718981,0.05318689,0.0012904954,0.0000059501617],"about_ca_topic_score_codex":0.0030808481,"about_ca_topic_score_gemma":0.0030609958,"teacher_disagreement_score":0.004246611,"about_ca_system_score_codex":0.0020541893,"about_ca_system_score_gemma":0.0016885125,"threshold_uncertainty_score":0.014904201},"labels":[],"label_agreement":null},{"id":"W2809160987","doi":"10.1002/net.21827","title":"A two‐phase Pareto local search heuristic for the bi‐objective pollution‐routing problem","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Pareto principle; Heuristic; Mathematical optimization; Routing (electronic design automation); Pollution; Phase (matter); Pareto optimal; Computer science; Multi-objective optimization; Mathematics; Chemistry; Ecology; Biology","score_opus":0.022229289596827535,"score_gpt":0.31266925528611006,"score_spread":0.29043996568928254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809160987","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.023102386,0.0003580789,0.97021693,0.00014002238,0.000052225685,0.0001794451,0.000055625824,0.00027573138,0.005619636],"genre_scores_gemma":[0.38535705,0.0004120466,0.6060351,0.00027461495,0.000058322625,0.00094485626,0.00032089883,0.00019235852,0.0064047547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995285,0.00021340683,0.00001809528,0.000050319966,0.00012392087,0.000065790904],"domain_scores_gemma":[0.99940014,0.0003889621,0.000049245155,0.00002917498,0.00009110789,0.000041421743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012494362,0.0011863128,0.0011425877,0.0012678324,0.0005227657,0.0007606351,0.0013986236,0.0015134476,0.0034171524],"category_scores_gemma":[0.0016323676,0.00057500286,0.0008946626,0.0009656846,0.0006565902,0.00084595685,0.0011123959,0.0010402665,0.0005145712],"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.00007290499,0.000117553514,0.00015082861,0.00009509955,0.000029075787,0.000059205187,0.000039336086,0.9548991,0.0011712405,0.005830081,0.0010680051,0.03646755],"study_design_scores_gemma":[0.000035012174,0.00006125403,0.0000476564,0.000009237654,0.000008385741,0.000012604516,0.0000130717945,0.99746895,0.00029922562,0.0015447102,0.0004939769,0.0000059590757],"about_ca_topic_score_codex":0.0030039772,"about_ca_topic_score_gemma":0.0034904843,"teacher_disagreement_score":0.0034171524,"about_ca_system_score_codex":0.0008113138,"about_ca_system_score_gemma":0.001735683,"threshold_uncertainty_score":0.011431575},"labels":[],"label_agreement":null},{"id":"W2911859454","doi":"10.1002/net.21975","title":"The firebreak problem","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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 New Brunswick; Memorial University of Newfoundland","funders":"Biotechnology and Biological Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Vertex (graph theory); Time complexity; Focus (optics); Class (philosophy); Graph; Metric dimension","score_opus":0.018747197674953257,"score_gpt":0.256820096351612,"score_spread":0.23807289867665876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911859454","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.50162244,0.0029393255,0.40826422,0.01752081,0.0005980863,0.0009409116,0.0053629144,0.0010871254,0.06166409],"genre_scores_gemma":[0.8701725,0.0015762865,0.10133872,0.0015055037,0.00037991581,0.00038505625,0.0052757612,0.00035083867,0.01901552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976815,0.00071128935,0.0001120949,0.0007107299,0.00030227375,0.0004819498],"domain_scores_gemma":[0.9891924,0.007492366,0.00090856315,0.00089878205,0.0005284597,0.0009793985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002105615,0.0008044304,0.0015768694,0.0008256791,0.0032641445,0.0037822204,0.0031714055,0.0039018276,0.020897636],"category_scores_gemma":[0.013384408,0.000965737,0.0013058851,0.001443758,0.0027480442,0.011949568,0.0036731095,0.0051941876,0.001638438],"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.002315258,0.000926169,0.0074218446,0.0012704099,0.00037140166,0.0014573823,0.0016140448,0.18762866,0.008048488,0.5684647,0.06516097,0.15532067],"study_design_scores_gemma":[0.00027721887,0.00017070083,0.0009889781,0.0001240386,0.000103531245,0.00070642756,0.0016135034,0.19516662,0.004599507,0.76869553,0.027511181,0.00004287915],"about_ca_topic_score_codex":0.0025580928,"about_ca_topic_score_gemma":0.0018858325,"teacher_disagreement_score":0.020897636,"about_ca_system_score_codex":0.001745486,"about_ca_system_score_gemma":0.0014120055,"threshold_uncertainty_score":0.06990951},"labels":[],"label_agreement":null},{"id":"W2913349045","doi":"10.1002/net.21873","title":"The Firefighter problem: Saving sets of vertices on cubic graphs","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"","keywords":"Combinatorics; Vertex (graph theory); Degree (music); Graph; Mathematics; Context (archaeology); Computer science; Independent set; Set (abstract data type); Discrete mathematics; Physics; Geography","score_opus":0.012337062270861938,"score_gpt":0.2658854493953632,"score_spread":0.25354838712450123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913349045","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.705385,0.00082973676,0.23849097,0.005556429,0.00023387681,0.00056301,0.005943382,0.0012727121,0.041724894],"genre_scores_gemma":[0.88143474,0.0005685119,0.09638957,0.00051472127,0.00007979761,0.00020154678,0.0033173421,0.00026787992,0.017225908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991322,0.00019051527,0.000035075107,0.00016894484,0.00016184789,0.0003114343],"domain_scores_gemma":[0.9969643,0.0019477678,0.00023232913,0.00037321835,0.00014962906,0.0003327733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942322,0.0006927176,0.001089316,0.0005146791,0.001254196,0.001433513,0.0022792318,0.001399251,0.011132733],"category_scores_gemma":[0.004045775,0.0004187448,0.0010669393,0.0010755884,0.0011287191,0.0029637136,0.001990848,0.0021786077,0.00057587714],"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.0008481967,0.00044691542,0.0014528057,0.00048703686,0.00007519987,0.0003917566,0.00033736747,0.81454587,0.005388719,0.0952345,0.023789508,0.057002164],"study_design_scores_gemma":[0.00022718843,0.00015848591,0.0007278063,0.00005892199,0.000040352228,0.0002245275,0.00039013827,0.76882935,0.0048001194,0.21334502,0.011165625,0.000032483877],"about_ca_topic_score_codex":0.012936555,"about_ca_topic_score_gemma":0.0163629,"teacher_disagreement_score":0.012936555,"about_ca_system_score_codex":0.0018444029,"about_ca_system_score_gemma":0.0020219898,"threshold_uncertainty_score":0.03724277},"labels":[],"label_agreement":null},{"id":"W2916653839","doi":"10.1002/net.21925","title":"Primal column generation framework for vehicle and crew scheduling problems","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew scheduling; Column generation; Scheduling (production processes); Crew; Column (typography); Computer science; Operations research; Aeronautics; Engineering; Operations management; Mathematics; Mathematical optimization","score_opus":0.03948768764023189,"score_gpt":0.26363793227351073,"score_spread":0.22415024463327884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916653839","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.0055320077,0.00022356349,0.9907279,0.0001000496,0.0000332256,0.000052915355,0.00007498115,0.00020978326,0.0030456595],"genre_scores_gemma":[0.28437066,0.00052552344,0.70879066,0.00015549621,0.00009004306,0.00039537853,0.00042759138,0.00019636458,0.0050482834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994479,0.0002777247,0.00001470947,0.000057407302,0.00013907367,0.00006325743],"domain_scores_gemma":[0.99923515,0.0004498773,0.0000612943,0.000060764658,0.000149665,0.00004329851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011423635,0.00088149525,0.0008453699,0.00085794076,0.00046292492,0.00092103204,0.000986106,0.0007517368,0.005080483],"category_scores_gemma":[0.0015007707,0.0005990292,0.0005891012,0.0010483793,0.00068688067,0.00069012865,0.0009755953,0.0012959588,0.0006457006],"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.000037737726,0.000046662266,0.00015515332,0.00007528872,0.000014311364,0.00004708003,0.000031513973,0.9392505,0.0011007156,0.023912558,0.0015400407,0.033788506],"study_design_scores_gemma":[0.0000074855284,0.000011529442,0.000020076244,0.0000042004986,0.0000020853395,0.000008423593,0.0000045646884,0.9945475,0.00026996646,0.00432547,0.0007962458,0.0000024620774],"about_ca_topic_score_codex":0.0042621368,"about_ca_topic_score_gemma":0.0037951006,"teacher_disagreement_score":0.005080483,"about_ca_system_score_codex":0.00081185316,"about_ca_system_score_gemma":0.0013379131,"threshold_uncertainty_score":0.016995907},"labels":[],"label_agreement":null},{"id":"W2951116686","doi":"10.1002/net.21892","title":"Monotonicity and conformality in multicommodity network‐flow problems","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"General Motors Foundation","keywords":"Monotonic function; Convexity; Multi-commodity flow problem; Mathematics; Flow network; Mathematical optimization; Graph; Regular polygon; Flow (mathematics); Directed graph; Computation; Convex function; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.007329042674740536,"score_gpt":0.18980885818341406,"score_spread":0.1824798155086735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951116686","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.17206869,0.001242644,0.7945089,0.0020200135,0.00007601476,0.00018691097,0.0001899455,0.00010070175,0.029606262],"genre_scores_gemma":[0.90634936,0.0008903522,0.08894576,0.00016648705,0.00015388771,0.00016274923,0.00015581115,0.00006200932,0.0031135143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814487,0.00095050037,0.00007224336,0.0002209481,0.00042929195,0.0001821775],"domain_scores_gemma":[0.99138343,0.0065048593,0.0006337417,0.00034994504,0.00084591575,0.0002820971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003234733,0.0005923496,0.0008135693,0.001041831,0.00091515674,0.0012949477,0.0010113337,0.0008550745,0.002625677],"category_scores_gemma":[0.014225282,0.0004908426,0.00091763784,0.00075933,0.0022845806,0.003406047,0.0015387059,0.0019633388,0.00023560709],"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.000060546303,0.00010814854,0.003687844,0.00018363154,0.000035648063,0.0002745136,0.00021163755,0.27833763,0.0027234408,0.67271537,0.002042642,0.039618958],"study_design_scores_gemma":[0.000014739385,0.000054489483,0.00090412813,0.000036332873,0.0000072374364,0.00015525245,0.000076280354,0.6951079,0.0011080108,0.30009747,0.0024224075,0.000015795958],"about_ca_topic_score_codex":0.0020078018,"about_ca_topic_score_gemma":0.0015291361,"teacher_disagreement_score":0.003234733,"about_ca_system_score_codex":0.0015080924,"about_ca_system_score_gemma":0.0010462302,"threshold_uncertainty_score":0.01710707},"labels":[],"label_agreement":null},{"id":"W2951951756","doi":"10.1002/net.20074","title":"An approximation algorithm for Stackelberg network pricing","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Toll; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Approximation algorithm; Computer science; Constraint (computer-aided design); Flow network; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Linear programming; Mathematical economics","score_opus":0.01407393180372267,"score_gpt":0.29096143431612065,"score_spread":0.27688750251239796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951951756","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.070614204,0.00057709054,0.90762955,0.0012227643,0.00015772859,0.00026556494,0.00046426302,0.0021630425,0.016905757],"genre_scores_gemma":[0.48198825,0.00043035066,0.50815207,0.00029875792,0.00009909797,0.00031921148,0.0010947245,0.00022194372,0.007395553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998743,0.00035482942,0.000053739168,0.00022500815,0.0003011404,0.00032237815],"domain_scores_gemma":[0.9989422,0.00059638824,0.000071482864,0.00016751385,0.00012980415,0.00009265068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730634,0.0011712996,0.001725883,0.0010737097,0.00084070547,0.0024174086,0.0026629483,0.001941888,0.00844108],"category_scores_gemma":[0.004726711,0.000591989,0.001137417,0.0021759898,0.0008290357,0.0035887074,0.0014742019,0.0019214508,0.0013145136],"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.0005144628,0.0004649358,0.001010159,0.00016305051,0.00011688757,0.000112127884,0.00020292371,0.71992445,0.0018462959,0.09408333,0.011928401,0.16963303],"study_design_scores_gemma":[0.00006806335,0.00003315024,0.000052028452,0.000006576621,0.000013691099,0.00002689929,0.000023195847,0.95670176,0.0003570372,0.04166642,0.0010452607,0.000005920034],"about_ca_topic_score_codex":0.008245841,"about_ca_topic_score_gemma":0.007583594,"teacher_disagreement_score":0.00844108,"about_ca_system_score_codex":0.002964834,"about_ca_system_score_gemma":0.0036647234,"threshold_uncertainty_score":0.028238237},"labels":[],"label_agreement":null},{"id":"W2965180164","doi":"10.1002/net.22068","title":"Constraint programming approaches for the discretizable molecular distance geometry problem","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Discretization; Integer programming; Vertex (graph theory); Constraint satisfaction problem; Computational geometry; Domain (mathematical analysis); Constraint (computer-aided design); Set (abstract data type)","score_opus":0.06243605348160239,"score_gpt":0.3252412656153425,"score_spread":0.2628052121337401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965180164","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.012110678,0.0005635177,0.97670186,0.0008681507,0.00006956593,0.00015814774,0.00062415295,0.00012677413,0.008777177],"genre_scores_gemma":[0.21242459,0.0012869508,0.7799588,0.00038375167,0.00011971512,0.0006087633,0.000998318,0.00015873204,0.0040603853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831057,0.0007453701,0.00007134969,0.00025279121,0.00048248787,0.0001374305],"domain_scores_gemma":[0.9936718,0.005137011,0.00036287648,0.00032623333,0.00036780667,0.00013435377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020833504,0.0012525271,0.001067469,0.0009477721,0.00071043975,0.0020953156,0.0019184466,0.0015233954,0.0071483506],"category_scores_gemma":[0.008055028,0.00073516497,0.0010783277,0.0025690822,0.0017920152,0.002276215,0.0013872611,0.003647789,0.00055706577],"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.000024997007,0.00004091613,0.00015801081,0.00009349553,0.000018642946,0.00007213876,0.00003948993,0.8832367,0.0003608056,0.10037205,0.0016923342,0.013890419],"study_design_scores_gemma":[0.000019727759,0.000014055349,0.00003785897,0.00001894114,0.000004970389,0.000024910698,0.000026377167,0.9296744,0.00021074373,0.06749413,0.0024680686,0.0000058716882],"about_ca_topic_score_codex":0.008187891,"about_ca_topic_score_gemma":0.008281672,"teacher_disagreement_score":0.008187891,"about_ca_system_score_codex":0.00211242,"about_ca_system_score_gemma":0.0020088675,"threshold_uncertainty_score":0.023913622},"labels":[],"label_agreement":null},{"id":"W2981501323","doi":"10.1002/net.21916","title":"A strong formulation for the graph partition problem","year":2019,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Mathematics; Graph; Partition (number theory); Graph partition; Polynomial; Arc (geometry); Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.021722439373429485,"score_gpt":0.28571800753224563,"score_spread":0.26399556815881614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981501323","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.01657872,0.00020863258,0.96912307,0.0010377967,0.000103978644,0.00016943764,0.0003613749,0.00018273148,0.012234259],"genre_scores_gemma":[0.36325932,0.0007307023,0.6160591,0.000931263,0.0004440619,0.00062970055,0.0013681664,0.00028726694,0.016290348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758434,0.000975624,0.00010703005,0.00048671674,0.0005619811,0.00028420967],"domain_scores_gemma":[0.9960873,0.0024132775,0.0002736862,0.0005646496,0.00048332015,0.00017780269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022142807,0.0012316885,0.00084711035,0.0007066359,0.00072701945,0.0021984305,0.0023772607,0.0012558427,0.012686451],"category_scores_gemma":[0.005790084,0.0007352652,0.0011074229,0.0011542696,0.0016019302,0.00550461,0.0029807945,0.0048044715,0.0011463113],"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.00023563461,0.00018943111,0.00029222463,0.00032524473,0.00004943057,0.00020709402,0.00019838658,0.20645435,0.0052832,0.7174488,0.012044235,0.057271976],"study_design_scores_gemma":[0.00010463818,0.00015134303,0.00023938903,0.000057496938,0.00003659293,0.00017299567,0.0001425482,0.5620131,0.00239408,0.41852725,0.016137512,0.000023144687],"about_ca_topic_score_codex":0.0016847661,"about_ca_topic_score_gemma":0.0027425352,"teacher_disagreement_score":0.012686451,"about_ca_system_score_codex":0.0016310316,"about_ca_system_score_gemma":0.0015890473,"threshold_uncertainty_score":0.042440414},"labels":[],"label_agreement":null},{"id":"W3008084469","doi":"10.1002/net.21934","title":"Dual‐failure restorability analysis of span‐restorable meta‐mesh networks","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"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":"Computer science; Spare part; Span (engineering); Traverse; Maximization; Dual (grammatical number); Mesh networking; Mathematical optimization; Mathematics; Structural engineering; Operations management; Engineering","score_opus":0.0225329069802534,"score_gpt":0.2277012994942235,"score_spread":0.2051683925139701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008084469","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.37925667,0.00035438943,0.61165524,0.00028131384,0.00003102083,0.00005395696,0.00017970121,0.00012713604,0.008060558],"genre_scores_gemma":[0.9829701,0.000087945795,0.015535506,0.000011999442,0.0000062412255,0.000025030007,0.000038454356,0.000012613251,0.0013121485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981517,0.00006504208,0.000005358577,0.00002456921,0.000045878092,0.000043973672],"domain_scores_gemma":[0.9994696,0.00027747868,0.00010722526,0.00003479558,0.000078612735,0.00003233792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657953,0.00053030276,0.00035460704,0.00065175066,0.00023902253,0.00053692184,0.0006847519,0.0004604472,0.0016882916],"category_scores_gemma":[0.0011161944,0.00021942258,0.0004614154,0.00031884378,0.00048142936,0.0008401529,0.00039007305,0.00040774918,0.00009677982],"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.000035671295,0.000014109556,0.0002983342,0.000013153259,0.0000070292617,0.000029636238,0.0000076148453,0.9900469,0.0013600148,0.005205456,0.00010561712,0.00287646],"study_design_scores_gemma":[8.673826e-7,0.00001432015,0.00005913936,0.0000012582535,0.0000016458523,0.0000059739345,0.000005707412,0.9986077,0.00022292754,0.0010294223,0.000050035313,0.0000010428454],"about_ca_topic_score_codex":0.0023078707,"about_ca_topic_score_gemma":0.001806012,"teacher_disagreement_score":0.0023078707,"about_ca_system_score_codex":0.0013094385,"about_ca_system_score_gemma":0.0005143277,"threshold_uncertainty_score":0.009500682},"labels":[],"label_agreement":null},{"id":"W3015867196","doi":"10.1002/net.21938","title":"Rational roots of all‐terminal reliability","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Terminal (telecommunication); Spanning tree; Rational number; Moduli; Class (philosophy); Reliability (semiconductor); Discrete mathematics; Graph; Order (exchange); Computer science","score_opus":0.009746665294790957,"score_gpt":0.20200839948166663,"score_spread":0.19226173418687567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015867196","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.7523295,0.0004360506,0.23335576,0.00086717535,0.000070004135,0.00002710101,0.00022897372,0.00026241015,0.012423029],"genre_scores_gemma":[0.9960317,0.000082334314,0.003248431,0.000016521477,0.000022048107,0.0000069815305,0.000020275014,0.000015514055,0.00055612007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959236,0.00008361197,0.000015679989,0.00010960912,0.0001216373,0.00007709215],"domain_scores_gemma":[0.9950771,0.0026400327,0.0010954592,0.00044502402,0.00047307232,0.00026933622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070857053,0.00032802994,0.0004784874,0.0009791147,0.00039683084,0.0009424274,0.0005304693,0.0004490902,0.0024054023],"category_scores_gemma":[0.010263156,0.00019999077,0.0002790257,0.00041187558,0.0018816458,0.0015340106,0.00069694396,0.00086208264,0.00022801699],"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.00031202773,0.000056921777,0.009723943,0.00020407485,0.000045460096,0.00045286366,0.0004932598,0.1585356,0.019346347,0.7782602,0.002569809,0.029999463],"study_design_scores_gemma":[0.00003768543,0.00011189702,0.005861872,0.000045417302,0.00002517893,0.00047874675,0.00020920372,0.26360396,0.006423429,0.72086763,0.0022870821,0.000047969414],"about_ca_topic_score_codex":0.00060995744,"about_ca_topic_score_gemma":0.00032743972,"teacher_disagreement_score":0.0024054023,"about_ca_system_score_codex":0.00073138135,"about_ca_system_score_gemma":0.00040254643,"threshold_uncertainty_score":0.008046865},"labels":[],"label_agreement":null},{"id":"W3037764692","doi":"10.1002/net.21964","title":"Routing electric vehicles with a single recharge per route","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"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":"Deutsche Forschungsgemeinschaft","keywords":"Groundwater recharge; Computer science; Driving range; Routing (electronic design automation); Heuristic; Range (aeronautics); Parking lot; Suite; Operations research; Mathematical optimization; Power (physics); Electric vehicle; Engineering; Mathematics; Computer network","score_opus":0.01957702120302509,"score_gpt":0.2200015023775971,"score_spread":0.200424481174572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037764692","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.35885867,0.00038259942,0.6250323,0.00041924816,0.00011902318,0.00019533739,0.0004966005,0.0007595735,0.013736583],"genre_scores_gemma":[0.8921197,0.0001021926,0.10130721,0.000039290095,0.000017154605,0.00007322841,0.00021038728,0.0000498554,0.006080899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997671,0.00007065859,0.00001147082,0.00005219651,0.000037680016,0.000060886192],"domain_scores_gemma":[0.99965847,0.00016988322,0.000055176894,0.00003672077,0.00004422503,0.00003550793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039520973,0.00042923403,0.0006744074,0.0004279326,0.00033421008,0.00078870694,0.0009223155,0.0007131355,0.004842601],"category_scores_gemma":[0.0013156929,0.00036204004,0.0004428576,0.00063096045,0.0004124435,0.00087773707,0.00057738024,0.00043352696,0.00029410882],"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.000084668965,0.000025624948,0.00041269851,0.000025216894,0.000015518028,0.00004604426,0.000023196046,0.979392,0.0010232589,0.00497917,0.00057952106,0.0133930715],"study_design_scores_gemma":[0.000012321796,0.00003474029,0.00009282163,0.000003011815,0.0000050350172,0.000014130903,0.000021607717,0.9954151,0.00042264545,0.0033103093,0.00066424086,0.0000039801407],"about_ca_topic_score_codex":0.006556589,"about_ca_topic_score_gemma":0.005553042,"teacher_disagreement_score":0.006556589,"about_ca_system_score_codex":0.00077357434,"about_ca_system_score_gemma":0.0006289006,"threshold_uncertainty_score":0.016200125},"labels":[],"label_agreement":null},{"id":"W3049700057","doi":"10.1002/net.21977","title":"Network reliability: Heading out on the highway","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variety (cybernetics); Reliability (semiconductor); Computer science; Graph theory; Probabilistic logic; Network analysis; Commutative property; Theoretical computer science; Enumeration; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Engineering","score_opus":0.04651461942591406,"score_gpt":0.28036012648991504,"score_spread":0.23384550706400098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049700057","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.48247603,0.021713847,0.2534823,0.061818276,0.0010651076,0.0000807955,0.0011682118,0.0006423455,0.17755318],"genre_scores_gemma":[0.9823893,0.0046541593,0.006137848,0.00054785056,0.00038298673,0.000026130057,0.00011053411,0.00007390272,0.0056773606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989298,0.00046171978,0.000026119991,0.00016976555,0.00025426416,0.00015836663],"domain_scores_gemma":[0.99233717,0.0034391358,0.001055049,0.00065797655,0.0019023855,0.000608235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020436058,0.00023386051,0.00035963103,0.001221186,0.0010906511,0.0030224777,0.000662832,0.0011466143,0.0053674416],"category_scores_gemma":[0.01095145,0.00021849856,0.00025968906,0.0013894883,0.0025686743,0.00651332,0.0013952106,0.001290745,0.0006180082],"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.00009818808,0.000013864504,0.006265193,0.00014961117,0.000023851899,0.00019158714,0.001103203,0.02637191,0.0006041723,0.90361047,0.012934717,0.048633195],"study_design_scores_gemma":[0.000008372861,0.00006388124,0.004425032,0.00019321876,0.000021426513,0.00027056955,0.0024347082,0.029241338,0.00054632267,0.91575253,0.047012188,0.000030356248],"about_ca_topic_score_codex":0.003720079,"about_ca_topic_score_gemma":0.003189868,"teacher_disagreement_score":0.0053674416,"about_ca_system_score_codex":0.0013655176,"about_ca_system_score_gemma":0.00088870333,"threshold_uncertainty_score":0.01795584},"labels":[],"label_agreement":null},{"id":"W3081818585","doi":"10.1002/net.21987","title":"Plowing with precedence in polynomial time","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología; Bundesministerium für Bildung und Forschung; Deutscher Akademischer Austauschdienst","keywords":"Heuristics; Traverse; Tree traversal; Time complexity; Computer science; State (computer science); Mathematical optimization; Polynomial; Mathematics; Algorithm; Geography; Cartography","score_opus":0.008302955797465502,"score_gpt":0.17694568193358984,"score_spread":0.16864272613612433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081818585","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.27456826,0.00088326057,0.6799242,0.0037981302,0.00028017917,0.0008670156,0.0027711552,0.0035857614,0.033322144],"genre_scores_gemma":[0.5353542,0.0006519631,0.44319105,0.0004636788,0.00015510926,0.00025971653,0.0032520639,0.0005897126,0.016082523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877125,0.00020148118,0.00007974722,0.0002884516,0.00021895472,0.00044009258],"domain_scores_gemma":[0.9975236,0.0013346308,0.00028748254,0.0004193807,0.00016035828,0.00027439077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082150754,0.00112566,0.0011207868,0.00064605,0.0012236492,0.0024241772,0.0016057808,0.001068323,0.017953452],"category_scores_gemma":[0.0038766982,0.0005172291,0.0011717645,0.0018890081,0.00088828563,0.0048158984,0.001645177,0.0016957476,0.0012861204],"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.0010904236,0.0009975556,0.0035608467,0.0014983455,0.00016346342,0.0007856166,0.0004775874,0.42822403,0.024675375,0.16940561,0.044250473,0.32487065],"study_design_scores_gemma":[0.00033135197,0.00032844912,0.0011220861,0.00006543307,0.00009492912,0.0004842311,0.00054785964,0.58552456,0.0140251275,0.3715507,0.025877524,0.000047778263],"about_ca_topic_score_codex":0.0068240357,"about_ca_topic_score_gemma":0.010336369,"teacher_disagreement_score":0.017953452,"about_ca_system_score_codex":0.0013694337,"about_ca_system_score_gemma":0.002071486,"threshold_uncertainty_score":0.060060263},"labels":[],"label_agreement":null},{"id":"W3084549995","doi":"10.1002/net.21984","title":"The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Metaheuristic; Computer science; Integer programming; Routing (electronic design automation); Set (abstract data type); Graph; Mathematics; Theoretical computer science; Computer network","score_opus":0.01018283057323346,"score_gpt":0.2019510239074673,"score_spread":0.19176819333423384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084549995","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.39557245,0.00093317404,0.5775897,0.0009802242,0.0001989457,0.00026474168,0.0011720108,0.00038870852,0.022899952],"genre_scores_gemma":[0.8846835,0.00024815177,0.107760824,0.000114513496,0.00006160196,0.0001864945,0.000532695,0.00007583063,0.006336406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992067,0.00033331575,0.00003651453,0.00013817022,0.00012852918,0.0001567471],"domain_scores_gemma":[0.9990375,0.00058749673,0.00012171932,0.000069232585,0.00009826992,0.00008578532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009574673,0.0015259476,0.0008524261,0.0008736445,0.0005296751,0.0013471767,0.0017653847,0.0013332347,0.0024851274],"category_scores_gemma":[0.0015924005,0.0005537635,0.0011329963,0.0015878577,0.0006097973,0.0014513253,0.00074794417,0.0008915399,0.00015777409],"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.0001471251,0.000093932074,0.0005425814,0.00010784268,0.00006873856,0.00030189898,0.000027803497,0.9707718,0.0021029215,0.014493549,0.0012577481,0.010084022],"study_design_scores_gemma":[0.0000244578,0.00006529163,0.00023230999,0.000007802503,0.000019080007,0.000103878025,0.00002917283,0.99144566,0.0010554682,0.005874669,0.0011333072,0.000008818851],"about_ca_topic_score_codex":0.0064323037,"about_ca_topic_score_gemma":0.0062152282,"teacher_disagreement_score":0.0064323037,"about_ca_system_score_codex":0.0014103196,"about_ca_system_score_gemma":0.0010207769,"threshold_uncertainty_score":0.012789726},"labels":[],"label_agreement":null},{"id":"W3098853299","doi":"10.1002/net.22004","title":"Roots of two‐terminal reliability polynomials","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Terminal (telecommunication); Mathematics; Reliability (semiconductor); Combinatorics; Spanning tree; Graph; Path (computing); Discrete mathematics; Computer science; Computer network","score_opus":0.04322838962037749,"score_gpt":0.31648656952860466,"score_spread":0.27325817990822715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098853299","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.23380332,0.0010655685,0.7355805,0.0014260053,0.00020676186,0.000069063164,0.00044433257,0.0003487317,0.027055731],"genre_scores_gemma":[0.98232806,0.0005524496,0.011290276,0.000109860535,0.00012596534,0.00004415108,0.00008603838,0.00006671467,0.0053964877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991104,0.00020254735,0.000026550191,0.00017749191,0.00028602566,0.00019699507],"domain_scores_gemma":[0.9925874,0.0043063113,0.0011097055,0.00061129517,0.0010663739,0.0003190718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444825,0.0005415322,0.0006768732,0.0011630268,0.0004920271,0.0010362694,0.0007700385,0.0006995308,0.004006033],"category_scores_gemma":[0.014033899,0.00030103794,0.00050394,0.0010374285,0.0018885417,0.0019597001,0.0011899037,0.0021085737,0.0006685351],"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.00010599971,0.000044565255,0.0026561702,0.00017961238,0.000031152686,0.00045459726,0.00051431573,0.13711841,0.005662102,0.8292717,0.0037330817,0.020228295],"study_design_scores_gemma":[0.000030051513,0.00006801988,0.0020027964,0.000047708312,0.000016465081,0.00046728406,0.00020471954,0.41331306,0.0018003959,0.5782206,0.0037756383,0.000053194253],"about_ca_topic_score_codex":0.0018501196,"about_ca_topic_score_gemma":0.0011393776,"teacher_disagreement_score":0.004006033,"about_ca_system_score_codex":0.0010224008,"about_ca_system_score_gemma":0.00061586767,"threshold_uncertainty_score":0.013401508},"labels":[],"label_agreement":null},{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","score_opus":0.01662834278793372,"score_gpt":0.23147513826401478,"score_spread":0.21484679547608107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122956505","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.029771848,0.0014594705,0.95909464,0.0006918155,0.00010370363,0.0001926568,0.0002937416,0.00028909987,0.008103068],"genre_scores_gemma":[0.42425883,0.0029271203,0.55836874,0.00024124388,0.00021450006,0.0010056834,0.0009442765,0.00029129593,0.0117483055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983317,0.0008809216,0.00006390107,0.00020477596,0.0002689625,0.00024967227],"domain_scores_gemma":[0.9953241,0.0037776507,0.0003614108,0.00013445223,0.00022805536,0.00017441277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036358626,0.00215142,0.0021334095,0.0014159314,0.0010311311,0.0037107929,0.002458785,0.002351137,0.008164994],"category_scores_gemma":[0.007110833,0.001793191,0.001631629,0.00254125,0.0014418318,0.0041324333,0.001740441,0.00377647,0.0007569885],"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.00008504208,0.00006971102,0.00017114592,0.000056420122,0.000030618092,0.000038201655,0.000051136387,0.94261837,0.00019476816,0.04624123,0.0011816634,0.009261613],"study_design_scores_gemma":[0.000023807943,0.000015656185,0.000023540539,0.000009629061,0.000007919782,0.000005808871,0.000011588975,0.9787162,0.00011141826,0.020483783,0.0005871232,0.0000035474286],"about_ca_topic_score_codex":0.01087178,"about_ca_topic_score_gemma":0.007358776,"teacher_disagreement_score":0.01087178,"about_ca_system_score_codex":0.0032,"about_ca_system_score_gemma":0.002538991,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3125310543","doi":"10.1002/net.10067","title":"The single‐vehicle routing problem with unrestricted backhauls","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Solver; Computer science; Backhaul (telecommunications); Vehicle routing problem; Mathematical optimization; Set (abstract data type); Revenue; Routing (electronic design automation); Mathematics; Computer network; Economics","score_opus":0.010873064014029878,"score_gpt":0.21076196657672738,"score_spread":0.1998889025626975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125310543","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.39165747,0.0017084616,0.57412404,0.0019912308,0.00027197294,0.0004490794,0.0014465506,0.000420002,0.027931197],"genre_scores_gemma":[0.8746674,0.00080129947,0.10423633,0.00014362685,0.00012156969,0.0003795148,0.00074695447,0.00011801472,0.018785369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952686,0.00015210455,0.000022687957,0.00011414843,0.00006347939,0.00012070306],"domain_scores_gemma":[0.99918824,0.0005074983,0.000110549416,0.0000399259,0.000052366267,0.000101410056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068270747,0.0012325476,0.0013064792,0.00060128834,0.0007992728,0.001793517,0.0015101483,0.0017413824,0.0061213677],"category_scores_gemma":[0.0015349779,0.0007974196,0.0009993598,0.0011861693,0.0007172207,0.0018115117,0.0009791469,0.0009897612,0.00060639],"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.00016341328,0.000083013634,0.00027216293,0.00015441925,0.000053623502,0.00026071465,0.000055152694,0.95742965,0.0012194496,0.02074067,0.001893228,0.01767451],"study_design_scores_gemma":[0.00006024494,0.0000783631,0.00017924632,0.000017699938,0.000024849945,0.0000962592,0.00007703857,0.9730829,0.00090527325,0.023256678,0.002205532,0.000015952757],"about_ca_topic_score_codex":0.007178061,"about_ca_topic_score_gemma":0.0054401164,"teacher_disagreement_score":0.007178061,"about_ca_system_score_codex":0.0010221457,"about_ca_system_score_gemma":0.0013278744,"threshold_uncertainty_score":0.02047801},"labels":[],"label_agreement":null},{"id":"W3164058326","doi":"10.1002/net.22055","title":"The node cop‐win reliability of unicyclic and bicyclic graphs","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Combinatorics; Graph; Random graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.003734307403357608,"score_gpt":0.18515590220383016,"score_spread":0.18142159480047254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164058326","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.68221533,0.0015228292,0.3035898,0.0010093247,0.000056647128,0.00008469772,0.00069797965,0.00023344578,0.010589861],"genre_scores_gemma":[0.9939295,0.00030380726,0.004377986,0.00003948664,0.000029688006,0.000028580755,0.000101078374,0.000028790962,0.0011609241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988656,0.00050213205,0.000044113363,0.00019300735,0.0002193259,0.00017592651],"domain_scores_gemma":[0.9842465,0.010048316,0.002699511,0.0011638066,0.001252242,0.00058950484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002609409,0.0005847605,0.00082464755,0.00185118,0.00046865767,0.0012807619,0.001311378,0.00070405495,0.0017391341],"category_scores_gemma":[0.01446521,0.00047528086,0.00040872794,0.0013045432,0.0017853115,0.0016654751,0.00095814123,0.0008684798,0.00015350735],"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.00028728298,0.000058964826,0.0074226265,0.00019677468,0.00011829309,0.00028863188,0.000522782,0.6405971,0.0028606188,0.32829565,0.004756424,0.014594868],"study_design_scores_gemma":[0.000016383578,0.00005859373,0.0021630554,0.000039918872,0.00003086772,0.00025422726,0.0001274069,0.84782004,0.0006448074,0.14769985,0.0011226354,0.00002211565],"about_ca_topic_score_codex":0.0034899272,"about_ca_topic_score_gemma":0.0024431346,"teacher_disagreement_score":0.0034899272,"about_ca_system_score_codex":0.0014721944,"about_ca_system_score_gemma":0.00046837406,"threshold_uncertainty_score":0.013800025},"labels":[],"label_agreement":null},{"id":"W3170330333","doi":"10.1002/net.22059","title":"The multifacility center problems with random demand weights","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Probabilistic logic; Center (category theory); Computer science; Upper and lower bounds; Value (mathematics); Expected value; Mathematics; Algorithm; Statistics; Artificial intelligence; Machine learning","score_opus":0.01226411070774614,"score_gpt":0.19377947953755922,"score_spread":0.1815153688298131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170330333","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.12237761,0.0006953617,0.8695767,0.0016109952,0.00009530449,0.00013351951,0.00034907577,0.00018721959,0.0049742963],"genre_scores_gemma":[0.9229301,0.0005682616,0.069331564,0.0002099198,0.00013539591,0.0002463847,0.00029103176,0.00013199021,0.0061553195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724895,0.0013266454,0.00007549412,0.0005919891,0.000302948,0.0004540161],"domain_scores_gemma":[0.9878457,0.009377125,0.0011372988,0.0003309949,0.00079688453,0.00051194266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005830241,0.0015781042,0.0028752212,0.0016565275,0.0010846091,0.00218055,0.0028312088,0.0030715228,0.005481702],"category_scores_gemma":[0.013120821,0.0012539296,0.0016323902,0.001883253,0.002551137,0.004683067,0.00245129,0.003108144,0.00033603614],"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.0000926756,0.000059741786,0.00034190444,0.000043052354,0.000047022808,0.000048599424,0.000032695425,0.95455104,0.00025253804,0.03970065,0.00088934903,0.0039406554],"study_design_scores_gemma":[0.000019996478,0.000027321572,0.000093059985,0.0000057868924,0.000008066765,0.00001525187,0.00002074818,0.9767368,0.00017064784,0.022671856,0.0002201876,0.00001026051],"about_ca_topic_score_codex":0.008320238,"about_ca_topic_score_gemma":0.0039855093,"teacher_disagreement_score":0.008320238,"about_ca_system_score_codex":0.0038010401,"about_ca_system_score_gemma":0.0017333241,"threshold_uncertainty_score":0.030833662},"labels":[],"label_agreement":null},{"id":"W3193751648","doi":"10.1002/net.22074","title":"A combinatorial auction‐based approach for ridesharing in a student transportation system","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Qatar National Library; Sultan Qaboos University","keywords":"Combinatorial auction; Mathematical optimization; Computer science; Heuristics; Vehicle routing problem; Heuristic; Metaheuristic; Routing (electronic design automation); Particle swarm optimization; Integer programming; Common value auction; Artificial intelligence; Mathematics","score_opus":0.01175298652035959,"score_gpt":0.2293458067570131,"score_spread":0.21759282023665352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193751648","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.026319288,0.00032645467,0.9600571,0.00033135182,0.000059033613,0.00012305527,0.00013523306,0.00012914666,0.012519323],"genre_scores_gemma":[0.8561699,0.00040482281,0.1325274,0.00011428116,0.000051024275,0.00025669456,0.00013539747,0.000050682906,0.010289765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.00030123195,0.00001605845,0.00007238169,0.00007642917,0.00007083779],"domain_scores_gemma":[0.9997502,0.00011865952,0.000031524723,0.000019423298,0.000050298207,0.000029826235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081111543,0.000587326,0.0009717987,0.000636442,0.0006680902,0.0018305053,0.0017368367,0.001280454,0.003910726],"category_scores_gemma":[0.00094496063,0.00048991246,0.0011190402,0.0008224294,0.0005949813,0.0010739327,0.0007454395,0.0009908892,0.00030617038],"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.000013866807,0.00002005414,0.000112125024,0.00002188419,0.000014325842,0.00004538516,0.000016297323,0.98084426,0.00026704578,0.014393913,0.00034965837,0.0039010425],"study_design_scores_gemma":[0.0000032061157,0.000011187733,0.000025229168,0.000002138426,0.000003770364,0.000008765389,0.000010480267,0.99777323,0.00005385606,0.0017404874,0.00036454687,0.0000029912715],"about_ca_topic_score_codex":0.013975423,"about_ca_topic_score_gemma":0.010294883,"teacher_disagreement_score":0.013975423,"about_ca_system_score_codex":0.0015504298,"about_ca_system_score_gemma":0.0019807036,"threshold_uncertainty_score":0.027788103},"labels":[],"label_agreement":null},{"id":"W3195783669","doi":"10.1002/net.22075","title":"Impact of knowledge on the cost of treasure hunt in trees","year":2021,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Treasure; Node (physics); Tree (set theory); Mathematics; Type (biology); Enhanced Data Rates for GSM Evolution; Computer science; Combinatorics; Artificial intelligence; Algorithm; Geography","score_opus":0.03562918770948417,"score_gpt":0.30564253735452745,"score_spread":0.2700133496450433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195783669","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.8781921,0.0018245921,0.0968501,0.0032742394,0.00019057486,0.00017285082,0.0008231527,0.00048273714,0.018189665],"genre_scores_gemma":[0.9802962,0.00039121634,0.016860934,0.0001356841,0.000035549878,0.00006040672,0.00025337524,0.00012398392,0.0018426657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562943,0.0019376621,0.00020559544,0.0004349391,0.0008002719,0.0009921422],"domain_scores_gemma":[0.89877504,0.09069848,0.0028171055,0.0040303175,0.0020612674,0.0016177694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005690875,0.00078212103,0.0013181895,0.0008815032,0.0009361195,0.0022068582,0.001978917,0.0018368074,0.005982712],"category_scores_gemma":[0.052494477,0.00050272304,0.00082905934,0.0011252466,0.0019194557,0.0047416426,0.0016046673,0.0023034478,0.00034239775],"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.002070861,0.00027147678,0.0034897008,0.00021452346,0.00008037889,0.00010704882,0.0000672769,0.944364,0.0016393972,0.018771177,0.0017269441,0.027197212],"study_design_scores_gemma":[0.00007124812,0.00035965868,0.0016567732,0.000037122925,0.0000746446,0.00011182317,0.00011779845,0.9721429,0.0017628993,0.022967871,0.0006697627,0.000027500104],"about_ca_topic_score_codex":0.0049305847,"about_ca_topic_score_gemma":0.0043502687,"teacher_disagreement_score":0.005982712,"about_ca_system_score_codex":0.0031665089,"about_ca_system_score_gemma":0.0024808026,"threshold_uncertainty_score":0.03009659},"labels":[],"label_agreement":null},{"id":"W3205122045","doi":"10.1002/net.22112","title":"The consistent production routing problem","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Consistency (knowledge bases); Computer science; Routing (electronic design automation); Local consistency; Production (economics); Heuristic; Consistency model; Linear programming; Mathematics; Data consistency; Distributed computing; Constraint satisfaction; Probabilistic logic","score_opus":0.011754787796061596,"score_gpt":0.22163534045340202,"score_spread":0.20988055265734043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205122045","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.07459269,0.00058818073,0.90301806,0.0014541289,0.00012589003,0.00037430655,0.00070664124,0.00027039906,0.018869761],"genre_scores_gemma":[0.6182631,0.0005758697,0.371409,0.00028759785,0.000112731635,0.00050620286,0.0012405803,0.00017685907,0.007428027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704045,0.0014319487,0.00013656546,0.00063419057,0.00045730683,0.00029945385],"domain_scores_gemma":[0.99617803,0.0026446,0.0003861625,0.0002928502,0.0003606935,0.00013770688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003076032,0.00096071244,0.0011047176,0.0008448662,0.0009697894,0.0023930478,0.0018291371,0.0021443886,0.006327956],"category_scores_gemma":[0.007630444,0.0007085233,0.000999058,0.0016417479,0.0015354346,0.0023865178,0.0013134643,0.0017830534,0.00046144438],"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.00012355472,0.00012904881,0.0010212287,0.00021578553,0.00007502683,0.0005234945,0.00014160688,0.83253634,0.0014037223,0.11833686,0.004122218,0.041371096],"study_design_scores_gemma":[0.00009701592,0.000116728166,0.00035914473,0.000048792168,0.000040164516,0.00025246033,0.00015003096,0.79579324,0.0012652134,0.19400088,0.007850972,0.000025268926],"about_ca_topic_score_codex":0.0026064138,"about_ca_topic_score_gemma":0.0016889699,"teacher_disagreement_score":0.006327956,"about_ca_system_score_codex":0.0013499144,"about_ca_system_score_gemma":0.0023424078,"threshold_uncertainty_score":0.021169126},"labels":[],"label_agreement":null},{"id":"W4230024666","doi":"10.1002/net.20270","title":"A linear algorithm for finding the <i>k</i>‐broadcast center of a tree","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Computer science; Graph; Algorithm; Dissemination; Prim's algorithm; Unit disk graph; Tree (set theory); Combinatorics; Mathematics; Theoretical computer science; Shortest-path tree; Telecommunications","score_opus":0.030353133551422228,"score_gpt":0.2480676424642185,"score_spread":0.21771450891279628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230024666","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.045504916,0.00043587433,0.93678886,0.0007147138,0.0000664848,0.0004424986,0.00061412,0.0047365334,0.01069605],"genre_scores_gemma":[0.21760051,0.00017041508,0.7743922,0.00014530157,0.000050068076,0.00039894285,0.0015068976,0.00036669543,0.0053690085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916553,0.00015954865,0.00006113556,0.00021876393,0.00018043266,0.00021466671],"domain_scores_gemma":[0.9979305,0.0010715192,0.00026510557,0.00025478037,0.00031179984,0.00016633641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547771,0.0007098791,0.00085145276,0.0011957523,0.0012191671,0.0017265865,0.0018342119,0.0008222164,0.009267134],"category_scores_gemma":[0.002611604,0.0005207014,0.0006590334,0.0015494167,0.0007565161,0.0018192633,0.0017933898,0.00092719233,0.0028031163],"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.0014541039,0.0006072899,0.0034022545,0.0009172357,0.000115119285,0.00030424277,0.000938112,0.17504567,0.03362608,0.03792698,0.04445876,0.7012041],"study_design_scores_gemma":[0.0005923594,0.00036327323,0.0013433646,0.00005528634,0.0001031424,0.00046211533,0.00038571045,0.9337329,0.014386484,0.03807407,0.0104344785,0.000066708344],"about_ca_topic_score_codex":0.008220494,"about_ca_topic_score_gemma":0.010291473,"teacher_disagreement_score":0.009267134,"about_ca_system_score_codex":0.001904575,"about_ca_system_score_gemma":0.0028290474,"threshold_uncertainty_score":0.031001627},"labels":[],"label_agreement":null},{"id":"W4230415688","doi":"10.1002/net.20208","title":"Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Maxima and minima; Guided Local Search; Local optimum; Local search (optimization); Multi-commodity flow problem; Convergence (economics); Flow network; Heuristic; Mathematics; Minimum-cost flow problem; Computer science; Algorithm","score_opus":0.01783978272861802,"score_gpt":0.2649947361305507,"score_spread":0.24715495340193266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230415688","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.013760759,0.0003434384,0.9827823,0.00014032665,0.000021108352,0.000083440566,0.000038160077,0.00020645006,0.0026239695],"genre_scores_gemma":[0.37359762,0.0005546988,0.61934096,0.000114029855,0.000041448027,0.00058213546,0.00021155512,0.00023348804,0.0053240648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999546,0.00022681653,0.00001486653,0.00005061144,0.000101228245,0.000060376606],"domain_scores_gemma":[0.99859077,0.0010553144,0.000095353265,0.00006979495,0.0001360528,0.00005264933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379852,0.0011112875,0.0012053335,0.0014208637,0.00069294113,0.00091016357,0.0015725819,0.001176055,0.0041423035],"category_scores_gemma":[0.003927854,0.0007367602,0.0007692013,0.00158281,0.0010017047,0.0013469157,0.0013532025,0.0013259035,0.00040607536],"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.000027888053,0.000026590062,0.00012403175,0.00004201624,0.00001631982,0.000010643538,0.000037114896,0.95207983,0.00021175068,0.019279072,0.00065682153,0.027487902],"study_design_scores_gemma":[0.0000072830153,0.000009823424,0.000016920136,0.0000046311543,0.000001987588,0.0000027690091,0.000004151942,0.99264294,0.000092513,0.00689119,0.0003232284,0.0000025495908],"about_ca_topic_score_codex":0.008718255,"about_ca_topic_score_gemma":0.0068731457,"teacher_disagreement_score":0.008718255,"about_ca_system_score_codex":0.0015728718,"about_ca_system_score_gemma":0.0015535199,"threshold_uncertainty_score":0.017334998},"labels":[],"label_agreement":null},{"id":"W4230596415","doi":"10.1002/net.20169","title":"On the minimum path problem in Knödel graphs","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Logarithm; Bipartite graph; Longest path problem; Degree (music); Discrete mathematics; Shortest path problem; Graph","score_opus":0.016665121090767704,"score_gpt":0.27220704893071435,"score_spread":0.25554192783994667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230596415","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.31172976,0.0014417557,0.66567326,0.0035034763,0.00016241035,0.00028257538,0.0013516854,0.0015295275,0.014325537],"genre_scores_gemma":[0.67556643,0.0011655063,0.31038398,0.00048042467,0.00014290886,0.00025775534,0.0023849965,0.00036681193,0.009251084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999049,0.0003305117,0.000044070788,0.0002406756,0.00016711607,0.00016864343],"domain_scores_gemma":[0.9953751,0.0034687738,0.00032924916,0.00042605895,0.0002058843,0.00019497529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951337,0.0007317136,0.0009660168,0.00086517853,0.0009024806,0.0017235415,0.0013855036,0.0011471616,0.006514387],"category_scores_gemma":[0.008058915,0.00037487654,0.0005335095,0.0015438396,0.00082113355,0.004821153,0.0016219992,0.0013160476,0.00074702245],"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.0018672239,0.0005818399,0.002886015,0.0009136166,0.00012144367,0.0004513344,0.00061850797,0.47088674,0.011424345,0.24314159,0.03647268,0.23063467],"study_design_scores_gemma":[0.00018428067,0.00018594008,0.0004737273,0.000047047644,0.000032255048,0.00034675095,0.00024503304,0.6025095,0.004301036,0.38327262,0.0083741415,0.00002770548],"about_ca_topic_score_codex":0.0023440665,"about_ca_topic_score_gemma":0.0027641384,"teacher_disagreement_score":0.006514387,"about_ca_system_score_codex":0.0016390396,"about_ca_system_score_gemma":0.001205073,"threshold_uncertainty_score":0.021792829},"labels":[],"label_agreement":null},{"id":"W4232471133","doi":"10.1002/net.20237","title":"Reformulation and sampling to solve a stochastic network interdiction problem","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Interdiction; Flow network; Mathematical optimization; Computer science; Bernoulli's principle; Stochastic programming; Mathematics","score_opus":0.010303289843002305,"score_gpt":0.21620625663742943,"score_spread":0.20590296679442713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232471133","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.032562282,0.00026019043,0.9600974,0.0006246379,0.00005433076,0.00008969605,0.00011405503,0.000107116386,0.0060901474],"genre_scores_gemma":[0.7098432,0.00043917165,0.28187418,0.00023767729,0.00015114881,0.00042704504,0.0004015687,0.00011900543,0.006506939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910116,0.00049974036,0.000028574972,0.00010216816,0.00016049872,0.000107799795],"domain_scores_gemma":[0.99652404,0.002713003,0.00020415308,0.00012955614,0.00031379107,0.00011544168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023406025,0.0007222363,0.0010716746,0.0005738821,0.0003895476,0.0008313955,0.0010237996,0.0009442789,0.0048609315],"category_scores_gemma":[0.006697951,0.0004296119,0.0007512931,0.00067108305,0.0011276739,0.0012086545,0.001140168,0.0014577251,0.00027926604],"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.000034294593,0.000041628853,0.00027121094,0.000047113088,0.000016167565,0.000052262698,0.00003620601,0.9350108,0.0002351327,0.056720488,0.00097434665,0.0065603084],"study_design_scores_gemma":[0.000009511614,0.000010893384,0.000023357956,0.0000035002483,0.00000231332,0.000005240703,0.0000074570553,0.98895395,0.00007789105,0.010673003,0.00023142426,0.0000014662585],"about_ca_topic_score_codex":0.0068267668,"about_ca_topic_score_gemma":0.005329447,"teacher_disagreement_score":0.0068267668,"about_ca_system_score_codex":0.0012551873,"about_ca_system_score_gemma":0.0016329614,"threshold_uncertainty_score":0.016261458},"labels":[],"label_agreement":null},{"id":"W4235392953","doi":"10.1002/net.20258","title":"Collection depots facility location problems in trees","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Facility location problem; Center (category theory); Generalization; Computer science; Set (abstract data type); Mathematical optimization; Tree (set theory); Time complexity; Mathematics; Operations research; Combinatorics; Algorithm","score_opus":0.030867701738405053,"score_gpt":0.20855668392897173,"score_spread":0.17768898219056667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235392953","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.18508603,0.0022229296,0.7929647,0.0016390051,0.00013401883,0.00027162937,0.0018860264,0.0007000575,0.015095572],"genre_scores_gemma":[0.7788049,0.0018288932,0.20668632,0.00023904786,0.00020066675,0.00032366824,0.0021655874,0.0001733472,0.009577636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990246,0.00033799204,0.000048040525,0.0002193081,0.00013148144,0.00023860423],"domain_scores_gemma":[0.9984363,0.00089604576,0.00022040032,0.00013401743,0.00015949333,0.00015370554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000891176,0.0006755914,0.0014897578,0.0006838985,0.0013618966,0.0017824509,0.0012814673,0.0012104051,0.0054155383],"category_scores_gemma":[0.0026423426,0.00053138507,0.000853769,0.0023928292,0.00085157494,0.003102163,0.0014545068,0.0011454829,0.00068991195],"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.00041644208,0.00018252041,0.0013498001,0.00043110288,0.000088738125,0.00039540228,0.0003192805,0.78700763,0.0021186292,0.13289742,0.01640326,0.0583898],"study_design_scores_gemma":[0.000113651,0.000101486476,0.00070661964,0.000046816618,0.000037715126,0.00039851852,0.00037360756,0.73792523,0.0017929691,0.24122983,0.017246949,0.000026615435],"about_ca_topic_score_codex":0.005060822,"about_ca_topic_score_gemma":0.004450021,"teacher_disagreement_score":0.0054155383,"about_ca_system_score_codex":0.0017155568,"about_ca_system_score_gemma":0.001007,"threshold_uncertainty_score":0.018116772},"labels":[],"label_agreement":null},{"id":"W4235912610","doi":"10.1002/net.20264","title":"Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Synchronous optical networking; Traffic grooming; Multiplexer; Wavelength-division multiplexing; Computer science; Routing and wavelength assignment; Multiplexing; Computer network; Optical add-drop multiplexer; Offset (computer science); Wavelength; Algorithm; Optical performance monitoring; Telecommunications; Optics; Physics","score_opus":0.01896183288430563,"score_gpt":0.24585547797757212,"score_spread":0.22689364509326648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235912610","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.40433764,0.0009803453,0.58640265,0.00068282406,0.000071718845,0.0002752966,0.00016813127,0.00069339183,0.00638798],"genre_scores_gemma":[0.7162882,0.00035462636,0.27950263,0.00010010311,0.000042713957,0.0001785932,0.00023260957,0.00010773656,0.0031928676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992957,0.00025077333,0.000026362539,0.00009077489,0.00018463306,0.00015179753],"domain_scores_gemma":[0.9983469,0.0011129447,0.00024640182,0.00008470451,0.00011476751,0.000094340015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010619209,0.0013913203,0.0011761828,0.0009100899,0.0006825064,0.0009998146,0.0012486273,0.00093652407,0.0025810613],"category_scores_gemma":[0.0027043433,0.00067035534,0.0004776007,0.0008604312,0.0006854512,0.001824401,0.0009857494,0.000628903,0.00025658775],"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.00042762695,0.00015047388,0.000807635,0.00014534443,0.00004340145,0.00007759401,0.00007428743,0.92717105,0.005593327,0.009498499,0.0014220675,0.05458874],"study_design_scores_gemma":[0.000026055814,0.00005305075,0.0001226021,0.000007163558,0.000010600773,0.000023127668,0.000024723622,0.99289626,0.0032330118,0.003303131,0.0002954041,0.0000048445368],"about_ca_topic_score_codex":0.0026111295,"about_ca_topic_score_gemma":0.003188028,"teacher_disagreement_score":0.0026111295,"about_ca_system_score_codex":0.001757622,"about_ca_system_score_gemma":0.0009072078,"threshold_uncertainty_score":0.012752473},"labels":[],"label_agreement":null},{"id":"W4236347696","doi":"10.1002/net.20372","title":"Exact and performance‐guaranteed multicast algorithms for lifetime optimization in WANETs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Mathematical optimization; Heuristic; Upper and lower bounds; Approximation algorithm; Connection (principal bundle); Graph; Wireless network; Optimization problem; Constant (computer programming); Algorithm; Wireless; Mathematics; Theoretical computer science; Distributed computing; Telecommunications","score_opus":0.011406620044224783,"score_gpt":0.23997228167146117,"score_spread":0.2285656616272364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236347696","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.03979498,0.00060558465,0.95486844,0.00042614175,0.000042191296,0.000046304056,0.00006730393,0.00036570936,0.0037834137],"genre_scores_gemma":[0.73087025,0.0005642771,0.26547346,0.0001400222,0.0000818748,0.00017204965,0.00016109909,0.0001339726,0.0024029496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991493,0.0004317055,0.000028877925,0.0000901959,0.0001630367,0.00013682654],"domain_scores_gemma":[0.9979196,0.0014477768,0.00020234298,0.00017848788,0.00018284663,0.00006894768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026300424,0.0009287423,0.0010620544,0.00067654013,0.0006557826,0.0010361508,0.0012887549,0.0010266849,0.0020783648],"category_scores_gemma":[0.0062634293,0.00039300683,0.00040537454,0.0008796708,0.00090296956,0.002032445,0.0013710029,0.0011037503,0.00031642785],"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.00010376698,0.00003687023,0.00020488181,0.000040480205,0.000015134283,0.000018917188,0.00004979934,0.9482711,0.0006836728,0.025015011,0.001140035,0.024420286],"study_design_scores_gemma":[0.0000106905145,0.000013560695,0.000025469966,0.0000038580843,0.0000024340711,0.000007165686,0.000009485571,0.98848164,0.00019904543,0.0110106105,0.00023425296,0.0000018363015],"about_ca_topic_score_codex":0.0015773509,"about_ca_topic_score_gemma":0.0012927633,"teacher_disagreement_score":0.0026300424,"about_ca_system_score_codex":0.0014184058,"about_ca_system_score_gemma":0.0010695547,"threshold_uncertainty_score":0.013909161},"labels":[],"label_agreement":null},{"id":"W4238082519","doi":"10.1002/net.20345","title":"Wavelength assignment in multifiber star networks","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Clemson University","keywords":"Maximization; Star network; Star (game theory); Path (computing); Computer science; Minification; Time complexity; Approximation algorithm; Wavelength-division multiplexing; Optimization problem; Mathematics; Algorithm; Mathematical optimization; Topology (electrical circuits); Combinatorics; Wavelength; Network topology; Physics; Optics; Computer network","score_opus":0.01544820293658534,"score_gpt":0.2726451021917512,"score_spread":0.25719689925516587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238082519","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.42907554,0.0006663007,0.5609063,0.0005629649,0.000058419762,0.00008941518,0.00019168461,0.00025450054,0.008194895],"genre_scores_gemma":[0.8953559,0.00034015303,0.100736365,0.000080520054,0.000045166496,0.00004911069,0.00015957301,0.000035202618,0.0031980488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994715,0.000195754,0.000018114326,0.000090808004,0.0001283912,0.00009547213],"domain_scores_gemma":[0.9991234,0.00040967562,0.00014866306,0.00008382282,0.00014475579,0.00008978625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072964374,0.00038036576,0.00045545047,0.0005532101,0.0006375843,0.00059352117,0.00069011917,0.00042957382,0.00213664],"category_scores_gemma":[0.0018078329,0.00020856883,0.00020167723,0.0008961577,0.0004592111,0.0013038774,0.00090890797,0.0004378573,0.00021326423],"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.00029901598,0.00011600628,0.0017067429,0.0001552334,0.000038493345,0.00017911613,0.0001990182,0.7938876,0.009209142,0.09071104,0.0030978199,0.10040079],"study_design_scores_gemma":[0.000019575024,0.00004081766,0.00033231155,0.0000063251496,0.0000057017705,0.000044287757,0.000044548742,0.9436306,0.0015925389,0.05195939,0.0023182598,0.000005544051],"about_ca_topic_score_codex":0.0014430913,"about_ca_topic_score_gemma":0.0018660794,"teacher_disagreement_score":0.00213664,"about_ca_system_score_codex":0.0009060208,"about_ca_system_score_gemma":0.00039685107,"threshold_uncertainty_score":0.007147789},"labels":[],"label_agreement":null},{"id":"W4238730366","doi":"10.1002/net.20301","title":"On the roots of strongly connected reliability polynomials","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Strongly connected component; Mathematics; Reliability (semiconductor); Vertex connectivity; Combinatorics; Simply connected space; Unit disk; Plane (geometry); Arc (geometry); Closure (psychology); Complex plane; Connected component; Discrete mathematics; Vertex (graph theory); Graph; Mathematical analysis; Geometry; Physics","score_opus":0.02494561104413878,"score_gpt":0.28564447756926165,"score_spread":0.26069886652512286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238730366","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.4990859,0.00076062285,0.48994523,0.0011343281,0.000061838284,0.000051846502,0.00030883012,0.00025208842,0.008399354],"genre_scores_gemma":[0.9898801,0.0002897435,0.008488252,0.000040830564,0.00007000741,0.000042186562,0.000062766085,0.000034038934,0.0010921783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998985,0.00031942947,0.000031690844,0.00021244407,0.00032083478,0.00013061751],"domain_scores_gemma":[0.981851,0.013692593,0.0020742742,0.00064913114,0.0012387173,0.0004942759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016995466,0.0004803025,0.0006424516,0.001839271,0.000552451,0.0011446145,0.0007961015,0.00077838154,0.00279546],"category_scores_gemma":[0.026844805,0.00039161256,0.0003184516,0.00091314776,0.0026827764,0.0024665196,0.0016704721,0.0017785744,0.0003747697],"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.00030974904,0.000052705345,0.0042483835,0.000215973,0.000033889573,0.00052756764,0.00084834953,0.1935141,0.011182521,0.7548628,0.0019135508,0.03229046],"study_design_scores_gemma":[0.000053655403,0.00009068483,0.002293425,0.000056838755,0.000018186849,0.00037601189,0.00024292311,0.37395728,0.0031468323,0.61809146,0.001615493,0.00005720686],"about_ca_topic_score_codex":0.0007536289,"about_ca_topic_score_gemma":0.00035281864,"teacher_disagreement_score":0.00279546,"about_ca_system_score_codex":0.0008376648,"about_ca_system_score_gemma":0.0004719567,"threshold_uncertainty_score":0.00935173},"labels":[],"label_agreement":null},{"id":"W4239155994","doi":"10.1002/net.20240","title":"Decontamination of hypercubes by mobile agents","year":2008,"lang":"en","type":"article","venue":"Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":37,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Hypercube; Visibility; Human decontamination; Binary logarithm; Node (physics); Synchronicity; Copying; Path (computing); Mobile agent; Distributed computing; Theoretical computer science; Computer network; Mathematics; Combinatorics; Parallel computing","score_opus":0.016013971612176426,"score_gpt":0.24127157903904298,"score_spread":0.22525760742686654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239155994","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.40755147,0.0010737607,0.57901,0.00058611255,0.00013693856,0.00022393269,0.00011180949,0.00084932795,0.01045663],"genre_scores_gemma":[0.8928194,0.00042975342,0.10093595,0.00012726957,0.00004394436,0.00014233643,0.00022719389,0.00010113089,0.005173074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893695,0.0004716342,0.000052672654,0.00015040014,0.00022170074,0.0001666929],"domain_scores_gemma":[0.9982216,0.0006855165,0.00030909554,0.0003788951,0.00024364644,0.0001612953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348536,0.00067084807,0.00086593936,0.00058119855,0.00086178083,0.0012374823,0.0011867236,0.0008862067,0.002021276],"category_scores_gemma":[0.002699272,0.00036600343,0.000562693,0.00066818536,0.0011123064,0.0016097764,0.0022015865,0.00065251824,0.00041413566],"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.00032656323,0.00009811464,0.0013965265,0.00013095039,0.000052713425,0.00039011065,0.00022578819,0.9335677,0.0128213465,0.01938389,0.0011622808,0.030443983],"study_design_scores_gemma":[0.000036251222,0.00013923866,0.00024033106,0.00001710051,0.000011321735,0.00009195674,0.00016714807,0.9739106,0.008232096,0.013206359,0.0039364984,0.000010945161],"about_ca_topic_score_codex":0.0021701923,"about_ca_topic_score_gemma":0.0012299488,"teacher_disagreement_score":0.0021701923,"about_ca_system_score_codex":0.00067202456,"about_ca_system_score_gemma":0.00045014566,"threshold_uncertainty_score":0.006761849},"labels":[],"label_agreement":null},{"id":"W4239505110","doi":"10.1002/net.20155","title":"Vertex disjoint routings of cycles over tori","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Partition (number theory); Disjoint sets; Computer science; Vertex (graph theory); Hypergraph; Shortest path problem; Mathematics; Torus; Combinatorics; Graph; Computer network; Topology (electrical circuits); Discrete mathematics","score_opus":0.0057483894044682805,"score_gpt":0.21924822883743073,"score_spread":0.21349983943296244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239505110","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.77837217,0.00065693655,0.20287266,0.000398398,0.000051947856,0.0001939996,0.00030288514,0.00025457222,0.016896319],"genre_scores_gemma":[0.9548984,0.00031099364,0.040009785,0.00007919328,0.000019546196,0.00013013976,0.0002554636,0.000040867275,0.00425558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969983,0.00008926704,0.00001677486,0.000059807848,0.000052095776,0.00008227784],"domain_scores_gemma":[0.9993374,0.00026571285,0.00013285395,0.00006826999,0.000075945994,0.000119809345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027485742,0.00039628384,0.0004038677,0.0006998102,0.0008161375,0.00083594606,0.00055830565,0.0003665607,0.0023620797],"category_scores_gemma":[0.0015879673,0.00034518394,0.00029473787,0.00062623475,0.0005722342,0.0009441287,0.00091552566,0.0003306028,0.00017418605],"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.0004650321,0.00006584847,0.0022598943,0.00018957752,0.000079623715,0.00043109822,0.0004968345,0.7328786,0.013139987,0.18981186,0.0031352164,0.057046384],"study_design_scores_gemma":[0.00004754635,0.00011726787,0.00086276926,0.000036921585,0.000029244784,0.00010736205,0.00028430307,0.8738078,0.0036142324,0.113773,0.0072986735,0.000020870704],"about_ca_topic_score_codex":0.0030746507,"about_ca_topic_score_gemma":0.0039209067,"teacher_disagreement_score":0.0030746507,"about_ca_system_score_codex":0.0010477868,"about_ca_system_score_gemma":0.00047489343,"threshold_uncertainty_score":0.007901907},"labels":[],"label_agreement":null},{"id":"W4239618018","doi":"10.1002/net.20182","title":"A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Regret; Heuristic; Mathematical optimization; Computer science; Vehicle routing problem; Routing (electronic design automation); Class (philosophy); Process (computing); Operations research; Mathematics; Artificial intelligence; Machine learning","score_opus":0.00953183509274726,"score_gpt":0.24791674975548805,"score_spread":0.23838491466274078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239618018","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.018231422,0.0005118325,0.97537124,0.000280035,0.00007745531,0.00010220982,0.000075892895,0.00028362876,0.005066223],"genre_scores_gemma":[0.4923445,0.0005271597,0.50087106,0.00026101564,0.00015517377,0.00035640254,0.00033966033,0.00017430108,0.004970715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.0008248719,0.000047862894,0.00015282202,0.00030786137,0.00021961106],"domain_scores_gemma":[0.99793005,0.00149274,0.00015225004,0.00010694265,0.00018503195,0.0001329753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025083881,0.00079875387,0.0015542752,0.00081478077,0.00060641835,0.0011834145,0.0014229945,0.0013119782,0.0028905445],"category_scores_gemma":[0.003688862,0.0006420004,0.0008127263,0.0009558061,0.00094654254,0.0012269615,0.0010259076,0.0014602559,0.00040129203],"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.00008738473,0.000055384153,0.00020277142,0.000041617364,0.00003848569,0.00005378434,0.000031737636,0.9557068,0.00035959802,0.0147895105,0.0017837972,0.026849193],"study_design_scores_gemma":[0.000019571315,0.000018461873,0.000036270627,0.0000054950365,0.000005096386,0.000011090206,0.0000045613574,0.99433076,0.0001177722,0.00493154,0.00051554304,0.0000037830202],"about_ca_topic_score_codex":0.004649879,"about_ca_topic_score_gemma":0.0040027564,"teacher_disagreement_score":0.004649879,"about_ca_system_score_codex":0.0014761996,"about_ca_system_score_gemma":0.0021977904,"threshold_uncertainty_score":0.013265789},"labels":[],"label_agreement":null},{"id":"W4243384718","doi":"10.1002/net.20188","title":"The maximum residual flow problem:<i>NP</i>‐hardness with two‐arc destruction","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Arc (geometry); Residual; Mathematics; Flow (mathematics); Combinatorics; Maximum flow problem; Polynomial; Arc routing; Flow network; Computer science; Geometry; Algorithm; Mathematical analysis; Routing (electronic design automation); Computer network","score_opus":0.010911708731744182,"score_gpt":0.22936413531378097,"score_spread":0.21845242658203678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243384718","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.30135417,0.002759532,0.59986293,0.010628337,0.00029531828,0.00033593463,0.001941589,0.0021361492,0.08068599],"genre_scores_gemma":[0.8916697,0.0010770676,0.09068141,0.00081172417,0.00026810318,0.00021537357,0.0016853508,0.000400199,0.013191187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.00033993644,0.00007614142,0.00036590119,0.00024089316,0.00035919138],"domain_scores_gemma":[0.9950706,0.0032608886,0.00046906827,0.000619721,0.00019819518,0.00038153495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010670847,0.00083719724,0.0011717321,0.0006707966,0.00085650606,0.0025940433,0.002541308,0.0015877488,0.0076287617],"category_scores_gemma":[0.00522842,0.00059699954,0.001265111,0.0010543133,0.0023412504,0.0055576176,0.0020761043,0.0032677865,0.0005730825],"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.001153283,0.0005121422,0.0027598361,0.0015100699,0.00021572121,0.0009856212,0.0006415912,0.44613543,0.014365254,0.38128754,0.04591181,0.10452172],"study_design_scores_gemma":[0.00021581906,0.00014496462,0.0012008011,0.00010656439,0.000085353124,0.0012019702,0.00028948716,0.39332485,0.009879419,0.5747261,0.018767646,0.000056972287],"about_ca_topic_score_codex":0.0021965452,"about_ca_topic_score_gemma":0.0013126608,"teacher_disagreement_score":0.0076287617,"about_ca_system_score_codex":0.0012918236,"about_ca_system_score_gemma":0.0011455078,"threshold_uncertainty_score":0.025520802},"labels":[],"label_agreement":null},{"id":"W4245026044","doi":"10.1002/net.20178","title":"Path inequalities for the vehicle routing problem with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"HEC Montréal; Deakin University","keywords":"Vehicle routing problem; Context (archaeology); Polytope; Path (computing); Travelling salesman problem; Mathematical optimization; Node (physics); Mathematics; Computer science; Dimension (graph theory); Routing (electronic design automation); Combinatorics","score_opus":0.014139643962934432,"score_gpt":0.2414425082797293,"score_spread":0.22730286431679486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245026044","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.02228858,0.00071452203,0.96676,0.0004651395,0.00009285922,0.00012724382,0.00029565388,0.00007884897,0.009177327],"genre_scores_gemma":[0.53880775,0.0028451502,0.4412655,0.00030400464,0.00034594676,0.0009219249,0.0011812123,0.0001772802,0.014151278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998955,0.0003746054,0.000046847537,0.00017181494,0.0003120634,0.0001396587],"domain_scores_gemma":[0.99853814,0.0010358796,0.00017373258,0.00004701974,0.00015100928,0.000054109172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992522,0.0013249076,0.000786669,0.0006504569,0.0004045563,0.0012844953,0.000960962,0.00089065987,0.006891374],"category_scores_gemma":[0.0031932876,0.00043205902,0.0008975352,0.001180958,0.0007965037,0.0023867404,0.0011803668,0.002769144,0.00048009882],"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.00008910927,0.00007512768,0.000390515,0.00020435537,0.00004059817,0.00018252191,0.00011484175,0.73768103,0.0026214737,0.21534611,0.0032565363,0.039997716],"study_design_scores_gemma":[0.000027644775,0.000053250224,0.00019123455,0.000028991375,0.000013121284,0.000057622266,0.000036510282,0.90760696,0.00072542584,0.08585183,0.005396609,0.000010856764],"about_ca_topic_score_codex":0.0036246616,"about_ca_topic_score_gemma":0.0023890827,"teacher_disagreement_score":0.006891374,"about_ca_system_score_codex":0.0012624736,"about_ca_system_score_gemma":0.0011551925,"threshold_uncertainty_score":0.023053944},"labels":[],"label_agreement":null},{"id":"W4245416987","doi":"10.1002/net.20119","title":"Fault‐tolerant routings with minimum optical index","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Fault tolerance; Graph; Construct (python library); Context (archaeology); Directed graph; Property (philosophy); Mathematics; Combinatorics; Algorithm; Theoretical computer science; Distributed computing; Computer network","score_opus":0.0022790414841768387,"score_gpt":0.15247128549506406,"score_spread":0.1501922440108872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245416987","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.5618639,0.0010063715,0.41693237,0.00070490275,0.00012543208,0.0001058196,0.00040234,0.00041784227,0.018440897],"genre_scores_gemma":[0.9140528,0.00027398614,0.082715474,0.00014654544,0.000053263462,0.00008190186,0.00039597147,0.00005412082,0.002225918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936944,0.00012206309,0.00005295637,0.00010508898,0.00024892724,0.00010152542],"domain_scores_gemma":[0.99867404,0.0003439107,0.00037126013,0.00029920854,0.00021554122,0.000096237185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854468,0.00047747296,0.000777363,0.0011620297,0.00077987905,0.0014917352,0.00087456935,0.0007095213,0.0011908794],"category_scores_gemma":[0.0025786588,0.0004112508,0.000488978,0.00066045125,0.000707342,0.0015967161,0.00084619917,0.0006136403,0.00022645466],"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.0007562519,0.00028701278,0.0026841878,0.00032873213,0.00014361509,0.00042095993,0.0004268317,0.46440223,0.05741818,0.35263804,0.006696795,0.11379716],"study_design_scores_gemma":[0.00009699706,0.00021825336,0.0014648486,0.000089452784,0.00007011125,0.00041278725,0.00010244042,0.60624534,0.032503087,0.34917247,0.009560475,0.0000637189],"about_ca_topic_score_codex":0.0004918456,"about_ca_topic_score_gemma":0.000526834,"teacher_disagreement_score":0.0014917352,"about_ca_system_score_codex":0.0009928145,"about_ca_system_score_gemma":0.00044182685,"threshold_uncertainty_score":0.0072034597},"labels":[],"label_agreement":null},{"id":"W4245527820","doi":"10.1002/net.20063","title":"Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Probabilistic logic; Computation; Computer science; Mathematical optimization; Traveling purchaser problem; Mathematics; Bottleneck traveling salesman problem; Algorithm; Artificial intelligence","score_opus":0.01835366463530712,"score_gpt":0.24281943364682573,"score_spread":0.2244657690115186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245527820","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.02684224,0.00034064907,0.9699116,0.00016069086,0.000019161154,0.00006269677,0.00004912877,0.00011083509,0.0025029972],"genre_scores_gemma":[0.5420506,0.0006398527,0.4506961,0.000066407396,0.00006635814,0.00034071118,0.00031027076,0.000116495044,0.0057132193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994185,0.00025944776,0.000017586624,0.000082340935,0.00016881671,0.00005328081],"domain_scores_gemma":[0.99917275,0.00059378624,0.000084239124,0.00003714769,0.00008100007,0.000031120333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933403,0.0003880258,0.0010957427,0.0006810572,0.00051329384,0.00068189244,0.0011171098,0.0007492975,0.0019500878],"category_scores_gemma":[0.00327999,0.00039742523,0.0006106616,0.0008264517,0.0004958341,0.001167877,0.0009618721,0.0007046108,0.0002761221],"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.000073348085,0.000044788238,0.00034124329,0.00006354004,0.000028017075,0.00005095104,0.00004745872,0.9071597,0.0007948659,0.051000215,0.0013550284,0.039040837],"study_design_scores_gemma":[0.000006905626,0.000011734929,0.000034777142,0.000002371797,0.0000026690343,0.0000105407835,0.000006483023,0.9898739,0.00010873149,0.009587029,0.0003525606,0.0000022939562],"about_ca_topic_score_codex":0.004012366,"about_ca_topic_score_gemma":0.0027727871,"teacher_disagreement_score":0.004012366,"about_ca_system_score_codex":0.0008138217,"about_ca_system_score_gemma":0.0009909407,"threshold_uncertainty_score":0.007978022},"labels":[],"label_agreement":null},{"id":"W4246352112","doi":"10.1002/net.20148","title":"Uniformly optimal digraphs for strongly connected reliability","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Strongly connected component; Reliability (semiconductor); Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Simple (philosophy); Connectivity; Terminal (telecommunication); Vertex connectivity; Directed graph; Discrete mathematics; Computer science","score_opus":0.0031287280909298274,"score_gpt":0.17559408778692287,"score_spread":0.17246535969599305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246352112","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.54046917,0.0008455503,0.43256974,0.0015814113,0.00009752892,0.00022573341,0.0014107963,0.0005737721,0.02222626],"genre_scores_gemma":[0.92984813,0.00036606003,0.06508986,0.00023940933,0.000029874109,0.00013952056,0.00055618753,0.00004092355,0.0036900123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951947,0.00013388203,0.000035435674,0.00014174798,0.00007757377,0.00009193052],"domain_scores_gemma":[0.99711645,0.0015116663,0.00035988822,0.00035257108,0.0003007449,0.00035860992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087782746,0.0004901885,0.00057626807,0.0011854401,0.00064377213,0.00091420807,0.0005465869,0.0006459884,0.003870652],"category_scores_gemma":[0.0062424894,0.0004944552,0.00040314242,0.0006065091,0.00081357243,0.0012654635,0.0008609249,0.0007422365,0.00031545103],"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.00053504563,0.00023297667,0.0058554746,0.00048208123,0.00011725941,0.00031676047,0.00047802864,0.24892096,0.011169323,0.63105965,0.012042582,0.0887899],"study_design_scores_gemma":[0.000110907735,0.00018187541,0.002986837,0.00007234228,0.00007817851,0.00024693736,0.00017052291,0.338505,0.005383515,0.6439137,0.008311586,0.00003872746],"about_ca_topic_score_codex":0.0013833572,"about_ca_topic_score_gemma":0.0022901315,"teacher_disagreement_score":0.003870652,"about_ca_system_score_codex":0.0016751058,"about_ca_system_score_gemma":0.0008485569,"threshold_uncertainty_score":0.012948692},"labels":[],"label_agreement":null},{"id":"W4247344008","doi":"10.1002/net.20312","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Travelling salesman problem; Pickup; Computer science; Traveling purchaser problem; Mathematical optimization; Branch and cut; Algorithm; Mathematics; Set (abstract data type); Bottleneck traveling salesman problem; Integer programming; FIFO (computing and electronics); Artificial intelligence","score_opus":0.010209518403106783,"score_gpt":0.22035149513800273,"score_spread":0.21014197673489596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247344008","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.028052201,0.00025154793,0.96413255,0.00041502717,0.00004564988,0.00021888736,0.00019458316,0.0006695523,0.0060199313],"genre_scores_gemma":[0.20883101,0.00023900768,0.7855435,0.00014556591,0.000052345036,0.00052181457,0.0006678876,0.00020109428,0.003797714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993411,0.00024368812,0.000029552295,0.000104123625,0.00013528459,0.0001462824],"domain_scores_gemma":[0.99895203,0.000723233,0.00009948893,0.000049141323,0.00010774865,0.00006830696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804599,0.0010973519,0.0012209412,0.0010460169,0.0008360187,0.0015258684,0.0015583038,0.001489082,0.0060593914],"category_scores_gemma":[0.002920298,0.000639069,0.00064453733,0.0014378964,0.00065298635,0.0016193088,0.0010526543,0.0015656824,0.0008019453],"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.00036846558,0.00035516795,0.0007446134,0.00014468329,0.000048856116,0.00013552894,0.0001652581,0.77739686,0.0014613541,0.033030383,0.007186927,0.17896183],"study_design_scores_gemma":[0.000060497667,0.000050637533,0.00007033947,0.000009622498,0.000008021456,0.000017823691,0.000023327022,0.9898554,0.0004220642,0.0083903,0.0010861484,0.0000057842594],"about_ca_topic_score_codex":0.006840292,"about_ca_topic_score_gemma":0.0048251585,"teacher_disagreement_score":0.006840292,"about_ca_system_score_codex":0.0016239724,"about_ca_system_score_gemma":0.0019884724,"threshold_uncertainty_score":0.020270646},"labels":[],"label_agreement":null},{"id":"W4248853006","doi":"10.1002/net.20060","title":"The strongly connected reliability of complete digraphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Vertex connectivity; Vertex (graph theory); Strongly connected component; Combinatorics; Fist; Mathematics; Reliability (semiconductor); Connected component; Connectivity; Discrete mathematics; Computer science; Graph","score_opus":0.011253662670866976,"score_gpt":0.2199192064679363,"score_spread":0.20866554379706934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248853006","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.56475145,0.00031646236,0.4279401,0.00048022546,0.000029716912,0.00008473355,0.0005806314,0.00034386475,0.005472894],"genre_scores_gemma":[0.9831818,0.000181402,0.015181732,0.00004213929,0.000028807595,0.000060042876,0.00028252444,0.000027651995,0.0010139633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.00038282629,0.000050167084,0.00018684662,0.00025343834,0.00011434729],"domain_scores_gemma":[0.98748326,0.008677702,0.0012408756,0.0009077729,0.0011965269,0.0004939982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013478274,0.00047110632,0.00063626975,0.002089969,0.00052657997,0.0011575563,0.000757149,0.0006356679,0.0015925135],"category_scores_gemma":[0.015332738,0.00058150134,0.00044212257,0.0009591605,0.0014435628,0.0020218445,0.0010704354,0.000705496,0.0002491142],"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.00034861674,0.00005829691,0.007233992,0.00022511018,0.00010973024,0.0005004056,0.00064184883,0.69505304,0.00413993,0.25143093,0.0025425046,0.03771552],"study_design_scores_gemma":[0.000026048576,0.000064605265,0.0017743971,0.000023431792,0.000026885904,0.00015673014,0.00007616834,0.63990253,0.001419251,0.35532072,0.0011869933,0.00002224276],"about_ca_topic_score_codex":0.001795033,"about_ca_topic_score_gemma":0.0012791594,"teacher_disagreement_score":0.002089969,"about_ca_system_score_codex":0.0011271042,"about_ca_system_score_gemma":0.0005795681,"threshold_uncertainty_score":0.008177757},"labels":[],"label_agreement":null},{"id":"W4249052652","doi":"10.1002/net.20114","title":"Route discovery with constant memory in oriented planar geometric networks","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Planar graph; Planar; Routing (electronic design automation); Computer science; Face (sociological concept); Combinatorics; Constant (computer programming); Eulerian path; Spatial network; Topology (electrical circuits); Graph; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Pure mathematics","score_opus":0.005255363127485251,"score_gpt":0.19104026970096916,"score_spread":0.1857849065734839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249052652","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.43809906,0.0012778894,0.55361676,0.00086947036,0.000054772438,0.00010019503,0.0002528882,0.00061552605,0.0051134517],"genre_scores_gemma":[0.93817455,0.0005782326,0.059092235,0.000078372745,0.000050455532,0.000072887764,0.00023273467,0.000027881415,0.0016927022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941504,0.00012543399,0.000038660215,0.00015106365,0.00014381764,0.00012613033],"domain_scores_gemma":[0.9960174,0.0021498294,0.0008529882,0.0004671421,0.00034942108,0.0001632511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006731806,0.0004105819,0.00079291494,0.0012165102,0.0006394659,0.0013138928,0.0017714907,0.000760109,0.0015120029],"category_scores_gemma":[0.008472495,0.0003464704,0.0003093436,0.001473576,0.001138654,0.00332788,0.0017840669,0.0005342555,0.00028880598],"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.000788609,0.0000892065,0.0043875226,0.00027962268,0.00009099155,0.0005085096,0.00047669845,0.6956422,0.008797536,0.11163666,0.0029556695,0.17434675],"study_design_scores_gemma":[0.0000555436,0.00015001478,0.00056461646,0.000028176437,0.000054343935,0.00033979866,0.00018704946,0.8596055,0.0075595872,0.12795399,0.003469617,0.00003174494],"about_ca_topic_score_codex":0.0017547364,"about_ca_topic_score_gemma":0.0012799845,"teacher_disagreement_score":0.0017714907,"about_ca_system_score_codex":0.00080896687,"about_ca_system_score_gemma":0.0005172446,"threshold_uncertainty_score":0.005869508},"labels":[],"label_agreement":null},{"id":"W4250150436","doi":"10.1002/net.20170","title":"Locating a cycle in a transportation or a telecommunications network","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Hamiltonian path; Computer science; Graph; Mathematical optimization; Hamiltonian path problem; Hamiltonian (control theory); Mathematics; Theoretical computer science","score_opus":0.014452696560842734,"score_gpt":0.27393892333761466,"score_spread":0.2594862267767719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250150436","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.18750733,0.0023940182,0.7697917,0.0015441725,0.00017733079,0.00017293177,0.0005799166,0.0003548138,0.03747792],"genre_scores_gemma":[0.778904,0.001721229,0.20302115,0.00014816648,0.00009273586,0.00012576202,0.00043393957,0.00006346324,0.015489519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972993,0.0000688565,0.000012860279,0.00009225519,0.000047821166,0.000048299436],"domain_scores_gemma":[0.9997694,0.00010600167,0.00004713181,0.000026503072,0.000021787988,0.000029260784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024939724,0.0004199022,0.0005074353,0.00068949984,0.00060804957,0.0013827243,0.000670647,0.001072669,0.008638737],"category_scores_gemma":[0.001021042,0.0001750956,0.00040459313,0.0013679359,0.0007174853,0.0017063111,0.00082452927,0.0004646761,0.00057142053],"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.00019121949,0.00007259839,0.0017909313,0.00032270508,0.00006943287,0.0005791486,0.00022447926,0.38523751,0.005301274,0.4770287,0.009971303,0.11921077],"study_design_scores_gemma":[0.000037654667,0.000098013654,0.00071524427,0.00008876228,0.000043230706,0.00044507577,0.00037781397,0.567344,0.0036280607,0.38782397,0.039368507,0.000029709336],"about_ca_topic_score_codex":0.0027054674,"about_ca_topic_score_gemma":0.0025562989,"teacher_disagreement_score":0.008638737,"about_ca_system_score_codex":0.001018416,"about_ca_system_score_gemma":0.0005892206,"threshold_uncertainty_score":0.02889949},"labels":[],"label_agreement":null},{"id":"W4250280589","doi":"10.1002/net.20307","title":"A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Orienteering; Vertex (graph theory); Bottleneck traveling salesman problem; Computer science; Branch and cut; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; 2-opt; Mathematics; Algorithm; Traveling purchaser problem; Mathematical optimization; Linear programming; Artificial intelligence","score_opus":0.015512761032151857,"score_gpt":0.2532832045046128,"score_spread":0.23777044347246093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250280589","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.024273776,0.00017563156,0.9692197,0.00026235747,0.000051629526,0.0002092959,0.00017230486,0.00039712235,0.005238245],"genre_scores_gemma":[0.15584159,0.00019250612,0.8395499,0.00010327554,0.00003929749,0.0004068004,0.00058619806,0.00015322889,0.0031272243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994369,0.00018113518,0.00003136693,0.00011255331,0.00012633028,0.000111747075],"domain_scores_gemma":[0.9990527,0.00058754825,0.00008029121,0.000055342607,0.0001427436,0.00008133246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011193239,0.00094165554,0.0010497371,0.0009679649,0.0008110815,0.001065903,0.0013857756,0.0010913954,0.0054387385],"category_scores_gemma":[0.0025260013,0.0005060973,0.0007057495,0.0016900146,0.0005670173,0.0012526016,0.0011316577,0.0015587696,0.00052960165],"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.00029701952,0.00031647098,0.0007018002,0.00022080135,0.00007595202,0.00015046303,0.00016936321,0.6436868,0.0021868404,0.04562884,0.009459858,0.29710576],"study_design_scores_gemma":[0.00009060756,0.00007557243,0.000136599,0.000015656426,0.00002034658,0.000045045526,0.000034241617,0.9669284,0.0009973655,0.028971072,0.002673961,0.0000110287165],"about_ca_topic_score_codex":0.0047595617,"about_ca_topic_score_gemma":0.003523512,"teacher_disagreement_score":0.0054387385,"about_ca_system_score_codex":0.0010493307,"about_ca_system_score_gemma":0.0017079617,"threshold_uncertainty_score":0.018194437},"labels":[],"label_agreement":null},{"id":"W4251030912","doi":"10.1002/net.20174","title":"The 1‐minimax and 1‐maximin problems with demand weights of general probability distributions","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Minimax; Probability distribution; Mathematical optimization; Mathematics; Random variable; Computer science; Statistics","score_opus":0.013816080537281538,"score_gpt":0.2063077277241026,"score_spread":0.19249164718682107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251030912","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.07448795,0.00147617,0.91173077,0.0020805248,0.000087770124,0.00010560254,0.0002548615,0.000063432955,0.009712817],"genre_scores_gemma":[0.8546766,0.0020813558,0.1281587,0.000286041,0.00035704015,0.0004015413,0.00026004494,0.00012377411,0.013655021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721235,0.0016851836,0.00009939744,0.0004916304,0.00029030174,0.00022120617],"domain_scores_gemma":[0.98820865,0.010291071,0.0007738638,0.00021604804,0.0003252601,0.00018514565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060028355,0.0013575262,0.0021970314,0.0010023525,0.0007348505,0.0023491269,0.001589922,0.002419004,0.0044770553],"category_scores_gemma":[0.020776188,0.001051044,0.0009537484,0.0019665426,0.0023906287,0.004551488,0.001558965,0.002111614,0.00033276223],"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.00018110733,0.00009137322,0.00058924727,0.00024391129,0.000095502226,0.0001889567,0.00014436588,0.71045125,0.0005678335,0.26293826,0.002474686,0.022033606],"study_design_scores_gemma":[0.00004568876,0.00004527868,0.0004551422,0.000036484216,0.000017356506,0.000077156394,0.000056740926,0.70263237,0.0002779354,0.29527357,0.0010585989,0.000023658009],"about_ca_topic_score_codex":0.0013947603,"about_ca_topic_score_gemma":0.0008458856,"teacher_disagreement_score":0.0060028355,"about_ca_system_score_codex":0.0024278597,"about_ca_system_score_gemma":0.0008807602,"threshold_uncertainty_score":0.031746387},"labels":[],"label_agreement":null},{"id":"W4251692629","doi":"10.1002/net.20159","title":"The bridges of Königsberg—A historical perspective","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Perspective (graphical); Computer science; Graph theory; Graph; Operations research; Combinatorics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.01678236245234923,"score_gpt":0.2940905582696183,"score_spread":0.27730819581726907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251692629","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.024699962,0.22339317,0.016011756,0.047024988,0.0032649233,0.000028378567,0.00023551799,0.00008155014,0.6852597],"genre_scores_gemma":[0.80656224,0.12514403,0.005656734,0.0067007425,0.0046527125,0.00007191624,0.00017787392,0.00010014983,0.05093358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989317,0.0003606204,0.000059490878,0.00026424747,0.0002588196,0.0001250737],"domain_scores_gemma":[0.9985133,0.00081336976,0.00014737349,0.000125396,0.00026065775,0.00013984533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021289517,0.00038422397,0.00037039418,0.003367931,0.0033737684,0.0046995385,0.0009079056,0.0022924992,0.0068416037],"category_scores_gemma":[0.004077249,0.00026996748,0.00020201209,0.0032879564,0.007946174,0.009215877,0.0021819056,0.0036328337,0.0008968876],"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.000004397221,0.0000042494853,0.00004808247,0.00002764722,0.0000020032908,0.00002383194,0.00033930846,0.00013196119,0.000016265243,0.9896992,0.0038671198,0.005835962],"study_design_scores_gemma":[0.0000036671045,0.000011414855,0.0002531584,0.0001744171,0.000004360937,0.00013953872,0.0003899397,0.00041722064,0.000116146286,0.73522717,0.26325402,0.00000898561],"about_ca_topic_score_codex":0.0044647395,"about_ca_topic_score_gemma":0.0027434793,"teacher_disagreement_score":0.0068416037,"about_ca_system_score_codex":0.005271248,"about_ca_system_score_gemma":0.0014043374,"threshold_uncertainty_score":0.038245738},"labels":[],"label_agreement":null},{"id":"W4251854703","doi":"10.1002/net.20368","title":"A polyhedral study of the network pricing problem with connected toll arcs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Toll; Revenue; Flow network; Network planning and design; Mathematical optimization; Computer science; Mathematical economics; Mathematics; Operations research; Business; Computer network; Finance","score_opus":0.009393117172837029,"score_gpt":0.24659428467428937,"score_spread":0.23720116750145234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251854703","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.09174751,0.0016616997,0.84388536,0.001713321,0.00032055832,0.00032346157,0.0004996887,0.000063216794,0.059785154],"genre_scores_gemma":[0.8175491,0.0027897207,0.16439995,0.00030294395,0.00029724545,0.00040463213,0.0004124865,0.000113271104,0.013730668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885833,0.0006027925,0.000038296956,0.00013690662,0.00021434604,0.00014924958],"domain_scores_gemma":[0.99837095,0.0011256892,0.00013365386,0.00009560979,0.00015434105,0.00011977753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012590345,0.00076753774,0.0009812776,0.0007965504,0.000815702,0.0027734204,0.0011483589,0.0011427843,0.0077835117],"category_scores_gemma":[0.004323641,0.00080706546,0.000999275,0.0016289854,0.0019293809,0.002153828,0.0010658412,0.001648246,0.00035818267],"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.00005008637,0.000072837924,0.00035806128,0.00010287578,0.000021614007,0.00010320006,0.00008687714,0.76282716,0.00044220232,0.22668996,0.0018856514,0.007359564],"study_design_scores_gemma":[0.000030953084,0.000040859704,0.00018585243,0.000045926612,0.000013566213,0.000039229017,0.00014713204,0.85775316,0.00025963652,0.13609633,0.0053747375,0.000012519636],"about_ca_topic_score_codex":0.01009123,"about_ca_topic_score_gemma":0.0055089863,"teacher_disagreement_score":0.01009123,"about_ca_system_score_codex":0.0020510186,"about_ca_system_score_gemma":0.0012055737,"threshold_uncertainty_score":0.026038408},"labels":[],"label_agreement":null},{"id":"W4253133138","doi":"10.1002/net.20106","title":"Variations of the prize‐collecting Steiner tree problem","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steiner tree problem; Bottleneck; Combinatorics; Spanning tree; Mathematics; k-minimum spanning tree; Graph; Tree (set theory); Path (computing); Discrete mathematics; Time complexity; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.04312057372365112,"score_gpt":0.3182009348621068,"score_spread":0.2750803611384557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253133138","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.27351752,0.0023466297,0.6210214,0.0028778007,0.00050949166,0.00056485477,0.0016311136,0.0009579645,0.09657326],"genre_scores_gemma":[0.8705036,0.001416544,0.10808004,0.00032095835,0.00038424312,0.00029416554,0.0011830934,0.00017225681,0.017645113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979963,0.0006032248,0.00012035915,0.00038763066,0.0005032291,0.000389189],"domain_scores_gemma":[0.99755317,0.0009852928,0.0003934744,0.0003997237,0.0002762582,0.00039207458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019075521,0.0007410644,0.0011313559,0.0010650043,0.0014163663,0.0022369546,0.0034991216,0.001603741,0.009961119],"category_scores_gemma":[0.0045468756,0.0003992325,0.0016727662,0.002813667,0.0011145625,0.0045504016,0.0025234458,0.0021904702,0.00078639475],"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.00079239125,0.0005631755,0.0020408537,0.0005313527,0.00023193112,0.00090684154,0.00038180564,0.2690594,0.0057482803,0.5721875,0.03698075,0.110575795],"study_design_scores_gemma":[0.00015477254,0.0002955829,0.0015724975,0.00006603748,0.00010199234,0.001965383,0.0003032557,0.41411003,0.0030680774,0.5355627,0.042715456,0.00008424827],"about_ca_topic_score_codex":0.0012001432,"about_ca_topic_score_gemma":0.0011399661,"teacher_disagreement_score":0.009961119,"about_ca_system_score_codex":0.0013309574,"about_ca_system_score_gemma":0.0009417798,"threshold_uncertainty_score":0.033323288},"labels":[],"label_agreement":null},{"id":"W4255492803","doi":"10.1002/net.20061","title":"Exact solution of the centralized network design problem on directed graphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Column generation; Cutting-plane method; Lagrangian relaxation; Spanning tree; Steiner tree problem; Mathematical optimization; Branch and bound; Directed graph; Linear programming relaxation; Interior point method; Branch and cut; Mathematics; Relaxation (psychology); Constraint (computer-aided design); Upper and lower bounds; Tree (set theory); Point (geometry); Computer science; Linear programming; Integer programming; Combinatorics","score_opus":0.01629736232607209,"score_gpt":0.23421502231816474,"score_spread":0.21791765999209264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255492803","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.011769807,0.000091671514,0.9854035,0.000087875414,0.000013708612,0.0000278799,0.000040892763,0.00014404689,0.0024206105],"genre_scores_gemma":[0.49300525,0.0002500353,0.5016335,0.000073141644,0.000039777195,0.0002221848,0.00019707154,0.0001294567,0.004449463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994442,0.00018923204,0.000015631877,0.00010095437,0.00016676911,0.00008321348],"domain_scores_gemma":[0.9988142,0.00070259295,0.00012235847,0.00011881724,0.00018284464,0.00005911685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975142,0.0006955482,0.0010523996,0.0005482623,0.00046052862,0.0008695534,0.000954127,0.0007963436,0.0041470705],"category_scores_gemma":[0.002829977,0.00047716039,0.00048661916,0.0007033619,0.0007259709,0.0008755198,0.0008928435,0.0009914208,0.00041800257],"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.000019459485,0.000017377319,0.00009361929,0.000034166107,0.000007086661,0.000021515973,0.00001919935,0.9692348,0.0007685004,0.010620588,0.0006716747,0.018492062],"study_design_scores_gemma":[0.000009765103,0.000011463388,0.000024009498,0.000003421557,0.000002338405,0.000007579663,0.0000075295115,0.99233353,0.00036943817,0.0068636504,0.00036534725,0.0000019889744],"about_ca_topic_score_codex":0.003479596,"about_ca_topic_score_gemma":0.003965465,"teacher_disagreement_score":0.0041470705,"about_ca_system_score_codex":0.0013393972,"about_ca_system_score_gemma":0.0017539387,"threshold_uncertainty_score":0.013873398},"labels":[],"label_agreement":null},{"id":"W4256141174","doi":"10.1002/net.20362","title":"Lagrangean‐based decomposition algorithms for multicommodity network design problems with penalized constraints","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Mathematical optimization; Decomposition; Flow network; Convergence (economics); Relaxation (psychology); Network planning and design; Context (archaeology); Computer science; Decomposition method (queueing theory); Nonlinear system; Integer (computer science); Algorithm; Mathematics","score_opus":0.04144083009145854,"score_gpt":0.3149675041647392,"score_spread":0.27352667407328063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256141174","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.004087078,0.00015511941,0.99386036,0.00011326915,0.000018940877,0.000047841444,0.000027451866,0.00011881774,0.0015710949],"genre_scores_gemma":[0.11689317,0.0002983299,0.8790806,0.00008582859,0.000039458697,0.00038843555,0.00019284655,0.0001609544,0.0028604087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989384,0.0006369516,0.000039396175,0.00009710725,0.00019286702,0.00009521141],"domain_scores_gemma":[0.99740905,0.0019129368,0.00018323859,0.00013773814,0.00027460768,0.00008244848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031435443,0.0014468803,0.0013910586,0.0012425109,0.00062982645,0.0011384381,0.0011665823,0.0012524102,0.0039747176],"category_scores_gemma":[0.0050432463,0.0009486714,0.0009542602,0.0014558884,0.00094960287,0.0012434331,0.0016926982,0.0023329386,0.00085323106],"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.000042695156,0.000046662823,0.00014854355,0.000060917173,0.000021306481,0.000022078966,0.000041233834,0.9459102,0.0004064213,0.016916774,0.0011419421,0.03524128],"study_design_scores_gemma":[0.000008564574,0.000006449227,0.000013744305,0.0000049798464,0.0000017584305,0.0000033277463,0.0000038920994,0.9953211,0.00009690078,0.00424718,0.00029021993,0.0000018922739],"about_ca_topic_score_codex":0.006089707,"about_ca_topic_score_gemma":0.005259308,"teacher_disagreement_score":0.006089707,"about_ca_system_score_codex":0.0015459403,"about_ca_system_score_gemma":0.0017680378,"threshold_uncertainty_score":0.016624868},"labels":[],"label_agreement":null},{"id":"W4256347034","doi":"10.1002/net.20318","title":"Improper coloring of unit disk graphs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Complete coloring; Mathematics; Indifference graph; Edge coloring; Chromatic scale; Graph coloring; Discrete mathematics; Chordal graph; Graph; Interval graph; Computer science; Interval (graph theory); Unit disk; 1-planar graph; Line graph; Graph power","score_opus":0.021960333528217062,"score_gpt":0.2843527786470723,"score_spread":0.26239244511885523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256347034","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.6959259,0.00052168855,0.29365367,0.0008776799,0.000096320895,0.000104442326,0.0006745604,0.00058922847,0.0075565157],"genre_scores_gemma":[0.9168691,0.00030223784,0.079253525,0.00014329085,0.000060984443,0.00006414575,0.00078584213,0.00009323152,0.0024276013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889463,0.00036345678,0.000056180204,0.0002711496,0.00021826391,0.0001963041],"domain_scores_gemma":[0.9936047,0.0030212072,0.00084693835,0.0015933462,0.00048062307,0.00045322446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062509225,0.0005057978,0.000739531,0.0006191906,0.00079078175,0.0017603374,0.0014537805,0.0006308228,0.0031001642],"category_scores_gemma":[0.0048287385,0.00033721825,0.00039953802,0.0016069333,0.0011186874,0.0023707524,0.0011118202,0.0011583406,0.00026361505],"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.0012171515,0.0002505779,0.009332425,0.0005078182,0.000114078255,0.0006928923,0.00067588745,0.6562257,0.014751358,0.2222919,0.011914859,0.08202534],"study_design_scores_gemma":[0.000042005897,0.000050385977,0.0012560652,0.000018593435,0.000023915325,0.0002586321,0.00026104864,0.7878114,0.0046574934,0.20158224,0.0040173507,0.000020828467],"about_ca_topic_score_codex":0.0032157428,"about_ca_topic_score_gemma":0.0028932171,"teacher_disagreement_score":0.0032157428,"about_ca_system_score_codex":0.0013485702,"about_ca_system_score_gemma":0.0006376484,"threshold_uncertainty_score":0.010371029},"labels":[],"label_agreement":null},{"id":"W4288759802","doi":"10.1002/net.22118","title":"Capacity provisioning for evacuation on path networks","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Computer science; Flow network; Mathematical optimization; Exploit; Sink (geography); Path (computing); Provisioning; Parametric statistics; Linear programming; Computer network; Mathematics; Algorithm","score_opus":0.012817695259568067,"score_gpt":0.21010604387331971,"score_spread":0.19728834861375164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288759802","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.13193522,0.00078654604,0.8464713,0.0012062667,0.00011753208,0.00021784098,0.0007444291,0.00064376264,0.01787703],"genre_scores_gemma":[0.8669519,0.0005775438,0.12600204,0.00008907789,0.000038526665,0.00017837516,0.00041966027,0.00012600319,0.0056169257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.00020596324,0.000012799279,0.00008304281,0.00006074882,0.00011587068],"domain_scores_gemma":[0.9985672,0.0009931067,0.000116256786,0.000086872096,0.00014178889,0.00009472256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007431708,0.0007530338,0.0005817259,0.0007375382,0.0006716621,0.0007834571,0.0009357209,0.00080115325,0.00583982],"category_scores_gemma":[0.0040876446,0.00037999824,0.00035770086,0.0009605258,0.0008047126,0.0014276474,0.0012860347,0.00078757707,0.00031796165],"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.0000619084,0.000013638267,0.00023138193,0.000060729577,0.0000096328895,0.000051878324,0.000040551964,0.9677076,0.000704549,0.019203113,0.0016121013,0.01030294],"study_design_scores_gemma":[0.0000069736066,0.000014416449,0.00008091698,0.000010260602,0.0000033416138,0.000022142092,0.000033035823,0.9825613,0.0003622023,0.015167594,0.0017331479,0.0000047872204],"about_ca_topic_score_codex":0.005679147,"about_ca_topic_score_gemma":0.004544733,"teacher_disagreement_score":0.00583982,"about_ca_system_score_codex":0.0015422778,"about_ca_system_score_gemma":0.0010689019,"threshold_uncertainty_score":0.019536138},"labels":[],"label_agreement":null},{"id":"W4311519325","doi":"10.1002/net.22133","title":"Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Train; Integer programming; Arc routing; Computer science; Routing (electronic design automation); Path (computing); Mathematical optimization; Sorting; Yard; Integer (computer science); Linear programming; Operations research; Mathematics; Algorithm; Computer network","score_opus":0.012625914508705316,"score_gpt":0.194890541610702,"score_spread":0.18226462710199667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311519325","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.03854472,0.0015236872,0.93798184,0.0013075201,0.00028904795,0.00036611286,0.0009466195,0.00038203152,0.018658461],"genre_scores_gemma":[0.6005208,0.0014001493,0.37833476,0.0006052615,0.00024552125,0.0014321586,0.0013681559,0.00021290673,0.015880277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985629,0.0006059423,0.000055291475,0.00024926802,0.0002402011,0.00028644365],"domain_scores_gemma":[0.9981325,0.0011697082,0.0002108119,0.00006122946,0.0002742411,0.00015145192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022359916,0.0026930613,0.0016304362,0.0013975671,0.0006899981,0.0033356214,0.0026250577,0.0030767939,0.006957306],"category_scores_gemma":[0.0030822733,0.0012948551,0.0027121685,0.0016999827,0.00084964104,0.0018935357,0.0018831948,0.004402773,0.0007072065],"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.000039825016,0.00008592316,0.00023177225,0.00006856463,0.000026649195,0.00006732503,0.00002539232,0.9857042,0.00018070353,0.008128794,0.0010311306,0.004409781],"study_design_scores_gemma":[0.000008097529,0.000015594216,0.000033052806,0.000008107799,0.000005698796,0.000005864737,0.000008848372,0.9981286,0.000045488894,0.0013256228,0.00041151737,0.000003526265],"about_ca_topic_score_codex":0.01195983,"about_ca_topic_score_gemma":0.010804338,"teacher_disagreement_score":0.01195983,"about_ca_system_score_codex":0.0022456634,"about_ca_system_score_gemma":0.002473803,"threshold_uncertainty_score":0.023780406},"labels":[],"label_agreement":null},{"id":"W4362665816","doi":"10.1002/net.22147","title":"The probabilistic uncapacitated open vehicle routing location problem","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"The Scarborough Hospital; University of Toronto","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Heuristics; Computer science; Service (business); Probabilistic logic; Simple (philosophy); Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Tree (set theory); Computer network; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.02512845140514344,"score_gpt":0.27067178824854166,"score_spread":0.2455433368433982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362665816","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.030682404,0.0008157097,0.9581544,0.001233681,0.00013883943,0.000100812664,0.00061152334,0.00032498315,0.007937668],"genre_scores_gemma":[0.78355193,0.0021278264,0.19580637,0.00031254345,0.00031893922,0.00038398433,0.0013722763,0.0001790618,0.01594706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985399,0.00055066694,0.000057013378,0.00033455776,0.00027972044,0.00023815845],"domain_scores_gemma":[0.9975684,0.0016669623,0.00031153724,0.00015481848,0.00017737015,0.00012075228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012064363,0.0011268562,0.0013431732,0.0006479788,0.00075764337,0.0017886796,0.0028009242,0.0017402902,0.0038130626],"category_scores_gemma":[0.0062476476,0.0010647872,0.0008544278,0.0017921815,0.0012693403,0.0032260027,0.0017691052,0.0014545213,0.0005419308],"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.00008098527,0.000038602084,0.0003303898,0.00010625079,0.000037733116,0.00013608098,0.00005719356,0.93170303,0.00034933843,0.047533773,0.0026006866,0.017025966],"study_design_scores_gemma":[0.000020049722,0.00002789331,0.00012691843,0.000012049692,0.000014444758,0.00009565927,0.000032941945,0.9466319,0.00019342048,0.0505058,0.0023246077,0.000014231802],"about_ca_topic_score_codex":0.004368726,"about_ca_topic_score_gemma":0.004098851,"teacher_disagreement_score":0.004368726,"about_ca_system_score_codex":0.0013850697,"about_ca_system_score_gemma":0.0015640031,"threshold_uncertainty_score":0.01275593},"labels":[],"label_agreement":null},{"id":"W4372352878","doi":"10.1002/net.22150","title":"Existence of optimally‐greatest digraphs for strongly connected node reliability","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","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":"Concordia University; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Strongly connected component; Node (physics); Reliability (semiconductor); Mathematics; Combinatorics; Directed graph; Graph; Discrete mathematics; Computer science","score_opus":0.011205896267939299,"score_gpt":0.21777872761502384,"score_spread":0.20657283134708454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372352878","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.5139297,0.00044128086,0.46653333,0.0010411275,0.000056102002,0.00006933119,0.00047288043,0.00019649803,0.017259618],"genre_scores_gemma":[0.9530052,0.000248553,0.04386124,0.00014647937,0.000032108892,0.000052147756,0.00017189118,0.000039204493,0.0024432284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994293,0.00016690297,0.000021165875,0.00014391901,0.00011395283,0.00012477303],"domain_scores_gemma":[0.9954026,0.002653489,0.00065800827,0.00043984666,0.0003734495,0.00047266393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787216,0.00045939698,0.000599669,0.0008915497,0.0006321188,0.0013743718,0.000760911,0.0007492604,0.0026648499],"category_scores_gemma":[0.005130291,0.0006432833,0.00044737768,0.0006924424,0.001266749,0.001960242,0.0009108629,0.0011232524,0.00020419672],"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.00015550335,0.00015686503,0.0034029528,0.00019775474,0.00006157798,0.00021315667,0.00023645697,0.30213168,0.013592813,0.6560885,0.0043923776,0.01937046],"study_design_scores_gemma":[0.000036856967,0.000103001854,0.001240357,0.000040560102,0.00002878826,0.00023300297,0.00017411252,0.39171922,0.003967782,0.5987871,0.0036294137,0.00003984675],"about_ca_topic_score_codex":0.0013203614,"about_ca_topic_score_gemma":0.002571537,"teacher_disagreement_score":0.0026648499,"about_ca_system_score_codex":0.001447539,"about_ca_system_score_gemma":0.00104562,"threshold_uncertainty_score":0.010502696},"labels":[],"label_agreement":null},{"id":"W4381434719","doi":"10.1002/net.22166","title":"On the split reliability of graphs","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Reliability (semiconductor); Graph; Random graph; Discrete mathematics; Computer science","score_opus":0.006908805412771038,"score_gpt":0.1889312714313677,"score_spread":0.18202246601859667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381434719","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.30880284,0.0016609384,0.66462827,0.0016104692,0.00008977131,0.00007078047,0.00042604993,0.00020296329,0.022507867],"genre_scores_gemma":[0.9822708,0.0006793295,0.015016819,0.00012112869,0.00010009728,0.000061394756,0.00013831879,0.000060414557,0.0015517712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982659,0.00094679126,0.000038959406,0.00022584377,0.0003160044,0.0002066351],"domain_scores_gemma":[0.98976433,0.007383795,0.00092146336,0.00070809596,0.0008415009,0.00038075764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022274496,0.0008262777,0.00079406874,0.0018637177,0.0005591279,0.0011929452,0.00091949845,0.00089335674,0.002468368],"category_scores_gemma":[0.011352768,0.0004544595,0.0005622191,0.0008580315,0.00259402,0.0024706693,0.001580422,0.0010759097,0.00024227165],"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.0001803785,0.000031036616,0.0013126326,0.0001425509,0.00005771877,0.00016826879,0.00020772389,0.4958863,0.0023343558,0.48409706,0.0029899965,0.012591974],"study_design_scores_gemma":[0.00001644473,0.00006139274,0.00048031926,0.000042280895,0.000018125624,0.000104694926,0.00008154178,0.5389625,0.0005345606,0.45833415,0.0013514501,0.000012606652],"about_ca_topic_score_codex":0.0014825333,"about_ca_topic_score_gemma":0.00085027114,"teacher_disagreement_score":0.002468368,"about_ca_system_score_codex":0.0012501725,"about_ca_system_score_gemma":0.0004580624,"threshold_uncertainty_score":0.011780024},"labels":[],"label_agreement":null},{"id":"W4384406331","doi":"10.1002/net.22170","title":"Two‐stage stochastic one‐to‐many driver matching for ridesharing","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matching (statistics); Benchmark (surveying); Profitability index; Computer science; Set (abstract data type); Mathematical optimization; Stochastic modelling; Operations research; Mathematics; Economics; Finance","score_opus":0.023998235086841346,"score_gpt":0.26334454789435763,"score_spread":0.23934631280751628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384406331","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.0963943,0.0005696043,0.8952222,0.0006448593,0.00010629351,0.0002769472,0.0006453013,0.00037187486,0.0057685203],"genre_scores_gemma":[0.9412736,0.0003578415,0.050806306,0.00016261173,0.000051557658,0.00022500013,0.00046156746,0.00009303863,0.006568416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976578,0.00091950956,0.00008124121,0.00048848597,0.0003152378,0.0005376869],"domain_scores_gemma":[0.99705553,0.0018312195,0.00032527052,0.0002586007,0.00021198906,0.00031725358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033605145,0.0012607739,0.0030886184,0.0007330606,0.000888088,0.0022409032,0.0031850198,0.0023142607,0.008835157],"category_scores_gemma":[0.006291938,0.0010922133,0.00202993,0.0014444869,0.0011905375,0.0026523026,0.0017988862,0.0022243368,0.00062703807],"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.00004382722,0.00004198255,0.00024579346,0.00002718801,0.00001440771,0.000029916226,0.000019660054,0.9877165,0.00020103883,0.008381492,0.00042332927,0.002854809],"study_design_scores_gemma":[0.0000062597956,0.000023987326,0.00007605482,0.0000025177765,0.0000040792356,0.000010344435,0.000008325847,0.996172,0.00007737062,0.0034273467,0.00018666043,0.0000050761773],"about_ca_topic_score_codex":0.0121175265,"about_ca_topic_score_gemma":0.0065401914,"teacher_disagreement_score":0.0121175265,"about_ca_system_score_codex":0.002759132,"about_ca_system_score_gemma":0.002218312,"threshold_uncertainty_score":0.029556572},"labels":[],"label_agreement":null},{"id":"W4389738699","doi":"10.1002/net.22200","title":"Learning to repeatedly solve routing problems","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Focus (optics); Routing (electronic design automation); Optimization problem; Resolution (logic); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01633280587669093,"score_gpt":0.2509699629027951,"score_spread":0.2346371570261042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389738699","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.042576972,0.0011615705,0.9466876,0.001165072,0.00022824013,0.00023825812,0.00015685367,0.0011086664,0.006676722],"genre_scores_gemma":[0.45035392,0.0007413889,0.54095066,0.0007442938,0.00040493172,0.00093345525,0.0007809086,0.0003891877,0.0047011888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854374,0.0006364006,0.00009191893,0.0003303562,0.00021506447,0.0001825603],"domain_scores_gemma":[0.9929941,0.0057099084,0.00035126234,0.00037569203,0.00043986106,0.0001291683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024549447,0.002143799,0.0018663538,0.00083433825,0.0006107169,0.0010075927,0.0020150898,0.0020387706,0.0046733175],"category_scores_gemma":[0.011461507,0.00088948774,0.0013031134,0.0009466332,0.0011199351,0.0015032135,0.0015679896,0.0031479895,0.00076329627],"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.00006264238,0.00011324878,0.0009282597,0.0002024384,0.000069714944,0.00006675755,0.00006671719,0.93973,0.0004947449,0.008708715,0.0020710842,0.047485743],"study_design_scores_gemma":[0.000021519876,0.000032165375,0.000039483122,0.000012539032,0.0000076208366,0.000012604626,0.000013618119,0.99001265,0.00017079555,0.009094565,0.0005793438,0.0000030969104],"about_ca_topic_score_codex":0.0038826466,"about_ca_topic_score_gemma":0.005386961,"teacher_disagreement_score":0.0046733175,"about_ca_system_score_codex":0.001178333,"about_ca_system_score_gemma":0.0016661288,"threshold_uncertainty_score":0.015633881},"labels":[],"label_agreement":null},{"id":"W4392370783","doi":"10.1002/net.22215","title":"New approximations for network reliability","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reliability (semiconductor); Computer science; Mathematical optimization; Mathematics; Physics","score_opus":0.005889379222958262,"score_gpt":0.2123280333768972,"score_spread":0.20643865415393894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392370783","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.010045808,0.00039963707,0.9853093,0.00022472876,0.00008180208,0.000033215718,0.00006700367,0.00035536085,0.0034831713],"genre_scores_gemma":[0.6836165,0.0018122153,0.3033158,0.0003956851,0.00034171532,0.00041056864,0.00043236944,0.00055407686,0.009121059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975816,0.0008599718,0.000077705794,0.0003411437,0.0009128264,0.0002267173],"domain_scores_gemma":[0.987084,0.008263817,0.00093097397,0.0020555384,0.001424854,0.00024078925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040727537,0.0010511982,0.000960524,0.0021733544,0.0006316509,0.00144515,0.0027477138,0.0014868242,0.0032577128],"category_scores_gemma":[0.029649232,0.00068609294,0.001244979,0.0012732114,0.0020914306,0.003953931,0.0016584132,0.0037744935,0.0009405616],"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.00004991517,0.00003294029,0.00093820476,0.00006663342,0.000027972168,0.000085149644,0.00013868512,0.84990567,0.0015321398,0.1308493,0.0016615193,0.014711873],"study_design_scores_gemma":[0.000003962429,0.0000093844765,0.00013790836,0.000013499568,0.000004348342,0.000035318295,0.000010556827,0.9719775,0.0003548905,0.026328087,0.0011163432,0.000008309985],"about_ca_topic_score_codex":0.005112934,"about_ca_topic_score_gemma":0.0029328498,"teacher_disagreement_score":0.005112934,"about_ca_system_score_codex":0.0025442566,"about_ca_system_score_gemma":0.0011987557,"threshold_uncertainty_score":0.021539032},"labels":[],"label_agreement":null},{"id":"W4394711223","doi":"10.1002/net.22219","title":"Maximum flow‐based formulation for the optimal location of electric vehicle charging stations","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal; Hydro-Québec; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Institut de Valorisation des Données; Hydro-Québec","keywords":"Electric vehicle; Flow (mathematics); Environmental science; Power flow; Computer science; Automotive engineering; Electrical engineering; Mechanics; Engineering; Physics; Power (physics); Electric power system; Thermodynamics","score_opus":0.006574409685676398,"score_gpt":0.21445929984263717,"score_spread":0.20788489015696077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394711223","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.028799778,0.00093798555,0.941164,0.001469913,0.00022029938,0.0003776376,0.0011986285,0.00027071973,0.0255611],"genre_scores_gemma":[0.68410814,0.0007563277,0.2890074,0.0004871281,0.00020294383,0.001012631,0.0012817273,0.00023362433,0.022910047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928814,0.00036163157,0.000020554715,0.00009944252,0.0001008722,0.00012933448],"domain_scores_gemma":[0.99845004,0.0011725634,0.00009526348,0.000024178991,0.00018737349,0.00007061512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020532815,0.0014961411,0.0015782184,0.0011155179,0.0005312045,0.0021012803,0.0018895271,0.002257682,0.011949157],"category_scores_gemma":[0.0041669407,0.0013153978,0.0011778713,0.0014213226,0.0009935432,0.0012042852,0.0010827715,0.0018424637,0.0006709184],"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.000024554218,0.00002132756,0.000120133496,0.000046431058,0.00001172653,0.000035964375,0.000014985249,0.9903764,0.000118012416,0.005949615,0.0008398932,0.0024410046],"study_design_scores_gemma":[0.000009401666,0.00000924792,0.000034249515,0.000009488316,0.0000029676053,0.0000030856033,0.000011501016,0.99758005,0.00004108602,0.0019001707,0.0003961336,0.0000026256296],"about_ca_topic_score_codex":0.02517316,"about_ca_topic_score_gemma":0.022128984,"teacher_disagreement_score":0.02517316,"about_ca_system_score_codex":0.003224758,"about_ca_system_score_gemma":0.0029184294,"threshold_uncertainty_score":0.05005324},"labels":[],"label_agreement":null},{"id":"W4394846135","doi":"10.1002/net.22218","title":"A flow‐based ascending auction to compute buyer‐optimal Walrasian prices","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Walrasian auction; Valuation (finance); Mathematical economics; Economics; Market clearing; Matching (statistics); Generalization; Combinatorial auction; Microeconomics; Mathematical optimization; Vickrey auction; Common value auction; Mathematics; Auction theory; Finance","score_opus":0.06759753866968733,"score_gpt":0.3991526356420333,"score_spread":0.331555096972346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394846135","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.100986436,0.000097665026,0.8952912,0.00014181896,0.000036315225,0.00012273245,0.000116386735,0.00045234422,0.0027551106],"genre_scores_gemma":[0.5942911,0.0000863953,0.4032789,0.00005852704,0.000027554353,0.00014333296,0.00022489391,0.0000723538,0.0018169017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.0001404587,0.000023183415,0.00006531157,0.00009098053,0.00006917567],"domain_scores_gemma":[0.9982274,0.0011788437,0.00013689988,0.00010134298,0.0002502605,0.00010534535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682835,0.00064206467,0.0009325387,0.0012739507,0.00053085474,0.0012262674,0.0015057923,0.0009026259,0.0039662314],"category_scores_gemma":[0.005644718,0.0004785125,0.0005051481,0.00086173083,0.0006826993,0.0017528465,0.00068502343,0.00076963136,0.0003573256],"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.000125137,0.0001213485,0.0009878051,0.000042872747,0.000025201618,0.000034830577,0.000040195486,0.93612355,0.0008813968,0.021879528,0.00063779403,0.039100233],"study_design_scores_gemma":[0.000007977141,0.000009961295,0.00003518841,0.0000014218562,0.0000015716913,0.0000031357313,0.0000027345823,0.9947148,0.00013725855,0.00502071,0.00006380365,0.0000014405921],"about_ca_topic_score_codex":0.008047369,"about_ca_topic_score_gemma":0.006327851,"teacher_disagreement_score":0.008047369,"about_ca_system_score_codex":0.0016092063,"about_ca_system_score_gemma":0.0018824582,"threshold_uncertainty_score":0.016001046},"labels":[],"label_agreement":null},{"id":"W4395690405","doi":"10.1002/net.22222","title":"Network design with vulnerability constraints and probabilistic edge reliability","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backup; Enhanced Data Rates for GSM Evolution; Probabilistic logic; Reliability (semiconductor); Computer science; Path (computing); Mathematical optimization; Network planning and design; Mathematics; Computer network; Artificial intelligence","score_opus":0.010452731007824328,"score_gpt":0.20145504541877496,"score_spread":0.19100231441095064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395690405","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.15794007,0.0007408111,0.83264285,0.0009676107,0.00007657748,0.00015594714,0.0009667021,0.0002853337,0.0062240167],"genre_scores_gemma":[0.8561195,0.00039066188,0.14002982,0.00011247382,0.000047402205,0.00018693498,0.00067925063,0.00007904124,0.0023549995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986675,0.0006560006,0.00004916501,0.0002197658,0.0002451814,0.00016242481],"domain_scores_gemma":[0.99614906,0.002745332,0.0004363688,0.0002440731,0.00029785634,0.00012726705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017298161,0.0010107163,0.0008943336,0.0008616204,0.00038642166,0.0009481501,0.001151075,0.0010694569,0.0023297966],"category_scores_gemma":[0.006023816,0.0006438359,0.0007226742,0.0009828059,0.0007354961,0.0015527088,0.00081720593,0.001346463,0.0001492539],"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.000025204476,0.000014619416,0.00025749687,0.000033633878,0.000011039599,0.000032982807,0.000007347873,0.98950654,0.00025986592,0.004804527,0.0004696203,0.004577096],"study_design_scores_gemma":[0.000009997712,0.000023568695,0.0001520841,0.000007902825,0.000006566409,0.000035796118,0.0000097984785,0.9883052,0.00032615077,0.010562268,0.000556885,0.0000038000778],"about_ca_topic_score_codex":0.0042064264,"about_ca_topic_score_gemma":0.0038170153,"teacher_disagreement_score":0.0042064264,"about_ca_system_score_codex":0.0013016,"about_ca_system_score_gemma":0.0011411933,"threshold_uncertainty_score":0.0094438195},"labels":[],"label_agreement":null},{"id":"W4400739389","doi":"10.1002/net.22242","title":"Three network design problems for community energy storage","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science","score_opus":0.027192181879567113,"score_gpt":0.20845300647603787,"score_spread":0.18126082459647075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400739389","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.068043016,0.00085806,0.8980554,0.0021937927,0.00015004996,0.00029991867,0.00059916073,0.00018435526,0.02961628],"genre_scores_gemma":[0.86460143,0.00059563515,0.11368927,0.00025601973,0.00007022752,0.0005224651,0.00036802137,0.00013238477,0.019764515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00047069945,0.00002462715,0.00017329505,0.000109628505,0.00012736658],"domain_scores_gemma":[0.9984681,0.0010196462,0.00014463616,0.000056402085,0.00019260422,0.00011859123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018565685,0.0012594049,0.0009825545,0.0010337131,0.0010059634,0.0022918535,0.0015702688,0.0022036615,0.010416765],"category_scores_gemma":[0.0040540067,0.00078466855,0.0011514461,0.0011994666,0.0010159493,0.0025067853,0.0018177164,0.0017322963,0.00043311983],"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.00005864737,0.000051944517,0.0002756395,0.00006998377,0.00003524049,0.00009826261,0.000048780283,0.9213488,0.00033899615,0.068502665,0.0024079233,0.006763178],"study_design_scores_gemma":[0.000020037176,0.00002000672,0.00006484743,0.000012709224,0.0000073249234,0.000023561293,0.00003677603,0.9769976,0.00016258068,0.021274649,0.0013728981,0.0000069317325],"about_ca_topic_score_codex":0.007430099,"about_ca_topic_score_gemma":0.00666173,"teacher_disagreement_score":0.010416765,"about_ca_system_score_codex":0.0038478605,"about_ca_system_score_gemma":0.0017611646,"threshold_uncertainty_score":0.034847558},"labels":[],"label_agreement":null},{"id":"W4403556658","doi":"10.1002/net.22251","title":"Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Nonlinear system; Electric vehicle; Computer science; Graph; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science; Physics; Power (physics)","score_opus":0.015748927321926454,"score_gpt":0.23598880879591413,"score_spread":0.22023988147398768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403556658","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.03696146,0.00048161592,0.9523437,0.0007269496,0.00007872784,0.00013573689,0.000625396,0.00044676263,0.008199715],"genre_scores_gemma":[0.5902729,0.0013054097,0.39589703,0.00033830004,0.00010109598,0.00044523698,0.0015545158,0.00031344758,0.00977206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992743,0.0003234562,0.000030867126,0.00011047336,0.00014320685,0.00011777494],"domain_scores_gemma":[0.9982462,0.0011746183,0.00018636267,0.00009772927,0.00019263837,0.00010250069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037142,0.0015567325,0.0008358534,0.00094540056,0.00038963114,0.0019561874,0.001494436,0.0014679625,0.006285474],"category_scores_gemma":[0.0040135514,0.00071886205,0.0013197528,0.001387797,0.00074808183,0.002500136,0.0011696094,0.0018478631,0.00069257105],"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.000017364977,0.000023190285,0.000115265764,0.000034933768,0.000008650482,0.000036942372,0.0000215719,0.97715807,0.00021495127,0.017213168,0.00070375495,0.004452102],"study_design_scores_gemma":[0.0000064110754,0.000011007986,0.000039613322,0.000008222552,0.0000043205114,0.000010172038,0.000015215394,0.9874808,0.00007457102,0.01164785,0.0006982364,0.0000035319865],"about_ca_topic_score_codex":0.008750491,"about_ca_topic_score_gemma":0.010027889,"teacher_disagreement_score":0.008750491,"about_ca_system_score_codex":0.0023351603,"about_ca_system_score_gemma":0.001370204,"threshold_uncertainty_score":0.021027029},"labels":[],"label_agreement":null},{"id":"W4405402617","doi":"10.1002/net.22250","title":"The workforce scheduling and routing problem with park‐and‐loop","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Institut de Valorisation des Données","keywords":"Vehicle routing problem; Loop (graph theory); Workforce; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematics; Economics; Computer network; Combinatorics; Economic growth","score_opus":0.010000771375888149,"score_gpt":0.23543693567133323,"score_spread":0.22543616429544508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405402617","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.097588114,0.00022660634,0.88452476,0.0008233381,0.00010724705,0.00024474104,0.0005376378,0.00053260673,0.015414899],"genre_scores_gemma":[0.61019844,0.00020918835,0.37665147,0.00020577025,0.00007671227,0.00033076442,0.0006792414,0.0001777955,0.011470521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993363,0.00024198042,0.000026840138,0.00014464669,0.00011364976,0.00013663096],"domain_scores_gemma":[0.9991055,0.0005333638,0.000104249,0.00010051012,0.00006830573,0.00008796395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010256843,0.0005685998,0.00078709493,0.0004481778,0.0004597652,0.0010706104,0.0011395855,0.001030194,0.0072024977],"category_scores_gemma":[0.0025868667,0.00035805398,0.0007480219,0.00071031053,0.00052680785,0.0014323334,0.001102419,0.0010480159,0.0004864798],"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.00016617379,0.00023702245,0.0010258364,0.00022302836,0.000038592832,0.00025722853,0.00009634099,0.847695,0.0019943356,0.058641035,0.00803749,0.08158798],"study_design_scores_gemma":[0.00004875374,0.00012327624,0.00025385796,0.000015017633,0.000010930541,0.000115000585,0.0000772344,0.9570068,0.0011897079,0.03623064,0.0049183033,0.0000104097435],"about_ca_topic_score_codex":0.0027946609,"about_ca_topic_score_gemma":0.003014459,"teacher_disagreement_score":0.0072024977,"about_ca_system_score_codex":0.0007061024,"about_ca_system_score_gemma":0.0016778997,"threshold_uncertainty_score":0.02409476},"labels":[],"label_agreement":null},{"id":"W4407410747","doi":"10.1002/net.22266","title":"A Fix‐And‐Optimize Matheuristic to Solve the Location‐Allocation of Vaccination Facilities: Case of Jalisco, Mexico","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Consejo Estatal de Ciencia y Tecnología de Jalisco; Ministère des relations internationales et de la Francophonie","keywords":"Computer science; Facility location problem; Operations research; Business; Mathematics","score_opus":0.013452178515508784,"score_gpt":0.2412586130743741,"score_spread":0.22780643455886532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407410747","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.62770444,0.0014667992,0.28635624,0.005262972,0.0002480174,0.00084874785,0.0024494566,0.0005281215,0.0751352],"genre_scores_gemma":[0.85958046,0.00040378014,0.12986127,0.00023661318,0.000047245794,0.0004660783,0.0004654047,0.000050093375,0.008889091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995999,0.00019012281,0.000011578889,0.000050903454,0.000032067564,0.00011544615],"domain_scores_gemma":[0.9984145,0.0012314764,0.00011848934,0.000035204885,0.00012357964,0.000076686476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015207523,0.0009968983,0.0007036364,0.0010638564,0.0012301315,0.0014694828,0.0012341622,0.0020781998,0.007945786],"category_scores_gemma":[0.0029104273,0.0004236589,0.0008850444,0.00086543127,0.0007928069,0.0006394379,0.0011814322,0.0013281115,0.00021855399],"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.0000971448,0.00009244858,0.0019315619,0.00006950019,0.000029926541,0.0003062646,0.000040486513,0.98472136,0.00019097456,0.0066872905,0.0012905765,0.0045424704],"study_design_scores_gemma":[0.00005751348,0.00004427055,0.000557029,0.00001772171,0.000017632596,0.00002203045,0.00012761312,0.9963232,0.00012497322,0.0017419312,0.000960433,0.0000055362916],"about_ca_topic_score_codex":0.08160007,"about_ca_topic_score_gemma":0.07176468,"teacher_disagreement_score":0.08160007,"about_ca_system_score_codex":0.0026577688,"about_ca_system_score_gemma":0.0027784468,"threshold_uncertainty_score":0.16225022},"labels":[],"label_agreement":null},{"id":"W4410039291","doi":"10.1002/net.22281","title":"Picking Operations in Warehouses With Dynamically Arriving Orders: How Good is Reoptimization?","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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":"Polytechnique Montréal","funders":"Bayerische Forschungsallianz; Ministère des relations internationales et de la Francophonie","keywords":"Computer science; Operations research; Routing (electronic design automation); Order (exchange); Probabilistic logic; Order picking; Relevance (law); Warehouse; Online algorithm; Range (aeronautics); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Computer network; Engineering; Economics","score_opus":0.0033262532122975154,"score_gpt":0.19277352769621867,"score_spread":0.18944727448392115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410039291","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.24051902,0.002877253,0.74302816,0.0028016178,0.0002020324,0.00011241902,0.0001550554,0.00073049724,0.009573928],"genre_scores_gemma":[0.96494406,0.00044347602,0.033425797,0.00014878306,0.00006811602,0.00002922047,0.000057265654,0.000092498216,0.00079082465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981852,0.00084248657,0.00005758152,0.00030911376,0.00028246664,0.00032302356],"domain_scores_gemma":[0.9917128,0.0059873983,0.00088020676,0.0007352194,0.00041464416,0.0002697863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029060843,0.001099937,0.0011543235,0.00044177944,0.0005522815,0.0015407819,0.0016004293,0.0010873817,0.002067796],"category_scores_gemma":[0.012634392,0.0005454084,0.0005249382,0.0006535626,0.0011605102,0.0024135157,0.0010803142,0.0017074229,0.00029489188],"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.00019633176,0.00009288741,0.0010905464,0.0000558556,0.000037324065,0.00004536552,0.000027951019,0.9675405,0.0009447357,0.006622044,0.001124092,0.022222424],"study_design_scores_gemma":[0.00000871783,0.000051603794,0.00024144095,0.000010452938,0.000007910166,0.000017645163,0.000027071621,0.99456984,0.00044510714,0.0042954125,0.00031866197,0.000006159645],"about_ca_topic_score_codex":0.006147335,"about_ca_topic_score_gemma":0.0041748807,"teacher_disagreement_score":0.006147335,"about_ca_system_score_codex":0.0011536727,"about_ca_system_score_gemma":0.0014849338,"threshold_uncertainty_score":0.015368998},"labels":[],"label_agreement":null},{"id":"W4411283635","doi":"10.1002/net.22289","title":"Stability of Interdiction Strategies in Quickest Flow Networks","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"","keywords":"Interdiction; Stability (learning theory); Computer science; Flow (mathematics); Flow network; Mathematical optimization; Mathematics; Machine learning; Aerospace engineering; Engineering","score_opus":0.004136378578551629,"score_gpt":0.218740877443357,"score_spread":0.21460449886480537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411283635","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.5858165,0.00029587068,0.40572682,0.0004606845,0.000025443755,0.00014079618,0.00023679655,0.00016590525,0.0071312687],"genre_scores_gemma":[0.98858404,0.00008383755,0.010412162,0.000026760925,0.0000049128794,0.000039266786,0.000043523767,0.000016485481,0.0007889533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.00034067774,0.000032798376,0.00012941266,0.000114653696,0.00018625935],"domain_scores_gemma":[0.9886332,0.008279215,0.0015933528,0.00029820696,0.00067936257,0.00051671616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022271306,0.0007978278,0.00086109515,0.0017959405,0.00081589335,0.0012636562,0.0013027597,0.0010418196,0.0032692992],"category_scores_gemma":[0.013968368,0.0005254045,0.0005697612,0.00068763027,0.0017536276,0.0021007783,0.0012589223,0.0010125156,0.00014274906],"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.00015885166,0.000052566174,0.0015330564,0.00004090521,0.00005430364,0.000103193786,0.00012107984,0.9465154,0.0018103225,0.042031493,0.00041687678,0.0071619856],"study_design_scores_gemma":[0.000023483526,0.000076106364,0.0004203071,0.000012533736,0.0000111109475,0.00004444502,0.00007199019,0.96008134,0.0006606387,0.038338564,0.0002458792,0.0000136852195],"about_ca_topic_score_codex":0.005422436,"about_ca_topic_score_gemma":0.0027959703,"teacher_disagreement_score":0.005422436,"about_ca_system_score_codex":0.0015050797,"about_ca_system_score_gemma":0.0011734086,"threshold_uncertainty_score":0.011778295},"labels":[],"label_agreement":null},{"id":"W628055479","doi":"10.1002/net.21464","title":"Proximity graphs inside large weighted graphs","year":2012,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Chordal graph; Computer science; Maximal independent set; Indifference graph; Pathwidth; Modular decomposition; Combinatorics; 1-planar graph; Mathematics; Graph; Line graph","score_opus":0.019144565450619933,"score_gpt":0.2774915085623688,"score_spread":0.2583469431117489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W628055479","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.2121586,0.00030026174,0.7769011,0.000370497,0.00005417016,0.00011777543,0.00030987698,0.00029331152,0.0094944015],"genre_scores_gemma":[0.80163306,0.00027760357,0.19418834,0.00013416288,0.000081841405,0.00014910889,0.0003778327,0.000084071806,0.0030740092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985109,0.0004905654,0.00009195756,0.00043212884,0.00039111322,0.00008320526],"domain_scores_gemma":[0.99471056,0.003064042,0.00079437654,0.0005022479,0.0006227805,0.00030602468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826207,0.00038766843,0.00046747882,0.0026797443,0.000929861,0.0015073143,0.0008134945,0.0008325514,0.0031606774],"category_scores_gemma":[0.008145231,0.00037028547,0.00047919832,0.0021991816,0.0015900129,0.003447036,0.0019660082,0.0010763914,0.00030570428],"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.00010594874,0.00004248894,0.002204512,0.000185617,0.00004190192,0.00055719394,0.000742883,0.051683903,0.0059512346,0.89173913,0.0017020159,0.045043133],"study_design_scores_gemma":[0.000019074163,0.000047958478,0.001001724,0.000030595813,0.000023125918,0.00043818605,0.00022458543,0.12589034,0.0027040474,0.8632059,0.006395754,0.000018793298],"about_ca_topic_score_codex":0.00079229067,"about_ca_topic_score_gemma":0.00072684174,"teacher_disagreement_score":0.0031606774,"about_ca_system_score_codex":0.00071421074,"about_ca_system_score_gemma":0.0002167686,"threshold_uncertainty_score":0.010573566},"labels":[],"label_agreement":null},{"id":"W7117764697","doi":"10.1002/net.70024","title":"Partial‐Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands","year":2025,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"China Scholarship Council","keywords":"Vehicle routing problem; Routing (electronic design automation); Markov decision process; Heuristic; Stochastic programming; Markov chain; Markov process; Static routing","score_opus":0.014630117411430988,"score_gpt":0.25702623743899644,"score_spread":0.24239612002756544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117764697","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.14734717,0.00038080945,0.8402715,0.00059343514,0.000050738992,0.00019249452,0.00021545558,0.00023994171,0.010708521],"genre_scores_gemma":[0.9347208,0.00027499232,0.061589163,0.00007963084,0.000021421314,0.0001071125,0.00013633088,0.000052582396,0.0030178993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.00026010597,0.000023775714,0.0000635656,0.00010527368,0.00012974768],"domain_scores_gemma":[0.99897003,0.0005724676,0.00011345014,0.00009420967,0.000117905816,0.0001319313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013975725,0.0008665175,0.0011453753,0.0003660486,0.00036814628,0.0008408869,0.0011315768,0.0007127778,0.0036689355],"category_scores_gemma":[0.0020767683,0.00039465853,0.0007258644,0.00057124026,0.0005728809,0.0009916485,0.0009268987,0.00092735403,0.00023496909],"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.000054459106,0.000032866712,0.00023512304,0.00004099776,0.000014511844,0.00005325573,0.000025000149,0.98144364,0.00052309287,0.00862986,0.00044469448,0.008502482],"study_design_scores_gemma":[0.0000065718,0.00002577227,0.000063045765,0.000003900706,0.0000035668054,0.000009744406,0.000014636933,0.9969627,0.00022285957,0.0024844846,0.00020039397,0.0000023135437],"about_ca_topic_score_codex":0.0077473614,"about_ca_topic_score_gemma":0.0045628077,"teacher_disagreement_score":0.0077473614,"about_ca_system_score_codex":0.0012086907,"about_ca_system_score_gemma":0.0014812901,"threshold_uncertainty_score":0.015404522},"labels":[],"label_agreement":null},{"id":"W94179444","doi":"10.1002/net.10092","title":"A linear algorithm for compact box‐drawings of trees","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tree (set theory); Node (physics); Algorithm; Combinatorics; Computer science; Mathematics; Discrete mathematics; Engineering","score_opus":0.01584166116086022,"score_gpt":0.25901036155948726,"score_spread":0.24316870039862704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94179444","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.015956467,0.00046166344,0.97617173,0.0001306177,0.000036940997,0.00015849015,0.00026659685,0.0038763527,0.002941007],"genre_scores_gemma":[0.07641503,0.0002872603,0.91888916,0.00004769361,0.000028112707,0.00026139917,0.0010407992,0.00031818677,0.002712327],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991447,0.00017026454,0.000068572226,0.00016935443,0.00033851137,0.00010858962],"domain_scores_gemma":[0.99818736,0.0010146406,0.0001497011,0.00034520862,0.0002343467,0.00006872803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065476994,0.00091051316,0.0010926957,0.0014698207,0.0005373514,0.0011228807,0.0014636891,0.00087888195,0.01199491],"category_scores_gemma":[0.003694441,0.0006356836,0.00066235365,0.002293911,0.0005921168,0.0029995022,0.0019579867,0.0009206377,0.002548795],"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.00043052773,0.00012755439,0.00051309506,0.00034697144,0.00004131145,0.00017138166,0.0003147361,0.0783677,0.012633729,0.04002879,0.018898265,0.8481259],"study_design_scores_gemma":[0.00024950097,0.00018247894,0.00034569175,0.00006968143,0.000033455846,0.00041287343,0.00016741823,0.8937962,0.014391629,0.06791893,0.022394802,0.000037290705],"about_ca_topic_score_codex":0.0017048809,"about_ca_topic_score_gemma":0.002379759,"teacher_disagreement_score":0.01199491,"about_ca_system_score_codex":0.0007207793,"about_ca_system_score_gemma":0.00065836293,"threshold_uncertainty_score":0.04012692},"labels":[],"label_agreement":null}]}