{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026614778,0.00011515155,0.9938059,0.00015940762,0.0003047219,0.00027301573,0.000004695144,0.0001977481,0.0024778997],"genre_scores_gemma":[0.98107165,0.000055954013,0.01771513,0.0009234065,0.00007330621,0.000059780134,0.000022160144,0.000016829314,0.000061752246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979629,0.00008288309,0.0007246455,0.00032099578,0.00038894312,0.0005196584],"domain_scores_gemma":[0.99868953,0.00016646578,0.000309348,0.00023330556,0.00024348842,0.00035788823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083432393,0.00032224128,0.00033950314,0.00030014277,0.00047372933,0.0007294306,0.00028766686,0.00018282245,0.000014786131],"category_scores_gemma":[0.000003008891,0.00027589317,0.000056024095,0.000817881,0.00010393763,0.004858059,0.000010328045,0.0005515724,0.000006579067],"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.00010740058,0.00004002111,0.000041218278,0.00001868784,0.000016238066,0.000015479647,0.0005830392,0.8392237,5.572438e-7,0.00035356774,0.00015608688,0.15944403],"study_design_scores_gemma":[0.0011605165,0.00020116271,0.00005855543,0.0003436646,0.000035021698,0.000095536685,0.00017626007,0.99699414,0.000008252633,0.00009945389,0.0004563648,0.00037109476],"about_ca_topic_score_codex":0.00002964223,"about_ca_topic_score_gemma":0.000010314844,"teacher_disagreement_score":0.9784102,"about_ca_system_score_codex":0.00009557322,"about_ca_system_score_gemma":0.0002841932,"threshold_uncertainty_score":0.9999693},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009626327,0.00006648374,0.99760044,0.000144643,0.00034077573,0.00016178527,0.00004015319,0.00035622905,0.00032686174],"genre_scores_gemma":[0.94651896,0.000030765223,0.052488863,0.00078066584,0.000051849904,0.00002361345,0.00006378834,0.000009109816,0.000032382057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985618,0.00004143322,0.00046176562,0.00024147896,0.00040611118,0.0002874162],"domain_scores_gemma":[0.99894303,0.00010377275,0.00021003853,0.00022542097,0.00028702852,0.00023069074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029883496,0.0002204407,0.00018525649,0.00015252251,0.00041038485,0.00039881078,0.00026896034,0.00016709723,0.0000075374255],"category_scores_gemma":[0.000011255651,0.00019814562,0.00005254372,0.0004958795,0.00006889892,0.0060992236,0.000008056587,0.00038427222,0.00002476635],"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.00007512155,0.00003372173,0.0000070452147,0.000008734382,0.000008134604,6.293679e-7,0.00041235963,0.8290372,0.0000020598482,0.0003956991,0.0010310868,0.1689882],"study_design_scores_gemma":[0.0007698523,0.00011307662,0.000050440154,0.00008355853,0.000015182012,0.00001444795,0.000055798497,0.99702114,0.0001711238,0.0005012715,0.0009575476,0.00024656218],"about_ca_topic_score_codex":0.000015564694,"about_ca_topic_score_gemma":0.000002602286,"teacher_disagreement_score":0.94555634,"about_ca_system_score_codex":0.00006273108,"about_ca_system_score_gemma":0.00011557352,"threshold_uncertainty_score":0.8080144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093696965,0.00004799565,0.9894074,0.00033935133,0.00023679585,0.00027978444,0.00002039256,0.00016840566,0.00013018634],"genre_scores_gemma":[0.99871117,0.0000027949654,0.0005961422,0.00053659617,0.000020818718,0.00007879195,0.000037493992,0.0000052107443,0.000010963217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868894,0.00007078434,0.00045790212,0.0001795217,0.00033063634,0.0002721911],"domain_scores_gemma":[0.9992566,0.0000466757,0.00023117768,0.00016238881,0.00014280438,0.00016036372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038046608,0.00015800609,0.00015877718,0.00012614015,0.00015754924,0.0004534195,0.00020034751,0.00010432396,0.000008225617],"category_scores_gemma":[0.000009254912,0.00014356527,0.00003434928,0.0006391248,0.00004255811,0.004342247,0.0000025332156,0.00021704275,0.000019018167],"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.000103145845,0.000096298994,0.00012828503,0.000035482124,0.000008903503,0.0000019330294,0.000635604,0.87603337,0.000038706527,0.00025091413,0.00024366388,0.12242369],"study_design_scores_gemma":[0.0016382469,0.00009537951,0.0007345038,0.00008883803,0.00000797508,0.0000037690397,0.00009972952,0.9953117,0.0007901966,0.00003426567,0.0010198606,0.00017558651],"about_ca_topic_score_codex":0.000030980915,"about_ca_topic_score_gemma":0.000008627295,"teacher_disagreement_score":0.9893415,"about_ca_system_score_codex":0.00012681322,"about_ca_system_score_gemma":0.00013781662,"threshold_uncertainty_score":0.5854421},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007058052,0.00018330058,0.9972478,0.00016104718,0.0002787097,0.00022503435,0.0000040322398,0.00049760885,0.00069663936],"genre_scores_gemma":[0.97693276,0.00011160221,0.022266824,0.00035270548,0.00003408918,0.00010114057,0.0000076220467,0.000007999519,0.00018524293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880314,0.00002350301,0.00039611003,0.00023089447,0.0002965297,0.00024985347],"domain_scores_gemma":[0.99916,0.00006072163,0.00017202065,0.00018658444,0.00028634616,0.00013432185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025685455,0.00018733181,0.00017391432,0.00017992019,0.00045207312,0.00037939387,0.00030883477,0.00017318019,0.0000066760335],"category_scores_gemma":[0.0000043391938,0.00015613438,0.000058345555,0.0002759523,0.00004674834,0.0040606097,0.0000048491142,0.00027158036,0.000010820935],"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.00009425331,0.000029553397,0.0000014233912,0.000040141396,0.000005938409,1.414095e-7,0.0003206427,0.4728548,0.00003659355,0.00046637884,0.0003945432,0.5257556],"study_design_scores_gemma":[0.00063790416,0.0001907275,0.0000046287046,0.00017403919,0.000012214951,0.0000045444676,0.000043057134,0.9805727,0.0028014036,0.0016889902,0.013656658,0.0002131418],"about_ca_topic_score_codex":0.000012468058,"about_ca_topic_score_gemma":5.481697e-7,"teacher_disagreement_score":0.976227,"about_ca_system_score_codex":0.000053198844,"about_ca_system_score_gemma":0.000083576655,"threshold_uncertainty_score":0.63669753},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013537861,0.00013782071,0.9948248,0.00021927671,0.0005007527,0.0008157638,0.0016309144,0.0004834129,0.000033426695],"genre_scores_gemma":[0.99581176,0.000041643547,0.0027983747,0.00012389653,0.00008848483,0.000154183,0.00094892544,0.000021338652,0.000011420928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975474,0.00008381724,0.00080130546,0.00056093006,0.00056695216,0.0004396314],"domain_scores_gemma":[0.9982403,0.000096550204,0.0006829981,0.0003639005,0.00039501794,0.00022125342],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029560045,0.0005055034,0.00044330262,0.00029558103,0.0005596921,0.00109508,0.00032526266,0.00034046613,0.0000111729705],"category_scores_gemma":[0.0000070409424,0.0003948309,0.00007181247,0.00044552973,0.00012027125,0.0017576271,0.000031303785,0.00064621575,0.0000019330075],"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.00011739367,0.000089205,0.000008660837,0.00018815024,0.000073376425,0.0000012685487,0.00022610465,0.96766037,0.000004320001,0.00008083671,0.000034040822,0.03151627],"study_design_scores_gemma":[0.0016127165,0.00010688238,0.00022140266,0.0012612677,0.000103017526,0.00003317621,0.000042608302,0.9960587,0.000025425614,0.000051041538,0.00004942291,0.00043433392],"about_ca_topic_score_codex":0.000010098985,"about_ca_topic_score_gemma":0.0000014501379,"teacher_disagreement_score":0.99445796,"about_ca_system_score_codex":0.00021550617,"about_ca_system_score_gemma":0.00016295756,"threshold_uncertainty_score":0.9999419},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1778752,0.000050903527,0.82153803,0.0000606844,0.000063854015,0.00009089692,0.000020054442,0.000010382811,0.00029001205],"genre_scores_gemma":[0.99976355,0.00006731174,0.0000540495,0.000053402655,0.000015365476,0.000019711993,0.0000030853269,0.000004674506,0.000018843559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993638,0.0000408978,0.00035693197,0.00005378055,0.00010077171,0.00008381703],"domain_scores_gemma":[0.9993416,0.00011950552,0.0003025875,0.000060001184,0.00014681304,0.000029489844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016854714,0.000097780576,0.00018886435,0.00009726635,0.0001428471,0.000044390174,0.00004361258,0.000040427934,0.00010105517],"category_scores_gemma":[0.0000014627648,0.00007086173,0.00006645816,0.00012030108,0.00012962824,0.0013034208,0.0000024886383,0.00010820036,5.485255e-7],"study_design_candidate":"design_other","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.0001260695,0.00010854812,0.00034223098,0.00021619954,0.00039365294,3.503964e-8,0.0049756328,0.014219997,0.0013940503,0.00714266,0.000007539061,0.9710734],"study_design_scores_gemma":[0.0026673386,0.00063733634,0.0029134073,0.001377072,0.000989559,0.000005802915,0.0061918497,0.94406307,0.027524106,0.0121271955,0.0008112719,0.0006920102],"about_ca_topic_score_codex":0.00007116249,"about_ca_topic_score_gemma":0.0000030370084,"teacher_disagreement_score":0.9703814,"about_ca_system_score_codex":0.000012347347,"about_ca_system_score_gemma":0.000014969991,"threshold_uncertainty_score":0.28896576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04156077,0.00012504435,0.9554066,0.000032383436,0.00041300512,0.0001891887,0.000032506006,0.0004657141,0.0017747855],"genre_scores_gemma":[0.99548733,0.000036182282,0.003979288,0.0001684509,0.00007964693,0.00010058415,0.000016551283,0.00005093328,0.00008100204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985188,0.000026694212,0.00053929316,0.0002459926,0.0002402521,0.0004289136],"domain_scores_gemma":[0.99906445,0.00024062082,0.00018882666,0.00013365023,0.0002110288,0.00016144672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025077516,0.00033862834,0.0002700654,0.00016710322,0.00048009932,0.00037450864,0.000093302966,0.00016326917,0.000032288946],"category_scores_gemma":[0.000007743434,0.0002627157,0.000048483664,0.00018654796,0.0002149536,0.0026278829,0.000002938858,0.00021740008,0.0000020009315],"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.000182789,0.000022546223,0.00005135781,0.00021268046,0.000107013126,0.0000023972245,0.0003284613,0.89605206,0.00026680675,0.0014629163,0.00022372729,0.101087265],"study_design_scores_gemma":[0.0017573574,0.00026979228,0.00026200857,0.0020121098,0.0000632771,0.00019249221,0.0002754323,0.9895201,0.0024013508,0.000017480605,0.0025641986,0.0006644269],"about_ca_topic_score_codex":0.000008599597,"about_ca_topic_score_gemma":0.0000042213865,"teacher_disagreement_score":0.9539266,"about_ca_system_score_codex":0.00011787663,"about_ca_system_score_gemma":0.000053619693,"threshold_uncertainty_score":0.9999825},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007583001,0.0001432109,0.9899135,0.000044466404,0.00023462481,0.00030133268,0.00008451478,0.00010372611,0.0015915725],"genre_scores_gemma":[0.9976036,0.00023282674,0.0013148085,0.000111836445,0.0002901109,0.000054548953,0.00027790325,0.000022151808,0.000092199894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981785,0.000062651605,0.00084301777,0.00029740084,0.00031817198,0.0003002704],"domain_scores_gemma":[0.99792147,0.00010079213,0.0011206245,0.00046462382,0.00026917734,0.00012332472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002443209,0.00042043408,0.0005859977,0.0002655764,0.0005948961,0.00041269104,0.00038321072,0.00029998802,0.00030745802],"category_scores_gemma":[0.0000017808011,0.0003935539,0.00024428827,0.00018168647,0.00016342638,0.0011988091,0.00003206345,0.0013560705,0.0000014314797],"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.00004359606,0.00013145305,0.00029856164,0.00007809783,0.00008406158,1.4584182e-7,0.00014364657,0.5316774,0.0000026649825,0.000119526645,0.00016410007,0.4672567],"study_design_scores_gemma":[0.0003275212,0.00007281809,0.00088271435,0.000902862,0.00018160525,5.744669e-7,0.000048329744,0.9947556,0.000113166134,0.0017818633,0.00054353324,0.00038936484],"about_ca_topic_score_codex":0.0002676586,"about_ca_topic_score_gemma":0.000016878765,"teacher_disagreement_score":0.99002063,"about_ca_system_score_codex":0.00003623294,"about_ca_system_score_gemma":0.00012191088,"threshold_uncertainty_score":0.99985164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754084,0.00015477905,0.8711647,0.000011311488,0.00014957415,0.00022433423,0.00015248335,0.00006617603,0.00053579686],"genre_scores_gemma":[0.9983617,0.00009126802,0.00079213147,0.000024296467,0.0003053437,0.000040975618,0.0003253502,0.000024277808,0.00003464975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984182,0.00008822014,0.00066939875,0.00028967872,0.00026256318,0.0002719055],"domain_scores_gemma":[0.9981141,0.00015338293,0.0010682719,0.0003270919,0.00023007109,0.00010704596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026929093,0.0004203301,0.0006132733,0.00016255892,0.00054182136,0.00070039043,0.00022653953,0.00022217807,0.000117055584],"category_scores_gemma":[0.0000015193988,0.0003704095,0.00010483004,0.000102717255,0.00020538154,0.001504662,0.000028544695,0.0009936914,4.1754436e-7],"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.00009264766,0.000028305558,0.02553557,0.00013336282,0.00035954325,2.3765418e-7,0.0003531824,0.46372297,0.0000028993124,0.00008940422,0.000048507784,0.50963336],"study_design_scores_gemma":[0.00042859121,0.00006822569,0.06461321,0.0009232145,0.00030185253,9.1832686e-7,0.00009106133,0.9324765,0.00009049964,0.0003711601,0.0001597096,0.00047502044],"about_ca_topic_score_codex":0.000965691,"about_ca_topic_score_gemma":0.00006093475,"teacher_disagreement_score":0.8708209,"about_ca_system_score_codex":0.000030482704,"about_ca_system_score_gemma":0.00008529039,"threshold_uncertainty_score":0.9998748},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026806872,0.000071809125,0.9708453,0.00029043038,0.00054045976,0.00043318368,0.0007217304,0.000107789405,0.00018246307],"genre_scores_gemma":[0.99918234,0.00007550115,0.00012889368,0.00036359197,0.00010576947,0.00005841747,0.00007005299,0.000007878183,0.0000075674084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.000013767087,0.00027617635,0.00018145883,0.0001395046,0.00021675011],"domain_scores_gemma":[0.9992834,0.000114916984,0.000073844756,0.0003353421,0.000056584628,0.00013596706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027191848,0.00016538824,0.00018436897,0.000058695994,0.0007469707,0.0004443363,0.00023767262,0.00013085075,0.0000154819],"category_scores_gemma":[0.000018370778,0.00014321432,0.000029088811,0.00006633027,0.00010269108,0.0023034916,0.0000046454256,0.0003728348,0.0000045653364],"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.0012090601,0.0001414915,0.0006247163,0.0007143517,0.00011778518,0.0000011262797,0.0010075109,0.71866286,0.000047905447,0.00017495589,0.008954023,0.26834422],"study_design_scores_gemma":[0.0009250295,0.00012193412,0.005584709,0.00017842984,0.000035618723,0.0000042370407,0.000034135093,0.9806641,0.0002888855,0.000056416477,0.011883953,0.00022255482],"about_ca_topic_score_codex":0.00001927987,"about_ca_topic_score_gemma":0.0000345045,"teacher_disagreement_score":0.97237545,"about_ca_system_score_codex":0.000029842031,"about_ca_system_score_gemma":0.000024859484,"threshold_uncertainty_score":0.584011},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012915246,0.0006026936,0.4269022,0.000008177082,0.5698711,0.00066975015,0.00033853497,0.00025052537,0.00006548265],"genre_scores_gemma":[0.3894338,0.0002849659,0.000033764194,0.000013394698,0.6096538,0.00018472597,0.0003458696,0.000040755833,0.000008964801],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976125,0.0000480265,0.00077081635,0.00036214167,0.00064776913,0.0005587706],"domain_scores_gemma":[0.99866146,0.00039759473,0.0002533162,0.00014095259,0.000360721,0.00018593391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004076726,0.0005330311,0.0006121132,0.00024186111,0.00050629565,0.00076489797,0.00021389451,0.0011112058,0.000004523071],"category_scores_gemma":[0.000015266367,0.0005045858,0.00009489013,0.0004482983,0.00020538647,0.0025681064,0.000006614955,0.0014204686,0.000002812613],"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.00048060433,0.00009963494,0.0000032704243,0.0022766695,0.00006208263,0.000001305506,0.0022596912,0.4167168,0.000006500597,0.0000046308564,0.56405735,0.014031425],"study_design_scores_gemma":[0.0009711467,0.00014978282,0.000004324744,0.0009797459,0.00007085347,0.000002828707,0.000077535435,0.6873668,0.00003330125,0.00003803165,0.30985817,0.0004474954],"about_ca_topic_score_codex":0.000027057602,"about_ca_topic_score_gemma":0.000014942271,"teacher_disagreement_score":0.42686844,"about_ca_system_score_codex":0.00016368862,"about_ca_system_score_gemma":0.00018794845,"threshold_uncertainty_score":0.9997406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037964638,0.00011629316,0.99430805,0.0003109602,0.0003648839,0.0003160006,0.0000026351843,0.00012501849,0.0006596781],"genre_scores_gemma":[0.99468267,0.00025818238,0.003034264,0.0017428092,0.00009839137,0.000086815555,0.000005984107,0.000008887079,0.000082008424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988289,0.000054273605,0.0004624279,0.00020917179,0.00012885244,0.00031641123],"domain_scores_gemma":[0.9990856,0.00014579814,0.0001658471,0.00023977025,0.00027070954,0.00009226473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038998222,0.00018509898,0.00018883286,0.00019369036,0.00066097133,0.00049209315,0.00031642473,0.00013374456,0.000023239769],"category_scores_gemma":[0.0000036406127,0.00017575063,0.000051523282,0.00062683906,0.00014174852,0.0018014862,0.000009094114,0.0003014029,0.000003445824],"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.00013290766,0.000053266936,0.000018470659,0.000024364823,0.00001538326,2.5068994e-7,0.00082104147,0.026660882,0.00007032695,0.0029358475,0.00043420613,0.968833],"study_design_scores_gemma":[0.0009061826,0.00021084405,0.00016809022,0.00010823653,0.000007039846,0.0000067348856,0.000034954126,0.99538094,0.00040074805,0.00011465629,0.002440474,0.00022108086],"about_ca_topic_score_codex":0.0000063982366,"about_ca_topic_score_gemma":0.00004592496,"teacher_disagreement_score":0.9912738,"about_ca_system_score_codex":0.000059538084,"about_ca_system_score_gemma":0.00008393529,"threshold_uncertainty_score":0.71669024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008232418,0.00005226903,0.9905754,0.000188419,0.00032027156,0.00036589688,0.000016865139,0.00019804928,0.00005045866],"genre_scores_gemma":[0.9930407,0.000013949687,0.0053858426,0.0014272553,0.000020022051,0.000060364302,0.000022892827,0.000007508521,0.000021487751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989586,0.000023700059,0.00031586378,0.00020649063,0.00020591465,0.00028945642],"domain_scores_gemma":[0.99930173,0.00013909013,0.00016052464,0.00018669575,0.000105605104,0.000106329695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011345204,0.0001685125,0.00015592271,0.000095984215,0.00033191778,0.00026624888,0.00021262343,0.00009336605,0.00002059816],"category_scores_gemma":[0.0000013260282,0.0001461887,0.00007973175,0.00048343395,0.000047287973,0.0036914758,0.0000031111013,0.00020289693,0.000007341448],"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.00010995562,0.000032640484,0.00004021014,0.000042468182,0.000007542548,1.702908e-7,0.00007105571,0.8361898,0.000096652155,0.00039525668,0.00022326242,0.16279098],"study_design_scores_gemma":[0.0010480364,0.00017782731,0.00027516412,0.00010738142,0.00000951337,0.0000022954284,0.0000136442995,0.99299014,0.0033233117,0.00041790848,0.001437495,0.00019728529],"about_ca_topic_score_codex":0.0000017467434,"about_ca_topic_score_gemma":6.259377e-7,"teacher_disagreement_score":0.9851895,"about_ca_system_score_codex":0.000023048087,"about_ca_system_score_gemma":0.000028270648,"threshold_uncertainty_score":0.5961402},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10801897,0.00011978869,0.89035064,0.000029500985,0.0005402038,0.00028683263,0.00003325454,0.0001732221,0.00044758987],"genre_scores_gemma":[0.9990969,0.00026540644,0.00011205408,0.0001390356,0.000029735433,0.000034326484,0.0002947928,0.000011667841,0.000016123622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989616,0.000027264945,0.00044902103,0.00013351237,0.00012777607,0.00030082455],"domain_scores_gemma":[0.9996503,0.000042019983,0.00007594568,0.00009255836,0.00006193374,0.00007723486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516279,0.00018738699,0.00018629809,0.000113586,0.00010584929,0.00012992696,0.00006113841,0.0002223065,0.00021325644],"category_scores_gemma":[0.0000021346377,0.00019503481,0.000044264638,0.0003398027,0.000035445035,0.0024001247,8.8997825e-7,0.00036562482,0.000030125935],"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.0001211728,0.000025263353,0.00011656585,0.000041158582,0.0000098407145,3.8125827e-7,0.00009140408,0.8920787,0.00006746576,0.00006856111,0.00015578064,0.10722373],"study_design_scores_gemma":[0.0011738027,0.00009649128,0.0014234763,0.000087858694,0.000013723473,0.000006840224,0.000051928302,0.994725,0.00071840925,0.00001989246,0.0014663676,0.00021623846],"about_ca_topic_score_codex":0.000013502202,"about_ca_topic_score_gemma":0.000010551198,"teacher_disagreement_score":0.8910779,"about_ca_system_score_codex":0.00015719066,"about_ca_system_score_gemma":0.000019555931,"threshold_uncertainty_score":0.7953289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12183644,0.00032411245,0.87691146,0.00016264067,0.0002668902,0.0002165248,0.0000012775668,0.00012771731,0.00015290822],"genre_scores_gemma":[0.9981004,0.00014757804,0.00084258005,0.00078349205,0.00003760028,0.000034195167,0.000011454073,0.000007981409,0.00003472338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985992,0.000052180218,0.0004689873,0.00029506773,0.00030202928,0.00028258224],"domain_scores_gemma":[0.9992241,0.00013938216,0.00022026087,0.00018397572,0.00013292441,0.000099337114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039982382,0.00022227527,0.00019346073,0.00013289085,0.00058925134,0.0007841656,0.00022911026,0.000117776006,0.000023085087],"category_scores_gemma":[0.0000054187626,0.00020154609,0.000052479205,0.0003653057,0.000053443593,0.003969786,0.000011931125,0.0004202684,0.000005925065],"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.000071077004,0.00013181835,0.00007000973,0.00016697375,0.000036927864,4.3129728e-7,0.0044747605,0.38078934,0.0011318993,0.00073806604,0.00030188012,0.61208683],"study_design_scores_gemma":[0.00043000327,0.00010407206,0.000029593008,0.00025339052,0.000016993643,0.000006625122,0.0003101515,0.9973601,0.0008814512,0.00009321112,0.0002685201,0.00024589224],"about_ca_topic_score_codex":0.000037634934,"about_ca_topic_score_gemma":0.000003033257,"teacher_disagreement_score":0.876264,"about_ca_system_score_codex":0.000059760285,"about_ca_system_score_gemma":0.000044093373,"threshold_uncertainty_score":0.8218811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021962477,0.00012551591,0.9951835,0.0012767074,0.00017857269,0.00023512778,0.000014080387,0.00055629,0.00023393723],"genre_scores_gemma":[0.69869906,0.00014792761,0.30040672,0.00063786877,0.000043737586,0.000024067358,0.0000065228487,0.000009376675,0.000024706605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817824,0.00008815153,0.00052525476,0.00041535785,0.00038261517,0.00041035863],"domain_scores_gemma":[0.9974393,0.0002383183,0.00027315362,0.0016863781,0.00022622227,0.00013662157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005730577,0.00027657594,0.00029268008,0.00060555094,0.0007760228,0.0009268461,0.003431917,0.0002172173,0.000059441372],"category_scores_gemma":[0.00019582453,0.00025553635,0.000067075096,0.0016669774,0.00028161937,0.0048562493,0.00072866085,0.00042640022,0.000011888204],"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.00005235729,0.000054435193,0.00007680118,0.000053062377,0.00023694934,0.0000035243459,0.00088218244,0.014058312,0.000049924423,0.00006925415,0.005467077,0.9789961],"study_design_scores_gemma":[0.0004140174,0.00014040867,0.00046644435,0.000077892175,0.00008808584,0.000022551429,0.000030418902,0.99078023,0.0023756644,0.0043497686,0.00094885397,0.0003056329],"about_ca_topic_score_codex":0.000028904791,"about_ca_topic_score_gemma":0.0000025706101,"teacher_disagreement_score":0.9786905,"about_ca_system_score_codex":0.00005597345,"about_ca_system_score_gemma":0.00007755283,"threshold_uncertainty_score":0.9999897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006980413,0.000025467849,0.9976397,0.00043140314,0.00007358665,0.0001918331,0.0000044932463,0.00038306575,0.00055236544],"genre_scores_gemma":[0.9597712,0.000021123651,0.037180964,0.002934964,0.000023267217,0.000033957545,0.0000056212366,0.000008156936,0.000020721549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990473,0.000016491978,0.0002810287,0.0001905043,0.00026803202,0.00019667162],"domain_scores_gemma":[0.99942565,0.000032281256,0.00014192607,0.00011389228,0.00012680511,0.00015946406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000735498,0.00016236145,0.00013480958,0.00011409995,0.00026673512,0.00031624804,0.00021977117,0.00007442355,0.000027826356],"category_scores_gemma":[0.0000018119564,0.00013561302,0.000029661562,0.0006253967,0.000053144133,0.0036759505,0.0000033850079,0.00019691385,0.000009625692],"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.00026156323,0.000085724394,0.000031559248,0.000066476794,0.00005675028,0.000002813037,0.004196286,0.6286501,0.00002520019,0.0017128414,0.0011307499,0.36377993],"study_design_scores_gemma":[0.00048965734,0.00039369485,0.000046973928,0.000051072402,0.000015081169,0.0000131572015,0.00003480942,0.99731815,0.00082636235,0.00008754519,0.0005331147,0.00019037911],"about_ca_topic_score_codex":0.0000039508222,"about_ca_topic_score_gemma":4.114635e-7,"teacher_disagreement_score":0.96045876,"about_ca_system_score_codex":0.000022880218,"about_ca_system_score_gemma":0.00004677136,"threshold_uncertainty_score":0.55301386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16035326,0.0002333056,0.838258,0.000010422831,0.0007875777,0.0001183593,0.000010391472,0.00010549378,0.00012314218],"genre_scores_gemma":[0.99906576,0.00032564413,0.00015381226,0.00008134159,0.00030552398,0.000010979652,0.000038576767,0.0000132678515,0.0000050792087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.00006502943,0.00055585057,0.00019644487,0.00022377378,0.0002972819],"domain_scores_gemma":[0.99941367,0.00010509121,0.00012859538,0.00018528404,0.00008646618,0.00008091669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029331454,0.00018506416,0.00025709404,0.00012650454,0.00024660537,0.00011568611,0.000120292185,0.00028881078,0.000020694548],"category_scores_gemma":[0.000006735294,0.00019619503,0.000043571945,0.0008713114,0.000057287587,0.0023355247,0.000007842554,0.0007213072,0.0000017087123],"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.000084001134,0.000028851842,0.00028414332,0.000055386892,0.000017701212,0.0000017592553,0.00018539537,0.8622776,0.0000837936,0.00000438716,0.00005593798,0.13692102],"study_design_scores_gemma":[0.0005750616,0.000048582,0.0007156221,0.00026488048,0.000027539598,0.000028938526,0.0003212298,0.995403,0.0020343922,0.000008700673,0.0003642621,0.00020781302],"about_ca_topic_score_codex":0.000036495563,"about_ca_topic_score_gemma":0.000064824875,"teacher_disagreement_score":0.8387125,"about_ca_system_score_codex":0.000077495286,"about_ca_system_score_gemma":0.000046289508,"threshold_uncertainty_score":0.80006015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054623844,0.00004346913,0.99852973,0.00006783137,0.0001233031,0.00017501126,0.0000073902474,0.00019133429,0.00031569778],"genre_scores_gemma":[0.97793764,0.000028111806,0.021358345,0.00050249125,0.0000071310087,0.00012475658,0.00001803067,0.000005220473,0.00001828917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891627,0.000052373638,0.00036319505,0.00018302971,0.00030645236,0.0001787076],"domain_scores_gemma":[0.9995197,0.000044128672,0.00016481026,0.00014618906,0.00007294868,0.00005221355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002572759,0.00012454046,0.00015283232,0.0008033902,0.00044996446,0.00023326572,0.00022861497,0.00004839271,0.00014596757],"category_scores_gemma":[0.0000015340905,0.00013321394,0.000049994058,0.0023221262,0.000029093284,0.002929795,0.000008523834,0.00023563982,8.916627e-7],"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.000017046836,0.000045099147,0.000039673163,0.000007663936,0.000019002788,5.019193e-7,0.00048276692,0.9424758,7.2525677e-7,0.00051609124,0.000013341735,0.056382284],"study_design_scores_gemma":[0.00028994077,0.00008883499,0.000205978,0.000010959305,0.000029687608,0.0000056570316,0.00006311771,0.99892706,0.000057999245,0.00010738159,0.0000615028,0.00015186497],"about_ca_topic_score_codex":0.00001668863,"about_ca_topic_score_gemma":0.000002294612,"teacher_disagreement_score":0.97739136,"about_ca_system_score_codex":0.0001225348,"about_ca_system_score_gemma":0.000059397713,"threshold_uncertainty_score":0.54323065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036594504,0.00009508573,0.99468106,0.0002599919,0.0004293123,0.00035203682,0.00022735371,0.00019429628,0.000101418365],"genre_scores_gemma":[0.9935718,0.00006442078,0.0045055156,0.0012432251,0.00003869036,0.00029000078,0.0001862954,0.000012452479,0.000087610446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847233,0.000067922614,0.00046179313,0.00026651556,0.00040583938,0.00032562332],"domain_scores_gemma":[0.99913216,0.00016327859,0.00028737282,0.00017905359,0.000109699045,0.0001284328],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032653063,0.00021646466,0.00019915892,0.00024615356,0.0014570383,0.00044393179,0.00027690313,0.00010283581,0.00025960026],"category_scores_gemma":[0.0000040767845,0.00018812696,0.00011523706,0.00060772686,0.000036529138,0.003614952,0.0000135630435,0.00034246492,0.0000049900473],"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.00066704873,0.00029083472,0.000049965376,0.00017536913,0.000083235245,0.0000022080087,0.0018012163,0.5069382,0.0005738171,0.002058297,0.009092272,0.47826752],"study_design_scores_gemma":[0.0011833634,0.00023211463,0.00022369981,0.00011505194,0.000032923075,0.000012064444,0.00013416274,0.9827503,0.0012854192,0.0029702527,0.010741562,0.0003190958],"about_ca_topic_score_codex":0.000022786733,"about_ca_topic_score_gemma":0.0000011275965,"teacher_disagreement_score":0.99017555,"about_ca_system_score_codex":0.000059334034,"about_ca_system_score_gemma":0.00007145827,"threshold_uncertainty_score":0.99984294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016238892,0.00017676361,0.98150504,0.00007460669,0.00046260166,0.0011236789,0.000072032875,0.0003381735,0.000008227413],"genre_scores_gemma":[0.9939081,0.000026359645,0.005506319,0.0001570903,0.000059072776,0.0002426745,0.000037885482,0.000018318446,0.00004415913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981837,0.000053513235,0.0006537105,0.0003060659,0.0003977364,0.00040522125],"domain_scores_gemma":[0.9989358,0.00009753396,0.0003669899,0.00016935465,0.00029064258,0.00013963801],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047172236,0.0002945899,0.0003565506,0.00029910382,0.00092298345,0.0015254577,0.00018592882,0.00016172949,0.0000020404327],"category_scores_gemma":[0.0000038736102,0.0002519655,0.00007057806,0.00048638563,0.000055930504,0.0043666195,0.000004431985,0.00022664118,0.0000041145513],"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.00019296265,0.0000421601,0.000008141631,0.0002746059,0.000062777486,0.0000016676557,0.0011184192,0.95005375,0.00013729345,0.0003857763,0.000011799022,0.047710646],"study_design_scores_gemma":[0.004992874,0.00014805187,0.000061360704,0.00047936518,0.0000722624,0.000033939534,0.00042170132,0.9930649,0.00027384429,0.000024979727,0.000117212665,0.00030954793],"about_ca_topic_score_codex":0.00006160775,"about_ca_topic_score_gemma":0.000007323958,"teacher_disagreement_score":0.97766924,"about_ca_system_score_codex":0.000084659696,"about_ca_system_score_gemma":0.00011816416,"threshold_uncertainty_score":0.99999326},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005479607,0.00040540067,0.9910123,0.00006634792,0.00088083645,0.00070539926,0.00016721847,0.0009958588,0.00028704267],"genre_scores_gemma":[0.9943945,0.00097569067,0.0026189587,0.00028240253,0.00032779854,0.00028301304,0.001005873,0.000051307998,0.000060452607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981051,0.000048795966,0.0006740685,0.00035031818,0.00025144688,0.0005702689],"domain_scores_gemma":[0.9990859,0.00014324149,0.0001241968,0.0003772625,0.00011269704,0.00015669005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005171155,0.00032378605,0.00034657057,0.0002162255,0.00047535298,0.0002404678,0.00026288838,0.00035243382,0.0000329741],"category_scores_gemma":[0.0000044540993,0.0003186383,0.00009562908,0.0006588571,0.000090885325,0.003091503,0.000008268887,0.0005521892,0.0000128337],"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.00012135627,0.000027985654,0.0000066549965,0.00016242565,0.00006569938,4.1387904e-7,0.00022606393,0.8332142,0.000006739536,0.0000082576835,0.002763308,0.16339688],"study_design_scores_gemma":[0.00085958646,0.00012047028,0.00020584681,0.00009554257,0.000080164034,0.000017960181,0.00010549147,0.9881387,0.000024523948,0.000051509385,0.009991403,0.00030881015],"about_ca_topic_score_codex":0.0000046219375,"about_ca_topic_score_gemma":0.000010181576,"teacher_disagreement_score":0.9889149,"about_ca_system_score_codex":0.00011194397,"about_ca_system_score_gemma":0.00004648202,"threshold_uncertainty_score":0.99992657},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034553983,0.00044768763,0.9975997,0.0001349091,0.00041357218,0.00013669035,0.000008351881,0.00036117187,0.0005523481],"genre_scores_gemma":[0.9902288,0.00021309844,0.008687124,0.0006516062,0.000042043,0.00004470661,0.00002409374,0.0000091470965,0.000099382356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906313,0.000036809128,0.00030174505,0.00018926208,0.00022127185,0.00018779683],"domain_scores_gemma":[0.99962795,0.000043936183,0.00007284187,0.00011214554,0.00006482781,0.00007830364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025957517,0.00015222064,0.00010197972,0.00025471463,0.00037876825,0.00094563153,0.00015149223,0.00009901779,0.000043969474],"category_scores_gemma":[9.3182643e-7,0.00013425946,0.000055928664,0.0008142061,0.00005117501,0.0074304654,0.0000022877266,0.00022450152,0.00001539593],"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.000009635669,0.000020562757,6.31103e-7,0.00005335645,0.000013665898,3.6365594e-7,0.0005109928,0.66488236,0.00002453125,0.003096517,0.0003033376,0.33108404],"study_design_scores_gemma":[0.00015822002,0.000058644022,0.000005285205,0.000109803834,0.000014634642,0.000010351669,0.000024331324,0.995424,0.0011069936,0.0016052849,0.0013132301,0.00016923908],"about_ca_topic_score_codex":0.0000023961652,"about_ca_topic_score_gemma":1.6029587e-7,"teacher_disagreement_score":0.98988324,"about_ca_system_score_codex":0.000021238335,"about_ca_system_score_gemma":0.0000338099,"threshold_uncertainty_score":0.91187465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095878367,0.0000074674426,0.9963338,0.00042255895,0.000114485316,0.00040121353,0.000016924776,0.00025356602,0.0014912434],"genre_scores_gemma":[0.9550873,0.0000068082322,0.040977903,0.003684736,0.0000100157085,0.000097651246,0.00006774326,0.0000067686055,0.00006109057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985475,0.00006420802,0.00044520065,0.00028537697,0.00035900628,0.00029873545],"domain_scores_gemma":[0.9992,0.000051198494,0.00008098518,0.0002543416,0.00019268967,0.00022082741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063369,0.00021119801,0.0002015644,0.00039078883,0.00050753605,0.000508986,0.00034113467,0.00014248001,0.000023724737],"category_scores_gemma":[0.0000025582594,0.00018716817,0.000069957925,0.0011909243,0.00006391365,0.0026393544,0.000002063395,0.00031899838,0.0000054425823],"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.0001592007,0.00022683958,0.0000056029126,0.000045322045,0.000014281504,2.9160165e-7,0.00029789706,0.9420684,0.000025655947,0.0059898184,0.0001072312,0.051059455],"study_design_scores_gemma":[0.0009310763,0.0002485272,0.00020065632,0.000098721415,0.000014759419,0.0000011706511,0.000037133006,0.99678236,0.0006149361,0.00014618311,0.00071341096,0.00021108135],"about_ca_topic_score_codex":0.0000057044354,"about_ca_topic_score_gemma":0.0000013784073,"teacher_disagreement_score":0.9553559,"about_ca_system_score_codex":0.00004247407,"about_ca_system_score_gemma":0.00017072688,"threshold_uncertainty_score":0.7632497},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900585,0.00060273457,0.9292279,0.000008112956,0.00043937258,0.0001985702,0.000006966672,0.00012442886,0.0003860836],"genre_scores_gemma":[0.9993344,0.00019731808,0.00015424028,0.00017691434,0.000019552903,0.00001806358,0.0000055598553,0.000007900766,0.000086057975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999149,0.00001547193,0.0004463745,0.000094778436,0.00012324483,0.00017109246],"domain_scores_gemma":[0.99968195,0.000037155016,0.00008862552,0.000082975246,0.00006058155,0.00004871669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090211244,0.0001512949,0.00018295765,0.00012660191,0.00017256383,0.00005802544,0.000059735692,0.00007607043,0.000004215487],"category_scores_gemma":[0.0000010693474,0.00014067328,0.00004606026,0.00018151606,0.00003351254,0.0005659993,0.0000019347194,0.00019388573,0.0000017131309],"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.000040852407,0.000020721822,0.00000768937,0.0002558587,0.00002595214,6.224538e-7,0.00013368062,0.916825,0.00036134184,0.000010826375,0.000034945053,0.0822825],"study_design_scores_gemma":[0.00056471454,0.000044171367,0.00006370972,0.00040008174,0.000021337488,0.0000037383923,0.00008482112,0.97974306,0.017351154,0.0000020083544,0.0015885247,0.00013267182],"about_ca_topic_score_codex":0.0000017199654,"about_ca_topic_score_gemma":6.8166315e-7,"teacher_disagreement_score":0.93032855,"about_ca_system_score_codex":0.00003747422,"about_ca_system_score_gemma":0.000014196652,"threshold_uncertainty_score":0.573649},"labels":[],"label_agreement":null}]}