{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Jianping He","is_ca":false},{"name":"Lin Cai","is_ca":true},{"name":"Chengcheng Zhao","is_ca":false},{"name":"Peng Cheng","is_ca":false},{"name":"Xinping Guan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005505085,0.001029308,0.001550762,0.001234637,0.001171879,0.002609933,0.002640171,0.002187013,0.001619041],"category_scores_gemma":[0.01911201,0.0006790371,0.001294706,0.002161083,0.002269688,0.004365453,0.003047774,0.002756597,0.0004745466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002399151,"about_ca_system_score_gemma":0.002843805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001472345,"about_ca_topic_score_gemma":0.0007330924,"domain_scores_codex":[0.9941862,0.002257922,0.0003125323,0.001399544,0.001441813,0.000401926],"domain_scores_gemma":[0.9916414,0.004635348,0.0008320769,0.001301602,0.001359908,0.0002295801],"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.000170682,0.0000813542,0.001096264,0.0002136642,0.0001165894,0.0001790835,0.0002920133,0.6372231,0.005205425,0.2723401,0.002690494,0.08039121],"study_design_scores_gemma":[0.00001112875,0.00004932423,0.00007800793,0.00001288839,0.00001206964,0.00007321936,0.00002453131,0.9248508,0.00158485,0.07230879,0.0009790818,0.00001532933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002191632,0.0001661704,0.9964316,0.0002397255,0.00001786403,0.00003514863,0.00002638755,0.00006977208,0.0008218047],"genre_scores_gemma":[0.661424,0.001666381,0.3314654,0.0003914655,0.0002722131,0.0006013681,0.0002673854,0.000120404,0.003791382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005505085,"threshold_uncertainty_score":0.02911401,"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","authors":[{"name":"Abdallah Farraj","is_ca":true},{"name":"Eman Hammad","is_ca":true},{"name":"Deepa Kundur","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194757,0.0004943412,0.0003292939,0.00025351,0.000398107,0.000736037,0.0009362604,0.0005229578,0.002118056],"category_scores_gemma":[0.0007246154,0.0001283483,0.000350475,0.0002446369,0.0007706907,0.001165427,0.0007198883,0.001307681,0.0003594245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004669818,"about_ca_system_score_gemma":0.0005614646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009216338,"about_ca_topic_score_gemma":0.0009484442,"domain_scores_codex":[0.9996116,0.00007068514,0.0000254158,0.0001203753,0.0001443849,0.00002756671],"domain_scores_gemma":[0.9997151,0.00007104946,0.00003876979,0.00007136347,0.00008408872,0.00001956433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002203734,0.0002444421,0.0006390061,0.0003491864,0.000107517,0.000323188,0.0004788302,0.2531914,0.07194676,0.4180963,0.006455075,0.247948],"study_design_scores_gemma":[0.00009305911,0.0002722475,0.0002330792,0.00003082071,0.00004051085,0.0001575921,0.00005613347,0.8930448,0.01056056,0.06988011,0.02560348,0.00002767172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003563569,0.0002400286,0.9907748,0.0002720493,0.0001392307,0.00004389313,0.00001608139,0.0003615618,0.004588801],"genre_scores_gemma":[0.8114017,0.0006420965,0.180153,0.0005557009,0.0003358932,0.0002861431,0.00007848033,0.00005815667,0.006488752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002118056,"threshold_uncertainty_score":0.007085562,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401477,0.00050636,0.0004760762,0.0004639808,0.0004622287,0.001043773,0.0008396055,0.0006101566,0.0007966449],"category_scores_gemma":[0.003213458,0.000169567,0.0002653965,0.0004049885,0.0007231251,0.002067497,0.001932612,0.0006749765,0.0003740581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006104923,"about_ca_system_score_gemma":0.0004662652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004013245,"about_ca_topic_score_gemma":0.0004667121,"domain_scores_codex":[0.9988077,0.0003322022,0.0001118326,0.0001688871,0.0004686907,0.0001107692],"domain_scores_gemma":[0.9986186,0.0003051619,0.0001558265,0.0004699603,0.0004106418,0.00003991516],"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.0007780433,0.0002041695,0.007778723,0.0003545575,0.00009070662,0.0008463476,0.0003583758,0.1525708,0.2577321,0.09327,0.002046153,0.4839699],"study_design_scores_gemma":[0.00002555821,0.0002651478,0.001353058,0.00004726173,0.00005394675,0.001036586,0.00006681284,0.8714637,0.1031817,0.01210199,0.01035817,0.00004615507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0571037,0.0005642378,0.9347679,0.0002882194,0.0001080183,0.00008663874,0.00002580237,0.0006633533,0.00639214],"genre_scores_gemma":[0.9102971,0.0002717647,0.08789832,0.0001377787,0.00003072869,0.00003047958,0.00003851071,0.00001986796,0.001275484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001401477,"threshold_uncertainty_score":0.007411838,"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","authors":[{"name":"Shanglin Li","is_ca":false},{"name":"Yangzhou Chen","is_ca":false},{"name":"Peter Liu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629521,0.0005626699,0.000551611,0.0002280396,0.000351376,0.0006480437,0.0006880872,0.0006635098,0.0005638201],"category_scores_gemma":[0.001265081,0.0001908299,0.0004378619,0.0002695614,0.0004658326,0.0007676961,0.0006519271,0.0005400947,0.00006247669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004558285,"about_ca_system_score_gemma":0.0006352136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002920198,"about_ca_topic_score_gemma":0.00139506,"domain_scores_codex":[0.999674,0.00006367367,0.00002616609,0.0001015848,0.00008905122,0.00004551364],"domain_scores_gemma":[0.9995617,0.0001783652,0.0001272018,0.0000362241,0.00007652219,0.00001988718],"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.0001555816,0.0000424903,0.0008849782,0.0001816222,0.00004688813,0.0003728885,0.0002354743,0.9196033,0.01573887,0.01683689,0.0003582633,0.04554259],"study_design_scores_gemma":[0.000007503412,0.00005141965,0.0001240149,0.000003275054,0.000005994177,0.00002138498,0.0000101477,0.9972887,0.001043164,0.001285537,0.0001545389,0.000004340091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03441472,0.0001844725,0.9641538,0.00008824802,0.00002855161,0.0000282484,0.00001280597,0.0001026677,0.0009864914],"genre_scores_gemma":[0.979732,0.0001556909,0.01915182,0.00002696265,0.00001483958,0.00004924517,0.00002184033,0.000005557841,0.0008421064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002920198,"threshold_uncertainty_score":0.005806446,"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","authors":[{"name":"Arash Mohammadi","is_ca":true},{"name":"Konstantinos N. Plataniotis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037813,0.0007511313,0.0009816118,0.0003726746,0.0002472237,0.0006688795,0.001012437,0.0009586681,0.0007160771],"category_scores_gemma":[0.003839065,0.0003385331,0.000525786,0.0007704668,0.0006343896,0.001145504,0.00101638,0.001390129,0.00027019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000478295,"about_ca_system_score_gemma":0.000513027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001970289,"about_ca_topic_score_gemma":0.001710505,"domain_scores_codex":[0.9992223,0.0002654877,0.00003533519,0.0002381624,0.0001930903,0.00004558093],"domain_scores_gemma":[0.9988608,0.0006920981,0.0001384782,0.0001279992,0.0001598553,0.00002084394],"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.00005418419,0.00003423036,0.0006969908,0.00009366209,0.00009259985,0.00007942883,0.00007257538,0.8734532,0.004941721,0.0236534,0.0005848752,0.09624306],"study_design_scores_gemma":[0.000005505451,0.00001866179,0.00007740585,0.000002853124,0.000005693282,0.00001801845,0.000004986279,0.9948916,0.0005626836,0.004024896,0.0003824338,0.000005207427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003101515,0.0001801158,0.9962035,0.00007292537,0.00001827285,0.000008325538,0.000007688255,0.00007206297,0.0003355882],"genre_scores_gemma":[0.7254794,0.0009551121,0.2690373,0.0001806213,0.0001748586,0.0001194684,0.0001257556,0.00004911291,0.003878349],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001970289,"threshold_uncertainty_score":0.005488515,"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","authors":[{"name":"Jiachen Liu","is_ca":true},{"name":"Fabrice Labeau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761481,0.0005102555,0.0005224966,0.0005033284,0.0002484138,0.0005156155,0.0006225532,0.0005494441,0.0002888013],"category_scores_gemma":[0.01223539,0.0002125126,0.0002205287,0.000393554,0.001348051,0.001507343,0.001239421,0.0008167925,0.00006893252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005428458,"about_ca_system_score_gemma":0.0006086427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000727988,"about_ca_topic_score_gemma":0.000673913,"domain_scores_codex":[0.9988863,0.000404415,0.00004480799,0.0001112183,0.0004617503,0.00009154029],"domain_scores_gemma":[0.9918599,0.005604566,0.001159002,0.0007053452,0.0005330256,0.0001382804],"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.0004758332,0.00008682366,0.004401644,0.0001274949,0.00004842952,0.0002921835,0.0002459362,0.8661197,0.02977575,0.02592251,0.0005475193,0.07195613],"study_design_scores_gemma":[0.000003715982,0.00003110959,0.0002009405,0.000004250363,0.000002562042,0.00004154769,0.00001086807,0.9942946,0.003370727,0.001967579,0.000067647,0.000004406375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1290279,0.000176103,0.8686866,0.0002885273,0.00002748583,0.0000454399,0.00002782617,0.0002544781,0.001465655],"genre_scores_gemma":[0.9539506,0.0001208272,0.04552802,0.00005098154,0.00001563906,0.00002655287,0.00002748276,0.000009644274,0.0002701627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001761481,"threshold_uncertainty_score":0.009315729,"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","authors":[{"name":"Syamantak Datta Gupta","is_ca":true},{"name":"Mark Coates","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003253068,0.0008323903,0.0007220002,0.0007009893,0.0007836086,0.0009793713,0.001082841,0.001301687,0.0007416116],"category_scores_gemma":[0.01593545,0.0004426852,0.0004913711,0.0005087294,0.001587657,0.00180048,0.001472428,0.000896689,0.0001632006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001278536,"about_ca_system_score_gemma":0.0009095741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006388829,"about_ca_topic_score_gemma":0.003462375,"domain_scores_codex":[0.9988804,0.0003304187,0.00006005963,0.0001686895,0.0004416342,0.0001187968],"domain_scores_gemma":[0.9913338,0.006318468,0.0008312668,0.0004682891,0.0009111831,0.0001370205],"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.0001372338,0.00001323444,0.000714559,0.00005504399,0.0000329971,0.0001027612,0.0001099941,0.9641508,0.002122305,0.02318915,0.0003876842,0.008984199],"study_design_scores_gemma":[0.000008487964,0.00002246348,0.00009534528,0.000003287751,0.0000056433,0.00001094697,0.000009806608,0.9932494,0.0007026587,0.005712057,0.0001744486,0.000005474225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05222997,0.0003384549,0.9442392,0.0003291073,0.00007648701,0.00002885526,0.00003659398,0.0002704935,0.002450777],"genre_scores_gemma":[0.9558139,0.0002347892,0.04143646,0.0001147328,0.00006381359,0.00006821597,0.00004673018,0.00005865204,0.002162719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006388829,"threshold_uncertainty_score":0.01720411,"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)","authors":[{"name":"Jun Ye Yu","is_ca":true},{"name":"Mark Coates","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006516612,0.000600682,0.0005925535,0.0006469733,0.0003965516,0.0007591875,0.00106453,0.001170733,0.002138072],"category_scores_gemma":[0.003909714,0.0002703077,0.0004027902,0.0008668094,0.0007079388,0.001365993,0.001004437,0.001144266,0.0006175381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000802641,"about_ca_system_score_gemma":0.0009121851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003169301,"about_ca_topic_score_gemma":0.003334797,"domain_scores_codex":[0.9995059,0.00009852192,0.00002176584,0.00009341756,0.0002455736,0.00003484041],"domain_scores_gemma":[0.9986229,0.000713215,0.000104531,0.0002399719,0.0002755304,0.00004382868],"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.0001974028,0.00006067624,0.0006188073,0.0001277215,0.00004741274,0.0001526677,0.00009925885,0.693564,0.01415,0.0696281,0.005065538,0.2162884],"study_design_scores_gemma":[0.00001930443,0.00003005254,0.0001419423,0.000006749919,0.000005684814,0.00005589311,0.00001118406,0.9791566,0.003169621,0.0154513,0.001943188,0.000008588851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004898897,0.0001300784,0.9930789,0.0002024816,0.00005736103,0.00002245838,0.00003807715,0.0003145511,0.001257178],"genre_scores_gemma":[0.4707763,0.0005696186,0.5222436,0.0003714509,0.0001658921,0.0001933008,0.0003380799,0.0001730496,0.005168607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003169301,"threshold_uncertainty_score":0.007152557,"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","authors":[{"name":"Shohreh Shaghaghian","is_ca":true},{"name":"Mark Coates","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002589825,0.0006877093,0.001002634,0.0009321998,0.0006824008,0.000872891,0.001611663,0.0008938974,0.0006186447],"category_scores_gemma":[0.01391842,0.0006319092,0.0003884546,0.0009205855,0.000975666,0.001772871,0.000996368,0.0007201058,0.000136424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346964,"about_ca_system_score_gemma":0.001242752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005668032,"about_ca_topic_score_gemma":0.003927225,"domain_scores_codex":[0.9990729,0.0003710158,0.00005286927,0.0002141683,0.0001835133,0.0001054594],"domain_scores_gemma":[0.9926093,0.00554347,0.001030427,0.0003512935,0.0003429798,0.0001225216],"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.00005441708,0.00002002372,0.0007471645,0.00002940745,0.0000118268,0.00004609953,0.00005248679,0.9820799,0.0007155853,0.005190731,0.0002127092,0.01083975],"study_design_scores_gemma":[0.000006667396,0.00001056994,0.0001167962,0.000002125803,0.000002637569,0.00001577144,0.00001482042,0.9940843,0.0003433342,0.005286918,0.000111256,0.000004892059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09637117,0.0002674549,0.9016199,0.0002038127,0.00001943551,0.00006249925,0.0001129463,0.0002853544,0.001057426],"genre_scores_gemma":[0.9137611,0.0001647536,0.08497398,0.00004126711,0.00002017016,0.00008732965,0.0001396592,0.00003737678,0.0007744084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005668032,"threshold_uncertainty_score":0.01369643,"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","authors":[{"name":"Jingyuan Liu","is_ca":true},{"name":"Pirathayini Srikantha","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000475531,0.0002738083,0.0004433235,0.0003358079,0.0004068088,0.0005873422,0.000532974,0.0004083346,0.0006560427],"category_scores_gemma":[0.001653346,0.0002200408,0.0001946781,0.0003714835,0.0005420235,0.0006719323,0.0005225786,0.0003575392,0.0001151347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006503466,"about_ca_system_score_gemma":0.0004302541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014509,"about_ca_topic_score_gemma":0.00163111,"domain_scores_codex":[0.9996676,0.0001564819,0.00001102282,0.00006410954,0.00005977308,0.0000409953],"domain_scores_gemma":[0.9994044,0.0002910948,0.0001151086,0.00007875229,0.00006084826,0.00004980795],"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.00003577802,0.00001459703,0.0003348067,0.00001906208,0.000007469531,0.00005571316,0.00003654779,0.9682149,0.002145515,0.008845929,0.0003023079,0.01998747],"study_design_scores_gemma":[0.000006155074,0.0000130419,0.00008831864,0.000001181428,0.000001124977,0.00001957245,0.000008712256,0.995262,0.0002768313,0.004022015,0.0002991077,0.00000172753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09282862,0.0002625011,0.901406,0.0002434144,0.00003774859,0.00007061828,0.00004235256,0.000308168,0.004800553],"genre_scores_gemma":[0.964901,0.00009430892,0.03367584,0.00002668371,0.00001219102,0.00005183522,0.00003181037,0.00001647376,0.001189771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0014509,"threshold_uncertainty_score":0.004718602,"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","authors":[{"name":"Aida Nowzari","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009847066,0.004091935,0.002698262,0.003849435,0.002124215,0.004488655,0.005191126,0.002717365,0.01193708],"category_scores_gemma":[0.05834697,0.001466706,0.002412111,0.003641252,0.0038322,0.01333276,0.006528497,0.0100293,0.003969864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00604663,"about_ca_system_score_gemma":0.002694894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00382798,"about_ca_topic_score_gemma":0.003340211,"domain_scores_codex":[0.9917208,0.002305361,0.000345637,0.001621601,0.002839807,0.001166741],"domain_scores_gemma":[0.9639741,0.02527708,0.002101147,0.003394391,0.004276846,0.0009763573],"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.0004571838,0.0001037987,0.0007489999,0.000573971,0.0001476056,0.0001895571,0.0005540042,0.4802736,0.003810027,0.4498911,0.01433267,0.0489176],"study_design_scores_gemma":[0.00003238827,0.00008472947,0.0002477158,0.0001124121,0.0000544913,0.0000734444,0.00007030478,0.7475561,0.00132408,0.2442763,0.006127989,0.0000399444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008266483,0.004351522,0.9634436,0.001622365,0.0005019107,0.00009680188,0.0003075296,0.0009848335,0.02042489],"genre_scores_gemma":[0.6515458,0.01176253,0.2985013,0.002599757,0.002400164,0.001763167,0.001500014,0.002411339,0.02751595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193708,"threshold_uncertainty_score":0.05207688,"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","authors":[{"name":"Peter He","is_ca":true},{"name":"Lian Zhao","is_ca":true},{"name":"Bala Venkatesh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007578055,0.0009947176,0.001335019,0.0003780365,0.0003700199,0.00155433,0.0008421182,0.001050182,0.003970076],"category_scores_gemma":[0.001144425,0.0005099718,0.0004981485,0.0008509633,0.0007293921,0.0009954529,0.0009980482,0.0009291423,0.000357603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009845532,"about_ca_system_score_gemma":0.0008349367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003061643,"about_ca_topic_score_gemma":0.002609336,"domain_scores_codex":[0.9995851,0.0001467114,0.00001643223,0.0000983072,0.00006045906,0.00009305718],"domain_scores_gemma":[0.9994895,0.0003418444,0.00005593766,0.00001980995,0.00006361593,0.00002921741],"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.000150184,0.00005547332,0.0004478799,0.000178324,0.00004425229,0.0001959397,0.00007026656,0.957553,0.002423317,0.01934921,0.002170881,0.01736111],"study_design_scores_gemma":[0.00001153111,0.00002278109,0.00006034958,0.000005942768,0.0000065794,0.00002065351,0.00001721801,0.9953799,0.0001862141,0.003981357,0.0003033038,0.000004175549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05400592,0.001495625,0.9284067,0.0007722814,0.00009687942,0.0001067579,0.000200966,0.0002506095,0.01466429],"genre_scores_gemma":[0.9463683,0.0006722073,0.04631121,0.00018123,0.00005637361,0.00015768,0.0001083715,0.00006315881,0.006081421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003970076,"threshold_uncertainty_score":0.01328129,"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","authors":[{"name":"Omid Namvar Gharehshiran","is_ca":true},{"name":"William Hoiles","is_ca":true},{"name":"Vikram Krishnamurthy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905783,0.0006234834,0.001043042,0.0009860176,0.0006578335,0.001440666,0.00199475,0.00147688,0.0009338809],"category_scores_gemma":[0.01287108,0.0005016938,0.0008485189,0.0004745819,0.002761589,0.002680974,0.001608371,0.00129956,0.0001244738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001125716,"about_ca_system_score_gemma":0.0009398253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001964828,"about_ca_topic_score_gemma":0.001115593,"domain_scores_codex":[0.9987035,0.0006088064,0.00005586255,0.0003003111,0.0002241671,0.0001073819],"domain_scores_gemma":[0.991556,0.006214844,0.001017832,0.000423862,0.000377826,0.000409588],"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.0001105477,0.00008482187,0.005072581,0.0001223971,0.0001480092,0.0002004981,0.0003286228,0.7657087,0.004342242,0.2028147,0.0005641218,0.02050265],"study_design_scores_gemma":[0.000005866545,0.00002581258,0.0003632223,0.000005199786,0.000007361166,0.00002686414,0.00003217271,0.9674878,0.0003857042,0.03149986,0.0001509426,0.000009247371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07163519,0.0001303325,0.9259179,0.0004324644,0.00001692776,0.00005961999,0.00003019847,0.00006051389,0.001716777],"genre_scores_gemma":[0.9060454,0.0001521769,0.09241301,0.0001053586,0.00003750627,0.00009990612,0.00004126913,0.00002023338,0.001085148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002905783,"threshold_uncertainty_score":0.01536745,"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","authors":[{"name":"Haider Al-Lawati","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003639549,0.0009505253,0.0008444183,0.001127168,0.0006366486,0.001227627,0.001313345,0.0009536989,0.002957312],"category_scores_gemma":[0.0169108,0.0004654659,0.0008139919,0.000665834,0.002137317,0.00226202,0.001689748,0.002043007,0.0005323513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569633,"about_ca_system_score_gemma":0.001188743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002945786,"about_ca_topic_score_gemma":0.001655265,"domain_scores_codex":[0.9986064,0.0004827726,0.00007666575,0.0002249857,0.0004225162,0.0001866843],"domain_scores_gemma":[0.9901655,0.006696102,0.0009677518,0.0006757021,0.001182672,0.000312148],"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.0001294155,0.00003242242,0.001209268,0.0001099171,0.00004837694,0.0001235327,0.0001606146,0.7872075,0.003375772,0.1977115,0.001118108,0.008773617],"study_design_scores_gemma":[0.000003704062,0.000009209405,0.00008921709,0.000005124662,0.000003312658,0.000006162393,0.000005336627,0.9785751,0.0002971612,0.02078158,0.0002201535,0.000003963735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04189848,0.0007779889,0.9506729,0.0005533014,0.00006691147,0.00004723464,0.00007513844,0.0003017905,0.005606279],"genre_scores_gemma":[0.9217581,0.0009685589,0.06705802,0.0003307563,0.0001186689,0.0002307345,0.0001368866,0.0003716759,0.009026572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003639549,"threshold_uncertainty_score":0.01924801,"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","authors":[{"name":"Konstantinos I. Tsianos","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240753,0.001303753,0.001697373,0.0004890192,0.0005151017,0.001062025,0.001825557,0.001341965,0.001315953],"category_scores_gemma":[0.00780877,0.0006118002,0.0007281309,0.0009369004,0.001384692,0.001844206,0.001613243,0.001794368,0.0003034249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193296,"about_ca_system_score_gemma":0.001528721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005353032,"about_ca_topic_score_gemma":0.004121738,"domain_scores_codex":[0.9983699,0.0006275483,0.00006320608,0.0003312491,0.0004414282,0.0001667027],"domain_scores_gemma":[0.995568,0.003225637,0.000373069,0.0003685514,0.0003541736,0.0001106614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006188647,0.00003500192,0.0002680533,0.00005451887,0.00004173188,0.00003639023,0.00003287882,0.9597551,0.0006798037,0.02206562,0.0008442288,0.01612462],"study_design_scores_gemma":[0.000003847093,0.000007492296,0.00001612269,0.000001050529,0.000001600445,0.000002483664,0.000001288884,0.9954058,0.00008038693,0.004396841,0.0000815638,0.000001538839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007418585,0.0002624251,0.9906926,0.0002386149,0.00004066491,0.00002258716,0.00002743277,0.0002480621,0.001049081],"genre_scores_gemma":[0.7384594,0.0005299973,0.2555625,0.0003433059,0.000282136,0.0003155417,0.0002192227,0.0002211037,0.004066763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005353032,"threshold_uncertainty_score":0.01185036,"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","authors":[{"name":"Muhammad Uzair","is_ca":true},{"name":"R.D. Dony","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157844,0.0007249533,0.000484975,0.0005291866,0.0002914048,0.0008127038,0.001357769,0.0007013101,0.001004453],"category_scores_gemma":[0.002100655,0.0002424979,0.0005241233,0.0003744929,0.0004194705,0.001049674,0.0003516263,0.0008020935,0.0005111482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009437209,"about_ca_system_score_gemma":0.0007430373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006463603,"about_ca_topic_score_gemma":0.005681631,"domain_scores_codex":[0.9994137,0.000111507,0.00002862052,0.00009786998,0.0003127187,0.00003557352],"domain_scores_gemma":[0.9993953,0.0002089902,0.00009784764,0.00007232682,0.0002151549,0.00001040388],"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.0002204762,0.00006006173,0.0008404681,0.0002575022,0.00004734322,0.000222909,0.0001079626,0.8106167,0.02611335,0.02125061,0.001417994,0.1388446],"study_design_scores_gemma":[0.000002777163,0.00003005381,0.0001759481,0.000006972087,0.00000719829,0.0000908337,0.000005132586,0.9928921,0.005208123,0.0006281057,0.0009442733,0.000008443324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005249658,0.0005200071,0.9926859,0.00004572584,0.00004150873,0.00003322557,0.00002419821,0.0001626318,0.001237152],"genre_scores_gemma":[0.5802913,0.002562504,0.407496,0.0001115404,0.00008412307,0.0001451797,0.0003492412,0.0001973821,0.008762684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006463603,"threshold_uncertainty_score":0.01285201,"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)","authors":[{"name":"Arash Mohammadi","is_ca":true},{"name":"Vincenzo Piuri","is_ca":false},{"name":"Konstantinos N. Plataniotis","is_ca":true},{"name":"Patrizio Campisi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002559031,0.002136219,0.001688513,0.001863544,0.001607049,0.005176861,0.002091353,0.00798069,0.01390131],"category_scores_gemma":[0.009489312,0.0005298271,0.001294412,0.0007292385,0.001752223,0.003186193,0.001073107,0.01217942,0.009413038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242046,"about_ca_system_score_gemma":0.0009643009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002950283,"about_ca_topic_score_gemma":0.00051989,"domain_scores_codex":[0.9979659,0.00023219,0.0002121654,0.0003260578,0.001102869,0.0001609525],"domain_scores_gemma":[0.991248,0.003523113,0.0004778685,0.0002604643,0.003260426,0.001230068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005180673,0.00001847258,0.00003247704,0.0002863462,0.00001671623,0.0003141972,0.00001776165,0.0001008251,0.0002036815,0.002078881,0.9824687,0.01441006],"study_design_scores_gemma":[0.0000292424,0.00004182178,0.0001157545,0.0002041689,0.00002023779,0.0005856036,0.00001948125,0.0003812755,0.0002420919,0.002248626,0.9960985,0.00001316957],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00008661835,0.009739613,0.0007466758,0.0252534,0.9607147,0.00001527593,0.00003763497,0.00007318761,0.003332867],"genre_scores_gemma":[0.0009098561,0.005984558,0.0001627349,0.005309032,0.9800949,0.0000101444,0.00001865561,0.00003279107,0.00747726],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.01390131,"threshold_uncertainty_score":0.04650456,"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","authors":[{"name":"Matin Macktoobian","is_ca":true},{"name":"Zhan Shu","is_ca":true},{"name":"Qing Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227352,0.0007651581,0.001052555,0.0009503691,0.000396258,0.0009515233,0.001991433,0.00115063,0.0009626985],"category_scores_gemma":[0.004451168,0.0004942013,0.0006779262,0.0007606061,0.0008058199,0.001515455,0.0007912695,0.001288336,0.0002029167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207274,"about_ca_system_score_gemma":0.0008681741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005873084,"about_ca_topic_score_gemma":0.004296396,"domain_scores_codex":[0.9995884,0.0001002057,0.00002173652,0.0001120901,0.0001167054,0.00006098414],"domain_scores_gemma":[0.9974458,0.001546964,0.0003923688,0.0001630589,0.0003370893,0.0001147119],"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.00001942049,0.00001530359,0.0003742351,0.00001055306,0.000008806938,0.00001424245,0.00001196109,0.9912364,0.0002397224,0.001847513,0.00009597391,0.006125904],"study_design_scores_gemma":[7.593604e-7,0.000004432803,0.00004259122,9.600662e-7,0.000001509493,0.000002758384,0.000001931106,0.9984654,0.00006788076,0.001388668,0.0000217476,0.000001379695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04683381,0.0002713165,0.9510113,0.0004799708,0.00003040907,0.00004009972,0.0001121903,0.0003063309,0.0009144816],"genre_scores_gemma":[0.9607695,0.0002398772,0.03707752,0.00007736699,0.00005043506,0.00008461327,0.0002029746,0.00004865432,0.001449206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005873084,"threshold_uncertainty_score":0.0116778,"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","authors":[{"name":"Xin Gong","is_ca":false},{"name":"Yang Cao","is_ca":false},{"name":"Xiuxian Li","is_ca":false},{"name":"Hong Lin","is_ca":false},{"name":"Zhan Shu","is_ca":true},{"name":"Guanghui Wen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426651,0.0007620419,0.0008307473,0.0005384212,0.0005910064,0.001576365,0.001208859,0.0007511496,0.000756435],"category_scores_gemma":[0.007234445,0.0002538162,0.0005136029,0.0003978839,0.001282781,0.002039292,0.002314185,0.0009616096,0.0001876474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007463383,"about_ca_system_score_gemma":0.0006458311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009718636,"about_ca_topic_score_gemma":0.0004464339,"domain_scores_codex":[0.9985781,0.0003815199,0.00008511935,0.0003615704,0.0004233835,0.0001702475],"domain_scores_gemma":[0.9968908,0.001274017,0.0007808371,0.0005532654,0.0003803123,0.0001207619],"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.0003002459,0.00004273594,0.001893279,0.0001418124,0.0000965775,0.0003078254,0.0003136039,0.8587179,0.02150337,0.06649048,0.0004569065,0.04973524],"study_design_scores_gemma":[0.000007765469,0.00004328736,0.0001386076,0.000004868259,0.00001281411,0.00003592528,0.0000221917,0.9879347,0.004974658,0.006423532,0.0003961564,0.000005516949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04132533,0.0001118421,0.9572406,0.00008783009,0.00001734776,0.00002673017,0.00001491049,0.0002231989,0.0009520956],"genre_scores_gemma":[0.9654918,0.0001007489,0.03366955,0.00002897002,0.0000207054,0.00003755495,0.00002778675,0.00002374369,0.0005990664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001576365,"threshold_uncertainty_score":0.007544935,"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","authors":[{"name":"Xiaoyu Miao","is_ca":false},{"name":"Aimin Jiang","is_ca":false},{"name":"Tao Liu","is_ca":false},{"name":"Yanping Zhu","is_ca":false},{"name":"Hon Keung Kwan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002139003,0.001373551,0.001186311,0.001131221,0.0003639549,0.00116195,0.001748077,0.001200151,0.001935711],"category_scores_gemma":[0.009443945,0.0005485684,0.001034038,0.001811688,0.001237827,0.002155427,0.001242979,0.002326764,0.001254356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001043775,"about_ca_system_score_gemma":0.0009575402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005321549,"about_ca_topic_score_gemma":0.004399319,"domain_scores_codex":[0.9987381,0.0005391567,0.00004760785,0.000342143,0.0002422303,0.00009070365],"domain_scores_gemma":[0.9970884,0.001691082,0.0002884642,0.0004512685,0.0004141328,0.00006675543],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001018586,0.00005484702,0.001087585,0.0001386305,0.0001012792,0.00008970842,0.00008161722,0.7943211,0.004531804,0.04012924,0.002977788,0.1563844],"study_design_scores_gemma":[0.000002883926,0.000008455588,0.0001173838,0.00000399259,0.00000397317,0.00001568318,0.000005165501,0.9911013,0.0005054271,0.007681194,0.0005490606,0.000005620295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001903692,0.0001468274,0.9973348,0.00005398977,0.00001124655,0.00001119357,0.00002596804,0.0003286993,0.0001835984],"genre_scores_gemma":[0.3550346,0.001512643,0.6363197,0.0002573686,0.0001437342,0.0001989702,0.0008292483,0.0006826335,0.005021035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005321549,"threshold_uncertainty_score":0.01131225,"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","authors":[{"name":"Aimin Jiang","is_ca":false},{"name":"Xintong Shi","is_ca":false},{"name":"Yibin Tang","is_ca":false},{"name":"Yanping Zhu","is_ca":false},{"name":"Hon Keung Kwan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162087,0.001331758,0.00104174,0.001202499,0.0005113345,0.001026745,0.001041613,0.001280037,0.003609509],"category_scores_gemma":[0.004152608,0.0006479893,0.0008955409,0.00139764,0.0009862582,0.001673995,0.001243635,0.001691741,0.001296743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008341685,"about_ca_system_score_gemma":0.001113936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003338236,"about_ca_topic_score_gemma":0.004073771,"domain_scores_codex":[0.9992544,0.0003178089,0.00002337442,0.000163866,0.0001736262,0.0000668245],"domain_scores_gemma":[0.9986418,0.000847221,0.0001203305,0.000152145,0.0001736363,0.00006477427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001049552,0.00008227942,0.0005287398,0.0001451787,0.00007414974,0.0001241019,0.0001019109,0.8296953,0.005108614,0.06857528,0.007220619,0.08823884],"study_design_scores_gemma":[0.00000613069,0.000009804983,0.00004400529,0.000004148027,0.000003350581,0.00001593748,0.00001189806,0.9807141,0.0003098612,0.0181601,0.0007166088,0.000003990404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002168776,0.00004906563,0.996705,0.00008012522,0.00001695998,0.00001552439,0.00003038787,0.0001347755,0.0007993884],"genre_scores_gemma":[0.1957445,0.00039483,0.7968519,0.0002653942,0.00009144946,0.0002662939,0.0005743064,0.0003340732,0.005477308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003609509,"threshold_uncertainty_score":0.01207501,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001812374,0.001452045,0.001764881,0.0002809118,0.0007772853,0.0009298836,0.003074627,0.001498609,0.008271837],"category_scores_gemma":[0.005134148,0.0005148138,0.0006275151,0.0004195437,0.001191257,0.001701523,0.001966857,0.002034707,0.001540697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045883,"about_ca_system_score_gemma":0.002249154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004448507,"about_ca_topic_score_gemma":0.005242566,"domain_scores_codex":[0.9988369,0.0003863758,0.00006427129,0.0002983933,0.0001688972,0.0002451536],"domain_scores_gemma":[0.9971979,0.00117739,0.000225682,0.0006700365,0.0003769033,0.0003521244],"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.001798574,0.0002966827,0.001621652,0.000287634,0.00009334739,0.0001663253,0.0001483084,0.8391662,0.004983453,0.01919746,0.01098737,0.121253],"study_design_scores_gemma":[0.0001261927,0.0001597126,0.0002868508,0.00001374498,0.00001413144,0.00004429196,0.00002177324,0.9866418,0.001695549,0.009145983,0.001833032,0.00001694196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08138546,0.001357795,0.9036758,0.000784694,0.0003886948,0.0003402245,0.0003274562,0.005626393,0.006113532],"genre_scores_gemma":[0.8024641,0.0002402084,0.1884173,0.0005979633,0.0001046928,0.0004392784,0.0005520761,0.0004288964,0.006755556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008271837,"threshold_uncertainty_score":0.02767205,"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","authors":[{"name":"Shohreh Shaghaghian","is_ca":true},{"name":"Mark Coates","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006651568,0.00127488,0.002266634,0.002525019,0.00098673,0.002409509,0.003081059,0.002572577,0.00358777],"category_scores_gemma":[0.04873024,0.001667616,0.00133774,0.001962942,0.00169862,0.004475028,0.001855971,0.004055293,0.0006974177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002941446,"about_ca_system_score_gemma":0.002259617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02094169,"about_ca_topic_score_gemma":0.02025054,"domain_scores_codex":[0.9981433,0.000869249,0.0001098684,0.0004529911,0.0002881188,0.0001365177],"domain_scores_gemma":[0.9685015,0.02755608,0.001351628,0.0009321277,0.001297918,0.00036077],"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.00008867091,0.00005254715,0.001466977,0.00008182025,0.00005648088,0.00005817493,0.00008579957,0.9326754,0.0003980122,0.04308652,0.001171153,0.02077848],"study_design_scores_gemma":[0.000008139868,0.000002994236,0.0001099959,0.000007165898,0.000004053133,0.00000597593,0.000004425422,0.981653,0.0000832092,0.01797608,0.0001399372,0.00000497948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02561245,0.0005176116,0.9706335,0.000721687,0.00005011582,0.0000617741,0.0002891551,0.0005030614,0.00161058],"genre_scores_gemma":[0.6778193,0.001295945,0.3133214,0.0003483354,0.0002625525,0.0003315276,0.00165832,0.0002641836,0.004698418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02094169,"threshold_uncertainty_score":0.04163963,"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","authors":[{"name":"Naghmeh Momeni","is_ca":true},{"name":"Michael Rabbat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009421908,0.0005670126,0.0006322267,0.002709135,0.0004638243,0.00106301,0.001442126,0.001173573,0.00117265],"category_scores_gemma":[0.08162868,0.00075955,0.0009025374,0.002328581,0.001286525,0.003049897,0.001095185,0.00136828,0.0002851216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084351,"about_ca_system_score_gemma":0.0004905337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005063764,"about_ca_topic_score_gemma":0.007520504,"domain_scores_codex":[0.9946144,0.003819699,0.0002189501,0.0007909107,0.0003905698,0.0001654047],"domain_scores_gemma":[0.9073009,0.07120392,0.01068732,0.008198597,0.001942171,0.0006670251],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005249019,0.0003950365,0.5503148,0.0004885061,0.0007208074,0.0003544264,0.002460212,0.2907133,0.003708492,0.0646169,0.001585063,0.08411751],"study_design_scores_gemma":[0.0000620902,0.0002323645,0.1463056,0.0001302882,0.0001315768,0.0004213061,0.000928068,0.7900554,0.002587021,0.05649506,0.00255585,0.0000954027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5578516,0.0001768895,0.4384758,0.0001978229,0.00001376433,0.000247475,0.001389,0.0001601378,0.001487529],"genre_scores_gemma":[0.9094672,0.0002216253,0.08817281,0.00004197253,0.00001613065,0.00020626,0.001457621,0.00001732854,0.000399003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009421908,"threshold_uncertainty_score":0.04982847,"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","authors":[{"name":"Yacine Mokhtari","is_ca":false},{"name":"Emmanuel Moulay","is_ca":false},{"name":"Patrick Coirault","is_ca":false},{"name":"Jerome Le Ny","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001366925,0.001012966,0.001110814,0.0006151874,0.0005192514,0.0009935015,0.001626645,0.00169637,0.001882589],"category_scores_gemma":[0.003029279,0.0005832738,0.0007996758,0.001024701,0.001164762,0.001427834,0.001321838,0.002333771,0.0004220824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001139033,"about_ca_system_score_gemma":0.001767694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004194768,"about_ca_topic_score_gemma":0.003791423,"domain_scores_codex":[0.9994962,0.0001763881,0.00002517236,0.0001239514,0.0001333027,0.00004491855],"domain_scores_gemma":[0.9989675,0.0005277098,0.0001140962,0.0001155216,0.0002215103,0.00005367707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002066471,0.00001610663,0.00007825808,0.00003290877,0.00001478048,0.0000316168,0.00002313,0.9683467,0.0008319419,0.01556192,0.0009990212,0.01404294],"study_design_scores_gemma":[0.000003240104,0.000007309219,0.000007935747,0.000001768949,0.00000144618,0.000006578251,0.000002326513,0.9958298,0.0001259863,0.0037199,0.0002921005,0.000001649942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002083706,0.00005533659,0.9967326,0.0001472069,0.00002411977,0.0000124775,0.00001632166,0.00009467521,0.0008337273],"genre_scores_gemma":[0.3074977,0.0002894147,0.6837772,0.0002920785,0.0001413808,0.0001964705,0.0002564405,0.0002266812,0.007322689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004194768,"threshold_uncertainty_score":0.008340716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}