{"meta":{"query_hash":"f6b8e9c02eda","filters":{"venue":"2022 IEEE International Symposium on Information Theory (ISIT)"},"cohort_total":19,"direct_labels_cover":0,"predictions_cover":19,"exported":19,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/f6b8e9c02eda","api":"https://metacan.xera.ac/api/v1/cohort?venue=2022+IEEE+International+Symposium+on+Information+Theory+%28ISIT%29"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015301224535699081,"score_gpt":0.2753598591568853,"score_spread":0.2600586346211862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182847896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076478054,0.000042183787,0.8474434,0.008574725,0.018691316,0.0012406459,0.0005112838,0.0030115172,0.11283714],"genre_scores_gemma":[0.97114795,0.00007897395,0.012447659,0.011580049,0.00056531554,0.0013042382,0.0013543664,0.000078372526,0.0014430688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954512,0.00049594615,0.0011327065,0.0006596464,0.0018636418,0.00039685663],"domain_scores_gemma":[0.99635583,0.00066812796,0.0011285589,0.0014692952,0.00024192515,0.00013623173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021994812,0.00054943084,0.00041629848,0.00088788616,0.00037489546,0.0008953097,0.0049199145,0.00030933743,0.00091584923],"category_scores_gemma":[0.0001883918,0.00059623696,0.0004165582,0.0004041484,0.00008128392,0.0015682735,0.0014685746,0.0016671544,0.00026202938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000467081,0.0004662864,0.00031320506,0.00024406641,0.00040144342,0.000042377116,0.0078068585,0.21581194,0.001094841,0.6952833,0.049678124,0.028390497],"study_design_scores_gemma":[0.001694175,0.0007391568,0.0007182253,0.00057064777,0.00008421155,0.000091277645,0.0005783271,0.63376606,0.039778497,0.12292362,0.19632806,0.002727735],"about_ca_topic_score_codex":0.00005207846,"about_ca_topic_score_gemma":0.000004177052,"teacher_disagreement_score":0.96350014,"about_ca_system_score_codex":0.0012900123,"about_ca_system_score_gemma":0.00034483548,"threshold_uncertainty_score":0.99999744},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Time complexity","score_opus":0.019388438974961036,"score_gpt":0.2559160239593848,"score_spread":0.23652758498442375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226193467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016816143,0.000016149057,0.96868473,0.005385523,0.0037131584,0.0010880438,0.00018441936,0.0001405701,0.003971271],"genre_scores_gemma":[0.99337,0.000019065516,0.00096387387,0.004358794,0.00008129154,0.000657267,0.00014323328,0.000015014181,0.00039144023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766636,0.00021332841,0.00056519674,0.00025640905,0.0010464041,0.00025230608],"domain_scores_gemma":[0.997757,0.0008876617,0.00054261944,0.0005409423,0.00021456828,0.00005717312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795839,0.00019156397,0.00016313186,0.00029239187,0.00048503844,0.000097619355,0.0015236586,0.000041009196,0.00008024294],"category_scores_gemma":[0.000068408575,0.00015353899,0.00020723171,0.00058216014,0.00006158511,0.0005117239,0.00027212262,0.00025580075,0.00002456023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020734119,0.000090035275,0.000005752458,0.000004613428,0.00004427516,0.0000016095253,0.00044260971,0.37804854,0.00021511341,0.6126664,0.005608271,0.0026653972],"study_design_scores_gemma":[0.0021020689,0.0012575772,0.00012460294,0.00005842588,0.00002189267,0.00008961225,0.0005236362,0.7686737,0.017604357,0.18228285,0.026755793,0.0005054588],"about_ca_topic_score_codex":0.000003902341,"about_ca_topic_score_gemma":2.5938039e-7,"teacher_disagreement_score":0.97655386,"about_ca_system_score_codex":0.00029867285,"about_ca_system_score_gemma":0.000032506887,"threshold_uncertainty_score":0.62611383},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02604886461964958,"score_gpt":0.25204662139999673,"score_spread":0.22599775678034714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281676012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021488158,0.00003835329,0.9303285,0.008891102,0.0064963284,0.0009709954,0.00013771949,0.0013609214,0.030287944],"genre_scores_gemma":[0.9928529,0.000015950673,0.0022823755,0.0028919452,0.00016072097,0.00075467466,0.00017895176,0.000022469014,0.000840006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959814,0.0006766441,0.00085969304,0.00044540077,0.0017440037,0.0002928557],"domain_scores_gemma":[0.99775803,0.0003790019,0.0006351714,0.00075314083,0.0003533262,0.000121331876],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019783871,0.00029887015,0.00028633166,0.00063688273,0.0007297296,0.0004786692,0.0017878588,0.00008215974,0.0016981574],"category_scores_gemma":[0.00008616294,0.00030012315,0.00033113922,0.00080492283,0.00003289535,0.0036754028,0.00035268397,0.0004733457,0.0007371765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033716357,0.00038851154,0.000045503446,0.000024644569,0.0016644368,0.0000067058845,0.0041397973,0.15921588,0.020864995,0.7698121,0.002442128,0.041058145],"study_design_scores_gemma":[0.0013981953,0.00035662076,0.00050719455,0.0000058041906,0.0002239248,0.00008050656,0.0004496104,0.84951997,0.030791495,0.022195721,0.0938009,0.0006700602],"about_ca_topic_score_codex":0.000019644704,"about_ca_topic_score_gemma":0.0000021676092,"teacher_disagreement_score":0.97136474,"about_ca_system_score_codex":0.000838569,"about_ca_system_score_gemma":0.00008856061,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011408579306011307,"score_gpt":0.24743408150202323,"score_spread":0.23602550219601193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283810892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02007329,0.0000070771644,0.94282085,0.027930506,0.0037911148,0.0006403961,0.00032212606,0.00052671885,0.0038879092],"genre_scores_gemma":[0.9782941,0.000023191702,0.015025397,0.005110863,0.00009781324,0.0005585949,0.00073844974,0.000021090165,0.00013052479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960854,0.00054921175,0.0007324801,0.00044750384,0.0017186576,0.00046671173],"domain_scores_gemma":[0.99578387,0.00037250726,0.00048027423,0.003195899,0.00011148897,0.00005599435],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0021767723,0.00030122884,0.00021655436,0.00059357204,0.0006318426,0.0005597189,0.022384621,0.00011765578,0.00066185],"category_scores_gemma":[0.0006012143,0.00026743565,0.00014600324,0.00064625934,0.000049437785,0.0028438948,0.016592942,0.0008652357,0.00022721806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019508424,0.00026490804,0.000006783361,0.000011469323,0.000060766564,0.00002535864,0.0021058396,0.0033670685,0.00445787,0.95986885,0.027819315,0.0018166748],"study_design_scores_gemma":[0.0015777141,0.00038192765,0.0001676961,0.00003301621,0.00001592996,0.00018483447,0.0010272419,0.27016798,0.015202894,0.69674814,0.013970705,0.0005219167],"about_ca_topic_score_codex":0.00002054532,"about_ca_topic_score_gemma":0.0000014565326,"teacher_disagreement_score":0.9582208,"about_ca_system_score_codex":0.00068567786,"about_ca_system_score_gemma":0.000066952125,"threshold_uncertainty_score":0.99997777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01110291532929121,"score_gpt":0.2274738459194741,"score_spread":0.21637093059018286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50126106,0.00007085833,0.4251609,0.0035973568,0.005458731,0.0007427969,0.0002291226,0.00079694926,0.06268224],"genre_scores_gemma":[0.994606,0.00003284015,0.0014189996,0.003199593,0.00008985068,0.00009875264,0.00006901229,0.000012002524,0.0004729278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781877,0.0003584974,0.00045519735,0.00030084339,0.0007977764,0.00026893447],"domain_scores_gemma":[0.99863565,0.0003712449,0.00026790326,0.0004749473,0.00014045836,0.00010980613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894485,0.00020902221,0.0001785585,0.00030644215,0.00097037584,0.0005734732,0.001207742,0.000055234254,0.00047016112],"category_scores_gemma":[0.000051052237,0.00021828951,0.00012509598,0.00042170478,0.00010905881,0.0017839805,0.0005210965,0.00037007694,0.00014342791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043132986,0.00011921825,0.00026522978,0.000017639852,0.00009636293,0.000010979506,0.0039025315,0.007554746,0.0014336889,0.9717873,0.003950924,0.010430104],"study_design_scores_gemma":[0.00331242,0.0015335983,0.002199466,0.00009673899,0.000056814344,0.00037514145,0.002089511,0.2155253,0.019659793,0.5861243,0.1674083,0.0016186167],"about_ca_topic_score_codex":0.000019099507,"about_ca_topic_score_gemma":0.0000017265488,"teacher_disagreement_score":0.493345,"about_ca_system_score_codex":0.00018046433,"about_ca_system_score_gemma":0.000060599068,"threshold_uncertainty_score":0.8901588},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Markov chain; Mathematics; Aperiodic graph; Homogeneous; Markov process; Combinatorics; Statistics","score_opus":0.009533213423982735,"score_gpt":0.25254985012945236,"score_spread":0.24301663670546964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107589446,0.000019983896,0.7628575,0.00068390433,0.0037443251,0.00056982733,0.00016302228,0.000354943,0.12401706],"genre_scores_gemma":[0.9956257,0.0000045712113,0.00028160715,0.0011209804,0.0009991698,0.00024559622,0.0008934259,0.000026708674,0.0008022947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976169,0.00025945797,0.00083706965,0.0002538391,0.00071007095,0.00032265388],"domain_scores_gemma":[0.99849284,0.00038781337,0.0004926952,0.00035473847,0.00019205608,0.000079869635],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001142097,0.00026333914,0.00025497732,0.00027009158,0.0006405525,0.00020998837,0.0006827891,0.00003689227,0.005766346],"category_scores_gemma":[0.00001715324,0.00028984304,0.00028597363,0.00032818396,0.000026159363,0.0011171979,0.00033470764,0.0006224677,0.00018391098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023377368,0.00007555523,0.0005040776,0.0000037825298,0.00023666871,0.0000014091822,0.001115921,0.9245724,0.00023641576,0.06039405,0.0036215384,0.00900441],"study_design_scores_gemma":[0.00048827607,0.00008534625,0.000017459171,0.00003527933,0.000045062123,0.000006520338,0.0015138694,0.95967823,0.00056215876,0.021898447,0.015324286,0.00034506776],"about_ca_topic_score_codex":0.00015658396,"about_ca_topic_score_gemma":0.000004067809,"teacher_disagreement_score":0.8880362,"about_ca_system_score_codex":0.00036081354,"about_ca_system_score_gemma":0.000039043047,"threshold_uncertainty_score":0.99995536},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0688220592948622,"score_gpt":0.36678422878665645,"score_spread":0.29796216949179427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040853757,0.000117959986,0.9393944,0.0041643605,0.0045904764,0.001519368,0.0006164659,0.00022409394,0.008519077],"genre_scores_gemma":[0.98549074,0.000027103239,0.0008871653,0.0010253387,0.00018097863,0.0006699438,0.00021749259,0.000029808194,0.011471426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928707,0.0008515951,0.0012243635,0.00044842047,0.0042156978,0.0003892256],"domain_scores_gemma":[0.9967059,0.001921736,0.0005648921,0.00047201436,0.00020285537,0.00013260238],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006328962,0.000258781,0.00036428293,0.0010943763,0.0005255877,0.00024537276,0.0015424236,0.00006554343,0.014715769],"category_scores_gemma":[0.0013895555,0.00022133201,0.00025131882,0.0006948395,0.000099668505,0.0017432626,0.0005776795,0.0009747466,0.002607534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032392755,0.00013655363,0.00010146832,0.0000017349349,0.00013513681,0.000010860317,0.0014833652,0.99045056,0.00025561778,0.001817006,0.0007749851,0.004508755],"study_design_scores_gemma":[0.0024681147,0.00042120946,0.0012991495,0.000009806412,0.00004843988,0.00004724879,0.0040579196,0.87273145,0.00082458596,0.009697245,0.107877135,0.0005177107],"about_ca_topic_score_codex":0.000017174947,"about_ca_topic_score_gemma":0.0000036671279,"teacher_disagreement_score":0.944637,"about_ca_system_score_codex":0.0008641634,"about_ca_system_score_gemma":0.000076925375,"threshold_uncertainty_score":0.99816906},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Multiplication (music); Matrix multiplication; Parallel computing; Computational science; Matrix (chemical analysis); Supercomputer; Algorithm; Theoretical computer science; Mathematics","score_opus":0.010435386580536908,"score_gpt":0.2684972520790731,"score_spread":0.2580618654985362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010544491,0.0000073425435,0.9872631,0.0023165357,0.0020658937,0.0012295103,0.00022085827,0.0005393215,0.0053029764],"genre_scores_gemma":[0.92767406,0.000015462352,0.05921027,0.0035407876,0.00025679526,0.0054659722,0.0018199442,0.00004205042,0.0019746898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976591,0.00014869566,0.0006984644,0.00033631158,0.0009162698,0.00024119679],"domain_scores_gemma":[0.9977254,0.00052501995,0.00069813605,0.0005133987,0.00046239753,0.0000756302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011018204,0.0002138024,0.00016605268,0.0005159269,0.0005854583,0.00032339833,0.0015524263,0.00006622474,0.0001960811],"category_scores_gemma":[0.0002187267,0.0002332048,0.0001364686,0.0004790433,0.000038441878,0.0023831702,0.00027166057,0.000213105,0.0000874314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017954515,0.00010177669,0.00001528256,0.00001522738,0.00004218325,4.243816e-7,0.0016801099,0.10129357,0.0011231753,0.88622326,0.004367638,0.00495783],"study_design_scores_gemma":[0.001150449,0.00026340084,0.00003925464,0.000013794696,0.0000123050795,0.000020605517,0.00030438043,0.92885834,0.010393501,0.046040975,0.012571993,0.00033101666],"about_ca_topic_score_codex":0.0000068678837,"about_ca_topic_score_gemma":3.0636218e-7,"teacher_disagreement_score":0.92805284,"about_ca_system_score_codex":0.0006089481,"about_ca_system_score_gemma":0.00006695859,"threshold_uncertainty_score":0.95098156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016905354466554456,"score_gpt":0.2484736210892677,"score_spread":0.23156826662271326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19182736,0.00002974871,0.7993433,0.0012844554,0.0022080457,0.0006630988,0.00025593236,0.0012468029,0.0031412684],"genre_scores_gemma":[0.9949059,0.00001998267,0.002918186,0.001230852,0.000058299767,0.00040039487,0.00037994323,0.000039207713,0.000047229772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802136,0.00011597272,0.00069274986,0.00017261606,0.0007268363,0.00027048442],"domain_scores_gemma":[0.99868435,0.00036192825,0.00025169775,0.00047610802,0.00015060288,0.000075304364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005610485,0.00023932262,0.0001980922,0.0005984259,0.00035103736,0.00008531909,0.00082753476,0.0000691042,0.0004182066],"category_scores_gemma":[0.00015230865,0.0002801286,0.0000853495,0.0004642492,0.000042774675,0.0009588847,0.00018537852,0.00040837884,0.00013955464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115730734,0.000028191722,0.000029997344,0.000019663992,0.00004333575,0.0000012317221,0.0014755225,0.97657126,0.003949195,0.0138116935,0.0004134265,0.003540739],"study_design_scores_gemma":[0.0006717575,0.0000593492,0.00011198255,0.000033659813,0.000007628093,0.000007135,0.0015005546,0.97782105,0.009935075,0.0056888144,0.003835593,0.00032742033],"about_ca_topic_score_codex":0.00000985345,"about_ca_topic_score_gemma":0.0000019087968,"teacher_disagreement_score":0.80307853,"about_ca_system_score_codex":0.0009685347,"about_ca_system_score_gemma":0.00003548703,"threshold_uncertainty_score":0.9999651},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012004994005159106,"score_gpt":0.2644584007602411,"score_spread":0.252453406755082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49964353,0.000020515517,0.4446167,0.004136541,0.0011124057,0.001252724,0.0028955403,0.00029069552,0.046031356],"genre_scores_gemma":[0.9971742,0.000004313121,0.0011251562,0.00021778463,0.00011414,0.00016529296,0.0010530119,0.000012711962,0.00013339914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977595,0.00030749603,0.00061970134,0.00017635441,0.00091664796,0.00022027508],"domain_scores_gemma":[0.9982465,0.0005814899,0.0005187905,0.00037070678,0.0002240851,0.00005841478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010220362,0.00018993435,0.00022456406,0.0001784069,0.0008165217,0.0001260052,0.00075199414,0.000023603805,0.0021965937],"category_scores_gemma":[0.000013467552,0.00015178,0.00020687812,0.00035171435,0.00027120538,0.00038364367,0.0002344374,0.00044632767,0.000016791617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069313776,0.00014534176,0.002973001,0.000004750899,0.00024767808,3.3470639e-7,0.00044059593,0.036203504,0.00017914547,0.9543259,0.0027189918,0.0020675834],"study_design_scores_gemma":[0.002397861,0.0010331277,0.0073448704,0.000043786808,0.00016562664,0.000020180027,0.0029546628,0.21114348,0.004268742,0.62912416,0.14060326,0.00090024347],"about_ca_topic_score_codex":0.00018907724,"about_ca_topic_score_gemma":0.000008960052,"teacher_disagreement_score":0.49753067,"about_ca_system_score_codex":0.00015231973,"about_ca_system_score_gemma":0.000047923873,"threshold_uncertainty_score":0.9987155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018443456043826037,"score_gpt":0.2851759283114796,"score_spread":0.26673247226765356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978917,0.000019967129,0.66026497,0.0010972373,0.001223298,0.0011582149,0.0009852181,0.00038705656,0.03697233],"genre_scores_gemma":[0.99572766,0.0000049040727,0.0008934275,0.0005036272,0.000086817476,0.00044709706,0.0014183692,0.000020848169,0.00089723244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766856,0.0002531355,0.0008227449,0.0002593918,0.00072802894,0.000268128],"domain_scores_gemma":[0.9988457,0.00011770727,0.00047361295,0.0003488823,0.00014682386,0.000067268404],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008460565,0.00025185512,0.00026872626,0.0007743681,0.0003390098,0.00014314287,0.00066868385,0.00004130579,0.0020995822],"category_scores_gemma":[0.0000068478244,0.00027849874,0.00028584615,0.0006206941,0.00004565234,0.0007405287,0.00022589546,0.00044042122,0.00008110625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005254521,0.00060875475,0.0036088857,0.000012108777,0.0002673317,0.0000023862262,0.0017468921,0.67201525,0.0020161392,0.30847427,0.006014892,0.004707638],"study_design_scores_gemma":[0.0020727585,0.00010450899,0.0017580556,0.000031362586,0.000042553707,0.000007082971,0.0009829308,0.9332152,0.0006631279,0.054893043,0.0057244585,0.00050493935],"about_ca_topic_score_codex":0.00015324348,"about_ca_topic_score_gemma":0.000015076998,"teacher_disagreement_score":0.697836,"about_ca_system_score_codex":0.00036887638,"about_ca_system_score_gemma":0.0000420955,"threshold_uncertainty_score":0.99996674},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00882573477938818,"score_gpt":0.2607892121112024,"score_spread":0.2519634773318142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6162701,0.000007152285,0.28768092,0.0015054247,0.004310805,0.00073865836,0.00018232809,0.00065028545,0.0886543],"genre_scores_gemma":[0.9965596,0.000013937052,0.0012916105,0.0015058684,0.000045113462,0.0001525039,0.000079840334,0.000014151737,0.00033732684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731237,0.0002982288,0.0007716444,0.00026349231,0.0011308608,0.0002234287],"domain_scores_gemma":[0.99766713,0.0010545063,0.00054855004,0.0004958498,0.00018300828,0.000050926858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015600298,0.00021153587,0.00022659915,0.0004918316,0.00018110745,0.00012506163,0.0015859114,0.00006459892,0.00078019203],"category_scores_gemma":[0.0002481339,0.0002261733,0.00011889415,0.0004515561,0.000044369233,0.0011672806,0.00037948746,0.00046938471,0.00016265102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050700107,0.00035274425,0.001630587,0.000025775904,0.00006425279,0.000015816177,0.0064549027,0.27275878,0.0014917343,0.70935726,0.0014216712,0.005919477],"study_design_scores_gemma":[0.0019608098,0.00075066165,0.0020231092,0.00016450333,0.000011162913,0.00006853875,0.00050302444,0.84797317,0.02579239,0.11558661,0.0043748203,0.00079118996],"about_ca_topic_score_codex":0.00010891312,"about_ca_topic_score_gemma":0.000015848109,"teacher_disagreement_score":0.5937707,"about_ca_system_score_codex":0.00048735228,"about_ca_system_score_gemma":0.00008753584,"threshold_uncertainty_score":0.92230797},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017550803240332643,"score_gpt":0.2693768819320051,"score_spread":0.25182607869167245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010787501,0.0002718827,0.4817193,0.44108602,0.004419104,0.0019249514,0.00045444103,0.0015961875,0.057740606],"genre_scores_gemma":[0.8630037,0.0017895356,0.045289263,0.076910935,0.00034937155,0.0031865798,0.0042448384,0.00009893004,0.0051268595],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967513,0.00024027123,0.00061171834,0.0003174704,0.0018343568,0.00024486455],"domain_scores_gemma":[0.99650764,0.00020303926,0.00038531504,0.002611016,0.00024554608,0.000047445174],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0022516716,0.00019301477,0.0001829739,0.00040389923,0.0002131331,0.0002440716,0.013630262,0.000052511466,0.0004993561],"category_scores_gemma":[0.0023295917,0.00017961994,0.000059155005,0.00080744264,0.000047331534,0.0039883535,0.011429077,0.00052850606,0.00012790094],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022038493,0.00020636218,0.00056637096,0.00015184547,0.00008030832,0.00003164166,0.0010804631,0.007727542,0.00026435032,0.32686552,0.64788693,0.014918254],"study_design_scores_gemma":[0.0018761831,0.00054221106,0.0006319575,0.0005229264,0.000018208579,0.00022039746,0.0002847102,0.27316722,0.0033480064,0.18506713,0.53341985,0.0009012172],"about_ca_topic_score_codex":0.00001878085,"about_ca_topic_score_gemma":0.0000023189978,"teacher_disagreement_score":0.8522162,"about_ca_system_score_codex":0.000582548,"about_ca_system_score_gemma":0.00009738049,"threshold_uncertainty_score":0.9965663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.009945829036046402,"score_gpt":0.2541736899520666,"score_spread":0.24422786091602017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43083447,0.00005364804,0.5593523,0.0011317442,0.0021410114,0.001156196,0.0005725621,0.0007171227,0.0040409835],"genre_scores_gemma":[0.99603206,0.000070877344,0.0011340063,0.0004596857,0.000052030584,0.0011743638,0.0008760404,0.000037452308,0.00016350637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850667,0.00005502063,0.0005782803,0.00020598179,0.0003939861,0.00026009438],"domain_scores_gemma":[0.99879897,0.00037473338,0.00015578326,0.0003785925,0.00023011483,0.00006180643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050710357,0.00024635013,0.00018878598,0.00033852895,0.00048355723,0.00020643856,0.00076686864,0.00009169975,0.00031255803],"category_scores_gemma":[0.00009509699,0.00023926042,0.000090160545,0.00014464052,0.000079714824,0.0018362006,0.0003058437,0.0003969657,0.00003052092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004187957,0.00005703984,0.00042087716,0.000050645674,0.00021827899,0.0000010929431,0.0053196624,0.91141087,0.024073701,0.047620423,0.0008311294,0.009577499],"study_design_scores_gemma":[0.0018287781,0.00016634767,0.0004241515,0.00003388033,0.000019336983,0.000017285902,0.0020018178,0.81178653,0.13673271,0.008670509,0.0376961,0.00062255404],"about_ca_topic_score_codex":0.0000026431098,"about_ca_topic_score_gemma":0.0000013551013,"teacher_disagreement_score":0.5651976,"about_ca_system_score_codex":0.00035378075,"about_ca_system_score_gemma":0.00001727096,"threshold_uncertainty_score":0.9756757},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0074796377199129,"score_gpt":0.2318155201879125,"score_spread":0.2243358824679996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7397527,0.000043347067,0.07178499,0.001062847,0.0031650062,0.00083056587,0.00030514775,0.0024509118,0.18060447],"genre_scores_gemma":[0.9979317,0.00004960342,0.0005148073,0.00052315526,0.000102495345,0.00028407245,0.00029544835,0.00003354323,0.000265159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983285,0.00016246294,0.00052784337,0.00013765189,0.0006446957,0.00019884424],"domain_scores_gemma":[0.99899346,0.00017338223,0.00023027329,0.00042681486,0.000113239155,0.00006283097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066022435,0.00020975963,0.00017538478,0.00036818447,0.00038405592,0.00016193361,0.00072598207,0.00005189735,0.000893193],"category_scores_gemma":[0.000012489456,0.00022869447,0.00007615122,0.00025400717,0.0000682891,0.001235147,0.00014332596,0.0005883325,0.00009958665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010459536,0.0001857025,0.0017288865,0.00010820737,0.00042342945,0.000014836363,0.008619547,0.6028153,0.010170748,0.2773672,0.008435282,0.089084946],"study_design_scores_gemma":[0.0042175474,0.0007935503,0.0007638689,0.000325858,0.00009616764,0.002211663,0.00877339,0.6390872,0.08018889,0.009971514,0.251457,0.0021133255],"about_ca_topic_score_codex":0.000022883045,"about_ca_topic_score_gemma":0.000008376076,"teacher_disagreement_score":0.26739568,"about_ca_system_score_codex":0.0006489507,"about_ca_system_score_gemma":0.000023658806,"threshold_uncertainty_score":0.9779837},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01563210318946117,"score_gpt":0.27974107896750317,"score_spread":0.264108975778042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037843868,0.000008946991,0.9554986,0.0020300623,0.0014589649,0.000734615,0.00030223108,0.00031198707,0.0018107303],"genre_scores_gemma":[0.98626983,0.000010279082,0.00987175,0.0017504098,0.00007053731,0.0006404351,0.00012989958,0.000022073922,0.0012347688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774534,0.00017002814,0.00065492943,0.00024941127,0.0009417691,0.00023851189],"domain_scores_gemma":[0.99795705,0.00043555602,0.0006901054,0.0005359219,0.00033107577,0.00005031353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019276405,0.00021236601,0.00019254218,0.00031912496,0.00042121715,0.00013701105,0.0016002562,0.000050898692,0.000060439135],"category_scores_gemma":[0.00017948923,0.00018695167,0.0001654024,0.00035399638,0.000056744015,0.0015584902,0.00038822574,0.00031352215,0.000026486308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021128241,0.00006755042,0.000006934455,0.000024957208,0.000050896313,4.722293e-7,0.007765037,0.88804543,0.000876602,0.09667407,0.0037247934,0.0025519673],"study_design_scores_gemma":[0.00041970675,0.00018393049,0.000030449799,0.000026241625,0.000010899192,0.000013956431,0.00025093052,0.9527013,0.011851137,0.03320913,0.0011093616,0.00019299153],"about_ca_topic_score_codex":0.000037748872,"about_ca_topic_score_gemma":0.000005311743,"teacher_disagreement_score":0.948426,"about_ca_system_score_codex":0.00035264646,"about_ca_system_score_gemma":0.000118836775,"threshold_uncertainty_score":0.7623668},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Platypus; Channel (broadcasting); Computer science; Zoology; Telecommunications; Biology","score_opus":0.006056714379911874,"score_gpt":0.2162729846440621,"score_spread":0.21021627026415024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40813372,0.00025417263,0.40229708,0.06398042,0.06393196,0.002006585,0.000497862,0.00077107636,0.05812713],"genre_scores_gemma":[0.99688095,0.000013529501,0.000115399045,0.0019712797,0.00016222031,0.00006117908,0.00001434268,0.0000086424425,0.0007724686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978102,0.00027092887,0.00049250416,0.00017108503,0.0010346156,0.00022067646],"domain_scores_gemma":[0.998288,0.00048606147,0.0004638764,0.00058952917,0.00013047908,0.00004207003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558415,0.00015116538,0.000114566734,0.00011911091,0.0010983297,0.000200715,0.0027843716,0.00003241296,0.000062275176],"category_scores_gemma":[0.00006799671,0.000096089214,0.0001687178,0.00040151726,0.00008259297,0.0004552386,0.00076934067,0.00043912698,0.000046770823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091275644,0.00005535201,0.000026035737,0.000006474193,0.00006591026,0.0000014368649,0.003973185,0.23291959,0.0002650329,0.7457549,0.0046484126,0.012192387],"study_design_scores_gemma":[0.0004221272,0.00016340755,0.00049310556,0.000019384202,0.0000055866954,0.00006639052,0.0004428797,0.88187164,0.0020772843,0.054862157,0.0593889,0.00018714248],"about_ca_topic_score_codex":0.000015624515,"about_ca_topic_score_gemma":0.0000011299844,"teacher_disagreement_score":0.69089276,"about_ca_system_score_codex":0.00013807866,"about_ca_system_score_gemma":0.00007435281,"threshold_uncertainty_score":0.8447575},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01878982412312522,"score_gpt":0.2801590760765341,"score_spread":0.2613692519534089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024103792,0.00007395532,0.85543334,0.013463379,0.006130929,0.0011010849,0.00007636795,0.0003824823,0.09923464],"genre_scores_gemma":[0.9942429,0.00018186744,0.0001885435,0.0039133425,0.000076798686,0.00035655967,0.00024746155,0.000009276876,0.0007832551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977501,0.0005308652,0.00059521786,0.00022607147,0.00069907773,0.00019864144],"domain_scores_gemma":[0.9985667,0.00032658863,0.00034267554,0.00048993656,0.00021556822,0.000058530426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001256405,0.00016514274,0.00016033163,0.00047633002,0.0004523743,0.00047558825,0.0023542778,0.000040150284,0.0008956591],"category_scores_gemma":[0.00008650773,0.00017432199,0.000077139746,0.0008061388,0.000031160846,0.0030548712,0.0007781264,0.00038712862,0.0001363964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030584983,0.00012266038,0.0003248451,0.000005619241,0.000040672534,0.0000047445296,0.0043771733,0.19652307,0.0007989042,0.77603984,0.0042402195,0.017216379],"study_design_scores_gemma":[0.0049540508,0.00018488285,0.0015876326,0.000038486523,0.000008502234,0.000028344863,0.00063370966,0.8781642,0.0045960634,0.021103535,0.08807781,0.0006227939],"about_ca_topic_score_codex":0.000011103089,"about_ca_topic_score_gemma":0.000009381835,"teacher_disagreement_score":0.9701391,"about_ca_system_score_codex":0.00057046453,"about_ca_system_score_gemma":0.00008653143,"threshold_uncertainty_score":0.98068386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018029025700138392,"score_gpt":0.2544920531541213,"score_spread":0.23646302745398293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8848533,0.000025109326,0.05373834,0.018629879,0.011355797,0.0016387311,0.00040069496,0.0002997486,0.029058373],"genre_scores_gemma":[0.9961618,0.00001630335,0.000049391678,0.0033980047,0.00006242356,0.00018976581,0.000047766523,0.0000067073925,0.000067833855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976437,0.0002267701,0.0005996417,0.00017180563,0.0011652055,0.00019287398],"domain_scores_gemma":[0.9988066,0.0003096038,0.00031257363,0.00037504174,0.00015234358,0.00004384182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014990468,0.00015995537,0.00014069208,0.0002564097,0.0005412233,0.00021636904,0.0013757261,0.00003573789,0.00077607104],"category_scores_gemma":[0.00005682474,0.00010909816,0.00014587805,0.0003878585,0.00006936841,0.0012465313,0.00019027422,0.00036029093,0.000027605525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000372042,0.00014664493,0.000011100169,0.000012534757,0.000081819555,0.0000011743128,0.025042916,0.0017600256,0.0006602863,0.9692528,0.0015245768,0.0011340833],"study_design_scores_gemma":[0.005996433,0.0026313332,0.00018433682,0.00013254146,0.000058539084,0.00010224362,0.015796304,0.1307931,0.06748015,0.57324684,0.20238578,0.0011924073],"about_ca_topic_score_codex":0.000044069373,"about_ca_topic_score_gemma":0.0000033021583,"teacher_disagreement_score":0.39600596,"about_ca_system_score_codex":0.00018154115,"about_ca_system_score_gemma":0.00007631114,"threshold_uncertainty_score":0.84974337},"labels":[],"label_agreement":null}]}