{"meta":{"query_hash":"4d2b082763b6","filters":{"venue":"Location Science"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/4d2b082763b6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Location+Science"},"results":[{"id":"W2417045655","doi":"10.1007/978-3-319-13111-5_22","title":"The Design of Rapid Transit Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":20,"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":"Transit (satellite); Transit system; Network planning and design; Transport engineering; Computer science; Operations research; Systems design; Public transport; Engineering; Telecommunications","score_opus":0.07461130015797435,"score_gpt":0.30696205918083985,"score_spread":0.2323507590228655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417045655","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004224321,0.009882533,0.838813,0.0015234193,0.0005893928,0.00008158363,0.00035869933,0.0003258388,0.14420134],"genre_scores_gemma":[0.32294965,0.037833944,0.43588346,0.00049536664,0.0009193872,0.0005717634,0.00082021067,0.0005458291,0.19998036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963,0.00013424628,0.000012264263,0.000062849496,0.00013007513,0.00003053453],"domain_scores_gemma":[0.9997633,0.00012407367,0.00002004991,0.000028333076,0.000047216818,0.000017028298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054011506,0.00089597364,0.0005551933,0.00044088397,0.00037064726,0.0015437764,0.0011912034,0.001024241,0.011360959],"category_scores_gemma":[0.0013714483,0.00061541144,0.0005883513,0.00075276796,0.0007513432,0.0012418613,0.0008601066,0.0009325814,0.0019758127],"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.000029094266,0.000021288075,0.00013707508,0.00035482357,0.000031089083,0.000056440847,0.00009170239,0.2679444,0.0016173136,0.60050166,0.019332347,0.10988289],"study_design_scores_gemma":[0.000022787865,0.00004134038,0.000112312446,0.00013539872,0.0000214042,0.00010196736,0.00007447892,0.23261464,0.0011935793,0.5336768,0.23198454,0.000020704765],"about_ca_topic_score_codex":0.0020555777,"about_ca_topic_score_gemma":0.0031739513,"teacher_disagreement_score":0.011360959,"about_ca_system_score_codex":0.0014238552,"about_ca_system_score_gemma":0.0010515061,"threshold_uncertainty_score":0.038006246},"labels":[],"label_agreement":null},{"id":"W4211246340","doi":"10.1007/978-3-030-32177-2_12","title":"Hub Location Problems","year":2019,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network planning and design; Computer science; Cover (algebra); Integer programming; Key (lock); Facility location problem; Network topology; Operations research; Class (philosophy); Focus (optics); Modal; Flow network; Mathematical optimization; Engineering; Computer network; Artificial intelligence; Mathematics; Computer security","score_opus":0.028624032868462122,"score_gpt":0.266979153600706,"score_spread":0.23835512073224388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211246340","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004460158,0.005726006,0.29438987,0.0021868753,0.0011839482,0.00006335366,0.0007209156,0.000443565,0.6908252],"genre_scores_gemma":[0.09206928,0.010779917,0.05743352,0.0005778031,0.0009494831,0.0001356091,0.0012660963,0.00039677147,0.8363915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977213,0.000048440605,0.0000067780884,0.00006315907,0.000078860714,0.00003062836],"domain_scores_gemma":[0.9998683,0.000042709842,0.000011392935,0.000028519862,0.00003365782,0.000015456979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275043,0.0011333439,0.00080652576,0.00072279776,0.0006237993,0.0018876896,0.0011670074,0.0013012041,0.04224056],"category_scores_gemma":[0.0007470887,0.0004052273,0.000573939,0.0014314178,0.0008041667,0.0020238736,0.0011495267,0.0018986046,0.011418027],"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.00002040199,0.000042975225,0.000103310784,0.0001846209,0.000017136588,0.000077619596,0.000065486034,0.02769318,0.00067737536,0.7437999,0.10477136,0.12254663],"study_design_scores_gemma":[0.000012973067,0.000027355032,0.00025305653,0.00012318838,0.000018761006,0.00021682901,0.0001260753,0.04565306,0.0010066633,0.56987464,0.3826707,0.00001666299],"about_ca_topic_score_codex":0.0012717479,"about_ca_topic_score_gemma":0.0019357529,"teacher_disagreement_score":0.04224056,"about_ca_system_score_codex":0.0011297986,"about_ca_system_score_gemma":0.0007042211,"threshold_uncertainty_score":0.14130872},"labels":[],"label_agreement":null},{"id":"W4235201321","doi":"10.1007/978-3-030-32177-2_17","title":"Stochastic Location Models with Congestion","year":2019,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"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 Toronto","funders":"","keywords":"Computer science; Queueing theory; Service (business); Server; Focus (optics); Queue; Operations research; Variety (cybernetics); Set (abstract data type); Function (biology); Stochastic modelling; Computer network; Engineering; Artificial intelligence; Business; Marketing","score_opus":0.0416965380498992,"score_gpt":0.22991002023956347,"score_spread":0.18821348218966427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235201321","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.039281026,0.006844726,0.8410435,0.0072238403,0.0013410802,0.00007095958,0.001846361,0.0005152496,0.10183329],"genre_scores_gemma":[0.7489318,0.007606513,0.024809178,0.00081645674,0.0012355564,0.00020542923,0.0014992789,0.00032190222,0.21457386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926084,0.00025232625,0.000029509818,0.00016173402,0.00018344281,0.00011215603],"domain_scores_gemma":[0.9987374,0.00068862876,0.00018464238,0.0001124844,0.00019051792,0.000086346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010176105,0.0013545752,0.001508392,0.00078671396,0.0005918398,0.0026478071,0.0022143028,0.0024733325,0.012745159],"category_scores_gemma":[0.0045303926,0.0011180845,0.001261813,0.0019466034,0.0018681233,0.0031256936,0.0014922325,0.0026565618,0.001676715],"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.00002172252,0.000030681116,0.00029062165,0.000053576474,0.000032705073,0.00007149101,0.000058123107,0.34778997,0.00016499915,0.63354576,0.010564936,0.007375402],"study_design_scores_gemma":[0.000015403511,0.000018975032,0.00021510584,0.000024235991,0.000018225464,0.000052410236,0.000042912216,0.54500425,0.000050909384,0.4456005,0.00893525,0.000021920758],"about_ca_topic_score_codex":0.013000626,"about_ca_topic_score_gemma":0.0086534135,"teacher_disagreement_score":0.013000626,"about_ca_system_score_codex":0.002601356,"about_ca_system_score_gemma":0.0012242134,"threshold_uncertainty_score":0.04263687},"labels":[],"label_agreement":null},{"id":"W4245993692","doi":"10.1007/978-3-030-32177-2_15","title":"Location-Routing and Location-Arc Routing","year":2019,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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":"Static routing; Policy-based routing; Equal-cost multi-path routing; Computer science; Link-state routing protocol; Multipath routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Geographic routing; Computer network; Arc routing; Routing (electronic design automation); Routing protocol","score_opus":0.02579907249741598,"score_gpt":0.27499470653268526,"score_spread":0.2491956340352693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245993692","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.0008586962,0.016702164,0.34354094,0.001752187,0.0030767962,0.00006361592,0.00044331877,0.00075206015,0.6328102],"genre_scores_gemma":[0.018566415,0.01931551,0.10203974,0.0006279535,0.000973969,0.00011291328,0.0005889822,0.0007343512,0.85704017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997482,0.00004613453,0.000009233006,0.00005820638,0.000121442514,0.000016909615],"domain_scores_gemma":[0.9998697,0.00005121016,0.0000074968543,0.000025947122,0.000038328602,0.00000720852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024334954,0.0012024456,0.0006820016,0.00082366425,0.0004654439,0.0021172352,0.0010794208,0.0011006047,0.046867914],"category_scores_gemma":[0.0005989096,0.00057708594,0.0004656454,0.0022454304,0.0007819165,0.0028613408,0.00082831236,0.001962231,0.023485737],"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.000013759807,0.00003756472,0.00006715393,0.00029498202,0.00001461714,0.00004851001,0.0000672282,0.019491991,0.0010430278,0.49514467,0.14415151,0.33962497],"study_design_scores_gemma":[0.000004173735,0.0000144425485,0.00010933007,0.00012835054,0.00000974925,0.00014402819,0.000045043893,0.016131552,0.00078669837,0.2266943,0.7559191,0.000013204077],"about_ca_topic_score_codex":0.0016754653,"about_ca_topic_score_gemma":0.0027847374,"teacher_disagreement_score":0.046867914,"about_ca_system_score_codex":0.001193398,"about_ca_system_score_gemma":0.00072985067,"threshold_uncertainty_score":0.15678877},"labels":[],"label_agreement":null},{"id":"W560686865","doi":"10.1007/978-3-319-13111-5_17","title":"Stochastic Location Models with Congestion","year":2015,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":46,"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 Toronto","funders":"","keywords":"Queueing theory; Server; Computer science; Service (business); Queue; Focus (optics); Operations research; Stochastic modelling; Function (biology); Set (abstract data type); Key (lock); Variety (cybernetics); Computer security; Computer network; Engineering; Business; Marketing; Artificial intelligence","score_opus":0.08534679232136932,"score_gpt":0.2555334891010034,"score_spread":0.17018669677963405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W560686865","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.029580016,0.008091716,0.8604553,0.0073865014,0.0013516927,0.000053165364,0.0013634387,0.00042565097,0.0912925],"genre_scores_gemma":[0.75811857,0.011711248,0.03292711,0.0010893947,0.0018305064,0.00021893953,0.0015986507,0.0004047239,0.19210082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992699,0.00026100606,0.000030135458,0.00015101954,0.00019362649,0.00009433876],"domain_scores_gemma":[0.9988085,0.00064022443,0.00017169639,0.0001062721,0.00019134233,0.00008194548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043051,0.0014446175,0.001406424,0.0007259636,0.0005137691,0.002482972,0.0021269731,0.0024261777,0.009871695],"category_scores_gemma":[0.004356597,0.0010581177,0.0012692895,0.0018514206,0.0018967352,0.0030405628,0.0014559237,0.0027145103,0.0014487188],"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.000016921342,0.000023066965,0.00023952921,0.000047446396,0.000030389736,0.000058712256,0.000051523893,0.31406352,0.00013159221,0.6678979,0.010084023,0.00735539],"study_design_scores_gemma":[0.000013274671,0.000014076903,0.00016070803,0.000027587485,0.000015443715,0.000042234078,0.000033382705,0.42793933,0.00004427951,0.56135464,0.010334084,0.000020990812],"about_ca_topic_score_codex":0.011647394,"about_ca_topic_score_gemma":0.007672527,"teacher_disagreement_score":0.011647394,"about_ca_system_score_codex":0.002620364,"about_ca_system_score_gemma":0.0013080431,"threshold_uncertainty_score":0.033024073},"labels":[],"label_agreement":null}]}