{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"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":"f6b8e9c02eda","filters":{"venue":"2022 IEEE International Symposium on Information Theory (ISIT)"}},"results":[{"id":"W4283810892","doi":"10.1109/isit50566.2022.9834438","title":"Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition Regime","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Privacy-Preserving Technologies in Data","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":"McMaster University","funders":"","keywords":"Differential privacy; Computer science; Gaussian; Mathematical optimization; Quantization (signal processing); Optimization problem; Entropy (arrow of time); Divergence (linguistics); Mathematics; Algorithm; Physics","authors":[{"name":"Wael Alghamdi","is_ca":false},{"name":"Shahab Asoodeh","is_ca":true},{"name":"Flávio P. Calmon","is_ca":false},{"name":"Oliver Kosut","is_ca":false},{"name":"Lalitha Sankar","is_ca":false},{"name":"Fei Wei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01140857930601131,"gpt":0.2474340815020232,"spread":0.2360255021960119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002176772,0.0003012288,0.0002165544,0.000593572,0.0006318426,0.0005597189,0.02238462,0.0001176558,0.00066185],"category_scores_gemma":[0.0006012143,0.0002674357,0.0001460032,0.0006462593,0.00004943779,0.002843895,0.01659294,0.0008652357,0.0002272181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006856779,"about_ca_system_score_gemma":0.00006695213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002054532,"about_ca_topic_score_gemma":0.000001456533,"domain_scores_codex":[0.9960854,0.0005492117,0.0007324801,0.0004475038,0.001718658,0.0004667117],"domain_scores_gemma":[0.9957839,0.0003725073,0.0004802742,0.003195899,0.000111489,0.00005599435],"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.0001950842,0.000264908,0.000006783361,0.00001146932,0.00006076656,0.00002535864,0.00210584,0.003367068,0.00445787,0.9598688,0.02781931,0.001816675],"study_design_scores_gemma":[0.001577714,0.0003819276,0.0001676961,0.00003301621,0.00001592996,0.0001848345,0.001027242,0.270168,0.01520289,0.6967481,0.0139707,0.0005219167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02007329,0.000007077164,0.9428208,0.02793051,0.003791115,0.0006403961,0.0003221261,0.0005267189,0.003887909],"genre_scores_gemma":[0.9782941,0.0000231917,0.0150254,0.005110863,0.00009781324,0.0005585949,0.0007384497,0.00002109017,0.0001305248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9582208,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655394","doi":"10.1109/isit50566.2022.9834716","title":"Calibration with Privacy in Peer Review","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Google","keywords":"Computer science; Pareto principle; Adversary; Block (permutation group theory); Calibration; Identity (music); Theoretical computer science; Adversary model; Information retrieval; Data mining; Computer security; Mathematical optimization; Mathematics","authors":[{"name":"Wenxin Ding","is_ca":false},{"name":"Gautam Kamath","is_ca":true},{"name":"Weina Wang","is_ca":false},{"name":"Nihar B. Shah","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01755080324033264,"gpt":0.2693768819320051,"spread":0.2518260786916725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002251672,0.0001930148,0.0001829739,0.0004038992,0.0002131331,0.0002440716,0.01363026,0.00005251147,0.0004993561],"category_scores_gemma":[0.002329592,0.0001796199,0.00005915501,0.0008074426,0.00004733153,0.003988354,0.01142908,0.0005285061,0.0001279009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000582548,"about_ca_system_score_gemma":0.00009738049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001878085,"about_ca_topic_score_gemma":0.000002318998,"domain_scores_codex":[0.9967513,0.0002402712,0.0006117183,0.0003174704,0.001834357,0.0002448646],"domain_scores_gemma":[0.9965076,0.0002030393,0.000385315,0.002611016,0.0002455461,0.00004744517],"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.0002203849,0.0002063622,0.000566371,0.0001518455,0.00008030832,0.00003164166,0.001080463,0.007727542,0.0002643503,0.3268655,0.6478869,0.01491825],"study_design_scores_gemma":[0.001876183,0.0005422111,0.0006319575,0.0005229264,0.00001820858,0.0002203975,0.0002847102,0.2731672,0.003348006,0.1850671,0.5334198,0.0009012172],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0107875,0.0002718827,0.4817193,0.441086,0.004419104,0.001924951,0.000454441,0.001596187,0.05774061],"genre_scores_gemma":[0.8630037,0.001789536,0.04528926,0.07691094,0.0003493715,0.00318658,0.004244838,0.00009893004,0.00512686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8522162,"threshold_uncertainty_score":0.9965663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655427","doi":"10.1109/isit50566.2022.9834505","title":"Iterative Water-Filling Power and Subcarrier Allocation for Multicarrier Non-Orthogonal Multiple Access Uplink","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subcarrier; Telecommunications link; Noma; Mathematical optimization; Computer science; Iterative method; Convergence (economics); Power (physics); Orthogonal frequency-division multiplexing; Power control; Mathematics; Telecommunications; Channel (broadcasting)","authors":[{"name":"Chin Choy Chai","is_ca":true},{"name":"Xiao–Ping Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009945829036046402,"gpt":0.2541736899520666,"spread":0.2442278609160202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005071036,0.0002463501,0.000188786,0.0003385289,0.0004835572,0.0002064386,0.0007668686,0.00009169975,0.000312558],"category_scores_gemma":[0.00009509699,0.0002392604,0.00009016055,0.0001446405,0.00007971482,0.001836201,0.0003058437,0.0003969657,0.00003052092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003537807,"about_ca_system_score_gemma":0.00001727096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000264311,"about_ca_topic_score_gemma":0.000001355101,"domain_scores_codex":[0.9985067,0.00005502063,0.0005782803,0.0002059818,0.0003939861,0.0002600944],"domain_scores_gemma":[0.998799,0.0003747334,0.0001557833,0.0003785925,0.0002301148,0.00006180643],"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.0004187957,0.00005703984,0.0004208772,0.00005064567,0.000218279,0.000001092943,0.005319662,0.9114109,0.0240737,0.04762042,0.0008311294,0.009577499],"study_design_scores_gemma":[0.001828778,0.0001663477,0.0004241515,0.00003388033,0.00001933698,0.0000172859,0.002001818,0.8117865,0.1367327,0.008670509,0.0376961,0.000622554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4308345,0.00005364804,0.5593523,0.001131744,0.002141011,0.001156196,0.0005725621,0.0007171227,0.004040984],"genre_scores_gemma":[0.9960321,0.00007087734,0.001134006,0.0004596857,0.00005203058,0.001174364,0.0008760404,0.00003745231,0.0001635064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5651976,"threshold_uncertainty_score":0.9756757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655492","doi":"10.1109/isit50566.2022.9834771","title":"Two-terminal source coding with common sum reconstruction","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Modulo; Source code; Algorithm; Distributed source coding; Computer science; Computation; Coding (social sciences); Binary number; Theoretical computer science; Rate distortion; Lossy compression; Terminal (telecommunication); Discrete mathematics; Variable-length code; Mathematics; Decoding methods; Arithmetic; Artificial intelligence; Computer network; Statistics","authors":[{"name":"Tharindu Adikari","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0074796377199129,"gpt":0.2318155201879125,"spread":0.2243358824679996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006602244,0.0002097596,0.0001753848,0.0003681845,0.0003840559,0.0001619336,0.0007259821,0.00005189735,0.000893193],"category_scores_gemma":[0.00001248946,0.0002286945,0.00007615122,0.0002540072,0.0000682891,0.001235147,0.000143326,0.0005883325,0.00009958665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006489507,"about_ca_system_score_gemma":0.00002365881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002288304,"about_ca_topic_score_gemma":0.000008376076,"domain_scores_codex":[0.9983285,0.0001624629,0.0005278434,0.0001376519,0.0006446957,0.0001988442],"domain_scores_gemma":[0.9989935,0.0001733822,0.0002302733,0.0004268149,0.0001132392,0.00006283097],"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.001045954,0.0001857025,0.001728887,0.0001082074,0.0004234294,0.00001483636,0.008619547,0.6028153,0.01017075,0.2773672,0.008435282,0.08908495],"study_design_scores_gemma":[0.004217547,0.0007935503,0.0007638689,0.000325858,0.00009616764,0.002211663,0.00877339,0.6390872,0.08018889,0.009971514,0.251457,0.002113326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7397527,0.00004334707,0.07178499,0.001062847,0.003165006,0.0008305659,0.0003051478,0.002450912,0.1806045],"genre_scores_gemma":[0.9979317,0.00004960342,0.0005148073,0.0005231553,0.0001024953,0.0002840724,0.0002954483,0.00003354323,0.000265159],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2673957,"threshold_uncertainty_score":0.9779837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289713080","doi":"10.1109/isit50566.2022.9834362","title":"Coded Categorization in Massive Random Access","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"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":"Order (exchange); Base (topology); Combinatorics; Listing (finance); Set (abstract data type); Computer science; Code (set theory); Discrete mathematics; Algorithm; Information retrieval; Mathematics; Programming language","authors":[{"name":"Ryan Song","is_ca":true},{"name":"Kareem M. Attiah","is_ca":true},{"name":"Wei Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01878982412312522,"gpt":0.2801590760765341,"spread":0.2613692519534089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256405,0.0001651427,0.0001603316,0.00047633,0.0004523743,0.0004755883,0.002354278,0.00004015028,0.0008956591],"category_scores_gemma":[0.00008650773,0.000174322,0.00007713975,0.0008061388,0.00003116085,0.003054871,0.0007781264,0.0003871286,0.0001363964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005704645,"about_ca_system_score_gemma":0.00008653143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001110309,"about_ca_topic_score_gemma":0.000009381835,"domain_scores_codex":[0.9977501,0.0005308652,0.0005952179,0.0002260715,0.0006990777,0.0001986414],"domain_scores_gemma":[0.9985667,0.0003265886,0.0003426755,0.0004899366,0.0002155682,0.00005853043],"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.0003058498,0.0001226604,0.0003248451,0.000005619241,0.00004067253,0.00000474453,0.004377173,0.1965231,0.0007989042,0.7760398,0.004240219,0.01721638],"study_design_scores_gemma":[0.004954051,0.0001848829,0.001587633,0.00003848652,0.000008502234,0.00002834486,0.0006337097,0.8781642,0.004596063,0.02110353,0.08807781,0.0006227939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02410379,0.00007395532,0.8554333,0.01346338,0.006130929,0.001101085,0.00007636795,0.0003824823,0.09923464],"genre_scores_gemma":[0.9942429,0.0001818674,0.0001885435,0.003913342,0.00007679869,0.0003565597,0.0002474615,0.000009276876,0.0007832551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9701391,"threshold_uncertainty_score":0.9806839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281676012","doi":"10.1109/isit50566.2022.9834613","title":"MetaSSD: Meta-Learned Self-Supervised Detection","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Research Foundation of Korea","keywords":"Computer science; Viterbi algorithm; Artificial intelligence; Machine learning; Symbol (formal); Channel (broadcasting); Meta learning (computer science); Detector; Supervised learning; Semi-supervised learning; Artificial neural network; Hidden Markov model; Task (project management)","authors":[{"name":"Moon Jeong Park","is_ca":true},{"name":"Jungseul Ok","is_ca":true},{"name":"Yo–Seb Jeon","is_ca":false},{"name":"Dongwoo Kim","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02604886461964958,"gpt":0.2520466213999967,"spread":0.2259977567803471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001978387,0.0002988701,0.0002863317,0.0006368827,0.0007297296,0.0004786692,0.001787859,0.00008215974,0.001698157],"category_scores_gemma":[0.00008616294,0.0003001232,0.0003311392,0.0008049228,0.00003289535,0.003675403,0.000352684,0.0004733457,0.0007371765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000838569,"about_ca_system_score_gemma":0.00008856061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000196447,"about_ca_topic_score_gemma":0.000002167609,"domain_scores_codex":[0.9959814,0.0006766441,0.000859693,0.0004454008,0.001744004,0.0002928557],"domain_scores_gemma":[0.997758,0.0003790019,0.0006351714,0.0007531408,0.0003533262,0.0001213319],"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.0003371636,0.0003885115,0.00004550345,0.00002464457,0.001664437,0.000006705885,0.004139797,0.1592159,0.020865,0.7698121,0.002442128,0.04105815],"study_design_scores_gemma":[0.001398195,0.0003566208,0.0005071945,0.000005804191,0.0002239248,0.00008050656,0.0004496104,0.84952,0.03079149,0.02219572,0.0938009,0.0006700602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02148816,0.00003835329,0.9303285,0.008891102,0.006496328,0.0009709954,0.0001377195,0.001360921,0.03028794],"genre_scores_gemma":[0.9928529,0.00001595067,0.002282375,0.002891945,0.000160721,0.0007546747,0.0001789518,0.00002246901,0.000840006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9713647,"threshold_uncertainty_score":0.9999451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655346","doi":"10.1109/isit50566.2022.9834637","title":"On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Low-density parity-check code; Mathematics; Coupling (piping); Enhanced Data Rates for GSM Evolution; Code (set theory); Decoding methods; Probabilistic logic; Computer science; Algorithm; Discrete mathematics; Statistics; Telecommunications","authors":[{"name":"Sima Naseri","is_ca":true},{"name":"Ali Dehghan","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00882573477938818,"gpt":0.2607892121112024,"spread":0.2519634773318142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156003,0.0002115359,0.0002265991,0.0004918316,0.0001811074,0.0001250616,0.001585911,0.00006459892,0.000780192],"category_scores_gemma":[0.0002481339,0.0002261733,0.0001188942,0.0004515561,0.00004436923,0.001167281,0.0003794875,0.0004693847,0.000162651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004873523,"about_ca_system_score_gemma":0.00008753584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001089131,"about_ca_topic_score_gemma":0.00001584811,"domain_scores_codex":[0.9973124,0.0002982288,0.0007716444,0.0002634923,0.001130861,0.0002234287],"domain_scores_gemma":[0.9976671,0.001054506,0.00054855,0.0004958498,0.0001830083,0.00005092686],"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.0005070011,0.0003527442,0.001630587,0.0000257759,0.00006425279,0.00001581618,0.006454903,0.2727588,0.001491734,0.7093573,0.001421671,0.005919477],"study_design_scores_gemma":[0.00196081,0.0007506617,0.002023109,0.0001645033,0.00001116291,0.00006853875,0.0005030244,0.8479732,0.02579239,0.1155866,0.00437482,0.00079119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6162701,0.000007152285,0.2876809,0.001505425,0.004310805,0.0007386584,0.0001823281,0.0006502855,0.0886543],"genre_scores_gemma":[0.9965596,0.00001393705,0.001291611,0.001505868,0.00004511346,0.0001525039,0.00007984033,0.00001415174,0.0003373268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5937707,"threshold_uncertainty_score":0.922308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655226","doi":"10.1109/isit50566.2022.9834835","title":"Converting a 1×K Static Rayleigh Channel to K Parallel AWGN Using Media-based Modulation","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Ciena (Canada)","funders":"","keywords":"Additive white Gaussian noise; Independent and identically distributed random variables; Channel (broadcasting); Topology (electrical circuits); Algorithm; Modulation (music); Computer science; Decoding methods; Telecommunications; Mathematics; Random variable; Physics; Statistics; Combinatorics; Acoustics","authors":[{"name":"Ehsan Seifi","is_ca":true},{"name":"Amir K. Khandani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01690535446655446,"gpt":0.2484736210892677,"spread":0.2315682666227133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005610485,0.0002393226,0.0001980922,0.0005984259,0.0003510374,0.00008531909,0.0008275348,0.0000691042,0.0004182066],"category_scores_gemma":[0.0001523087,0.0002801286,0.0000853495,0.0004642492,0.00004277467,0.0009588847,0.0001853785,0.0004083788,0.0001395546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009685347,"about_ca_system_score_gemma":0.00003548703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000985345,"about_ca_topic_score_gemma":0.000001908797,"domain_scores_codex":[0.9980214,0.0001159727,0.0006927499,0.0001726161,0.0007268363,0.0002704844],"domain_scores_gemma":[0.9986843,0.0003619283,0.0002516978,0.000476108,0.0001506029,0.00007530436],"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.0001157307,0.00002819172,0.00002999734,0.00001966399,0.00004333575,0.000001231722,0.001475523,0.9765713,0.003949195,0.01381169,0.0004134265,0.003540739],"study_design_scores_gemma":[0.0006717575,0.0000593492,0.0001119825,0.00003365981,0.000007628093,0.000007135,0.001500555,0.9778211,0.009935075,0.005688814,0.003835593,0.0003274203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1918274,0.00002974871,0.7993433,0.001284455,0.002208046,0.0006630988,0.0002559324,0.001246803,0.003141268],"genre_scores_gemma":[0.9949059,0.00001998267,0.002918186,0.001230852,0.00005829977,0.0004003949,0.0003799432,0.00003920771,0.00004722977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8030785,"threshold_uncertainty_score":0.9999651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289713053","doi":"10.1109/isit50566.2022.9834678","title":"The platypus of the quantum channel zoo","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Platypus; Channel (broadcasting); Computer science; Zoology; Telecommunications; Biology","authors":[{"name":"Felix Leditzky","is_ca":true},{"name":"Debbie Leung","is_ca":true},{"name":"Vikesh Siddhu","is_ca":false},{"name":"Graeme Smith","is_ca":false},{"name":"John A. Smolin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006056714379911874,"gpt":0.2162729846440621,"spread":0.2102162702641502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255841,0.0001511654,0.0001145667,0.0001191109,0.00109833,0.000200715,0.002784372,0.00003241296,0.00006227518],"category_scores_gemma":[0.00006799671,0.00009608921,0.0001687178,0.0004015173,0.00008259297,0.0004552386,0.0007693407,0.000439127,0.00004677082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001380787,"about_ca_system_score_gemma":0.00007435281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001562452,"about_ca_topic_score_gemma":0.000001129984,"domain_scores_codex":[0.9978102,0.0002709289,0.0004925042,0.000171085,0.001034616,0.0002206765],"domain_scores_gemma":[0.998288,0.0004860615,0.0004638764,0.0005895292,0.0001304791,0.00004207003],"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.00009127564,0.00005535201,0.00002603574,0.000006474193,0.00006591026,0.000001436865,0.003973185,0.2329196,0.0002650329,0.7457549,0.004648413,0.01219239],"study_design_scores_gemma":[0.0004221272,0.0001634075,0.0004931056,0.0000193842,0.000005586695,0.00006639052,0.0004428797,0.8818716,0.002077284,0.05486216,0.0593889,0.0001871425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4081337,0.0002541726,0.4022971,0.06398042,0.06393196,0.002006585,0.000497862,0.0007710764,0.05812713],"genre_scores_gemma":[0.9968809,0.0000135295,0.000115399,0.00197128,0.0001622203,0.00006117908,0.00001434268,0.000008642442,0.0007724686],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6908928,"threshold_uncertainty_score":0.8447575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226193467","doi":"10.1109/isit50566.2022.9834398","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Time complexity","authors":[{"name":"Ziao Wang","is_ca":true},{"name":"Ning Zhang","is_ca":true},{"name":"Weina Wang","is_ca":false},{"name":"Lele Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01938843897496104,"gpt":0.2559160239593848,"spread":0.2365275849844237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079584,0.000191564,0.0001631319,0.0002923919,0.0004850384,0.00009761936,0.001523659,0.0000410092,0.00008024294],"category_scores_gemma":[0.00006840858,0.000153539,0.0002072317,0.0005821601,0.00006158511,0.0005117239,0.0002721226,0.0002558008,0.00002456023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002986729,"about_ca_system_score_gemma":0.00003250689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003902341,"about_ca_topic_score_gemma":2.593804e-7,"domain_scores_codex":[0.9976664,0.0002133284,0.0005651967,0.0002564091,0.001046404,0.0002523061],"domain_scores_gemma":[0.997757,0.0008876617,0.0005426194,0.0005409423,0.0002145683,0.00005717312],"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.0002073412,0.00009003528,0.000005752458,0.000004613428,0.00004427516,0.000001609525,0.0004426097,0.3780485,0.0002151134,0.6126664,0.005608271,0.002665397],"study_design_scores_gemma":[0.002102069,0.001257577,0.0001246029,0.00005842588,0.00002189267,0.00008961225,0.0005236362,0.7686737,0.01760436,0.1822829,0.02675579,0.0005054588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01681614,0.00001614906,0.9686847,0.005385523,0.003713158,0.001088044,0.0001844194,0.0001405701,0.003971271],"genre_scores_gemma":[0.99337,0.00001906552,0.0009638739,0.004358794,0.00008129154,0.000657267,0.0001432333,0.00001501418,0.0003914402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9765539,"threshold_uncertainty_score":0.6261138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655252","doi":"10.1109/isit50566.2022.9834449","title":"The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Science Foundation","keywords":"Matrix completion; Computer science; Stochastic block model; Recommender system; Matrix (chemical analysis); Rank (graph theory); Low-rank approximation; Computational complexity theory; Similarity (geometry); Context (archaeology); Sample complexity; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Artificial intelligence; Machine learning; Cluster analysis","authors":[{"name":"Adel Elmahdy","is_ca":false},{"name":"Junhyung Ahn","is_ca":true},{"name":"Soheil Mohajer","is_ca":false},{"name":"Changho Suh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01200499400515911,"gpt":0.2644584007602411,"spread":0.252453406755082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001022036,0.0001899343,0.0002245641,0.0001784069,0.0008165217,0.0001260052,0.0007519941,0.0000236038,0.002196594],"category_scores_gemma":[0.00001346755,0.00015178,0.0002068781,0.0003517143,0.0002712054,0.0003836437,0.0002344374,0.0004463277,0.00001679162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001523197,"about_ca_system_score_gemma":0.00004792387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001890772,"about_ca_topic_score_gemma":0.000008960052,"domain_scores_codex":[0.9977595,0.000307496,0.0006197013,0.0001763544,0.000916648,0.0002202751],"domain_scores_gemma":[0.9982465,0.0005814899,0.0005187905,0.0003707068,0.0002240851,0.00005841478],"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.0006931378,0.0001453418,0.002973001,0.000004750899,0.0002476781,3.347064e-7,0.0004405959,0.0362035,0.0001791455,0.9543259,0.002718992,0.002067583],"study_design_scores_gemma":[0.002397861,0.001033128,0.00734487,0.00004378681,0.0001656266,0.00002018003,0.002954663,0.2111435,0.004268742,0.6291242,0.1406033,0.0009002435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4996435,0.00002051552,0.4446167,0.004136541,0.001112406,0.001252724,0.00289554,0.0002906955,0.04603136],"genre_scores_gemma":[0.9971742,0.000004313121,0.001125156,0.0002177846,0.00011414,0.000165293,0.001053012,0.00001271196,0.0001333991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4975307,"threshold_uncertainty_score":0.9987155,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655131","doi":"10.1109/isit50566.2022.9834759","title":"Modeling Network Contagion Via Interacting Finite Memory Pólya Urns","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Markov chain; Mathematics; Aperiodic graph; Homogeneous; Markov process; Combinatorics; Statistics","authors":[{"name":"Somya Singh","is_ca":true},{"name":"Fady Alajaji","is_ca":true},{"name":"Bahman Gharesifard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009533213423982735,"gpt":0.2525498501294524,"spread":0.2430166367054696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001142097,0.0002633391,0.0002549773,0.0002700916,0.0006405525,0.0002099884,0.0006827891,0.00003689227,0.005766346],"category_scores_gemma":[0.00001715324,0.000289843,0.0002859736,0.000328184,0.00002615936,0.001117198,0.0003347076,0.0006224677,0.000183911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003608135,"about_ca_system_score_gemma":0.00003904305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000156584,"about_ca_topic_score_gemma":0.000004067809,"domain_scores_codex":[0.9976169,0.000259458,0.0008370696,0.0002538391,0.0007100709,0.0003226539],"domain_scores_gemma":[0.9984928,0.0003878134,0.0004926952,0.0003547385,0.0001920561,0.00007986963],"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.0002337737,0.00007555523,0.0005040776,0.00000378253,0.0002366687,0.000001409182,0.001115921,0.9245724,0.0002364158,0.06039405,0.003621538,0.00900441],"study_design_scores_gemma":[0.0004882761,0.00008534625,0.00001745917,0.00003527933,0.00004506212,0.000006520338,0.001513869,0.9596782,0.0005621588,0.02189845,0.01532429,0.0003450678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1075894,0.0000199839,0.7628575,0.0006839043,0.003744325,0.0005698273,0.0001630223,0.000354943,0.1240171],"genre_scores_gemma":[0.9956257,0.000004571211,0.0002816072,0.00112098,0.0009991698,0.0002455962,0.0008934259,0.00002670867,0.0008022947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8880362,"threshold_uncertainty_score":0.9999554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655091","doi":"10.1109/isit50566.2022.9834891","title":"Maximum-Length Low-Density MDS Codes and Near Resolvable Designs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Separable space; Discrete mathematics; Code (set theory); Computer science; Mathematical analysis","authors":[{"name":"Odae Al Aboud","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01110291532929121,"gpt":0.2274738459194741,"spread":0.2163709305901829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894485,0.0002090222,0.0001785585,0.0003064421,0.0009703758,0.0005734732,0.001207742,0.00005523425,0.0004701611],"category_scores_gemma":[0.00005105224,0.0002182895,0.000125096,0.0004217048,0.0001090588,0.001783981,0.0005210965,0.0003700769,0.0001434279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001804643,"about_ca_system_score_gemma":0.00006059907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001909951,"about_ca_topic_score_gemma":0.000001726549,"domain_scores_codex":[0.9978188,0.0003584974,0.0004551974,0.0003008434,0.0007977764,0.0002689345],"domain_scores_gemma":[0.9986356,0.0003712449,0.0002679033,0.0004749473,0.0001404584,0.0001098061],"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.0004313299,0.0001192183,0.0002652298,0.00001763985,0.00009636293,0.00001097951,0.003902531,0.007554746,0.001433689,0.9717873,0.003950924,0.0104301],"study_design_scores_gemma":[0.00331242,0.001533598,0.002199466,0.00009673899,0.00005681434,0.0003751414,0.002089511,0.2155253,0.01965979,0.5861243,0.1674083,0.001618617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5012611,0.00007085833,0.4251609,0.003597357,0.005458731,0.0007427969,0.0002291226,0.0007969493,0.06268224],"genre_scores_gemma":[0.994606,0.00003284015,0.001419,0.003199593,0.00008985068,0.00009875264,0.00006901229,0.00001200252,0.0004729278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.493345,"threshold_uncertainty_score":0.8901588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3182847896","doi":"10.1109/isit50566.2022.9834826","title":"Trade-Based LDPC Codes","year":2022,"lang":"en","type":"preprint","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Parity-check matrix; Mathematics; Girth (graph theory); Tanner graph; Matrix (chemical analysis); Parity (physics); Invariant (physics); Exponent; Discrete mathematics; Combinatorics; Algorithm; Decoding methods; Error floor","authors":[{"name":"Farzane Amirzade","is_ca":true},{"name":"Daniel Panario","is_ca":true},{"name":"Mohammad‐Reza Sadeghi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01530122453569908,"gpt":0.2753598591568853,"spread":0.2600586346211862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002199481,0.0005494308,0.0004162985,0.0008878862,0.0003748955,0.0008953097,0.004919915,0.0003093374,0.0009158492],"category_scores_gemma":[0.0001883918,0.000596237,0.0004165582,0.0004041484,0.00008128392,0.001568274,0.001468575,0.001667154,0.0002620294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290012,"about_ca_system_score_gemma":0.0003448355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005207846,"about_ca_topic_score_gemma":0.000004177052,"domain_scores_codex":[0.9954512,0.0004959462,0.001132707,0.0006596464,0.001863642,0.0003968566],"domain_scores_gemma":[0.9963558,0.000668128,0.001128559,0.001469295,0.0002419252,0.0001362317],"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.000467081,0.0004662864,0.0003132051,0.0002440664,0.0004014434,0.00004237712,0.007806859,0.2158119,0.001094841,0.6952833,0.04967812,0.0283905],"study_design_scores_gemma":[0.001694175,0.0007391568,0.0007182253,0.0005706478,0.00008421155,0.00009127764,0.0005783271,0.6337661,0.0397785,0.1229236,0.1963281,0.002727735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007647805,0.00004218379,0.8474434,0.008574725,0.01869132,0.001240646,0.0005112838,0.003011517,0.1128371],"genre_scores_gemma":[0.971148,0.00007897395,0.01244766,0.01158005,0.0005653155,0.001304238,0.001354366,0.00007837253,0.001443069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9635001,"threshold_uncertainty_score":0.9999974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655275","doi":"10.1109/isit50566.2022.9834685","title":"Graph-assisted Matrix Completion in a Multi-clustered Graph Model","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Exploit; Leverage (statistics); Matrix completion; Cluster analysis; Graph; Theoretical computer science; Algorithm; Artificial intelligence","authors":[{"name":"Geewon Suh","is_ca":true},{"name":"Changho Suh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01844345604382604,"gpt":0.2851759283114796,"spread":0.2667324722676536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008460565,0.0002518551,0.0002687263,0.0007743681,0.0003390098,0.0001431429,0.0006686838,0.00004130579,0.002099582],"category_scores_gemma":[0.000006847824,0.0002784987,0.0002858462,0.0006206941,0.00004565234,0.0007405287,0.0002258955,0.0004404212,0.00008110625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003688764,"about_ca_system_score_gemma":0.0000420955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001532435,"about_ca_topic_score_gemma":0.000015077,"domain_scores_codex":[0.9976686,0.0002531355,0.0008227449,0.0002593918,0.0007280289,0.000268128],"domain_scores_gemma":[0.9988457,0.0001177073,0.0004736129,0.0003488823,0.0001468239,0.0000672684],"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.0005254521,0.0006087548,0.003608886,0.00001210878,0.0002673317,0.000002386226,0.001746892,0.6720152,0.002016139,0.3084743,0.006014892,0.004707638],"study_design_scores_gemma":[0.002072759,0.000104509,0.001758056,0.00003136259,0.00004255371,0.000007082971,0.0009829308,0.9332152,0.0006631279,0.05489304,0.005724458,0.0005049394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2978917,0.00001996713,0.660265,0.001097237,0.001223298,0.001158215,0.0009852181,0.0003870566,0.03697233],"genre_scores_gemma":[0.9957277,0.000004904073,0.0008934275,0.0005036272,0.00008681748,0.0004470971,0.001418369,0.00002084817,0.0008972324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.697836,"threshold_uncertainty_score":0.9999667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655150","doi":"10.1109/isit50566.2022.9834389","title":"Successive Approximation for Coded Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":0,"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":"Computer science; Computation; Multiplication (music); Matrix multiplication; Parallel computing; Computational science; Matrix (chemical analysis); Supercomputer; Algorithm; Theoretical computer science; Mathematics","authors":[{"name":"Shahrzad Kiani","is_ca":true},{"name":"Stark C. Draper","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01043538658053691,"gpt":0.2684972520790731,"spread":0.2580618654985362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110182,0.0002138024,0.0001660527,0.0005159269,0.0005854583,0.0003233983,0.001552426,0.00006622474,0.0001960811],"category_scores_gemma":[0.0002187267,0.0002332048,0.0001364686,0.0004790433,0.00003844188,0.00238317,0.0002716606,0.000213105,0.0000874314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006089481,"about_ca_system_score_gemma":0.00006695859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006867884,"about_ca_topic_score_gemma":3.063622e-7,"domain_scores_codex":[0.9976591,0.0001486957,0.0006984644,0.0003363116,0.0009162698,0.0002411968],"domain_scores_gemma":[0.9977254,0.0005250199,0.000698136,0.0005133987,0.0004623975,0.0000756302],"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.0001795452,0.0001017767,0.00001528256,0.00001522738,0.00004218325,4.243816e-7,0.00168011,0.1012936,0.001123175,0.8862233,0.004367638,0.00495783],"study_design_scores_gemma":[0.001150449,0.0002634008,0.00003925464,0.0000137947,0.00001230508,0.00002060552,0.0003043804,0.9288583,0.0103935,0.04604097,0.01257199,0.0003310167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054449,0.000007342544,0.9872631,0.002316536,0.002065894,0.00122951,0.0002208583,0.0005393215,0.005302976],"genre_scores_gemma":[0.9276741,0.00001546235,0.05921027,0.003540788,0.0002567953,0.005465972,0.001819944,0.00004205042,0.00197469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9280528,"threshold_uncertainty_score":0.9509816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655140","doi":"10.1109/isit50566.2022.9834636","title":"Multi-Environment Meta-Learning in Stochastic Linear Bandits","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Regret; Task (project management); Computer science; Artificial intelligence; Meta learning (computer science); Machine learning; Multi-task learning; Task analysis; Mathematical optimization; Mathematics; Engineering","authors":[{"name":"Ahmadreza Moradipari","is_ca":false},{"name":"Mohammad Ghavamzadeh","is_ca":false},{"name":"Taha Rajabzadeh","is_ca":false},{"name":"Christos Thrampoulidis","is_ca":true},{"name":"Mahnoosh Alizadeh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0688220592948622,"gpt":0.3667842287866565,"spread":0.2979621694917943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006328962,0.000258781,0.0003642829,0.001094376,0.0005255877,0.0002453728,0.001542424,0.00006554343,0.01471577],"category_scores_gemma":[0.001389556,0.000221332,0.0002513188,0.0006948395,0.0000996685,0.001743263,0.0005776795,0.0009747466,0.002607534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008641634,"about_ca_system_score_gemma":0.00007692537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001717495,"about_ca_topic_score_gemma":0.000003667128,"domain_scores_codex":[0.9928707,0.0008515951,0.001224363,0.0004484205,0.004215698,0.0003892256],"domain_scores_gemma":[0.9967059,0.001921736,0.0005648921,0.0004720144,0.0002028554,0.0001326024],"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.0003239276,0.0001365536,0.0001014683,0.000001734935,0.0001351368,0.00001086032,0.001483365,0.9904506,0.0002556178,0.001817006,0.0007749851,0.004508755],"study_design_scores_gemma":[0.002468115,0.0004212095,0.001299149,0.000009806412,0.00004843988,0.00004724879,0.00405792,0.8727314,0.000824586,0.009697245,0.1078771,0.0005177107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04085376,0.00011796,0.9393944,0.00416436,0.004590476,0.001519368,0.0006164659,0.0002240939,0.008519077],"genre_scores_gemma":[0.9854907,0.00002710324,0.0008871653,0.001025339,0.0001809786,0.0006699438,0.0002174926,0.00002980819,0.01147143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.944637,"threshold_uncertainty_score":0.9981691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289655494","doi":"10.1109/isit50566.2022.9834504","title":"A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Channel (broadcasting); Computer science; Gaussian; Code (set theory); Decoding methods; Set (abstract data type); Mathematics; Telecommunications; Physics","authors":[{"name":"Ali Farsiabi","is_ca":true},{"name":"Amir H. Banihashemi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01563210318946117,"gpt":0.2797410789675032,"spread":0.264108975778042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001927641,0.000212366,0.0001925422,0.000319125,0.0004212171,0.0001370111,0.001600256,0.00005089869,0.00006043914],"category_scores_gemma":[0.0001794892,0.0001869517,0.0001654024,0.0003539964,0.00005674401,0.00155849,0.0003882257,0.0003135221,0.00002648631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003526465,"about_ca_system_score_gemma":0.0001188368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003774887,"about_ca_topic_score_gemma":0.000005311743,"domain_scores_codex":[0.9977453,0.0001700281,0.0006549294,0.0002494113,0.0009417691,0.0002385119],"domain_scores_gemma":[0.9979571,0.000435556,0.0006901054,0.0005359219,0.0003310758,0.00005031353],"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.0002112824,0.00006755042,0.000006934455,0.00002495721,0.00005089631,4.722293e-7,0.007765037,0.8880454,0.000876602,0.09667407,0.003724793,0.002551967],"study_design_scores_gemma":[0.0004197067,0.0001839305,0.0000304498,0.00002624163,0.00001089919,0.00001395643,0.0002509305,0.9527013,0.01185114,0.03320913,0.001109362,0.0001929915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03784387,0.000008946991,0.9554986,0.002030062,0.001458965,0.000734615,0.0003022311,0.0003119871,0.00181073],"genre_scores_gemma":[0.9862698,0.00001027908,0.00987175,0.00175041,0.00007053731,0.0006404351,0.0001298996,0.00002207392,0.001234769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.948426,"threshold_uncertainty_score":0.7623668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289713251","doi":"10.1109/isit50566.2022.9834366","title":"On the Security Properties of Combinatorial All-or-nothing Transforms","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Cryptographic Implementations and Security","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 Waterloo","funders":"","keywords":"Tuple; Cryptography; Combinatorial design; Encryption; Independent and identically distributed random variables; Preprocessor; Computer science; Discrete mathematics; Mathematics; Combinatorics; Theoretical computer science; Random variable; Algorithm; Computer security; Statistics","authors":[{"name":"Yujie Gu","is_ca":false},{"name":"Sonata Akao","is_ca":false},{"name":"Navid Nasr Esfahani","is_ca":true},{"name":"Ying Miao","is_ca":false},{"name":"Kouichi Sakurai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01802902570013839,"gpt":0.2544920531541213,"spread":0.2364630274539829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001499047,0.0001599554,0.0001406921,0.0002564097,0.0005412233,0.000216369,0.001375726,0.00003573789,0.000776071],"category_scores_gemma":[0.00005682474,0.0001090982,0.000145878,0.0003878585,0.00006936841,0.001246531,0.0001902742,0.0003602909,0.00002760553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001815412,"about_ca_system_score_gemma":0.00007631114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004406937,"about_ca_topic_score_gemma":0.000003302158,"domain_scores_codex":[0.9976437,0.0002267701,0.0005996417,0.0001718056,0.001165205,0.000192874],"domain_scores_gemma":[0.9988066,0.0003096038,0.0003125736,0.0003750417,0.0001523436,0.00004384182],"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.000372042,0.0001466449,0.00001110017,0.00001253476,0.00008181955,0.000001174313,0.02504292,0.001760026,0.0006602863,0.9692528,0.001524577,0.001134083],"study_design_scores_gemma":[0.005996433,0.002631333,0.0001843368,0.0001325415,0.00005853908,0.0001022436,0.0157963,0.1307931,0.06748015,0.5732468,0.2023858,0.001192407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8848533,0.00002510933,0.05373834,0.01862988,0.0113558,0.001638731,0.000400695,0.0002997486,0.02905837],"genre_scores_gemma":[0.9961618,0.00001630335,0.00004939168,0.003398005,0.00006242356,0.0001897658,0.00004776652,0.000006707392,0.00006783385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.396006,"threshold_uncertainty_score":0.8497434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}