{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109444,0.001477949,0.0008906581,0.002048052,0.0008519081,0.002135059,0.001558175,0.001777653,0.006342791],"category_scores_gemma":[0.002664774,0.0004337615,0.0009610211,0.002190941,0.003110297,0.002850431,0.001295532,0.003246312,0.0006625513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002754071,"about_ca_system_score_gemma":0.001677246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003940598,"about_ca_topic_score_gemma":0.002500901,"domain_scores_codex":[0.9987693,0.0005646333,0.00004114846,0.0002015162,0.0003354814,0.00008773265],"domain_scores_gemma":[0.9986266,0.0009892645,0.00008880171,0.00007734469,0.0001597736,0.00005825303],"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.000006356992,0.00002237452,0.00006484231,0.00008293449,0.00001550454,0.00005118478,0.00003946663,0.09484909,0.000334215,0.8920727,0.002047274,0.01041408],"study_design_scores_gemma":[0.00001103508,0.00002804837,0.00007244528,0.00002800421,0.000010439,0.0000622665,0.00004098714,0.2188485,0.0001919672,0.7663675,0.01432589,0.00001291114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002030248,0.001384098,0.9763703,0.002411613,0.0002210919,0.00004670373,0.0001035632,0.00005946806,0.01737292],"genre_scores_gemma":[0.4218265,0.01404125,0.5242404,0.002563455,0.002897167,0.0008841267,0.0005522091,0.0002485064,0.0327465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006342791,"threshold_uncertainty_score":0.02121878,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128424,0.0006457674,0.0006870378,0.0005105362,0.001167555,0.002751554,0.001890699,0.002003836,0.01028307],"category_scores_gemma":[0.01123829,0.0003233693,0.0006917979,0.001138103,0.001959987,0.005546576,0.001546016,0.002043698,0.0005355245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001669888,"about_ca_system_score_gemma":0.001650296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003105264,"about_ca_topic_score_gemma":0.00172085,"domain_scores_codex":[0.9988707,0.0003264767,0.00002815778,0.0001995672,0.0002930227,0.0002821384],"domain_scores_gemma":[0.9962783,0.002291558,0.0004418279,0.0003480793,0.0004442514,0.000195897],"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.00001929235,0.00004500424,0.0006247736,0.00002287469,0.000006547805,0.000151725,0.0000694517,0.08123562,0.0003802112,0.9095911,0.00187643,0.005977002],"study_design_scores_gemma":[0.00001378285,0.0000258113,0.0003861521,0.00001774491,0.000009356439,0.0001876795,0.0001048694,0.259107,0.0003087814,0.737273,0.002550394,0.00001546767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3177243,0.00244872,0.4598626,0.01695616,0.000534227,0.00009363613,0.0003032211,0.0002742182,0.2018029],"genre_scores_gemma":[0.9871974,0.0006145822,0.004832923,0.0003147273,0.0002090777,0.00003160868,0.00003351343,0.00003249221,0.006733737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01028307,"threshold_uncertainty_score":0.03440034,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003837657,0.0009288586,0.0009603712,0.001579166,0.0009538043,0.001252892,0.001274895,0.001262639,0.002585005],"category_scores_gemma":[0.01419714,0.0003293498,0.0009356189,0.00103858,0.002312593,0.002809611,0.001593873,0.001965556,0.0004867797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130337,"about_ca_system_score_gemma":0.001319724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218255,"about_ca_topic_score_gemma":0.001047246,"domain_scores_codex":[0.9985378,0.0005998184,0.0001081582,0.0002092698,0.0004198511,0.0001251169],"domain_scores_gemma":[0.9876351,0.008491402,0.001248006,0.0004222145,0.001815402,0.0003879571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005965461,0.00003867547,0.0008173473,0.0001411625,0.00002847422,0.0003676355,0.0003244233,0.08454061,0.008890813,0.8918214,0.00120113,0.01176862],"study_design_scores_gemma":[0.00001232785,0.0000653652,0.0001971085,0.00003316644,0.00001544396,0.0001237618,0.00003887043,0.7907819,0.001818745,0.2057448,0.001136666,0.00003179833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02540087,0.0006594317,0.9679214,0.0006581048,0.00007246077,0.00005596318,0.00008015278,0.00009568964,0.005055824],"genre_scores_gemma":[0.8176709,0.00179864,0.1737708,0.0003980498,0.00040542,0.0004421875,0.0001819906,0.0001488229,0.005183351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003837657,"threshold_uncertainty_score":0.02029574,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000407832,0.0005985772,0.0006788449,0.001094418,0.0006641118,0.001263593,0.003212642,0.0007364015,0.003744218],"category_scores_gemma":[0.001689609,0.0003633259,0.0003790621,0.001826762,0.0003127645,0.002247686,0.0007145315,0.0007483331,0.0008169397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001401034,"about_ca_system_score_gemma":0.001911777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00476301,"about_ca_topic_score_gemma":0.01222181,"domain_scores_codex":[0.9996274,0.00005391771,0.00003586724,0.00006028957,0.0001271677,0.00009543495],"domain_scores_gemma":[0.9983805,0.0003325358,0.0001116165,0.0004550812,0.0006195299,0.0001006885],"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.001617253,0.001569865,0.01378732,0.0005397334,0.0002466856,0.0005070558,0.0003329987,0.2715053,0.1279647,0.03069118,0.02512715,0.5261108],"study_design_scores_gemma":[0.0002090084,0.0006882781,0.001197488,0.00002411086,0.00009853076,0.000334611,0.00005403599,0.9446207,0.03908537,0.004214858,0.009419416,0.00005359779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4181966,0.003128703,0.5513497,0.0007842729,0.0003116499,0.0002508897,0.0004371585,0.009516828,0.01602419],"genre_scores_gemma":[0.8692383,0.0003444407,0.1243525,0.0002045192,0.00007000648,0.0001540705,0.0004327905,0.0001082624,0.005095172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00476301,"threshold_uncertainty_score":0.01252562,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261609,0.0008726452,0.0006766811,0.0008344949,0.0003758945,0.001057894,0.0007563132,0.0007185792,0.001408124],"category_scores_gemma":[0.005136342,0.0004475637,0.0003659612,0.001030388,0.001111083,0.001125022,0.0008293099,0.0007561496,0.0003692892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849991,"about_ca_system_score_gemma":0.00102169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002778868,"about_ca_topic_score_gemma":0.001362552,"domain_scores_codex":[0.9993665,0.000282142,0.00001380491,0.00004725861,0.0001981177,0.0000922578],"domain_scores_gemma":[0.9985916,0.001020467,0.0000902282,0.00006051826,0.0002049719,0.00003222827],"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.00001166392,0.000006005285,0.00007323446,0.00002536199,0.000006817208,0.00002630042,0.00001316751,0.9797015,0.0004416654,0.01380211,0.0003550516,0.005537068],"study_design_scores_gemma":[0.000002499631,0.0000069573,0.0000371169,0.000005171193,0.000002918863,0.00001243048,0.000004703434,0.9919909,0.0002672835,0.007276624,0.0003897163,0.000003727165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01560935,0.001279499,0.9759159,0.0002545575,0.00003715068,0.00002880977,0.00004582469,0.0002199826,0.006608841],"genre_scores_gemma":[0.9084058,0.002313901,0.08158851,0.0001250295,0.0001152308,0.0001928956,0.0001233024,0.0001355168,0.006999751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002778868,"threshold_uncertainty_score":0.01342273,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555839,0.0007614815,0.0006072135,0.0003552686,0.0003674928,0.0007268771,0.001201621,0.0005178854,0.001743445],"category_scores_gemma":[0.0007652223,0.0001817538,0.0003849202,0.0003543755,0.0008165253,0.0006530602,0.0008168016,0.0007517289,0.0002214643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004870164,"about_ca_system_score_gemma":0.0007566563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002428446,"about_ca_topic_score_gemma":0.002306348,"domain_scores_codex":[0.9996551,0.0001120913,0.00001298457,0.00006396925,0.0001195487,0.00003631541],"domain_scores_gemma":[0.9998066,0.00007181172,0.0000343149,0.00002030076,0.00005102417,0.00001600824],"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.00004611315,0.00005635899,0.0003047825,0.0001288006,0.00003106372,0.0000637273,0.00007787612,0.8547915,0.007891058,0.05922341,0.0014277,0.07595766],"study_design_scores_gemma":[0.000007683571,0.00005561397,0.00005517039,0.000003550542,0.000005835254,0.000007714239,0.000004962887,0.9909198,0.0005443197,0.007274087,0.001115424,0.000005723755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001448959,0.00008021617,0.9973797,0.00004221379,0.00001448149,0.00001168069,0.00001029414,0.000131565,0.0008809036],"genre_scores_gemma":[0.7724163,0.0004598014,0.2235636,0.0001538661,0.0002011567,0.0002342681,0.0000741055,0.00009278509,0.002804013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002428446,"threshold_uncertainty_score":0.005832374,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001143795,0.001238056,0.0009522521,0.001130915,0.001795046,0.002917407,0.0008407843,0.00325683,0.7243471],"category_scores_gemma":[0.002064569,0.0003520363,0.0006284249,0.0008240772,0.0001845157,0.001297809,0.001725178,0.001531134,0.4947934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005646758,"about_ca_system_score_gemma":0.001045577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001366389,"about_ca_topic_score_gemma":0.003890679,"domain_scores_codex":[0.9995677,0.00005959857,0.00001753288,0.0001356641,0.0001232986,0.00009621597],"domain_scores_gemma":[0.9982749,0.0002178815,0.00009659347,0.000215428,0.0004813249,0.0007137611],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001027599,0.00004415059,0.0002732169,0.00003975799,0.000003660605,0.00003194489,0.00001358874,0.00006551573,0.0004345974,0.0002992949,0.9667411,0.03195028],"study_design_scores_gemma":[0.00004533923,0.00007587775,0.00329538,0.00004819372,0.0000089954,0.00004905305,0.0000455728,0.0005699755,0.0004237486,0.0005687152,0.994857,0.00001215937],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005475819,0.002316351,0.006772169,0.02111002,0.03783498,0.001389551,0.02282158,0.007508223,0.8947713],"genre_scores_gemma":[0.01384358,0.0007682547,0.001005016,0.00195693,0.007370767,0.0002837494,0.004142375,0.0005966038,0.9700327],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7243471,"threshold_uncertainty_score":0.3931854,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}