{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"c9345134e051","filters":{"venue":"International Conference on Ultra Modern Telecommunications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Dimensioning; Node (physics); Network topology; Bandwidth (computing); Grid; Distributed computing; Engineering","authors":[{"name":"Brigitte Jaumard","is_ca":true},{"name":"Ali Shaikh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09583896591956778,"gpt":0.3219500572456972,"spread":0.2261110913261294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005333527,0.0007368262,0.0005987966,0.0004710461,0.0003636312,0.001161414,0.000515111,0.0006431527,0.002642879],"category_scores_gemma":[0.002028802,0.0002919211,0.0003331632,0.0008422848,0.0007199878,0.001480574,0.0008519239,0.0004761095,0.0002236662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001168578,"about_ca_system_score_gemma":0.0006568437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003792412,"about_ca_topic_score_gemma":0.002077225,"domain_scores_codex":[0.9996166,0.0001905898,0.000007319263,0.00003747425,0.00004859769,0.00009941006],"domain_scores_gemma":[0.999442,0.0003215579,0.00007744529,0.00004145288,0.0000552534,0.00006216242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009056005,0.00002288195,0.0003385342,0.00003734241,0.00001326528,0.00008878669,0.0000269732,0.959153,0.001869959,0.03065135,0.0007860763,0.006921227],"study_design_scores_gemma":[0.00001149238,0.00002502059,0.0001127412,0.000003722821,0.000005078603,0.00001609473,0.0000237798,0.9828241,0.0004250797,0.01622096,0.0003282726,0.000003625549],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4413586,0.0005073826,0.5385135,0.001022717,0.00004851386,0.0001018202,0.0003826095,0.0003168435,0.01774806],"genre_scores_gemma":[0.9861914,0.0002389873,0.01158675,0.00004272569,0.0000126562,0.00003596814,0.0000617218,0.00002724388,0.001802482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003792412,"threshold_uncertainty_score":0.008841276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alireza Nafarieh","is_ca":true},{"name":"Shyamala Sivakumar","is_ca":true},{"name":"William Phillips","is_ca":true},{"name":"William Robertson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06467475551907022,"gpt":0.280135708244459,"spread":0.2154609527253888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293356,0.0004101942,0.0005355781,0.0008871006,0.0009771112,0.0009701512,0.002687238,0.0005836308,0.001306453],"category_scores_gemma":[0.002588422,0.0002632785,0.0003463238,0.0006727258,0.000463171,0.002089553,0.001567843,0.0006597841,0.0002391552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368619,"about_ca_system_score_gemma":0.001122955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001952566,"about_ca_topic_score_gemma":0.002188522,"domain_scores_codex":[0.9993504,0.0001207599,0.00006556624,0.0001113595,0.0002217967,0.0001301018],"domain_scores_gemma":[0.9985891,0.0003134384,0.0002772676,0.0004143293,0.0003129971,0.000092954],"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.001082738,0.0005990472,0.006522343,0.0004752734,0.0002533728,0.0004270652,0.0006753863,0.2784431,0.0566226,0.05089879,0.007773925,0.5962263],"study_design_scores_gemma":[0.00007997759,0.0002925657,0.0008079804,0.00002342224,0.00006699409,0.0002570763,0.000106664,0.9589381,0.02133551,0.01309344,0.004940649,0.00005763444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09218104,0.0005370493,0.9018437,0.0002342879,0.0001445665,0.0001645379,0.0001009152,0.002438681,0.002355202],"genre_scores_gemma":[0.9068055,0.0001243082,0.0916665,0.00006343889,0.00004466524,0.00009098397,0.00009838191,0.00003395697,0.001072198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002687238,"threshold_uncertainty_score":0.00684005,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Brigitte Jaumard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1227086823174171,"gpt":0.3413565591995041,"spread":0.218647876882087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001681511,0.00126498,0.0008561584,0.0006480332,0.0005007263,0.001588951,0.002368693,0.002018878,0.007969347],"category_scores_gemma":[0.002169946,0.0006043717,0.001518324,0.0008551242,0.000787035,0.00249199,0.001396977,0.002751937,0.0008195614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001693025,"about_ca_system_score_gemma":0.002335841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003023369,"about_ca_topic_score_gemma":0.003011506,"domain_scores_codex":[0.9991536,0.0002497204,0.00003716164,0.000171636,0.0002462691,0.0001415703],"domain_scores_gemma":[0.9994417,0.0002385921,0.00006143028,0.00006852925,0.000132042,0.00005771969],"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.00004031395,0.00008589218,0.000184305,0.0001920311,0.0000283257,0.0001433669,0.00008152935,0.7384189,0.002053907,0.2174465,0.006738072,0.0345868],"study_design_scores_gemma":[0.0000223827,0.00004447038,0.00005185319,0.00002283483,0.0000131387,0.00005579351,0.00001935075,0.9377696,0.0004656715,0.05473831,0.006785108,0.00001149746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002241218,0.0001277106,0.9935888,0.000288178,0.00006976836,0.0001026093,0.000159287,0.00008653598,0.003335847],"genre_scores_gemma":[0.242355,0.0009725204,0.7381861,0.0005771813,0.0003615694,0.0009810093,0.0007780438,0.0002657691,0.01552278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007969347,"threshold_uncertainty_score":0.02666014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}