{"meta":{"query_hash":"a13ef10df191","filters":{"venue":"IEEE Journal on Selected Areas in Information Theory"},"cohort_total":20,"direct_labels_cover":0,"predictions_cover":20,"exported":20,"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/a13ef10df191","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Journal+on+Selected+Areas+in+Information+Theory"},"results":[{"id":"W2982682504","doi":"10.1109/jsait.2020.3017054","title":"Erasable Bit Commitment From Temporary Quantum Trust","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal; Perimeter Institute; University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Communication source; Commit; Commitment scheme; Computer science; Computer security; Protocol (science); Third party; Trusted third party; Cryptography; Cryptographic protocol; Node (physics); Adversarial system; Bit (key); Computer network; Internet privacy","score_opus":0.015256136464743468,"score_gpt":0.22594976497196748,"score_spread":0.210693628507224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982682504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023307519,0.00039778187,0.9491409,0.001280621,0.0003757954,0.00017783121,0.00016123177,0.00035970754,0.024798566],"genre_scores_gemma":[0.7415285,0.00075100776,0.23170313,0.0010778412,0.0004103046,0.0007551354,0.00026966838,0.00031407856,0.02319028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941795,0.0018910747,0.00038184092,0.00077625574,0.0019048289,0.0008665165],"domain_scores_gemma":[0.99125975,0.0025877487,0.0007556205,0.004185092,0.0008104804,0.0004013093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035198694,0.00068869896,0.0010661955,0.000882405,0.002098212,0.0037843122,0.0027713412,0.0025988373,0.0071868096],"category_scores_gemma":[0.011894711,0.00065998844,0.0012253743,0.0014181188,0.0060775424,0.010932382,0.0082595665,0.0064754733,0.0022270044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000080223916,0.00001951813,0.000055020373,0.00004674112,0.000007644648,0.00013291568,0.00019077223,0.0057049533,0.00214341,0.98473966,0.00088415545,0.0059950654],"study_design_scores_gemma":[0.00006120116,0.00009586458,0.00006982363,0.0000633416,0.000017780361,0.00021679142,0.00008987567,0.06868747,0.0058707497,0.9085337,0.016229559,0.00006374519],"about_ca_topic_score_codex":0.0004641347,"about_ca_topic_score_gemma":0.00035857625,"teacher_disagreement_score":0.0071868096,"about_ca_system_score_codex":0.0016671141,"about_ca_system_score_gemma":0.0019914224,"threshold_uncertainty_score":0.024042249},"labels":[],"label_agreement":null},{"id":"W3161297530","doi":"10.1109/jsait.2021.3079856","title":"Asynchronous Delayed Optimization With Time-Varying Minibatches","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Asynchronous communication; Regret; Computer science; Variable (mathematics); Mathematical optimization; Process (computing); Mathematics","score_opus":0.006218310357429007,"score_gpt":0.21096753306189617,"score_spread":0.20474922270446716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161297530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096258804,0.00032875102,0.8983929,0.00041959804,0.00017757887,0.00014746732,0.00012192009,0.0014247957,0.0027282878],"genre_scores_gemma":[0.87853086,0.00009493494,0.117743544,0.00017329586,0.000059412847,0.00023715668,0.00013789971,0.00011505986,0.0029079474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989341,0.0003792985,0.000044975004,0.00029646727,0.00016950179,0.00017567168],"domain_scores_gemma":[0.9962723,0.0019873579,0.00028932642,0.00068144617,0.0004316241,0.00033799207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022655074,0.0008432697,0.0010895935,0.00024270653,0.0005679227,0.00093805796,0.0021048186,0.001098392,0.0041234377],"category_scores_gemma":[0.0065263254,0.00041464192,0.0004394297,0.0003745904,0.0010747992,0.0014567933,0.0010906128,0.0019961104,0.00063703395],"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.00066697807,0.00020001165,0.0007986341,0.00010106908,0.00003887007,0.00005967405,0.000067382854,0.9468088,0.0046727858,0.016682507,0.002183545,0.027719645],"study_design_scores_gemma":[0.000035158926,0.00005540958,0.000108328306,0.0000027332187,0.0000037575671,0.0000076254287,0.0000057744987,0.9939288,0.0010380571,0.0045367423,0.00027281253,0.0000048068996],"about_ca_topic_score_codex":0.003101629,"about_ca_topic_score_gemma":0.0032854322,"teacher_disagreement_score":0.0041234377,"about_ca_system_score_codex":0.0012528284,"about_ca_system_score_gemma":0.0017360598,"threshold_uncertainty_score":0.013794303},"labels":[],"label_agreement":null},{"id":"W3189399213","doi":"10.1109/jsait.2021.3102853","title":"Sequential Gradient Coding for Packet-Loss Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","score_opus":0.024068254098254048,"score_gpt":0.2722622865215812,"score_spread":0.24819403242332713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189399213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02900887,0.00049629057,0.96139896,0.0009812553,0.00014623415,0.00010925455,0.00022907977,0.0010051605,0.0066248416],"genre_scores_gemma":[0.82442415,0.00065261824,0.15882534,0.00036367765,0.00013816357,0.0003163823,0.00042004898,0.00028508264,0.014574483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992661,0.00024426036,0.00002448358,0.00010954607,0.00019927489,0.00015623093],"domain_scores_gemma":[0.9983803,0.0009789455,0.000094006995,0.00019299121,0.0002587073,0.00009496077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013706047,0.0008388534,0.0008453175,0.000548788,0.0005996139,0.0012080842,0.0019228167,0.000922635,0.0040710694],"category_scores_gemma":[0.005189398,0.00037539226,0.00043134237,0.0007697531,0.0011603737,0.0023209644,0.0015658089,0.0017524209,0.0007396216],"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.00034068458,0.00006936678,0.0005205546,0.000094458104,0.000022599226,0.00010303616,0.0001085154,0.83035755,0.0017484436,0.12969717,0.0058368114,0.031100847],"study_design_scores_gemma":[0.000009671738,0.000010816679,0.000027860198,0.0000032738776,0.000002395451,0.00000716006,0.0000059730933,0.9784297,0.00029300488,0.02076969,0.00043676168,0.0000037382724],"about_ca_topic_score_codex":0.0089922,"about_ca_topic_score_gemma":0.009579574,"teacher_disagreement_score":0.0089922,"about_ca_system_score_codex":0.002533478,"about_ca_system_score_gemma":0.0018054552,"threshold_uncertainty_score":0.018381774},"labels":[],"label_agreement":null},{"id":"W3189787503","doi":"10.1109/jsait.2021.3103494","title":"Compressing Gradients by Exploiting Temporal Correlation in Momentum-SGD","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Stochastic Gradient Optimization Techniques","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Bottleneck; Computer science; Computation; Rate of convergence; Convergence (economics); Algorithm; Momentum (technical analysis); Mathematical optimization; Information bottleneck method; Compression (physics); Exploit; Norm (philosophy); Mathematics; Artificial intelligence; Telecommunications","score_opus":0.009529290614629546,"score_gpt":0.23181319729259658,"score_spread":0.22228390667796705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189787503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015786434,0.00020843679,0.98224497,0.0002276453,0.000040701478,0.000044392593,0.000035702476,0.0003350285,0.0010765803],"genre_scores_gemma":[0.60642576,0.0004290037,0.38932413,0.0002813263,0.00009193294,0.00020303756,0.00020097972,0.0001688886,0.0028749711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.00012952344,0.000042970387,0.00007059261,0.00022164988,0.000045238936],"domain_scores_gemma":[0.9980348,0.0011710791,0.0001567548,0.00027415046,0.00027769833,0.00008549196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016817221,0.0006918095,0.00095116766,0.00049835915,0.00042288547,0.0010704803,0.00074880896,0.00084819074,0.0012566077],"category_scores_gemma":[0.006766446,0.00039673096,0.0003376199,0.0005767148,0.0013616509,0.0013900991,0.0016481432,0.0012674526,0.00029286172],"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.00019962825,0.00006598623,0.001427117,0.00014443374,0.000034434543,0.00014660852,0.0001569426,0.82094115,0.009338035,0.036438752,0.0018244577,0.12928244],"study_design_scores_gemma":[0.0000071512,0.000025085255,0.00005307389,0.000005464436,0.0000021175406,0.000017598451,0.0000048975135,0.99425924,0.0014460598,0.0038237793,0.00035213825,0.0000033223325],"about_ca_topic_score_codex":0.0021195486,"about_ca_topic_score_gemma":0.002638829,"teacher_disagreement_score":0.0021195486,"about_ca_system_score_codex":0.0007706904,"about_ca_system_score_gemma":0.0015883597,"threshold_uncertainty_score":0.008893847},"labels":[],"label_agreement":null},{"id":"W3193529446","doi":"10.1109/jsait.2021.3104970","title":"Coded Sequential Matrix Multiplication for Straggler Mitigation","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Computer science; Arithmetic","score_opus":0.022187923574703377,"score_gpt":0.2947377955343279,"score_spread":0.2725498719596245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193529446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013750476,0.00045002543,0.9632367,0.0003696317,0.00026706807,0.0001423794,0.00020679245,0.005644465,0.015932351],"genre_scores_gemma":[0.34528193,0.00033671426,0.61993855,0.00049327174,0.00011831083,0.00032299946,0.00060599326,0.0010232956,0.03187899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00010956751,0.000025752835,0.00010941317,0.00024105048,0.00009462142],"domain_scores_gemma":[0.99932003,0.00024382131,0.00004763182,0.00015735427,0.00018362154,0.000047597176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045808643,0.0011152086,0.0006479754,0.00051876216,0.00085790595,0.0010504063,0.0016435721,0.0009166027,0.02333341],"category_scores_gemma":[0.0019988024,0.00031091212,0.0004726217,0.00052405434,0.0006701324,0.0015446924,0.0017229837,0.0011762242,0.005626932],"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.0009868032,0.0002686495,0.0012559036,0.0007073495,0.00012903253,0.0007587439,0.00037979023,0.40108055,0.04440544,0.12987676,0.035386816,0.3847641],"study_design_scores_gemma":[0.000071241426,0.00017722919,0.0001800617,0.00004605205,0.000023465007,0.00024149344,0.00007664527,0.9049437,0.02158895,0.048481524,0.024131162,0.000038484202],"about_ca_topic_score_codex":0.004342019,"about_ca_topic_score_gemma":0.008512643,"teacher_disagreement_score":0.02333341,"about_ca_system_score_codex":0.0009696863,"about_ca_system_score_gemma":0.0017674429,"threshold_uncertainty_score":0.078058004},"labels":[],"label_agreement":null},{"id":"W3214381038","doi":"10.1109/jsait.2021.3126687","title":"On Streaming Codes With Unequal Error Protection","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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":"Computer science; Network packet; Converse; Coding (social sciences); Packet loss; Forward error correction; Computer network; Algorithm; Theoretical computer science; Decoding methods; Mathematics","score_opus":0.02265578548945043,"score_gpt":0.25782235971382145,"score_spread":0.235166574224371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214381038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05058554,0.0016180826,0.9286788,0.00078737916,0.0001226333,0.00010628635,0.0002631659,0.00023246778,0.017605644],"genre_scores_gemma":[0.8344903,0.0028474857,0.155925,0.0004896215,0.00032143787,0.0003181613,0.00036658646,0.00010537763,0.005136117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785906,0.0008074217,0.00009573079,0.00022176438,0.00070865726,0.0003073337],"domain_scores_gemma":[0.9920099,0.005265952,0.0006536502,0.0009552231,0.000953132,0.00016226446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021864916,0.0012420707,0.0006577577,0.0012424091,0.0006942863,0.00096477877,0.0011010629,0.0010358248,0.0019673044],"category_scores_gemma":[0.012340574,0.00035352688,0.00037914052,0.0017052923,0.0026621227,0.002619346,0.002597527,0.0020480938,0.00044420036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00020045282,0.000037356254,0.000466209,0.00013419215,0.000016220774,0.00017459743,0.00023266298,0.2920069,0.0068213027,0.65786505,0.001768709,0.040276375],"study_design_scores_gemma":[0.00003956308,0.00015471636,0.00019465722,0.00009339283,0.000012088264,0.00024500248,0.00005155611,0.69698775,0.005007669,0.293024,0.0041507315,0.000038862076],"about_ca_topic_score_codex":0.0025272365,"about_ca_topic_score_gemma":0.0015306963,"teacher_disagreement_score":0.0025272365,"about_ca_system_score_codex":0.0016789088,"about_ca_system_score_gemma":0.0016195787,"threshold_uncertainty_score":0.012181401},"labels":[],"label_agreement":null},{"id":"W4285230246","doi":"10.1109/jsait.2022.3182943","title":"Soft BIBD and Product Gradient Codes","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Coding (social sciences); Code (set theory); Algorithm; Mathematics; Artificial intelligence; Statistics","score_opus":0.007631716982751596,"score_gpt":0.23078160945333973,"score_spread":0.22314989247058814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285230246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01927253,0.00041804157,0.9716789,0.00032781088,0.00008576474,0.000066439716,0.00015206562,0.00030597846,0.0076924777],"genre_scores_gemma":[0.73646736,0.0006563241,0.25070053,0.0006093001,0.00015277312,0.00035325284,0.00031513214,0.00019271579,0.01055254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815506,0.0005961833,0.00008709931,0.00027448672,0.0006975248,0.00018959],"domain_scores_gemma":[0.9958852,0.001907646,0.0004912012,0.00084658456,0.0006687506,0.00020061046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019171222,0.0008323062,0.00075680594,0.0009198026,0.0005280217,0.0014100322,0.0010898467,0.001142338,0.004020916],"category_scores_gemma":[0.009384258,0.0003850464,0.00036777864,0.00080008205,0.0020782612,0.0020586643,0.0022530893,0.001674605,0.0014828157],"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.0003517854,0.000053609492,0.00071611925,0.00018059551,0.000029377567,0.00014144034,0.00013160601,0.22153306,0.009955701,0.65786797,0.0035655557,0.10547314],"study_design_scores_gemma":[0.000040773677,0.00015865813,0.00020861822,0.00005994961,0.000010418553,0.00018839359,0.000025737963,0.75854856,0.0069883484,0.2288258,0.004900201,0.00004461126],"about_ca_topic_score_codex":0.00061330554,"about_ca_topic_score_gemma":0.00054930925,"teacher_disagreement_score":0.004020916,"about_ca_system_score_codex":0.0007599298,"about_ca_system_score_gemma":0.0009928505,"threshold_uncertainty_score":0.013451338},"labels":[],"label_agreement":null},{"id":"W4285507276","doi":"10.1109/jsait.2022.3190859","title":"Successive Approximation Coding for Distributed Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":13,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Computer science; Coding (social sciences); Matrix multiplication; Algorithm; Parallel computing; Multiplication (music); Theoretical computer science; Distributed computing; Mathematics","score_opus":0.010413482430253475,"score_gpt":0.25895779948335734,"score_spread":0.24854431705310387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285507276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053252056,0.00024107718,0.9914967,0.0001589686,0.000067211346,0.000025042362,0.000029028628,0.00020991302,0.0024468533],"genre_scores_gemma":[0.49316028,0.0008259409,0.4985943,0.00022879429,0.00016878641,0.00025205477,0.00016108116,0.000095182106,0.006513484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991726,0.00023284132,0.00003336451,0.00007473414,0.0004204162,0.00006592535],"domain_scores_gemma":[0.9984806,0.0008450763,0.000097747376,0.00024730802,0.0002847147,0.00004451806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095322693,0.00054899784,0.00043501912,0.00046501067,0.00042876948,0.0007431499,0.00070985843,0.0005519455,0.0021981157],"category_scores_gemma":[0.0044243666,0.00020920818,0.0002994293,0.0010383412,0.0009681858,0.0009490566,0.00093562953,0.0013899045,0.0006167719],"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.00021271406,0.0000397165,0.00028797108,0.00014309528,0.000031162603,0.00011219387,0.00018420229,0.43485475,0.014130216,0.41406193,0.0045520207,0.13138996],"study_design_scores_gemma":[0.000012268865,0.00002647208,0.000026803444,0.000012019042,0.0000036973315,0.000024644261,0.000005799427,0.9624441,0.0024730337,0.032677673,0.0022873199,0.000006175148],"about_ca_topic_score_codex":0.0022873909,"about_ca_topic_score_gemma":0.0029991956,"teacher_disagreement_score":0.0022873909,"about_ca_system_score_codex":0.0008333248,"about_ca_system_score_gemma":0.0012735928,"threshold_uncertainty_score":0.0073534846},"labels":[],"label_agreement":null},{"id":"W4312777148","doi":"10.1109/jsait.2022.3231820","title":"On the Rate-Distortion-Perception Function","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Perception; Distortion function; Randomness; Distortion (music); Constraint (computer-aided design); Mathematics; Coding (social sciences); Rate distortion; Decoding methods; Function (biology); Information theory; Theoretical computer science; Algorithm; Mathematical optimization; Computer science; Statistics; Psychology; Telecommunications","score_opus":0.008935774984870014,"score_gpt":0.23274199312170699,"score_spread":0.22380621813683696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312777148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00663793,0.0062298346,0.959896,0.001999512,0.0002611889,0.000054273387,0.00018957623,0.00014134914,0.024590405],"genre_scores_gemma":[0.65077186,0.022910837,0.3084537,0.0021449965,0.0018290227,0.00074173225,0.0005074539,0.00048209543,0.012158238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992,0.0031852194,0.00046248967,0.0012705665,0.0025205512,0.00056124176],"domain_scores_gemma":[0.9786597,0.01557168,0.00086803915,0.0022449484,0.0024361901,0.00021944872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008209813,0.0019179253,0.0016534021,0.0018928078,0.00091022346,0.0046207197,0.0020619133,0.0031650038,0.003822642],"category_scores_gemma":[0.03197046,0.0006981096,0.0009793045,0.0025475759,0.006086253,0.008917762,0.003443753,0.005003355,0.0017764566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00009367977,0.00001706836,0.00021173972,0.00016127632,0.00002218682,0.00011810551,0.000090812624,0.03276613,0.0018855308,0.94134027,0.002010326,0.02128294],"study_design_scores_gemma":[0.000029823526,0.00011276276,0.00040444452,0.00017221986,0.000031685096,0.00052517455,0.000052348714,0.19538394,0.002467852,0.7870054,0.013735044,0.00007933844],"about_ca_topic_score_codex":0.0014676522,"about_ca_topic_score_gemma":0.00037467308,"teacher_disagreement_score":0.008209813,"about_ca_system_score_codex":0.0025846236,"about_ca_system_score_gemma":0.0014553332,"threshold_uncertainty_score":0.04341817},"labels":[],"label_agreement":null},{"id":"W4313147713","doi":"10.1109/jsait.2022.3219807","title":"Sparsity-Free Compressed Sensing With Applications to Generative Priors","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Notation; Combinatorics; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.009189985625825691,"score_gpt":0.21449835616617585,"score_spread":0.20530837054035017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313147713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052274233,0.00043793686,0.9915344,0.0008086876,0.00005405767,0.000024423163,0.00014834567,0.00016184429,0.0016028638],"genre_scores_gemma":[0.4632101,0.003465605,0.51691496,0.001030145,0.0008458982,0.00038959624,0.0017292433,0.00041819026,0.011996186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986065,0.0005849929,0.000052900505,0.0002823014,0.0003457922,0.00012755473],"domain_scores_gemma":[0.990991,0.0073274537,0.00051694404,0.0006189518,0.000344446,0.00020117854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033192034,0.0015882711,0.0013985158,0.0010202359,0.0005331559,0.0015895109,0.002383059,0.0024732254,0.0027385578],"category_scores_gemma":[0.014582667,0.0009324214,0.0012858411,0.001640155,0.0027698446,0.0025060794,0.0031681,0.003717104,0.00086230825],"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.00022686283,0.00007280226,0.0006779452,0.0002997504,0.00008776748,0.0002970039,0.000202156,0.72673875,0.0032090314,0.22525921,0.00409036,0.03883842],"study_design_scores_gemma":[0.000018138386,0.000020260359,0.00010214891,0.000020342042,0.00000981224,0.000048598693,0.000013714061,0.91639876,0.0007576258,0.08162823,0.0009663552,0.000015963666],"about_ca_topic_score_codex":0.004680116,"about_ca_topic_score_gemma":0.00407216,"teacher_disagreement_score":0.004680116,"about_ca_system_score_codex":0.0011001481,"about_ca_system_score_gemma":0.0014155963,"threshold_uncertainty_score":0.017553866},"labels":[],"label_agreement":null},{"id":"W4376607544","doi":"10.1109/jsait.2023.3276296","title":"Active Sensing for Two-Sided Beam Alignment and Reflection Design Using Ping-Pong Pilots","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Huawei Technologies","keywords":"Ping pong; Reflection (computer programming); Optics; Beam (structure); Physics; Computer science; Engineering; Artificial intelligence","score_opus":0.026215546889704275,"score_gpt":0.26892948282244683,"score_spread":0.24271393593274254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08480982,0.00015174272,0.9113308,0.00012732875,0.0000665663,0.000055592824,0.000026745076,0.00054275896,0.0028887314],"genre_scores_gemma":[0.8233266,0.00013328319,0.17467238,0.00009126961,0.000043412823,0.000066181754,0.000033659955,0.000041906158,0.0015913817],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993948,0.00018188538,0.000026464126,0.00012565785,0.00020388464,0.00006735654],"domain_scores_gemma":[0.99871254,0.0004786729,0.00023075499,0.00015092306,0.00037435236,0.00005287954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005505516,0.0008691218,0.00046391867,0.00032055672,0.00033926315,0.0006417735,0.0011054239,0.00053982734,0.0013353252],"category_scores_gemma":[0.0010247403,0.00034862338,0.0003713297,0.00028617884,0.00039618558,0.00067980564,0.0005621398,0.00042547376,0.0004544487],"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.0007181148,0.0003298101,0.0014269996,0.00019891335,0.00008173998,0.00016670456,0.00024400398,0.026329735,0.82704157,0.00883825,0.00082642405,0.13379778],"study_design_scores_gemma":[0.00008444569,0.0014119252,0.0009952863,0.000024752304,0.000079494326,0.00048010758,0.00007275273,0.56258225,0.42864418,0.0019332531,0.0036498788,0.00004161939],"about_ca_topic_score_codex":0.0003781783,"about_ca_topic_score_gemma":0.0007321328,"teacher_disagreement_score":0.0013353252,"about_ca_system_score_codex":0.00032847057,"about_ca_system_score_gemma":0.00038918885,"threshold_uncertainty_score":0.0044671297},"labels":[],"label_agreement":null},{"id":"W4391528179","doi":"10.1109/jsait.2023.3338326","title":"Dimensions of Channel Coding: From Theory to Algorithms to Applications","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cellular Automata and Applications","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":"McMaster University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; University of California, San Diego; University of Illinois at Urbana-Champaign; Centre National de la Recherche Scientifique; Nanyang Technological University; National University of Singapore","keywords":"Algorithm; Computer science; Coding (social sciences); Channel (broadcasting); Coding theory; Theoretical computer science; Mathematics; Telecommunications; Statistics","score_opus":0.013560731427355685,"score_gpt":0.2555760877282448,"score_spread":0.2420153563008891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391528179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018416913,0.16524792,0.65441847,0.047198717,0.01287095,0.00012863049,0.00095106364,0.0005009901,0.10026638],"genre_scores_gemma":[0.5426667,0.2131823,0.16744547,0.008116232,0.038050406,0.0006904978,0.0010066833,0.0006682859,0.028173383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981158,0.0007012531,0.00010716574,0.00025418302,0.000675173,0.00014648518],"domain_scores_gemma":[0.9932586,0.004634763,0.00031038927,0.00067208154,0.0007922085,0.00033197808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013084942,0.0009157211,0.0012488122,0.0019480212,0.0009021819,0.006045344,0.0011194076,0.0012595268,0.0055321604],"category_scores_gemma":[0.00896313,0.00061362685,0.00071482395,0.0028724927,0.0051926607,0.008369745,0.002913853,0.0061105452,0.0009860661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00002437246,0.000011702827,0.0002389808,0.00013954299,0.000019419786,0.0000248919,0.00010326059,0.004827594,0.00022483424,0.94682467,0.01824797,0.029312694],"study_design_scores_gemma":[0.000007049447,0.000018206418,0.00014521327,0.00009352509,0.0000065133777,0.000068033805,0.000051812454,0.01454679,0.00014652732,0.945929,0.038969208,0.000018219915],"about_ca_topic_score_codex":0.0009802898,"about_ca_topic_score_gemma":0.0005427025,"teacher_disagreement_score":0.006045344,"about_ca_system_score_codex":0.0024420342,"about_ca_system_score_gemma":0.0015489241,"threshold_uncertainty_score":0.018506944},"labels":[],"label_agreement":null},{"id":"W4396680742","doi":"10.1109/jsait.2024.3396787","title":"Noisy Computing of the OR and MAX Functions","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Machine Learning and Algorithms","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":"University of Toronto; University of British Columbia","funders":"","keywords":"Divergence (linguistics); Pairwise comparison; Mathematics; Function (biology); Computation; Combinatorics; Upper and lower bounds; Probability distribution; Kullback–Leibler divergence; Probability of error; Discrete mathematics; Algorithm; Statistics; Mathematical analysis","score_opus":0.006234505061312398,"score_gpt":0.23775144553921707,"score_spread":0.23151694047790466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12233931,0.0011030632,0.86687565,0.0021178946,0.00014551752,0.00010166766,0.00036365783,0.0013058651,0.005647385],"genre_scores_gemma":[0.8749024,0.0003884707,0.12053797,0.0005355405,0.0002464333,0.00020185285,0.0003664517,0.00026172568,0.0025591494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895874,0.0041156216,0.00052691856,0.002233301,0.0023155937,0.0012211016],"domain_scores_gemma":[0.95875853,0.03155201,0.0024013645,0.0051441235,0.0015026724,0.00064114935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008367387,0.0015174102,0.0034664155,0.001029136,0.0015965916,0.004542108,0.0031213448,0.0022381,0.003069275],"category_scores_gemma":[0.05798368,0.00086446083,0.0011768215,0.0017502952,0.0049349307,0.012982644,0.0039229873,0.003350121,0.00092558895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003953987,0.00026459963,0.0064734337,0.0005897007,0.00023753315,0.0007053332,0.00065696565,0.64981794,0.010115734,0.24088414,0.004850704,0.081449926],"study_design_scores_gemma":[0.00004224193,0.000102149024,0.00048241913,0.000030604548,0.00003081342,0.00016841173,0.00009368208,0.8516952,0.006450128,0.14001727,0.00085143466,0.00003565227],"about_ca_topic_score_codex":0.0021116582,"about_ca_topic_score_gemma":0.0015991749,"teacher_disagreement_score":0.008367387,"about_ca_system_score_codex":0.0027690255,"about_ca_system_score_gemma":0.0024624611,"threshold_uncertainty_score":0.0442515},"labels":[],"label_agreement":null},{"id":"W4396782890","doi":"10.1109/jsait.2024.3397305","title":"Contraction of Locally Differentially Private Mechanisms","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Adhesion, Friction, and Surface Interactions","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":"McMaster University","funders":"","keywords":"Contraction (grammar); Medicine; Internal medicine","score_opus":0.004835886490959991,"score_gpt":0.21113994578124862,"score_spread":0.20630405929028864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396782890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061907712,0.00033491035,0.93074197,0.0012109203,0.000056956826,0.0001847969,0.00018658122,0.0002378206,0.0051383586],"genre_scores_gemma":[0.8938959,0.00051589374,0.09504275,0.00065496087,0.00013632467,0.0009212271,0.00024838655,0.00019835007,0.008386253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9869376,0.006174536,0.0006367436,0.002353278,0.002710948,0.001186929],"domain_scores_gemma":[0.9312836,0.04846819,0.0052234363,0.0098959105,0.003077233,0.0020517556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016917514,0.0013799393,0.0028816494,0.0012920862,0.0014616256,0.0039372826,0.0045760814,0.0030975065,0.0067388522],"category_scores_gemma":[0.07695623,0.001047684,0.0020720637,0.0013549938,0.0055523096,0.013729738,0.010056849,0.006941409,0.001035214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00042550743,0.00012744253,0.0016268381,0.00019313958,0.00009244218,0.00036469795,0.00067194685,0.089341454,0.0062557505,0.87631595,0.0012001353,0.023384685],"study_design_scores_gemma":[0.00008128553,0.00020117844,0.00031057664,0.000046422287,0.000028799139,0.0003134346,0.00010062323,0.401322,0.0028988197,0.5930587,0.0015924567,0.000045700403],"about_ca_topic_score_codex":0.00040154645,"about_ca_topic_score_gemma":0.00020223796,"teacher_disagreement_score":0.016917514,"about_ca_system_score_codex":0.002832457,"about_ca_system_score_gemma":0.0023299307,"threshold_uncertainty_score":0.08946943},"labels":[],"label_agreement":null},{"id":"W4399766639","doi":"10.1109/jsait.2024.3416089","title":"Controlled Privacy Leakage Propagation Throughout Overlapping Grouped Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Network Security and Intrusion Detection","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":"Vector Institute; University of Toronto","funders":"","keywords":"Leakage (economics); Computer science; Internet privacy; Computer security; Economics","score_opus":0.008281932575904052,"score_gpt":0.2421834919386542,"score_spread":0.23390155936275014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399766639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06011007,0.00016643992,0.93711895,0.00044095924,0.00003011141,0.00011439804,0.00009626779,0.00075918605,0.0011636523],"genre_scores_gemma":[0.90184563,0.00007209901,0.095670566,0.00028808895,0.0000411104,0.00018838406,0.00014267559,0.00010172516,0.0016497812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98577,0.0057235197,0.00075890654,0.0034684357,0.0030005418,0.0012786167],"domain_scores_gemma":[0.96533424,0.014635902,0.0029063085,0.013596143,0.0021504888,0.0013770225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011574728,0.0013217473,0.0021103986,0.0008195899,0.002175555,0.0026809205,0.004494444,0.0021457002,0.001609171],"category_scores_gemma":[0.041229416,0.00080638245,0.0011666857,0.0014419483,0.0031815034,0.00760511,0.01061942,0.0033302184,0.0005921501],"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.002575713,0.0007008278,0.009456102,0.0003171847,0.0002920283,0.0008831612,0.0027392842,0.6277273,0.014293472,0.091978915,0.004393505,0.24464248],"study_design_scores_gemma":[0.00008561916,0.0002352459,0.00043149313,0.000022655535,0.00003407563,0.00018662124,0.00017868697,0.88843524,0.0072311494,0.10165859,0.0014737439,0.0000269462],"about_ca_topic_score_codex":0.0010860473,"about_ca_topic_score_gemma":0.001056563,"teacher_disagreement_score":0.011574728,"about_ca_system_score_codex":0.0018750312,"about_ca_system_score_gemma":0.003013452,"threshold_uncertainty_score":0.06121373},"labels":[],"label_agreement":null},{"id":"W4400314741","doi":"10.1109/jsait.2024.3422011","title":"JPEG Compliant Compression for DNN Vision","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; JPEG; Compression (physics); Computer vision; JPEG 2000; Artificial intelligence; Image compression; Data compression; Image processing; Materials science; Image (mathematics); Composite material","score_opus":0.012691720190788503,"score_gpt":0.30502544438548407,"score_spread":0.29233372419469555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400314741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020754876,0.002345235,0.9634985,0.00041162866,0.00043328467,0.00022613542,0.000867263,0.0024919491,0.008971076],"genre_scores_gemma":[0.2218094,0.0022095626,0.7645697,0.00046573704,0.00016183605,0.00021696433,0.002471602,0.00028266045,0.007812541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995173,0.00005042143,0.0000391929,0.00007471829,0.00028882377,0.000029545303],"domain_scores_gemma":[0.9994948,0.00010604475,0.000045230958,0.00013213349,0.00020457899,0.000017198674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070711144,0.00079165265,0.00031134873,0.00090163574,0.00029340808,0.0006742217,0.0009376393,0.00062425726,0.0040018326],"category_scores_gemma":[0.0023414597,0.00015835134,0.00030987873,0.00086937734,0.0004015423,0.0009895449,0.0005132948,0.0011171981,0.0013724981],"study_design_candidate":"bench_or_experimental","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.0002701559,0.00011304147,0.0011288634,0.0004105788,0.00007287274,0.00025189584,0.000076520446,0.057653535,0.08382867,0.034308985,0.022328462,0.79955643],"study_design_scores_gemma":[0.000056442783,0.00020629911,0.0021239386,0.00011658979,0.00004558091,0.0008759919,0.000050219784,0.75584364,0.1708356,0.023438785,0.046354465,0.000052413496],"about_ca_topic_score_codex":0.0036761505,"about_ca_topic_score_gemma":0.0061355005,"teacher_disagreement_score":0.0040018326,"about_ca_system_score_codex":0.00071406784,"about_ca_system_score_gemma":0.00074239465,"threshold_uncertainty_score":0.013387442},"labels":[],"label_agreement":null},{"id":"W4401942877","doi":"10.1109/jsait.2024.3451240","title":"Low-Complexity Coding Techniques for Cloud Radio Access Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Coding (social sciences); Telecommunications; Operating system; Mathematics","score_opus":0.03720281742026299,"score_gpt":0.31269150711664156,"score_spread":0.2754886896963786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401942877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011121387,0.0014763367,0.97983325,0.0005615035,0.00006196064,0.00004296565,0.00008004336,0.00011427693,0.0067082765],"genre_scores_gemma":[0.59107643,0.0040870295,0.3933217,0.00042115973,0.00036629417,0.00034698294,0.00034869165,0.00014195527,0.009889726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990815,0.00024601188,0.000030258665,0.0001049992,0.0004119083,0.00012528167],"domain_scores_gemma":[0.99737036,0.0019343711,0.00020283772,0.00018830366,0.00025212573,0.000051884206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011608071,0.00091568835,0.0006624256,0.00077111245,0.00059863395,0.0015228905,0.0010287846,0.00093138026,0.0024177479],"category_scores_gemma":[0.0058827163,0.00032564532,0.00049049605,0.0011527631,0.0013214994,0.0017985153,0.0015033873,0.0026148316,0.0006239438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0001345163,0.00004446945,0.00030428445,0.00020828295,0.000032031916,0.00013704937,0.00023693606,0.41186604,0.00735623,0.4877456,0.004104829,0.087829724],"study_design_scores_gemma":[0.000018864177,0.000042782187,0.00008658227,0.000037742517,0.00001055884,0.00006700552,0.000042490203,0.81449866,0.002749891,0.17961735,0.0028128405,0.000015202205],"about_ca_topic_score_codex":0.0026101288,"about_ca_topic_score_gemma":0.002244546,"teacher_disagreement_score":0.0026101288,"about_ca_system_score_codex":0.0016967277,"about_ca_system_score_gemma":0.0013596282,"threshold_uncertainty_score":0.012310624},"labels":[],"label_agreement":null},{"id":"W4404840318","doi":"10.1109/jsait.2024.3509420","title":"Rate-Distortion-Perception Tradeoff for Gaussian Vector Sources","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto; McMaster University","funders":"Huawei Technologies","keywords":"Distortion (music); Gaussian; Perception; Mathematics; Statistics; Computer science; Artificial intelligence; Pattern recognition (psychology); Mathematical optimization; Biology; Physics; Telecommunications","score_opus":0.00844123741768463,"score_gpt":0.2342088729274421,"score_spread":0.22576763550975748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404840318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02680026,0.0020169814,0.96560436,0.0006751642,0.00006059158,0.00004824585,0.000074985626,0.00010932789,0.004610092],"genre_scores_gemma":[0.82745624,0.003936889,0.16257355,0.00037381775,0.00019627404,0.00016575948,0.00015874699,0.0001960832,0.0049426914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975841,0.00094338396,0.0001082421,0.0003500889,0.0007654345,0.00024880742],"domain_scores_gemma":[0.99141145,0.0068059857,0.00050515775,0.0004095182,0.0007270811,0.00014079135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043366915,0.0016692748,0.0014644244,0.000889506,0.00043036282,0.0022030105,0.0013279964,0.0020107334,0.0017502634],"category_scores_gemma":[0.017357584,0.0005959302,0.00052576495,0.0011845822,0.0016979647,0.0047425814,0.0022268242,0.0016836188,0.0003979594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003836289,0.00012009334,0.0006096877,0.00037897367,0.00009548613,0.00030319096,0.00022678399,0.7492822,0.015418951,0.17696707,0.0016292415,0.05458473],"study_design_scores_gemma":[0.000021294754,0.00016525382,0.0002533992,0.000037449136,0.000020076932,0.00038279165,0.0000720881,0.9313072,0.005120914,0.061489325,0.0010873607,0.000042833562],"about_ca_topic_score_codex":0.0012714978,"about_ca_topic_score_gemma":0.0006421847,"teacher_disagreement_score":0.0043366915,"about_ca_system_score_codex":0.0017483891,"about_ca_system_score_gemma":0.001014712,"threshold_uncertainty_score":0.022934854},"labels":[],"label_agreement":null},{"id":"W4406089983","doi":"10.1109/jsait.2024.3499012","title":"Editorial Data, Physics, and Life Through the Lens of Information Theory","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lens (geology); Through-the-lens metering; Data science; Physics; Computer science; Optics","score_opus":0.016638114248038748,"score_gpt":0.256696536806175,"score_spread":0.24005842255813625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406089983","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014531554,0.0033687234,0.00035765217,0.032234944,0.9622532,0.0000127350895,0.000097519216,0.000053529664,0.0014762935],"genre_scores_gemma":[0.0013311646,0.00213401,0.00012205567,0.005947721,0.9872595,0.000009683075,0.000020631729,0.00002429758,0.0031509371],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99616724,0.00053826766,0.00044073124,0.0005887952,0.0019660548,0.00029890926],"domain_scores_gemma":[0.9573961,0.023916584,0.0017762989,0.0011087345,0.01143941,0.0043628467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052805147,0.0021909173,0.0024509542,0.0050729876,0.0029480192,0.00921202,0.002232539,0.0061993236,0.013490678],"category_scores_gemma":[0.029891973,0.00062407076,0.0014335607,0.0019150841,0.0030121943,0.004331202,0.0010438582,0.010909256,0.0045727203],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065248714,0.000021033125,0.00009917534,0.00036490607,0.000024819645,0.00014463656,0.000045354802,0.00005241772,0.00010637101,0.0036861643,0.9867573,0.008632596],"study_design_scores_gemma":[0.00006571277,0.000059136277,0.0004974899,0.0005260868,0.00006771006,0.00040555664,0.00015721367,0.00044966288,0.00031933756,0.0090942355,0.9883283,0.000029628813],"about_ca_topic_score_codex":0.000875758,"about_ca_topic_score_gemma":0.0015122318,"teacher_disagreement_score":0.013490678,"about_ca_system_score_codex":0.0015449374,"about_ca_system_score_gemma":0.0023015868,"threshold_uncertainty_score":0.04513079},"labels":[],"label_agreement":null},{"id":"W4406137362","doi":"10.1109/jsait.2024.3508492","title":"JSAIT Issue on Information-Theoretic Methods for Trustworthy and Reliable Machine Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Trustworthiness; Computer science; Artificial intelligence; Data science; Machine learning; Computer security","score_opus":0.007238332404877398,"score_gpt":0.2908124293006692,"score_spread":0.28357409689579177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406137362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021822972,0.05760207,0.3804434,0.12119108,0.340088,0.00028719325,0.0015486926,0.0009760637,0.095681146],"genre_scores_gemma":[0.05396351,0.04905328,0.11948566,0.036517806,0.5617094,0.00071289175,0.002414145,0.0025031741,0.17364006],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939476,0.0016242715,0.00041812798,0.0007652142,0.0029620708,0.00028262535],"domain_scores_gemma":[0.973472,0.017204199,0.00073372095,0.003340943,0.0043066456,0.00094242365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009800497,0.0016010321,0.0026829205,0.003737955,0.002110222,0.007078466,0.003329142,0.0077916756,0.041031983],"category_scores_gemma":[0.036180533,0.0010138878,0.0025889408,0.002903191,0.004797735,0.008178947,0.0037687852,0.014116898,0.012819843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012278651,0.000119472395,0.00022703358,0.00081044354,0.00014792924,0.00018771963,0.000090651665,0.0030696602,0.00083972915,0.26255375,0.62224656,0.10958425],"study_design_scores_gemma":[0.000055273216,0.00010044104,0.0006530036,0.00088242785,0.0001130416,0.00046566184,0.00004939185,0.037897814,0.0012839066,0.45414186,0.5042591,0.00009809618],"about_ca_topic_score_codex":0.00092520675,"about_ca_topic_score_gemma":0.0009210882,"teacher_disagreement_score":0.041031983,"about_ca_system_score_codex":0.0026676038,"about_ca_system_score_gemma":0.0025416731,"threshold_uncertainty_score":0.13726568},"labels":[],"label_agreement":null}]}