{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089772,0.0001444525,0.0001142556,0.0005506004,0.0008135969,0.0001978818,0.0008403228,0.00004272998,0.0004876216],"category_scores_gemma":[0.0003775007,0.0001051196,0.00005328608,0.0009834566,0.00002748211,0.002326742,0.00009806847,0.001013357,0.0001235364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.0001070526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000149398,"about_ca_topic_score_gemma":4.752872e-7,"domain_scores_codex":[0.9976168,0.0009246872,0.0005142145,0.0001355754,0.0005935695,0.0002151919],"domain_scores_gemma":[0.9983303,0.0005200912,0.000453688,0.0004363423,0.0001993688,0.00006023424],"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.001001831,0.0002418998,0.00005522652,0.000007286118,0.00002766335,0.000009894878,0.002375202,0.05131926,0.002202434,0.6963533,0.07148478,0.1749212],"study_design_scores_gemma":[0.001800631,0.002142453,0.01248369,0.0001729218,0.00001484585,0.000454546,0.001354899,0.05276136,0.008035014,0.8312184,0.08873815,0.000823102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04290683,0.000009375201,0.9520319,0.0006716469,0.001200064,0.0002689042,0.000009925852,0.0002682954,0.002633134],"genre_scores_gemma":[0.9938745,0.00002018819,0.001000853,0.004788229,0.00007225096,0.0001095947,0.00002639496,0.000008483582,0.0000995391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.951031,"threshold_uncertainty_score":0.6257612,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007324272,0.0001330881,0.0001372945,0.0003319664,0.0003288598,0.0003527591,0.000358631,0.00005592152,0.00004618902],"category_scores_gemma":[0.0003340983,0.0001059632,0.00003108556,0.00114231,0.00002448019,0.001452382,0.00003569615,0.0006456756,0.000047903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001992384,"about_ca_system_score_gemma":0.0002602593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.417918e-7,"about_ca_topic_score_gemma":0.0000178629,"domain_scores_codex":[0.9984348,0.0005468758,0.0003809672,0.0001091674,0.0003331259,0.0001950867],"domain_scores_gemma":[0.9984812,0.0002658255,0.000256654,0.0003087659,0.0006137023,0.00007381383],"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.000501721,0.0002742052,0.0001438121,0.00001928916,0.00007166483,0.00004044197,0.006563887,0.07392117,0.001320267,0.4749921,0.0006165836,0.4415349],"study_design_scores_gemma":[0.01248163,0.004843829,0.02842748,0.00474074,0.00004910913,0.002686627,0.00402864,0.7347403,0.1190469,0.06500158,0.02122246,0.002730752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.221779,0.00005333814,0.7690879,0.0008224147,0.0003805472,0.0002145392,0.000001875998,0.0001319391,0.007528437],"genre_scores_gemma":[0.9970598,0.00009189261,0.001805439,0.0008768193,0.00004997485,0.00001689445,0.000006815897,0.000005784168,0.00008664509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7752807,"threshold_uncertainty_score":0.4321054,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657845,0.0001641299,0.0001706919,0.0009095724,0.0002333677,0.0001246884,0.00007329537,0.0001174016,0.000005553327],"category_scores_gemma":[0.0004377318,0.0001589371,0.00003443687,0.0008210056,0.00002924248,0.0008328141,0.00001030556,0.0002978087,0.00001237044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004098252,"about_ca_system_score_gemma":0.00004690911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002341085,"about_ca_topic_score_gemma":0.000001652852,"domain_scores_codex":[0.9989043,0.00008408366,0.0004459197,0.00008062347,0.0001901379,0.0002949668],"domain_scores_gemma":[0.9991722,0.0003424614,0.0001491854,0.00008710782,0.0001996577,0.00004938281],"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.0003236187,0.000009120117,0.0000256296,0.00004231141,0.00006476774,0.000004549464,0.002530136,0.9449447,0.01624577,0.00103354,0.0004752811,0.03430061],"study_design_scores_gemma":[0.00160633,0.0001798728,0.0004368197,0.0003132973,0.00002794,0.0001838494,0.002243722,0.6315021,0.3505023,0.01246632,0.0002089426,0.0003284911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3833672,0.00001503797,0.6148302,0.00003163959,0.0005905482,0.0003469739,0.000005722715,0.0005333734,0.0002792669],"genre_scores_gemma":[0.9975259,0.00007969602,0.002144162,0.00009710029,0.00009171492,0.00001115304,0.00001584732,0.00002455684,0.00000982589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6141587,"threshold_uncertainty_score":0.6481265,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390747,0.0001441012,0.0001552701,0.0007920043,0.0005776695,0.0002615311,0.0006742533,0.00005467069,0.00002664305],"category_scores_gemma":[0.001073963,0.0001460672,0.00006016118,0.001294244,0.00002063594,0.001992048,0.00006350097,0.000386559,0.000007505038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006075131,"about_ca_system_score_gemma":0.0001434838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001163396,"about_ca_topic_score_gemma":2.033226e-7,"domain_scores_codex":[0.9982218,0.0002398319,0.0006767771,0.0001468902,0.000460856,0.0002538533],"domain_scores_gemma":[0.9975579,0.0005869935,0.0009880266,0.0002394566,0.0005551892,0.00007244692],"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.0002863519,0.0001411579,0.0000974431,0.00002558053,0.00002489576,0.000001614621,0.002703091,0.2304682,0.0003521449,0.7473645,0.001918262,0.01661671],"study_design_scores_gemma":[0.00153139,0.0003114153,0.0005114102,0.00004395937,0.000008545783,0.000120401,0.0003521715,0.9283648,0.004038246,0.06349031,0.0009578224,0.0002695898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003506773,0.00001041573,0.9944336,0.0003444865,0.0004929923,0.0007030302,0.00005231981,0.0002485474,0.0002078082],"genre_scores_gemma":[0.9583608,0.000008141237,0.04043365,0.0003712591,0.00005908563,0.0004967032,0.0002353493,0.00001137,0.00002367931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.954854,"threshold_uncertainty_score":0.5956446,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009751496,0.0001255396,0.0001402351,0.000281381,0.0003076207,0.0004120303,0.0004544559,0.00008390554,0.00004825911],"category_scores_gemma":[0.0004751079,0.0001229192,0.00006903205,0.0008110151,0.00002230266,0.00192961,0.00004046055,0.0003516178,0.0000431819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002066321,"about_ca_system_score_gemma":0.0002895323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.178863e-7,"about_ca_topic_score_gemma":0.000006330532,"domain_scores_codex":[0.9984286,0.0003930354,0.0005894301,0.0001238688,0.0002563453,0.00020871],"domain_scores_gemma":[0.9976763,0.0003651383,0.0003359089,0.0003396398,0.001200662,0.00008232393],"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.0003099998,0.0002254723,0.0001726846,0.00003646604,0.00007819293,0.000005737737,0.005705968,0.01980561,0.01711701,0.6853191,0.004511812,0.266712],"study_design_scores_gemma":[0.007826976,0.0003846649,0.01144108,0.0005562882,0.00003454004,0.0005835732,0.0007220377,0.7019239,0.1632996,0.06657393,0.04557022,0.001083231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03901032,0.0001024289,0.9578657,0.000955258,0.0005606211,0.0002776894,0.00000674406,0.00009172224,0.001129585],"genre_scores_gemma":[0.9814135,0.0003177818,0.01678585,0.001028404,0.0001459686,0.00005102026,0.00008499564,0.000008127119,0.0001643003],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9424032,"threshold_uncertainty_score":0.5012501,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132537,0.0001807531,0.0001671495,0.0006139898,0.0002699364,0.00100445,0.0003370767,0.000127453,0.00007514661],"category_scores_gemma":[0.0001558411,0.0001515845,0.0001244792,0.001064673,0.00002971443,0.002378064,0.00001080748,0.00050029,0.000140887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003254025,"about_ca_system_score_gemma":0.000152248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001951249,"about_ca_topic_score_gemma":0.000002184948,"domain_scores_codex":[0.998396,0.00019887,0.0006175577,0.0001682972,0.0003001006,0.0003192197],"domain_scores_gemma":[0.9989495,0.0003199056,0.0001884929,0.0001755136,0.0002299128,0.0001366933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006141546,0.0001966638,0.00004087481,0.0001335134,0.0001691265,0.0000381176,0.00739574,0.04447256,0.001054749,0.1726986,0.03286995,0.740316],"study_design_scores_gemma":[0.001917881,0.0009544718,0.006601261,0.0005491953,0.00003779685,0.0007736502,0.0007987391,0.7934124,0.003612858,0.04815587,0.1423229,0.000862928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02123378,0.00008554175,0.9731306,0.0005938464,0.003291734,0.0002470262,0.00002184978,0.0003357786,0.001059827],"genre_scores_gemma":[0.9966961,0.00006295895,0.001814756,0.0005801603,0.0005552075,0.00003618682,0.00003887318,0.00001369622,0.0002021059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9754623,"threshold_uncertainty_score":0.968593,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001356234,0.0001468629,0.0001806087,0.0002703492,0.000430147,0.000504415,0.0005856784,0.00007965216,0.00004336553],"category_scores_gemma":[0.0003993782,0.0001373026,0.00008976788,0.000960119,0.00003097496,0.001508657,0.00007922902,0.0005248928,0.00001868563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002302053,"about_ca_system_score_gemma":0.0002340497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.586326e-7,"about_ca_topic_score_gemma":0.000006783003,"domain_scores_codex":[0.9982615,0.0004593275,0.0005906062,0.0001250937,0.0002430423,0.0003203974],"domain_scores_gemma":[0.9979162,0.0004778868,0.0002955363,0.000343211,0.0008514522,0.0001157712],"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.0001634593,0.0001175172,0.0002236098,0.00001655118,0.00007056977,0.00002249834,0.003279636,0.03143886,0.0003083069,0.7831456,0.004819007,0.1763944],"study_design_scores_gemma":[0.004950115,0.0004046096,0.003808623,0.0007218082,0.00002794188,0.001199663,0.0004785023,0.8727567,0.01258297,0.0409057,0.0611745,0.0009888682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01575848,0.0001866742,0.9797641,0.0007066203,0.001311243,0.0001771851,0.000002673271,0.00007961781,0.002013394],"genre_scores_gemma":[0.9927566,0.001055767,0.003890453,0.001905948,0.0002330897,0.00002692184,0.00002761765,0.000008349267,0.0000952379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9769982,"threshold_uncertainty_score":0.5599039,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926647,0.0001439925,0.0001630925,0.0005982234,0.00007919419,0.0001243109,0.0001024453,0.0001112939,0.0002570734],"category_scores_gemma":[0.00009217312,0.00012547,0.00007753626,0.0004453353,0.0000161673,0.001386369,0.000003786751,0.0005692758,0.0001108352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002167484,"about_ca_system_score_gemma":0.00006588596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002449072,"about_ca_topic_score_gemma":0.000005996157,"domain_scores_codex":[0.9987816,0.00008184276,0.0006413833,0.00005892979,0.0002606791,0.0001755167],"domain_scores_gemma":[0.9993144,0.0002175261,0.0001073799,0.00009430002,0.0002004064,0.00006601912],"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.000934854,0.0002520385,0.0002338719,0.0005141576,0.0007390589,0.00003996449,0.007446299,0.5058199,0.1122231,0.263114,0.00703653,0.1016463],"study_design_scores_gemma":[0.002766137,0.0008898213,0.01762006,0.002996033,0.0001971876,0.001235147,0.001847563,0.4557818,0.3120305,0.1650912,0.03822377,0.001320726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3802797,0.00007903613,0.6116611,0.00003781895,0.003489022,0.0001389309,0.00001321746,0.0002742611,0.004026928],"genre_scores_gemma":[0.9991096,0.0003123857,0.0003172907,0.0000388279,0.00009888921,0.000007391615,0.00001279444,0.00001775413,0.00008507902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6188299,"threshold_uncertainty_score":0.5116519,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002171746,0.0001382723,0.0001552734,0.0007505731,0.0006687466,0.0002575002,0.0005806196,0.00002716842,0.00005852523],"category_scores_gemma":[0.000902051,0.0001268223,0.00003233424,0.001101501,0.00004622422,0.001971182,0.0001562583,0.00101824,0.00001471725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002265086,"about_ca_system_score_gemma":0.0001552435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003722091,"about_ca_topic_score_gemma":8.564666e-7,"domain_scores_codex":[0.9980187,0.0006133349,0.0004445423,0.0001439887,0.0005122369,0.0002672194],"domain_scores_gemma":[0.9987639,0.0003982843,0.0003645096,0.000220584,0.0001651318,0.00008759227],"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.0003467757,0.0001125283,0.002675697,0.00003076591,0.00004839897,0.00004483091,0.01988666,0.5406979,0.0001597508,0.2432881,0.002021382,0.1906871],"study_design_scores_gemma":[0.005253037,0.001958583,0.03479577,0.0002600287,0.00004392095,0.006500901,0.004515142,0.6706004,0.002051182,0.215023,0.05715426,0.001843749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2133362,0.0001713755,0.7792045,0.001436151,0.002688828,0.0003056214,0.000006017931,0.0002306565,0.002620674],"genre_scores_gemma":[0.9960144,0.00002035421,0.003119431,0.0006622598,0.0001051036,0.00001768952,0.000003911067,0.000007372324,0.00004946267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7826782,"threshold_uncertainty_score":0.5171663,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006273478,0.0001974653,0.0002066779,0.0005962812,0.0002084657,0.0004419801,0.0004376688,0.0001060137,0.0001202392],"category_scores_gemma":[0.0004064669,0.0001732643,0.00004382147,0.001568836,0.00003752693,0.002669129,0.00003757229,0.0003910031,0.0000533463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002668654,"about_ca_system_score_gemma":0.0004607491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.905759e-7,"about_ca_topic_score_gemma":5.778083e-7,"domain_scores_codex":[0.9982017,0.00024317,0.0006047921,0.0001702157,0.0004814793,0.000298619],"domain_scores_gemma":[0.9978923,0.000299466,0.0004357223,0.0003126777,0.000940602,0.0001192708],"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.0001594488,0.00009983509,0.00005243187,0.00000927477,0.00005104087,0.00003966948,0.001900846,0.9625089,0.0001039232,0.02379336,0.0004847802,0.01079656],"study_design_scores_gemma":[0.001651795,0.0005340225,0.0002124978,0.0002977465,0.00002019729,0.001635754,0.0001576027,0.9698656,0.01631114,0.008664995,0.000165783,0.0004828486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004304375,0.00002863608,0.9900112,0.0002233757,0.0002477939,0.0001719106,0.000002858749,0.0002455976,0.004764312],"genre_scores_gemma":[0.3581567,0.00008661558,0.639573,0.001785327,0.0001239664,0.00004512704,0.00007605751,0.00003191156,0.0001213324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3538523,"threshold_uncertainty_score":0.7065511,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170613,0.000217122,0.0002273986,0.0008905982,0.0002525741,0.0006972417,0.0009548102,0.0001180703,0.00003948068],"category_scores_gemma":[0.0002750579,0.0001664823,0.00009084415,0.0008246368,0.00003777293,0.005230452,0.0001071306,0.0006602597,0.0001091269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002457967,"about_ca_system_score_gemma":0.0001591406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.305569e-7,"about_ca_topic_score_gemma":4.551511e-7,"domain_scores_codex":[0.9979931,0.0002110244,0.0007623964,0.0002138199,0.0004805463,0.0003391618],"domain_scores_gemma":[0.9979746,0.0008574832,0.0002680754,0.0004151599,0.0003489651,0.0001356909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003653619,0.0001308718,0.00001251442,0.0001265935,0.00003160344,0.00003036381,0.001240831,0.004060506,0.004571709,0.3250408,0.08119724,0.5831916],"study_design_scores_gemma":[0.001278522,0.000734231,0.0005441282,0.002811317,0.00001094912,0.0005410403,0.00008553925,0.3794203,0.04392299,0.3078624,0.2621743,0.0006143124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001764907,0.0001703529,0.9937348,0.0004330736,0.001383489,0.0003888423,0.00002738539,0.0005990078,0.001498146],"genre_scores_gemma":[0.8453033,0.0003312356,0.1510263,0.00231964,0.000439232,0.0001510831,0.0001264254,0.00004824333,0.0002545552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8435384,"threshold_uncertainty_score":0.678895,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009373337,0.0001723078,0.0002005542,0.0007713391,0.000174259,0.0004002289,0.0003956135,0.0001008065,0.00002429421],"category_scores_gemma":[0.0006619653,0.0001772786,0.00004371789,0.001487435,0.00002869854,0.003263063,0.00004965105,0.0005661909,0.00001958586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004048629,"about_ca_system_score_gemma":0.0001567514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003467146,"about_ca_topic_score_gemma":0.000001240588,"domain_scores_codex":[0.997796,0.0003451381,0.0008812094,0.0001646015,0.000492418,0.0003206313],"domain_scores_gemma":[0.9983969,0.0003316251,0.0005318727,0.0002213402,0.00041835,0.00009991258],"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.0004456339,0.001328279,0.02573592,0.0001087951,0.000116737,0.0002052999,0.0288048,0.4186393,0.003383747,0.360283,0.01683189,0.1441166],"study_design_scores_gemma":[0.003490507,0.0002735909,0.00522556,0.001097551,0.00000990922,0.0004862486,0.001114198,0.895459,0.02181629,0.06906649,0.001188775,0.0007718438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0589061,0.00004642472,0.937984,0.0001741607,0.0006981412,0.0001647017,0.000003606049,0.0001473417,0.001875489],"genre_scores_gemma":[0.9829719,0.00003171093,0.01615382,0.0006655114,0.00003741644,0.00002179992,0.00005215062,0.00001081859,0.00005485014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9240658,"threshold_uncertainty_score":0.722921,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389352,0.0001803531,0.0002151926,0.0003267701,0.000209443,0.0004612117,0.0008611595,0.00009271153,0.0001473812],"category_scores_gemma":[0.0001856516,0.0001561617,0.00008323181,0.001184503,0.00003012102,0.003701942,0.00006925673,0.000698178,0.0002175433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007642392,"about_ca_system_score_gemma":0.0001606012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001739844,"about_ca_topic_score_gemma":0.000002465649,"domain_scores_codex":[0.9981794,0.0002895806,0.0006547126,0.0001533881,0.0004527745,0.0002701684],"domain_scores_gemma":[0.9986683,0.0002646602,0.0003530952,0.0003061325,0.0001653928,0.0002424734],"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.001310961,0.0005338059,0.01217279,0.00005369989,0.0002076949,0.0001072064,0.02013325,0.002778507,0.000532922,0.8324991,0.08632907,0.04334097],"study_design_scores_gemma":[0.008342291,0.00186564,0.03962232,0.0004927891,0.00004475005,0.0002340428,0.002411334,0.1907482,0.01288607,0.5788125,0.1627191,0.001820946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3242505,0.000194283,0.6656477,0.002670807,0.001266001,0.0003497876,0.0001373411,0.0003223074,0.005161332],"genre_scores_gemma":[0.9903243,0.0000931222,0.003226008,0.006053196,0.0002071569,0.000008227767,0.00007893162,0.000007025975,0.000002055102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6660738,"threshold_uncertainty_score":0.636809,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303655,0.0001534907,0.0001635549,0.000548723,0.0003361255,0.0001003039,0.0002677465,0.00003652911,0.000038921],"category_scores_gemma":[0.00003288601,0.0001457936,0.00002910589,0.0007600057,0.00002046696,0.0003569426,0.00004020027,0.0006251712,0.0000160071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000291444,"about_ca_system_score_gemma":0.00005741527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002971835,"about_ca_topic_score_gemma":0.000005127458,"domain_scores_codex":[0.9989001,0.0001436653,0.000329264,0.00007972424,0.000328071,0.0002191466],"domain_scores_gemma":[0.9992366,0.0001013323,0.000117224,0.0002540018,0.0002016303,0.00008917071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002486376,0.00003596803,0.00004860638,0.000007160405,0.00006257303,0.00001553774,0.002648973,0.9667205,0.003729186,0.004646807,0.008556001,0.01328009],"study_design_scores_gemma":[0.007003956,0.002183336,0.005510118,0.0007694656,0.0001622843,0.003616716,0.007626999,0.3379626,0.3580543,0.06402195,0.2097702,0.003318108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2215229,0.00003441242,0.7692604,0.0001544154,0.0002704432,0.0006049086,0.00002769677,0.0005486411,0.007576106],"genre_scores_gemma":[0.9870403,0.00001236256,0.0119242,0.0008234481,0.00009630858,0.00003955021,0.00001848397,0.00002265602,0.00002270534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7655174,"threshold_uncertainty_score":0.5945289,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002078135,0.0001760391,0.0001930837,0.0005898765,0.0003862667,0.001571013,0.001241582,0.00009683786,0.00003517628],"category_scores_gemma":[0.0002375315,0.0001524027,0.00008911881,0.001301767,0.00005066464,0.003565227,0.0001075656,0.0007468497,0.00001727756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002928433,"about_ca_system_score_gemma":0.0001807584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.344729e-7,"about_ca_topic_score_gemma":0.000003647241,"domain_scores_codex":[0.9983493,0.0003345557,0.0006326446,0.0001425428,0.000233367,0.0003075679],"domain_scores_gemma":[0.9982255,0.0007252626,0.0002049224,0.0003292438,0.0004179194,0.00009722316],"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.00009261644,0.0000408199,0.00002254339,0.00004256376,0.00003061006,0.000004373187,0.001358107,0.004190169,0.00009481985,0.6346492,0.01038352,0.3490907],"study_design_scores_gemma":[0.0006802445,0.0002164844,0.0006645971,0.001249039,0.00001192548,0.0002227144,0.00006094782,0.8876483,0.007340792,0.06268805,0.03869601,0.0005208846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002234926,0.0002744045,0.9917296,0.0006775307,0.001447954,0.0003479429,0.000003208316,0.0003849202,0.002899535],"genre_scores_gemma":[0.9910668,0.001340342,0.005439368,0.001452589,0.0005432863,0.00006451244,0.00001687677,0.00001392812,0.00006227593],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9888319,"threshold_uncertainty_score":0.9994655,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002362593,0.0001983038,0.0002657723,0.0008112623,0.0003836334,0.00146202,0.0004160762,0.0001380904,0.00005363321],"category_scores_gemma":[0.0006364718,0.0001626751,0.00011839,0.001422863,0.00002885081,0.007216128,0.00004304052,0.001313443,0.0002183381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003064523,"about_ca_system_score_gemma":0.0001909535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000267563,"about_ca_topic_score_gemma":0.000001242133,"domain_scores_codex":[0.9975204,0.0006116843,0.0008215483,0.0001754684,0.000543554,0.0003273622],"domain_scores_gemma":[0.9986749,0.0004871541,0.0003463922,0.0001864182,0.0002168085,0.00008835099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001576852,0.0001546067,0.00008661095,0.0001348485,0.0002025467,0.00007506562,0.02533686,0.0395245,0.003995179,0.4444189,0.001656775,0.4828373],"study_design_scores_gemma":[0.003955614,0.0006456716,0.00100323,0.0008313599,0.00002330937,0.000584193,0.0003489401,0.9151554,0.004134359,0.05066148,0.02215264,0.0005038693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1430277,0.0002048582,0.8463756,0.000440292,0.002557356,0.0004568243,6.181175e-7,0.0005437076,0.00639304],"genre_scores_gemma":[0.9981742,0.0001787576,0.0006264596,0.0004580207,0.0003921163,0.00002600847,0.000007088166,0.00001122067,0.0001261197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8756309,"threshold_uncertainty_score":0.9995745,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001052422,0.0001448456,0.0001930502,0.001013273,0.0002318094,0.0001357033,0.0008214063,0.00007053824,0.00002524192],"category_scores_gemma":[0.0002081532,0.0001212157,0.00006278096,0.003191961,0.00002418373,0.0006756395,0.0001084341,0.0002733649,0.0009509335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009606118,"about_ca_system_score_gemma":0.0001253437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005950413,"about_ca_topic_score_gemma":0.000002158424,"domain_scores_codex":[0.9983851,0.0001529249,0.0006262204,0.0001669224,0.0003867051,0.0002821481],"domain_scores_gemma":[0.9981295,0.0005693001,0.0002395009,0.0004855901,0.0003457733,0.0002303579],"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.0001100593,0.0002359035,0.00004075114,0.00001762839,0.00007987148,0.000006492789,0.01364305,0.03022949,0.01120123,0.7286407,0.009938793,0.205856],"study_design_scores_gemma":[0.001886771,0.0004781704,0.01573594,0.0004634768,0.00004504975,0.0001135419,0.002219073,0.1117174,0.07061059,0.713195,0.08238203,0.001152989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01814279,0.00001124874,0.9788173,0.0008813143,0.0002645249,0.0004981311,0.00005431203,0.0002250492,0.001105339],"genre_scores_gemma":[0.9809715,0.00005857095,0.01596282,0.002153884,0.0001781444,0.000344296,0.00008966149,0.00002018612,0.0002209953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9628544,"threshold_uncertainty_score":0.999827,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430685,0.00007698852,0.0000884834,0.0002713168,0.0001696072,0.0002562246,0.0002678905,0.00003676995,0.00002891076],"category_scores_gemma":[0.0002208432,0.00004402331,0.00003505118,0.0008381592,0.00003038621,0.0007180323,0.0000401348,0.0005391099,0.00001905117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003938223,"about_ca_system_score_gemma":0.0001301229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003094159,"about_ca_topic_score_gemma":0.000001137391,"domain_scores_codex":[0.9990917,0.0001815208,0.0003248979,0.00006377335,0.0002155035,0.000122644],"domain_scores_gemma":[0.999251,0.0003415673,0.0001382293,0.0001238499,0.0001064283,0.00003891378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008427488,0.00004968057,0.0009191245,0.0001023356,0.00006487167,0.00001336513,0.01046769,0.02604636,0.0001331865,0.1112031,0.002796306,0.8481197],"study_design_scores_gemma":[0.0007082697,0.0002960374,0.02146811,0.0009019572,0.00001586581,0.001526627,0.0004946146,0.939936,0.0006329864,0.01343109,0.02033566,0.0002528266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654985,0.000130378,0.8248388,0.0009936879,0.002928041,0.0001287011,0.00000401463,0.000148437,0.005329405],"genre_scores_gemma":[0.9978103,0.00001631534,0.001336273,0.0003173058,0.0001101282,0.000001077709,7.889565e-7,0.000003744336,0.0004040451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9138896,"threshold_uncertainty_score":0.247078,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004667459,0.0002691065,0.000285867,0.001217221,0.0004038276,0.001073562,0.0005165744,0.0001563725,0.00007967473],"category_scores_gemma":[0.00240231,0.0002265464,0.00008529751,0.001111189,0.00005686291,0.00515332,0.00006701832,0.001501268,0.0001208503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002272094,"about_ca_system_score_gemma":0.000181333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003413342,"about_ca_topic_score_gemma":4.365216e-7,"domain_scores_codex":[0.9976244,0.0005885155,0.0008366815,0.0001775309,0.0003733155,0.0003995768],"domain_scores_gemma":[0.9969507,0.002000464,0.0003756477,0.0002341815,0.0003000142,0.0001389415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002841738,0.00001703776,0.00005790675,0.0001119669,0.0000452339,0.000004597386,0.006788636,0.1754133,0.00001425673,0.3128297,0.0006792831,0.5037539],"study_design_scores_gemma":[0.0009372893,0.0004286293,0.0001118393,0.0003353518,0.00001819704,0.0001957801,0.0002149986,0.8137536,0.0004428191,0.06865012,0.1146076,0.0003037076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00187304,0.000221026,0.9892712,0.0009162941,0.0016357,0.0003417957,0.000004276712,0.0002995019,0.005437177],"genre_scores_gemma":[0.6785647,0.0006541318,0.3139966,0.00460518,0.001061224,0.0001457602,0.0001033071,0.00007924705,0.0007898461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6766916,"threshold_uncertainty_score":0.9999634,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003504303,0.0002026918,0.0002317531,0.0002701576,0.0002010046,0.0008923708,0.001271221,0.0001218325,0.00001626345],"category_scores_gemma":[0.001169737,0.0001377769,0.000059781,0.001028637,0.000145409,0.01282587,0.0002574373,0.0008472146,0.00005672514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001193197,"about_ca_system_score_gemma":0.0004940587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008790115,"about_ca_topic_score_gemma":0.000001420976,"domain_scores_codex":[0.9973769,0.0005381096,0.0009161343,0.0001552572,0.0007441381,0.0002695193],"domain_scores_gemma":[0.9968538,0.001505476,0.0004075911,0.0006509908,0.0005084433,0.00007370192],"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.0001834218,0.00006946255,0.00003599498,0.0001020472,0.00009704525,0.00000146239,0.01756176,0.00610397,0.00002082003,0.7864941,0.03054147,0.1587885],"study_design_scores_gemma":[0.001338882,0.0004379257,0.001542211,0.0003358492,0.00004518595,0.0001552437,0.00112448,0.1862131,0.0005056204,0.6953565,0.1124267,0.0005182389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006447155,0.0001979686,0.9573179,0.0006262286,0.0325748,0.0003450066,0.0000499079,0.0001745018,0.002266483],"genre_scores_gemma":[0.9744753,0.0002463925,0.005770225,0.001550475,0.01783706,0.00001782047,0.00007187414,0.00001693888,0.00001396867],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9680281,"threshold_uncertainty_score":0.9298448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}