{"meta":{"query_hash":"d662d0b8c9b5","filters":{"venue":"IEEE Transactions on Signal and Information Processing over Networks"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"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/d662d0b8c9b5","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Signal+and+Information+Processing+over+Networks"},"results":[{"id":"W1527669161","doi":"10.1109/tsipn.2015.2452811","title":"Optimal Forwarding in Opportunistic Delay Tolerant Networks With Meeting Rate Estimations","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Computer network; Distributed computing; Node (physics); A priori and a posteriori; Network topology; Telecommunications","score_opus":0.019693186406651218,"score_gpt":0.2300917326534443,"score_spread":0.21039854624679308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527669161","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.096371174,0.00026745486,0.90161985,0.0002038127,0.00001943551,0.000062499246,0.000112946276,0.00028535444,0.0010574263],"genre_scores_gemma":[0.91376114,0.00016475358,0.084973976,0.00004126711,0.000020170164,0.00008732965,0.00013965917,0.00003737678,0.0007744084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00037101578,0.000052869265,0.00021416834,0.00018351329,0.000105459425],"domain_scores_gemma":[0.9926093,0.00554347,0.0010304266,0.00035129354,0.0003429798,0.00012252155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025898248,0.00068770925,0.0010026342,0.00093219976,0.0006824008,0.000872891,0.0016116627,0.0008938974,0.0006186447],"category_scores_gemma":[0.013918424,0.0006319092,0.00038845456,0.0009205855,0.000975666,0.0017728709,0.000996368,0.00072010583,0.00013642397],"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.00005441708,0.000020023717,0.00074716454,0.000029407454,0.000011826799,0.000046099525,0.000052486786,0.98207986,0.00071558525,0.0051907315,0.00021270919,0.010839751],"study_design_scores_gemma":[0.000006667396,0.000010569943,0.000116796204,0.0000021258031,0.0000026375685,0.000015771442,0.000014820422,0.9940843,0.0003433342,0.0052869176,0.000111256035,0.000004892059],"about_ca_topic_score_codex":0.005668032,"about_ca_topic_score_gemma":0.0039272252,"teacher_disagreement_score":0.005668032,"about_ca_system_score_codex":0.0013469639,"about_ca_system_score_gemma":0.0012427523,"threshold_uncertainty_score":0.013696432},"labels":[],"label_agreement":null},{"id":"W1612263467","doi":"10.1109/tsipn.2015.2476916","title":"Distributed Widely Linear Multiple-Model Adaptive Estimation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":24,"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":"Estimator; Computer science; Convergence (economics); A priori and a posteriori; Moment (physics); Mathematical optimization; State (computer science); Algorithm; Mathematics","score_opus":0.025557851520279246,"score_gpt":0.24411476749331448,"score_spread":0.21855691597303523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1612263467","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.0031015147,0.00018011579,0.9962035,0.000072925366,0.000018272855,0.000008325538,0.000007688255,0.00007206297,0.00033558818],"genre_scores_gemma":[0.72547936,0.0009551121,0.2690373,0.00018062127,0.00017485858,0.00011946835,0.00012575557,0.000049112914,0.0038783492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992223,0.00026548773,0.000035335186,0.00023816239,0.00019309025,0.000045580928],"domain_scores_gemma":[0.99886084,0.0006920981,0.00013847824,0.00012799916,0.00015985528,0.000020843936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037813,0.0007511313,0.0009816118,0.00037267464,0.00024722368,0.00066887954,0.0010124366,0.00095866807,0.0007160771],"category_scores_gemma":[0.0038390649,0.00033853314,0.000525786,0.0007704668,0.00063438964,0.0011455041,0.00101638,0.001390129,0.00027018998],"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.000054184195,0.000034230365,0.00069699076,0.000093662085,0.00009259985,0.00007942883,0.00007257538,0.8734532,0.0049417214,0.023653395,0.00058487523,0.09624306],"study_design_scores_gemma":[0.0000055054506,0.000018661785,0.00007740585,0.0000028531244,0.0000056932818,0.000018018445,0.0000049862792,0.99489164,0.00056268356,0.0040248963,0.0003824338,0.0000052074274],"about_ca_topic_score_codex":0.0019702888,"about_ca_topic_score_gemma":0.0017105051,"teacher_disagreement_score":0.0019702888,"about_ca_system_score_codex":0.00047829497,"about_ca_system_score_gemma":0.000513027,"threshold_uncertainty_score":0.005488515},"labels":[],"label_agreement":null},{"id":"W1661201301","doi":"10.1109/tsipn.2015.2471846","title":"Error Propagation in Gossip-Based Distributed Particle Filters","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Public Works and Government Services Canada","keywords":"Gossip; Particle filter; Function (biology); Filter (signal processing); Stability (learning theory); Exponential function; Applied mathematics; Algorithm; Computer science; Mathematics; Upper and lower bounds; Statistics; Mathematical optimization; Mathematical analysis; Machine learning","score_opus":0.020358693069847326,"score_gpt":0.2360437830662466,"score_spread":0.21568508999639927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661201301","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.05222997,0.00033845488,0.9442392,0.00032910728,0.000076487006,0.000028855256,0.000036593985,0.00027049353,0.0024507772],"genre_scores_gemma":[0.9558139,0.0002347892,0.04143646,0.000114732764,0.00006381359,0.000068215966,0.000046730183,0.000058652036,0.0021627187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888045,0.00033041873,0.000060059632,0.00016868945,0.00044163415,0.000118796794],"domain_scores_gemma":[0.9913338,0.006318468,0.0008312668,0.00046828913,0.00091118313,0.00013702053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032530678,0.00083239033,0.0007220002,0.0007009893,0.0007836086,0.0009793713,0.0010828406,0.0013016869,0.0007416116],"category_scores_gemma":[0.015935445,0.00044268518,0.00049137115,0.00050872937,0.0015876574,0.0018004803,0.001472428,0.000896689,0.00016320057],"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.00013723379,0.000013234442,0.000714559,0.000055043995,0.000032997104,0.00010276121,0.000109994115,0.96415085,0.0021223053,0.023189146,0.00038768418,0.008984199],"study_design_scores_gemma":[0.000008487964,0.000022463482,0.00009534528,0.0000032877515,0.0000056433,0.000010946971,0.0000098066075,0.9932494,0.00070265867,0.0057120575,0.00017444856,0.0000054742245],"about_ca_topic_score_codex":0.006388829,"about_ca_topic_score_gemma":0.0034623754,"teacher_disagreement_score":0.006388829,"about_ca_system_score_codex":0.0012785364,"about_ca_system_score_gemma":0.0009095741,"threshold_uncertainty_score":0.017204106},"labels":[],"label_agreement":null},{"id":"W1673974905","doi":"10.1109/tsipn.2015.2476695","title":"No-Reference Transmission Distortion Modelling for H.264/AVC-Coded Video","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":3,"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 Guelph","funders":"","keywords":"Computer science; Motion compensation; Rate–distortion optimization; Distortion (music); Algorithm; Data compression; Coding (social sciences); Reference frame; Video quality; Scalable Video Coding; Block-matching algorithm; Real-time computing; Computer vision; Frame (networking); Video tracking; Bandwidth (computing); Video processing; Telecommunications; Mathematics","score_opus":0.035128651631364895,"score_gpt":0.24343820123885412,"score_spread":0.20830954960748924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673974905","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.0052496577,0.0005200071,0.9926859,0.000045725836,0.000041508727,0.00003322557,0.000024198207,0.00016263184,0.0012371517],"genre_scores_gemma":[0.58029133,0.0025625036,0.40749598,0.00011154035,0.00008412307,0.00014517973,0.0003492412,0.00019738209,0.008762684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00011150699,0.000028620518,0.000097869975,0.00031271865,0.000035573525],"domain_scores_gemma":[0.99939525,0.00020899023,0.00009784764,0.000072326824,0.00021515491,0.000010403879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157844,0.00072495325,0.000484975,0.00052918657,0.00029140478,0.0008127038,0.0013577692,0.00070131005,0.0010044527],"category_scores_gemma":[0.0021006553,0.00024249787,0.00052412326,0.00037449293,0.0004194705,0.0010496735,0.00035162628,0.00080209353,0.00051114825],"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.00022047621,0.00006006173,0.0008404681,0.00025750216,0.00004734322,0.00022290903,0.00010796255,0.81061673,0.026113346,0.021250611,0.0014179944,0.13884462],"study_design_scores_gemma":[0.0000027771632,0.000030053809,0.00017594807,0.000006972087,0.0000071982904,0.000090833695,0.000005132586,0.99289215,0.005208123,0.00062810566,0.00094427326,0.000008443324],"about_ca_topic_score_codex":0.0064636027,"about_ca_topic_score_gemma":0.0056816307,"teacher_disagreement_score":0.0064636027,"about_ca_system_score_codex":0.00094372086,"about_ca_system_score_gemma":0.0007430373,"threshold_uncertainty_score":0.012852013},"labels":[],"label_agreement":null},{"id":"W1814829895","doi":"10.1109/tsipn.2016.2620440","title":"Efficient Distributed Online Prediction and Stochastic Optimization With Approximate Distributed Averaging","year":2016,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Gossip; Scaling; Distributed algorithm; Computer science; Mathematics; Upper and lower bounds; Eigenvalues and eigenvectors; Random walk; Computation; Matrix (chemical analysis); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Distributed computing","score_opus":0.008005984302644301,"score_gpt":0.20533402556592514,"score_spread":0.19732804126328085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814829895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074185845,0.0002624251,0.99069256,0.00023861493,0.000040664912,0.000022587159,0.000027432774,0.00024806208,0.001049081],"genre_scores_gemma":[0.7384594,0.0005299973,0.2555625,0.00034330593,0.00028213597,0.00031554172,0.00021922265,0.00022110372,0.0040667625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983699,0.0006275483,0.00006320608,0.00033124915,0.00044142822,0.00016670267],"domain_scores_gemma":[0.995568,0.0032256367,0.00037306902,0.00036855144,0.00035417362,0.00011066142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240753,0.0013037532,0.0016973725,0.0004890192,0.00051510165,0.0010620245,0.0018255572,0.0013419649,0.0013159534],"category_scores_gemma":[0.00780877,0.00061180023,0.0007281309,0.0009369004,0.0013846918,0.0018442062,0.0016132433,0.0017943683,0.00030342492],"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.00006188647,0.00003500192,0.00026805326,0.000054518867,0.00004173188,0.000036390233,0.00003287882,0.9597551,0.0006798037,0.022065625,0.00084422884,0.016124625],"study_design_scores_gemma":[0.0000038470935,0.000007492296,0.000016122694,0.0000010505288,0.0000016004451,0.0000024836643,0.000001288884,0.9954058,0.000080386926,0.0043968414,0.0000815638,0.0000015388395],"about_ca_topic_score_codex":0.0053530317,"about_ca_topic_score_gemma":0.0041217385,"teacher_disagreement_score":0.0053530317,"about_ca_system_score_codex":0.0011932964,"about_ca_system_score_gemma":0.001528721,"threshold_uncertainty_score":0.011850357},"labels":[],"label_agreement":null},{"id":"W2318012511","doi":"10.1109/tsipn.2016.2519766","title":"Detection of Homophilic Communities and Coordination of Interacting Meta-Agents: A Game-Theoretic Viewpoint","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Regret; Nonparametric statistics; Best response; Computer science; Nash equilibrium; Matching (statistics); Fictitious play; Game theory; Mathematical optimization; Artificial intelligence; Mathematical economics; Machine learning; Mathematics; Econometrics","score_opus":0.014598080114865542,"score_gpt":0.24757354880793153,"score_spread":0.23297546869306598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318012511","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.07163519,0.00013033247,0.9259179,0.00043246444,0.00001692776,0.00005961999,0.00003019847,0.000060513892,0.0017167773],"genre_scores_gemma":[0.90604544,0.0001521769,0.09241301,0.000105358595,0.000037506266,0.00009990612,0.00004126913,0.000020233381,0.0010851477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.0006088064,0.00005586255,0.0003003111,0.00022416715,0.00010738193],"domain_scores_gemma":[0.99155605,0.006214844,0.0010178322,0.00042386202,0.00037782604,0.00040958804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905783,0.0006234834,0.001043042,0.0009860176,0.00065783353,0.0014406665,0.0019947505,0.0014768802,0.00093388086],"category_scores_gemma":[0.012871076,0.0005016938,0.00084851886,0.00047458187,0.0027615894,0.002680974,0.0016083706,0.00129956,0.00012447378],"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.00011054769,0.00008482187,0.0050725807,0.00012239712,0.00014800916,0.00020049812,0.00032862285,0.76570874,0.004342242,0.20281468,0.0005641218,0.020502651],"study_design_scores_gemma":[0.0000058665446,0.000025812576,0.00036322227,0.000005199786,0.0000073611664,0.000026864138,0.00003217271,0.9674878,0.00038570416,0.031499855,0.00015094262,0.000009247371],"about_ca_topic_score_codex":0.0019648278,"about_ca_topic_score_gemma":0.0011155928,"teacher_disagreement_score":0.002905783,"about_ca_system_score_codex":0.0011257163,"about_ca_system_score_gemma":0.00093982526,"threshold_uncertainty_score":0.015367448},"labels":[],"label_agreement":null},{"id":"W2507553941","doi":"10.1109/tsipn.2016.2607123","title":"Optimal Power Allocation for Hybrid Energy Harvesting and Power Grid Coexisting System With Power Upper Bounded Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Computer science; Power (physics); Convex optimization; Grid; Energy harvesting; Electric power system; Energy (signal processing); Power budget; Mathematics; Regular polygon","score_opus":0.005488378737622835,"score_gpt":0.18567353979797718,"score_spread":0.18018516106035434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507553941","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.054005917,0.0014956245,0.92840666,0.00077228143,0.00009687942,0.000106757885,0.00020096598,0.0002506095,0.014664287],"genre_scores_gemma":[0.94636834,0.00067220733,0.046311215,0.00018122996,0.000056373607,0.00015767997,0.00010837155,0.00006315881,0.0060814214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995851,0.00014671145,0.000016432226,0.000098307195,0.00006045906,0.000093057184],"domain_scores_gemma":[0.99948955,0.0003418444,0.00005593766,0.000019809951,0.00006361593,0.00002921741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007578055,0.0009947176,0.0013350194,0.0003780365,0.0003700199,0.00155433,0.00084211817,0.0010501817,0.0039700763],"category_scores_gemma":[0.0011444254,0.00050997175,0.0004981485,0.0008509633,0.0007293921,0.0009954529,0.0009980482,0.00092914235,0.00035760298],"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.00015018403,0.000055473316,0.00044787992,0.00017832397,0.000044252287,0.00019593966,0.000070266564,0.957553,0.002423317,0.01934921,0.0021708813,0.017361108],"study_design_scores_gemma":[0.000011531107,0.000022781087,0.000060349576,0.000005942768,0.0000065793997,0.000020653513,0.00001721801,0.9953799,0.00018621412,0.0039813574,0.00030330382,0.0000041755493],"about_ca_topic_score_codex":0.0030616433,"about_ca_topic_score_gemma":0.0026093358,"teacher_disagreement_score":0.0039700763,"about_ca_system_score_codex":0.0009845532,"about_ca_system_score_gemma":0.00083493674,"threshold_uncertainty_score":0.013281286},"labels":[],"label_agreement":null},{"id":"W2548762084","doi":"10.1109/tsipn.2017.2731160","title":"Online Bayesian Inference of Diffusion Networks","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inference; Markov chain Monte Carlo; Exploit; Set (abstract data type); Ranking (information retrieval); Frequentist inference; Bayesian network; Bayesian inference; Node (physics); Bayesian probability; Data mining; Process (computing); Machine learning; Artificial intelligence; Engineering","score_opus":0.013407593670798433,"score_gpt":0.2732175694567648,"score_spread":0.2598099757859664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548762084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025612451,0.0005176116,0.9706335,0.00072168704,0.00005011582,0.000061774095,0.00028915505,0.0005030614,0.0016105796],"genre_scores_gemma":[0.6778193,0.0012959454,0.31332144,0.00034833542,0.00026255246,0.0003315276,0.0016583197,0.00026418356,0.0046984176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981433,0.000869249,0.000109868444,0.00045299108,0.0002881188,0.0001365177],"domain_scores_gemma":[0.9685015,0.02755608,0.0013516281,0.0009321277,0.0012979177,0.00036076998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006651568,0.0012748799,0.002266634,0.0025250185,0.00098673,0.002409509,0.003081059,0.0025725767,0.0035877696],"category_scores_gemma":[0.048730236,0.0016676156,0.0013377399,0.0019629418,0.0016986204,0.0044750283,0.0018559713,0.004055293,0.0006974177],"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.00008867091,0.000052547148,0.0014669767,0.00008182025,0.00005648088,0.00005817493,0.00008579957,0.93267536,0.00039801217,0.043086518,0.0011711534,0.020778477],"study_design_scores_gemma":[0.0000081398675,0.000002994236,0.000109995904,0.0000071658983,0.000004053133,0.0000059759295,0.0000044254216,0.98165303,0.000083209205,0.017976077,0.00013993717,0.0000049794803],"about_ca_topic_score_codex":0.020941693,"about_ca_topic_score_gemma":0.02025054,"teacher_disagreement_score":0.020941693,"about_ca_system_score_codex":0.0029414461,"about_ca_system_score_gemma":0.0022596172,"threshold_uncertainty_score":0.041639626},"labels":[],"label_agreement":null},{"id":"W2680117742","doi":"10.1109/tsipn.2017.2731053","title":"Inferring Structural Characteristics of Networks With Strong and Weak Ties From Fixed-Choice Surveys","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Econometrics; Social network (sociolinguistics); Network topology; Variety (cybernetics); Degree distribution; Computer science; Jackknife resampling; Interpersonal ties; Clustering coefficient; Cluster analysis; Respondent; Statistics; Mathematics; Complex network","score_opus":0.012326787098933752,"score_gpt":0.24892387347589584,"score_spread":0.23659708637696208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2680117742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5578516,0.00017688949,0.43847582,0.00019782288,0.000013764327,0.000247475,0.0013889995,0.00016013783,0.0014875288],"genre_scores_gemma":[0.9094672,0.00022162533,0.08817281,0.000041972533,0.000016130653,0.00020626,0.0014576209,0.000017328539,0.00039900304],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946144,0.0038196992,0.0002189501,0.00079091074,0.00039056982,0.00016540465],"domain_scores_gemma":[0.90730095,0.071203925,0.010687323,0.0081985975,0.0019421714,0.0006670251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009421908,0.00056701264,0.0006322267,0.0027091354,0.00046382425,0.00106301,0.0014421262,0.0011735734,0.0011726505],"category_scores_gemma":[0.08162868,0.00075955,0.00090253743,0.002328581,0.0012865253,0.0030498975,0.0010951854,0.0013682799,0.00028512158],"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.0005249019,0.00039503654,0.5503148,0.0004885061,0.0007208074,0.0003544264,0.0024602115,0.29071328,0.003708492,0.0646169,0.0015850634,0.08411751],"study_design_scores_gemma":[0.0000620902,0.00023236453,0.14630559,0.00013028816,0.00013157677,0.00042130615,0.000928068,0.7900554,0.0025870213,0.056495063,0.0025558504,0.0000954027],"about_ca_topic_score_codex":0.005063764,"about_ca_topic_score_gemma":0.0075205043,"teacher_disagreement_score":0.009421908,"about_ca_system_score_codex":0.0010843513,"about_ca_system_score_gemma":0.0004905337,"threshold_uncertainty_score":0.04982847},"labels":[],"label_agreement":null},{"id":"W2732012519","doi":"10.1109/tsipn.2017.2723762","title":"A Distributed Control Paradigm for Smart Grid to Address Attacks on Data Integrity and Availability","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":36,"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":"Smart grid; Computer science; Controller (irrigation); Electric power system; Control theory (sociology); Grid; Parametric statistics; Distributed power; Transient (computer programming); Cyber-physical system; Distributed computing; Power (physics); Control (management); Engineering","score_opus":0.02384976851742021,"score_gpt":0.26468563497147335,"score_spread":0.24083586645405314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732012519","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.003563569,0.00024002863,0.9907748,0.00027204928,0.00013923066,0.000043893127,0.00001608139,0.00036156178,0.004588801],"genre_scores_gemma":[0.8114017,0.0006420965,0.180153,0.00055570086,0.00033589316,0.00028614307,0.00007848033,0.00005815667,0.006488752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961156,0.000070685135,0.000025415797,0.00012037531,0.00014438495,0.000027566706],"domain_scores_gemma":[0.99971515,0.00007104946,0.00003876979,0.000071363465,0.000084088715,0.000019564332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051947567,0.0004943412,0.00032929392,0.00025350996,0.00039810702,0.00073603704,0.00093626045,0.0005229578,0.0021180564],"category_scores_gemma":[0.0007246154,0.00012834834,0.00035047502,0.00024463693,0.00077069073,0.0011654267,0.00071988825,0.0013076813,0.0003594245],"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.00022037342,0.0002444421,0.00063900615,0.00034918642,0.000107517044,0.00032318803,0.00047883016,0.25319138,0.071946755,0.4180963,0.006455075,0.247948],"study_design_scores_gemma":[0.00009305911,0.00027224753,0.00023307916,0.000030820705,0.000040510848,0.00015759213,0.00005613347,0.89304477,0.010560563,0.069880106,0.025603482,0.000027671724],"about_ca_topic_score_codex":0.0009216338,"about_ca_topic_score_gemma":0.0009484442,"teacher_disagreement_score":0.0021180564,"about_ca_system_score_codex":0.00046698184,"about_ca_system_score_gemma":0.0005614646,"threshold_uncertainty_score":0.0070855618},"labels":[],"label_agreement":null},{"id":"W2789626949","doi":"10.1109/tsipn.2018.2801659","title":"Guest Editorial Distributed Signal Processing for Security and Privacy in Networked Cyber-Physical Systems","year":2018,"lang":"en","type":"editorial","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":3,"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; Concordia University","funders":"","keywords":"Cyber-physical system; Computer science; Key (lock); Reliability (semiconductor); Wireless sensor network; Computer security; Distributed computing; Aerospace; Process (computing); Computer network; Engineering; Power (physics)","score_opus":0.004607394109169381,"score_gpt":0.2183679451030099,"score_spread":0.2137605509938405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789626949","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086618355,0.009739613,0.0007466758,0.025253404,0.9607147,0.000015275931,0.000037634967,0.000073187606,0.0033328668],"genre_scores_gemma":[0.0009098561,0.0059845583,0.00016273485,0.0053090323,0.9800949,0.000010144396,0.000018655606,0.000032791075,0.0074772597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796593,0.00023219002,0.00021216541,0.0003260578,0.001102869,0.00016095255],"domain_scores_gemma":[0.991248,0.0035231127,0.00047786848,0.0002604643,0.003260426,0.0012300683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025590311,0.002136219,0.0016885132,0.0018635439,0.0016070489,0.005176861,0.002091353,0.00798069,0.013901314],"category_scores_gemma":[0.009489312,0.0005298271,0.0012944124,0.0007292385,0.0017522232,0.0031861933,0.0010731075,0.01217942,0.009413038],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00005180673,0.000018472576,0.00003247704,0.0002863462,0.000016716232,0.00031419718,0.00001776165,0.000100825055,0.00020368154,0.0020788815,0.9824687,0.014410063],"study_design_scores_gemma":[0.000029242397,0.000041821775,0.00011575447,0.00020416887,0.000020237794,0.00058560364,0.000019481253,0.0003812755,0.00024209195,0.0022486257,0.9960985,0.000013169574],"about_ca_topic_score_codex":0.00029502827,"about_ca_topic_score_gemma":0.00051989,"teacher_disagreement_score":0.013901314,"about_ca_system_score_codex":0.0012420458,"about_ca_system_score_gemma":0.0009643009,"threshold_uncertainty_score":0.046504557},"labels":[],"label_agreement":null},{"id":"W2888337474","doi":"10.1109/tsipn.2018.2866322","title":"Improved Bounds for Max Consensus in Wireless Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Random geometric graph; Pairwise comparison; Combinatorics; Binary logarithm; Mathematics; Wireless network; Random graph; Graph; Discrete mathematics; Upper and lower bounds; Asynchronous communication; Computer science; Algorithm; Wireless; Statistics; Line graph","score_opus":0.017423577107964456,"score_gpt":0.25554497526096737,"score_spread":0.2381213981530029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888337474","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.008266483,0.004351522,0.9634436,0.0016223645,0.0005019107,0.00009680188,0.00030752958,0.0009848335,0.020424886],"genre_scores_gemma":[0.6515458,0.011762534,0.29850128,0.0025997572,0.0024001645,0.0017631666,0.0015000142,0.002411339,0.02751595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917208,0.002305361,0.00034563697,0.0016216009,0.0028398074,0.0011667412],"domain_scores_gemma":[0.9639741,0.025277076,0.0021011466,0.0033943907,0.0042768456,0.0009763573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009847066,0.0040919348,0.002698262,0.0038494347,0.002124215,0.0044886554,0.005191126,0.0027173648,0.011937082],"category_scores_gemma":[0.05834697,0.0014667057,0.0024121108,0.0036412522,0.0038321996,0.013332761,0.0065284967,0.0100293,0.0039698635],"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.00045718384,0.000103798746,0.0007489999,0.000573971,0.00014760559,0.00018955715,0.0005540042,0.48027357,0.003810027,0.4498911,0.014332665,0.0489176],"study_design_scores_gemma":[0.00003238827,0.000084729465,0.00024771583,0.00011241211,0.0000544913,0.000073444404,0.000070304784,0.74755615,0.0013240799,0.24427631,0.006127989,0.0000399444],"about_ca_topic_score_codex":0.0038279805,"about_ca_topic_score_gemma":0.0033402105,"teacher_disagreement_score":0.011937082,"about_ca_system_score_codex":0.0060466304,"about_ca_system_score_gemma":0.0026948943,"threshold_uncertainty_score":0.052076876},"labels":[],"label_agreement":null},{"id":"W2907596805","doi":"10.1109/tsipn.2018.2890231","title":"Graph-Based Compression for Distributed Particle Filters","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Overhead (engineering); Particle filter; Laplacian matrix; ENCODE; Graph; Algorithm; Theoretical computer science; Distributed computing; Filter (signal processing)","score_opus":0.008885015688578418,"score_gpt":0.2240665093562346,"score_spread":0.21518149366765618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907596805","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.004898897,0.00013007844,0.9930789,0.0002024816,0.00005736103,0.000022458384,0.00003807715,0.00031455106,0.0012571776],"genre_scores_gemma":[0.47077635,0.0005696186,0.5222436,0.0003714509,0.00016589205,0.0001933008,0.00033807993,0.00017304963,0.0051686065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.000098521916,0.00002176584,0.000093417555,0.00024557364,0.00003484041],"domain_scores_gemma":[0.9986229,0.00071321503,0.00010453097,0.00023997191,0.00027553036,0.000043828677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065166125,0.00060068205,0.0005925535,0.00064697326,0.00039655156,0.0007591875,0.0010645295,0.0011707335,0.002138072],"category_scores_gemma":[0.0039097136,0.00027030773,0.00040279017,0.0008668094,0.0007079388,0.0013659929,0.0010044369,0.0011442662,0.0006175381],"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.0001974028,0.000060676237,0.0006188073,0.00012772148,0.00004741274,0.00015266768,0.00009925885,0.693564,0.014149998,0.069628105,0.005065538,0.2162884],"study_design_scores_gemma":[0.00001930443,0.000030052543,0.00014194226,0.0000067499186,0.0000056848144,0.000055893113,0.000011184061,0.9791566,0.003169621,0.015451301,0.0019431879,0.0000085888505],"about_ca_topic_score_codex":0.0031693005,"about_ca_topic_score_gemma":0.0033347968,"teacher_disagreement_score":0.0031693005,"about_ca_system_score_codex":0.000802641,"about_ca_system_score_gemma":0.0009121851,"threshold_uncertainty_score":0.0071525574},"labels":[],"label_agreement":null},{"id":"W2917794430","doi":"10.1109/tsipn.2019.2901171","title":"Decentralized Topology Reconfiguration in Multiphase Distribution Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Topology (electrical circuits); Distributed computing; Computer science; Network topology; Distribution (mathematics); Computer network; Mathematics; Embedded system","score_opus":0.004232839715764947,"score_gpt":0.2011898318876006,"score_spread":0.19695699217183565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917794430","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.092828624,0.00026250113,0.90140605,0.00024341441,0.000037748592,0.00007061828,0.000042352563,0.00030816803,0.0048005525],"genre_scores_gemma":[0.964901,0.00009430892,0.03367584,0.000026683707,0.000012191016,0.00005183522,0.00003181037,0.000016473756,0.001189771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.00015648192,0.000011022817,0.00006410954,0.000059773076,0.000040995295],"domain_scores_gemma":[0.99940443,0.00029109477,0.00011510863,0.00007875229,0.00006084826,0.000049807946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475531,0.0002738083,0.0004433235,0.00033580794,0.0004068088,0.00058734225,0.000532974,0.00040833457,0.00065604266],"category_scores_gemma":[0.0016533462,0.00022004085,0.00019467814,0.00037148353,0.00054202345,0.0006719323,0.0005225786,0.00035753925,0.00011513465],"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.000035778023,0.000014597029,0.00033480665,0.000019062078,0.000007469531,0.00005571316,0.00003654779,0.96821487,0.0021455148,0.008845929,0.00030230792,0.01998747],"study_design_scores_gemma":[0.000006155074,0.000013041902,0.00008831864,0.0000011814282,0.0000011249767,0.000019572446,0.000008712256,0.995262,0.00027683127,0.0040220153,0.00029910766,0.0000017275299],"about_ca_topic_score_codex":0.0014508995,"about_ca_topic_score_gemma":0.0016311101,"teacher_disagreement_score":0.0014508995,"about_ca_system_score_codex":0.00065034657,"about_ca_system_score_gemma":0.0004302541,"threshold_uncertainty_score":0.0047186017},"labels":[],"label_agreement":null},{"id":"W2929710725","doi":"10.1109/tsipn.2019.2932678","title":"Integrating PHY Security Into NDN-IoT Networks By Exploiting MEC: Authentication Efficiency, Robustness, and Accuracy Enhancement","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Spoofing attack; Authentication (law); Robustness (evolution); Authentication protocol; Challenge–response authentication; Exploit; Replay attack; Data Authentication Algorithm","score_opus":0.0054402516824490574,"score_gpt":0.2095002343177927,"score_spread":0.20405998263534364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929710725","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.0571037,0.0005642378,0.9347679,0.00028821937,0.00010801828,0.00008663874,0.000025802368,0.0006633533,0.0063921404],"genre_scores_gemma":[0.9102971,0.0002717647,0.08789832,0.0001377787,0.00003072869,0.000030479583,0.000038510705,0.000019867955,0.0012754835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880767,0.00033220224,0.00011183265,0.00016888705,0.00046869073,0.000110769186],"domain_scores_gemma":[0.9986186,0.00030516193,0.00015582654,0.00046996027,0.0004106418,0.000039915165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014014769,0.00050636,0.00047607618,0.00046398077,0.00046222867,0.0010437727,0.0008396055,0.00061015657,0.0007966449],"category_scores_gemma":[0.0032134585,0.00016956704,0.0002653965,0.00040498847,0.0007231251,0.0020674968,0.0019326122,0.0006749765,0.00037405815],"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.0007780433,0.00020416954,0.0077787233,0.00035455753,0.00009070662,0.0008463476,0.00035837584,0.15257083,0.25773212,0.093270004,0.0020461532,0.48396993],"study_design_scores_gemma":[0.00002555821,0.0002651478,0.001353058,0.000047261732,0.00005394675,0.0010365859,0.00006681284,0.87146366,0.10318166,0.012101986,0.0103581725,0.000046155074],"about_ca_topic_score_codex":0.00040132453,"about_ca_topic_score_gemma":0.0004667121,"teacher_disagreement_score":0.0014014769,"about_ca_system_score_codex":0.00061049225,"about_ca_system_score_gemma":0.00046626522,"threshold_uncertainty_score":0.0074118376},"labels":[],"label_agreement":null},{"id":"W2964208174","doi":"10.1109/tsipn.2018.2866342","title":"Privacy-Preserving Average Consensus: Privacy Analysis and Algorithm Design","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Node (physics); Variance (accounting); Differential privacy; Noise (video); Privacy protection; Algorithm; Data mining; Artificial intelligence; Computer security","score_opus":0.018561122158338463,"score_gpt":0.24947123619593986,"score_spread":0.2309101140376014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964208174","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.0021916318,0.00016617036,0.9964316,0.00023972546,0.000017864026,0.000035148634,0.000026387548,0.000069772075,0.00082180474],"genre_scores_gemma":[0.661424,0.0016663809,0.33146542,0.0003914655,0.00027221307,0.0006013681,0.00026738536,0.00012040399,0.0037913816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418616,0.0022579215,0.00031253227,0.0013995441,0.0014418128,0.000401926],"domain_scores_gemma":[0.9916414,0.004635348,0.0008320769,0.0013016015,0.0013599076,0.00022958008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005505085,0.0010293081,0.0015507621,0.0012346373,0.0011718794,0.0026099328,0.0026401707,0.002187013,0.0016190406],"category_scores_gemma":[0.01911201,0.00067903707,0.0012947065,0.0021610826,0.0022696878,0.0043654526,0.003047774,0.002756597,0.0004745466],"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.00017068197,0.0000813542,0.0010962642,0.00021366423,0.000116589414,0.00017908346,0.00029201334,0.63722306,0.005205425,0.27234015,0.002690494,0.080391206],"study_design_scores_gemma":[0.000011128746,0.000049324233,0.00007800793,0.000012888388,0.000012069638,0.00007321936,0.000024531306,0.92485076,0.00158485,0.07230879,0.0009790818,0.000015329326],"about_ca_topic_score_codex":0.0014723451,"about_ca_topic_score_gemma":0.0007330924,"teacher_disagreement_score":0.005505085,"about_ca_system_score_codex":0.0023991514,"about_ca_system_score_gemma":0.002843805,"threshold_uncertainty_score":0.029114008},"labels":[],"label_agreement":null},{"id":"W3110866490","doi":"10.1109/tsipn.2020.3044955","title":"Anytime Minibatch With Delayed Gradients","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Stochastic Gradient Optimization Techniques","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 Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Asynchronous communication; Regret; Convergence (economics); Transmission (telecommunications); Range (aeronautics); Variable (mathematics); Convex optimization; Optimization problem","score_opus":0.009260081566282828,"score_gpt":0.20159326783426498,"score_spread":0.19233318626798215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110866490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081385456,0.0013577951,0.9036758,0.000784694,0.00038869478,0.00034022448,0.0003274562,0.0056263935,0.0061135315],"genre_scores_gemma":[0.80246407,0.00024020838,0.18841727,0.00059796334,0.00010469276,0.00043927843,0.0005520761,0.0004288964,0.0067555555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883693,0.00038637576,0.00006427129,0.00029839328,0.00016889717,0.00024515358],"domain_scores_gemma":[0.99719787,0.0011773898,0.00022568197,0.0006700365,0.00037690328,0.00035212436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018123741,0.0014520447,0.0017648813,0.0002809118,0.00077728526,0.00092988356,0.0030746274,0.0014986093,0.008271837],"category_scores_gemma":[0.0051341476,0.00051481376,0.0006275151,0.00041954374,0.0011912567,0.0017015233,0.0019668571,0.0020347065,0.0015406968],"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.0017985742,0.0002966827,0.0016216519,0.000287634,0.000093347386,0.00016632529,0.0001483084,0.83916616,0.004983453,0.019197458,0.010987374,0.121253036],"study_design_scores_gemma":[0.00012619265,0.00015971258,0.00028685085,0.000013744976,0.000014131445,0.00004429196,0.000021773245,0.98664176,0.0016955486,0.0091459835,0.0018330322,0.000016941956],"about_ca_topic_score_codex":0.0044485065,"about_ca_topic_score_gemma":0.0052425656,"teacher_disagreement_score":0.008271837,"about_ca_system_score_codex":0.0010458834,"about_ca_system_score_gemma":0.0022491545,"threshold_uncertainty_score":0.027672052},"labels":[],"label_agreement":null},{"id":"W3210132965","doi":"10.1109/tsipn.2021.3122289","title":"Detection of False Data Injection Attacks in Industrial Wireless Sensor Networks Exploiting Network Numerical Sparsity","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Computer science; Wireless sensor network; Scalability; Compressed sensing; Linear network coding; Data aggregator; Computer network; Distributed computing; Software deployment; Real-time computing; Algorithm","score_opus":0.0223292163812453,"score_gpt":0.22262770714395666,"score_spread":0.20029849076271136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210132965","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.12902792,0.00017610296,0.86868656,0.00028852734,0.000027485834,0.000045439898,0.000027826172,0.00025447807,0.0014656554],"genre_scores_gemma":[0.95395064,0.00012082719,0.045528017,0.000050981536,0.000015639056,0.00002655287,0.00002748276,0.000009644274,0.00027016265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988863,0.000404415,0.00004480799,0.000111218265,0.00046175034,0.00009154029],"domain_scores_gemma":[0.99185985,0.0056045656,0.0011590017,0.00070534524,0.0005330256,0.00013828037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017614806,0.0005102555,0.00052249664,0.0005033284,0.00024841382,0.0005156155,0.00062255317,0.0005494441,0.00028880133],"category_scores_gemma":[0.012235395,0.00021251258,0.00022052875,0.00039355402,0.0013480508,0.001507343,0.0012394211,0.0008167925,0.00006893252],"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.00047583316,0.00008682366,0.004401644,0.00012749492,0.000048429516,0.00029218354,0.00024593621,0.86611974,0.029775752,0.02592251,0.0005475193,0.07195613],"study_design_scores_gemma":[0.0000037159823,0.00003110959,0.00020094054,0.0000042503625,0.0000025620418,0.000041547693,0.000010868069,0.9942946,0.0033707274,0.001967579,0.000067647,0.000004406375],"about_ca_topic_score_codex":0.00072798796,"about_ca_topic_score_gemma":0.000673913,"teacher_disagreement_score":0.0017614806,"about_ca_system_score_codex":0.0005428458,"about_ca_system_score_gemma":0.0006086427,"threshold_uncertainty_score":0.009315729},"labels":[],"label_agreement":null},{"id":"W4226246573","doi":"10.1109/tsipn.2022.3163931","title":"Staleness Analysis in Asynchronous Optimization","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Asynchronous communication; Computer science; Convergence (economics); Node (physics); Process (computing); Optimization problem; Rate of convergence; Optimization algorithm; Bandwidth (computing); Distributed computing; Work in process; Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.0062926203262685014,"score_gpt":0.2089693430641436,"score_spread":0.2026767227378751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226246573","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.04189848,0.00077798887,0.95067286,0.0005533014,0.00006691147,0.00004723464,0.000075138436,0.00030179054,0.005606279],"genre_scores_gemma":[0.9217581,0.00096855895,0.06705802,0.00033075627,0.00011866889,0.0002307345,0.00013688662,0.00037167594,0.009026572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986064,0.00048277262,0.00007666575,0.00022498572,0.00042251623,0.00018668434],"domain_scores_gemma":[0.99016553,0.006696102,0.00096775184,0.0006757021,0.0011826719,0.00031214798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036395488,0.00095052534,0.0008444183,0.0011271681,0.00063664856,0.0012276272,0.0013133454,0.00095369894,0.0029573124],"category_scores_gemma":[0.016910797,0.0004654659,0.00081399194,0.000665834,0.0021373173,0.00226202,0.0016897484,0.002043007,0.0005323513],"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.00012941552,0.00003242242,0.001209268,0.00010991714,0.000048376944,0.00012353274,0.00016061464,0.7872075,0.0033757724,0.19771148,0.001118108,0.0087736165],"study_design_scores_gemma":[0.000003704062,0.000009209405,0.00008921709,0.000005124662,0.0000033126582,0.000006162393,0.000005336627,0.9785751,0.00029716123,0.020781577,0.00022015354,0.000003963735],"about_ca_topic_score_codex":0.0029457859,"about_ca_topic_score_gemma":0.0016552655,"teacher_disagreement_score":0.0036395488,"about_ca_system_score_codex":0.0015696334,"about_ca_system_score_gemma":0.0011887426,"threshold_uncertainty_score":0.019248009},"labels":[],"label_agreement":null},{"id":"W4293795333","doi":"10.1109/tsipn.2022.3202035","title":"Kernel Regression for Matrix-Variate Gaussian Distributed Signals Over Sample Graphs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Face and Expression Recognition","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 Windsor","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kernel regression; Hyperparameter; Kernel (algebra); Mathematics; Graph kernel; Polynomial kernel; Kernel method; Kernel embedding of distributions; Covariance matrix; Variable kernel density estimation; Artificial intelligence; Pattern recognition (psychology); Estimation of covariance matrices; Covariance; Regression; Algorithm; Computer science; Statistics; Support vector machine; Combinatorics","score_opus":0.01188241520242316,"score_gpt":0.24654624668990757,"score_spread":0.2346638314874844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293795333","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.0019036924,0.00014682744,0.9973348,0.000053989774,0.00001124655,0.000011193572,0.000025968044,0.0003286993,0.0001835984],"genre_scores_gemma":[0.35503465,0.0015126432,0.6363197,0.00025736864,0.00014373417,0.00019897024,0.0008292483,0.0006826335,0.005021035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987381,0.0005391567,0.000047607853,0.00034214297,0.00024223028,0.00009070365],"domain_scores_gemma":[0.9970884,0.0016910818,0.00028846422,0.00045126854,0.00041413278,0.00006675543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139003,0.0013735507,0.0011863105,0.0011312206,0.00036395492,0.00116195,0.001748077,0.0012001507,0.0019357107],"category_scores_gemma":[0.009443945,0.0005485684,0.0010340377,0.0018116883,0.0012378267,0.0021554274,0.0012429791,0.002326764,0.0012543555],"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.00010185859,0.00005484702,0.0010875852,0.0001386305,0.00010127924,0.00008970842,0.00008161722,0.7943211,0.0045318045,0.040129237,0.002977788,0.1563844],"study_design_scores_gemma":[0.0000028839258,0.000008455588,0.00011738376,0.0000039925903,0.00000397317,0.000015683185,0.0000051655006,0.99110126,0.0005054271,0.0076811938,0.00054906064,0.000005620295],"about_ca_topic_score_codex":0.005321549,"about_ca_topic_score_gemma":0.004399319,"teacher_disagreement_score":0.005321549,"about_ca_system_score_codex":0.0010437752,"about_ca_system_score_gemma":0.00095754024,"threshold_uncertainty_score":0.011312246},"labels":[],"label_agreement":null},{"id":"W4362681493","doi":"10.1109/tsipn.2023.3264992","title":"Fault Estimation and Fault-Tolerant Tracking Control for Multi-Agent Systems With Lipschitz Nonlinearities Using Double Periodic Event-Triggered Mechanism","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Lipschitz continuity; Observer (physics); Weighting; Computer science; Controller (irrigation); Nonlinear system; Linear matrix inequality; Fault tolerance; Mathematics; Control (management); Mathematical optimization; Distributed computing; Artificial intelligence","score_opus":0.028352130626289395,"score_gpt":0.26372716779618194,"score_spread":0.23537503716989255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362681493","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.034414724,0.00018447255,0.9641538,0.000088248016,0.000028551607,0.0000282484,0.000012805971,0.000102667684,0.0009864914],"genre_scores_gemma":[0.979732,0.00015569085,0.019151824,0.000026962649,0.000014839578,0.00004924517,0.00002184033,0.000005557841,0.0008421064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967396,0.00006367367,0.000026166086,0.00010158483,0.000089051224,0.00004551364],"domain_scores_gemma":[0.9995617,0.00017836521,0.00012720177,0.000036224097,0.00007652219,0.000019887177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629521,0.00056266994,0.00055161095,0.00022803961,0.00035137596,0.0006480437,0.0006880872,0.0006635098,0.0005638201],"category_scores_gemma":[0.0012650815,0.00019082992,0.0004378619,0.0002695614,0.00046583256,0.0007676961,0.0006519271,0.00054009474,0.00006247669],"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.00015558158,0.000042490297,0.0008849782,0.0001816222,0.00004688813,0.00037288852,0.00023547429,0.91960335,0.015738873,0.016836891,0.00035826326,0.04554259],"study_design_scores_gemma":[0.000007503412,0.00005141965,0.00012401493,0.0000032750543,0.000005994177,0.000021384976,0.000010147701,0.9972887,0.0010431637,0.0012855374,0.00015453894,0.0000043400914],"about_ca_topic_score_codex":0.0029201978,"about_ca_topic_score_gemma":0.0013950599,"teacher_disagreement_score":0.0029201978,"about_ca_system_score_codex":0.00045582853,"about_ca_system_score_gemma":0.0006352136,"threshold_uncertainty_score":0.005806446},"labels":[],"label_agreement":null},{"id":"W4388018849","doi":"10.1109/tsipn.2023.3328275","title":"Topology Recoverability Prediction for Ad-Hoc Robot Networks: A Data-Driven Fault-Tolerant Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":3,"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; Network topology; Topology (electrical circuits); Distributed computing; Wireless ad hoc network; Logical topology; Fault tolerance; Robot; Artificial intelligence; Computer network; Engineering","score_opus":0.019666141696358812,"score_gpt":0.23483093906300853,"score_spread":0.21516479736664973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388018849","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.046833806,0.00027131653,0.9510113,0.00047997077,0.00003040907,0.000040099723,0.00011219025,0.00030633094,0.00091448164],"genre_scores_gemma":[0.9607695,0.00023987722,0.03707752,0.00007736699,0.000050435065,0.00008461327,0.00020297457,0.000048654325,0.0014492057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958843,0.00010020574,0.000021736523,0.00011209012,0.00011670544,0.000060984145],"domain_scores_gemma":[0.9974458,0.0015469638,0.00039236882,0.0001630589,0.00033708927,0.000114711926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273518,0.0007651581,0.001052555,0.0009503691,0.00039625796,0.0009515233,0.0019914326,0.0011506298,0.0009626985],"category_scores_gemma":[0.004451168,0.00049420126,0.0006779262,0.0007606061,0.0008058199,0.0015154551,0.0007912695,0.0012883365,0.00020291671],"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.00001942049,0.000015303587,0.00037423513,0.000010553059,0.000008806938,0.000014242452,0.0000119610895,0.99123645,0.00023972242,0.0018475134,0.00009597391,0.0061259037],"study_design_scores_gemma":[7.5936043e-7,0.000004432803,0.000042591222,9.600662e-7,0.0000015094932,0.000002758384,0.000001931106,0.9984654,0.00006788076,0.0013886683,0.000021747599,0.0000013796952],"about_ca_topic_score_codex":0.005873084,"about_ca_topic_score_gemma":0.0042963964,"teacher_disagreement_score":0.005873084,"about_ca_system_score_codex":0.0012072737,"about_ca_system_score_gemma":0.00086817413,"threshold_uncertainty_score":0.011677802},"labels":[],"label_agreement":null},{"id":"W4393140105","doi":"10.1109/tsipn.2024.3380351","title":"Bipartite Graph Approximation by Eigenvalue Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Graph Theory and Algorithms","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 Windsor","funders":"","keywords":"Bipartite graph; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Quantum mechanics","score_opus":0.005653637728516566,"score_gpt":0.20403156469187209,"score_spread":0.19837792696335552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393140105","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.0021687765,0.00004906563,0.996705,0.00008012522,0.000016959975,0.00001552439,0.000030387866,0.00013477547,0.0007993884],"genre_scores_gemma":[0.19574451,0.00039483004,0.7968519,0.00026539416,0.00009144946,0.00026629394,0.00057430635,0.0003340732,0.0054773083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00031780894,0.000023374423,0.00016386603,0.00017362622,0.0000668245],"domain_scores_gemma":[0.9986418,0.000847221,0.00012033046,0.00015214503,0.00017363632,0.00006477427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620871,0.0013317575,0.0010417402,0.0012024993,0.00051133445,0.001026745,0.0010416127,0.0012800369,0.0036095094],"category_scores_gemma":[0.004152608,0.0006479893,0.0008955409,0.0013976396,0.0009862582,0.0016739953,0.0012436351,0.0016917413,0.0012967434],"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.00010495515,0.00008227942,0.0005287398,0.0001451787,0.000074149735,0.00012410192,0.0001019109,0.82969534,0.0051086145,0.06857528,0.007220619,0.088238835],"study_design_scores_gemma":[0.0000061306896,0.000009804983,0.000044005286,0.0000041480266,0.0000033505805,0.000015937478,0.000011898056,0.98071414,0.0003098612,0.018160101,0.00071660883,0.000003990404],"about_ca_topic_score_codex":0.0033382361,"about_ca_topic_score_gemma":0.004073771,"teacher_disagreement_score":0.0036095094,"about_ca_system_score_codex":0.00083416846,"about_ca_system_score_gemma":0.0011139362,"threshold_uncertainty_score":0.012075007},"labels":[],"label_agreement":null},{"id":"W4412375049","doi":"10.1109/tsipn.2025.3587399","title":"An ADMM-Based Approach to Quadratically-Regularized Distributed Optimal Transport on Graphs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadratic growth; Computer science; Mathematics; Regularization (linguistics); Mathematical optimization; Econometrics; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.008588321185572597,"score_gpt":0.2394253606992774,"score_spread":0.2308370395137048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375049","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.0020837062,0.00005533659,0.9967326,0.00014720694,0.000024119774,0.000012477496,0.000016321657,0.00009467521,0.0008337273],"genre_scores_gemma":[0.3074977,0.00028941472,0.68377715,0.0002920785,0.00014138076,0.00019647053,0.0002564405,0.00022668118,0.0073226886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00017638813,0.000025172358,0.00012395138,0.00013330269,0.00004491855],"domain_scores_gemma":[0.9989675,0.00052770984,0.0001140962,0.00011552163,0.00022151034,0.000053677075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013669254,0.0010129658,0.0011108138,0.0006151874,0.0005192514,0.0009935015,0.0016266451,0.0016963701,0.001882589],"category_scores_gemma":[0.0030292792,0.00058327377,0.0007996758,0.0010247007,0.0011647624,0.0014278338,0.0013218378,0.002333771,0.00042208238],"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.000020664706,0.000016106633,0.00007825808,0.00003290877,0.000014780476,0.000031616804,0.000023130002,0.96834666,0.0008319419,0.0155619215,0.0009990212,0.014042945],"study_design_scores_gemma":[0.0000032401044,0.0000073092187,0.000007935747,0.0000017689491,0.0000014461802,0.0000065782506,0.0000023265131,0.99582976,0.00012598626,0.0037198998,0.0002921005,0.0000016499415],"about_ca_topic_score_codex":0.0041947677,"about_ca_topic_score_gemma":0.003791423,"teacher_disagreement_score":0.0041947677,"about_ca_system_score_codex":0.0011390331,"about_ca_system_score_gemma":0.0017676945,"threshold_uncertainty_score":0.008340716},"labels":[],"label_agreement":null},{"id":"W4413267486","doi":"10.1109/tsipn.2025.3592314","title":"Resilient Output Containment of Heterogeneous Multi-Agent Systems Against Byzantine Attacks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Advanced Memory and Neural Computing","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Containment (computer programming); Byzantine architecture; Computer science; Byzantine fault tolerance; Computer security; Distributed computing; History; Fault tolerance; Ancient history","score_opus":0.010443576903315516,"score_gpt":0.23012889435113262,"score_spread":0.2196853174478171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413267486","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.04132533,0.00011184211,0.95724064,0.000087830085,0.000017347762,0.000026730166,0.00001491049,0.00022319892,0.0009520956],"genre_scores_gemma":[0.96549183,0.00010074887,0.033669546,0.000028970024,0.000020705404,0.000037554946,0.000027786753,0.000023743685,0.00059906644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985781,0.0003815199,0.00008511935,0.00036157042,0.00042338352,0.00017024753],"domain_scores_gemma":[0.99689084,0.0012740173,0.0007808371,0.0005532654,0.0003803123,0.00012076189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014266506,0.0007620419,0.0008307473,0.00053842115,0.00059100636,0.0015763651,0.0012088594,0.0007511496,0.00075643504],"category_scores_gemma":[0.0072344453,0.00025381616,0.00051360286,0.0003978839,0.0012827807,0.0020392917,0.0023141846,0.0009616096,0.00018764743],"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.00030024588,0.000042735937,0.0018932788,0.00014181239,0.0000965775,0.0003078254,0.00031360393,0.85871786,0.021503367,0.06649048,0.0004569065,0.049735244],"study_design_scores_gemma":[0.000007765469,0.000043287364,0.00013860756,0.000004868259,0.000012814112,0.00003592528,0.000022191703,0.9879347,0.004974658,0.0064235325,0.0003961564,0.0000055169494],"about_ca_topic_score_codex":0.0009718636,"about_ca_topic_score_gemma":0.00044643387,"teacher_disagreement_score":0.0015763651,"about_ca_system_score_codex":0.0007463383,"about_ca_system_score_gemma":0.0006458311,"threshold_uncertainty_score":0.0075449347},"labels":[],"label_agreement":null}]}