{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008069704,0.0002171,0.0001663039,0.0002273401,0.0001143862,0.0001280167,0.002402629,0.0001162723,0.0002652332],"category_scores_gemma":[0.00007672464,0.0002188652,0.00005505179,0.0001913604,0.00008375649,0.0003077763,0.0002283532,0.0004982444,0.0003068523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001476533,"about_ca_system_score_gemma":0.00001700915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001615079,"about_ca_topic_score_gemma":0.0001393488,"domain_scores_codex":[0.9988031,0.00002151574,0.0003275412,0.0002786543,0.0002741252,0.0002950998],"domain_scores_gemma":[0.9985472,0.0001642208,0.00004314587,0.0009564865,0.0001736039,0.0001153324],"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.000170502,0.0006336938,0.0007602007,0.00003612457,0.0002341024,0.00001070149,0.002067972,0.1717026,0.008151762,0.7095843,0.001278103,0.1053699],"study_design_scores_gemma":[0.001044321,0.0006111653,0.01876669,0.001067669,0.00005328809,0.0000258343,0.001463849,0.7540032,0.04230821,0.1647217,0.01402615,0.001907834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1019765,0.00006152729,0.1434575,0.01000883,0.0005408895,0.0005867863,0.00007216606,0.0018061,0.7414897],"genre_scores_gemma":[0.9473758,0.0004055804,0.05117317,0.0006770657,0.00003234306,0.000165919,0.00003667749,0.00003472045,0.00009870041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8453993,"threshold_uncertainty_score":0.8925064,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008962265,0.0002532809,0.000204218,0.0001567005,0.0001554358,0.00006614449,0.001570364,0.0001987912,0.0003677732],"category_scores_gemma":[0.0001103407,0.0002710175,0.000112824,0.0001338806,0.0001104339,0.0002168585,0.00006935607,0.0004648306,0.00004174357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134318,"about_ca_system_score_gemma":0.0000346764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001030857,"about_ca_topic_score_gemma":0.00007708114,"domain_scores_codex":[0.9988226,0.00002261613,0.0003581695,0.0002738828,0.0001825025,0.000340237],"domain_scores_gemma":[0.9982827,0.0002546746,0.0000799907,0.0009221816,0.0003806361,0.00007981018],"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.00006384162,0.0002526407,0.00004952733,0.00002132482,0.0001908285,0.000002315648,0.0003000257,0.1258052,0.001675927,0.8174622,0.0009275536,0.05324864],"study_design_scores_gemma":[0.0003421487,0.00006569777,0.00009541524,0.00006521232,0.00001500305,0.00000219571,0.0001037048,0.9037309,0.003620627,0.09138057,0.0002889039,0.0002895881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00118391,0.00005468609,0.9565457,0.0008929366,0.0003125198,0.0004367318,0.0001456767,0.001212258,0.0392156],"genre_scores_gemma":[0.8936098,0.0002929207,0.1048242,0.0002189047,0.00004432959,0.0005718293,0.0002458857,0.00005525566,0.000136916],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8924259,"threshold_uncertainty_score":0.9999742,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965146,0.0001848369,0.0001451274,0.0003747205,0.0003129408,0.0001751195,0.002402186,0.00008855919,0.0001046955],"category_scores_gemma":[0.0003982875,0.0001921732,0.0001096057,0.0002743107,0.000030493,0.0007784493,0.0001945049,0.0002819349,0.0001091655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001557454,"about_ca_system_score_gemma":0.0002026205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001645029,"about_ca_topic_score_gemma":0.0004421394,"domain_scores_codex":[0.9984968,0.00008956977,0.0003342802,0.0004396468,0.0003437679,0.0002959094],"domain_scores_gemma":[0.9976489,0.0002916531,0.0001342514,0.001156346,0.000598639,0.0001702452],"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.0001380266,0.000114465,0.00008406876,0.000004196462,0.00004421199,3.565493e-7,0.002187545,0.001390307,0.00863661,0.7015828,0.00008690437,0.2857305],"study_design_scores_gemma":[0.0005243045,0.0002404083,0.001171311,0.00003868665,0.000003846549,0.000005221232,0.00003044337,0.5117409,0.01231003,0.4714058,0.002298608,0.0002304052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001556801,0.000008149848,0.9739388,0.006234603,0.0001198814,0.001033271,0.00002878734,0.0002289122,0.01685084],"genre_scores_gemma":[0.6849031,0.00001130426,0.313276,0.0001195027,0.00004159101,0.0004001544,0.000032235,0.00001603911,0.001200104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6833463,"threshold_uncertainty_score":0.7836598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}