{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013433357,0.0006965609,0.900299,0.0015595243,0.0008860768,0.0020410023,0.00006419557,0.0006973674,0.08032291],"genre_scores_gemma":[0.088563904,0.0009159908,0.80173033,0.00022629967,0.00052192144,0.00012780903,0.000017202907,0.00023005175,0.1076665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965361,0.00009267993,0.0005323051,0.00090641197,0.001156243,0.000776296],"domain_scores_gemma":[0.99738973,0.00011848761,0.000027179407,0.0007939542,0.0011604122,0.00051022926],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011669724,0.00037724886,0.00043491393,0.0012339742,0.0011055064,0.0012738802,0.0010091465,0.0001956116,0.00021484443],"category_scores_gemma":[0.0001245587,0.00043468244,0.000053428044,0.00073662406,0.0009980447,0.0010323047,0.0012161607,0.0007637337,0.00031031363],"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.000013296719,0.000042308428,0.000004742061,0.00008458181,0.00005253607,0.000007036106,0.0040376,0.9422831,0.020584457,0.0028062759,0.00354951,0.026534583],"study_design_scores_gemma":[0.0003081138,0.0011934241,0.00012324724,0.0010428283,0.000016590811,0.000060829207,0.000064744134,0.9016399,0.026237361,0.00039661236,0.06776901,0.0011473441],"about_ca_topic_score_codex":0.000054624445,"about_ca_topic_score_gemma":0.00021229933,"teacher_disagreement_score":0.09856869,"about_ca_system_score_codex":0.00045387205,"about_ca_system_score_gemma":0.00029820445,"threshold_uncertainty_score":0.9998105},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027581112,0.015475688,0.41771564,0.0105742905,0.0019924766,0.0012129479,0.000111796435,0.000425363,0.552216],"genre_scores_gemma":[0.009248008,0.062147498,0.16167076,0.00025984365,0.00070516596,0.000108297536,0.000052790794,0.00010073076,0.7657069],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933782,0.0002238397,0.0007478735,0.0019301877,0.002523642,0.0011962159],"domain_scores_gemma":[0.9955798,0.00016424045,0.000066011635,0.0022274978,0.0015957417,0.00036673847],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031955983,0.00047533767,0.00057472126,0.0026677446,0.0013347181,0.0034547031,0.005905786,0.0002037466,0.0012462187],"category_scores_gemma":[0.00014210201,0.0004335908,0.00012017775,0.0021149819,0.0022018845,0.005929175,0.003836223,0.0015065258,0.00089560053],"study_design_candidate":"design_other","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.000013858686,0.00015552684,0.000015290618,0.000053925418,0.000048627502,0.00015676908,0.0034860577,0.03262949,0.00022097808,0.30488858,0.012089041,0.64624184],"study_design_scores_gemma":[0.00017070184,0.00040919363,0.000014620538,0.00037564494,0.000004607826,0.00005324701,0.0000839166,0.39102334,0.0010596229,0.0019187463,0.6043121,0.0005741983],"about_ca_topic_score_codex":0.000064702675,"about_ca_topic_score_gemma":0.0007609226,"teacher_disagreement_score":0.6456677,"about_ca_system_score_codex":0.0005405701,"about_ca_system_score_gemma":0.0010479444,"threshold_uncertainty_score":0.9999654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002562318,0.00045438026,0.9759456,0.0015630145,0.000990499,0.0029601152,0.00015383329,0.0009638446,0.016712498],"genre_scores_gemma":[0.008717466,0.00050718524,0.97514,0.00005650856,0.00010842514,0.00055141514,0.000035444784,0.00012809415,0.014755481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996544,0.00005504984,0.0007980366,0.0009335246,0.0006430704,0.0010263252],"domain_scores_gemma":[0.99564993,0.00033369332,0.00005201282,0.0019910552,0.001664975,0.00030834868],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0009265923,0.0005628169,0.00055135787,0.0011313751,0.0016721215,0.00081956596,0.0022543739,0.00036900982,0.0001042719],"category_scores_gemma":[0.0004896446,0.00058109546,0.00013721922,0.0006483011,0.0046620425,0.0010447679,0.0013023259,0.001324713,0.000121241355],"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.000036536487,0.00006466179,0.0000019166762,0.00012436509,0.00015622564,0.0000076272554,0.00081284385,0.6685574,0.005499686,0.23907118,0.0026894137,0.08297811],"study_design_scores_gemma":[0.00049595785,0.00032040803,0.0000026360235,0.00039732357,0.000015905214,0.0000822521,0.0003077482,0.9046143,0.004995456,0.0031955817,0.08482714,0.00074528245],"about_ca_topic_score_codex":0.000013103768,"about_ca_topic_score_gemma":0.00064255885,"teacher_disagreement_score":0.23605688,"about_ca_system_score_codex":0.00069333054,"about_ca_system_score_gemma":0.00027929817,"threshold_uncertainty_score":0.99966407},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006215576,0.00035672216,0.98521143,0.00072859635,0.00024337869,0.0013126339,0.000059882816,0.00013329615,0.011332486],"genre_scores_gemma":[0.28824466,0.0007566289,0.46653038,0.000054833476,0.0007682516,0.00022705838,0.00007407559,0.00034556809,0.24299854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681866,0.00018698836,0.00068557455,0.0005552303,0.0011050857,0.00064843986],"domain_scores_gemma":[0.99663186,0.00054907816,0.000054215227,0.00086864375,0.0017776877,0.000118512784],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040845876,0.00034100164,0.00039439613,0.00064859074,0.0017723286,0.0011987172,0.0016837984,0.00017525128,0.00039899012],"category_scores_gemma":[0.00004678392,0.00023234506,0.00015102219,0.0008204658,0.002515129,0.00056786754,0.0004156676,0.0009964393,0.000039760638],"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.000007638613,0.000011739406,0.000001676357,0.00004784526,0.0000805549,0.0000014372895,0.0022599346,0.9811593,0.0014040213,0.005015536,0.0005757258,0.009434546],"study_design_scores_gemma":[0.00011106428,0.00015243681,0.000007206394,0.00023190804,0.000035327554,0.000019530798,0.00014741549,0.9842674,0.012423075,0.00012354263,0.0022435593,0.00023751233],"about_ca_topic_score_codex":0.000036723264,"about_ca_topic_score_gemma":0.00005209104,"teacher_disagreement_score":0.51868105,"about_ca_system_score_codex":0.0002583013,"about_ca_system_score_gemma":0.00029290465,"threshold_uncertainty_score":0.9998381},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005957263,0.0016669412,0.98237497,0.00075302244,0.0003465148,0.0015598608,0.00007118194,0.00020042318,0.012431364],"genre_scores_gemma":[0.0022229634,0.015203105,0.95001364,0.000060727412,0.0002276644,0.0001607957,0.000018342505,0.00010683623,0.031985957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974774,0.00005976816,0.00043322283,0.0007679598,0.00070023234,0.00056138606],"domain_scores_gemma":[0.9977645,0.00014326304,0.000025746556,0.00047345238,0.0012827051,0.0003102922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013427888,0.0003156076,0.00038910203,0.0007415664,0.0009874646,0.0009123167,0.00052267074,0.00017472307,0.00005567791],"category_scores_gemma":[0.000076056436,0.00033680012,0.000035678,0.0003153387,0.000989623,0.0010828439,0.00068557524,0.00049371127,0.000012187557],"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.000011826827,0.00001532956,4.9691334e-7,0.00010127346,0.00004575223,0.000001512433,0.0023244093,0.8992146,0.0007078204,0.0044788285,0.0016334231,0.09146471],"study_design_scores_gemma":[0.0001981193,0.00033261286,0.0000042192514,0.00030187814,0.000008439699,0.000031551725,0.000028257466,0.96553993,0.001575964,0.0012649095,0.030343179,0.00037092142],"about_ca_topic_score_codex":0.00001839686,"about_ca_topic_score_gemma":0.000080746286,"teacher_disagreement_score":0.09109379,"about_ca_system_score_codex":0.00023345917,"about_ca_system_score_gemma":0.00027624916,"threshold_uncertainty_score":0.9999084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044932054,0.0006442844,0.95875615,0.00041613882,0.0009648724,0.001294604,0.000026793601,0.0004893215,0.037362896],"genre_scores_gemma":[0.0015969641,0.00056889956,0.90838796,0.000023913686,0.0003581105,0.0001681429,0.000024831936,0.00012840267,0.08874279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645483,0.00021574543,0.0007278514,0.00087148737,0.0007739412,0.0009561168],"domain_scores_gemma":[0.997014,0.00032912852,0.00005993698,0.0008003709,0.0015582826,0.00023831542],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0043591666,0.00044376857,0.00048299303,0.00082336925,0.002010583,0.0009680434,0.0011727221,0.0003038526,0.00016438549],"category_scores_gemma":[0.0002929831,0.00045746195,0.00014670665,0.0005183215,0.0013729312,0.0012900695,0.0006082579,0.00093767216,0.00006906545],"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.000009042606,0.000013261511,7.9157803e-7,0.000080890866,0.000046869893,0.0000016118888,0.0015962854,0.93649024,0.0038049123,0.010395704,0.0045837555,0.042976644],"study_design_scores_gemma":[0.00019911386,0.00021122841,0.0000038798594,0.00021550636,0.000009352657,0.000036083013,0.000028218341,0.92715746,0.004899511,0.0007691936,0.06602523,0.00044524643],"about_ca_topic_score_codex":0.000023795412,"about_ca_topic_score_gemma":0.00005325733,"teacher_disagreement_score":0.06144147,"about_ca_system_score_codex":0.0005924839,"about_ca_system_score_gemma":0.00051791675,"threshold_uncertainty_score":0.9997877},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042589243,0.00059847074,0.9745823,0.0003743289,0.0007097742,0.0012640979,0.00032941904,0.00029051767,0.021808473],"genre_scores_gemma":[0.12217659,0.0007589762,0.2164185,0.000055658624,0.00042975062,0.00054123823,0.0004934482,0.00018478907,0.65894103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784094,0.000030649186,0.000367422,0.0005632643,0.0006561586,0.00054159237],"domain_scores_gemma":[0.9973969,0.0001349347,0.000027464948,0.00071451685,0.0015734243,0.0001527681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010183947,0.0003371759,0.00026900455,0.00033394102,0.0011146684,0.001016512,0.00094743713,0.00016014122,0.00015848831],"category_scores_gemma":[0.00009053358,0.00025268435,0.000064971806,0.00020457986,0.0012664445,0.00075317034,0.0003705278,0.00063798117,0.00007800969],"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.000013818742,0.000005582891,1.4382222e-7,0.00005046085,0.000031274034,0.0000015223206,0.00045508405,0.97961515,0.00004355696,0.008184648,0.005212714,0.0063860356],"study_design_scores_gemma":[0.00012702627,0.00017825468,0.0000020592265,0.000079297104,0.000011397916,0.00001213984,0.000037366215,0.88237387,0.0004573726,0.004102583,0.1123307,0.00028796477],"about_ca_topic_score_codex":0.000023937375,"about_ca_topic_score_gemma":0.00042864925,"teacher_disagreement_score":0.7581638,"about_ca_system_score_codex":0.0005003854,"about_ca_system_score_gemma":0.00032091222,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null}]}