{"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002351554,0.0013299524,0.5965372,0.0006395167,0.0005369486,0.0003408549,0.0000033985555,0.00005501468,0.4005548],"genre_scores_gemma":[0.42683843,0.00350525,0.0051728915,0.00018012627,0.00043398215,0.000024148567,0.000047113383,0.000038653947,0.5637594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845546,0.000046869423,0.00026150228,0.00020623095,0.00085729704,0.00017264656],"domain_scores_gemma":[0.9982392,0.00020349775,0.00024566756,0.00020219843,0.0010133816,0.00009606194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030375838,0.000089456415,0.000110552945,0.00009227532,0.00078190473,0.00008607596,0.0004851145,0.00012115437,0.000058245532],"category_scores_gemma":[0.000159136,0.000070830625,0.000028757047,0.0003151778,0.0015408972,0.00021169517,0.0000048864536,0.00011231809,0.000014940549],"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.000018901459,0.0000052570076,0.0000090729,0.0000042915512,0.000006104042,3.9835464e-7,0.005458653,0.3730209,0.000005701424,0.58941364,0.0022423395,0.029814731],"study_design_scores_gemma":[0.0004446851,0.0001706482,0.00056222663,0.00029935903,0.00011217108,0.0000013134137,0.0019834412,0.06526267,0.000046308433,0.031315777,0.8991225,0.0006789208],"about_ca_topic_score_codex":0.00006132964,"about_ca_topic_score_gemma":0.00010832331,"teacher_disagreement_score":0.89688015,"about_ca_system_score_codex":0.00007539862,"about_ca_system_score_gemma":0.0012878474,"threshold_uncertainty_score":0.60138583},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025855397,0.00031989263,0.4624078,0.00006605514,0.0008227325,0.0003876536,0.0000026983923,0.0004166569,0.53555065],"genre_scores_gemma":[0.18851264,0.0002893232,0.06801407,0.00023905945,0.00038674037,0.000041173764,0.00007698019,0.00023853152,0.7422015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843353,0.000010044687,0.00034365695,0.00040426728,0.0005757152,0.00023277655],"domain_scores_gemma":[0.99852407,0.000052036008,0.00012643708,0.0005950807,0.00061731436,0.00008507074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00086239586,0.00021437068,0.00018488658,0.00034140397,0.00011246972,0.00012574765,0.00047442198,0.00017646061,0.00013359214],"category_scores_gemma":[0.00011992805,0.0002355505,0.00002927615,0.00047155653,0.00020766466,0.00037475303,0.000050163973,0.00023492315,0.00101617],"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":[5.3744947e-7,0.0000026993348,0.0000131860625,0.00020662017,0.000004402189,1.7460562e-7,0.00018026675,0.9262599,0.00068369944,0.05745897,0.00033792984,0.014851668],"study_design_scores_gemma":[0.00020054117,0.000030741296,0.00036494763,0.0005281908,0.000029559651,0.000010138771,0.000016084841,0.93487287,0.0014479937,0.0037635297,0.05798846,0.0007469493],"about_ca_topic_score_codex":0.000002819919,"about_ca_topic_score_gemma":0.00000264353,"teacher_disagreement_score":0.3943937,"about_ca_system_score_codex":0.00029557873,"about_ca_system_score_gemma":0.00036273635,"threshold_uncertainty_score":0.99976164},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025753665,0.00013566323,0.26491424,0.001391605,0.0010595814,0.001202595,0.000002903018,0.00025451637,0.7307814],"genre_scores_gemma":[0.7618942,0.000013096286,0.00018862254,0.0011905907,0.00030935722,0.000034882123,0.00011749551,0.000039816674,0.23621191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974992,0.000002879178,0.00038158827,0.0007539661,0.0010804181,0.00028193046],"domain_scores_gemma":[0.99721414,0.000013732127,0.0002591933,0.0007047389,0.0017821605,0.000026064616],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006618013,0.00030640577,0.00022627202,0.0007067646,0.00029461007,0.00037252993,0.0005667231,0.000107490334,0.00040846088],"category_scores_gemma":[0.000077981,0.00028051177,0.000036531645,0.0006975113,0.00039008504,0.0024997664,0.00014649551,0.00017283586,0.003975371],"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.00001549243,0.000014838254,0.000005407477,0.00017318357,0.000007968836,2.897508e-7,0.00002875723,0.28807023,0.000008246367,0.7070181,0.000653304,0.004004176],"study_design_scores_gemma":[0.00060408894,0.000043655444,0.0011163815,0.00065460365,0.00018744604,0.000002507458,0.00014346806,0.8837605,0.0000061709206,0.04091893,0.07145492,0.0011073003],"about_ca_topic_score_codex":0.0002618809,"about_ca_topic_score_gemma":0.00030020435,"teacher_disagreement_score":0.7616367,"about_ca_system_score_codex":0.0001939624,"about_ca_system_score_gemma":0.00036602118,"threshold_uncertainty_score":0.9999647},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040575486,0.0011158744,0.7234407,0.00020332602,0.0011582637,0.0006822732,0.000005203599,0.00072186405,0.27226675],"genre_scores_gemma":[0.90539205,0.00014437741,0.034328546,0.00018495257,0.00027920894,0.00001708254,0.00003331572,0.00014581674,0.059474625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973854,0.000027765967,0.0006686766,0.0007391329,0.00074727746,0.00043175777],"domain_scores_gemma":[0.99708205,0.0002624095,0.00028927514,0.00075098535,0.0014438281,0.00017144598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017923311,0.00038805642,0.00034651693,0.0004659265,0.00038750315,0.0003202183,0.000550009,0.0002602497,0.00006506916],"category_scores_gemma":[0.0008204448,0.00044541754,0.00003302767,0.0010443827,0.00042122017,0.00063057017,0.00014165725,0.00042284664,0.00030964505],"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.0000030370798,0.000008068425,0.00045372214,0.00046093974,0.000029745755,0.0000011080261,0.0012805936,0.74082935,0.00080713007,0.21528313,0.00020275978,0.04064042],"study_design_scores_gemma":[0.00023819444,0.000020652778,0.0014934683,0.00080136576,0.000043147098,0.00002086448,0.000116144365,0.9913164,0.00057980313,0.0011769434,0.0034478176,0.0007452211],"about_ca_topic_score_codex":0.00001535983,"about_ca_topic_score_gemma":0.000006972072,"teacher_disagreement_score":0.9049863,"about_ca_system_score_codex":0.00039740506,"about_ca_system_score_gemma":0.00071461877,"threshold_uncertainty_score":0.9997998},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012554816,0.00026006257,0.26459292,0.0015205698,0.0008559045,0.0009356321,0.000003106672,0.0002997931,0.73140645],"genre_scores_gemma":[0.8057193,0.000011465723,0.00030073788,0.0008883247,0.00048847153,0.00006181456,0.00015424879,0.000045399218,0.19233026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973235,0.000003321022,0.0003853866,0.0006960884,0.0013146376,0.00027704358],"domain_scores_gemma":[0.99596304,0.000009406056,0.00024835113,0.0006244369,0.0031121462,0.000042630058],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009954079,0.00030283674,0.00021747407,0.0006942239,0.00030511053,0.00035753744,0.00055774016,0.000104625906,0.00028669796],"category_scores_gemma":[0.00013325634,0.00027599928,0.000029294657,0.00077348115,0.0004926351,0.0025546935,0.00015142869,0.00016510437,0.0020254543],"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.000018090554,0.000017111644,0.0000022495215,0.000103296275,0.00000737331,4.9459396e-7,0.00004065699,0.29764196,0.000003885784,0.69469696,0.002322698,0.005145189],"study_design_scores_gemma":[0.0006381065,0.00004545721,0.00034216046,0.00048670374,0.00019441018,0.0000033394326,0.00019428952,0.74773824,0.0000030674887,0.12005623,0.12923366,0.0010643718],"about_ca_topic_score_codex":0.0003368817,"about_ca_topic_score_gemma":0.00040431533,"teacher_disagreement_score":0.8055937,"about_ca_system_score_codex":0.00026898296,"about_ca_system_score_gemma":0.00040042636,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null}]}