{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001342789,0.0003156076,0.000389102,0.0007415664,0.0009874646,0.0009123167,0.0005226707,0.0001747231,0.00005567791],"category_scores_gemma":[0.00007605644,0.0003368001,0.000035678,0.0003153387,0.000989623,0.001082844,0.0006855752,0.0004937113,0.00001218756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002334592,"about_ca_system_score_gemma":0.0002762492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001839686,"about_ca_topic_score_gemma":0.00008074629,"domain_scores_codex":[0.9974774,0.00005976816,0.0004332228,0.0007679598,0.0007002323,0.0005613861],"domain_scores_gemma":[0.9977645,0.000143263,0.00002574656,0.0004734524,0.001282705,0.0003102922],"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.00001182683,0.00001532956,4.969133e-7,0.0001012735,0.00004575223,0.000001512433,0.002324409,0.8992146,0.0007078204,0.004478829,0.001633423,0.09146471],"study_design_scores_gemma":[0.0001981193,0.0003326129,0.000004219251,0.0003018781,0.000008439699,0.00003155172,0.00002825747,0.9655399,0.001575964,0.00126491,0.03034318,0.0003709214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005957263,0.001666941,0.982375,0.0007530224,0.0003465148,0.001559861,0.00007118194,0.0002004232,0.01243136],"genre_scores_gemma":[0.002222963,0.01520311,0.9500136,0.00006072741,0.0002276644,0.0001607957,0.00001834251,0.0001068362,0.03198596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09109379,"threshold_uncertainty_score":0.9999084,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004359167,0.0004437686,0.000482993,0.0008233692,0.002010583,0.0009680434,0.001172722,0.0003038526,0.0001643855],"category_scores_gemma":[0.0002929831,0.000457462,0.0001467066,0.0005183215,0.001372931,0.00129007,0.0006082579,0.0009376722,0.00006906545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005924839,"about_ca_system_score_gemma":0.0005179167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002379541,"about_ca_topic_score_gemma":0.00005325733,"domain_scores_codex":[0.9964548,0.0002157454,0.0007278514,0.0008714874,0.0007739412,0.0009561168],"domain_scores_gemma":[0.997014,0.0003291285,0.00005993698,0.0008003709,0.001558283,0.0002383154],"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.000009042606,0.00001326151,7.91578e-7,0.00008089087,0.00004686989,0.000001611889,0.001596285,0.9364902,0.003804912,0.0103957,0.004583756,0.04297664],"study_design_scores_gemma":[0.0001991139,0.0002112284,0.000003879859,0.0002155064,0.000009352657,0.00003608301,0.00002821834,0.9271575,0.004899511,0.0007691936,0.06602523,0.0004452464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004493205,0.0006442844,0.9587561,0.0004161388,0.0009648724,0.001294604,0.0000267936,0.0004893215,0.0373629],"genre_scores_gemma":[0.001596964,0.0005688996,0.908388,0.00002391369,0.0003581105,0.0001681429,0.00002483194,0.0001284027,0.08874279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06144147,"threshold_uncertainty_score":0.9997877,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001166972,0.0003772489,0.0004349139,0.001233974,0.001105506,0.00127388,0.001009146,0.0001956116,0.0002148444],"category_scores_gemma":[0.0001245587,0.0004346824,0.00005342804,0.0007366241,0.0009980447,0.001032305,0.001216161,0.0007637337,0.0003103136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004538721,"about_ca_system_score_gemma":0.0002982045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005462444,"about_ca_topic_score_gemma":0.0002122993,"domain_scores_codex":[0.9965361,0.00009267993,0.0005323051,0.000906412,0.001156243,0.000776296],"domain_scores_gemma":[0.9973897,0.0001184876,0.00002717941,0.0007939542,0.001160412,0.0005102293],"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.00001329672,0.00004230843,0.000004742061,0.00008458181,0.00005253607,0.000007036106,0.0040376,0.9422831,0.02058446,0.002806276,0.00354951,0.02653458],"study_design_scores_gemma":[0.0003081138,0.001193424,0.0001232472,0.001042828,0.00001659081,0.00006082921,0.00006474413,0.9016399,0.02623736,0.0003966124,0.06776901,0.001147344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01343336,0.0006965609,0.900299,0.001559524,0.0008860768,0.002041002,0.00006419557,0.0006973674,0.08032291],"genre_scores_gemma":[0.0885639,0.0009159908,0.8017303,0.0002262997,0.0005219214,0.000127809,0.00001720291,0.0002300518,0.1076665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09856869,"threshold_uncertainty_score":0.9998105,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003195598,0.0004753377,0.0005747213,0.002667745,0.001334718,0.003454703,0.005905786,0.0002037466,0.001246219],"category_scores_gemma":[0.000142102,0.0004335908,0.0001201777,0.002114982,0.002201885,0.005929175,0.003836223,0.001506526,0.0008956005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005405701,"about_ca_system_score_gemma":0.001047944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006470268,"about_ca_topic_score_gemma":0.0007609226,"domain_scores_codex":[0.9933782,0.0002238397,0.0007478735,0.001930188,0.002523642,0.001196216],"domain_scores_gemma":[0.9955798,0.0001642405,0.00006601163,0.002227498,0.001595742,0.0003667385],"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.00001385869,0.0001555268,0.00001529062,0.00005392542,0.0000486275,0.0001567691,0.003486058,0.03262949,0.0002209781,0.3048886,0.01208904,0.6462418],"study_design_scores_gemma":[0.0001707018,0.0004091936,0.00001462054,0.0003756449,0.000004607826,0.00005324701,0.0000839166,0.3910233,0.001059623,0.001918746,0.6043121,0.0005741983],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002758111,0.01547569,0.4177156,0.01057429,0.001992477,0.001212948,0.0001117964,0.000425363,0.552216],"genre_scores_gemma":[0.009248008,0.0621475,0.1616708,0.0002598437,0.000705166,0.0001082975,0.00005279079,0.0001007308,0.7657069],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6456677,"threshold_uncertainty_score":0.9999654,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004084588,0.0003410016,0.0003943961,0.0006485907,0.001772329,0.001198717,0.001683798,0.0001752513,0.0003989901],"category_scores_gemma":[0.00004678392,0.0002323451,0.0001510222,0.0008204658,0.002515129,0.0005678675,0.0004156676,0.0009964393,0.00003976064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002583013,"about_ca_system_score_gemma":0.0002929046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003672326,"about_ca_topic_score_gemma":0.00005209104,"domain_scores_codex":[0.9968187,0.0001869884,0.0006855745,0.0005552303,0.001105086,0.0006484399],"domain_scores_gemma":[0.9966319,0.0005490782,0.00005421523,0.0008686438,0.001777688,0.0001185128],"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.000007638613,0.00001173941,0.000001676357,0.00004784526,0.0000805549,0.000001437289,0.002259935,0.9811593,0.001404021,0.005015536,0.0005757258,0.009434546],"study_design_scores_gemma":[0.0001110643,0.0001524368,0.000007206394,0.000231908,0.00003532755,0.0000195308,0.0001474155,0.9842674,0.01242307,0.0001235426,0.002243559,0.0002375123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006215576,0.0003567222,0.9852114,0.0007285964,0.0002433787,0.001312634,0.00005988282,0.0001332962,0.01133249],"genre_scores_gemma":[0.2882447,0.0007566289,0.4665304,0.00005483348,0.0007682516,0.0002270584,0.00007407559,0.0003455681,0.2429985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.518681,"threshold_uncertainty_score":0.9998381,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001018395,0.0003371759,0.0002690046,0.000333941,0.001114668,0.001016512,0.0009474371,0.0001601412,0.0001584883],"category_scores_gemma":[0.00009053358,0.0002526843,0.00006497181,0.0002045799,0.001266444,0.0007531703,0.0003705278,0.0006379812,0.00007800969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005003854,"about_ca_system_score_gemma":0.0003209122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002393737,"about_ca_topic_score_gemma":0.0004286492,"domain_scores_codex":[0.9978409,0.00003064919,0.000367422,0.0005632643,0.0006561586,0.0005415924],"domain_scores_gemma":[0.9973969,0.0001349347,0.00002746495,0.0007145168,0.001573424,0.0001527681],"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.00001381874,0.000005582891,1.438222e-7,0.00005046085,0.00003127403,0.000001522321,0.0004550841,0.9796152,0.00004355696,0.008184648,0.005212714,0.006386036],"study_design_scores_gemma":[0.0001270263,0.0001782547,0.000002059227,0.0000792971,0.00001139792,0.00001213984,0.00003736622,0.8823739,0.0004573726,0.004102583,0.1123307,0.0002879648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00004258924,0.0005984707,0.9745823,0.0003743289,0.0007097742,0.001264098,0.000329419,0.0002905177,0.02180847],"genre_scores_gemma":[0.1221766,0.0007589762,0.2164185,0.00005565862,0.0004297506,0.0005412382,0.0004934482,0.0001847891,0.658941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7581638,"threshold_uncertainty_score":0.9999925,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0009265923,0.0005628169,0.0005513579,0.001131375,0.001672121,0.000819566,0.002254374,0.0003690098,0.0001042719],"category_scores_gemma":[0.0004896446,0.0005810955,0.0001372192,0.0006483011,0.004662042,0.001044768,0.001302326,0.001324713,0.0001212414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006933305,"about_ca_system_score_gemma":0.0002792982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001310377,"about_ca_topic_score_gemma":0.0006425589,"domain_scores_codex":[0.996544,0.00005504984,0.0007980366,0.0009335246,0.0006430704,0.001026325],"domain_scores_gemma":[0.9956499,0.0003336933,0.00005201282,0.001991055,0.001664975,0.0003083487],"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.00003653649,0.00006466179,0.000001916676,0.0001243651,0.0001562256,0.000007627255,0.0008128438,0.6685574,0.005499686,0.2390712,0.002689414,0.08297811],"study_design_scores_gemma":[0.0004959579,0.000320408,0.000002636024,0.0003973236,0.00001590521,0.0000822521,0.0003077482,0.9046143,0.004995456,0.003195582,0.08482714,0.0007452825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002562318,0.0004543803,0.9759456,0.001563014,0.000990499,0.002960115,0.0001538333,0.0009638446,0.0167125],"genre_scores_gemma":[0.008717466,0.0005071852,0.97514,0.00005650856,0.0001084251,0.0005514151,0.00003544478,0.0001280942,0.01475548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2360569,"threshold_uncertainty_score":0.9996641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}