{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"ffd3c5d2973c","filters":{"venue":"Journal of Rail Transport Planning & Management"}},"results":[{"id":"W4411586097","doi":"10.1016/j.jrtpm.2025.100532","title":"Analysis of freight train passing a stop signal using machine learning: Application of XGBoost and SHAP","year":2025,"lang":"en","type":"article","venue":"Journal of Rail Transport Planning & Management","topic":"Railway Engineering and Dynamics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Canadian Pacific Railway (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Transport Canada","keywords":"Transport engineering; Computer science; Train; SIGNAL (programming language); Rail freight transport; Engineering; Automotive engineering; Real-time computing; Geography","authors":[{"name":"Mona Ahmadi Rad","is_ca":true},{"name":"Lianne Lefsrud","is_ca":true},{"name":"Michael T. Hendry","is_ca":true},{"name":"Asdrubal Cheng Cen","is_ca":true},{"name":"Sara Soltaninejad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00800928111972635,"gpt":0.2242007164316662,"spread":0.2161914353119399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000971088,0.000662567,0.0009450264,0.001298459,0.0005490928,0.0007688115,0.0007200866,0.0008803701,0.001302207],"category_scores_gemma":[0.00122908,0.0003012062,0.0007910508,0.0007906054,0.0003235904,0.0007015888,0.0002940712,0.000657706,0.0001712927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007693575,"about_ca_system_score_gemma":0.001169451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02474125,"about_ca_topic_score_gemma":0.01073995,"domain_scores_codex":[0.9997866,0.0000456676,0.00001135474,0.00005236091,0.00004727568,0.00005680688],"domain_scores_gemma":[0.9993462,0.0003981147,0.00006306668,0.00002647445,0.0001289499,0.00003727153],"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.0001178222,0.0001270064,0.003645631,0.000032104,0.00004503627,0.0000627197,0.00002229857,0.9585437,0.001506261,0.001059162,0.0005662823,0.03427203],"study_design_scores_gemma":[9.344735e-7,0.000004994642,0.0003863192,4.942131e-7,0.00000213046,0.00000243893,0.000003052989,0.9993375,0.0001340659,0.0001063857,0.00002064906,0.000001070934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5492209,0.0002797623,0.4471444,0.0002525987,0.00006168881,0.00005139857,0.0001216079,0.0008957647,0.001971866],"genre_scores_gemma":[0.97896,0.00005072368,0.01900339,0.00001979193,0.00002155754,0.00001729329,0.0002031714,0.00004677619,0.001677308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02474125,"threshold_uncertainty_score":0.04919446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403889954","doi":"10.1016/j.jrtpm.2024.100486","title":"A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation","year":2024,"lang":"en","type":"article","venue":"Journal of Rail Transport Planning & Management","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Blocking (statistics); Hazardous waste; Transport engineering; Computer science; Operations research; Mathematical optimization; Engineering; Waste management; Mathematics; Computer network","authors":[{"name":"Masoud Yaghini","is_ca":false},{"name":"Hosna Pooladi","is_ca":false},{"name":"Mohammad Karimi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04777941264852487,"gpt":0.358061531664961,"spread":0.3102821190164361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002090783,0.001309162,0.002260082,0.001245287,0.0008456615,0.001933784,0.002319467,0.00276535,0.008475091],"category_scores_gemma":[0.002696423,0.001224353,0.001622864,0.001867531,0.0007192643,0.001628641,0.00113771,0.002666476,0.000610464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001646982,"about_ca_system_score_gemma":0.003254676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03334792,"about_ca_topic_score_gemma":0.02435042,"domain_scores_codex":[0.9992349,0.0003460481,0.00003222923,0.0000882902,0.0001847009,0.0001136741],"domain_scores_gemma":[0.9986368,0.0009571937,0.00008388634,0.00003021121,0.0002175721,0.00007420019],"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.00001825436,0.00003583606,0.00008499299,0.00003387358,0.00001413069,0.00001873911,0.00001017943,0.9920574,0.0001217027,0.002584567,0.0002839535,0.004736414],"study_design_scores_gemma":[0.000004991155,0.000009783826,0.00002432631,0.00000276904,0.000005152214,0.000002228835,0.000003300129,0.9991695,0.00002027003,0.0006723268,0.00008292913,0.000002418634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02182935,0.0004437018,0.9703516,0.0003370034,0.00009374093,0.0001662903,0.0002564366,0.0001767777,0.006345124],"genre_scores_gemma":[0.5601098,0.001078452,0.4248595,0.000191997,0.0001183558,0.0009674768,0.0006198746,0.0001892763,0.01186522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03334792,"threshold_uncertainty_score":0.0663076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}