{"meta":{"query_hash":"516d09df528f","filters":{"venue":"CICTP 2019"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/516d09df528f","api":"https://metacan.xera.ac/api/v1/cohort?venue=CICTP+2019"},"results":[{"id":"W2954558387","doi":"10.1061/9780784482292.489","title":"Scenario-Based Infrastructure Requirements for Automated Driving","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Computer science; Key (lock); Wireless; Critical infrastructure; Systems engineering; Transport engineering; Risk analysis (engineering); Engineering; Computer security; Telecommunications; Business","score_opus":0.007438479955866551,"score_gpt":0.24229016552876595,"score_spread":0.2348516855728994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954558387","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.43796256,0.00037963176,0.41426507,0.0023160868,0.000060889673,0.0016130758,0.0025603664,0.0005129334,0.14032936],"genre_scores_gemma":[0.95721334,0.00014614477,0.03969845,0.000039551862,0.00000921491,0.0004105515,0.0011260065,0.00002589369,0.001330813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948243,0.0024084116,0.00040294798,0.00025860337,0.0015879265,0.0005178199],"domain_scores_gemma":[0.9916524,0.0046672532,0.0007946499,0.0005777715,0.0019299554,0.00037800192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216226,0.00058207806,0.00020659556,0.0012961779,0.0009739557,0.0027966124,0.001172408,0.001680397,0.0045731063],"category_scores_gemma":[0.011032534,0.00041498235,0.00068417296,0.0008877081,0.0008197559,0.0028978593,0.0016421371,0.0009066517,0.00059962785],"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.00018094711,0.0002030185,0.010607304,0.0005151942,0.00007297668,0.0031742088,0.0054630907,0.5461305,0.009787477,0.392371,0.0035907782,0.027903534],"study_design_scores_gemma":[0.00005266103,0.0003940492,0.012119358,0.00045364947,0.00009514434,0.0025155768,0.014178241,0.6906753,0.007238007,0.18257374,0.0895234,0.0001808921],"about_ca_topic_score_codex":0.0051844865,"about_ca_topic_score_gemma":0.006252422,"teacher_disagreement_score":0.0051844865,"about_ca_system_score_codex":0.002038175,"about_ca_system_score_gemma":0.0018297788,"threshold_uncertainty_score":0.017009199},"labels":[],"label_agreement":null},{"id":"W2954630196","doi":"10.1061/9780784482292.187","title":"Research on Urban Expressway Lane Width Based on Driving Simulator","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Traffic control and management","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"","keywords":"Speed limit; Offset (computer science); Driving simulator; Computer science; Simulation; Limit (mathematics); Automotive engineering; Environmental science; Engineering; Transport engineering; Mathematics","score_opus":0.013538308954007686,"score_gpt":0.25160042602427846,"score_spread":0.23806211707027078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954630196","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.96890134,0.0004001372,0.028092958,0.000028116772,0.000010289529,0.000034420587,0.00007579961,0.00008148017,0.0023754917],"genre_scores_gemma":[0.993501,0.00026719485,0.0057261484,0.0000067168353,0.000004755896,0.000019834006,0.000121438236,0.00001268701,0.0003402202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912006,0.00030212756,0.00005739329,0.00013211722,0.00033830266,0.000050003015],"domain_scores_gemma":[0.99808395,0.0007546123,0.00027537905,0.00012701398,0.0006825362,0.00007649932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082131743,0.0004078965,0.00024908024,0.0009685617,0.00012964541,0.00063160126,0.0005024655,0.00018400847,0.00079069514],"category_scores_gemma":[0.003180235,0.00016475034,0.00026993224,0.0007457351,0.0001827968,0.0011757419,0.00025381107,0.00016317084,0.0001601987],"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.0016169893,0.0010662887,0.2621847,0.0011022529,0.00029596387,0.0002908154,0.0017545834,0.137855,0.16516256,0.00434417,0.0007763018,0.42355046],"study_design_scores_gemma":[0.00010900876,0.0070488253,0.35385606,0.00019848044,0.0006932294,0.0006886896,0.0039112684,0.45427108,0.16678247,0.0024829025,0.009707045,0.00025099397],"about_ca_topic_score_codex":0.0018931428,"about_ca_topic_score_gemma":0.0018280318,"teacher_disagreement_score":0.0018931428,"about_ca_system_score_codex":0.0002421751,"about_ca_system_score_gemma":0.00043777822,"threshold_uncertainty_score":0.004343629},"labels":[],"label_agreement":null},{"id":"W2956264009","doi":"10.1061/9780784482292.507","title":"A Bilevel Programming Framework for Determining the Optimal Incentive-Based Traffic Demand Management Strategy","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"","keywords":"Incentive; Bilevel optimization; Constraint (computer-aided design); Budget constraint; Computer science; Operations research; Demand management; Set (abstract data type); Linear programming; Variable (mathematics); Mathematical optimization; Microeconomics; Economics; Optimization problem; Engineering; Mathematics","score_opus":0.02562748218088755,"score_gpt":0.31067457180110863,"score_spread":0.2850470896202211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956264009","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.0032968537,0.0001764216,0.99339527,0.00019422354,0.000024832152,0.000048931015,0.000049996077,0.000048002275,0.0027655666],"genre_scores_gemma":[0.51108843,0.0013221012,0.47863048,0.00028572956,0.00013934432,0.0011143422,0.00037354368,0.00012195371,0.0069240984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988293,0.00051228376,0.00005305065,0.00021802165,0.00020468507,0.00018257332],"domain_scores_gemma":[0.9984439,0.0009871578,0.00014390332,0.000039672872,0.00030256732,0.000082841165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026611355,0.0018511896,0.0022349982,0.0011217422,0.0006301804,0.0024134377,0.0015419445,0.0019763242,0.003485464],"category_scores_gemma":[0.005254563,0.0009969163,0.0014094529,0.0014182708,0.0010626636,0.0014808994,0.0018103083,0.0029827622,0.00045345796],"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.000014705789,0.00004297811,0.0002730184,0.00009875265,0.000030226829,0.000047295314,0.000045182947,0.960212,0.0003640126,0.030601323,0.0005880437,0.007682486],"study_design_scores_gemma":[0.000005783885,0.000020795169,0.000039794148,0.000011838802,0.0000063527978,0.000007676747,0.000014715666,0.9898868,0.000083017265,0.009456596,0.00046072502,0.000005889706],"about_ca_topic_score_codex":0.0073712245,"about_ca_topic_score_gemma":0.004950447,"teacher_disagreement_score":0.0073712245,"about_ca_system_score_codex":0.0015994856,"about_ca_system_score_gemma":0.0037573285,"threshold_uncertainty_score":0.014656603},"labels":[],"label_agreement":null},{"id":"W2958400684","doi":"10.1061/9780784482292.269","title":"Managing the Congestion and Emissions with Road Pricing Scheme Based on Practical Case Study","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Singapore Area Licensing Scheme; Road pricing; Scheme (mathematics); Congestion pricing; Computer science; Traffic congestion; Road traffic; Transport engineering; Environmental science; Automotive engineering; Engineering; Mathematics","score_opus":0.022946188612889433,"score_gpt":0.3269036790508258,"score_spread":0.30395749043793635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958400684","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.9373404,0.00027828492,0.04401854,0.0005119064,0.000044718574,0.00026914332,0.0001938781,0.00014369075,0.017199554],"genre_scores_gemma":[0.9948776,0.000087931774,0.004078974,0.000009448409,0.000005884245,0.000043696255,0.00003396612,0.000004489182,0.0008581006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99899155,0.00044616708,0.0000347118,0.000104542945,0.00017495496,0.00024810355],"domain_scores_gemma":[0.9989937,0.0004906358,0.00009586368,0.00009114435,0.00023096285,0.00009779097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010804789,0.00085024687,0.0006603187,0.000752595,0.0010795802,0.001107864,0.0013969138,0.0016873186,0.0018337963],"category_scores_gemma":[0.0015115745,0.0002626106,0.0006524334,0.0009985175,0.0008992472,0.0014183485,0.00087446143,0.0007398789,0.00007916424],"study_design_candidate":"observational","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.00011635695,0.00024250292,0.0039533195,0.00010422862,0.00003682432,0.0012332604,0.00009297608,0.97725487,0.0015056926,0.0075834477,0.000709805,0.0071667773],"study_design_scores_gemma":[0.000052040614,0.00019178343,0.0018971754,0.0000066371526,0.00003478432,0.00010974864,0.00035361893,0.9928818,0.0015080431,0.002155397,0.00078408537,0.000024884373],"about_ca_topic_score_codex":0.02412544,"about_ca_topic_score_gemma":0.0180116,"teacher_disagreement_score":0.02412544,"about_ca_system_score_codex":0.0020271817,"about_ca_system_score_gemma":0.001408177,"threshold_uncertainty_score":0.047969997},"labels":[],"label_agreement":null},{"id":"W2977642222","doi":"10.1061/9780784482292.381","title":"A Trajectory-Mining Approach to Derive Travel Time Skim Matrix in Dynamic Traffic Assignment","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"","keywords":"Computer science; Trajectory; Impedance parameters; Matrix (chemical analysis); Travel time; Path (computing); Mode (computer interface); Scale (ratio); Mathematical optimization; Algorithm; Electrical impedance; Transport engineering; Engineering; Mathematics","score_opus":0.009240174948928979,"score_gpt":0.26847013535146136,"score_spread":0.2592299604025324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977642222","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.015593565,0.00008850538,0.9831322,0.000047392456,0.000014147133,0.000035353718,0.00022088092,0.00024068172,0.0006272567],"genre_scores_gemma":[0.44837686,0.0003336306,0.5471141,0.000035170546,0.000042427055,0.00020680342,0.0017088469,0.0000863585,0.0020957827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998253,0.000033468266,0.000015424755,0.000055036893,0.000046682882,0.000024174826],"domain_scores_gemma":[0.99960166,0.00014148344,0.000050644197,0.000040326162,0.00014060497,0.000025239297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029928633,0.0006208961,0.00063563307,0.0016950301,0.00042119407,0.0005165403,0.0008809281,0.00042792424,0.0018620207],"category_scores_gemma":[0.001498346,0.0003273358,0.00076334353,0.0020478657,0.00025136958,0.0008820141,0.0007102445,0.00060768373,0.00058037793],"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.000079083125,0.00012349129,0.0043368894,0.0001777737,0.00006670171,0.00016192842,0.00016037082,0.71839345,0.0038972956,0.010285741,0.0023080618,0.26000917],"study_design_scores_gemma":[0.0000021565295,0.000012799045,0.00029386248,0.0000040350756,0.0000046011837,0.000017943259,0.000017218761,0.9967771,0.00037748725,0.0020367843,0.000450958,0.000004981765],"about_ca_topic_score_codex":0.009962619,"about_ca_topic_score_gemma":0.008682357,"teacher_disagreement_score":0.009962619,"about_ca_system_score_codex":0.00034035763,"about_ca_system_score_gemma":0.001037519,"threshold_uncertainty_score":0.019809246},"labels":[],"label_agreement":null},{"id":"W3125624299","doi":"10.1061/9780784482292.413","title":"A Multiple Path Gradient Projection Method for Solving the Logit-Based Stochastic User Equilibrium Problem","year":2019,"lang":"en","type":"article","venue":"CICTP 2019","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Path (computing); Gradient descent; Variational inequality; Mathematical optimization; Logit; Computer science; Stochastic gradient descent; Projection (relational algebra); Set (abstract data type); Algorithm; Mathematics; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.023643728050438944,"score_gpt":0.3018332930497648,"score_spread":0.27818956499932584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125624299","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.0017733809,0.0001201205,0.9962597,0.00010546257,0.0000292661,0.000045772267,0.000016206975,0.0000874941,0.0015626587],"genre_scores_gemma":[0.17776726,0.0005500513,0.81320894,0.00015931105,0.00006913372,0.00058189343,0.00015438777,0.00014733455,0.0073616537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945635,0.00024643887,0.000018342105,0.00008087793,0.00014562554,0.00005240225],"domain_scores_gemma":[0.9995142,0.00028172147,0.000028589131,0.000017397264,0.0001285724,0.000029485565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011429181,0.00086387485,0.00108363,0.00070557,0.00065669254,0.0008953383,0.0012320094,0.0011444782,0.00490853],"category_scores_gemma":[0.0023040092,0.0005318375,0.0008115272,0.00092767435,0.00073428487,0.001328496,0.0013608679,0.0019073052,0.0006958277],"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.00004622626,0.00007221951,0.00066581025,0.00013854468,0.00005507868,0.00011392809,0.00010148961,0.8370432,0.0012691375,0.053975858,0.003734223,0.102784246],"study_design_scores_gemma":[0.000008651939,0.000016144062,0.000045874727,0.000005899452,0.0000035630283,0.000021171001,0.000010543442,0.9925315,0.00017207643,0.0060523646,0.0011263464,0.0000058959813],"about_ca_topic_score_codex":0.009771854,"about_ca_topic_score_gemma":0.0073268977,"teacher_disagreement_score":0.009771854,"about_ca_system_score_codex":0.000773368,"about_ca_system_score_gemma":0.002778143,"threshold_uncertainty_score":0.019429922},"labels":[],"label_agreement":null}]}