{"meta":{"query_hash":"50f47fdb9815","filters":{"venue":"International Teletraffic Congress"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/50f47fdb9815","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Teletraffic+Congress"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02347891835210501,"score_gpt":0.2704182445018802,"score_spread":0.24693932614977518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517429491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001448959,0.00008021617,0.99737966,0.000042213785,0.000014481487,0.000011680686,0.000010294141,0.00013156497,0.00088090356],"genre_scores_gemma":[0.7724163,0.00045980143,0.22356364,0.00015386606,0.00020115665,0.00023426805,0.0000741055,0.00009278509,0.0028040125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996551,0.00011209129,0.00001298457,0.00006396925,0.00011954871,0.00003631541],"domain_scores_gemma":[0.9998066,0.00007181172,0.000034314897,0.000020300757,0.000051024173,0.000016008238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555839,0.00076148147,0.00060721353,0.00035526857,0.00036749284,0.0007268771,0.0012016207,0.00051788543,0.001743445],"category_scores_gemma":[0.0007652223,0.00018175383,0.00038492016,0.00035437554,0.00081652525,0.00065306015,0.00081680156,0.0007517289,0.0002214643],"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.00004611315,0.000056358993,0.00030478247,0.0001288006,0.00003106372,0.000063727304,0.00007787612,0.8547915,0.007891058,0.059223406,0.0014277003,0.075957656],"study_design_scores_gemma":[0.000007683571,0.000055613975,0.000055170392,0.0000035505423,0.0000058352543,0.000007714239,0.0000049628875,0.9909198,0.0005443197,0.007274087,0.0011154243,0.0000057237553],"about_ca_topic_score_codex":0.0024284464,"about_ca_topic_score_gemma":0.0023063484,"teacher_disagreement_score":0.0024284464,"about_ca_system_score_codex":0.00048701637,"about_ca_system_score_gemma":0.0007566563,"threshold_uncertainty_score":0.005832374},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02926541796276157,"score_gpt":0.2902900294223885,"score_spread":0.26102461145962697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541671749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015609351,0.0012794986,0.9759159,0.00025455747,0.000037150683,0.000028809769,0.000045824687,0.00021998263,0.0066088415],"genre_scores_gemma":[0.9084058,0.0023139007,0.081588514,0.00012502949,0.00011523079,0.00019289559,0.00012330244,0.00013551685,0.0069997506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000282142,0.000013804905,0.00004725861,0.00019811773,0.000092257804],"domain_scores_gemma":[0.9985916,0.001020467,0.000090228204,0.00006051826,0.0002049719,0.00003222827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012616094,0.00087264524,0.00067668105,0.0008344949,0.00037589448,0.0010578935,0.0007563132,0.00071857916,0.001408124],"category_scores_gemma":[0.0051363423,0.00044756365,0.0003659612,0.0010303883,0.0011110832,0.0011250222,0.00082930987,0.0007561496,0.0003692892],"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.0000116639185,0.000006005285,0.00007323446,0.000025361993,0.000006817208,0.000026300419,0.000013167509,0.9797015,0.00044166538,0.013802111,0.0003550516,0.0055370685],"study_design_scores_gemma":[0.0000024996311,0.0000069573,0.000037116904,0.0000051711927,0.0000029188634,0.000012430483,0.000004703434,0.99199086,0.00026728353,0.0072766244,0.00038971627,0.0000037271645],"about_ca_topic_score_codex":0.0027788682,"about_ca_topic_score_gemma":0.0013625524,"teacher_disagreement_score":0.0027788682,"about_ca_system_score_codex":0.0018499908,"about_ca_system_score_gemma":0.0010216896,"threshold_uncertainty_score":0.013422728},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0634416463568282,"score_gpt":0.3069556644432329,"score_spread":0.24351401808640472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545511512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41819662,0.0031287032,0.5513497,0.00078427285,0.00031164993,0.00025088966,0.00043715848,0.009516828,0.01602419],"genre_scores_gemma":[0.86923826,0.00034444075,0.12435247,0.00020451921,0.000070006485,0.00015407048,0.00043279046,0.00010826244,0.0050951717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962735,0.000053917713,0.00003586724,0.00006028957,0.00012716769,0.000095434945],"domain_scores_gemma":[0.99838054,0.00033253583,0.00011161651,0.00045508123,0.0006195299,0.00010068846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040783198,0.0005985772,0.00067884487,0.0010944183,0.00066411175,0.0012635931,0.0032126417,0.00073640153,0.003744218],"category_scores_gemma":[0.0016896091,0.00036332587,0.00037906208,0.0018267618,0.00031276455,0.0022476858,0.00071453146,0.00074833306,0.0008169397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0016172526,0.0015698646,0.013787322,0.00053973345,0.00024668555,0.0005070558,0.00033299866,0.27150533,0.12796475,0.030691177,0.02512715,0.52611077],"study_design_scores_gemma":[0.00020900837,0.0006882781,0.0011974884,0.000024110863,0.000098530756,0.00033461102,0.000054035987,0.9446207,0.03908537,0.004214858,0.009419416,0.000053597785],"about_ca_topic_score_codex":0.00476301,"about_ca_topic_score_gemma":0.012221809,"teacher_disagreement_score":0.00476301,"about_ca_system_score_codex":0.001401034,"about_ca_system_score_gemma":0.0019117766,"threshold_uncertainty_score":0.012525618},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004265228968429004,"score_gpt":0.20268597144197456,"score_spread":0.19842074247354555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657259300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020302476,0.0013840982,0.9763703,0.0024116125,0.00022109188,0.00004670373,0.00010356322,0.000059468064,0.017372925],"genre_scores_gemma":[0.42182645,0.014041253,0.5242404,0.002563455,0.0028971669,0.0008841267,0.0005522091,0.00024850643,0.032746505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.0005646333,0.000041148458,0.00020151616,0.0003354814,0.00008773265],"domain_scores_gemma":[0.9986266,0.0009892645,0.00008880171,0.00007734469,0.00015977358,0.000058253027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010944396,0.0014779494,0.0008906581,0.002048052,0.00085190806,0.0021350586,0.0015581747,0.0017776528,0.006342791],"category_scores_gemma":[0.002664774,0.0004337615,0.00096102105,0.0021909415,0.0031102975,0.0028504313,0.0012955324,0.0032463123,0.00066255126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0000063569923,0.000022374521,0.00006484231,0.00008293449,0.000015504544,0.000051184783,0.000039466628,0.09484909,0.00033421503,0.89207274,0.0020472743,0.01041408],"study_design_scores_gemma":[0.000011035084,0.00002804837,0.000072445284,0.000028004215,0.000010439004,0.000062266496,0.000040987135,0.2188485,0.00019196724,0.7663675,0.0143258935,0.000012911142],"about_ca_topic_score_codex":0.0039405976,"about_ca_topic_score_gemma":0.0025009008,"teacher_disagreement_score":0.006342791,"about_ca_system_score_codex":0.002754071,"about_ca_system_score_gemma":0.0016772457,"threshold_uncertainty_score":0.021218777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010756520071650243,"score_gpt":0.2884480975668475,"score_spread":0.27769157749519724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795306810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025400868,0.0006594317,0.96792144,0.00065810484,0.000072460774,0.00005596318,0.00008015278,0.00009568964,0.005055824],"genre_scores_gemma":[0.8176709,0.0017986397,0.17377076,0.00039804983,0.00040542003,0.00044218753,0.00018199057,0.00014882295,0.005183351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985378,0.00059981836,0.0001081582,0.00020926983,0.0004198511,0.00012511693],"domain_scores_gemma":[0.9876351,0.0084914025,0.001248006,0.0004222145,0.0018154024,0.00038795714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038376572,0.00092885864,0.0009603712,0.0015791662,0.0009538043,0.0012528922,0.001274895,0.0012626391,0.0025850048],"category_scores_gemma":[0.014197137,0.0003293498,0.0009356189,0.0010385796,0.0023125932,0.0028096107,0.0015938734,0.0019655556,0.0004867797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000059654612,0.000038675473,0.0008173473,0.00014116254,0.000028474218,0.00036763554,0.00032442328,0.084540606,0.008890813,0.89182144,0.0012011295,0.011768618],"study_design_scores_gemma":[0.000012327852,0.0000653652,0.00019710854,0.000033166438,0.000015443962,0.0001237618,0.00003887043,0.7907819,0.001818745,0.20574483,0.0011366659,0.000031798332],"about_ca_topic_score_codex":0.0012182548,"about_ca_topic_score_gemma":0.0010472464,"teacher_disagreement_score":0.0038376572,"about_ca_system_score_codex":0.0013033703,"about_ca_system_score_gemma":0.001319724,"threshold_uncertainty_score":0.02029574},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.07320512162428952,"score_gpt":0.3123173565591973,"score_spread":0.23911223493490777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136283670","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005475819,0.0023163508,0.0067721694,0.02111002,0.037834983,0.0013895507,0.022821583,0.0075082234,0.8947713],"genre_scores_gemma":[0.013843583,0.00076825474,0.0010050163,0.0019569302,0.0073707667,0.00028374942,0.0041423747,0.0005966038,0.9700327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995677,0.000059598566,0.000017532879,0.00013566414,0.00012329857,0.00009621597],"domain_scores_gemma":[0.9982749,0.00021788152,0.00009659347,0.00021542796,0.0004813249,0.0007137611],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011437954,0.0012380559,0.00095225207,0.0011309147,0.0017950465,0.002917407,0.00084078434,0.0032568304,0.72434705],"category_scores_gemma":[0.0020645692,0.00035203632,0.00062842487,0.00082407723,0.00018451571,0.0012978091,0.0017251783,0.0015311342,0.49479336],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00010275986,0.000044150594,0.00027321687,0.000039757993,0.0000036606052,0.00003194489,0.000013588742,0.00006551573,0.0004345974,0.00029929492,0.96674114,0.03195028],"study_design_scores_gemma":[0.00004533923,0.000075877746,0.0032953802,0.000048193724,0.0000089954,0.000049053047,0.0000455728,0.00056997547,0.00042374863,0.0005687152,0.99485695,0.000012159371],"about_ca_topic_score_codex":0.0013663892,"about_ca_topic_score_gemma":0.0038906792,"teacher_disagreement_score":0.72434705,"about_ca_system_score_codex":0.0005646758,"about_ca_system_score_gemma":0.0010455771,"threshold_uncertainty_score":0.39318544},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016702352200216798,"score_gpt":0.26411820424345456,"score_spread":0.24741585204323777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59026020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3177243,0.0024487204,0.4598626,0.016956164,0.000534227,0.00009363613,0.0003032211,0.00027421818,0.20180292],"genre_scores_gemma":[0.9871974,0.0006145822,0.004832923,0.00031472734,0.00020907774,0.000031608677,0.00003351343,0.00003249221,0.0067337374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00032647667,0.000028157781,0.00019956719,0.0002930227,0.0002821384],"domain_scores_gemma":[0.99627835,0.0022915578,0.0004418279,0.0003480793,0.00044425143,0.00019589697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012842403,0.00064576743,0.00068703777,0.0005105362,0.0011675545,0.0027515537,0.001890699,0.0020038357,0.010283069],"category_scores_gemma":[0.011238285,0.00032336928,0.00069179793,0.0011381031,0.0019599875,0.005546576,0.001546016,0.0020436982,0.0005355245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.000019292353,0.000045004235,0.0006247736,0.000022874692,0.0000065478052,0.00015172498,0.0000694517,0.08123562,0.00038021116,0.90959114,0.0018764297,0.0059770024],"study_design_scores_gemma":[0.000013782854,0.000025811303,0.00038615213,0.000017744907,0.0000093564395,0.00018767946,0.00010486938,0.259107,0.00030878137,0.73727304,0.002550394,0.000015467673],"about_ca_topic_score_codex":0.0031052642,"about_ca_topic_score_gemma":0.0017208502,"teacher_disagreement_score":0.010283069,"about_ca_system_score_codex":0.0016698876,"about_ca_system_score_gemma":0.001650296,"threshold_uncertainty_score":0.034400344},"labels":[],"label_agreement":null}]}