{"meta":{"query_hash":"ddce59c28039","filters":{"venue":"Smart and Resilient Transport"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/ddce59c28039","api":"https://metacan.xera.ac/api/v1/cohort?venue=Smart+and+Resilient+Transport"},"results":[{"id":"W3213598897","doi":"10.1108/srt-08-2021-0008","title":"Modeling a robust multi-objective locating-routing problem with bounded delivery time using meta-heuristic algorithms","year":2021,"lang":"en","type":"article","venue":"Smart and Resilient Transport","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Tardiness; Sorting; Genetic algorithm; Particle swarm optimization; Bottleneck; Routing (electronic design automation); Heuristic; Algorithm; Mathematics; Job shop scheduling","score_opus":0.03633847495880669,"score_gpt":0.24317006625681004,"score_spread":0.20683159129800335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213598897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35352138,0.00072860427,0.64488953,0.000012275854,0.00006889262,0.0002177025,0.000011844876,0.00025531094,0.0002944411],"genre_scores_gemma":[0.552267,0.000048229816,0.4473612,0.000016603819,0.00003704182,0.000015175161,0.00003398306,0.00006744504,0.00015329062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998267,0.00008670552,0.00045547553,0.00048197724,0.00027510806,0.00043374998],"domain_scores_gemma":[0.99927753,0.00005925375,0.000051131938,0.00023904964,0.00023415494,0.00013889928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045209695,0.00032760703,0.00049467647,0.000104362094,0.0002727035,0.0000604697,0.000088609326,0.00012398337,0.00002728191],"category_scores_gemma":[0.000020293666,0.00029146933,0.00011084378,0.00042682493,0.00006721796,0.000176969,0.000020045538,0.0002952895,0.0000034055458],"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.000017919821,0.000042857773,0.0032279477,0.00013876353,0.00049533794,0.00006818763,0.0007917246,0.99359185,0.0011952749,0.000017363385,0.0000016189912,0.0004111366],"study_design_scores_gemma":[0.00070902787,0.000026390695,0.0004916602,0.00014736243,0.000876873,0.00007531565,0.00026145965,0.9956835,0.0013181192,0.000017197875,0.000012719335,0.00038040537],"about_ca_topic_score_codex":0.00011373148,"about_ca_topic_score_gemma":0.00010592434,"teacher_disagreement_score":0.19874565,"about_ca_system_score_codex":0.00008080895,"about_ca_system_score_gemma":0.00012297898,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null}]}