{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"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":"50f47fdb9815","filters":{"venue":"International Teletraffic Congress"}},"results":[{"id":"W1657259300","doi":"","title":"A graph theoretical approach to traffic engineering and network control problem","year":2009,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Network traffic control; Robustness (evolution); Traffic engineering; Computer science; Traffic generation model; Mathematical optimization; Graph theory; Criticality; Multiprotocol Label Switching; Betweenness centrality; Network traffic simulation; Network planning and design; Internet traffic engineering; Network topology; Distributed computing; Topology (electrical circuits); Computer network; Mathematics; Quality of service","authors":[{"name":"Ali Tizghadam","is_ca":true},{"name":"Alberto Leon‐Garcia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004265228968429004,"gpt":0.2026859714419746,"spread":0.1984207424735455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003937568,0.0002560988,0.0002839705,0.00017861,0.0001055423,0.0003458023,0.0009662401,0.0001006513,0.0000185356],"category_scores_gemma":[0.00005467143,0.0002391942,0.00009482399,0.0003914254,0.00007723404,0.000244907,0.00007417753,0.0002562349,0.00001986723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003844638,"about_ca_system_score_gemma":0.00003637985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.302095e-7,"about_ca_topic_score_gemma":7.911196e-7,"domain_scores_codex":[0.9980974,0.00005357666,0.0003478578,0.0005890692,0.0004402641,0.0004718016],"domain_scores_gemma":[0.9989785,0.0002224393,0.00007109045,0.0002964278,0.0001579191,0.0002736501],"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.00002960448,0.00008563336,0.00002099486,0.000002834889,0.00005037077,0.00001606416,0.0000920124,0.2202501,0.00001887545,0.4890369,0.001901461,0.2884951],"study_design_scores_gemma":[0.001190076,0.0001464259,0.0008517072,0.00005116496,0.00001404866,0.0001219906,0.000008159945,0.9861286,0.000005060977,0.001644273,0.009501909,0.0003365785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06077753,0.0004007781,0.9180506,0.0113405,0.001728236,0.0007811955,0.000007508572,0.0008938462,0.006019795],"genre_scores_gemma":[0.9738501,0.00001763337,0.02374686,0.001674333,0.0005110234,0.0000571961,0.000004441394,0.00001288486,0.0001255703],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9130725,"threshold_uncertainty_score":0.9754055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W59026020","doi":"10.5555/2414276.2414283","title":"Processor sharing and pricing implications","year":2012,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Processor sharing; Computer science; Payment; Revenue; Bandwidth (computing); Operator (biology); Variable pricing; Operations research; Microeconomics; Computer network; Economics; Queueing theory; Finance; Mathematics; World Wide Web","authors":[{"name":"Sharad Birmiwal","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Shreyas Sundaram","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0167023522002168,"gpt":0.2641182042434546,"spread":0.2474158520432378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002227607,0.0001133314,0.0001016163,0.0001057602,0.0001173285,0.0001988328,0.0007144831,0.00004486664,0.00003131071],"category_scores_gemma":[0.00005648878,0.0001086481,0.00003290235,0.0001756205,0.00004031779,0.0007231138,0.0002043661,0.0001198734,0.00003774533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003874317,"about_ca_system_score_gemma":0.00002391379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003487178,"about_ca_topic_score_gemma":0.000003495547,"domain_scores_codex":[0.999038,0.00001404414,0.0001976865,0.0002795864,0.0001993247,0.0002714063],"domain_scores_gemma":[0.999303,0.0001015576,0.00008653212,0.0002348185,0.0001394028,0.0001346496],"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.000004749749,0.00008627319,0.03841463,0.000007540141,0.00005312761,0.0000026858,0.000374577,0.0002101145,0.0001266532,0.2775417,0.001052125,0.6821259],"study_design_scores_gemma":[0.001977174,0.00007031568,0.1469935,0.0001528294,0.0000402666,0.0005591169,0.0001369927,0.6884474,0.0004346996,0.002811357,0.1573462,0.001030132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6901463,0.001397544,0.2801622,0.01063573,0.004133453,0.0003906274,0.000006366052,0.0008041399,0.01232368],"genre_scores_gemma":[0.9960098,0.00003294484,0.002424229,0.0003460202,0.0003970378,0.00004929317,0.000003706548,0.000008206189,0.000728784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6882372,"threshold_uncertainty_score":0.4430542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1795306810","doi":"","title":"On a positive recurrence criterion for multidimensional Markov chains with application to the stability of slotted-Aloha with a finite number of queues","year":2009,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Aloha; Markov chain; Queue; Stability (learning theory); Markov process; Countable set; Queueing theory; Mathematics; Applied mathematics; Computer science; Stochastic dominance; Mathematical optimization; Discrete mathematics; Statistics; Throughput","authors":[{"name":"Sayee C. Kompalli","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01075652007165024,"gpt":0.2884480975668475,"spread":0.2776915774951972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002975884,0.0001351051,0.0001709081,0.00005886451,0.00005853597,0.0000319249,0.0005184484,0.00003930326,0.00001281856],"category_scores_gemma":[0.00006479175,0.00008608815,0.00004752297,0.0002348408,0.00007507492,0.0001178922,0.00004636136,0.00009880605,0.00000238905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004163356,"about_ca_system_score_gemma":0.00006560366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002287404,"about_ca_topic_score_gemma":0.00006355826,"domain_scores_codex":[0.9987552,0.00005870029,0.0002607939,0.0003422736,0.0004365072,0.0001465974],"domain_scores_gemma":[0.9980693,0.000642741,0.0002174193,0.0003251538,0.0006973398,0.00004805425],"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.007354341,0.002156981,0.00544995,0.0001182885,0.000275685,0.00001639651,0.004095796,0.04452145,0.002530985,0.2783863,0.002714957,0.6523789],"study_design_scores_gemma":[0.003214491,0.004076974,0.06483169,0.001676017,0.0000245959,0.00005379997,0.00009736588,0.8976542,0.02081294,0.001150516,0.005759106,0.0006482734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4333827,0.000009707857,0.5589672,0.003129628,0.0001536125,0.003902125,0.0001081925,0.00003987288,0.0003069219],"genre_scores_gemma":[0.9820848,0.000001551394,0.01674255,0.0003189139,0.00005264886,0.0007418995,0.00001861201,0.00000600652,0.00003298885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8531328,"threshold_uncertainty_score":0.3510573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1545511512","doi":"10.5555/2043468.2043512","title":"Two-level cache architecture to reduce memory accesses for IP lookups","year":2011,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Cache; Bottleneck; Routing table; Tree traversal; Prefix; Computer network; Network packet; Operating system; Routing protocol; Embedded system; Algorithm","authors":[{"name":"Sunil Ravinder","is_ca":true},{"name":"Mário A. Nascimento","is_ca":true},{"name":"M.H. MacGregor","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0634416463568282,"gpt":0.3069556644432329,"spread":0.2435140180864047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002557199,0.0001847498,0.0001558236,0.0002231952,0.0001289603,0.0002545285,0.001604082,0.00006684133,0.0000487284],"category_scores_gemma":[0.0001804193,0.0001729271,0.00007614386,0.0003193376,0.00004914172,0.0003927567,0.000205692,0.0001410835,0.00003308761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005535063,"about_ca_system_score_gemma":0.0001103635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002702947,"about_ca_topic_score_gemma":0.00005519375,"domain_scores_codex":[0.9985647,0.00003416341,0.0002703088,0.0005008209,0.0003387437,0.0002913041],"domain_scores_gemma":[0.9988007,0.000155872,0.0001306065,0.0003388722,0.0004428255,0.0001311194],"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.0001319878,0.0002052164,0.0001307596,0.00003653044,0.0001139321,0.00003076304,0.002769279,0.03196477,0.0003533463,0.01542253,0.008062207,0.9407787],"study_design_scores_gemma":[0.009413609,0.001027518,0.007743291,0.001252982,0.0001397988,0.0006797375,0.0006768389,0.6622469,0.1521267,0.03665397,0.1238177,0.00422093],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02743587,0.00009180179,0.9571866,0.001640168,0.003789361,0.0003407553,0.00002328763,0.0003041277,0.009188069],"genre_scores_gemma":[0.7802873,0.000008492954,0.215822,0.0006897862,0.0004942228,0.00008783869,0.00001913515,0.00002062227,0.002570618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9365578,"threshold_uncertainty_score":0.7051765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1541671749","doi":"","title":"MUD receiver capacity optimization for wireless ad hoc networks","year":2009,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Throughput; Computer network; Node (physics); Wireless; Wireless network; Quality of service; Engineering; Telecommunications","authors":[{"name":"Jahangir H. Sarker","is_ca":true},{"name":"Zbigniew Dziong","is_ca":true},{"name":"François Gagnon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02926541796276157,"gpt":0.2902900294223885,"spread":0.261024611459627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194242,0.000210607,0.000217623,0.0002371434,0.0002246054,0.0004335505,0.002956519,0.0001579909,0.00008774173],"category_scores_gemma":[0.0001394418,0.0002189423,0.0001296967,0.0004727537,0.0001003557,0.0007428405,0.0002350134,0.0003442614,0.00001791465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001952726,"about_ca_system_score_gemma":0.00007409509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003837586,"about_ca_topic_score_gemma":0.00001655297,"domain_scores_codex":[0.9978961,0.000126348,0.0004134131,0.0005250118,0.0006133522,0.0004258009],"domain_scores_gemma":[0.9975216,0.0004738057,0.000200165,0.0008259835,0.0008327877,0.0001456119],"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.00005417999,0.0001738694,0.00004755674,0.00000475192,0.00005127683,0.000006825149,0.0001421532,0.4031172,0.00005958962,0.02194686,0.007945883,0.5664499],"study_design_scores_gemma":[0.0007340772,0.00009141415,0.0007090304,0.00004933737,0.000003648296,0.00001708856,0.000009413266,0.9718223,0.0001561556,0.0003860301,0.02577972,0.0002418141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02684161,0.0004844138,0.9612836,0.007176967,0.001892113,0.0005354835,0.00001272317,0.0003789852,0.001394129],"genre_scores_gemma":[0.9315737,0.0008025401,0.06583425,0.0005893413,0.0002897747,0.00008234866,0.00007551802,0.00001865435,0.0007338587],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9047321,"threshold_uncertainty_score":0.8928207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1517429491","doi":"10.5555/2043468.2043505","title":"MG-Local: a multivariable control framework for optimal wireless resource management","year":2011,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Bottleneck; Computer science; Throughput; Multivariable calculus; Computer network; Network packet; Wireless network; Network congestion; Distributed computing; Resource management (computing); Packet loss; Resource allocation; Wireless; Engineering; Telecommunications; Control engineering","authors":[{"name":"Chen Liu","is_ca":true},{"name":"M.H. MacGregor","is_ca":true},{"name":"Janelle Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02347891835210501,"gpt":0.2704182445018802,"spread":0.2469393261497752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004268616,0.0002414616,0.0002548262,0.000147006,0.0001435336,0.0002165565,0.00199967,0.0001528253,0.0001413878],"category_scores_gemma":[0.00003295221,0.0002298969,0.0001519044,0.00021411,0.00009898008,0.0003118435,0.0002700823,0.0002352226,0.00004021064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008048693,"about_ca_system_score_gemma":0.00003289588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002034978,"about_ca_topic_score_gemma":0.000003446434,"domain_scores_codex":[0.9980329,0.00006156512,0.0004036952,0.0006035203,0.0004414202,0.0004568651],"domain_scores_gemma":[0.998505,0.0004130758,0.0001986366,0.0005339007,0.0002120264,0.0001373454],"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.0002732056,0.000264283,0.0001534131,0.00003675967,0.0002814342,0.0000901427,0.0004095507,0.004967495,0.00001413746,0.706011,0.005650368,0.2818482],"study_design_scores_gemma":[0.00302078,0.0002002461,0.0007561023,0.000320122,0.00002341779,0.0000302155,0.0001245082,0.7731303,0.000610794,0.007956004,0.2132921,0.0005353647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002197637,0.00003365743,0.985674,0.0005168791,0.001494715,0.003045491,0.00002316899,0.0002981914,0.006716286],"genre_scores_gemma":[0.8128015,0.000006495899,0.1818208,0.0006462991,0.0003285834,0.003356108,0.000009623262,0.00002935356,0.001001275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8106039,"threshold_uncertainty_score":0.9374925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3136283670","doi":"10.5555/2414276.3256814","title":"Session details: Traffic monitoring","year":2012,"lang":"en","type":"article","venue":"International Teletraffic Congress","topic":"Diverse Specialized Academic Research","field":"Economics, Econometrics and Finance","cited_by":0,"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":"Session (web analytics); Computer science; World Wide Web","authors":[{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07320512162428952,"gpt":0.3123173565591973,"spread":0.2391122349349078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007072398,0.0001560078,0.0002404807,0.0003765012,0.00009400498,0.0001244857,0.0006294132,0.0001448002,0.003441336],"category_scores_gemma":[0.0003081435,0.0001769133,0.0001225801,0.0002141307,0.00007701515,0.000717528,0.0001431828,0.0003433296,0.003572575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002536308,"about_ca_system_score_gemma":0.00001653622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002262824,"about_ca_topic_score_gemma":0.000001113867,"domain_scores_codex":[0.9984931,0.00002025635,0.0004983501,0.0003181643,0.0001853163,0.0004848441],"domain_scores_gemma":[0.9992152,0.0001055995,0.0002071553,0.0002131957,0.00007432481,0.0001845066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001046417,0.000654246,0.5988765,0.00004364203,0.0004186291,0.00004714702,0.001630389,0.001131481,0.000375592,0.2198017,0.02719866,0.1497173],"study_design_scores_gemma":[0.001287517,0.00002858942,0.06064666,0.00007599233,0.000006297165,0.00003292775,0.0004046976,0.002877955,0.001029095,0.0008075805,0.9322731,0.0005295748],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9164799,0.001685087,0.0001659352,0.0005946685,0.01011317,0.0001604222,0.00007198593,0.0001239223,0.07060495],"genre_scores_gemma":[0.9913166,0.0003205047,0.0004061054,0.00005516901,0.002020912,0.00002645381,0.00001564487,0.00002809994,0.005810501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9050745,"threshold_uncertainty_score":0.9974697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}