{"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":"4946d1ea40f9","filters":{"venue":"Surveys in Operations Research and Management Science"}},"results":[{"id":"W2552244994","doi":"10.1016/j.sorms.2016.11.001","title":"Optimization models for large scale network evacuation planning and management: A literature review","year":2016,"lang":"en","type":"review","venue":"Surveys in Operations Research and Management Science","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"GRASP; Computer science; Emergency management; Emergency evacuation; Network planning and design; Traffic congestion; Operations research; Scale (ratio); Demand management; Traffic flow (computer networking); Transportation planning; Transport engineering; Risk analysis (engineering); Engineering; Computer security; Business","authors":[{"name":"Vedat Bayram","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07967602028413266,"gpt":0.4101540051230216,"spread":0.3304779848388889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01117763,0.0002302624,0.0004108883,0.0008190076,0.0005629549,0.0005483094,0.0003558664,0.00009353051,0.00001010319],"category_scores_gemma":[0.00006460919,0.0001868225,0.00004064087,0.002289064,0.0001264827,0.0008379794,0.0002708749,0.0002198356,0.000004922026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667614,"about_ca_system_score_gemma":0.00004231549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001136562,"about_ca_topic_score_gemma":0.00005404015,"domain_scores_codex":[0.9975406,0.000386302,0.0004451614,0.0005486025,0.0004991486,0.0005801665],"domain_scores_gemma":[0.9991744,0.0001259185,0.00002904835,0.0003498145,0.0002070643,0.0001137577],"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.000001944274,0.00003454278,0.000005631917,0.0642674,0.00005617762,0.000007640906,0.0001280428,0.2684115,8.365628e-8,0.04807633,0.001651114,0.6173596],"study_design_scores_gemma":[0.0002989539,0.00002752921,0.0000208455,0.06659503,0.000044908,0.000003250935,0.00003552611,0.8097803,4.403764e-8,0.0006215773,0.1222738,0.0002982638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[3.749613e-7,0.6425525,0.3526666,0.00003634978,0.00007668496,0.002235023,0.00004931026,0.00003528735,0.002347938],"genre_scores_gemma":[0.00001717276,0.9839555,0.01324997,0.00002894503,0.00004280968,0.001268645,0.0003132602,0.00002948364,0.001094193],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.6170613,"threshold_uncertainty_score":0.7618399,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048113057","doi":"10.1016/j.sorms.2014.09.001","title":"Queueing-theoretic approaches for dynamic scheduling: A survey","year":2014,"lang":"en","type":"article","venue":"Surveys in Operations Research and Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Dynamic priority scheduling; Scheduling (production processes); Distributed computing; Mathematical optimization; Two-level scheduling; Fair-share scheduling; Layered queueing network; Operations research; Mathematics; Computer network; Quality of service","authors":[{"name":"Daria Terekhov","is_ca":true},{"name":"Douglas G. Down","is_ca":true},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09398401633335034,"gpt":0.3579786254718068,"spread":0.2639946091384565,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.04709679,0.0001394462,0.0001732175,0.001446017,0.001138412,0.0009716118,0.0006727186,0.00003299752,0.00002078251],"category_scores_gemma":[0.00297695,0.0001285405,0.00002691136,0.003257073,0.001123859,0.001391769,0.0005482781,0.0001684069,0.00003925111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000796896,"about_ca_system_score_gemma":0.00003158805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006402458,"about_ca_topic_score_gemma":0.008348022,"domain_scores_codex":[0.997463,0.0004024759,0.0002658077,0.0006864254,0.0005466459,0.0006356749],"domain_scores_gemma":[0.998692,0.000419587,0.00003381449,0.000455403,0.0003653974,0.00003375736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002029463,0.0001040701,0.007571297,0.0001515059,0.00001093639,0.000001080769,0.0000401951,0.04256631,0.00007881974,0.9313171,0.00002309607,0.01811532],"study_design_scores_gemma":[0.0003834433,0.00002576916,0.05540768,0.00003828876,0.000006921713,2.177074e-7,0.0003306125,0.8810852,0.00001725095,0.06181372,0.0006980881,0.0001928333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4873317,0.00005931244,0.4962303,0.0008198091,0.0001466512,0.00132724,0.00000549966,0.00008934899,0.01399017],"genre_scores_gemma":[0.9938582,0.00004848101,0.004587559,0.00009966634,0.0000562069,0.0002326715,0.00004468515,0.00001681801,0.001055768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8695034,"threshold_uncertainty_score":0.9812144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}