{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011839103,0.00005468609,0.9565457,0.0008929366,0.00031251984,0.00043673185,0.00014567669,0.0012122575,0.0392156],"genre_scores_gemma":[0.89360976,0.00029292074,0.10482418,0.00021890466,0.000044329594,0.0005718293,0.00024588572,0.00005525566,0.00013691603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882257,0.000022616134,0.00035816955,0.00027388285,0.00018250251,0.00034023702],"domain_scores_gemma":[0.99828273,0.00025467464,0.0000799907,0.0009221816,0.00038063608,0.00007981018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008962265,0.00025328094,0.000204218,0.00015670047,0.0001554358,0.00006614449,0.0015703642,0.0001987912,0.00036777323],"category_scores_gemma":[0.000110340654,0.0002710175,0.000112824,0.00013388062,0.000110433946,0.00021685846,0.000069356065,0.0004648306,0.000041743566],"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.00006384162,0.0002526407,0.000049527327,0.000021324817,0.00019082852,0.000002315648,0.00030002574,0.12580515,0.0016759267,0.8174622,0.0009275536,0.05324864],"study_design_scores_gemma":[0.0003421487,0.00006569777,0.00009541524,0.00006521232,0.000015003053,0.0000021957098,0.000103704755,0.9037309,0.003620627,0.09138057,0.00028890392,0.0002895881],"about_ca_topic_score_codex":0.000010308575,"about_ca_topic_score_gemma":0.00007708114,"teacher_disagreement_score":0.8924259,"about_ca_system_score_codex":0.00013431802,"about_ca_system_score_gemma":0.000034676395,"threshold_uncertainty_score":0.9999742},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015568013,0.000008149848,0.97393876,0.0062346035,0.00011988138,0.0010332706,0.000028787343,0.00022891219,0.016850842],"genre_scores_gemma":[0.6849031,0.000011304263,0.313276,0.00011950266,0.000041591007,0.00040015444,0.000032234995,0.000016039114,0.0012001044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00008956977,0.00033428022,0.00043964683,0.00034376793,0.00029590935],"domain_scores_gemma":[0.9976489,0.00029165306,0.0001342514,0.0011563464,0.00059863896,0.00017024517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965146,0.0001848369,0.00014512739,0.00037472046,0.0003129408,0.00017511952,0.002402186,0.00008855919,0.0001046955],"category_scores_gemma":[0.0003982875,0.00019217325,0.000109605746,0.00027431073,0.000030493,0.0007784493,0.0001945049,0.00028193492,0.00010916547],"study_design_candidate":"theoretical_or_conceptual","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.00013802657,0.000114465,0.000084068764,0.000004196462,0.00004421199,3.565493e-7,0.0021875447,0.001390307,0.00863661,0.7015828,0.00008690437,0.2857305],"study_design_scores_gemma":[0.00052430446,0.00024040834,0.0011713115,0.000038686652,0.0000038465487,0.000005221232,0.000030443365,0.5117409,0.012310026,0.4714058,0.002298608,0.00023040522],"about_ca_topic_score_codex":0.00016450285,"about_ca_topic_score_gemma":0.00044213937,"teacher_disagreement_score":0.6833463,"about_ca_system_score_codex":0.00015574541,"about_ca_system_score_gemma":0.00020262046,"threshold_uncertainty_score":0.78365976},"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":"other","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.101976536,0.000061527295,0.14345749,0.0100088315,0.0005408895,0.0005867863,0.00007216606,0.0018061004,0.7414897],"genre_scores_gemma":[0.94737583,0.0004055804,0.051173173,0.00067706575,0.000032343065,0.00016591905,0.00003667749,0.00003472045,0.00009870041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988031,0.000021515742,0.0003275412,0.00027865433,0.00027412522,0.00029509983],"domain_scores_gemma":[0.9985472,0.00016422076,0.000043145872,0.0009564865,0.00017360385,0.00011533241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008069704,0.00021710002,0.00016630387,0.00022734008,0.00011438625,0.0001280167,0.0024026285,0.00011627234,0.0002652332],"category_scores_gemma":[0.00007672464,0.00021886519,0.000055051787,0.00019136042,0.00008375649,0.00030777627,0.00022835316,0.00049824436,0.0003068523],"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.00017050197,0.0006336938,0.00076020067,0.000036124573,0.0002341024,0.0000107014885,0.0020679717,0.17170261,0.008151762,0.7095843,0.0012781026,0.105369925],"study_design_scores_gemma":[0.0010443211,0.0006111653,0.018766692,0.0010676695,0.000053288095,0.0000258343,0.0014638486,0.7540032,0.04230821,0.16472174,0.014026145,0.0019078336],"about_ca_topic_score_codex":0.00001615079,"about_ca_topic_score_gemma":0.00013934876,"teacher_disagreement_score":0.84539926,"about_ca_system_score_codex":0.00014765329,"about_ca_system_score_gemma":0.000017009152,"threshold_uncertainty_score":0.89250636},"labels":[],"label_agreement":null}]}