{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":25,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":25,"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"},"query_hash":"d662d0b8c9b5","filters":{"venue":"IEEE Transactions on Signal and Information Processing over Networks"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01856112215833846,"gpt":0.2494712361959399,"spread":0.2309101140376014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005730577,0.0002765759,0.0002926801,0.0006055509,0.0007760228,0.0009268461,0.003431917,0.0002172173,0.00005944137],"category_scores_gemma":[0.0001958245,0.0002555363,0.0000670751,0.001666977,0.0002816194,0.004856249,0.0007286608,0.0004264002,0.0000118882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005597345,"about_ca_system_score_gemma":0.00007755283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002890479,"about_ca_topic_score_gemma":0.00000257061,"domain_scores_codex":[0.9981782,0.00008815153,0.0005252548,0.0004153578,0.0003826152,0.0004103586],"domain_scores_gemma":[0.9974393,0.0002383183,0.0002731536,0.001686378,0.0002262223,0.0001366216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005235729,0.00005443519,0.00007680118,0.00005306238,0.0002369493,0.000003524346,0.0008821824,0.01405831,0.00004992442,0.00006925415,0.005467077,0.9789961],"study_design_scores_gemma":[0.0004140174,0.0001404087,0.0004664444,0.00007789217,0.00008808584,0.00002255143,0.0000304189,0.9907802,0.002375664,0.004349769,0.000948854,0.0003056329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002196248,0.0001255159,0.9951835,0.001276707,0.0001785727,0.0002351278,0.00001408039,0.00055629,0.0002339372],"genre_scores_gemma":[0.6986991,0.0001479276,0.3004067,0.0006378688,0.00004373759,0.00002406736,0.000006522849,0.000009376675,0.00002470661],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9786905,"threshold_uncertainty_score":0.9999897,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02384976851742021,"gpt":0.2646856349714733,"spread":0.2408358664540531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002719185,0.0001653882,0.000184369,0.00005869599,0.0007469707,0.0004443363,0.0002376726,0.0001308507,0.0000154819],"category_scores_gemma":[0.00001837078,0.0001432143,0.00002908881,0.00006633027,0.0001026911,0.002303492,0.000004645426,0.0003728348,0.000004565336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002984203,"about_ca_system_score_gemma":0.00002485948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001927987,"about_ca_topic_score_gemma":0.0000345045,"domain_scores_codex":[0.9991723,0.00001376709,0.0002761763,0.0001814588,0.0001395046,0.0002167501],"domain_scores_gemma":[0.9992834,0.000114917,0.00007384476,0.0003353421,0.00005658463,0.0001359671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00120906,0.0001414915,0.0006247163,0.0007143517,0.0001177852,0.00000112628,0.001007511,0.7186629,0.00004790545,0.0001749559,0.008954023,0.2683442],"study_design_scores_gemma":[0.0009250295,0.0001219341,0.005584709,0.0001784298,0.00003561872,0.000004237041,0.00003413509,0.9806641,0.0002888855,0.00005641648,0.01188395,0.0002225548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680687,0.00007180913,0.9708453,0.0002904304,0.0005404598,0.0004331837,0.0007217304,0.0001077894,0.0001824631],"genre_scores_gemma":[0.9991823,0.00007550115,0.0001288937,0.000363592,0.0001057695,0.00005841747,0.00007005299,0.000007878183,0.000007567408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9723755,"threshold_uncertainty_score":0.584011,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005440251682449057,"gpt":0.2095002343177927,"spread":0.2040599826353436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003998238,0.0002222753,0.0001934607,0.0001328909,0.0005892513,0.0007841656,0.0002291103,0.000117776,0.00002308509],"category_scores_gemma":[0.000005418763,0.0002015461,0.0000524792,0.0003653057,0.00005344359,0.003969786,0.00001193113,0.0004202684,0.000005925065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005976028,"about_ca_system_score_gemma":0.00004409337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003763493,"about_ca_topic_score_gemma":0.000003033257,"domain_scores_codex":[0.9985992,0.00005218022,0.0004689873,0.0002950677,0.0003020293,0.0002825822],"domain_scores_gemma":[0.9992241,0.0001393822,0.0002202609,0.0001839757,0.0001329244,0.00009933711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000071077,0.0001318183,0.00007000973,0.0001669738,0.00003692786,4.312973e-7,0.00447476,0.3807893,0.001131899,0.000738066,0.0003018801,0.6120868],"study_design_scores_gemma":[0.0004300033,0.0001040721,0.00002959301,0.0002533905,0.00001699364,0.000006625122,0.0003101515,0.9973601,0.0008814512,0.00009321112,0.0002685201,0.0002458922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1218364,0.0003241125,0.8769115,0.0001626407,0.0002668902,0.0002165248,0.000001277567,0.0001277173,0.0001529082],"genre_scores_gemma":[0.9981004,0.000147578,0.00084258,0.0007834921,0.00003760028,0.00003419517,0.00001145407,0.000007981409,0.00003472338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.876264,"threshold_uncertainty_score":0.8218811,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0283521306262894,"gpt":0.2637271677961819,"spread":0.2353750371698926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004717224,0.0002945899,0.0003565506,0.0002991038,0.0009229835,0.001525458,0.0001859288,0.0001617295,0.000002040433],"category_scores_gemma":[0.00000387361,0.0002519655,0.00007057806,0.0004863856,0.0000559305,0.00436662,0.000004431985,0.0002266412,0.000004114551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000846597,"about_ca_system_score_gemma":0.0001181642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006160775,"about_ca_topic_score_gemma":0.000007323958,"domain_scores_codex":[0.9981837,0.00005351323,0.0006537105,0.0003060659,0.0003977364,0.0004052212],"domain_scores_gemma":[0.9989358,0.00009753396,0.0003669899,0.0001693547,0.0002906426,0.000139638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001929626,0.0000421601,0.000008141631,0.0002746059,0.00006277749,0.000001667656,0.001118419,0.9500538,0.0001372934,0.0003857763,0.00001179902,0.04771065],"study_design_scores_gemma":[0.004992874,0.0001480519,0.0000613607,0.0004793652,0.0000722624,0.00003393953,0.0004217013,0.9930649,0.0002738443,0.00002497973,0.0001172127,0.0003095479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01623889,0.0001767636,0.981505,0.00007460669,0.0004626017,0.001123679,0.00007203288,0.0003381735,0.000008227413],"genre_scores_gemma":[0.9939081,0.00002635964,0.005506319,0.0001570903,0.00005907278,0.0002426745,0.00003788548,0.00001831845,0.00004415913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9776692,"threshold_uncertainty_score":0.9999933,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02555785152027925,"gpt":0.2441147674933145,"spread":0.2185569159730352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298835,0.0002204407,0.0001852565,0.0001525225,0.0004103848,0.0003988108,0.0002689603,0.0001670972,0.000007537426],"category_scores_gemma":[0.00001125565,0.0001981456,0.00005254372,0.0004958795,0.00006889892,0.006099224,0.000008056587,0.0003842722,0.00002476635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006273108,"about_ca_system_score_gemma":0.0001155735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001556469,"about_ca_topic_score_gemma":0.000002602286,"domain_scores_codex":[0.9985618,0.00004143322,0.0004617656,0.000241479,0.0004061112,0.0002874162],"domain_scores_gemma":[0.998943,0.0001037727,0.0002100385,0.000225421,0.0002870285,0.0002306907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007512155,0.00003372173,0.000007045215,0.000008734382,0.000008134604,6.293679e-7,0.0004123596,0.8290372,0.000002059848,0.0003956991,0.001031087,0.1689882],"study_design_scores_gemma":[0.0007698523,0.0001130766,0.00005044015,0.00008355853,0.00001518201,0.00001444795,0.0000557985,0.9970211,0.0001711238,0.0005012715,0.0009575476,0.0002465622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009626327,0.00006648374,0.9976004,0.000144643,0.0003407757,0.0001617853,0.00004015319,0.0003562291,0.0003268617],"genre_scores_gemma":[0.946519,0.00003076522,0.05248886,0.0007806658,0.0000518499,0.00002361345,0.00006378834,0.000009109816,0.00003238206],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9455563,"threshold_uncertainty_score":0.8080144,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0223292163812453,"gpt":0.2226277071439567,"spread":0.2002984907627114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933145,0.0001850642,0.000257094,0.0001265045,0.0002466054,0.0001156861,0.0001202922,0.0002888108,0.00002069455],"category_scores_gemma":[0.000006735294,0.000196195,0.00004357194,0.0008713114,0.00005728759,0.002335525,0.000007842554,0.0007213072,0.000001708712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007749529,"about_ca_system_score_gemma":0.00004628951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003649556,"about_ca_topic_score_gemma":0.00006482488,"domain_scores_codex":[0.9986616,0.00006502943,0.0005558506,0.0001964449,0.0002237738,0.0002972819],"domain_scores_gemma":[0.9994137,0.0001050912,0.0001285954,0.000185284,0.00008646618,0.00008091669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008400113,0.00002885184,0.0002841433,0.00005538689,0.00001770121,0.000001759255,0.0001853954,0.8622776,0.0000837936,0.00000438716,0.00005593798,0.136921],"study_design_scores_gemma":[0.0005750616,0.000048582,0.0007156221,0.0002648805,0.0000275396,0.00002893853,0.0003212298,0.995403,0.002034392,0.000008700673,0.0003642621,0.000207813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1603533,0.0002333056,0.838258,0.00001042283,0.0007875777,0.0001183593,0.00001039147,0.0001054938,0.0001231422],"genre_scores_gemma":[0.9990658,0.0003256441,0.0001538123,0.00008134159,0.000305524,0.00001097965,0.00003857677,0.00001326785,0.000005079209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8387125,"threshold_uncertainty_score":0.8000602,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02035869306984733,"gpt":0.2360437830662466,"spread":0.2156850899963993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003804661,0.0001580061,0.0001587772,0.0001261401,0.0001575492,0.0004534195,0.0002003475,0.000104324,0.000008225617],"category_scores_gemma":[0.000009254912,0.0001435653,0.00003434928,0.0006391248,0.00004255811,0.004342247,0.000002533216,0.0002170427,0.00001901817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001268132,"about_ca_system_score_gemma":0.0001378166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003098091,"about_ca_topic_score_gemma":0.000008627295,"domain_scores_codex":[0.9986889,0.00007078434,0.0004579021,0.0001795217,0.0003306363,0.0002721911],"domain_scores_gemma":[0.9992566,0.0000466757,0.0002311777,0.0001623888,0.0001428044,0.0001603637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001031458,0.00009629899,0.000128285,0.00003548212,0.000008903503,0.000001933029,0.000635604,0.8760334,0.00003870653,0.0002509141,0.0002436639,0.1224237],"study_design_scores_gemma":[0.001638247,0.00009537951,0.0007345038,0.00008883803,0.00000797508,0.00000376904,0.00009972952,0.9953117,0.0007901966,0.00003426567,0.001019861,0.0001755865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009369696,0.00004799565,0.9894074,0.0003393513,0.0002367959,0.0002797844,0.00002039256,0.0001684057,0.0001301863],"genre_scores_gemma":[0.9987112,0.000002794965,0.0005961422,0.0005365962,0.00002081872,0.00007879195,0.00003749399,0.000005210744,0.00001096322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9893415,"threshold_uncertainty_score":0.5854421,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.008885015688578418,"gpt":0.2240665093562346,"spread":0.2151814936676562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113452,0.0001685125,0.0001559227,0.00009598421,0.0003319178,0.0002662489,0.0002126234,0.00009336605,0.00002059816],"category_scores_gemma":[0.000001326028,0.0001461887,0.00007973175,0.0004834339,0.00004728797,0.003691476,0.000003111101,0.0002028969,0.000007341448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002304809,"about_ca_system_score_gemma":0.00002827065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001746743,"about_ca_topic_score_gemma":6.259377e-7,"domain_scores_codex":[0.9989586,0.00002370006,0.0003158638,0.0002064906,0.0002059146,0.0002894564],"domain_scores_gemma":[0.9993017,0.0001390901,0.0001605246,0.0001866957,0.0001056051,0.0001063297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001099556,0.00003264048,0.00004021014,0.00004246818,0.000007542548,1.702908e-7,0.00007105571,0.8361898,0.00009665215,0.0003952567,0.0002232624,0.162791],"study_design_scores_gemma":[0.001048036,0.0001778273,0.0002751641,0.0001073814,0.00000951337,0.000002295428,0.0000136443,0.9929901,0.003323312,0.0004179085,0.001437495,0.0001972853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008232418,0.00005226903,0.9905754,0.000188419,0.0003202716,0.0003658969,0.00001686514,0.0001980493,0.00005045866],"genre_scores_gemma":[0.9930407,0.00001394969,0.005385843,0.001427255,0.00002002205,0.0000603643,0.00002289283,0.000007508521,0.00002148775],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9851895,"threshold_uncertainty_score":0.5961402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01969318640665122,"gpt":0.2300917326534443,"spread":0.2103985462467931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008343239,0.0003222413,0.0003395031,0.0003001428,0.0004737293,0.0007294306,0.0002876669,0.0001828224,0.00001478613],"category_scores_gemma":[0.000003008891,0.0002758932,0.0000560241,0.000817881,0.0001039376,0.004858059,0.00001032805,0.0005515724,0.000006579067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009557322,"about_ca_system_score_gemma":0.0002841932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002964223,"about_ca_topic_score_gemma":0.00001031484,"domain_scores_codex":[0.9979629,0.00008288309,0.0007246455,0.0003209958,0.0003889431,0.0005196584],"domain_scores_gemma":[0.9986895,0.0001664658,0.000309348,0.0002333056,0.0002434884,0.0003578882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074006,0.00004002111,0.00004121828,0.00001868784,0.00001623807,0.00001547965,0.0005830392,0.8392237,5.572438e-7,0.0003535677,0.0001560869,0.159444],"study_design_scores_gemma":[0.001160517,0.0002011627,0.00005855543,0.0003436646,0.0000350217,0.00009553668,0.0001762601,0.9969941,0.000008252633,0.00009945389,0.0004563648,0.0003710948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002661478,0.0001151516,0.9938059,0.0001594076,0.0003047219,0.0002730157,0.000004695144,0.0001977481,0.0024779],"genre_scores_gemma":[0.9810717,0.00005595401,0.01771513,0.0009234065,0.00007330621,0.00005978013,0.00002216014,0.00001682931,0.00006175225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9784102,"threshold_uncertainty_score":0.9999693,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004232839715764947,"gpt":0.2011898318876006,"spread":0.1969569921718357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516279,0.000187387,0.0001862981,0.000113586,0.0001058493,0.000129927,0.00006113841,0.0002223065,0.0002132564],"category_scores_gemma":[0.000002134638,0.0001950348,0.00004426464,0.0003398027,0.00003544503,0.002400125,8.899783e-7,0.0003656248,0.00003012594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001571907,"about_ca_system_score_gemma":0.00001955593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000135022,"about_ca_topic_score_gemma":0.0000105512,"domain_scores_codex":[0.9989616,0.00002726494,0.000449021,0.0001335124,0.0001277761,0.0003008246],"domain_scores_gemma":[0.9996503,0.00004201998,0.00007594568,0.00009255836,0.00006193374,0.00007723486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001211728,0.00002526335,0.0001165658,0.00004115858,0.000009840714,3.812583e-7,0.00009140408,0.8920787,0.00006746576,0.00006856111,0.0001557806,0.1072237],"study_design_scores_gemma":[0.001173803,0.00009649128,0.001423476,0.00008785869,0.00001372347,0.000006840224,0.0000519283,0.994725,0.0007184093,0.00001989246,0.001466368,0.0002162385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.108019,0.0001197887,0.8903506,0.00002950098,0.0005402038,0.0002868326,0.00003325454,0.0001732221,0.0004475899],"genre_scores_gemma":[0.9990969,0.0002654064,0.0001120541,0.0001390356,0.00002973543,0.00003432648,0.0002947928,0.00001166784,0.00001612362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8910779,"threshold_uncertainty_score":0.7953289,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01742357710796446,"gpt":0.2555449752609674,"spread":0.2381213981530029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003899822,0.000185099,0.0001888329,0.0001936904,0.0006609713,0.0004920932,0.0003164247,0.0001337446,0.00002323977],"category_scores_gemma":[0.000003640613,0.0001757506,0.00005152328,0.0006268391,0.0001417485,0.001801486,0.000009094114,0.0003014029,0.000003445824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005953808,"about_ca_system_score_gemma":0.00008393529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006398237,"about_ca_topic_score_gemma":0.00004592496,"domain_scores_codex":[0.9988289,0.00005427361,0.0004624279,0.0002091718,0.0001288524,0.0003164112],"domain_scores_gemma":[0.9990856,0.0001457981,0.0001658471,0.0002397702,0.0002707095,0.00009226473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001329077,0.00005326694,0.00001847066,0.00002436482,0.00001538326,2.506899e-7,0.0008210415,0.02666088,0.00007032695,0.002935848,0.0004342061,0.968833],"study_design_scores_gemma":[0.0009061826,0.0002108441,0.0001680902,0.0001082365,0.000007039846,0.000006734886,0.00003495413,0.9953809,0.000400748,0.0001146563,0.002440474,0.0002210809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003796464,0.0001162932,0.9943081,0.0003109602,0.0003648839,0.0003160006,0.000002635184,0.0001250185,0.0006596781],"genre_scores_gemma":[0.9946827,0.0002581824,0.003034264,0.001742809,0.00009839137,0.00008681555,0.000005984107,0.000008887079,0.00008200842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9912738,"threshold_uncertainty_score":0.7166902,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005488378737622835,"gpt":0.1856735397979772,"spread":0.1801851610603543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002507752,0.0003386283,0.0002700654,0.0001671032,0.0004800993,0.0003745086,0.00009330297,0.0001632692,0.00003228895],"category_scores_gemma":[0.000007743434,0.0002627157,0.00004848366,0.000186548,0.0002149536,0.002627883,0.000002938858,0.0002174001,0.000002000932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001178766,"about_ca_system_score_gemma":0.00005361969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008599597,"about_ca_topic_score_gemma":0.000004221386,"domain_scores_codex":[0.9985188,0.00002669421,0.0005392932,0.0002459926,0.0002402521,0.0004289136],"domain_scores_gemma":[0.9990644,0.0002406208,0.0001888267,0.0001336502,0.0002110288,0.0001614467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000182789,0.00002254622,0.00005135781,0.0002126805,0.0001070131,0.000002397225,0.0003284613,0.8960521,0.0002668067,0.001462916,0.0002237273,0.1010873],"study_design_scores_gemma":[0.001757357,0.0002697923,0.0002620086,0.00201211,0.0000632771,0.0001924922,0.0002754323,0.9895201,0.002401351,0.0000174806,0.002564199,0.0006644269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04156077,0.0001250443,0.9554066,0.00003238344,0.0004130051,0.0001891887,0.00003250601,0.0004657141,0.001774785],"genre_scores_gemma":[0.9954873,0.00003618228,0.003979288,0.0001684509,0.00007964693,0.0001005841,0.00001655128,0.00005093328,0.00008100204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9539266,"threshold_uncertainty_score":0.9999825,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01459808011486554,"gpt":0.2475735488079315,"spread":0.232975468693066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001685471,0.00009778058,0.0001888643,0.00009726635,0.0001428471,0.00004439017,0.00004361258,0.00004042793,0.0001010552],"category_scores_gemma":[0.000001462765,0.00007086173,0.00006645816,0.0001203011,0.0001296282,0.001303421,0.000002488638,0.0001082004,5.485255e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001234735,"about_ca_system_score_gemma":0.00001496999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007116249,"about_ca_topic_score_gemma":0.000003037008,"domain_scores_codex":[0.9993638,0.0000408978,0.000356932,0.00005378055,0.0001007717,0.00008381703],"domain_scores_gemma":[0.9993416,0.0001195055,0.0003025875,0.00006000118,0.000146813,0.00002948984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001260695,0.0001085481,0.000342231,0.0002161995,0.0003936529,3.503964e-8,0.004975633,0.01422,0.00139405,0.00714266,0.000007539061,0.9710734],"study_design_scores_gemma":[0.002667339,0.0006373363,0.002913407,0.001377072,0.000989559,0.000005802915,0.00619185,0.9440631,0.02752411,0.0121272,0.0008112719,0.0006920102],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1778752,0.00005090353,0.821538,0.0000606844,0.00006385402,0.00009089692,0.00002005444,0.00001038281,0.000290012],"genre_scores_gemma":[0.9997635,0.00006731174,0.0000540495,0.00005340265,0.00001536548,0.00001971199,0.000003085327,0.000004674506,0.00001884356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9703814,"threshold_uncertainty_score":0.2889658,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006292620326268501,"gpt":0.2089693430641436,"spread":0.2026767227378751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002572759,0.0001245405,0.0001528323,0.0008033902,0.0004499645,0.0002332657,0.000228615,0.00004839271,0.0001459676],"category_scores_gemma":[0.000001534091,0.0001332139,0.00004999406,0.002322126,0.00002909328,0.002929795,0.000008523834,0.0002356398,8.916627e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001225348,"about_ca_system_score_gemma":0.00005939771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001668863,"about_ca_topic_score_gemma":0.000002294612,"domain_scores_codex":[0.9989163,0.00005237364,0.0003631951,0.0001830297,0.0003064524,0.0001787076],"domain_scores_gemma":[0.9995197,0.00004412867,0.0001648103,0.0001461891,0.00007294868,0.00005221355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001704684,0.00004509915,0.00003967316,0.000007663936,0.00001900279,5.019193e-7,0.0004827669,0.9424758,7.252568e-7,0.0005160912,0.00001334174,0.05638228],"study_design_scores_gemma":[0.0002899408,0.00008883499,0.000205978,0.0000109593,0.00002968761,0.000005657032,0.00006311771,0.9989271,0.00005799924,0.0001073816,0.0000615028,0.000151865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005462384,0.00004346913,0.9985297,0.00006783137,0.0001233031,0.0001750113,0.000007390247,0.0001913343,0.0003156978],"genre_scores_gemma":[0.9779376,0.00002811181,0.02135834,0.0005024913,0.000007131009,0.0001247566,0.00001803067,0.000005220473,0.00001828917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9773914,"threshold_uncertainty_score":0.5432307,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008005984302644301,"gpt":0.2053340255659251,"spread":0.1973280412632809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002956004,0.0005055034,0.0004433026,0.000295581,0.0005596921,0.00109508,0.0003252627,0.0003404661,0.00001117297],"category_scores_gemma":[0.000007040942,0.0003948309,0.00007181247,0.0004455297,0.0001202713,0.001757627,0.00003130379,0.0006462157,0.000001933008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002155062,"about_ca_system_score_gemma":0.0001629576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001009898,"about_ca_topic_score_gemma":0.000001450138,"domain_scores_codex":[0.9975474,0.00008381724,0.0008013055,0.0005609301,0.0005669522,0.0004396314],"domain_scores_gemma":[0.9982403,0.0000965502,0.0006829981,0.0003639005,0.0003950179,0.0002212534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001173937,0.000089205,0.000008660837,0.0001881502,0.00007337642,0.000001268549,0.0002261046,0.9676604,0.000004320001,0.00008083671,0.00003404082,0.03151627],"study_design_scores_gemma":[0.001612716,0.0001068824,0.0002214027,0.001261268,0.0001030175,0.00003317621,0.0000426083,0.9960587,0.00002542561,0.00005104154,0.00004942291,0.0004343339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001353786,0.0001378207,0.9948248,0.0002192767,0.0005007527,0.0008157638,0.001630914,0.0004834129,0.0000334267],"genre_scores_gemma":[0.9958118,0.00004164355,0.002798375,0.0001238965,0.00008848483,0.000154183,0.0009489254,0.00002133865,0.00001142093],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.994458,"threshold_uncertainty_score":0.9999419,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03512865163136489,"gpt":0.2434382012388541,"spread":0.2083095496074892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002568545,0.0001873318,0.0001739143,0.0001799202,0.0004520731,0.0003793939,0.0003088348,0.0001731802,0.000006676034],"category_scores_gemma":[0.000004339194,0.0001561344,0.00005834555,0.0002759523,0.00004674834,0.00406061,0.000004849114,0.0002715804,0.00001082094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005319884,"about_ca_system_score_gemma":0.00008357666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001246806,"about_ca_topic_score_gemma":5.481697e-7,"domain_scores_codex":[0.9988031,0.00002350301,0.00039611,0.0002308945,0.0002965297,0.0002498535],"domain_scores_gemma":[0.99916,0.00006072163,0.0001720206,0.0001865844,0.0002863462,0.0001343218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009425331,0.0000295534,0.000001423391,0.0000401414,0.000005938409,1.414095e-7,0.0003206427,0.4728548,0.00003659355,0.0004663788,0.0003945432,0.5257556],"study_design_scores_gemma":[0.0006379042,0.0001907275,0.000004628705,0.0001740392,0.00001221495,0.000004544468,0.00004305713,0.9805727,0.002801404,0.00168899,0.01365666,0.0002131418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007058052,0.0001833006,0.9972478,0.0001610472,0.0002787097,0.0002250344,0.00000403224,0.0004976089,0.0006966394],"genre_scores_gemma":[0.9769328,0.0001116022,0.02226682,0.0003527055,0.00003408918,0.0001011406,0.000007622047,0.000007999519,0.0001852429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976227,"threshold_uncertainty_score":0.6366975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.004607394109169381,"gpt":0.2183679451030099,"spread":0.2137605509938405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004076726,0.0005330311,0.0006121132,0.0002418611,0.0005062956,0.000764898,0.0002138945,0.001111206,0.000004523071],"category_scores_gemma":[0.00001526637,0.0005045858,0.00009489013,0.0004482983,0.0002053865,0.002568106,0.000006614955,0.001420469,0.000002812613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001636886,"about_ca_system_score_gemma":0.0001879484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000270576,"about_ca_topic_score_gemma":0.00001494227,"domain_scores_codex":[0.9976125,0.0000480265,0.0007708163,0.0003621417,0.0006477691,0.0005587706],"domain_scores_gemma":[0.9986615,0.0003975947,0.0002533162,0.0001409526,0.000360721,0.0001859339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004806043,0.00009963494,0.000003270424,0.002276669,0.00006208263,0.000001305506,0.002259691,0.4167168,0.000006500597,0.000004630856,0.5640574,0.01403143],"study_design_scores_gemma":[0.0009711467,0.0001497828,0.000004324744,0.0009797459,0.00007085347,0.000002828707,0.00007753543,0.6873668,0.00003330125,0.00003803165,0.3098582,0.0004474954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.001291525,0.0006026936,0.4269022,0.000008177082,0.5698711,0.0006697502,0.000338535,0.0002505254,0.00006548265],"genre_scores_gemma":[0.3894338,0.0002849659,0.00003376419,0.0000133947,0.6096538,0.000184726,0.0003458696,0.00004075583,0.000008964801],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.4268684,"threshold_uncertainty_score":0.9997406,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01966614169635881,"gpt":0.2348309390630085,"spread":0.2151647973666497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005171155,0.0003237861,0.0003465706,0.0002162255,0.000475353,0.0002404678,0.0002628884,0.0003524338,0.0000329741],"category_scores_gemma":[0.000004454099,0.0003186383,0.00009562908,0.0006588571,0.00009088533,0.003091503,0.000008268887,0.0005521892,0.0000128337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000111944,"about_ca_system_score_gemma":0.00004648202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004621937,"about_ca_topic_score_gemma":0.00001018158,"domain_scores_codex":[0.9981051,0.00004879597,0.0006740685,0.0003503182,0.0002514469,0.0005702689],"domain_scores_gemma":[0.9990859,0.0001432415,0.0001241968,0.0003772625,0.000112697,0.00015669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001213563,0.00002798565,0.000006654996,0.0001624257,0.00006569938,4.13879e-7,0.0002260639,0.8332142,0.000006739536,0.000008257683,0.002763308,0.1633969],"study_design_scores_gemma":[0.0008595865,0.0001204703,0.0002058468,0.00009554257,0.00008016403,0.00001796018,0.0001054915,0.9881387,0.00002452395,0.00005150939,0.009991403,0.0003088102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005479607,0.0004054007,0.9910123,0.00006634792,0.0008808365,0.0007053993,0.0001672185,0.0009958588,0.0002870427],"genre_scores_gemma":[0.9943945,0.0009756907,0.002618959,0.0002824025,0.0003277985,0.000283013,0.001005873,0.000051308,0.00006045261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9889149,"threshold_uncertainty_score":0.9999266,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01044357690331552,"gpt":0.2301288943511326,"spread":0.2196853174478171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009021124,0.0001512949,0.0001829577,0.0001266019,0.0001725638,0.00005802544,0.00005973569,0.00007607043,0.000004215487],"category_scores_gemma":[0.000001069347,0.0001406733,0.00004606026,0.0001815161,0.00003351254,0.0005659993,0.000001934719,0.0001938857,0.000001713131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003747422,"about_ca_system_score_gemma":0.00001419665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001719965,"about_ca_topic_score_gemma":6.816632e-7,"domain_scores_codex":[0.999149,0.00001547193,0.0004463745,0.00009477844,0.0001232448,0.0001710925],"domain_scores_gemma":[0.9996819,0.00003715502,0.00008862552,0.00008297525,0.00006058155,0.00004871669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004085241,0.00002072182,0.00000768937,0.0002558587,0.00002595214,6.224538e-7,0.0001336806,0.916825,0.0003613418,0.00001082637,0.00003494505,0.0822825],"study_design_scores_gemma":[0.0005647145,0.00004417137,0.00006370972,0.0004000817,0.00002133749,0.000003738392,0.00008482112,0.9797431,0.01735115,0.000002008354,0.001588525,0.0001326718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06900585,0.0006027346,0.9292279,0.000008112956,0.0004393726,0.0001985702,0.000006966672,0.0001244289,0.0003860836],"genre_scores_gemma":[0.9993344,0.0001973181,0.0001542403,0.0001769143,0.0000195529,0.00001806358,0.000005559855,0.000007900766,0.00008605797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9303285,"threshold_uncertainty_score":0.573649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01188241520242316,"gpt":0.2465462466899076,"spread":0.2346638314874844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003265306,0.0002164647,0.0001991589,0.0002461536,0.001457038,0.0004439318,0.0002769031,0.0001028358,0.0002596003],"category_scores_gemma":[0.000004076785,0.000188127,0.0001152371,0.0006077269,0.00003652914,0.003614952,0.00001356304,0.0003424649,0.000004990047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005933403,"about_ca_system_score_gemma":0.00007145827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002278673,"about_ca_topic_score_gemma":0.000001127597,"domain_scores_codex":[0.9984723,0.00006792261,0.0004617931,0.0002665156,0.0004058394,0.0003256233],"domain_scores_gemma":[0.9991322,0.0001632786,0.0002873728,0.0001790536,0.000109699,0.0001284328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006670487,0.0002908347,0.00004996538,0.0001753691,0.00008323525,0.000002208009,0.001801216,0.5069382,0.0005738171,0.002058297,0.009092272,0.4782675],"study_design_scores_gemma":[0.001183363,0.0002321146,0.0002236998,0.0001150519,0.00003292308,0.00001206444,0.0001341627,0.9827503,0.001285419,0.002970253,0.01074156,0.0003190958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00365945,0.00009508573,0.9946811,0.0002599919,0.0004293123,0.0003520368,0.0002273537,0.0001942963,0.0001014184],"genre_scores_gemma":[0.9935718,0.00006442078,0.004505516,0.001243225,0.00003869036,0.0002900008,0.0001862954,0.00001245248,0.00008761045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9901755,"threshold_uncertainty_score":0.9998429,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Bipartite graph; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.005653637728516566,"gpt":0.2040315646918721,"spread":0.1983779269633555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595752,0.0001522206,0.0001019797,0.0002547146,0.0003787683,0.0009456315,0.0001514922,0.00009901779,0.00004396947],"category_scores_gemma":[9.318264e-7,0.0001342595,0.00005592866,0.0008142061,0.00005117501,0.007430465,0.000002287727,0.0002245015,0.00001539593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123833,"about_ca_system_score_gemma":0.0000338099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002396165,"about_ca_topic_score_gemma":1.602959e-7,"domain_scores_codex":[0.9990631,0.00003680913,0.0003017451,0.0001892621,0.0002212719,0.0001877968],"domain_scores_gemma":[0.9996279,0.00004393618,0.00007284187,0.0001121455,0.00006482781,0.00007830364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009635669,0.00002056276,6.31103e-7,0.00005335645,0.0000136659,3.636559e-7,0.0005109928,0.6648824,0.00002453125,0.003096517,0.0003033376,0.331084],"study_design_scores_gemma":[0.00015822,0.00005864402,0.000005285205,0.0001098038,0.00001463464,0.00001035167,0.00002433132,0.995424,0.001106994,0.001605285,0.00131323,0.0001692391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003455398,0.0004476876,0.9975997,0.0001349091,0.0004135722,0.0001366903,0.000008351881,0.0003611719,0.0005523481],"genre_scores_gemma":[0.9902288,0.0002130984,0.008687124,0.0006516062,0.000042043,0.00004470661,0.00002409374,0.000009147097,0.00009938236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9898832,"threshold_uncertainty_score":0.9118747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009260081566282828,"gpt":0.201593267834265,"spread":0.1923331862679822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000735498,0.0001623615,0.0001348096,0.0001141,0.0002667351,0.000316248,0.0002197712,0.00007442355,0.00002782636],"category_scores_gemma":[0.000001811956,0.000135613,0.00002966156,0.0006253967,0.00005314413,0.00367595,0.000003385008,0.0001969139,0.000009625692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002288022,"about_ca_system_score_gemma":0.00004677136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003950822,"about_ca_topic_score_gemma":4.114635e-7,"domain_scores_codex":[0.9990473,0.00001649198,0.0002810287,0.0001905043,0.000268032,0.0001966716],"domain_scores_gemma":[0.9994256,0.00003228126,0.0001419261,0.0001138923,0.0001268051,0.0001594641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002615632,0.00008572439,0.00003155925,0.00006647679,0.00005675028,0.000002813037,0.004196286,0.6286501,0.00002520019,0.001712841,0.00113075,0.3637799],"study_design_scores_gemma":[0.0004896573,0.0003936948,0.00004697393,0.0000510724,0.00001508117,0.0000131572,0.00003480942,0.9973181,0.0008263623,0.00008754519,0.0005331147,0.0001903791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006980413,0.00002546785,0.9976397,0.0004314031,0.00007358665,0.0001918331,0.000004493246,0.0003830658,0.0005523654],"genre_scores_gemma":[0.9597712,0.00002112365,0.03718096,0.002934964,0.00002326722,0.00003395755,0.000005621237,0.000008156936,0.00002072155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9604588,"threshold_uncertainty_score":0.5530139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01340759367079843,"gpt":0.2732175694567648,"spread":0.2598099757859664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002443209,0.0004204341,0.0005859977,0.0002655764,0.0005948961,0.000412691,0.0003832107,0.000299988,0.000307458],"category_scores_gemma":[0.000001780801,0.0003935539,0.0002442883,0.0001816865,0.0001634264,0.001198809,0.00003206345,0.001356071,0.00000143148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003623294,"about_ca_system_score_gemma":0.0001219109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002676586,"about_ca_topic_score_gemma":0.00001687876,"domain_scores_codex":[0.9981785,0.0000626516,0.0008430178,0.0002974008,0.000318172,0.0003002704],"domain_scores_gemma":[0.9979215,0.0001007921,0.001120624,0.0004646238,0.0002691773,0.0001233247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004359606,0.0001314531,0.0002985616,0.00007809783,0.00008406158,1.458418e-7,0.0001436466,0.5316774,0.000002664983,0.0001195266,0.0001641001,0.4672567],"study_design_scores_gemma":[0.0003275212,0.00007281809,0.0008827143,0.000902862,0.0001816053,5.744669e-7,0.00004832974,0.9947556,0.0001131661,0.001781863,0.0005435332,0.0003893648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007583001,0.0001432109,0.9899135,0.0000444664,0.0002346248,0.0003013327,0.00008451478,0.0001037261,0.001591573],"genre_scores_gemma":[0.9976036,0.0002328267,0.001314808,0.0001118364,0.0002901109,0.00005454895,0.0002779033,0.00002215181,0.00009219989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9900206,"threshold_uncertainty_score":0.9998516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01232678709893375,"gpt":0.2489238734758958,"spread":0.2365970863769621,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002692909,0.0004203301,0.0006132733,0.0001625589,0.0005418214,0.0007003904,0.0002265395,0.0002221781,0.0001170556],"category_scores_gemma":[0.000001519399,0.0003704095,0.00010483,0.0001027173,0.0002053815,0.001504662,0.00002854469,0.0009936914,4.175444e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000304827,"about_ca_system_score_gemma":0.00008529039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000965691,"about_ca_topic_score_gemma":0.00006093475,"domain_scores_codex":[0.9984182,0.00008822014,0.0006693988,0.0002896787,0.0002625632,0.0002719055],"domain_scores_gemma":[0.9981141,0.0001533829,0.001068272,0.0003270919,0.0002300711,0.000107046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009264766,0.00002830556,0.02553557,0.0001333628,0.0003595432,2.376542e-7,0.0003531824,0.463723,0.000002899312,0.00008940422,0.00004850778,0.5096334],"study_design_scores_gemma":[0.0004285912,0.00006822569,0.06461321,0.0009232145,0.0003018525,9.183269e-7,0.00009106133,0.9324765,0.00009049964,0.0003711601,0.0001597096,0.0004750204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1275408,0.000154779,0.8711647,0.00001131149,0.0001495741,0.0002243342,0.0001524833,0.00006617603,0.0005357969],"genre_scores_gemma":[0.9983617,0.00009126802,0.0007921315,0.00002429647,0.0003053437,0.00004097562,0.0003253502,0.00002427781,0.00003464975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8708209,"threshold_uncertainty_score":0.9998748,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008588321185572597,"gpt":0.2394253606992774,"spread":0.2308370395137048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063369,0.000211198,0.0002015644,0.0003907888,0.0005075361,0.000508986,0.0003411347,0.00014248,0.00002372474],"category_scores_gemma":[0.000002558259,0.0001871682,0.00006995793,0.001190924,0.00006391365,0.002639354,0.000002063395,0.0003189984,0.000005442582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004247407,"about_ca_system_score_gemma":0.0001707269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005704435,"about_ca_topic_score_gemma":0.000001378407,"domain_scores_codex":[0.9985475,0.00006420802,0.0004452007,0.000285377,0.0003590063,0.0002987355],"domain_scores_gemma":[0.9992,0.00005119849,0.00008098518,0.0002543416,0.0001926897,0.0002208274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001592007,0.0002268396,0.000005602913,0.00004532205,0.0000142815,2.916017e-7,0.0002978971,0.9420684,0.00002565595,0.005989818,0.0001072312,0.05105945],"study_design_scores_gemma":[0.0009310763,0.0002485272,0.0002006563,0.00009872142,0.00001475942,0.000001170651,0.00003713301,0.9967824,0.0006149361,0.0001461831,0.000713411,0.0002110814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009587837,0.000007467443,0.9963338,0.000422559,0.0001144853,0.0004012135,0.00001692478,0.000253566,0.001491243],"genre_scores_gemma":[0.9550873,0.000006808232,0.0409779,0.003684736,0.00001001571,0.00009765125,0.00006774326,0.000006768606,0.00006109057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9553559,"threshold_uncertainty_score":0.7632497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}