{"meta":{"query_hash":"c9345134e051","filters":{"venue":"International Conference on Ultra Modern Telecommunications"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/c9345134e051","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Ultra+Modern+Telecommunications"},"results":[{"id":"W1512796272","doi":"","title":"Memory-aware SLA-based mechanism for shared-mesh WDM networks","year":2011,"lang":"en","type":"article","venue":"International Conference on Ultra Modern Telecommunications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Backup; Provisioning; Computer network; Network topology; Path (computing); Metric (unit); Distributed computing; Service provider; Blocking (statistics); Service (business); Operating system","score_opus":0.06467475551907022,"score_gpt":0.28013570824445905,"score_spread":0.21546095272538884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512796272","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.09218104,0.0005370493,0.90184367,0.00023428786,0.00014456651,0.0001645379,0.00010091522,0.0024386807,0.0023552023],"genre_scores_gemma":[0.90680546,0.00012430818,0.0916665,0.00006343889,0.00004466524,0.000090983965,0.00009838191,0.000033956974,0.0010721984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.00012075992,0.00006556624,0.00011135954,0.00022179673,0.00013010176],"domain_scores_gemma":[0.9985891,0.00031343836,0.0002772676,0.00041432932,0.00031299714,0.000092954004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012933563,0.00041019422,0.0005355781,0.00088710064,0.0009771112,0.00097015116,0.0026872377,0.00058363075,0.0013064526],"category_scores_gemma":[0.0025884223,0.0002632785,0.00034632377,0.00067272584,0.00046317102,0.0020895526,0.0015678431,0.00065978407,0.0002391552],"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.0010827376,0.00059904717,0.0065223426,0.00047527344,0.00025337283,0.0004270652,0.00067538634,0.27844307,0.056622602,0.050898787,0.0077739246,0.59622633],"study_design_scores_gemma":[0.00007997759,0.0002925657,0.0008079804,0.000023422235,0.000066994086,0.00025707626,0.00010666399,0.95893806,0.021335507,0.013093441,0.0049406495,0.00005763444],"about_ca_topic_score_codex":0.0019525663,"about_ca_topic_score_gemma":0.0021885224,"teacher_disagreement_score":0.0026872377,"about_ca_system_score_codex":0.0008368619,"about_ca_system_score_gemma":0.0011229545,"threshold_uncertainty_score":0.00684005},"labels":[],"label_agreement":null},{"id":"W1529517016","doi":"","title":"A new flow formulation for FIPP p-cycle protection subject to multiple link failures","year":2011,"lang":"en","type":"article","venue":"International Conference on Ultra Modern Telecommunications","topic":"Advanced Graph Theory Research","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":"Concordia University","funders":"","keywords":"Column generation; Path (computing); Scalability; Mathematical optimization; Computer science; Bandwidth (computing); Dual (grammatical number); Mathematics; Computer network","score_opus":0.12270868231741712,"score_gpt":0.3413565591995041,"score_spread":0.21864787688208698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529517016","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.0022412175,0.00012771065,0.9935888,0.00028817804,0.00006976836,0.00010260929,0.00015928701,0.000086535976,0.0033358473],"genre_scores_gemma":[0.24235497,0.00097252044,0.7381861,0.0005771813,0.0003615694,0.0009810093,0.00077804376,0.00026576914,0.015522778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991536,0.00024972038,0.00003716164,0.00017163601,0.00024626908,0.00014157034],"domain_scores_gemma":[0.9994417,0.0002385921,0.000061430284,0.000068529254,0.00013204195,0.000057719688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016815107,0.0012649803,0.0008561584,0.00064803316,0.00050072634,0.0015889512,0.0023686928,0.0020188785,0.007969347],"category_scores_gemma":[0.0021699457,0.0006043717,0.0015183245,0.0008551242,0.000787035,0.0024919903,0.001396977,0.0027519374,0.0008195614],"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.000040313946,0.000085892185,0.00018430501,0.00019203109,0.000028325696,0.00014336685,0.00008152935,0.7384189,0.0020539067,0.21744654,0.0067380723,0.034586802],"study_design_scores_gemma":[0.000022382703,0.000044470376,0.00005185319,0.000022834829,0.000013138701,0.000055793513,0.000019350748,0.9377696,0.00046567147,0.054738306,0.0067851082,0.000011497458],"about_ca_topic_score_codex":0.0030233688,"about_ca_topic_score_gemma":0.0030115056,"teacher_disagreement_score":0.007969347,"about_ca_system_score_codex":0.0016930246,"about_ca_system_score_gemma":0.0023358413,"threshold_uncertainty_score":0.026660144},"labels":[],"label_agreement":null},{"id":"W1578881596","doi":"","title":"Maximizing access to IT services on resilient optical grids","year":2011,"lang":"en","type":"article","venue":"International Conference on Ultra Modern Telecommunications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Dimensioning; Node (physics); Network topology; Bandwidth (computing); Grid; Distributed computing; Engineering","score_opus":0.09583896591956778,"score_gpt":0.3219500572456972,"score_spread":0.22611109132612942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578881596","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.44135857,0.0005073826,0.5385135,0.0010227168,0.000048513855,0.00010182017,0.00038260952,0.00031684348,0.017748062],"genre_scores_gemma":[0.9861914,0.00023898728,0.011586753,0.000042725685,0.000012656202,0.000035968136,0.0000617218,0.000027243885,0.0018024823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996166,0.00019058984,0.0000073192627,0.00003747425,0.000048597693,0.00009941006],"domain_scores_gemma":[0.99944204,0.0003215579,0.000077445286,0.00004145288,0.000055253404,0.00006216242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053335266,0.0007368262,0.0005987966,0.00047104614,0.00036363117,0.0011614143,0.00051511097,0.0006431527,0.0026428795],"category_scores_gemma":[0.0020288022,0.00029192114,0.00033316316,0.00084228476,0.0007199878,0.0014805744,0.00085192395,0.0004761095,0.00022366617],"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.00009056005,0.00002288195,0.0003385342,0.00003734241,0.000013265278,0.00008878669,0.0000269732,0.959153,0.0018699586,0.030651353,0.0007860763,0.0069212266],"study_design_scores_gemma":[0.000011492375,0.000025020587,0.00011274118,0.0000037228212,0.0000050786034,0.000016094731,0.000023779803,0.9828241,0.0004250797,0.016220957,0.00032827255,0.0000036255494],"about_ca_topic_score_codex":0.003792412,"about_ca_topic_score_gemma":0.002077225,"teacher_disagreement_score":0.003792412,"about_ca_system_score_codex":0.0011685776,"about_ca_system_score_gemma":0.0006568437,"threshold_uncertainty_score":0.008841276},"labels":[],"label_agreement":null}]}