{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"516d09df528f","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xiaolin Lu","is_ca":true},{"name":"Bahman Madadi","is_ca":true},{"name":"Haneen Farah","is_ca":true},{"name":"Maaike Snelder","is_ca":true},{"name":"Jan Anne Annema","is_ca":true},{"name":"Bart van Arem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007438479955866551,"gpt":0.2422901655287659,"spread":0.2348516855728994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216226,0.0005820781,0.0002065956,0.001296178,0.0009739557,0.002796612,0.001172408,0.001680397,0.004573106],"category_scores_gemma":[0.01103253,0.0004149824,0.000684173,0.0008877081,0.0008197559,0.002897859,0.001642137,0.0009066517,0.0005996278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002038175,"about_ca_system_score_gemma":0.001829779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005184487,"about_ca_topic_score_gemma":0.006252422,"domain_scores_codex":[0.9948243,0.002408412,0.000402948,0.0002586034,0.001587927,0.0005178199],"domain_scores_gemma":[0.9916524,0.004667253,0.0007946499,0.0005777715,0.001929955,0.0003780019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001809471,0.0002030185,0.0106073,0.0005151942,0.00007297668,0.003174209,0.005463091,0.5461305,0.009787477,0.392371,0.003590778,0.02790353],"study_design_scores_gemma":[0.00005266103,0.0003940492,0.01211936,0.0004536495,0.00009514434,0.002515577,0.01417824,0.6906753,0.007238007,0.1825737,0.0895234,0.0001808921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4379626,0.0003796318,0.4142651,0.002316087,0.00006088967,0.001613076,0.002560366,0.0005129334,0.1403294],"genre_scores_gemma":[0.9572133,0.0001461448,0.03969845,0.00003955186,0.00000921491,0.0004105515,0.001126006,0.00002589369,0.001330813],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005184487,"threshold_uncertainty_score":0.0170092,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jiyan Wu","is_ca":true},{"name":"Ye Tian","is_ca":true},{"name":"Jian Sun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02562748218088755,"gpt":0.3106745718011086,"spread":0.2850470896202211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661136,0.00185119,0.002234998,0.001121742,0.0006301804,0.002413438,0.001541944,0.001976324,0.003485464],"category_scores_gemma":[0.005254563,0.0009969163,0.001409453,0.001418271,0.001062664,0.001480899,0.001810308,0.002982762,0.000453458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001599486,"about_ca_system_score_gemma":0.003757328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007371224,"about_ca_topic_score_gemma":0.004950447,"domain_scores_codex":[0.9988293,0.0005122838,0.00005305065,0.0002180217,0.0002046851,0.0001825733],"domain_scores_gemma":[0.9984439,0.0009871578,0.0001439033,0.00003967287,0.0003025673,0.00008284116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001470579,0.00004297811,0.0002730184,0.00009875265,0.00003022683,0.00004729531,0.00004518295,0.960212,0.0003640126,0.03060132,0.0005880437,0.007682486],"study_design_scores_gemma":[0.000005783885,0.00002079517,0.00003979415,0.0000118388,0.000006352798,0.000007676747,0.00001471567,0.9898868,0.00008301726,0.009456596,0.000460725,0.000005889706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003296854,0.0001764216,0.9933953,0.0001942235,0.00002483215,0.00004893102,0.00004999608,0.00004800228,0.002765567],"genre_scores_gemma":[0.5110884,0.001322101,0.4786305,0.0002857296,0.0001393443,0.001114342,0.0003735437,0.0001219537,0.006924098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007371224,"threshold_uncertainty_score":0.0146566,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Liu He","is_ca":true},{"name":"Haoning Xi","is_ca":true},{"name":"Jiandong Qiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02294618861288943,"gpt":0.3269036790508258,"spread":0.3039574904379364,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080479,0.0008502469,0.0006603187,0.000752595,0.00107958,0.001107864,0.001396914,0.001687319,0.001833796],"category_scores_gemma":[0.001511574,0.0002626106,0.0006524334,0.0009985175,0.0008992472,0.001418349,0.0008744614,0.0007398789,0.00007916424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002027182,"about_ca_system_score_gemma":0.001408177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02412544,"about_ca_topic_score_gemma":0.0180116,"domain_scores_codex":[0.9989915,0.0004461671,0.0000347118,0.0001045429,0.000174955,0.0002481035],"domain_scores_gemma":[0.9989937,0.0004906358,0.00009586368,0.00009114435,0.0002309628,0.00009779097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001163569,0.0002425029,0.00395332,0.0001042286,0.00003682432,0.00123326,0.00009297608,0.9772549,0.001505693,0.007583448,0.000709805,0.007166777],"study_design_scores_gemma":[0.00005204061,0.0001917834,0.001897175,0.000006637153,0.00003478432,0.0001097486,0.0003536189,0.9928818,0.001508043,0.002155397,0.0007840854,0.00002488437],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9373404,0.0002782849,0.04401854,0.0005119064,0.00004471857,0.0002691433,0.0001938781,0.0001436907,0.01719955],"genre_scores_gemma":[0.9948776,0.00008793177,0.004078974,0.000009448409,0.000005884245,0.00004369625,0.00003396612,0.000004489182,0.0008581006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02412544,"threshold_uncertainty_score":0.04797,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lanfang Zhang","is_ca":true},{"name":"Kun Zhao","is_ca":true},{"name":"Xuekun Wang","is_ca":true},{"name":"Shuo Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01353830895400769,"gpt":0.2516004260242785,"spread":0.2380621170702708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008213174,0.0004078965,0.0002490802,0.0009685617,0.0001296454,0.0006316013,0.0005024655,0.0001840085,0.0007906951],"category_scores_gemma":[0.003180235,0.0001647503,0.0002699322,0.0007457351,0.0001827968,0.001175742,0.0002538111,0.0001631708,0.0001601987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002421751,"about_ca_system_score_gemma":0.0004377782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893143,"about_ca_topic_score_gemma":0.001828032,"domain_scores_codex":[0.9991201,0.0003021276,0.00005739329,0.0001321172,0.0003383027,0.00005000301],"domain_scores_gemma":[0.9980839,0.0007546123,0.000275379,0.000127014,0.0006825362,0.00007649932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001616989,0.001066289,0.2621847,0.001102253,0.0002959639,0.0002908154,0.001754583,0.137855,0.1651626,0.00434417,0.0007763018,0.4235505],"study_design_scores_gemma":[0.0001090088,0.007048825,0.3538561,0.0001984804,0.0006932294,0.0006886896,0.003911268,0.4542711,0.1667825,0.002482902,0.009707045,0.000250994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9689013,0.0004001372,0.02809296,0.00002811677,0.00001028953,0.00003442059,0.00007579961,0.00008148017,0.002375492],"genre_scores_gemma":[0.993501,0.0002671948,0.005726148,0.000006716835,0.000004755896,0.00001983401,0.0001214382,0.00001268701,0.0003402202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001893143,"threshold_uncertainty_score":0.004343629,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ye Tian","is_ca":true},{"name":"Yi-Chang Chiu","is_ca":true},{"name":"Jian Sun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009240174948928979,"gpt":0.2684701353514614,"spread":0.2592299604025324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002992863,0.0006208961,0.0006356331,0.00169503,0.0004211941,0.0005165403,0.0008809281,0.0004279242,0.001862021],"category_scores_gemma":[0.001498346,0.0003273358,0.0007633435,0.002047866,0.0002513696,0.0008820141,0.0007102445,0.0006076837,0.0005803779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003403576,"about_ca_system_score_gemma":0.001037519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009962619,"about_ca_topic_score_gemma":0.008682357,"domain_scores_codex":[0.9998253,0.00003346827,0.00001542476,0.00005503689,0.00004668288,0.00002417483],"domain_scores_gemma":[0.9996017,0.0001414834,0.0000506442,0.00004032616,0.000140605,0.0000252393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007908313,0.0001234913,0.004336889,0.0001777737,0.00006670171,0.0001619284,0.0001603708,0.7183934,0.003897296,0.01028574,0.002308062,0.2600092],"study_design_scores_gemma":[0.000002156529,0.00001279905,0.0002938625,0.000004035076,0.000004601184,0.00001794326,0.00001721876,0.9967771,0.0003774872,0.002036784,0.000450958,0.000004981765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01559357,0.00008850538,0.9831322,0.00004739246,0.00001414713,0.00003535372,0.0002208809,0.0002406817,0.0006272567],"genre_scores_gemma":[0.4483769,0.0003336306,0.5471141,0.00003517055,0.00004242705,0.0002068034,0.001708847,0.0000863585,0.002095783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009962619,"threshold_uncertainty_score":0.01980925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Heqing Tan","is_ca":false},{"name":"Muqing Du","is_ca":false},{"name":"Chun-bin Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02364372805043894,"gpt":0.3018332930497648,"spread":0.2781895649993258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142918,0.0008638749,0.00108363,0.00070557,0.0006566925,0.0008953383,0.001232009,0.001144478,0.00490853],"category_scores_gemma":[0.002304009,0.0005318375,0.0008115272,0.0009276744,0.0007342849,0.001328496,0.001360868,0.001907305,0.0006958277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000773368,"about_ca_system_score_gemma":0.002778143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009771854,"about_ca_topic_score_gemma":0.007326898,"domain_scores_codex":[0.9994563,0.0002464389,0.00001834211,0.00008087793,0.0001456255,0.00005240225],"domain_scores_gemma":[0.9995142,0.0002817215,0.00002858913,0.00001739726,0.0001285724,0.00002948557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004622626,0.00007221951,0.0006658103,0.0001385447,0.00005507868,0.0001139281,0.0001014896,0.8370432,0.001269137,0.05397586,0.003734223,0.1027842],"study_design_scores_gemma":[0.000008651939,0.00001614406,0.00004587473,0.000005899452,0.000003563028,0.000021171,0.00001054344,0.9925315,0.0001720764,0.006052365,0.001126346,0.000005895981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001773381,0.0001201205,0.9962597,0.0001054626,0.0000292661,0.00004577227,0.00001620698,0.0000874941,0.001562659],"genre_scores_gemma":[0.1777673,0.0005500513,0.8132089,0.0001593111,0.00006913372,0.0005818934,0.0001543878,0.0001473345,0.007361654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009771854,"threshold_uncertainty_score":0.01942992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}