{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":20,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":20,"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":"a13ef10df191","filters":{"venue":"IEEE Journal on Selected Areas in Information Theory"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jun Chen","is_ca":true},{"name":"Lei Yu","is_ca":false},{"name":"Jia Wang","is_ca":false},{"name":"Wuxian Shi","is_ca":true},{"name":"Yiqun Ge","is_ca":true},{"name":"Wen Tong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008935774984870014,"gpt":0.232741993121707,"spread":0.223806218136837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008209813,0.001917925,0.001653402,0.001892808,0.0009102235,0.00462072,0.002061913,0.003165004,0.003822642],"category_scores_gemma":[0.03197046,0.0006981096,0.0009793045,0.002547576,0.006086253,0.008917762,0.003443753,0.005003355,0.001776457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002584624,"about_ca_system_score_gemma":0.001455333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001467652,"about_ca_topic_score_gemma":0.0003746731,"domain_scores_codex":[0.992,0.003185219,0.0004624897,0.001270566,0.002520551,0.0005612418],"domain_scores_gemma":[0.9786597,0.01557168,0.0008680391,0.002244948,0.00243619,0.0002194487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009367977,0.00001706836,0.0002117397,0.0001612763,0.00002218682,0.0001181055,0.00009081262,0.03276613,0.001885531,0.9413403,0.002010326,0.02128294],"study_design_scores_gemma":[0.00002982353,0.0001127628,0.0004044445,0.0001722199,0.0000316851,0.0005251745,0.00005234871,0.1953839,0.002467852,0.7870054,0.01373504,0.00007933844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00663793,0.006229835,0.959896,0.001999512,0.0002611889,0.00005427339,0.0001895762,0.0001413491,0.0245904],"genre_scores_gemma":[0.6507719,0.02291084,0.3084537,0.002144997,0.001829023,0.0007417322,0.0005074539,0.0004820954,0.01215824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008209813,"threshold_uncertainty_score":0.04341817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mahdi Haghifam","is_ca":true},{"name":"M. Nikhil Krishnan","is_ca":true},{"name":"Ashish Khisti","is_ca":true},{"name":"Xiaoqing Zhu","is_ca":false},{"name":"Wai-Tian Tan","is_ca":false},{"name":"John Apostolopoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02265578548945043,"gpt":0.2578223597138214,"spread":0.235166574224371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186492,0.001242071,0.0006577577,0.001242409,0.0006942863,0.0009647788,0.001101063,0.001035825,0.001967304],"category_scores_gemma":[0.01234057,0.0003535269,0.0003791405,0.001705292,0.002662123,0.002619346,0.002597527,0.002048094,0.0004442004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001678909,"about_ca_system_score_gemma":0.001619579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002527236,"about_ca_topic_score_gemma":0.001530696,"domain_scores_codex":[0.9978591,0.0008074217,0.00009573079,0.0002217644,0.0007086573,0.0003073337],"domain_scores_gemma":[0.9920099,0.005265952,0.0006536502,0.0009552231,0.000953132,0.0001622645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002004528,0.00003735625,0.000466209,0.0001341921,0.00001622077,0.0001745974,0.000232663,0.2920069,0.006821303,0.657865,0.001768709,0.04027637],"study_design_scores_gemma":[0.00003956308,0.0001547164,0.0001946572,0.00009339283,0.00001208826,0.0002450025,0.00005155611,0.6969877,0.005007669,0.293024,0.004150731,0.00003886208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05058554,0.001618083,0.9286788,0.0007873792,0.0001226333,0.0001062864,0.0002631659,0.0002324678,0.01760564],"genre_scores_gemma":[0.8344903,0.002847486,0.155925,0.0004896215,0.0003214379,0.0003181613,0.0003665865,0.0001053776,0.005136117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002527236,"threshold_uncertainty_score":0.0121814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tao Jiang","is_ca":true},{"name":"Foad Sohrabi","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02621554688970427,"gpt":0.2689294828224468,"spread":0.2427139359327425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005505516,0.0008691218,0.0004639187,0.0003205567,0.0003392631,0.0006417735,0.001105424,0.0005398273,0.001335325],"category_scores_gemma":[0.00102474,0.0003486234,0.0003713297,0.0002861788,0.0003961856,0.0006798056,0.0005621398,0.0004254738,0.0004544487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003284706,"about_ca_system_score_gemma":0.0003891888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003781783,"about_ca_topic_score_gemma":0.0007321328,"domain_scores_codex":[0.9993948,0.0001818854,0.00002646413,0.0001256579,0.0002038846,0.00006735654],"domain_scores_gemma":[0.9987125,0.0004786729,0.000230755,0.0001509231,0.0003743524,0.00005287954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007181148,0.0003298101,0.001427,0.0001989133,0.00008173998,0.0001667046,0.000244004,0.02632974,0.8270416,0.00883825,0.000826424,0.1337978],"study_design_scores_gemma":[0.00008444569,0.001411925,0.0009952863,0.0000247523,0.00007949433,0.0004801076,0.00007275273,0.5625823,0.4286442,0.001933253,0.003649879,0.00004161939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08480982,0.0001517427,0.9113308,0.0001273287,0.0000665663,0.00005559282,0.00002674508,0.000542759,0.002888731],"genre_scores_gemma":[0.8233266,0.0001332832,0.1746724,0.00009126961,0.00004341282,0.00006618175,0.00003365996,0.00004190616,0.001591382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001335325,"threshold_uncertainty_score":0.00446713,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Shahrzad Kiani","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01041348243025348,"gpt":0.2589577994833573,"spread":0.2485443170531039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532269,0.0005489978,0.0004350191,0.0004650107,0.0004287695,0.0007431499,0.0007098584,0.0005519455,0.002198116],"category_scores_gemma":[0.004424367,0.0002092082,0.0002994293,0.001038341,0.0009681858,0.0009490566,0.0009356295,0.001389905,0.0006167719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008333248,"about_ca_system_score_gemma":0.001273593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002287391,"about_ca_topic_score_gemma":0.002999196,"domain_scores_codex":[0.9991726,0.0002328413,0.00003336451,0.00007473414,0.0004204162,0.00006592535],"domain_scores_gemma":[0.9984806,0.0008450763,0.00009774738,0.000247308,0.0002847147,0.00004451806],"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.0002127141,0.0000397165,0.0002879711,0.0001430953,0.0000311626,0.0001121939,0.0001842023,0.4348547,0.01413022,0.4140619,0.004552021,0.13139],"study_design_scores_gemma":[0.00001226887,0.00002647208,0.00002680344,0.00001201904,0.000003697332,0.00002464426,0.000005799427,0.9624441,0.002473034,0.03267767,0.00228732,0.000006175148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005325206,0.0002410772,0.9914967,0.0001589686,0.00006721135,0.00002504236,0.00002902863,0.000209913,0.002446853],"genre_scores_gemma":[0.4931603,0.0008259409,0.4985943,0.0002287943,0.0001687864,0.0002520548,0.0001610812,0.00009518211,0.006513484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002287391,"threshold_uncertainty_score":0.007353485,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Computer science; Arithmetic","authors":[{"name":"M. Nikhil Krishnan","is_ca":true},{"name":"Erfan Hosseini","is_ca":true},{"name":"Ashish Khisti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02218792357470338,"gpt":0.2947377955343279,"spread":0.2725498719596245,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004580864,0.001115209,0.0006479754,0.0005187622,0.000857906,0.001050406,0.001643572,0.0009166027,0.02333341],"category_scores_gemma":[0.001998802,0.0003109121,0.0004726217,0.0005240543,0.0006701324,0.001544692,0.001722984,0.001176224,0.005626932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009696863,"about_ca_system_score_gemma":0.001767443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004342019,"about_ca_topic_score_gemma":0.008512643,"domain_scores_codex":[0.9994197,0.0001095675,0.00002575284,0.0001094132,0.0002410505,0.00009462142],"domain_scores_gemma":[0.99932,0.0002438213,0.00004763182,0.0001573543,0.0001836215,0.00004759718],"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.0009868032,0.0002686495,0.001255904,0.0007073495,0.0001290325,0.0007587439,0.0003797902,0.4010805,0.04440544,0.1298768,0.03538682,0.3847641],"study_design_scores_gemma":[0.00007124143,0.0001772292,0.0001800617,0.00004605205,0.00002346501,0.0002414934,0.00007664527,0.9049437,0.02158895,0.04848152,0.02413116,0.0000384842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01375048,0.0004500254,0.9632367,0.0003696317,0.0002670681,0.0001423794,0.0002067925,0.005644465,0.01593235],"genre_scores_gemma":[0.3452819,0.0003367143,0.6199386,0.0004932717,0.0001183108,0.0003229995,0.0006059933,0.001023296,0.03187899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02333341,"threshold_uncertainty_score":0.078058,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jingjing Qian","is_ca":true},{"name":"Sadaf Salehkalaibar","is_ca":true},{"name":"Jun Chen","is_ca":true},{"name":"Ashish Khisti","is_ca":true},{"name":"Wei Yu","is_ca":true},{"name":"Wuxian Shi","is_ca":true},{"name":"Yiqun Ge","is_ca":true},{"name":"Wen Tong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00844123741768463,"gpt":0.2342088729274421,"spread":0.2257676355097575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004336691,0.001669275,0.001464424,0.000889506,0.0004303628,0.00220301,0.001327996,0.002010733,0.001750263],"category_scores_gemma":[0.01735758,0.0005959302,0.0005257649,0.001184582,0.001697965,0.004742581,0.002226824,0.001683619,0.0003979594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001748389,"about_ca_system_score_gemma":0.001014712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271498,"about_ca_topic_score_gemma":0.0006421847,"domain_scores_codex":[0.9975841,0.000943384,0.0001082421,0.0003500889,0.0007654345,0.0002488074],"domain_scores_gemma":[0.9914114,0.006805986,0.0005051577,0.0004095182,0.0007270811,0.0001407914],"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.0003836289,0.0001200933,0.0006096877,0.0003789737,0.00009548613,0.000303191,0.000226784,0.7492822,0.01541895,0.1769671,0.001629242,0.05458473],"study_design_scores_gemma":[0.00002129475,0.0001652538,0.0002533992,0.00003744914,0.00002007693,0.0003827917,0.0000720881,0.9313072,0.005120914,0.06148933,0.001087361,0.00004283356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02680026,0.002016981,0.9656044,0.0006751642,0.00006059158,0.00004824585,0.00007498563,0.0001093279,0.004610092],"genre_scores_gemma":[0.8274562,0.003936889,0.1625735,0.0003738177,0.000196274,0.0001657595,0.000158747,0.0001960832,0.004942691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004336691,"threshold_uncertainty_score":0.02293485,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Notation; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","authors":[{"name":"M. Nikhil Krishnan","is_ca":true},{"name":"Erfan Hosseini","is_ca":true},{"name":"Ashish Khisti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02406825409825405,"gpt":0.2722622865215812,"spread":0.2481940324233271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370605,0.0008388534,0.0008453175,0.000548788,0.0005996139,0.001208084,0.001922817,0.000922635,0.004071069],"category_scores_gemma":[0.005189398,0.0003753923,0.0004313424,0.0007697531,0.001160374,0.002320964,0.001565809,0.001752421,0.0007396216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002533478,"about_ca_system_score_gemma":0.001805455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0089922,"about_ca_topic_score_gemma":0.009579574,"domain_scores_codex":[0.9992661,0.0002442604,0.00002448358,0.0001095461,0.0001992749,0.0001562309],"domain_scores_gemma":[0.9983803,0.0009789455,0.00009400699,0.0001929912,0.0002587073,0.00009496077],"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.0003406846,0.00006936678,0.0005205546,0.0000944581,0.00002259923,0.0001030362,0.0001085154,0.8303576,0.001748444,0.1296972,0.005836811,0.03110085],"study_design_scores_gemma":[0.000009671738,0.00001081668,0.0000278602,0.000003273878,0.000002395451,0.00000716006,0.000005973093,0.9784297,0.0002930049,0.02076969,0.0004367617,0.000003738272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02900887,0.0004962906,0.961399,0.0009812553,0.0001462341,0.0001092545,0.0002290798,0.001005161,0.006624842],"genre_scores_gemma":[0.8244241,0.0006526182,0.1588253,0.0003636777,0.0001381636,0.0003163823,0.000420049,0.0002850826,0.01457448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0089922,"threshold_uncertainty_score":0.01838177,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Contraction (grammar); Medicine; Internal medicine","authors":[{"name":"Shahab Asoodeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004835886490959991,"gpt":0.2111399457812486,"spread":0.2063040592902886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01691751,0.001379939,0.002881649,0.001292086,0.001461626,0.003937283,0.004576081,0.003097506,0.006738852],"category_scores_gemma":[0.07695623,0.001047684,0.002072064,0.001354994,0.00555231,0.01372974,0.01005685,0.006941409,0.001035214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002832457,"about_ca_system_score_gemma":0.002329931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004015465,"about_ca_topic_score_gemma":0.000202238,"domain_scores_codex":[0.9869376,0.006174536,0.0006367436,0.002353278,0.002710948,0.001186929],"domain_scores_gemma":[0.9312836,0.04846819,0.005223436,0.009895911,0.003077233,0.002051756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004255074,0.0001274425,0.001626838,0.0001931396,0.00009244218,0.0003646979,0.0006719469,0.08934145,0.006255751,0.876316,0.001200135,0.02338468],"study_design_scores_gemma":[0.00008128553,0.0002011784,0.0003105766,0.00004642229,0.00002879914,0.0003134346,0.0001006232,0.401322,0.00289882,0.5930587,0.001592457,0.0000457004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06190771,0.0003349103,0.930742,0.00121092,0.00005695683,0.0001847969,0.0001865812,0.0002378206,0.005138359],"genre_scores_gemma":[0.8938959,0.0005158937,0.09504275,0.0006549609,0.0001363247,0.0009212271,0.0002483866,0.0001983501,0.008386253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01691751,"threshold_uncertainty_score":0.08946943,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Animesh Sakorikar","is_ca":true},{"name":"Lele Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007631716982751596,"gpt":0.2307816094533397,"spread":0.2231498924705881,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917122,0.0008323062,0.0007568059,0.0009198026,0.0005280217,0.001410032,0.001089847,0.001142338,0.004020916],"category_scores_gemma":[0.009384258,0.0003850464,0.0003677786,0.0008000821,0.002078261,0.002058664,0.002253089,0.001674605,0.001482816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007599298,"about_ca_system_score_gemma":0.0009928505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006133055,"about_ca_topic_score_gemma":0.0005493092,"domain_scores_codex":[0.9981551,0.0005961833,0.00008709931,0.0002744867,0.0006975248,0.00018959],"domain_scores_gemma":[0.9958852,0.001907646,0.0004912012,0.0008465846,0.0006687506,0.0002006105],"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.0003517854,0.00005360949,0.0007161192,0.0001805955,0.00002937757,0.0001414403,0.000131606,0.2215331,0.009955701,0.657868,0.003565556,0.1054731],"study_design_scores_gemma":[0.00004077368,0.0001586581,0.0002086182,0.00005994961,0.00001041855,0.0001883936,0.00002573796,0.7585486,0.006988348,0.2288258,0.004900201,0.00004461126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01927253,0.0004180416,0.9716789,0.0003278109,0.00008576474,0.00006643972,0.0001520656,0.0003059785,0.007692478],"genre_scores_gemma":[0.7364674,0.0006563241,0.2507005,0.0006093001,0.0001527731,0.0003532528,0.0003151321,0.0001927158,0.01055254],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004020916,"threshold_uncertainty_score":0.01345134,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Haider Al-Lawati","is_ca":true},{"name":"Tharindu Adikari","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006218310357429007,"gpt":0.2109675330618962,"spread":0.2047492227044672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265507,0.0008432697,0.001089594,0.0002427065,0.0005679227,0.000938058,0.002104819,0.001098392,0.004123438],"category_scores_gemma":[0.006526325,0.0004146419,0.0004394297,0.0003745904,0.001074799,0.001456793,0.001090613,0.00199611,0.000637034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252828,"about_ca_system_score_gemma":0.00173606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003101629,"about_ca_topic_score_gemma":0.003285432,"domain_scores_codex":[0.9989341,0.0003792985,0.000044975,0.0002964673,0.0001695018,0.0001756717],"domain_scores_gemma":[0.9962723,0.001987358,0.0002893264,0.0006814462,0.0004316241,0.0003379921],"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.0006669781,0.0002000117,0.0007986341,0.0001010691,0.00003887007,0.00005967405,0.00006738285,0.9468088,0.004672786,0.01668251,0.002183545,0.02771964],"study_design_scores_gemma":[0.00003515893,0.00005540958,0.0001083283,0.000002733219,0.000003757567,0.000007625429,0.000005774499,0.9939288,0.001038057,0.004536742,0.0002728125,0.0000048069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0962588,0.000328751,0.8983929,0.000419598,0.0001775789,0.0001474673,0.0001219201,0.001424796,0.002728288],"genre_scores_gemma":[0.8785309,0.00009493494,0.1177435,0.0001732959,0.00005941285,0.0002371567,0.0001378997,0.0001150599,0.002907947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004123438,"threshold_uncertainty_score":0.0137943,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ahmed H. Salamah","is_ca":true},{"name":"Kaixiang Zheng","is_ca":true},{"name":"Linfeng Ye","is_ca":true},{"name":"En‐hui Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0126917201907885,"gpt":0.3050254443854841,"spread":0.2923337241946956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071114,0.0007916527,0.0003113487,0.0009016357,0.0002934081,0.0006742217,0.0009376393,0.0006242573,0.004001833],"category_scores_gemma":[0.00234146,0.0001583513,0.0003098787,0.0008693773,0.0004015423,0.0009895449,0.0005132948,0.001117198,0.001372498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007140678,"about_ca_system_score_gemma":0.0007423947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00367615,"about_ca_topic_score_gemma":0.006135501,"domain_scores_codex":[0.9995173,0.00005042143,0.0000391929,0.00007471829,0.0002888238,0.0000295453],"domain_scores_gemma":[0.9994948,0.0001060447,0.00004523096,0.0001321335,0.000204579,0.00001719867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002701559,0.0001130415,0.001128863,0.0004105788,0.00007287274,0.0002518958,0.00007652045,0.05765354,0.08382867,0.03430898,0.02232846,0.7995564],"study_design_scores_gemma":[0.00005644278,0.0002062991,0.002123939,0.0001165898,0.00004558091,0.0008759919,0.00005021978,0.7558436,0.1708356,0.02343879,0.04635447,0.0000524135],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02075488,0.002345235,0.9634985,0.0004116287,0.0004332847,0.0002261354,0.000867263,0.002491949,0.008971076],"genre_scores_gemma":[0.2218094,0.002209563,0.7645697,0.000465737,0.0001618361,0.0002169643,0.002471602,0.0002826604,0.007812541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004001833,"threshold_uncertainty_score":0.01338744,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Tharindu Adikari","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009529290614629546,"gpt":0.2318131972925966,"spread":0.222283906677967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001681722,0.0006918095,0.0009511677,0.0004983591,0.0004228855,0.00107048,0.000748809,0.0008481907,0.001256608],"category_scores_gemma":[0.006766446,0.000396731,0.0003376199,0.0005767148,0.001361651,0.001390099,0.001648143,0.001267453,0.0002928617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007706904,"about_ca_system_score_gemma":0.00158836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002119549,"about_ca_topic_score_gemma":0.002638829,"domain_scores_codex":[0.99949,0.0001295234,0.00004297039,0.00007059261,0.0002216499,0.00004523894],"domain_scores_gemma":[0.9980348,0.001171079,0.0001567548,0.0002741505,0.0002776983,0.00008549196],"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.0001996283,0.00006598623,0.001427117,0.0001444337,0.00003443454,0.0001466085,0.0001569426,0.8209412,0.009338035,0.03643875,0.001824458,0.1292824],"study_design_scores_gemma":[0.0000071512,0.00002508526,0.00005307389,0.000005464436,0.000002117541,0.00001759845,0.000004897513,0.9942592,0.00144606,0.003823779,0.0003521382,0.000003322333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01578643,0.0002084368,0.982245,0.0002276453,0.00004070148,0.00004439259,0.00003570248,0.0003350285,0.00107658],"genre_scores_gemma":[0.6064258,0.0004290037,0.3893241,0.0002813263,0.00009193294,0.0002030376,0.0002009797,0.0001688886,0.002874971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002119549,"threshold_uncertainty_score":0.008893847,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Norbert Lütkenhaus","is_ca":true},{"name":"Ashutosh Marwah","is_ca":true},{"name":"Dave Touchette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01525613646474347,"gpt":0.2259497649719675,"spread":0.210693628507224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003519869,0.000688699,0.001066196,0.000882405,0.002098212,0.003784312,0.002771341,0.002598837,0.00718681],"category_scores_gemma":[0.01189471,0.0006599884,0.001225374,0.001418119,0.006077542,0.01093238,0.008259567,0.006475473,0.002227004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667114,"about_ca_system_score_gemma":0.001991422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004641347,"about_ca_topic_score_gemma":0.0003585762,"domain_scores_codex":[0.9941795,0.001891075,0.0003818409,0.0007762557,0.001904829,0.0008665165],"domain_scores_gemma":[0.9912598,0.002587749,0.0007556205,0.004185092,0.0008104804,0.0004013093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008022392,0.00001951813,0.00005502037,0.00004674112,0.000007644648,0.0001329157,0.0001907722,0.005704953,0.00214341,0.9847397,0.0008841555,0.005995065],"study_design_scores_gemma":[0.00006120116,0.00009586458,0.00006982363,0.0000633416,0.00001778036,0.0002167914,0.00008987567,0.06868747,0.00587075,0.9085337,0.01622956,0.00006374519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02330752,0.0003977819,0.9491409,0.001280621,0.0003757954,0.0001778312,0.0001612318,0.0003597075,0.02479857],"genre_scores_gemma":[0.7415285,0.0007510078,0.2317031,0.001077841,0.0004103046,0.0007551354,0.0002696684,0.0003140786,0.02319028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00718681,"threshold_uncertainty_score":0.02404225,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Alireza Naderi","is_ca":true},{"name":"Yaniv Plan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009189985625825691,"gpt":0.2144983561661759,"spread":0.2053083705403502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003319203,0.001588271,0.001398516,0.001020236,0.0005331559,0.001589511,0.002383059,0.002473225,0.002738558],"category_scores_gemma":[0.01458267,0.0009324214,0.001285841,0.001640155,0.002769845,0.002506079,0.0031681,0.003717104,0.0008623083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100148,"about_ca_system_score_gemma":0.001415596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004680116,"about_ca_topic_score_gemma":0.00407216,"domain_scores_codex":[0.9986065,0.0005849929,0.0000529005,0.0002823014,0.0003457922,0.0001275547],"domain_scores_gemma":[0.990991,0.007327454,0.000516944,0.0006189518,0.000344446,0.0002011785],"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.0002268628,0.00007280226,0.0006779452,0.0002997504,0.00008776748,0.0002970039,0.000202156,0.7267388,0.003209031,0.2252592,0.00409036,0.03883842],"study_design_scores_gemma":[0.00001813839,0.00002026036,0.0001021489,0.00002034204,0.00000981224,0.00004859869,0.00001371406,0.9163988,0.0007576258,0.08162823,0.0009663552,0.00001596367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005227423,0.0004379369,0.9915344,0.0008086876,0.00005405767,0.00002442316,0.0001483457,0.0001618443,0.001602864],"genre_scores_gemma":[0.4632101,0.003465605,0.516915,0.001030145,0.0008458982,0.0003895962,0.001729243,0.0004181903,0.01199619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004680116,"threshold_uncertainty_score":0.01755387,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nadim Ghaddar","is_ca":true},{"name":"Lele Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03720281742026299,"gpt":0.3126915071166416,"spread":0.2754886896963786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160807,0.0009156883,0.0006624256,0.0007711124,0.000598634,0.001522891,0.001028785,0.0009313803,0.002417748],"category_scores_gemma":[0.005882716,0.0003256453,0.0004904961,0.001152763,0.001321499,0.001798515,0.001503387,0.002614832,0.0006239438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696728,"about_ca_system_score_gemma":0.001359628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002610129,"about_ca_topic_score_gemma":0.002244546,"domain_scores_codex":[0.9990815,0.0002460119,0.00003025866,0.0001049992,0.0004119083,0.0001252817],"domain_scores_gemma":[0.9973704,0.001934371,0.0002028377,0.0001883037,0.0002521257,0.00005188421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001345163,0.00004446945,0.0003042844,0.0002082829,0.00003203192,0.0001370494,0.0002369361,0.411866,0.00735623,0.4877456,0.004104829,0.08782972],"study_design_scores_gemma":[0.00001886418,0.00004278219,0.00008658227,0.00003774252,0.00001055884,0.00006700552,0.0000424902,0.8144987,0.002749891,0.1796173,0.002812841,0.0000152022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01112139,0.001476337,0.9798332,0.0005615035,0.00006196064,0.00004296565,0.00008004336,0.0001142769,0.006708276],"genre_scores_gemma":[0.5910764,0.004087029,0.3933217,0.0004211597,0.0003662942,0.0003469829,0.0003486917,0.0001419553,0.009889726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002610129,"threshold_uncertainty_score":0.01231062,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Leakage (economics); Computer science; Internet privacy; Computer security; Economics","authors":[{"name":"Shahrzad Kiani","is_ca":true},{"name":"Franziska Boenisch","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008281932575904052,"gpt":0.2421834919386542,"spread":0.2339015593627501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01157473,0.001321747,0.002110399,0.0008195899,0.002175555,0.002680921,0.004494444,0.0021457,0.001609171],"category_scores_gemma":[0.04122942,0.0008063824,0.001166686,0.001441948,0.003181503,0.00760511,0.01061942,0.003330218,0.0005921501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001875031,"about_ca_system_score_gemma":0.003013452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001086047,"about_ca_topic_score_gemma":0.001056563,"domain_scores_codex":[0.98577,0.00572352,0.0007589065,0.003468436,0.003000542,0.001278617],"domain_scores_gemma":[0.9653342,0.0146359,0.002906309,0.01359614,0.002150489,0.001377022],"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.002575713,0.0007008278,0.009456102,0.0003171847,0.0002920283,0.0008831612,0.002739284,0.6277273,0.01429347,0.09197892,0.004393505,0.2446425],"study_design_scores_gemma":[0.00008561916,0.0002352459,0.0004314931,0.00002265553,0.00003407563,0.0001866212,0.000178687,0.8884352,0.007231149,0.1016586,0.001473744,0.0000269462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06011007,0.0001664399,0.9371189,0.0004409592,0.00003011141,0.000114398,0.00009626779,0.000759186,0.001163652],"genre_scores_gemma":[0.9018456,0.00007209901,0.09567057,0.000288089,0.0000411104,0.0001883841,0.0001426756,0.0001017252,0.001649781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01157473,"threshold_uncertainty_score":0.06121373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Tuvi Etzion","is_ca":false},{"name":"Paul H. Siegel","is_ca":false},{"name":"Han Mao Kiah","is_ca":false},{"name":"Hessam Mahdavifar","is_ca":false},{"name":"Farzad Parvaresh","is_ca":false},{"name":"Moshe Schwartz","is_ca":true},{"name":"Ido Tal","is_ca":false},{"name":"Eitan Yaakobi","is_ca":false},{"name":"Xinmiao Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01356073142735569,"gpt":0.2555760877282448,"spread":0.2420153563008891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308494,0.0009157211,0.001248812,0.001948021,0.0009021819,0.006045344,0.001119408,0.001259527,0.00553216],"category_scores_gemma":[0.00896313,0.0006136268,0.000714824,0.002872493,0.005192661,0.008369745,0.002913853,0.006110545,0.0009860661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002442034,"about_ca_system_score_gemma":0.001548924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009802898,"about_ca_topic_score_gemma":0.0005427025,"domain_scores_codex":[0.9981158,0.0007012531,0.0001071657,0.000254183,0.000675173,0.0001464852],"domain_scores_gemma":[0.9932586,0.004634763,0.0003103893,0.0006720815,0.0007922085,0.0003319781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002437246,0.00001170283,0.0002389808,0.000139543,0.00001941979,0.0000248919,0.0001032606,0.004827594,0.0002248342,0.9468247,0.01824797,0.02931269],"study_design_scores_gemma":[0.000007049447,0.00001820642,0.0001452133,0.00009352509,0.000006513378,0.00006803381,0.00005181245,0.01454679,0.0001465273,0.945929,0.03896921,0.00001821991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01841691,0.1652479,0.6544185,0.04719872,0.01287095,0.0001286305,0.0009510636,0.0005009901,0.1002664],"genre_scores_gemma":[0.5426667,0.2131823,0.1674455,0.008116232,0.03805041,0.0006904978,0.001006683,0.0006682859,0.02817338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006045344,"threshold_uncertainty_score":0.01850694,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Banghua Zhu","is_ca":false},{"name":"Ziao Wang","is_ca":true},{"name":"Nadim Ghaddar","is_ca":true},{"name":"Jiantao Jiao","is_ca":false},{"name":"Lele Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006234505061312398,"gpt":0.2377514455392171,"spread":0.2315169404779047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008367387,0.00151741,0.003466415,0.001029136,0.001596592,0.004542108,0.003121345,0.0022381,0.003069275],"category_scores_gemma":[0.05798368,0.0008644608,0.001176822,0.001750295,0.004934931,0.01298264,0.003922987,0.003350121,0.0009255889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002769026,"about_ca_system_score_gemma":0.002462461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002111658,"about_ca_topic_score_gemma":0.001599175,"domain_scores_codex":[0.9895874,0.004115622,0.0005269186,0.002233301,0.002315594,0.001221102],"domain_scores_gemma":[0.9587585,0.03155201,0.002401365,0.005144123,0.001502672,0.0006411494],"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.003953987,0.0002645996,0.006473434,0.0005897007,0.0002375332,0.0007053332,0.0006569657,0.6498179,0.01011573,0.2408841,0.004850704,0.08144993],"study_design_scores_gemma":[0.00004224193,0.000102149,0.0004824191,0.00003060455,0.00003081342,0.0001684117,0.00009368208,0.8516952,0.006450128,0.1400173,0.0008514347,0.00003565227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223393,0.001103063,0.8668756,0.002117895,0.0001455175,0.0001016677,0.0003636578,0.001305865,0.005647385],"genre_scores_gemma":[0.8749024,0.0003884707,0.120538,0.0005355405,0.0002464333,0.0002018528,0.0003664517,0.0002617257,0.002559149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008367387,"threshold_uncertainty_score":0.0442515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Trustworthiness; Computer science; Artificial intelligence; Data science; Machine learning; Computer security","authors":[{"name":"Lalitha Sankar","is_ca":false},{"name":"Oliver Kosut","is_ca":false},{"name":"Flávio P. Calmon","is_ca":false},{"name":"Ayfer Özgür","is_ca":false},{"name":"Lele Wang","is_ca":true},{"name":"Ofer Shayevitz","is_ca":false},{"name":"Parastoo Sadeghi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007238332404877398,"gpt":0.2908124293006692,"spread":0.2835740968957918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009800497,0.001601032,0.002682921,0.003737955,0.002110222,0.007078466,0.003329142,0.007791676,0.04103198],"category_scores_gemma":[0.03618053,0.001013888,0.002588941,0.002903191,0.004797735,0.008178947,0.003768785,0.0141169,0.01281984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002667604,"about_ca_system_score_gemma":0.002541673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009252068,"about_ca_topic_score_gemma":0.0009210882,"domain_scores_codex":[0.9939476,0.001624272,0.000418128,0.0007652142,0.002962071,0.0002826253],"domain_scores_gemma":[0.973472,0.0172042,0.000733721,0.003340943,0.004306646,0.0009424236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001227865,0.0001194724,0.0002270336,0.0008104435,0.0001479292,0.0001877196,0.00009065167,0.00306966,0.0008397292,0.2625538,0.6222466,0.1095842],"study_design_scores_gemma":[0.00005527322,0.000100441,0.0006530036,0.0008824278,0.0001130416,0.0004656618,0.00004939185,0.03789781,0.001283907,0.4541419,0.5042591,0.00009809618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002182297,0.05760207,0.3804434,0.1211911,0.340088,0.0002871933,0.001548693,0.0009760637,0.09568115],"genre_scores_gemma":[0.05396351,0.04905328,0.1194857,0.03651781,0.5617094,0.0007128917,0.002414145,0.002503174,0.1736401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04103198,"threshold_uncertainty_score":0.1372657,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Lens (geology); Through-the-lens metering; Data science; Physics; Computer science; Optics","authors":[{"name":"Jun Chen","is_ca":true},{"name":"Jerry D. Gibson","is_ca":false},{"name":"Ioannis Kontoyiannis","is_ca":false},{"name":"Yingbin Liang","is_ca":false},{"name":"S. Sandeep Pradhan","is_ca":false},{"name":"Andreas Winter","is_ca":false},{"name":"Ram Zamir","is_ca":false},{"name":"Richard E. Blahut","is_ca":false},{"name":"Yasutada Oohama","is_ca":false},{"name":"Aaron B. Wagner","is_ca":false},{"name":"Raymond W. Yeung","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01663811424803875,"gpt":0.256696536806175,"spread":0.2400584225581363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005280515,0.002190917,0.002450954,0.005072988,0.002948019,0.00921202,0.002232539,0.006199324,0.01349068],"category_scores_gemma":[0.02989197,0.0006240708,0.001433561,0.001915084,0.003012194,0.004331202,0.001043858,0.01090926,0.00457272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544937,"about_ca_system_score_gemma":0.002301587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000875758,"about_ca_topic_score_gemma":0.001512232,"domain_scores_codex":[0.9961672,0.0005382677,0.0004407312,0.0005887952,0.001966055,0.0002989093],"domain_scores_gemma":[0.9573961,0.02391658,0.001776299,0.001108735,0.01143941,0.004362847],"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.00006524871,0.00002103313,0.00009917534,0.0003649061,0.00002481964,0.0001446366,0.0000453548,0.00005241772,0.000106371,0.003686164,0.9867573,0.008632596],"study_design_scores_gemma":[0.00006571277,0.00005913628,0.0004974899,0.0005260868,0.00006771006,0.0004055566,0.0001572137,0.0004496629,0.0003193376,0.009094235,0.9883283,0.00002962881],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001453155,0.003368723,0.0003576522,0.03223494,0.9622532,0.00001273509,0.00009751922,0.00005352966,0.001476294],"genre_scores_gemma":[0.001331165,0.00213401,0.0001220557,0.005947721,0.9872595,0.000009683075,0.00002063173,0.00002429758,0.003150937],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.01349068,"threshold_uncertainty_score":0.04513079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}