{"meta":{"query_hash":"e8956fc1cf8f","filters":{"venue":"Series on computers and operations research"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/e8956fc1cf8f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Series+on+computers+and+operations+research"},"results":[{"id":"W1700519216","doi":"10.1142/9789813200012_0007","title":"From Managing Urban Freight to Smart City Logistics Networks","year":2017,"lang":"en","type":"book-chapter","venue":"Series on computers and operations research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":93,"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 à Montréal","funders":"","keywords":"City logistics; Business; Traffic management; Transport engineering; Engineering","score_opus":0.08240138169467133,"score_gpt":0.27814968315887717,"score_spread":0.19574830146420585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700519216","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.02583149,0.09612456,0.28120273,0.034418385,0.0035084928,0.00015368579,0.00032685508,0.0008107721,0.55762315],"genre_scores_gemma":[0.34372613,0.26451162,0.10727207,0.0043400996,0.0033107963,0.00032257068,0.00079508306,0.00030003343,0.27542162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999892,0.000021970909,0.000004563495,0.00002225747,0.000039879866,0.0000193168],"domain_scores_gemma":[0.9999056,0.00003781801,0.00001180199,0.000010762664,0.000018692052,0.000015348207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000276776,0.0005746317,0.0002128086,0.00046553268,0.00047486243,0.0030485564,0.0006425388,0.00072235055,0.006297641],"category_scores_gemma":[0.0003850576,0.00019764676,0.00022864375,0.0013943891,0.0009418619,0.004407794,0.0016303617,0.0012567317,0.0012486035],"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.000013650246,0.00002470166,0.0003584033,0.0005285534,0.000013912213,0.00013955592,0.0006636392,0.029793164,0.0010639231,0.7020688,0.05459152,0.21074025],"study_design_scores_gemma":[0.0000033158992,0.00002256345,0.0002464642,0.00032361966,0.0000090711355,0.00014510594,0.0007191843,0.0120090265,0.00083136506,0.17472897,0.8109496,0.000011751422],"about_ca_topic_score_codex":0.0015910933,"about_ca_topic_score_gemma":0.0025179426,"teacher_disagreement_score":0.006297641,"about_ca_system_score_codex":0.0015397934,"about_ca_system_score_gemma":0.0012753292,"threshold_uncertainty_score":0.021067739},"labels":[],"label_agreement":null},{"id":"W4401399850","doi":"10.1142/9789811267048_0004","title":"Two Heuristic Methods for Solving Generalized Nash Equilibrium Problems Using a Novel Penalty Function","year":2024,"lang":"en","type":"book-chapter","venue":"Series on computers and operations research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"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 Guelph","funders":"","keywords":"Penalty method; Mathematical optimization; Nash equilibrium; Heuristic; Function (biology); Computer science; Mathematics; Applied mathematics; Mathematical economics","score_opus":0.1415827206551833,"score_gpt":0.41428727808191906,"score_spread":0.27270455742673577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401399850","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.0035650588,0.00039373245,0.99020267,0.00018430898,0.00027991016,0.00008102077,0.000024574014,0.000107109714,0.005161633],"genre_scores_gemma":[0.08795537,0.00045019627,0.8951981,0.00022601632,0.00022258356,0.0005388904,0.00007962799,0.00020592075,0.015123231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915254,0.00034306696,0.00004220989,0.00009301265,0.00026782422,0.00010130658],"domain_scores_gemma":[0.9984273,0.00095517805,0.00012458731,0.0001237245,0.00024682432,0.00012240966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576549,0.0018266722,0.0016168546,0.0014248481,0.00088859064,0.0013739406,0.0026645686,0.0031753215,0.0048266836],"category_scores_gemma":[0.0041788695,0.00079703593,0.0015233271,0.0013715344,0.0015451286,0.0016011595,0.0024194815,0.0026949032,0.00080607476],"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.00018232586,0.0002844772,0.00031463814,0.00033232648,0.00014272935,0.00015756613,0.0001497278,0.6719092,0.003942485,0.15669782,0.0062748175,0.15961178],"study_design_scores_gemma":[0.000031226024,0.00005437523,0.000070041926,0.000018703182,0.000015743202,0.000042638763,0.000016399528,0.98493147,0.00044993244,0.012201465,0.0021446722,0.000023390467],"about_ca_topic_score_codex":0.0037004221,"about_ca_topic_score_gemma":0.006600491,"teacher_disagreement_score":0.0048266836,"about_ca_system_score_codex":0.0008901156,"about_ca_system_score_gemma":0.0015072074,"threshold_uncertainty_score":0.016146898},"labels":[],"label_agreement":null},{"id":"W4401399881","doi":"10.1142/9789811267048_0026","title":"On Removing Diverse Data for Training Machine Learning Models","year":2024,"lang":"en","type":"book-chapter","venue":"Series on computers and operations research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Training (meteorology); Computer science; Machine learning; Artificial intelligence; Training set; Geography","score_opus":0.2136281158318142,"score_gpt":0.36668852896863213,"score_spread":0.15306041313681792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401399881","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.0041760784,0.0012473371,0.9900255,0.0005034927,0.00028573824,0.00007330294,0.00025271924,0.00073668023,0.0026991821],"genre_scores_gemma":[0.076248094,0.0019835758,0.90157604,0.0014090074,0.00087820954,0.0004458893,0.003876234,0.0009228843,0.012660108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667835,0.0016361895,0.0002121329,0.00039281923,0.00094134884,0.00013919633],"domain_scores_gemma":[0.9899984,0.007263696,0.00017178449,0.0016890145,0.00075942255,0.00011758471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053929915,0.0021182136,0.0020804142,0.0016326235,0.0012789865,0.0014456848,0.0037069726,0.002792954,0.005824343],"category_scores_gemma":[0.01940824,0.0011730817,0.0020536936,0.0026951868,0.0018380081,0.00369011,0.0039050053,0.0064035724,0.0032974447],"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.00024347505,0.00022467179,0.0010567645,0.00029780972,0.00020622805,0.00020623396,0.00017549815,0.19916104,0.0038221772,0.030344004,0.034459233,0.7298028],"study_design_scores_gemma":[0.000044446428,0.000068685025,0.00062528194,0.000090666654,0.00006908582,0.00012676869,0.000055536213,0.89684236,0.0035814873,0.0901424,0.008325775,0.000027558464],"about_ca_topic_score_codex":0.0031411694,"about_ca_topic_score_gemma":0.006645326,"teacher_disagreement_score":0.005824343,"about_ca_system_score_codex":0.0005510453,"about_ca_system_score_gemma":0.00081806415,"threshold_uncertainty_score":0.02852124},"labels":[],"label_agreement":null}]}