{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021976372,0.000033657427,0.98567396,0.0005168791,0.001494715,0.003045491,0.000023168992,0.00029819136,0.006716286],"genre_scores_gemma":[0.8128015,0.0000064958986,0.18182077,0.0006462991,0.00032858335,0.0033561084,0.000009623262,0.000029353561,0.0010012746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980329,0.00006156512,0.00040369525,0.0006035203,0.00044142015,0.00045686506],"domain_scores_gemma":[0.998505,0.00041307582,0.00019863657,0.0005339007,0.00021202638,0.00013734543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004268616,0.00024146165,0.0002548262,0.00014700602,0.00014353363,0.00021655648,0.00199967,0.00015282526,0.00014138779],"category_scores_gemma":[0.00003295221,0.00022989693,0.00015190445,0.00021410995,0.000098980076,0.0003118435,0.00027008232,0.0002352226,0.00004021064],"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.00027320557,0.00026428304,0.0001534131,0.00003675967,0.0002814342,0.000090142705,0.0004095507,0.004967495,0.000014137458,0.706011,0.005650368,0.28184822],"study_design_scores_gemma":[0.00302078,0.00020024607,0.0007561023,0.000320122,0.000023417786,0.000030215499,0.00012450817,0.7731303,0.000610794,0.007956004,0.21329212,0.00053536467],"about_ca_topic_score_codex":0.00002034978,"about_ca_topic_score_gemma":0.000003446434,"teacher_disagreement_score":0.81060386,"about_ca_system_score_codex":0.00008048693,"about_ca_system_score_gemma":0.000032895885,"threshold_uncertainty_score":0.9374925},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026841607,0.00048441376,0.96128356,0.0071769673,0.0018921132,0.0005354835,0.000012723166,0.00037898525,0.0013941291],"genre_scores_gemma":[0.9315737,0.0008025401,0.06583425,0.0005893413,0.0002897747,0.000082348655,0.000075518015,0.000018654353,0.00073385873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978961,0.00012634798,0.0004134131,0.0005250118,0.00061335217,0.00042580094],"domain_scores_gemma":[0.99752164,0.00047380573,0.00020016498,0.0008259835,0.0008327877,0.00014561189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051942415,0.00021060697,0.00021762299,0.00023714341,0.00022460536,0.00043355048,0.0029565194,0.0001579909,0.000087741726],"category_scores_gemma":[0.0001394418,0.00021894228,0.00012969668,0.0004727537,0.00010035572,0.0007428405,0.0002350134,0.00034426138,0.000017914646],"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.000054179985,0.00017386941,0.000047556743,0.0000047519197,0.00005127683,0.0000068251493,0.00014215324,0.4031172,0.000059589616,0.021946857,0.007945883,0.5664499],"study_design_scores_gemma":[0.00073407724,0.00009141415,0.0007090304,0.00004933737,0.0000036482957,0.00001708856,0.000009413266,0.97182226,0.0001561556,0.0003860301,0.02577972,0.00024181405],"about_ca_topic_score_codex":0.000003837586,"about_ca_topic_score_gemma":0.000016552967,"teacher_disagreement_score":0.9047321,"about_ca_system_score_codex":0.00019527256,"about_ca_system_score_gemma":0.00007409509,"threshold_uncertainty_score":0.8928207},"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":"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.027435865,0.00009180179,0.9571866,0.0016401681,0.0037893613,0.00034075533,0.000023287632,0.0003041277,0.009188069],"genre_scores_gemma":[0.78028727,0.000008492954,0.21582204,0.00068978616,0.0004942228,0.000087838685,0.000019135146,0.000020622274,0.0025706182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.000034163415,0.00027030875,0.00050082087,0.00033874373,0.00029130405],"domain_scores_gemma":[0.9988007,0.00015587195,0.0001306065,0.00033887223,0.0004428255,0.00013111944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002557199,0.00018474984,0.00015582358,0.00022319524,0.0001289603,0.00025452854,0.0016040816,0.00006684133,0.000048728398],"category_scores_gemma":[0.00018041927,0.00017292715,0.00007614386,0.00031933765,0.000049141716,0.00039275672,0.00020569196,0.00014108348,0.000033087614],"study_design_candidate":"design_other","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.00013198778,0.0002052164,0.00013075955,0.00003653044,0.00011393206,0.000030763036,0.0027692793,0.03196477,0.00035334632,0.015422534,0.008062207,0.9407787],"study_design_scores_gemma":[0.009413609,0.0010275176,0.007743291,0.0012529817,0.00013979875,0.0006797375,0.0006768389,0.66224694,0.15212671,0.036653973,0.123817675,0.00422093],"about_ca_topic_score_codex":0.000027029473,"about_ca_topic_score_gemma":0.00005519375,"teacher_disagreement_score":0.93655777,"about_ca_system_score_codex":0.000055350625,"about_ca_system_score_gemma":0.00011036351,"threshold_uncertainty_score":0.7051765},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060777526,0.0004007781,0.9180506,0.0113405,0.0017282356,0.00078119553,0.000007508572,0.0008938462,0.0060197953],"genre_scores_gemma":[0.9738501,0.000017633367,0.023746857,0.0016743325,0.00051102345,0.000057196103,0.0000044413937,0.000012884857,0.00012557027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980974,0.000053576656,0.00034785777,0.0005890692,0.00044026415,0.0004718016],"domain_scores_gemma":[0.9989785,0.00022243927,0.00007109045,0.00029642784,0.00015791907,0.0002736501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039375675,0.00025609884,0.0002839705,0.00017860996,0.00010554235,0.00034580234,0.00096624007,0.00010065131,0.000018535597],"category_scores_gemma":[0.000054671433,0.00023919417,0.00009482399,0.0003914254,0.000077234035,0.00024490702,0.00007417753,0.0002562349,0.000019867228],"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.00002960448,0.00008563336,0.000020994865,0.0000028348888,0.00005037077,0.000016064163,0.0000920124,0.22025014,0.000018875455,0.4890369,0.0019014606,0.28849512],"study_design_scores_gemma":[0.0011900761,0.00014642585,0.0008517072,0.00005116496,0.000014048662,0.000121990604,0.000008159945,0.9861286,0.0000050609774,0.0016442733,0.009501909,0.0003365785],"about_ca_topic_score_codex":6.302095e-7,"about_ca_topic_score_gemma":7.9111965e-7,"teacher_disagreement_score":0.9130725,"about_ca_system_score_codex":0.000038446382,"about_ca_system_score_gemma":0.00003637985,"threshold_uncertainty_score":0.9754055},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43338275,0.000009707857,0.5589672,0.0031296283,0.00015361249,0.0039021247,0.000108192486,0.000039872877,0.00030692192],"genre_scores_gemma":[0.9820848,0.0000015513942,0.016742546,0.00031891392,0.000052648862,0.00074189954,0.000018612009,0.00000600652,0.000032988846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875516,0.000058700287,0.0002607939,0.0003422736,0.00043650717,0.00014659739],"domain_scores_gemma":[0.9980693,0.00064274104,0.0002174193,0.0003251538,0.0006973398,0.000048054255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029758838,0.00013510509,0.00017090805,0.000058864513,0.000058535967,0.000031924905,0.0005184484,0.00003930326,0.000012818557],"category_scores_gemma":[0.000064791755,0.00008608815,0.00004752297,0.00023484076,0.00007507492,0.00011789216,0.00004636136,0.00009880605,0.0000023890495],"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.0073543414,0.0021569808,0.0054499498,0.000118288495,0.00027568502,0.00001639651,0.004095796,0.044521447,0.0025309846,0.27838632,0.0027149573,0.65237886],"study_design_scores_gemma":[0.0032144913,0.0040769745,0.06483169,0.0016760167,0.000024595896,0.000053799966,0.000097365875,0.89765424,0.020812944,0.0011505163,0.0057591056,0.0006482734],"about_ca_topic_score_codex":0.000022874041,"about_ca_topic_score_gemma":0.00006355826,"teacher_disagreement_score":0.8531328,"about_ca_system_score_codex":0.00004163356,"about_ca_system_score_gemma":0.000065603665,"threshold_uncertainty_score":0.35105726},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9164799,0.0016850865,0.00016593521,0.0005946685,0.010113166,0.00016042222,0.00007198593,0.00012392232,0.07060495],"genre_scores_gemma":[0.9913166,0.00032050468,0.0004061054,0.00005516901,0.0020209122,0.000026453808,0.000015644868,0.000028099937,0.005810501],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984931,0.000020256353,0.0004983501,0.0003181643,0.00018531628,0.00048484412],"domain_scores_gemma":[0.99921525,0.00010559953,0.00020715535,0.00021319569,0.00007432481,0.0001845066],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007072398,0.00015600781,0.00024048075,0.00037650124,0.00009400498,0.00012448573,0.00062941323,0.00014480017,0.0034413356],"category_scores_gemma":[0.00030814347,0.00017691327,0.00012258012,0.00021413068,0.00007701515,0.00071752805,0.00014318284,0.00034332956,0.003572575],"study_design_candidate":"not_applicable","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.0001046417,0.00065424596,0.59887654,0.000043642027,0.0004186291,0.000047147016,0.0016303888,0.0011314813,0.000375592,0.21980171,0.027198657,0.1497173],"study_design_scores_gemma":[0.0012875171,0.000028589418,0.060646657,0.00007599233,0.000006297165,0.00003292775,0.00040469755,0.0028779546,0.0010290949,0.00080758054,0.9322731,0.0005295748],"about_ca_topic_score_codex":0.000022628235,"about_ca_topic_score_gemma":0.0000011138667,"teacher_disagreement_score":0.9050745,"about_ca_system_score_codex":0.00025363077,"about_ca_system_score_gemma":0.000016536218,"threshold_uncertainty_score":0.99746966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69014627,0.001397544,0.28016222,0.010635728,0.0041334527,0.00039062736,0.000006366052,0.00080413994,0.012323681],"genre_scores_gemma":[0.99600977,0.000032944845,0.0024242294,0.00034602024,0.00039703777,0.000049293172,0.0000037065481,0.000008206189,0.00072878395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999038,0.000014044135,0.0001976865,0.0002795864,0.00019932468,0.00027140634],"domain_scores_gemma":[0.99930304,0.00010155761,0.00008653212,0.00023481852,0.00013940276,0.00013464964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022276066,0.00011333136,0.00010161632,0.00010576017,0.00011732849,0.00019883281,0.0007144831,0.00004486664,0.00003131071],"category_scores_gemma":[0.000056488778,0.00010864813,0.000032902346,0.00017562053,0.00004031779,0.0007231138,0.00020436612,0.00011987343,0.00003774533],"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.000004749749,0.00008627319,0.038414627,0.000007540141,0.000053127605,0.0000026858004,0.00037457704,0.00021011446,0.00012665319,0.27754167,0.0010521251,0.68212587],"study_design_scores_gemma":[0.001977174,0.000070315684,0.1469935,0.00015282944,0.000040266597,0.0005591169,0.00013699275,0.68844736,0.00043469964,0.0028113567,0.15734623,0.0010301316],"about_ca_topic_score_codex":0.0000034871784,"about_ca_topic_score_gemma":0.0000034955467,"teacher_disagreement_score":0.68823725,"about_ca_system_score_codex":0.000038743172,"about_ca_system_score_gemma":0.00002391379,"threshold_uncertainty_score":0.4430542},"labels":[],"label_agreement":null}]}