{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01780151,0.001485713,0.002540433,0.001829593,0.00185567,0.00386705,0.00418747,0.003972443,0.003877615],"category_scores_gemma":[0.04842605,0.001146555,0.001502162,0.002146102,0.006622676,0.01072636,0.005980279,0.00503505,0.0005789762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003527518,"about_ca_system_score_gemma":0.00296873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005269322,"about_ca_topic_score_gemma":0.0003513502,"domain_scores_codex":[0.9857405,0.005964622,0.0006886855,0.002293643,0.004041641,0.001270984],"domain_scores_gemma":[0.969978,0.01861054,0.003293955,0.005049678,0.00188595,0.001181975],"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.0005102914,0.0002133259,0.0008949703,0.0002629296,0.0001291312,0.0001689083,0.0003063686,0.1748722,0.005796468,0.7546803,0.002135843,0.06002938],"study_design_scores_gemma":[0.0001113532,0.0002482165,0.0001852815,0.00005525688,0.00004255124,0.0001908233,0.00005586613,0.5725514,0.004991189,0.4193392,0.002173381,0.00005547516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02930224,0.0005958238,0.9653991,0.0008972723,0.00006795287,0.0002041622,0.00007494316,0.0003478794,0.00311058],"genre_scores_gemma":[0.7249919,0.0006070906,0.2687014,0.0006098595,0.0002050815,0.0005522807,0.00009650992,0.000123175,0.004112712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01780151,"threshold_uncertainty_score":0.09414452,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.04576765,0.001033043,0.002636428,0.002436729,0.003832088,0.009401161,0.003794371,0.004314307,0.01543285],"category_scores_gemma":[0.2188832,0.001327374,0.001314608,0.003954331,0.006406722,0.01450374,0.008691415,0.005580341,0.006485433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003923563,"about_ca_system_score_gemma":0.009545563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007480265,"about_ca_topic_score_gemma":0.000794891,"domain_scores_codex":[0.9061765,0.05685951,0.003327218,0.01112581,0.01967539,0.002835541],"domain_scores_gemma":[0.7293156,0.1593012,0.01889482,0.06129819,0.0249996,0.006190659],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003912504,0.0001146005,0.002323441,0.0005897892,0.0001432233,0.000235064,0.0007771892,0.02279237,0.001487194,0.7171051,0.03510273,0.218938],"study_design_scores_gemma":[0.0001319416,0.0001702191,0.0005863494,0.0001586115,0.00004561558,0.0004084806,0.0002402575,0.05632415,0.00206033,0.866043,0.07374611,0.00008479874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02243864,0.005337087,0.8688291,0.02868832,0.001900039,0.001058839,0.0004994812,0.001053187,0.07019521],"genre_scores_gemma":[0.7089191,0.005584389,0.216578,0.004340587,0.003858526,0.001289589,0.0007010933,0.0006192894,0.05810937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9542323,"threshold_uncertainty_score":0.2420453,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161648,0.000839558,0.0007939916,0.0006187496,0.0004673399,0.00128741,0.001100392,0.0008654436,0.001543995],"category_scores_gemma":[0.007224742,0.0005197647,0.0006250196,0.001018051,0.001297999,0.00155367,0.001089199,0.001291464,0.0004803199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001287838,"about_ca_system_score_gemma":0.001763961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002633024,"about_ca_topic_score_gemma":0.002549442,"domain_scores_codex":[0.9990601,0.00031567,0.00004226003,0.00008150715,0.0004021572,0.00009823073],"domain_scores_gemma":[0.998442,0.0009163261,0.0001500121,0.0001117314,0.0003394972,0.00004049712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004891755,0.00005115678,0.0003618011,0.0001246545,0.00002424044,0.0001171854,0.000248612,0.7948241,0.00571701,0.114755,0.001836475,0.08189089],"study_design_scores_gemma":[0.000003484697,0.00001445021,0.00003407146,0.000006224325,0.000002263323,0.00002130828,0.000009252415,0.988161,0.000930346,0.01036147,0.0004488469,0.000007357712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002592977,0.0001431521,0.9957836,0.00005447448,0.00001715224,0.00002395763,0.00001389675,0.00006673588,0.001304096],"genre_scores_gemma":[0.4196244,0.0009314985,0.57386,0.0001633059,0.00009903946,0.000315787,0.0001205619,0.0001904172,0.004695058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002633024,"threshold_uncertainty_score":0.009343922,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147929,0.001295363,0.001533606,0.0007205718,0.0007374546,0.001915433,0.001870882,0.00185821,0.002187119],"category_scores_gemma":[0.007550367,0.0003656746,0.0009348966,0.001346955,0.002173764,0.002758742,0.005460315,0.00276362,0.0005841475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005362,"about_ca_system_score_gemma":0.001185354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004940503,"about_ca_topic_score_gemma":0.0003537226,"domain_scores_codex":[0.9976735,0.0008391446,0.0001027329,0.0003426276,0.0007833737,0.0002585725],"domain_scores_gemma":[0.9960295,0.002417732,0.0003667283,0.0006019969,0.0004180718,0.0001659701],"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.0004784948,0.0001407281,0.0006769295,0.000353905,0.00008605036,0.0009634133,0.0004935685,0.2931323,0.01123887,0.6390283,0.00235303,0.0510544],"study_design_scores_gemma":[0.00007554912,0.0001475302,0.0001127452,0.00004881853,0.00002754018,0.0004699311,0.00008054773,0.7896376,0.00905001,0.1986082,0.001701946,0.00003961283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02191553,0.0002512026,0.9711739,0.0005402485,0.0000678405,0.00007776187,0.0001079901,0.0001144039,0.005751115],"genre_scores_gemma":[0.792722,0.0005686595,0.2011436,0.0002996658,0.0001257843,0.0002386134,0.0002736828,0.00004670373,0.004581255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002187119,"threshold_uncertainty_score":0.01135945,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005780773,0.001181243,0.003049303,0.002166579,0.001844614,0.003080961,0.004152294,0.003135032,0.005062402],"category_scores_gemma":[0.03363754,0.0008071059,0.0008366972,0.003303754,0.003095594,0.007104365,0.003873394,0.002649254,0.00175369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00331259,"about_ca_system_score_gemma":0.002039648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003808425,"about_ca_topic_score_gemma":0.003199179,"domain_scores_codex":[0.9933336,0.0029881,0.0002086072,0.0009585744,0.001442728,0.001068254],"domain_scores_gemma":[0.9721664,0.01851818,0.002064172,0.003671504,0.002620018,0.0009596978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009100491,0.0002909163,0.001950454,0.0004032426,0.0001220643,0.001031597,0.0005298445,0.4543243,0.002768312,0.4400933,0.0162014,0.08137449],"study_design_scores_gemma":[0.00006849546,0.00007257857,0.0002667552,0.00002372154,0.00001635555,0.0002324702,0.00007492076,0.8008895,0.0005146261,0.1958598,0.001945022,0.00003577214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103399,0.002597601,0.8721598,0.003746407,0.0004925689,0.0003322146,0.0007267155,0.001710346,0.01483534],"genre_scores_gemma":[0.9213676,0.0008222559,0.06105146,0.0008309881,0.000507223,0.0003646175,0.0005742374,0.0001471266,0.01433451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005780773,"threshold_uncertainty_score":0.030572,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130638,0.0007971651,0.001188618,0.000757621,0.0003455909,0.000817918,0.002254139,0.0009863315,0.001172857],"category_scores_gemma":[0.003569267,0.0004843075,0.0006419796,0.0005791655,0.000742105,0.001460026,0.0015132,0.001478194,0.0006073122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006104576,"about_ca_system_score_gemma":0.001349202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001577166,"about_ca_topic_score_gemma":0.003151099,"domain_scores_codex":[0.9991192,0.0001973044,0.00005151516,0.0002407761,0.0003008399,0.00009022054],"domain_scores_gemma":[0.9981685,0.0006358279,0.0001989285,0.0004841744,0.0004239382,0.00008854757],"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.000287235,0.0002971989,0.003714236,0.0001698827,0.0002034187,0.0001466884,0.0001706144,0.2718584,0.02048884,0.00829973,0.007885938,0.6864778],"study_design_scores_gemma":[0.00001170112,0.00005385619,0.0001937451,0.000005505194,0.00001036921,0.00005339949,0.000007904749,0.9889947,0.006893175,0.002634145,0.001131225,0.00001039509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0166559,0.0003282085,0.9787184,0.0001628332,0.00008271839,0.00004600684,0.0001068691,0.002865783,0.001033297],"genre_scores_gemma":[0.5544668,0.0002300301,0.4387127,0.0004741106,0.0001160434,0.000150697,0.0006436059,0.0002597079,0.004946192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002254139,"threshold_uncertainty_score":0.005979478,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210418,0.0003131486,0.0005365811,0.00134798,0.0007969433,0.001033531,0.001267127,0.00083609,0.001629095],"category_scores_gemma":[0.01095923,0.000508312,0.0003874309,0.0008786726,0.001826832,0.002236521,0.0008507128,0.0007333859,0.0001735117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001308984,"about_ca_system_score_gemma":0.0006717012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303878,"about_ca_topic_score_gemma":0.001271506,"domain_scores_codex":[0.9992754,0.000156059,0.00003290706,0.0001815077,0.0002750415,0.00007911101],"domain_scores_gemma":[0.991085,0.006155673,0.001132468,0.0005872832,0.000665229,0.0003742641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004760854,0.00009370341,0.01526629,0.0003540023,0.0001425941,0.000746728,0.0005338176,0.5848375,0.0484154,0.3251364,0.0009140638,0.02308338],"study_design_scores_gemma":[0.00001879688,0.00006563342,0.003134654,0.00003716648,0.00002947623,0.0003533619,0.0000629434,0.9124144,0.009340511,0.07379726,0.0006953476,0.00005046129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7238952,0.001205129,0.2695697,0.0004496361,0.0000377704,0.0000498286,0.0002490812,0.0003122842,0.004231262],"genre_scores_gemma":[0.9926378,0.0003449239,0.005863363,0.00003808732,0.00002288505,0.00004029365,0.0001138038,0.00005654266,0.0008823656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001629095,"threshold_uncertainty_score":0.009497344,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003029616,0.0007194881,0.000335868,0.0005292991,0.000384253,0.0008319883,0.0004591151,0.0005387381,0.003454502],"category_scores_gemma":[0.001523265,0.0001941776,0.0004769232,0.000652017,0.0007048569,0.001077644,0.0008986771,0.0008198798,0.001601413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005982755,"about_ca_system_score_gemma":0.0006045938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002431711,"about_ca_topic_score_gemma":0.00246627,"domain_scores_codex":[0.9995271,0.00008185949,0.00001978181,0.00008254645,0.0002087785,0.00008000342],"domain_scores_gemma":[0.999703,0.0001230367,0.00002902644,0.0000644078,0.00007134381,0.000009048058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004588193,0.0001406282,0.00218329,0.0002853012,0.0000773254,0.001689336,0.0004043474,0.4046559,0.08585732,0.2357167,0.00714212,0.261389],"study_design_scores_gemma":[0.00003899102,0.0001427612,0.001101557,0.00007607327,0.00003810553,0.001035262,0.0001453006,0.8631042,0.04836293,0.0643795,0.02149556,0.00007983047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02894679,0.0001988003,0.9585241,0.0002189796,0.0002686043,0.0001031322,0.0003117213,0.0008919012,0.01053603],"genre_scores_gemma":[0.5746422,0.001006593,0.4079363,0.0004107348,0.0002758449,0.0003205043,0.0007843538,0.0001886343,0.01443477],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003454502,"threshold_uncertainty_score":0.01155645,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437925,0.000342108,0.0004363984,0.0007427778,0.001733427,0.002419003,0.0006464789,0.002045137,0.008653123],"category_scores_gemma":[0.00369609,0.0002682318,0.0004351581,0.0003974809,0.007078778,0.008199143,0.001858251,0.003645984,0.0007543938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00103984,"about_ca_system_score_gemma":0.0007410023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00104752,"about_ca_topic_score_gemma":0.0005390998,"domain_scores_codex":[0.9994387,0.0001837041,0.00001397623,0.0001198599,0.0001556928,0.00008804692],"domain_scores_gemma":[0.9986843,0.0007252764,0.00007762318,0.0003059636,0.00009838435,0.0001084214],"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.00001406655,0.000003924436,0.00004929884,0.000009960212,0.000002396275,0.00001998814,0.00004688671,0.001003883,0.0004710431,0.9962803,0.0008982962,0.001200044],"study_design_scores_gemma":[0.000009141533,0.00001245984,0.0001192381,0.00001568411,0.000002334077,0.0000780795,0.0000595879,0.01230328,0.000449988,0.9797606,0.007177152,0.00001233892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1736032,0.004175329,0.4494036,0.02507124,0.0009908632,0.0001336864,0.0009434778,0.000974306,0.3447043],"genre_scores_gemma":[0.9535565,0.0009991818,0.03101436,0.001333197,0.0004348685,0.0001092316,0.0001175656,0.000152212,0.01228293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008653123,"threshold_uncertainty_score":0.02894759,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01006293,0.003083739,0.003914785,0.003388926,0.002476134,0.005527778,0.004672471,0.003533736,0.007143543],"category_scores_gemma":[0.08317252,0.001623753,0.002547974,0.004668941,0.00508219,0.01058136,0.006382887,0.007711518,0.002935185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003598007,"about_ca_system_score_gemma":0.006567888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002560671,"about_ca_topic_score_gemma":0.001765911,"domain_scores_codex":[0.9885325,0.005042361,0.0005578907,0.002778009,0.001927222,0.001162005],"domain_scores_gemma":[0.8997435,0.0858986,0.004172651,0.005538611,0.003237248,0.001409368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001021708,0.0004661011,0.001473535,0.0007098877,0.0001241168,0.0001596019,0.0006028181,0.6194064,0.003229912,0.2427836,0.008576394,0.121446],"study_design_scores_gemma":[0.0001086106,0.0001308746,0.0001801435,0.0001002046,0.0000270685,0.0001028131,0.00009543401,0.7391053,0.001535755,0.2565342,0.002045464,0.00003412105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01214503,0.000887577,0.9814615,0.0008998097,0.00007143913,0.0001602993,0.0001791891,0.0005870502,0.003608088],"genre_scores_gemma":[0.2689591,0.001757797,0.7214245,0.0006433865,0.0003183858,0.000973882,0.001287547,0.0008126923,0.003822726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01006293,"threshold_uncertainty_score":0.05321848,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007199433,0.00154114,0.00263544,0.0009208605,0.0009586613,0.002372026,0.003074024,0.002409676,0.003578879],"category_scores_gemma":[0.05199872,0.001215682,0.001020739,0.001552667,0.002438858,0.005988314,0.003164819,0.003592467,0.0007224879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002314122,"about_ca_system_score_gemma":0.003098705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005161197,"about_ca_topic_score_gemma":0.004606361,"domain_scores_codex":[0.9944031,0.002924713,0.0002299741,0.001135965,0.0008478687,0.0004583487],"domain_scores_gemma":[0.928524,0.06124298,0.002499856,0.004190936,0.002000649,0.001541498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009995197,0.0005420994,0.002818292,0.0005125023,0.0001784768,0.000220743,0.0003395471,0.8372015,0.003525433,0.07173225,0.006208279,0.07572141],"study_design_scores_gemma":[0.00003943297,0.00006606893,0.0001963786,0.000008815417,0.00000845042,0.00003383193,0.00002546178,0.959235,0.000478275,0.03969491,0.0002003714,0.00001286058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08400807,0.000592969,0.9106051,0.001373817,0.00005775222,0.0002521279,0.0004250123,0.0006408717,0.002044267],"genre_scores_gemma":[0.6314986,0.0005465039,0.3613276,0.0005251182,0.0002186497,0.0005834007,0.001670094,0.0003203691,0.003309739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007199433,"threshold_uncertainty_score":0.03807473,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899226,0.0007163078,0.001180505,0.001298184,0.0009146145,0.001832254,0.002061102,0.002472127,0.002651377],"category_scores_gemma":[0.006711835,0.0006523401,0.00114641,0.0009286812,0.002626077,0.002313786,0.001757233,0.001919993,0.0003132319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001986257,"about_ca_system_score_gemma":0.0009318379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01364286,"about_ca_topic_score_gemma":0.008531725,"domain_scores_codex":[0.9991153,0.0003969518,0.00003954628,0.0001680223,0.000123304,0.0001569422],"domain_scores_gemma":[0.9960105,0.002507964,0.0006535491,0.0002635333,0.0003256254,0.0002388617],"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.00004703141,0.00004933237,0.001331488,0.00002506727,0.00003688085,0.0001630956,0.0001373016,0.9358873,0.0009037392,0.05948516,0.0002316374,0.001702015],"study_design_scores_gemma":[0.000004209518,0.000007059875,0.00007628288,0.000002484715,0.000003583918,0.000007636392,0.00001077453,0.9941122,0.00004756737,0.005641845,0.00008262923,0.000003690014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3215219,0.0005836588,0.664884,0.001009785,0.0001641857,0.0001352897,0.0003226587,0.0003587794,0.01101978],"genre_scores_gemma":[0.966624,0.0003297847,0.02705763,0.0001287256,0.00004897359,0.000193429,0.0001026295,0.00004194842,0.00547276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01364286,"threshold_uncertainty_score":0.02712685,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027666,0.0005599916,0.0004705291,0.001076662,0.0007488008,0.0009560156,0.0008024777,0.000877116,0.002190536],"category_scores_gemma":[0.005366405,0.0004745513,0.0004774516,0.0008356972,0.001802468,0.001492746,0.001587064,0.001986672,0.0004888216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009510258,"about_ca_system_score_gemma":0.0007193437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004010566,"about_ca_topic_score_gemma":0.0004399752,"domain_scores_codex":[0.9988328,0.000326553,0.00005071298,0.0001585843,0.0004792541,0.0001521116],"domain_scores_gemma":[0.9955551,0.002434173,0.0008645618,0.0005662748,0.0003448043,0.0002350904],"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.0001976385,0.00006671213,0.001038321,0.0001176381,0.00002437866,0.0001516472,0.0003782393,0.05898414,0.0189919,0.9005157,0.0006781535,0.01885557],"study_design_scores_gemma":[0.00009225323,0.0003470414,0.001038992,0.00007445119,0.00002201224,0.0005858849,0.0001328813,0.2427508,0.02782068,0.7218481,0.005215659,0.00007126643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4707609,0.0004649514,0.5101157,0.0005424495,0.0000381872,0.00007276332,0.0003148989,0.0002870665,0.01740325],"genre_scores_gemma":[0.8963395,0.0004230122,0.09555821,0.0001774784,0.00006703252,0.0001924686,0.0003008189,0.00006049027,0.006881069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002190536,"threshold_uncertainty_score":0.007328033,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002374982,0.0002526144,0.0002219349,0.0004908897,0.0003229087,0.0005243399,0.0003358677,0.0004350454,0.002575914],"category_scores_gemma":[0.00112189,0.0002027494,0.0002225156,0.0005787362,0.0005728113,0.0005643296,0.0005369152,0.0007528365,0.0006372966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004249334,"about_ca_system_score_gemma":0.0004561621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006405626,"about_ca_topic_score_gemma":0.000916998,"domain_scores_codex":[0.9997067,0.00004292342,0.00001618396,0.00006633074,0.0001198856,0.00004797701],"domain_scores_gemma":[0.9991358,0.000240448,0.000092155,0.0002686924,0.0002186736,0.00004422742],"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.0006998116,0.0001357813,0.003160455,0.0003772181,0.00005437639,0.0006904597,0.0003123437,0.2200151,0.2039704,0.3585557,0.006184061,0.2058444],"study_design_scores_gemma":[0.00008559207,0.0002875358,0.002537766,0.00005572387,0.00003353426,0.0009394386,0.00006731525,0.6998892,0.1245247,0.1533954,0.01813755,0.00004621464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2039491,0.0003993788,0.7753966,0.0002611044,0.00007737764,0.0001393573,0.0005774792,0.001015237,0.01818451],"genre_scores_gemma":[0.8997591,0.0002349644,0.09313027,0.00011547,0.00002869403,0.00009190218,0.0003041071,0.00007788502,0.006257519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002575914,"threshold_uncertainty_score":0.008617282,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003970352,0.00136725,0.002085383,0.001177263,0.0009330892,0.001740699,0.003836148,0.002348952,0.003506162],"category_scores_gemma":[0.01407832,0.0009394457,0.001169496,0.002138056,0.001825961,0.003827695,0.00225904,0.003556137,0.001118499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001788412,"about_ca_system_score_gemma":0.002099533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01296578,"about_ca_topic_score_gemma":0.01252669,"domain_scores_codex":[0.9971597,0.001421194,0.00007070219,0.0007079864,0.0003896869,0.0002506804],"domain_scores_gemma":[0.9888017,0.007268666,0.0008975827,0.001452524,0.001001282,0.0005782738],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001396,0.0001255094,0.0005663098,0.0001144394,0.00005490185,0.0001129956,0.0001002035,0.9351527,0.000887377,0.03828884,0.003190452,0.02126663],"study_design_scores_gemma":[0.000005441364,0.00001076511,0.00004958202,0.000002087029,0.000002292815,0.00001046844,0.000007948715,0.9879408,0.0001258304,0.01168071,0.000158569,0.000005520457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01985408,0.0001777581,0.9777125,0.0004406162,0.0000367551,0.00008256146,0.0002719333,0.0003828954,0.001040988],"genre_scores_gemma":[0.5385004,0.0004012843,0.4521695,0.000308457,0.0001990808,0.0003116044,0.001778967,0.0002735304,0.006057185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01296578,"threshold_uncertainty_score":0.02578068,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008859158,0.0007517823,0.0005973075,0.0004797477,0.0003759629,0.0008218169,0.0008658572,0.000732562,0.004558913],"category_scores_gemma":[0.003706106,0.000266886,0.0004284688,0.0009386846,0.000924223,0.0008390261,0.0008416277,0.001546403,0.001294353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008385173,"about_ca_system_score_gemma":0.001400819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003798914,"about_ca_topic_score_gemma":0.005045788,"domain_scores_codex":[0.9993918,0.0001774141,0.0000223971,0.00005564595,0.0003015304,0.00005115128],"domain_scores_gemma":[0.9990246,0.000554448,0.00005780267,0.0001117588,0.0002212359,0.00003009111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001211238,0.00003531387,0.0002742345,0.0001799017,0.00004119914,0.0001012699,0.0001294035,0.6163551,0.005509832,0.2861814,0.004291184,0.08678003],"study_design_scores_gemma":[0.000006157509,0.000009867938,0.00001245781,0.000006554134,0.000001866224,0.00001220641,0.000003335714,0.9856603,0.0006472815,0.01171449,0.001922765,0.0000027263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002263032,0.0002335865,0.9938304,0.0001267117,0.00008354814,0.00002524809,0.00002132588,0.0001616586,0.003254467],"genre_scores_gemma":[0.2882822,0.001044821,0.6954861,0.0002116694,0.0001524332,0.0002966007,0.000154881,0.0001710459,0.01420025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004558913,"threshold_uncertainty_score":0.0152511,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00618944,0.002007401,0.003531234,0.0008857719,0.000911599,0.002699723,0.002926289,0.003633302,0.002042148],"category_scores_gemma":[0.01817562,0.001324839,0.001238117,0.001198428,0.002884987,0.004279771,0.002876553,0.004069193,0.0005471887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002223955,"about_ca_system_score_gemma":0.001374267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002506974,"about_ca_topic_score_gemma":0.002303154,"domain_scores_codex":[0.9967464,0.001903877,0.0001237271,0.000550438,0.0003237636,0.0003517557],"domain_scores_gemma":[0.9880711,0.009467433,0.000951916,0.0006011109,0.0005318237,0.0003765978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000105479,0.00005628862,0.0005212307,0.0000613752,0.00007725668,0.00005668565,0.00005632804,0.9560602,0.0002360202,0.03303545,0.0004638943,0.009269807],"study_design_scores_gemma":[0.00001160484,0.00002289708,0.00003721464,0.00001072151,0.000007605253,0.000009146293,0.000007056742,0.9798332,0.00009918142,0.01983296,0.0001222808,0.00000617585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02498942,0.0008401221,0.9712645,0.000731147,0.00005338442,0.00005200211,0.00006580482,0.0002481848,0.001755411],"genre_scores_gemma":[0.8671146,0.0005893109,0.1264256,0.00057146,0.000209546,0.0003857344,0.0001762109,0.0001516538,0.00437603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00618944,"threshold_uncertainty_score":0.03273326,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006793569,0.0007783248,0.0007711668,0.0005588261,0.0004114961,0.000943648,0.0011514,0.0008658419,0.001416275],"category_scores_gemma":[0.002400093,0.0003827346,0.0005443936,0.0006680103,0.0009058715,0.001892912,0.0006678912,0.001312311,0.0005739051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008191367,"about_ca_system_score_gemma":0.0008508693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005139148,"about_ca_topic_score_gemma":0.003807452,"domain_scores_codex":[0.9993485,0.0002089661,0.00003063471,0.0001453853,0.0001877581,0.00007883361],"domain_scores_gemma":[0.9986116,0.0007648913,0.0001970994,0.0001282081,0.0002755656,0.00002257396],"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.00003785994,0.00001632089,0.0004527964,0.00003751028,0.00001849933,0.00004793334,0.00004585904,0.976424,0.001973147,0.01326178,0.000212839,0.007471551],"study_design_scores_gemma":[0.000001019333,0.000006762643,0.00003671196,0.000001725689,0.000002472159,0.000008627613,0.000001830823,0.998302,0.0002782276,0.001280411,0.0000771784,0.000003082687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01380306,0.0001874511,0.9843461,0.0001000914,0.00002165627,0.00001997938,0.0000874559,0.0002644597,0.00116986],"genre_scores_gemma":[0.931227,0.0005097397,0.06265357,0.0001089196,0.00005390997,0.0001719734,0.0002691353,0.0001068219,0.004899024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005139148,"threshold_uncertainty_score":0.01021844,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005747128,0.001691461,0.001626079,0.001749563,0.001577822,0.00444816,0.001527686,0.002135164,0.003826839],"category_scores_gemma":[0.02801371,0.001000496,0.001708575,0.001721902,0.007529483,0.01195691,0.004262122,0.006566909,0.0009511993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018493,"about_ca_system_score_gemma":0.00137178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003880676,"about_ca_topic_score_gemma":0.0002348502,"domain_scores_codex":[0.9949148,0.001444774,0.0003255731,0.001114866,0.001353553,0.0008465206],"domain_scores_gemma":[0.9672213,0.02417743,0.002409362,0.004289444,0.00119446,0.0007080286],"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.0003559388,0.00006525838,0.0007790903,0.0001605917,0.00003868769,0.0002236465,0.0002323716,0.04261962,0.006883744,0.9349722,0.001257939,0.01241079],"study_design_scores_gemma":[0.00004113028,0.0001248901,0.0002980056,0.00007215024,0.00002868397,0.0002339057,0.00006492856,0.1428396,0.006502802,0.8481068,0.001631841,0.00005531713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.243512,0.003004244,0.6965593,0.004125654,0.000225809,0.0001996838,0.0007369069,0.0006211254,0.05101519],"genre_scores_gemma":[0.9556321,0.001584182,0.03815478,0.0006792592,0.0003444339,0.0002325001,0.0003728474,0.0001380719,0.002861897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005747128,"threshold_uncertainty_score":0.03039408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}