{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20394906,0.00039937883,0.7753966,0.00026110437,0.00007737764,0.00013935735,0.0005774792,0.0010152372,0.018184507],"genre_scores_gemma":[0.8997591,0.0002349644,0.09313027,0.000115469986,0.000028694027,0.000091902184,0.00030410712,0.00007788502,0.0062575187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997067,0.00004292342,0.000016183958,0.000066330744,0.00011988563,0.00004797701],"domain_scores_gemma":[0.9991358,0.00024044805,0.000092155,0.00026869235,0.00021867355,0.00004422742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023749823,0.00025261435,0.00022193485,0.00049088965,0.0003229087,0.0005243399,0.00033586766,0.00043504543,0.0025759144],"category_scores_gemma":[0.0011218897,0.00020274943,0.00022251562,0.0005787362,0.0005728113,0.00056432956,0.0005369152,0.00075283647,0.00063729665],"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.0006998116,0.00013578135,0.0031604546,0.0003772181,0.00005437639,0.00069045974,0.0003123437,0.2200151,0.20397039,0.35855567,0.0061840606,0.20584439],"study_design_scores_gemma":[0.000085592066,0.0002875358,0.0025377658,0.000055723875,0.00003353426,0.00093943864,0.00006731525,0.69988924,0.12452471,0.1533954,0.01813755,0.00004621464],"about_ca_topic_score_codex":0.0006405626,"about_ca_topic_score_gemma":0.000916998,"teacher_disagreement_score":0.0025759144,"about_ca_system_score_codex":0.00042493342,"about_ca_system_score_gemma":0.00045616215,"threshold_uncertainty_score":0.008617282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012145028,0.00088757696,0.98146147,0.0008998097,0.00007143913,0.0001602993,0.00017918907,0.00058705016,0.0036080885],"genre_scores_gemma":[0.2689591,0.0017577974,0.7214245,0.0006433865,0.00031838584,0.00097388204,0.0012875469,0.0008126923,0.0038227257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98853254,0.005042361,0.00055789074,0.0027780093,0.001927222,0.0011620048],"domain_scores_gemma":[0.8997435,0.0858986,0.004172651,0.0055386107,0.003237248,0.0014093681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010062932,0.0030837392,0.0039147846,0.0033889264,0.0024761339,0.005527778,0.0046724705,0.003533736,0.007143543],"category_scores_gemma":[0.083172515,0.001623753,0.0025479745,0.0046689413,0.0050821896,0.0105813565,0.0063828873,0.0077115176,0.0029351849],"study_design_candidate":"theoretical_or_conceptual","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.0010217081,0.00046610108,0.0014735345,0.0007098877,0.00012411676,0.00015960193,0.0006028181,0.6194064,0.003229912,0.24278356,0.008576394,0.12144597],"study_design_scores_gemma":[0.000108610555,0.00013087459,0.00018014351,0.00010020464,0.000027068503,0.000102813145,0.00009543401,0.7391053,0.0015357548,0.25653416,0.0020454638,0.000034121047],"about_ca_topic_score_codex":0.0025606712,"about_ca_topic_score_gemma":0.0017659108,"teacher_disagreement_score":0.010062932,"about_ca_system_score_codex":0.0035980071,"about_ca_system_score_gemma":0.0065678884,"threshold_uncertainty_score":0.053218484},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016655896,0.0003282085,0.9787184,0.00016283317,0.00008271839,0.00004600684,0.00010686908,0.0028657834,0.0010332968],"genre_scores_gemma":[0.55446684,0.00023003013,0.43871272,0.00047411062,0.0001160434,0.00015069697,0.0006436059,0.00025970794,0.004946192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991192,0.00019730443,0.000051515162,0.00024077609,0.00030083986,0.00009022054],"domain_scores_gemma":[0.99816847,0.0006358279,0.0001989285,0.00048417435,0.00042393818,0.000088547575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306383,0.0007971651,0.001188618,0.000757621,0.00034559093,0.000817918,0.002254139,0.0009863315,0.0011728565],"category_scores_gemma":[0.0035692675,0.00048430747,0.0006419796,0.00057916547,0.000742105,0.0014600264,0.0015132005,0.0014781936,0.00060731225],"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.00028723502,0.00029719895,0.003714236,0.00016988267,0.00020341873,0.00014668843,0.00017061442,0.27185842,0.020488836,0.00829973,0.007885938,0.68647784],"study_design_scores_gemma":[0.000011701116,0.000053856194,0.00019374507,0.000005505194,0.000010369215,0.000053399486,0.000007904749,0.98899466,0.006893175,0.0026341453,0.0011312247,0.000010395087],"about_ca_topic_score_codex":0.001577166,"about_ca_topic_score_gemma":0.0031510992,"teacher_disagreement_score":0.002254139,"about_ca_system_score_codex":0.0006104576,"about_ca_system_score_gemma":0.0013492017,"threshold_uncertainty_score":0.0059794784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029302241,0.0005958238,0.96539915,0.00089727226,0.000067952875,0.00020416222,0.000074943164,0.00034787937,0.0031105797],"genre_scores_gemma":[0.72499186,0.0006070906,0.26870143,0.0006098595,0.00020508147,0.00055228075,0.000096509924,0.00012317502,0.0041127116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857405,0.0059646224,0.0006886855,0.0022936433,0.0040416406,0.001270984],"domain_scores_gemma":[0.969978,0.018610537,0.0032939545,0.005049678,0.0018859498,0.0011819751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017801512,0.0014857131,0.002540433,0.0018295932,0.0018556702,0.00386705,0.00418747,0.0039724433,0.003877615],"category_scores_gemma":[0.048426047,0.0011465547,0.0015021617,0.0021461023,0.006622676,0.010726355,0.005980279,0.00503505,0.00057897624],"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.0005102914,0.00021332588,0.0008949703,0.00026292962,0.00012913118,0.00016890827,0.00030636863,0.17487217,0.0057964684,0.7546803,0.0021358433,0.060029376],"study_design_scores_gemma":[0.00011135318,0.00024821647,0.00018528155,0.00005525688,0.00004255124,0.00019082331,0.000055866127,0.5725514,0.004991189,0.41933924,0.0021733807,0.00005547516],"about_ca_topic_score_codex":0.0005269322,"about_ca_topic_score_gemma":0.00035135017,"teacher_disagreement_score":0.017801512,"about_ca_system_score_codex":0.0035275177,"about_ca_system_score_gemma":0.00296873,"threshold_uncertainty_score":0.09414452},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47076088,0.00046495144,0.5101157,0.0005424495,0.0000381872,0.000072763316,0.00031489893,0.0002870665,0.01740325],"genre_scores_gemma":[0.8963395,0.00042301224,0.09555821,0.0001774784,0.000067032524,0.00019246864,0.00030081888,0.000060490274,0.0068810694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883276,0.00032655304,0.000050712977,0.00015858427,0.00047925406,0.0001521116],"domain_scores_gemma":[0.9955551,0.002434173,0.00086456176,0.0005662748,0.0003448043,0.00023509038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009027666,0.0005599916,0.00047052914,0.0010766622,0.00074880075,0.0009560156,0.0008024777,0.000877116,0.002190536],"category_scores_gemma":[0.0053664055,0.0004745513,0.0004774516,0.0008356972,0.0018024679,0.0014927463,0.001587064,0.0019866724,0.0004888216],"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.00019763852,0.000066712135,0.0010383207,0.000117638134,0.000024378662,0.00015164718,0.00037823932,0.058984138,0.018991897,0.9005157,0.00067815353,0.018855574],"study_design_scores_gemma":[0.000092253234,0.0003470414,0.0010389922,0.000074451185,0.000022012242,0.0005858849,0.00013288127,0.24275082,0.027820677,0.7218481,0.0052156593,0.000071266426],"about_ca_topic_score_codex":0.0004010566,"about_ca_topic_score_gemma":0.00043997524,"teacher_disagreement_score":0.002190536,"about_ca_system_score_codex":0.00095102575,"about_ca_system_score_gemma":0.0007193437,"threshold_uncertainty_score":0.0073280334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3215219,0.0005836588,0.664884,0.0010097848,0.00016418568,0.00013528968,0.0003226587,0.0003587794,0.011019778],"genre_scores_gemma":[0.966624,0.00032978473,0.027057631,0.00012872563,0.000048973594,0.00019342905,0.000102629514,0.00004194842,0.0054727597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.00039695177,0.000039546285,0.00016802226,0.00012330402,0.00015694216],"domain_scores_gemma":[0.99601054,0.0025079644,0.0006535491,0.0002635333,0.0003256254,0.00023886166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018992262,0.00071630784,0.0011805051,0.0012981842,0.00091461453,0.0018322538,0.002061102,0.0024721269,0.0026513769],"category_scores_gemma":[0.006711835,0.0006523401,0.0011464095,0.0009286812,0.0026260766,0.0023137862,0.001757233,0.0019199929,0.0003132319],"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.00004703141,0.00004933237,0.0013314883,0.000025067275,0.000036880854,0.00016309558,0.00013730161,0.93588734,0.00090373924,0.05948516,0.00023163739,0.0017020147],"study_design_scores_gemma":[0.0000042095176,0.000007059875,0.00007628288,0.0000024847147,0.0000035839175,0.000007636392,0.000010774525,0.9941122,0.00004756737,0.0056418446,0.00008262923,0.0000036900142],"about_ca_topic_score_codex":0.01364286,"about_ca_topic_score_gemma":0.008531725,"teacher_disagreement_score":0.01364286,"about_ca_system_score_codex":0.0019862566,"about_ca_system_score_gemma":0.0009318379,"threshold_uncertainty_score":0.027126849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02498942,0.00084012205,0.97126454,0.000731147,0.000053384425,0.000052002113,0.00006580482,0.00024818478,0.0017554113],"genre_scores_gemma":[0.8671146,0.0005893109,0.12642556,0.00057146,0.00020954604,0.00038573443,0.00017621095,0.00015165379,0.00437603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967464,0.0019038771,0.00012372712,0.00055043795,0.0003237636,0.00035175573],"domain_scores_gemma":[0.9880711,0.009467433,0.000951916,0.0006011109,0.00053182367,0.00037659777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00618944,0.0020074006,0.0035312339,0.00088577194,0.000911599,0.0026997225,0.0029262893,0.0036333017,0.0020421476],"category_scores_gemma":[0.01817562,0.0013248387,0.0012381166,0.001198428,0.0028849866,0.004279771,0.002876553,0.004069193,0.0005471887],"study_design_candidate":"theoretical_or_conceptual","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.00010547898,0.00005628862,0.00052123074,0.0000613752,0.00007725668,0.000056685647,0.000056328037,0.95606023,0.00023602018,0.03303545,0.00046389428,0.009269807],"study_design_scores_gemma":[0.000011604836,0.000022897078,0.000037214642,0.000010721506,0.0000076052534,0.0000091462925,0.000007056742,0.97983325,0.00009918142,0.019832956,0.00012228084,0.0000061758496],"about_ca_topic_score_codex":0.0025069737,"about_ca_topic_score_gemma":0.0023031544,"teacher_disagreement_score":0.00618944,"about_ca_system_score_codex":0.002223955,"about_ca_system_score_gemma":0.0013742672,"threshold_uncertainty_score":0.03273326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022630324,0.00023358653,0.9938304,0.0001267117,0.00008354814,0.00002524809,0.000021325885,0.00016165862,0.0032544667],"genre_scores_gemma":[0.28828216,0.0010448211,0.6954861,0.00021166941,0.00015243316,0.00029660075,0.00015488103,0.00017104589,0.0142002525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.0001774141,0.000022397096,0.000055645953,0.00030153035,0.000051151277],"domain_scores_gemma":[0.9990246,0.000554448,0.00005780267,0.00011175884,0.00022123588,0.000030091105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008859158,0.00075178227,0.0005973075,0.00047974772,0.00037596293,0.0008218169,0.00086585723,0.00073256204,0.004558913],"category_scores_gemma":[0.0037061065,0.00026688597,0.00042846877,0.0009386846,0.00092422304,0.0008390261,0.0008416277,0.0015464033,0.0012943527],"study_design_candidate":"theoretical_or_conceptual","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.0001211238,0.000035313875,0.00027423454,0.0001799017,0.00004119914,0.000101269914,0.00012940347,0.61635506,0.005509832,0.28618142,0.0042911842,0.08678003],"study_design_scores_gemma":[0.0000061575092,0.000009867938,0.000012457813,0.0000065541344,0.0000018662241,0.000012206411,0.000003335714,0.9856603,0.00064728153,0.0117144855,0.0019227654,0.0000027263004],"about_ca_topic_score_codex":0.003798914,"about_ca_topic_score_gemma":0.005045788,"teacher_disagreement_score":0.004558913,"about_ca_system_score_codex":0.0008385173,"about_ca_system_score_gemma":0.0014008192,"threshold_uncertainty_score":0.0152511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028946795,0.00019880026,0.9585241,0.00021897956,0.00026860426,0.00010313218,0.00031172135,0.0008919012,0.010536029],"genre_scores_gemma":[0.5746422,0.0010065935,0.40793628,0.0004107348,0.0002758449,0.00032050427,0.0007843538,0.00018863434,0.0144347735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000081859485,0.000019781812,0.00008254645,0.00020877853,0.00008000342],"domain_scores_gemma":[0.999703,0.00012303675,0.00002902644,0.0000644078,0.00007134381,0.000009048058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030296156,0.0007194881,0.00033586798,0.0005292991,0.00038425304,0.00083198835,0.00045911505,0.0005387381,0.0034545017],"category_scores_gemma":[0.0015232655,0.0001941776,0.00047692325,0.00065201696,0.00070485694,0.0010776437,0.0008986771,0.00081987976,0.0016014132],"study_design_candidate":"theoretical_or_conceptual","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.00045881927,0.00014062817,0.00218329,0.00028530118,0.0000773254,0.0016893358,0.00040434743,0.40465593,0.08585732,0.23571666,0.00714212,0.261389],"study_design_scores_gemma":[0.000038991024,0.00014276123,0.0011015569,0.00007607327,0.00003810553,0.0010352621,0.00014530064,0.86310416,0.048362933,0.0643795,0.02149556,0.00007983047],"about_ca_topic_score_codex":0.002431711,"about_ca_topic_score_gemma":0.0024662695,"teacher_disagreement_score":0.0034545017,"about_ca_system_score_codex":0.00059827545,"about_ca_system_score_gemma":0.0006045938,"threshold_uncertainty_score":0.011556447},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08400807,0.00059296895,0.9106051,0.001373817,0.000057752215,0.00025212794,0.0004250123,0.0006408717,0.0020442675],"genre_scores_gemma":[0.6314986,0.00054650387,0.36132765,0.0005251182,0.0002186497,0.0005834007,0.0016700935,0.0003203691,0.0033097386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944031,0.0029247133,0.00022997412,0.0011359649,0.00084786874,0.0004583487],"domain_scores_gemma":[0.928524,0.06124298,0.0024998556,0.004190936,0.0020006495,0.0015414975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007199433,0.00154114,0.00263544,0.0009208605,0.00095866126,0.0023720257,0.0030740236,0.002409676,0.0035788792],"category_scores_gemma":[0.051998723,0.001215682,0.0010207391,0.0015526665,0.0024388582,0.0059883143,0.003164819,0.0035924672,0.0007224879],"study_design_candidate":"theoretical_or_conceptual","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.0009995197,0.0005420994,0.0028182922,0.0005125023,0.00017847677,0.00022074301,0.00033954706,0.8372015,0.0035254334,0.071732245,0.0062082787,0.07572141],"study_design_scores_gemma":[0.000039432973,0.000066068926,0.0001963786,0.000008815417,0.00000845042,0.000033831933,0.000025461784,0.959235,0.00047827497,0.039694905,0.0002003714,0.000012860578],"about_ca_topic_score_codex":0.0051611974,"about_ca_topic_score_gemma":0.004606361,"teacher_disagreement_score":0.007199433,"about_ca_system_score_codex":0.002314122,"about_ca_system_score_gemma":0.0030987053,"threshold_uncertainty_score":0.03807473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019854076,0.00017775815,0.9777125,0.00044061616,0.000036755097,0.000082561455,0.00027193327,0.00038289538,0.0010409878],"genre_scores_gemma":[0.5385004,0.00040128428,0.45216954,0.000308457,0.00019908075,0.00031160435,0.0017789672,0.00027353043,0.0060571847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971597,0.0014211942,0.00007070219,0.0007079864,0.00038968693,0.00025068037],"domain_scores_gemma":[0.9888017,0.0072686663,0.0008975827,0.0014525241,0.0010012824,0.00057827384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039703515,0.0013672496,0.0020853826,0.0011772626,0.00093308924,0.0017406986,0.003836148,0.0023489525,0.0035061615],"category_scores_gemma":[0.01407832,0.0009394457,0.0011694963,0.0021380556,0.0018259613,0.0038276953,0.00225904,0.0035561367,0.0011184989],"study_design_candidate":"theoretical_or_conceptual","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.00013960002,0.00012550941,0.00056630984,0.00011443935,0.000054901848,0.000112995585,0.000100203484,0.9351527,0.000887377,0.038288835,0.0031904518,0.021266632],"study_design_scores_gemma":[0.0000054413636,0.0000107651085,0.000049582017,0.0000020870289,0.0000022928152,0.000010468436,0.000007948715,0.9879408,0.0001258304,0.011680708,0.00015856896,0.0000055204573],"about_ca_topic_score_codex":0.0129657835,"about_ca_topic_score_gemma":0.012526693,"teacher_disagreement_score":0.0129657835,"about_ca_system_score_codex":0.0017884116,"about_ca_system_score_gemma":0.002099533,"threshold_uncertainty_score":0.025780678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7238952,0.0012051291,0.26956972,0.00044963614,0.000037770402,0.000049828603,0.00024908123,0.00031228425,0.0042312625],"genre_scores_gemma":[0.99263775,0.00034492393,0.0058633634,0.000038087317,0.00002288505,0.000040293653,0.00011380384,0.000056542656,0.00088236557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992754,0.00015605905,0.00003290706,0.00018150774,0.0002750415,0.000079111014],"domain_scores_gemma":[0.991085,0.006155673,0.0011324682,0.00058728317,0.00066522905,0.00037426414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104178,0.00031314857,0.0005365811,0.0013479795,0.00079694326,0.0010335314,0.0012671266,0.00083608995,0.0016290948],"category_scores_gemma":[0.010959226,0.000508312,0.00038743086,0.0008786726,0.0018268323,0.0022365213,0.00085071276,0.00073338585,0.00017351171],"study_design_candidate":"theoretical_or_conceptual","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.00047608538,0.00009370341,0.015266293,0.00035400232,0.00014259412,0.000746728,0.0005338176,0.5848375,0.048415396,0.32513636,0.0009140638,0.023083378],"study_design_scores_gemma":[0.000018796884,0.000065633416,0.0031346537,0.000037166476,0.00002947623,0.00035336192,0.0000629434,0.9124144,0.009340511,0.07379726,0.00069534755,0.000050461294],"about_ca_topic_score_codex":0.001303878,"about_ca_topic_score_gemma":0.0012715056,"teacher_disagreement_score":0.0016290948,"about_ca_system_score_codex":0.0013089841,"about_ca_system_score_gemma":0.00067170116,"threshold_uncertainty_score":0.0094973445},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022438642,0.005337087,0.86882913,0.02868832,0.0019000394,0.001058839,0.00049948116,0.0010531872,0.070195206],"genre_scores_gemma":[0.7089191,0.0055843894,0.21657804,0.004340587,0.003858526,0.0012895891,0.00070109335,0.0006192894,0.058109365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9061765,0.05685951,0.0033272177,0.011125812,0.019675389,0.0028355413],"domain_scores_gemma":[0.7293156,0.15930116,0.018894818,0.06129819,0.0249996,0.006190659],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.04576765,0.0010330431,0.002636428,0.0024367291,0.0038320883,0.009401161,0.0037943712,0.004314307,0.015432847],"category_scores_gemma":[0.21888322,0.0013273737,0.0013146076,0.003954331,0.006406722,0.014503736,0.008691415,0.0055803405,0.006485433],"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.0003912504,0.00011460047,0.0023234412,0.0005897892,0.00014322328,0.00023506397,0.00077718915,0.022792365,0.0014871937,0.7171051,0.035102732,0.21893804],"study_design_scores_gemma":[0.00013194159,0.00017021914,0.0005863494,0.00015861145,0.000045615583,0.00040848056,0.00024025746,0.056324147,0.0020603295,0.86604303,0.073746115,0.00008479874],"about_ca_topic_score_codex":0.00074802653,"about_ca_topic_score_gemma":0.000794891,"teacher_disagreement_score":0.95423234,"about_ca_system_score_codex":0.0039235633,"about_ca_system_score_gemma":0.009545563,"threshold_uncertainty_score":0.24204534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025929771,0.00014315205,0.99578357,0.000054474476,0.000017152242,0.00002395763,0.000013896748,0.00006673588,0.0013040956],"genre_scores_gemma":[0.41962436,0.0009314985,0.57386,0.0001633059,0.00009903946,0.00031578704,0.000120561876,0.00019041717,0.004695058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990601,0.00031567004,0.00004226003,0.00008150715,0.00040215717,0.00009823073],"domain_scores_gemma":[0.998442,0.0009163261,0.00015001213,0.00011173138,0.0003394972,0.000040497118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016164797,0.00083955796,0.00079399155,0.00061874965,0.00046733985,0.0012874098,0.0011003923,0.0008654436,0.0015439946],"category_scores_gemma":[0.0072247423,0.00051976467,0.0006250196,0.0010180513,0.0012979994,0.0015536702,0.0010891991,0.0012914636,0.0004803199],"study_design_candidate":"theoretical_or_conceptual","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.000048917547,0.000051156778,0.00036180113,0.00012465449,0.000024240437,0.000117185395,0.00024861202,0.79482406,0.0057170102,0.11475502,0.0018364755,0.08189089],"study_design_scores_gemma":[0.0000034846971,0.000014450213,0.000034071458,0.0000062243253,0.0000022633228,0.000021308284,0.000009252415,0.98816097,0.00093034597,0.0103614675,0.0004488469,0.000007357712],"about_ca_topic_score_codex":0.0026330235,"about_ca_topic_score_gemma":0.0025494422,"teacher_disagreement_score":0.0026330235,"about_ca_system_score_codex":0.0012878377,"about_ca_system_score_gemma":0.0017639608,"threshold_uncertainty_score":0.009343922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021915533,0.00025120255,0.97117394,0.00054024847,0.000067840505,0.00007776187,0.00010799008,0.00011440386,0.005751115],"genre_scores_gemma":[0.792722,0.0005686595,0.2011436,0.0002996658,0.00012578431,0.00023861337,0.00027368276,0.00004670373,0.004581255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767345,0.00083914463,0.00010273294,0.00034262755,0.00078337366,0.0002585725],"domain_scores_gemma":[0.9960295,0.0024177318,0.00036672826,0.0006019969,0.00041807178,0.00016597012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002147929,0.0012953633,0.0015336061,0.00072057184,0.00073745457,0.0019154331,0.0018708818,0.0018582101,0.0021871189],"category_scores_gemma":[0.007550367,0.00036567455,0.00093489664,0.001346955,0.002173764,0.0027587423,0.0054603154,0.0027636203,0.0005841475],"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.00047849477,0.00014072807,0.00067692954,0.00035390502,0.000086050364,0.0009634133,0.0004935685,0.29313233,0.011238871,0.6390283,0.0023530303,0.051054403],"study_design_scores_gemma":[0.00007554912,0.00014753015,0.000112745234,0.000048818525,0.000027540176,0.00046993114,0.00008054773,0.78963757,0.00905001,0.1986082,0.0017019463,0.000039612834],"about_ca_topic_score_codex":0.00049405027,"about_ca_topic_score_gemma":0.00035372257,"teacher_disagreement_score":0.0021871189,"about_ca_system_score_codex":0.0010053623,"about_ca_system_score_gemma":0.0011853537,"threshold_uncertainty_score":0.011359453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138030555,0.00018745114,0.9843461,0.00010009137,0.00002165627,0.000019979385,0.0000874559,0.00026445967,0.0011698598],"genre_scores_gemma":[0.93122697,0.00050973974,0.06265357,0.00010891962,0.00005390997,0.00017197344,0.0002691353,0.00010682189,0.0048990236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934846,0.00020896608,0.00003063471,0.00014538532,0.0001877581,0.00007883361],"domain_scores_gemma":[0.99861157,0.0007648913,0.00019709943,0.00012820809,0.0002755656,0.000022573964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067935686,0.0007783248,0.0007711668,0.0005588261,0.0004114961,0.000943648,0.0011513996,0.0008658419,0.0014162754],"category_scores_gemma":[0.002400093,0.0003827346,0.00054439355,0.00066801027,0.0009058715,0.0018929123,0.00066789123,0.0013123107,0.0005739051],"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.000037859936,0.000016320886,0.00045279643,0.000037510283,0.00001849933,0.000047933343,0.00004585904,0.976424,0.001973147,0.013261784,0.00021283899,0.007471551],"study_design_scores_gemma":[0.000001019333,0.000006762643,0.000036711957,0.0000017256889,0.0000024721594,0.000008627613,0.0000018308231,0.998302,0.00027822764,0.001280411,0.0000771784,0.0000030826873],"about_ca_topic_score_codex":0.005139148,"about_ca_topic_score_gemma":0.0038074523,"teacher_disagreement_score":0.005139148,"about_ca_system_score_codex":0.0008191367,"about_ca_system_score_gemma":0.0008508693,"threshold_uncertainty_score":0.0102184415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17360324,0.004175329,0.44940364,0.025071237,0.0009908632,0.00013368638,0.0009434778,0.00097430596,0.34470433],"genre_scores_gemma":[0.9535565,0.0009991818,0.031014357,0.0013331973,0.00043486847,0.00010923155,0.000117565585,0.000152212,0.012282927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994387,0.00018370412,0.000013976225,0.0001198599,0.0001556928,0.00008804692],"domain_scores_gemma":[0.99868435,0.0007252764,0.000077623175,0.0003059636,0.00009838435,0.00010842144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437925,0.000342108,0.00043639843,0.00074277783,0.0017334272,0.0024190028,0.0006464789,0.002045137,0.008653123],"category_scores_gemma":[0.0036960896,0.00026823184,0.00043515806,0.00039748094,0.007078778,0.008199143,0.0018582508,0.0036459835,0.0007543938],"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.000014066552,0.0000039244364,0.000049298844,0.000009960212,0.0000023962755,0.000019988142,0.000046886715,0.0010038828,0.0004710431,0.99628025,0.00089829625,0.0012000443],"study_design_scores_gemma":[0.000009141533,0.000012459845,0.00011923813,0.000015684107,0.0000023340772,0.0000780795,0.000059587896,0.01230328,0.000449988,0.97976065,0.0071771517,0.000012338923],"about_ca_topic_score_codex":0.0010475203,"about_ca_topic_score_gemma":0.0005390998,"teacher_disagreement_score":0.008653123,"about_ca_system_score_codex":0.0010398399,"about_ca_system_score_gemma":0.00074100227,"threshold_uncertainty_score":0.028947592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103398964,0.0025976007,0.8721598,0.003746407,0.0004925689,0.00033221458,0.0007267155,0.0017103462,0.014835342],"genre_scores_gemma":[0.9213676,0.0008222559,0.061051458,0.0008309881,0.000507223,0.0003646175,0.00057423743,0.00014712656,0.014334505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99333364,0.0029880996,0.00020860725,0.00095857435,0.0014427282,0.0010682544],"domain_scores_gemma":[0.9721664,0.018518183,0.0020641722,0.0036715036,0.0026200183,0.00095969776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005780773,0.0011812431,0.003049303,0.0021665792,0.0018446144,0.0030809608,0.0041522942,0.0031350325,0.0050624018],"category_scores_gemma":[0.03363754,0.00080710585,0.0008366972,0.0033037537,0.0030955945,0.007104365,0.003873394,0.0026492542,0.0017536902],"study_design_candidate":"theoretical_or_conceptual","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.00091004913,0.00029091633,0.0019504535,0.00040324262,0.00012206434,0.0010315974,0.0005298445,0.45432433,0.002768312,0.44009328,0.016201401,0.08137449],"study_design_scores_gemma":[0.000068495465,0.00007257857,0.00026675517,0.000023721544,0.000016355547,0.00023247018,0.00007492076,0.8008895,0.0005146261,0.1958598,0.0019450218,0.00003577214],"about_ca_topic_score_codex":0.0038084253,"about_ca_topic_score_gemma":0.0031991787,"teacher_disagreement_score":0.005780773,"about_ca_system_score_codex":0.0033125896,"about_ca_system_score_gemma":0.0020396477,"threshold_uncertainty_score":0.030571997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.243512,0.0030042438,0.6965593,0.004125654,0.00022580895,0.00019968377,0.0007369069,0.0006211254,0.05101519],"genre_scores_gemma":[0.9556321,0.0015841821,0.038154785,0.0006792592,0.0003444339,0.0002325001,0.0003728474,0.00013807186,0.0028618968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99491477,0.0014447737,0.00032557314,0.0011148665,0.0013535529,0.0008465206],"domain_scores_gemma":[0.9672213,0.024177434,0.0024093622,0.004289444,0.0011944595,0.0007080286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057471283,0.001691461,0.0016260791,0.001749563,0.0015778225,0.00444816,0.0015276857,0.0021351643,0.003826839],"category_scores_gemma":[0.028013712,0.0010004963,0.001708575,0.0017219016,0.0075294827,0.0119569115,0.0042621223,0.0065669087,0.00095119927],"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.0003559388,0.00006525838,0.0007790903,0.0001605917,0.000038687693,0.00022364651,0.00023237156,0.04261962,0.0068837437,0.9349722,0.001257939,0.012410785],"study_design_scores_gemma":[0.00004113028,0.00012489005,0.0002980056,0.000072150244,0.000028683975,0.00023390571,0.00006492856,0.14283958,0.006502802,0.8481068,0.0016318407,0.000055317134],"about_ca_topic_score_codex":0.00038806756,"about_ca_topic_score_gemma":0.00023485016,"teacher_disagreement_score":0.0057471283,"about_ca_system_score_codex":0.0020184931,"about_ca_system_score_gemma":0.0013717801,"threshold_uncertainty_score":0.030394077},"labels":[],"label_agreement":null}]}