{"meta":{"query_hash":"0be8ec26654a","filters":{"venue":"Operations research, computer science. Interface series"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/0be8ec26654a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operations+research%2C+computer+science.+Interface+series"},"results":[{"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,"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; Norges Forskningsråd","keywords":"Pickup; Computer science; Artificial intelligence","score_opus":0.0818470942801059,"score_gpt":0.3078218029519631,"score_spread":0.2259747086718572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117190991","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.029087208,0.005389752,0.9095117,0.0020439932,0.0010375082,0.00030159712,0.00067631685,0.00038569525,0.0515662],"genre_scores_gemma":[0.44699648,0.011609838,0.35535324,0.00093719305,0.0016252267,0.0007670426,0.0016268783,0.00043889138,0.1806452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860734,0.00040145888,0.00007942888,0.00036390623,0.0003096473,0.00023832427],"domain_scores_gemma":[0.99803466,0.0013239112,0.00015649233,0.00017131254,0.0001783201,0.00013527663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017274217,0.0021935897,0.0038737769,0.00094381836,0.0015652529,0.0031249481,0.005035043,0.0038171962,0.019175116],"category_scores_gemma":[0.004346045,0.0009776517,0.0028053296,0.0025441914,0.001713695,0.0048652603,0.0028672528,0.0031136612,0.0024294655],"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.0002655443,0.0002453698,0.00044555354,0.0011793377,0.00022226352,0.00048229742,0.00018314921,0.41428122,0.0012391687,0.39280078,0.03026453,0.15839075],"study_design_scores_gemma":[0.00008162191,0.00012824983,0.00022105443,0.000063670595,0.000065237466,0.00034305663,0.000082120285,0.65277123,0.00082478544,0.3334811,0.011895495,0.000042300937],"about_ca_topic_score_codex":0.0015828083,"about_ca_topic_score_gemma":0.0017876958,"teacher_disagreement_score":0.019175116,"about_ca_system_score_codex":0.0014855016,"about_ca_system_score_gemma":0.0015357301,"threshold_uncertainty_score":0.064147115},"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,"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":"Tabu search; Guided Local Search; Focus (optics); Computer science; Field (mathematics); Hill climbing; Artificial intelligence; Mathematics; Physics","score_opus":0.07058871474709118,"score_gpt":0.3526118933868006,"score_spread":0.28202317863970944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130931946","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.005121503,0.69474185,0.23533455,0.003798986,0.0031600422,0.00015411945,0.0011368995,0.0036124005,0.05293973],"genre_scores_gemma":[0.07139518,0.37167656,0.5030908,0.003308069,0.007447483,0.00042941415,0.0050098337,0.0019593174,0.03568339],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99633515,0.0013392443,0.00023210992,0.0005480865,0.0013263641,0.0002190473],"domain_scores_gemma":[0.992074,0.0050505637,0.00036714802,0.0009661713,0.0013510571,0.00019103565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037214167,0.001289254,0.002906293,0.005080382,0.0009764889,0.0041782125,0.0037033625,0.0015882719,0.027135892],"category_scores_gemma":[0.016102474,0.00086083997,0.0011839726,0.021223012,0.0015842151,0.006448261,0.0018447267,0.0023253805,0.012131046],"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.00019429803,0.00010558956,0.00055309676,0.0020345054,0.000073745316,0.000024375839,0.00007083278,0.0075693475,0.0003943316,0.042881455,0.045311835,0.90078664],"study_design_scores_gemma":[0.00018337849,0.0003134083,0.0017249807,0.0016533004,0.00029139296,0.0009909137,0.00023455551,0.13066347,0.002777042,0.21879438,0.64223284,0.00014033445],"about_ca_topic_score_codex":0.0050224224,"about_ca_topic_score_gemma":0.0046713175,"teacher_disagreement_score":0.027135892,"about_ca_system_score_codex":0.0020288755,"about_ca_system_score_gemma":0.0030515941,"threshold_uncertainty_score":0.09077853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06580477101667606,"score_gpt":0.33595824130967117,"score_spread":0.2701534702929951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520016084","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.015505166,0.00048902316,0.96793044,0.00013333396,0.00011331715,0.000060572856,0.00008688319,0.00034023673,0.015341032],"genre_scores_gemma":[0.38559622,0.00082267175,0.59632844,0.000089246954,0.000110100125,0.00014363558,0.00027403567,0.00013950851,0.016496163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999739,0.000060802606,0.0000150576825,0.00003818838,0.00010763021,0.000039359824],"domain_scores_gemma":[0.9996865,0.00008135363,0.000028119355,0.00011235252,0.0000663944,0.000025352338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041975453,0.0003310185,0.0003337866,0.0004144028,0.0005110567,0.0005807896,0.0009684187,0.00029698032,0.004034064],"category_scores_gemma":[0.00071880553,0.00023457759,0.0003079374,0.00048563426,0.00044001197,0.0012031954,0.0010057152,0.0008653945,0.00096375804],"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.000265603,0.000110811874,0.00033753502,0.0003626475,0.000029637702,0.00022417161,0.00019593073,0.0865302,0.049527418,0.6183477,0.012073209,0.2319951],"study_design_scores_gemma":[0.00006077295,0.00025075514,0.00041173698,0.0000798479,0.000036396563,0.0006874961,0.000086506356,0.45661974,0.042907037,0.44026262,0.05852819,0.000068877256],"about_ca_topic_score_codex":0.00026411115,"about_ca_topic_score_gemma":0.0005634873,"teacher_disagreement_score":0.004034064,"about_ca_system_score_codex":0.00048330077,"about_ca_system_score_gemma":0.000510847,"threshold_uncertainty_score":0.013495326},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06213274038974058,"score_gpt":0.3305188659932833,"score_spread":0.2683861256035427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539384798","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.6378053,0.0024782177,0.3372469,0.0010342643,0.000076594304,0.000069632646,0.00009325496,0.0005380555,0.020657785],"genre_scores_gemma":[0.96574,0.00045202428,0.028896132,0.00004908397,0.000031832536,0.000055103283,0.00009475639,0.00020593,0.0044750557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.0002869203,0.000023808214,0.00006418417,0.00011929052,0.00010524631],"domain_scores_gemma":[0.9903923,0.00822259,0.00057232403,0.00026510484,0.0003791392,0.00016848647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020617926,0.0005721658,0.00087209995,0.0008635025,0.00047490653,0.0010842464,0.001459109,0.0010568383,0.0034281472],"category_scores_gemma":[0.015240517,0.00046862438,0.00084107573,0.00093432853,0.0012561555,0.0021457297,0.00081406324,0.001622,0.00031729214],"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.00015451561,0.000105655665,0.0025431926,0.00014535194,0.000090908696,0.0002021392,0.00034733734,0.90594035,0.0026503797,0.06814609,0.0014826752,0.018191403],"study_design_scores_gemma":[0.000008907342,0.00001918703,0.00044943413,0.000006248614,0.000010609391,0.00001550178,0.000028884017,0.98478264,0.0002385203,0.014269352,0.00016385273,0.000006948181],"about_ca_topic_score_codex":0.009314856,"about_ca_topic_score_gemma":0.005431153,"teacher_disagreement_score":0.009314856,"about_ca_system_score_codex":0.0011184008,"about_ca_system_score_gemma":0.001034216,"threshold_uncertainty_score":0.018521309},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14587001360493643,"score_gpt":0.3417906010138803,"score_spread":0.19592058740894389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847516220","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025667013,0.013841714,0.96164155,0.0010778955,0.0005254343,0.00006468949,0.00018242274,0.00029378978,0.019805806],"genre_scores_gemma":[0.17851822,0.07389207,0.6630845,0.00103304,0.0024775788,0.00084248517,0.0018223244,0.0005787285,0.07775102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998806,0.00032843035,0.000056195313,0.00022793248,0.00044855673,0.00013296769],"domain_scores_gemma":[0.9984372,0.00094429526,0.00012858731,0.0001894827,0.00022361187,0.00007684276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001658365,0.0026538684,0.0024477292,0.0012006087,0.0009920936,0.0031475571,0.0063840784,0.0029330754,0.010521876],"category_scores_gemma":[0.004100342,0.001102858,0.0024526396,0.003930401,0.0017453773,0.0055030077,0.0019609223,0.0050797816,0.0042262264],"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.00006311722,0.00014226725,0.00019527749,0.0005092372,0.00006579465,0.00006942425,0.0000902307,0.31173164,0.00045951875,0.539259,0.023019612,0.12439488],"study_design_scores_gemma":[0.000024843806,0.00003972464,0.000088217894,0.00006366228,0.000037446152,0.0001355379,0.000032364445,0.56494206,0.0002730327,0.40946752,0.024872629,0.000022968308],"about_ca_topic_score_codex":0.0031451762,"about_ca_topic_score_gemma":0.003536743,"teacher_disagreement_score":0.010521876,"about_ca_system_score_codex":0.0023116078,"about_ca_system_score_gemma":0.0018168949,"threshold_uncertainty_score":0.035199225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09522652726484755,"score_gpt":0.3867614583324927,"score_spread":0.29153493106764516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163715979","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.0015780979,0.0023295577,0.9783876,0.00033226583,0.00034182536,0.000042936477,0.00007069239,0.00030227206,0.016614828],"genre_scores_gemma":[0.11334703,0.0080197025,0.822478,0.00035479185,0.0008695091,0.0007399386,0.0005163245,0.0008155373,0.05285913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944,0.00016810541,0.000026371878,0.000064997956,0.0002623445,0.000038146285],"domain_scores_gemma":[0.9994741,0.0002423651,0.00003315717,0.00008194411,0.00014939457,0.00001909426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007823626,0.0012984452,0.0010025832,0.0006939602,0.0005465952,0.0009903159,0.0013862216,0.0009808326,0.008478667],"category_scores_gemma":[0.0023919311,0.00057255337,0.00091317215,0.0013900322,0.0007183032,0.001172092,0.0013210241,0.0019496063,0.0029406687],"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.000078625846,0.00010541709,0.00023418985,0.0004383999,0.00008315306,0.00008136142,0.00010506211,0.42684835,0.0021555978,0.2200186,0.030676458,0.31917486],"study_design_scores_gemma":[0.000041396663,0.00002074138,0.000084368614,0.00004052001,0.000016716052,0.000051852632,0.00002133142,0.7839109,0.0007832094,0.18578771,0.029232083,0.000009235716],"about_ca_topic_score_codex":0.0030879357,"about_ca_topic_score_gemma":0.0031412796,"teacher_disagreement_score":0.008478667,"about_ca_system_score_codex":0.00068487297,"about_ca_system_score_gemma":0.0009660734,"threshold_uncertainty_score":0.028364003},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06832218908027715,"score_gpt":0.33170308510193786,"score_spread":0.2633808960216607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182693413","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.05399036,0.0053885807,0.8248843,0.002631138,0.00047815833,0.00006889891,0.0001764825,0.00031234915,0.11206976],"genre_scores_gemma":[0.7275093,0.0056803008,0.17761709,0.0005611214,0.0008126001,0.0003972516,0.00052198,0.00042225415,0.086478084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.00016296092,0.000012798361,0.000050876697,0.00012337427,0.000052341784],"domain_scores_gemma":[0.9989526,0.00066097477,0.00008046866,0.000083648236,0.00009587264,0.00012632218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083638437,0.0010842538,0.0010665521,0.00090363104,0.0009317891,0.0015780847,0.0012895734,0.0011444471,0.0070402026],"category_scores_gemma":[0.004012362,0.0004805844,0.0013846746,0.0007547699,0.0022434848,0.0018010015,0.0018783967,0.0029458113,0.00085313915],"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.000050407136,0.00002965836,0.0003154439,0.00015666724,0.000048568945,0.00013523127,0.00016091765,0.13241881,0.00071784464,0.83017117,0.011393547,0.024401795],"study_design_scores_gemma":[0.000026859629,0.00003766501,0.00020945241,0.00004369613,0.000014223283,0.00009256966,0.00004501137,0.2746894,0.00018835558,0.7158349,0.008795503,0.000022398483],"about_ca_topic_score_codex":0.0025943208,"about_ca_topic_score_gemma":0.0028024605,"teacher_disagreement_score":0.0070402026,"about_ca_system_score_codex":0.0017953945,"about_ca_system_score_gemma":0.00093742314,"threshold_uncertainty_score":0.023551822},"labels":[],"label_agreement":null}]}