{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"0be8ec26654a","filters":{"venue":"Operations research, computer science. Interface series"}},"results":[{"id":"W1847516220","doi":"10.1007/978-0-387-77778-8_15","title":"Recent Models and Algorithms for One-to-One Pickup and Delivery Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Pickup; Set (abstract data type); Heuristic; Computer science; Algorithm; Mathematical optimization; Order (exchange); Operations research; Engineering; Mathematics; Artificial intelligence; Business; Programming language","authors":[{"name":"Jean-Françcois Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true},{"name":"Stefan Røpke","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1458700136049364,"gpt":0.3417906010138803,"spread":0.1959205874089439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658365,0.002653868,0.002447729,0.001200609,0.0009920936,0.003147557,0.006384078,0.002933075,0.01052188],"category_scores_gemma":[0.004100342,0.001102858,0.00245264,0.003930401,0.001745377,0.005503008,0.001960922,0.005079782,0.004226226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002311608,"about_ca_system_score_gemma":0.001816895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003145176,"about_ca_topic_score_gemma":0.003536743,"domain_scores_codex":[0.998806,0.0003284304,0.00005619531,0.0002279325,0.0004485567,0.0001329677],"domain_scores_gemma":[0.9984372,0.0009442953,0.0001285873,0.0001894827,0.0002236119,0.00007684276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006311722,0.0001422673,0.0001952775,0.0005092372,0.00006579465,0.00006942425,0.0000902307,0.3117316,0.0004595187,0.539259,0.02301961,0.1243949],"study_design_scores_gemma":[0.00002484381,0.00003972464,0.00008821789,0.00006366228,0.00003744615,0.0001355379,0.00003236445,0.5649421,0.0002730327,0.4094675,0.02487263,0.00002296831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.002566701,0.01384171,0.9616416,0.001077896,0.0005254343,0.00006468949,0.0001824227,0.0002937898,0.01980581],"genre_scores_gemma":[0.1785182,0.07389207,0.6630845,0.00103304,0.002477579,0.0008424852,0.001822324,0.0005787285,0.07775102],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01052188,"threshold_uncertainty_score":0.03519922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163715979","doi":"10.1007/978-0-387-77778-8_8","title":"Parallel Solution Methods for Vehicle Routing Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Heuristic; Pace; Computer science; Metaheuristic; Mathematical optimization; Routing (electronic design automation); Field (mathematics); Combinatorial optimization; Algorithm; Mathematics; Geography; Computer network","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09522652726484755,"gpt":0.3867614583324927,"spread":0.2915349310676452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007823626,0.001298445,0.001002583,0.0006939602,0.0005465952,0.0009903159,0.001386222,0.0009808326,0.008478667],"category_scores_gemma":[0.002391931,0.0005725534,0.0009131721,0.001390032,0.0007183032,0.001172092,0.001321024,0.001949606,0.002940669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000684873,"about_ca_system_score_gemma":0.0009660734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003087936,"about_ca_topic_score_gemma":0.00314128,"domain_scores_codex":[0.99944,0.0001681054,0.00002637188,0.00006499796,0.0002623445,0.00003814629],"domain_scores_gemma":[0.9994741,0.0002423651,0.00003315717,0.00008194411,0.0001493946,0.00001909426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007862585,0.0001054171,0.0002341899,0.0004383999,0.00008315306,0.00008136142,0.0001050621,0.4268484,0.002155598,0.2200186,0.03067646,0.3191749],"study_design_scores_gemma":[0.00004139666,0.00002074138,0.00008436861,0.00004052001,0.00001671605,0.00005185263,0.00002133142,0.7839109,0.0007832094,0.1857877,0.02923208,0.000009235716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001578098,0.002329558,0.9783876,0.0003322658,0.0003418254,0.00004293648,0.00007069239,0.0003022721,0.01661483],"genre_scores_gemma":[0.113347,0.008019703,0.822478,0.0003547918,0.0008695091,0.0007399386,0.0005163245,0.0008155373,0.05285913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008478667,"threshold_uncertainty_score":0.028364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W117190991","doi":"10.1007/978-0-387-77778-8_16","title":"One-to-Many-to-One Single Vehicle Pickup and Delivery Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Pickup; Computer science; Artificial intelligence","authors":[{"name":"Irina Gribkovskaia","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0818470942801059,"gpt":0.3078218029519631,"spread":0.2259747086718572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727422,0.00219359,0.003873777,0.0009438184,0.001565253,0.003124948,0.005035043,0.003817196,0.01917512],"category_scores_gemma":[0.004346045,0.0009776517,0.00280533,0.002544191,0.001713695,0.00486526,0.002867253,0.003113661,0.002429466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485502,"about_ca_system_score_gemma":0.00153573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001582808,"about_ca_topic_score_gemma":0.001787696,"domain_scores_codex":[0.9986073,0.0004014589,0.00007942888,0.0003639062,0.0003096473,0.0002383243],"domain_scores_gemma":[0.9980347,0.001323911,0.0001564923,0.0001713125,0.0001783201,0.0001352766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002655443,0.0002453698,0.0004455535,0.001179338,0.0002222635,0.0004822974,0.0001831492,0.4142812,0.001239169,0.3928008,0.03026453,0.1583907],"study_design_scores_gemma":[0.00008162191,0.0001282498,0.0002210544,0.0000636706,0.00006523747,0.0003430566,0.00008212028,0.6527712,0.0008247854,0.3334811,0.01189549,0.00004230094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02908721,0.005389752,0.9095117,0.002043993,0.001037508,0.0003015971,0.0006763168,0.0003856953,0.0515662],"genre_scores_gemma":[0.4469965,0.01160984,0.3553532,0.0009371931,0.001625227,0.0007670426,0.001626878,0.0004388914,0.1806452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01917512,"threshold_uncertainty_score":0.06414711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W130931946","doi":"10.1007/978-1-4615-1507-4_16","title":"Recent Advances in Tabu Search","year":2002,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Focus (optics); Computer science; Field (mathematics); Hill climbing; Artificial intelligence; Mathematics; Physics","authors":[{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07058871474709118,"gpt":0.3526118933868006,"spread":0.2820231786397094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003721417,0.001289254,0.002906293,0.005080382,0.0009764889,0.004178212,0.003703363,0.001588272,0.02713589],"category_scores_gemma":[0.01610247,0.00086084,0.001183973,0.02122301,0.001584215,0.006448261,0.001844727,0.00232538,0.01213105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002028876,"about_ca_system_score_gemma":0.003051594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005022422,"about_ca_topic_score_gemma":0.004671318,"domain_scores_codex":[0.9963351,0.001339244,0.0002321099,0.0005480865,0.001326364,0.0002190473],"domain_scores_gemma":[0.992074,0.005050564,0.000367148,0.0009661713,0.001351057,0.0001910357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000194298,0.0001055896,0.0005530968,0.002034505,0.00007374532,0.00002437584,0.00007083278,0.007569348,0.0003943316,0.04288146,0.04531183,0.9007866],"study_design_scores_gemma":[0.0001833785,0.0003134083,0.001724981,0.0016533,0.000291393,0.0009909137,0.0002345555,0.1306635,0.002777042,0.2187944,0.6422328,0.0001403345],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.005121503,0.6947418,0.2353345,0.003798986,0.003160042,0.0001541195,0.001136899,0.0036124,0.05293973],"genre_scores_gemma":[0.07139518,0.3716766,0.5030908,0.003308069,0.007447483,0.0004294142,0.005009834,0.001959317,0.03568339],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.02713589,"threshold_uncertainty_score":0.09077853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1539384798","doi":"10.1007/978-1-4615-1507-4_26","title":"Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem","year":2002,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Travelling salesman problem; Iterated function; Iterated local search; Computer science; Mathematical optimization; Local search (optimization); Mathematics; Algorithm","authors":[{"name":"Thomas Stützle","is_ca":false},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06213274038974058,"gpt":0.3305188659932833,"spread":0.2683861256035427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061793,0.0005721658,0.0008720999,0.0008635025,0.0004749065,0.001084246,0.001459109,0.001056838,0.003428147],"category_scores_gemma":[0.01524052,0.0004686244,0.0008410757,0.0009343285,0.001256156,0.00214573,0.0008140632,0.001622,0.0003172921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118401,"about_ca_system_score_gemma":0.001034216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009314856,"about_ca_topic_score_gemma":0.005431153,"domain_scores_codex":[0.9994006,0.0002869203,0.00002380821,0.00006418417,0.0001192905,0.0001052463],"domain_scores_gemma":[0.9903923,0.00822259,0.000572324,0.0002651048,0.0003791392,0.0001684865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001545156,0.0001056557,0.002543193,0.0001453519,0.0000909087,0.0002021392,0.0003473373,0.9059404,0.00265038,0.06814609,0.001482675,0.0181914],"study_design_scores_gemma":[0.000008907342,0.00001918703,0.0004494341,0.000006248614,0.00001060939,0.00001550178,0.00002888402,0.9847826,0.0002385203,0.01426935,0.0001638527,0.000006948181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6378053,0.002478218,0.3372469,0.001034264,0.0000765943,0.00006963265,0.00009325496,0.0005380555,0.02065779],"genre_scores_gemma":[0.96574,0.0004520243,0.02889613,0.00004908397,0.00003183254,0.00005510328,0.00009475639,0.00020593,0.004475056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009314856,"threshold_uncertainty_score":0.01852131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182693413","doi":"10.1007/978-3-319-23350-5_3","title":"Iterated Great Deluge for the Dynamic Facility Layout Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Iterated local search; Mathematical optimization; Heuristic; Iterated function; Computer science; Local optimum; Context (archaeology); Set (abstract data type); Algorithm; Local search (optimization); Mathematics; Geography","authors":[{"name":"Nabil Nahas","is_ca":false},{"name":"Mustapha Nourelfath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06832218908027715,"gpt":0.3317030851019379,"spread":0.2633808960216607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363844,0.001084254,0.001066552,0.000903631,0.0009317891,0.001578085,0.001289573,0.001144447,0.007040203],"category_scores_gemma":[0.004012362,0.0004805844,0.001384675,0.0007547699,0.002243485,0.001801001,0.001878397,0.002945811,0.0008531392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001795394,"about_ca_system_score_gemma":0.0009374231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002594321,"about_ca_topic_score_gemma":0.00280246,"domain_scores_codex":[0.9995977,0.0001629609,0.00001279836,0.0000508767,0.0001233743,0.00005234178],"domain_scores_gemma":[0.9989526,0.0006609748,0.00008046866,0.00008364824,0.00009587264,0.0001263222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005040714,0.00002965836,0.0003154439,0.0001566672,0.00004856895,0.0001352313,0.0001609177,0.1324188,0.0007178446,0.8301712,0.01139355,0.0244018],"study_design_scores_gemma":[0.00002685963,0.00003766501,0.0002094524,0.00004369613,0.00001422328,0.00009256966,0.00004501137,0.2746894,0.0001883556,0.7158349,0.008795503,0.00002239848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05399036,0.005388581,0.8248843,0.002631138,0.0004781583,0.00006889891,0.0001764825,0.0003123491,0.1120698],"genre_scores_gemma":[0.7275093,0.005680301,0.1776171,0.0005611214,0.0008126001,0.0003972516,0.00052198,0.0004222541,0.08647808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007040203,"threshold_uncertainty_score":0.02355182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1520016084","doi":"10.1007/978-1-4757-3762-2_15","title":"Delay-Constrained Multi-Ring Construction for Ordered Multipoint-to-Multipoint Communications","year":2003,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multicast; Computer science; Heuristic; Ring (chemistry); Topology (electrical circuits); Ring network; Backbone network; Bandwidth (computing); The Internet; Distributed computing; Computer network; Network topology; Mathematics; Combinatorics; Artificial intelligence","authors":[{"name":"Yassine Boujelben","is_ca":true},{"name":"A. Girard","is_ca":true},{"name":"Jean‐Charles Grégoire","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06580477101667606,"gpt":0.3359582413096712,"spread":0.2701534702929951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004197545,0.0003310185,0.0003337866,0.0004144028,0.0005110567,0.0005807896,0.0009684187,0.0002969803,0.004034064],"category_scores_gemma":[0.0007188055,0.0002345776,0.0003079374,0.0004856343,0.000440012,0.001203195,0.001005715,0.0008653945,0.000963758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004833008,"about_ca_system_score_gemma":0.000510847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002641111,"about_ca_topic_score_gemma":0.0005634873,"domain_scores_codex":[0.999739,0.00006080261,0.00001505768,0.00003818838,0.0001076302,0.00003935982],"domain_scores_gemma":[0.9996865,0.00008135363,0.00002811936,0.0001123525,0.0000663944,0.00002535234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000265603,0.0001108119,0.000337535,0.0003626475,0.0000296377,0.0002241716,0.0001959307,0.0865302,0.04952742,0.6183477,0.01207321,0.2319951],"study_design_scores_gemma":[0.00006077295,0.0002507551,0.000411737,0.0000798479,0.00003639656,0.0006874961,0.00008650636,0.4566197,0.04290704,0.4402626,0.05852819,0.00006887726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01550517,0.0004890232,0.9679304,0.000133334,0.0001133172,0.00006057286,0.00008688319,0.0003402367,0.01534103],"genre_scores_gemma":[0.3855962,0.0008226717,0.5963284,0.00008924695,0.0001101001,0.0001436356,0.0002740357,0.0001395085,0.01649616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004034064,"threshold_uncertainty_score":0.01349533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}