{"meta":{"query_hash":"2a892fb2da13","filters":{"venue":"IEEE Transactions on Information Theory"},"cohort_total":451,"direct_labels_cover":0,"predictions_cover":451,"exported":451,"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/2a892fb2da13","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Information+Theory"},"results":[{"id":"W1490574178","doi":"10.1109/tit.2011.2137230","title":"Construction of New Delay-Tolerant Space-Time Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"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":"Block code; Asynchronous communication; Computer science; Luby transform code; Synchronization (alternating current); Online codes; Construct (python library); Turbo code; Linear code; Mathematics; Algorithm; Topology (electrical circuits); Decoding methods; Telecommunications; Computer network; Combinatorics","score_opus":0.026317244189914782,"score_gpt":0.23096336754838367,"score_spread":0.20464612335846888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490574178","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.0028639042,0.000024851637,0.98343956,0.00011980153,0.00032503266,0.00014378922,0.0000054950415,0.00014412761,0.012933433],"genre_scores_gemma":[0.9538144,0.00014492749,0.04537667,0.00026514436,0.0000113516735,0.000013516585,0.0000026415325,0.0000049554646,0.0003663841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914855,0.00012309435,0.00035981744,0.00008879737,0.00015781909,0.000121945326],"domain_scores_gemma":[0.9990287,0.00009709368,0.00016649118,0.000475617,0.00015734497,0.000074775075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034187423,0.00010972778,0.0001329034,0.000239975,0.00018442831,0.000044399607,0.00042301315,0.00005749202,0.0004934678],"category_scores_gemma":[0.000006715783,0.00010442646,0.0000755447,0.0003761924,0.00008603586,0.0015855456,0.0000045721554,0.00015063056,0.0002466257],"study_design_candidate":"design_other","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.00008693288,0.00006928112,0.000004073103,0.000011258069,0.000050159353,2.5775793e-7,0.012021452,0.002666301,0.0002988668,0.3680749,0.00028809367,0.61642843],"study_design_scores_gemma":[0.0035969433,0.0008337118,0.0005974733,0.00031686982,0.000103062586,0.00017399718,0.0017974504,0.54876304,0.35819644,0.07008532,0.014253897,0.0012818109],"about_ca_topic_score_codex":0.000008957577,"about_ca_topic_score_gemma":0.000003313341,"teacher_disagreement_score":0.9509505,"about_ca_system_score_codex":0.00003413393,"about_ca_system_score_gemma":0.00008090985,"threshold_uncertainty_score":0.5403126},"labels":[],"label_agreement":null},{"id":"W1506824078","doi":"10.1109/tit.2015.2450721","title":"Output Constrained Lossy Source Coding With Limited Common Randomness","year":2015,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Randomness; Encoder; Computer science; Channel (broadcasting); Algorithm; Mathematical optimization; Mathematics; Telecommunications; Statistics","score_opus":0.017203309730539042,"score_gpt":0.2336437275389816,"score_spread":0.21644041780844256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506824078","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.012508232,0.00006551938,0.9705112,0.00008847166,0.0004914282,0.0009211501,0.00023897391,0.0030234605,0.012151572],"genre_scores_gemma":[0.9966705,0.0002068762,0.0021039748,0.00017392775,0.000028774859,0.00042831895,0.00021008824,0.00006854556,0.00010903129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812484,0.0002229843,0.0007802742,0.00016563798,0.00042531893,0.000280928],"domain_scores_gemma":[0.9977836,0.00035522314,0.00025830662,0.0011030214,0.00034793187,0.00015188764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087233254,0.0004645603,0.0005321944,0.00066182466,0.00019600907,0.00024066052,0.0006235245,0.00048698194,0.00007147397],"category_scores_gemma":[0.0000139224085,0.00046094728,0.00015307656,0.0002713226,0.00022229776,0.00078776537,0.000011395149,0.0015464466,0.00011760652],"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.0005159092,0.000073041825,0.0000021242377,0.0005140981,0.0003052508,0.0000012959694,0.0071004843,0.9159377,0.00003551341,0.0024905398,0.0007752257,0.072248824],"study_design_scores_gemma":[0.009129901,0.00031308612,0.000027410337,0.0028817593,0.0005607502,0.00014200727,0.0052850484,0.88933104,0.05224033,0.012470814,0.02434577,0.0032720673],"about_ca_topic_score_codex":0.000019904126,"about_ca_topic_score_gemma":0.00001630885,"teacher_disagreement_score":0.9841622,"about_ca_system_score_codex":0.00031766554,"about_ca_system_score_gemma":0.00012501169,"threshold_uncertainty_score":0.99978423},"labels":[],"label_agreement":null},{"id":"W1509953781","doi":"10.1109/tit.2015.2462846","title":"Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"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; National University of Singapore; National Science Foundation","keywords":"Disjoint sets; Erasure code; Header; Block code; Mathematics; Discrete mathematics; Computer science; Repetition code; Coset; Linear code; Decoding methods; Algorithm; Statistics","score_opus":0.017193150510787302,"score_gpt":0.2138287944117505,"score_spread":0.19663564390096322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509953781","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.012901819,0.000016515143,0.9798352,0.0002991701,0.0008456427,0.0003351764,0.0000067819906,0.00034415146,0.005415536],"genre_scores_gemma":[0.9975115,0.000007954932,0.0018202487,0.00042589882,0.000028570985,0.00008546986,0.0000014997136,0.0000079677775,0.00011088794],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873185,0.00017566571,0.00034294528,0.00019288853,0.0003184011,0.0002382703],"domain_scores_gemma":[0.9990332,0.00012501667,0.00011365074,0.00043328656,0.00009898972,0.0001958448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010171891,0.00019117244,0.00015778815,0.00042021816,0.00031649924,0.0002532054,0.0003523871,0.00010545453,0.00003412152],"category_scores_gemma":[0.000014555972,0.00017943485,0.00009456675,0.0005954106,0.00010766217,0.002655896,0.000004634461,0.00028005772,0.0002119854],"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.0004001959,0.00026122972,0.000014477238,0.00011175129,0.00014241211,0.0000045890397,0.01920473,0.017793387,0.00016561378,0.45445454,0.00026702505,0.50718004],"study_design_scores_gemma":[0.011601522,0.005006818,0.001806823,0.00048417973,0.00028733572,0.0005207664,0.007650541,0.32239288,0.045944832,0.58461064,0.016376236,0.0033173983],"about_ca_topic_score_codex":0.0000061533674,"about_ca_topic_score_gemma":0.0000015400656,"teacher_disagreement_score":0.98460966,"about_ca_system_score_codex":0.000054819222,"about_ca_system_score_gemma":0.00008148609,"threshold_uncertainty_score":0.73171407},"labels":[],"label_agreement":null},{"id":"W1512713022","doi":"10.1109/tit.2015.2445753","title":"Streaming Codes for Multicast Over Burst Erasure Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"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":"Computer science; Erasure; Multicast; Network packet; Converse; Binary erasure channel; Erasure code; Channel (broadcasting); Computer network; Channel capacity; Topology (electrical circuits); Algorithm; Decoding methods; Mathematics","score_opus":0.042140692939551264,"score_gpt":0.28563617728953816,"score_spread":0.2434954843499869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512713022","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.0014133144,0.00003409063,0.99512094,0.00037034412,0.0007729702,0.0003102714,0.000021441845,0.00020269377,0.0017539134],"genre_scores_gemma":[0.99019325,0.00004258565,0.008524841,0.0007455631,0.000036613943,0.00012044804,0.000009833123,0.000006702865,0.0003201811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.0001048667,0.0002733627,0.00011033628,0.00018747427,0.0001742894],"domain_scores_gemma":[0.99877614,0.0002901568,0.00009134577,0.0004381371,0.00029439066,0.00010984573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544902,0.00012495324,0.000115118855,0.00018273694,0.00032425812,0.00022477034,0.0004403962,0.00005945909,0.00002927073],"category_scores_gemma":[0.000033073746,0.0001171582,0.00007069626,0.00027246622,0.000042250296,0.0019100511,0.000004925815,0.00014735525,0.00009567906],"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.00013716136,0.00015575635,0.000003813198,0.000028095395,0.00007151469,3.2927005e-7,0.014291742,0.08187664,0.00016374385,0.21205236,0.0017595659,0.68945926],"study_design_scores_gemma":[0.0025089837,0.00029101456,0.00005940741,0.000096784956,0.000024550282,0.000011952446,0.0013432886,0.9310801,0.01073109,0.006701514,0.0466485,0.00050278805],"about_ca_topic_score_codex":0.0000020114528,"about_ca_topic_score_gemma":0.0000054547863,"teacher_disagreement_score":0.9887799,"about_ca_system_score_codex":0.00008314232,"about_ca_system_score_gemma":0.00007045144,"threshold_uncertainty_score":0.47775725},"labels":[],"label_agreement":null},{"id":"W1517085700","doi":"10.1109/tit.2015.2463285","title":"On a Markov Lemma and Typical Sequences for Polish Alphabets","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Lemma (botany); Mathematics; Markov process; Computer science; Discrete mathematics; Algorithm; Combinatorics; Statistics","score_opus":0.018577101489721453,"score_gpt":0.24363570155091918,"score_spread":0.22505860006119774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517085700","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.0139873745,0.000010362169,0.9812869,0.0003955225,0.00057286595,0.00020471693,0.000022543605,0.00017203034,0.0033477303],"genre_scores_gemma":[0.9934048,0.000005508641,0.0051163426,0.0012967901,0.00002163173,0.00006758735,0.0000023218072,0.0000040864757,0.00008093161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999261,0.00008471981,0.00019717446,0.00012219352,0.00017063055,0.00016425892],"domain_scores_gemma":[0.99913937,0.00035079318,0.00006262892,0.00023726065,0.00008730738,0.0001226273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069024705,0.000110582514,0.000096075695,0.0002501718,0.00019915773,0.00016564513,0.00025895776,0.00006534583,0.000018532432],"category_scores_gemma":[0.000024763449,0.00009733312,0.00006946461,0.00022316078,0.00008125922,0.0013844821,0.0000022222646,0.00011725906,0.000050617447],"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.0003940026,0.000042219177,0.0000012136292,0.000013986128,0.000020166795,2.7580126e-7,0.00211766,0.00077490095,0.00001223618,0.76730096,0.00065872405,0.22866365],"study_design_scores_gemma":[0.001924684,0.0012547876,0.00008844348,0.000064346146,0.00002844036,0.000036800582,0.0010333546,0.019796306,0.005928911,0.9593177,0.01009942,0.00042683922],"about_ca_topic_score_codex":0.000002226918,"about_ca_topic_score_gemma":0.0000018562664,"teacher_disagreement_score":0.97941744,"about_ca_system_score_codex":0.000027982096,"about_ca_system_score_gemma":0.00004996323,"threshold_uncertainty_score":0.39691296},"labels":[],"label_agreement":null},{"id":"W1555131579","doi":"10.1109/tit.2004.838109","title":"A Mass Formula and Rank of<tex>$BBZ_4$</tex>Cyclic Codes of Length<tex>$2^e$</tex>","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rank (graph theory); Combinatorics; Mathematics","score_opus":0.017928381731327818,"score_gpt":0.24359312349006693,"score_spread":0.2256647417587391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555131579","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.1723155,0.0011366676,0.8124709,0.0006629094,0.002345336,0.0019434142,0.000838635,0.0012718713,0.0070147472],"genre_scores_gemma":[0.92165506,0.0015463036,0.07089034,0.0011755209,0.0003299834,0.000515442,0.00055372156,0.000246406,0.0030872286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9868173,0.0014323997,0.0045456747,0.0018935491,0.002827002,0.0024840843],"domain_scores_gemma":[0.98755455,0.0024399732,0.002479106,0.0049518365,0.0014152193,0.001159313],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0054843673,0.002246942,0.0024215379,0.003613257,0.0022030796,0.0010556186,0.0035406796,0.0014087411,0.0016327769],"category_scores_gemma":[0.00046611213,0.0022782232,0.0018931011,0.004440146,0.0018193788,0.0069987983,0.00017101088,0.0020894373,0.0023541984],"study_design_candidate":"not_applicable","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.007710735,0.0053424714,0.00025917188,0.00363451,0.0042355675,0.000014513161,0.08833914,0.074890226,0.12256612,0.42156148,0.008411488,0.26303458],"study_design_scores_gemma":[0.01771945,0.0013388696,0.0009952906,0.0032955937,0.002197086,0.0009144522,0.0010666944,0.0012095481,0.021261776,0.20714042,0.73502386,0.0078369845],"about_ca_topic_score_codex":0.00012410253,"about_ca_topic_score_gemma":0.001507201,"teacher_disagreement_score":0.7493396,"about_ca_system_score_codex":0.00059077184,"about_ca_system_score_gemma":0.00062680006,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W1560541233","doi":"10.1109/tit.2015.2449852","title":"New Nonasymptotic Channel Coding Theorems for Structured Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Low-density parity-check code; Mathematics; Equipartition theorem; Coding (social sciences); Discrete mathematics; Block code; Combinatorics; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.018765215967356065,"score_gpt":0.24020544214712714,"score_spread":0.22144022617977108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560541233","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.0010397203,0.000034974633,0.99236387,0.00007320566,0.0005555547,0.00044989036,0.00008052355,0.001062163,0.0043401076],"genre_scores_gemma":[0.99024504,0.00004722617,0.009225614,0.00015990323,0.000037257025,0.00013521191,0.000033450568,0.000027016013,0.00008927658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919957,0.00004300184,0.00033491408,0.00006792748,0.00017388786,0.00018068671],"domain_scores_gemma":[0.9991143,0.00019532802,0.00006188813,0.0003683167,0.00013059028,0.00012961461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041408482,0.00016422453,0.00015425534,0.00026092172,0.000120651246,0.00008173917,0.00027429397,0.0001226789,0.000050897466],"category_scores_gemma":[0.000017538432,0.00016792539,0.00008014592,0.00017783964,0.00003886163,0.00097429176,0.0000013852083,0.00020177456,0.0000679971],"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.00032155262,0.00004409856,9.794787e-7,0.00020259341,0.0001955018,2.0300645e-7,0.019103188,0.5064348,0.0008910409,0.25589746,0.008427268,0.20848131],"study_design_scores_gemma":[0.002935112,0.00026297735,0.000022379209,0.00018396841,0.000093797054,0.00002754271,0.003821068,0.37560874,0.35151187,0.24257421,0.021941863,0.0010164811],"about_ca_topic_score_codex":0.0000059732906,"about_ca_topic_score_gemma":0.000006604735,"teacher_disagreement_score":0.9892053,"about_ca_system_score_codex":0.00013375461,"about_ca_system_score_gemma":0.00004914578,"threshold_uncertainty_score":0.6847799},"labels":[],"label_agreement":null},{"id":"W1608621648","doi":"10.1109/tit.2009.2018339","title":"Quantum Serial Turbo Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":117,"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; Université de Sherbrooke","funders":"","keywords":"Turbo code; Serial concatenated convolutional codes; Quantum convolutional code; Convolutional code; Concatenated error correction code; Low-density parity-check code; Algorithm; Computer science; Block code; Linear code; Theoretical computer science; BCJR algorithm; Decoding methods","score_opus":0.006329227655511901,"score_gpt":0.2174012273477657,"score_spread":0.21107199969225382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608621648","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.012123692,0.000007723604,0.98366195,0.00069420243,0.0012088824,0.00012634619,0.00001061356,0.00044439145,0.0017222189],"genre_scores_gemma":[0.988261,0.0000063343714,0.009824309,0.0017502633,0.000067355795,0.0000063710263,0.0000027568622,0.000003845008,0.000077798075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.000086251996,0.00029060652,0.00013656892,0.00024254437,0.00022646529],"domain_scores_gemma":[0.9992757,0.00011329555,0.00009261652,0.00037255845,0.000063342384,0.00008248023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671845,0.00014895607,0.00012502285,0.00022329297,0.00031926457,0.00022090657,0.00045613627,0.0000724523,0.000039972547],"category_scores_gemma":[0.0000067754668,0.00012874677,0.000097605305,0.00031404448,0.00003354623,0.001165421,0.0000016991092,0.00025279174,0.00023861206],"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.000053927197,0.000068117006,1.2878023e-7,0.0000072006465,0.000014335494,0.0000013880834,0.002405861,0.13358842,0.00014835817,0.109618254,0.00024646378,0.75384754],"study_design_scores_gemma":[0.0006758937,0.0004919697,0.00014692174,0.000046079233,0.000010733342,0.00006169025,0.00011746697,0.88093793,0.022046333,0.09148586,0.003578773,0.0004003223],"about_ca_topic_score_codex":0.000003148363,"about_ca_topic_score_gemma":4.333302e-7,"teacher_disagreement_score":0.9761373,"about_ca_system_score_codex":0.000029232622,"about_ca_system_score_gemma":0.00004777836,"threshold_uncertainty_score":0.5250141},"labels":[],"label_agreement":null},{"id":"W1629587143","doi":"10.1109/tit.2016.2516006","title":"Smooth Entropy Bounds on One-Shot Quantum State Redistribution","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":34,"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","funders":"Gordon and Betty Moore Foundation","keywords":"Conditional entropy; Quantum entanglement; Quantum channel; Converse; Upper and lower bounds; Quantum relative entropy; Quantum state; Quantum; Quantum system; Quantum capacity","score_opus":0.016865896130034544,"score_gpt":0.23665311021026608,"score_spread":0.21978721408023155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1629587143","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.006289314,0.000003849681,0.9845499,0.0010195655,0.0010932019,0.0002554508,0.00014331244,0.00053029973,0.0061151334],"genre_scores_gemma":[0.9974428,0.000058941638,0.0006368635,0.0016176935,0.000023117072,0.00006778894,0.000016752858,0.000008159976,0.00012787434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811727,0.00012947105,0.0006283467,0.00018160183,0.00057695754,0.0003663824],"domain_scores_gemma":[0.9985275,0.00020899848,0.00026802628,0.0006338844,0.00019744756,0.00016413971],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065800204,0.00022720233,0.00016491566,0.00060039357,0.00042416615,0.00028743845,0.00052120193,0.00010329193,0.00024729304],"category_scores_gemma":[0.00001865861,0.00017134075,0.00017527466,0.00059660163,0.0001208976,0.0047463337,0.0000034525556,0.00020979367,0.0018075043],"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.00021085571,0.000118827535,0.0000014825288,0.000015886133,0.000032264572,4.490947e-7,0.0010933515,0.00052876864,0.0005125866,0.79797363,0.00086923095,0.19864266],"study_design_scores_gemma":[0.008077908,0.0027237025,0.0012619153,0.00052325556,0.000068944435,0.000045032444,0.00087365275,0.060732313,0.2878895,0.47636113,0.15927579,0.002166856],"about_ca_topic_score_codex":0.000003320847,"about_ca_topic_score_gemma":0.0000011040696,"teacher_disagreement_score":0.9911535,"about_ca_system_score_codex":0.00016446675,"about_ca_system_score_gemma":0.0000903765,"threshold_uncertainty_score":0.9989697},"labels":[],"label_agreement":null},{"id":"W1683834415","doi":"10.1109/tit.2005.864418","title":"A unified framework for tree search decoding: rediscovering the sequential decoder","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":303,"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":"Decoding methods; Algorithm; Intersymbol interference; Computer science; MIMO; Tree (set theory); Search tree; Search algorithm; Tree structure; Mathematics; Theoretical computer science; Binary tree","score_opus":0.017252787965481034,"score_gpt":0.2677141701677557,"score_spread":0.2504613822022747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683834415","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.0026466257,0.000027740241,0.99148387,0.00011276058,0.00033641528,0.00046549767,0.000048990354,0.00078124757,0.004096881],"genre_scores_gemma":[0.9562828,0.00007117074,0.042994674,0.00010677724,0.00005291062,0.0003463009,0.000021915086,0.000028872282,0.00009458957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914277,0.00004799972,0.00036323996,0.00007304517,0.00016000133,0.00021297386],"domain_scores_gemma":[0.9988692,0.00050915714,0.000052828585,0.00046300198,0.00007473938,0.000031105104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035546455,0.00014652764,0.000109407774,0.00018366888,0.00033579796,0.00009433684,0.00030488233,0.00011662784,0.000051408188],"category_scores_gemma":[0.000011056654,0.00012791238,0.00010149904,0.0002253462,0.00007272253,0.0008921325,0.0000020316004,0.00034640208,0.000036081656],"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.00007422284,0.00002039111,5.6276775e-7,0.000047627236,0.000033396132,8.597436e-8,0.0007213442,0.71550983,0.00083877833,0.19237019,0.00026017858,0.090123415],"study_design_scores_gemma":[0.0006741035,0.00006676025,0.000027923023,0.00011193964,0.000043142456,0.000009410008,0.0010280628,0.28591493,0.50781393,0.19407879,0.009766826,0.00046418526],"about_ca_topic_score_codex":0.0000075621692,"about_ca_topic_score_gemma":0.000014063051,"teacher_disagreement_score":0.95363617,"about_ca_system_score_codex":0.00013368527,"about_ca_system_score_gemma":0.000021812642,"threshold_uncertainty_score":0.5216116},"labels":[],"label_agreement":null},{"id":"W1777379964","doi":"10.1109/tit.2013.2281713","title":"Asymptotic Scheduling Gains in Point-to-Multipoint Cognitive Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cognitive Radio Networks and Spectrum Sensing","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 Waterloo","funders":"","keywords":"Scheduling (production processes); Telecommunications link; Channel (broadcasting); Lemma (botany); Cognitive radio; Asymptotic analysis; Interference (communication); Channel allocation schemes","score_opus":0.00981107947640377,"score_gpt":0.22849532604051062,"score_spread":0.21868424656410684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777379964","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.024237655,0.000012279428,0.9708758,0.00041737562,0.00055730436,0.00066071516,0.000003289737,0.0001959071,0.0030397037],"genre_scores_gemma":[0.99074924,0.000018096014,0.006467935,0.0025758292,0.000042777618,0.00008827609,0.0000032470248,0.000010871359,0.000043741806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851996,0.00015354919,0.00047157487,0.00021795229,0.00022456853,0.0004123691],"domain_scores_gemma":[0.9987542,0.0005323658,0.000102235186,0.00025951196,0.000189427,0.00016228513],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051701843,0.0002020265,0.00018851919,0.00054992654,0.00022905553,0.00032150265,0.00025484967,0.00009633899,0.0001105517],"category_scores_gemma":[0.000033343265,0.00020007546,0.00009719842,0.00078034186,0.000045357963,0.0026660247,0.0000053191225,0.0004131288,0.00081629696],"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.00004923266,0.00007611083,0.000011511921,0.0000083936675,0.000030140043,0.000002763436,0.0035888702,0.48067465,0.000034566216,0.009214115,0.00003254617,0.5062771],"study_design_scores_gemma":[0.00080778165,0.0001227269,0.0010972285,0.00021158779,0.00000935315,0.000022061125,0.0010206521,0.9915576,0.0014163769,0.0033830453,0.000034334833,0.00031724718],"about_ca_topic_score_codex":0.00004153887,"about_ca_topic_score_gemma":0.000028546587,"teacher_disagreement_score":0.96651155,"about_ca_system_score_codex":0.0001372123,"about_ca_system_score_gemma":0.000046317553,"threshold_uncertainty_score":0.9999617},"labels":[],"label_agreement":null},{"id":"W1783801419","doi":"10.1109/tit.2016.2516022","title":"Non-Signaling Parallel Repetition Using de Finetti Reductions","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Institut Périmètre de physique théorique; Ministry of Education - Singapore; CHIST-ERA; Ministry of Education, India; European Commission; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; European Research Council; National Science Foundation","keywords":"Repetition (rhetorical device); Context (archaeology); Mathematical proof; Statement (logic); Mathematical economics; Computer science; Zero-knowledge proof; Theoretical computer science; Discrete mathematics; Mathematics; Cryptography; Combinatorics; Algorithm","score_opus":0.015860960667843288,"score_gpt":0.23945487012832672,"score_spread":0.22359390946048344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783801419","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.012609634,0.0000059362533,0.98424083,0.00062672974,0.0010239547,0.00024988016,0.000014580357,0.00037240624,0.0008560287],"genre_scores_gemma":[0.88337857,0.000012881266,0.11590157,0.00035236942,0.000082497,0.000055272252,0.0000018976043,0.000009713167,0.00020522454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855894,0.00013626572,0.0004780079,0.00022900524,0.00028331397,0.00031449302],"domain_scores_gemma":[0.9986651,0.0002700839,0.00016735648,0.0006005284,0.0001820945,0.00011481763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008553325,0.00017667758,0.00014369868,0.00036001788,0.00041464696,0.00015069537,0.00042953066,0.000107500615,0.0001610274],"category_scores_gemma":[0.000024274941,0.00014475132,0.00013791608,0.000442528,0.00009541736,0.0029104142,0.0000057585385,0.00017961547,0.00022869304],"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.000105356354,0.00026015425,0.000012979704,0.000052928863,0.00008283723,0.0000033138858,0.0040644426,0.40970668,0.010849873,0.05118937,0.00029373597,0.5233783],"study_design_scores_gemma":[0.0025811417,0.00043522092,0.000522347,0.00035073844,0.000083192404,0.0004310103,0.0006174866,0.681303,0.13133752,0.17813188,0.0029677672,0.0012386965],"about_ca_topic_score_codex":0.000017175882,"about_ca_topic_score_gemma":0.000001837972,"teacher_disagreement_score":0.87076896,"about_ca_system_score_codex":0.00032119776,"about_ca_system_score_gemma":0.00015410279,"threshold_uncertainty_score":0.59027874},"labels":[],"label_agreement":null},{"id":"W1795009452","doi":"10.1109/tit.2012.2212874","title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multiterminal Settings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":51,"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":"Counterexample; Markov process; Bounded function; Coding (social sciences); Mathematics; Markov chain; Conjecture; Markov property; Mathematical optimization; Algorithm; Discrete mathematics; Computer science; Markov model; Applied mathematics; Statistics","score_opus":0.016446468139906904,"score_gpt":0.22752188461220624,"score_spread":0.21107541647229933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795009452","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.6614615,0.000028030936,0.33746102,0.000020871157,0.00008488962,0.00013127115,0.0000199188,0.00018398526,0.0006085666],"genre_scores_gemma":[0.99680936,0.0000408641,0.0030164947,0.00006255707,0.000006490687,0.00003831041,0.000006149245,0.000011511077,0.000008237021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992665,0.00006585773,0.00034954405,0.000043543347,0.000119389544,0.00015515722],"domain_scores_gemma":[0.9994128,0.00024979428,0.00007099454,0.00018799397,0.00003110756,0.000047322093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044028155,0.000110277084,0.00012521305,0.0002545228,0.000058132577,0.00002708571,0.00010463032,0.000083449544,0.000043497836],"category_scores_gemma":[0.000013653861,0.0001193154,0.000033163586,0.00012315733,0.000056180234,0.0009908393,0.0000019688239,0.0002119298,0.000010876538],"study_design_candidate":"bench_or_experimental","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.0010369243,0.0010686982,0.0006732079,0.0014983625,0.00021083104,0.0000019013912,0.12826754,0.42774796,0.0465596,0.030744627,0.00037298587,0.36181733],"study_design_scores_gemma":[0.0017179188,0.0003138646,0.0039869347,0.0007361666,0.000051763356,0.000028601757,0.003573224,0.17300189,0.81343704,0.00078985037,0.0016060527,0.0007567222],"about_ca_topic_score_codex":0.0000066893,"about_ca_topic_score_gemma":0.0000058492083,"teacher_disagreement_score":0.7668774,"about_ca_system_score_codex":0.000058048943,"about_ca_system_score_gemma":0.0000065778227,"threshold_uncertainty_score":0.4865541},"labels":[],"label_agreement":null},{"id":"W1882168406","doi":"10.1109/tit.2012.2220520","title":"Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convolutional code; Quantum convolutional code; Encoder; Quantum channel; Quantum algorithm; Quantum error correction; Quantum; Turbo code","score_opus":0.009126251279977191,"score_gpt":0.22136197484864575,"score_spread":0.21223572356866857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882168406","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.01594413,0.00003804555,0.9789883,0.00043421134,0.0022638335,0.00017902441,0.000045437664,0.0003397031,0.0017672973],"genre_scores_gemma":[0.9848256,0.0000075261682,0.01392678,0.0009017388,0.00016221618,0.000028858793,0.000011144675,0.000010516366,0.00012560097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842584,0.00013482475,0.00041690507,0.0001679179,0.00037995251,0.00047458633],"domain_scores_gemma":[0.9988576,0.00023474095,0.00016732908,0.00044810708,0.00008431997,0.00020786116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006253736,0.00022198985,0.00016531431,0.00033448954,0.0004590473,0.00013759026,0.00053638814,0.00010252089,0.00008557082],"category_scores_gemma":[0.0000115968505,0.00020406817,0.00014845631,0.00033437915,0.00011733618,0.002123329,0.000007058839,0.00037716137,0.000747945],"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.00026664065,0.00058540003,0.00002611013,0.00008324341,0.00018080248,0.0000029665105,0.016713804,0.19676323,0.0007106328,0.09123698,0.0056140176,0.68781614],"study_design_scores_gemma":[0.0019057255,0.00038623286,0.0014206187,0.000078777615,0.000042657648,0.00023968752,0.0008668165,0.96019834,0.013984984,0.0033012875,0.016614003,0.0009608546],"about_ca_topic_score_codex":0.000013182226,"about_ca_topic_score_gemma":9.355689e-7,"teacher_disagreement_score":0.9688815,"about_ca_system_score_codex":0.000083816,"about_ca_system_score_gemma":0.00011085386,"threshold_uncertainty_score":0.96135694},"labels":[],"label_agreement":null},{"id":"W1901850816","doi":"10.1109/tit.2015.2439269","title":"Decentralized Wireless Networks With Asynchronous Users and Burst Transmissions","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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 Waterloo","funders":"","keywords":"Code word; Transmitter; Decoding methods; Asynchronous communication; Transmission (telecommunications); Channel (broadcasting); Topology (electrical circuits); Computer science; Asymptote; Mathematics; Random variable; Gaussian; Wireless network; Fading; Discrete mathematics; Wireless; Computer network; Algorithm; Combinatorics; Telecommunications; Statistics; Physics","score_opus":0.0188661477728679,"score_gpt":0.2392646256970387,"score_spread":0.2203984779241708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901850816","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.0036043865,0.00011916876,0.99369425,0.00047067992,0.00028161882,0.00022633745,0.000003240512,0.00022298787,0.0013773403],"genre_scores_gemma":[0.9923567,0.0007132884,0.0061045904,0.00068454206,0.000011318602,0.000044402746,0.0000048391594,0.000007585866,0.000072716866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905276,0.00017554419,0.00024932713,0.0001269543,0.00019416232,0.0002012606],"domain_scores_gemma":[0.99891573,0.00014526438,0.00007987862,0.00041749387,0.00021566344,0.00022597988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033952302,0.00014862021,0.00013292678,0.00014781418,0.00036258774,0.0002034929,0.0003616251,0.00006431445,0.000030474801],"category_scores_gemma":[0.0000060521165,0.000121360456,0.000035929377,0.0004056276,0.00009669279,0.001659934,0.000003824518,0.00023626292,0.000028217084],"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.00022205747,0.00009696907,0.000010423668,0.000011202753,0.00006188627,0.0000012563672,0.0074372427,0.18315017,0.000019008687,0.057314854,0.00037710465,0.75129783],"study_design_scores_gemma":[0.00342748,0.00040372042,0.00019082754,0.00015161693,0.000040767707,0.00005878667,0.00094275654,0.9760819,0.001566048,0.00097497186,0.015603195,0.0005579114],"about_ca_topic_score_codex":0.0000038264902,"about_ca_topic_score_gemma":0.000010292778,"teacher_disagreement_score":0.9887523,"about_ca_system_score_codex":0.000069150396,"about_ca_system_score_gemma":0.0001054583,"threshold_uncertainty_score":0.49489358},"labels":[],"label_agreement":null},{"id":"W1939076699","doi":"10.1109/tit.2015.2473863","title":"Multicast Network Coding and Field Sizes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multicast; Linear network coding; Finite field; Bounded function; Multiplicative function; Field size","score_opus":0.03160043652916588,"score_gpt":0.2646613241301877,"score_spread":0.23306088760102184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939076699","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.00069521816,0.00005969593,0.99044955,0.0008703173,0.00044641693,0.00011018552,0.0000011872102,0.00015780822,0.0072096046],"genre_scores_gemma":[0.9886609,0.00019757198,0.008867348,0.002037965,0.000026930491,0.000021843349,0.0000010385088,0.0000031618815,0.0001832719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.00012196493,0.00020625423,0.00008147806,0.0001278745,0.0001348672],"domain_scores_gemma":[0.99904186,0.0003696097,0.000058123507,0.00031747523,0.00011182052,0.00010110844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005530537,0.000087887165,0.0000843293,0.00008856111,0.00027494156,0.00017607147,0.00027288354,0.00004475229,0.000031661188],"category_scores_gemma":[0.000030072417,0.0000818109,0.000028197635,0.0002442957,0.000034396136,0.0014060311,0.0000074697678,0.00016913145,0.00009972611],"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.00005136427,0.00002950278,0.00000734739,0.000007844721,0.000022114786,4.2757887e-7,0.0055980054,0.019302528,0.00002629026,0.26169044,0.0020669962,0.71119714],"study_design_scores_gemma":[0.0024934188,0.0004888945,0.00015862609,0.00017072413,0.000028268963,0.000054940894,0.0014506688,0.9012281,0.009294523,0.021714589,0.062165253,0.0007520299],"about_ca_topic_score_codex":0.0000014428264,"about_ca_topic_score_gemma":0.000004188667,"teacher_disagreement_score":0.98796564,"about_ca_system_score_codex":0.000029621271,"about_ca_system_score_gemma":0.000034438446,"threshold_uncertainty_score":0.33361515},"labels":[],"label_agreement":null},{"id":"W1948599384","doi":"10.1109/tit.2015.2503766","title":"A Model for Adversarial Wiretap Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":34,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Secrecy; Computer science; Eavesdropping; Code word; Code (set theory); Channel (broadcasting); Reliability (semiconductor); Theoretical computer science; Adversarial system; Algorithm; Computer network; Artificial intelligence; Decoding methods; Power (physics); Computer security","score_opus":0.03398889484881486,"score_gpt":0.25062785606382537,"score_spread":0.21663896121501053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948599384","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.0012280447,0.000013496959,0.99273723,0.00006988455,0.0005395771,0.00040075526,0.00008272906,0.0010689447,0.0038593085],"genre_scores_gemma":[0.9914653,0.000025117088,0.0077598854,0.0001911517,0.000025981979,0.0003641177,0.000023174063,0.000019909508,0.00012541741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993441,0.00002676364,0.00028266487,0.00005305597,0.00014921125,0.00014417281],"domain_scores_gemma":[0.9993302,0.0000833992,0.000041640753,0.0003259907,0.00013442725,0.00008429138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039400262,0.00012265715,0.00011398977,0.00021157094,0.00008761765,0.00004926259,0.00020901016,0.000110783694,0.00001875849],"category_scores_gemma":[0.000010704877,0.00013366576,0.0000778053,0.00012127171,0.00003464943,0.001172352,9.79198e-7,0.00016445236,0.00009379282],"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.00009902097,0.000021410917,5.068094e-8,0.000031250464,0.000029314098,2.7829127e-8,0.0070569613,0.9535851,0.00006301639,0.013219247,0.0019960976,0.023898544],"study_design_scores_gemma":[0.00058239745,0.000037577498,2.0476794e-7,0.000015099111,0.000014215685,0.0000018070009,0.00030856888,0.9670967,0.0133520905,0.014500748,0.003936109,0.00015448425],"about_ca_topic_score_codex":0.0000023229807,"about_ca_topic_score_gemma":0.0000026270657,"teacher_disagreement_score":0.9902372,"about_ca_system_score_codex":0.000119881304,"about_ca_system_score_gemma":0.000040043196,"threshold_uncertainty_score":0.54507315},"labels":[],"label_agreement":null},{"id":"W1965602624","doi":"10.1109/tit.2004.836700","title":"Comments on \"Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Code division multiple access; Maximization; Channel capacity; Gaussian; Mathematics; Algorithm; Upper and lower bounds; Equivalence (formal languages); Channel (broadcasting); Computer science; Discrete mathematics; Topology (electrical circuits); Applied mathematics; Telecommunications; Combinatorics; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.025068937577472403,"score_gpt":0.2389123595092152,"score_spread":0.21384342193174277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965602624","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.011976729,0.000022687062,0.9854391,0.000075417265,0.00026089136,0.00065956695,0.00008658754,0.0003764677,0.0011025062],"genre_scores_gemma":[0.99129957,0.00010135494,0.008148411,0.00015951085,0.000012332634,0.00024056093,0.000011641899,0.000020649864,0.000005954301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991196,0.00006225177,0.0004060081,0.0000780464,0.00016103538,0.00017309835],"domain_scores_gemma":[0.9991519,0.0003097644,0.00009398943,0.00030327548,0.00007215639,0.00006893394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431314,0.00017259177,0.00019041478,0.0005190091,0.00016717512,0.0000446097,0.00018838466,0.00012548988,0.000025723923],"category_scores_gemma":[0.000009300541,0.00018180071,0.0000712698,0.00022818633,0.00007632287,0.00063424715,0.000001411754,0.00022806956,0.000027120941],"study_design_candidate":"bench_or_experimental","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.0003299302,0.0003504115,0.0000010719148,0.00046884178,0.00022870017,2.873013e-7,0.014763978,0.73330593,0.0016888105,0.06339474,0.00025369722,0.18521358],"study_design_scores_gemma":[0.002903217,0.0010000755,0.000053137628,0.00038705944,0.00008337839,0.000009827971,0.0009269557,0.06505155,0.8908643,0.036484852,0.0015342851,0.00070132565],"about_ca_topic_score_codex":0.000007846809,"about_ca_topic_score_gemma":0.0000018933342,"teacher_disagreement_score":0.97932285,"about_ca_system_score_codex":0.00016468427,"about_ca_system_score_gemma":0.000022844019,"threshold_uncertainty_score":0.7413618},"labels":[],"label_agreement":null},{"id":"W1966109782","doi":"10.1109/tit.2008.2008140","title":"On the Existence of $(10, 2, 7, 488)$ Resilient Functions","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Heuristic; Algebraic number; Degree (music); Computer science; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.011092172589970398,"score_gpt":0.2137632879363156,"score_spread":0.20267111534634522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966109782","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.00665994,0.0000065987333,0.96188694,0.00077336794,0.000402176,0.00017007781,0.000012121319,0.00015463319,0.029934155],"genre_scores_gemma":[0.9973334,0.0000067256897,0.000644822,0.0014356406,0.000009475106,0.000023367014,0.0000011694825,0.0000024885073,0.0005429158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898523,0.00014899773,0.000311964,0.000115728486,0.00028445965,0.00015361619],"domain_scores_gemma":[0.998587,0.00047677563,0.00013194047,0.0006512742,0.00010418086,0.000048821697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069248787,0.000120345605,0.00009690512,0.00028755222,0.0003797126,0.00007659646,0.0005327879,0.00005045429,0.00028809623],"category_scores_gemma":[0.000021667793,0.000086073924,0.00014827217,0.0006309907,0.000093287636,0.0008986886,0.0000016915942,0.00019503724,0.00035575702],"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.00012419146,0.00009912072,1.3749509e-7,0.000004332893,0.000013792608,1.6569457e-7,0.0012526734,0.0063427435,0.00009092017,0.88936317,0.0007172237,0.1019915],"study_design_scores_gemma":[0.0009951453,0.0022090217,0.00043952873,0.00017552308,0.000050633313,0.000025080612,0.0014930905,0.014619461,0.0551224,0.9131428,0.01117205,0.0005552791],"about_ca_topic_score_codex":0.0000011575161,"about_ca_topic_score_gemma":5.370253e-7,"teacher_disagreement_score":0.9906735,"about_ca_system_score_codex":0.000025343346,"about_ca_system_score_gemma":0.00003421971,"threshold_uncertainty_score":0.45726553},"labels":[],"label_agreement":null},{"id":"W1966991522","doi":"10.1109/tit.2015.2393351","title":"Corrections to “On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes” [Sep 14 5188-5203]","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"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":"Characterization (materials science); Computer science; Property (philosophy); Low-density parity-check code; Variable (mathematics); Algorithm; Discrete mathematics; Theoretical computer science; Mathematics; Decoding methods; Physics","score_opus":0.016401537047910378,"score_gpt":0.24703862467599147,"score_spread":0.2306370876280811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966991522","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.03579692,0.000002041721,0.9596658,0.00016030144,0.0013808055,0.00051227893,0.00007865167,0.00040524598,0.001997978],"genre_scores_gemma":[0.97617775,0.0000069216003,0.022853909,0.00068610796,0.000017229793,0.00010176512,0.000030181183,0.000014166829,0.000111960486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982021,0.0001885891,0.00073039543,0.00018934402,0.00047681024,0.00021277578],"domain_scores_gemma":[0.9982532,0.00017217417,0.0003815448,0.00060294097,0.00046265335,0.00012747027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011418513,0.00019324108,0.000249147,0.00080155453,0.00014805964,0.000050169376,0.000492903,0.000109156856,0.00004260586],"category_scores_gemma":[0.000043417465,0.00020480732,0.000093750416,0.0010267524,0.000050336905,0.0017153772,0.0000072174357,0.00022072849,0.000046112054],"study_design_candidate":"bench_or_experimental","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.0011650561,0.0013241777,0.0000731687,0.00037704324,0.0003642682,0.0000018691035,0.052168608,0.1593409,0.104034215,0.09394222,0.0021590851,0.5850494],"study_design_scores_gemma":[0.0011572771,0.001522308,0.00029182478,0.00046844984,0.00006993638,0.000023599961,0.00141444,0.06977164,0.9150197,0.006553375,0.0031076432,0.0005997972],"about_ca_topic_score_codex":0.00004116955,"about_ca_topic_score_gemma":0.0000055714427,"teacher_disagreement_score":0.9403808,"about_ca_system_score_codex":0.0001595672,"about_ca_system_score_gemma":0.00014666689,"threshold_uncertainty_score":0.83518},"labels":[],"label_agreement":null},{"id":"W1970170950","doi":"10.1109/tit.2011.2177578","title":"Gaussian Z-Interference Channel With a Relay Link: Achievability Region and Asymptotic Sum Capacity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"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":"Interference (communication); Topology (electrical circuits); Relay; Channel capacity; Channel (broadcasting); Noise (video); Signal-to-noise ratio (imaging); Zero-forcing precoding; Additive white Gaussian noise; Co-channel interference; Telecommunications; Mathematics; Computer science; Physics; MIMO; Power (physics); Precoding; Combinatorics; Quantum mechanics","score_opus":0.029001916694381076,"score_gpt":0.23412684801960956,"score_spread":0.2051249313252285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970170950","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.014827738,0.00003189131,0.9808666,0.0008552436,0.00023661267,0.00015758071,0.000002297314,0.0001424506,0.0028796003],"genre_scores_gemma":[0.9970367,0.00011852145,0.0021868977,0.00052510446,0.00001952783,0.00004220007,0.0000015824013,0.000004445033,0.00006502555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911636,0.00021198287,0.00022534725,0.00011068598,0.00013431905,0.00020129047],"domain_scores_gemma":[0.9989896,0.00017650895,0.00010006269,0.00052129425,0.000091827504,0.000120746736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005850263,0.00012568917,0.00009927377,0.00013576457,0.0003844564,0.000120305296,0.00029362683,0.00008470978,0.000022480739],"category_scores_gemma":[0.000013172313,0.0001049684,0.00003510056,0.0002738499,0.00011498186,0.002678937,0.000007279495,0.00038196496,0.00005288552],"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.00029891092,0.00028787288,0.00017766427,0.000093448936,0.00009570522,5.5041846e-7,0.04082789,0.0059727174,0.00009672879,0.45339578,0.00014294457,0.49860978],"study_design_scores_gemma":[0.008723534,0.0036724373,0.037977174,0.0018226658,0.00028660602,0.0011419919,0.005489018,0.83215666,0.0632252,0.02188963,0.018854821,0.0047602486],"about_ca_topic_score_codex":0.000003126196,"about_ca_topic_score_gemma":0.000010197641,"teacher_disagreement_score":0.98220897,"about_ca_system_score_codex":0.000052967145,"about_ca_system_score_gemma":0.000029900755,"threshold_uncertainty_score":0.4280487},"labels":[],"label_agreement":null},{"id":"W1973378877","doi":"10.1109/tit.2012.2196021","title":"A Construction of Codebooks Associated With Binary Sequences","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Codebook; Combinatorics; Hamming space; Binary code; Binary number; Sequence (biology); Hadamard matrix; Hadamard transform; Matrix (chemical analysis); Hamming distance; Hamming code; Matrix norm; Discrete mathematics; Hamming weight; Algorithm; Block code; Eigenvalues and eigenvectors; Arithmetic; Mathematical analysis; Physics; Decoding methods","score_opus":0.006846413880487452,"score_gpt":0.17949388306727582,"score_spread":0.17264746918678836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973378877","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.45796594,0.000031420717,0.52448475,0.0000046092196,0.00084021786,0.00019697037,0.000067629575,0.00032478877,0.016083637],"genre_scores_gemma":[0.9997005,0.00000767394,0.0001589739,0.000020568466,0.000010529507,0.000036702546,0.00000732006,0.000008729204,0.000049033242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993519,0.0000721159,0.00025801157,0.000032618238,0.00013642559,0.00014891622],"domain_scores_gemma":[0.9996142,0.00008919575,0.00007844741,0.00011534398,0.000050412233,0.000052411076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036145814,0.00010548604,0.00011961378,0.00019461622,0.00008556931,0.000012297503,0.00005887276,0.00008192514,0.00010362764],"category_scores_gemma":[0.0000033627396,0.00008972211,0.000049359536,0.00018525339,0.00013465293,0.000968176,1.9574256e-7,0.00012932763,0.00004366739],"study_design_candidate":"bench_or_experimental","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.0010288367,0.00036971274,0.0004912323,0.0007993967,0.0016120933,0.0000014802218,0.038248427,0.4329114,0.009177589,0.40211868,0.0002567381,0.112984404],"study_design_scores_gemma":[0.005754864,0.0014458788,0.002914514,0.0016644407,0.0006867041,0.00034161803,0.03852637,0.038359843,0.8716018,0.032868143,0.0033719572,0.0024638316],"about_ca_topic_score_codex":0.0000023002206,"about_ca_topic_score_gemma":0.0000015512961,"teacher_disagreement_score":0.86242425,"about_ca_system_score_codex":0.000040745625,"about_ca_system_score_gemma":0.000012406463,"threshold_uncertainty_score":0.36587614},"labels":[],"label_agreement":null},{"id":"W1974493046","doi":"10.1109/tit.2013.2276612","title":"Memoryless Multiple Access Channel With Asymmetric Noisy State Information at the Encoders","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Encoder; Channel state information; Computer science; Decoding methods; Converse; Algorithm; Generalization; Channel (broadcasting); Mathematics; Wireless; Telecommunications","score_opus":0.008651747412178994,"score_gpt":0.20909631869095172,"score_spread":0.20044457127877272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974493046","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.032800153,0.00002096228,0.9564612,0.00022371717,0.00023022144,0.0009859105,0.000076678465,0.0010105595,0.008190591],"genre_scores_gemma":[0.9978779,0.00018266887,0.0004033344,0.00056520145,0.000007744436,0.00079500553,0.000051536434,0.000022607592,0.00009401276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873555,0.00008718811,0.0004982411,0.00007241701,0.0003518417,0.00025478494],"domain_scores_gemma":[0.9985483,0.00032879363,0.00015299855,0.0006499831,0.0002378571,0.00008206775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000371769,0.00022706848,0.0001540686,0.0005796494,0.000389172,0.00033791398,0.0005749234,0.00009934482,0.0002164497],"category_scores_gemma":[0.000013704044,0.00017115446,0.00006790979,0.00071558636,0.00011489633,0.0073572984,0.000007681264,0.00038708557,0.00093249953],"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.00011384953,0.00005116308,0.000012691197,0.00015903756,0.00013596853,1.448796e-7,0.01131955,0.75295526,0.00008715163,0.00060478,0.0031845856,0.23137584],"study_design_scores_gemma":[0.002965997,0.00024097486,0.0017313353,0.00019876596,0.000095477146,0.000048815153,0.0065430435,0.6657092,0.29429346,0.00397607,0.022640087,0.0015567888],"about_ca_topic_score_codex":0.00010071694,"about_ca_topic_score_gemma":0.00007349628,"teacher_disagreement_score":0.96507776,"about_ca_system_score_codex":0.00022836892,"about_ca_system_score_gemma":0.000026592646,"threshold_uncertainty_score":0.9998454},"labels":[],"label_agreement":null},{"id":"W1975650268","doi":"10.1109/tit.2013.2246815","title":"Degenerate Viterbi Decoding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Compute Canada","keywords":"Convolutional code; Sequential decoding; Algorithm; Soft output Viterbi algorithm; Decoding methods; List decoding; Computer science; Iterative Viterbi decoding; Viterbi decoder; Viterbi algorithm; Mathematics; Block code; Theoretical computer science; Concatenated error correction code","score_opus":0.006319225856570922,"score_gpt":0.2022957069418615,"score_spread":0.1959764810852906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975650268","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.02349885,0.0000069084617,0.9731034,0.00036658527,0.00080790545,0.00015098747,0.000003348086,0.00033209033,0.0017299276],"genre_scores_gemma":[0.9612114,0.0000052738365,0.036916513,0.0015827954,0.000035909237,0.000041569583,0.0000015045434,0.00000588434,0.0001991419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00007044876,0.00025820168,0.00011991664,0.00017463263,0.00021295022],"domain_scores_gemma":[0.99930966,0.00012016634,0.000078769976,0.00032571587,0.00008066569,0.000085031716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024941796,0.00012612049,0.000090249414,0.00022908169,0.00031634938,0.00034451907,0.0003879234,0.00005208058,0.00013176913],"category_scores_gemma":[0.0000041695694,0.0001073732,0.000074156866,0.00028466913,0.00002737761,0.0018173819,0.0000031769246,0.00019854643,0.0012464059],"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.0000043556024,0.000023725306,6.361198e-7,0.0000096798085,0.0000148094605,4.1769746e-7,0.0015901382,0.10275204,0.0002809836,0.018143242,0.0002797462,0.8769002],"study_design_scores_gemma":[0.00025948556,0.000065657136,0.000050430965,0.000022898566,0.0000037799443,0.000025897654,0.000063076244,0.96252096,0.021987706,0.013491788,0.0013049683,0.00020337169],"about_ca_topic_score_codex":0.000009684975,"about_ca_topic_score_gemma":5.336554e-7,"teacher_disagreement_score":0.93771255,"about_ca_system_score_codex":0.000028007953,"about_ca_system_score_gemma":0.000027914315,"threshold_uncertainty_score":0.9995312},"labels":[],"label_agreement":null},{"id":"W1978595443","doi":"10.1109/tit.2014.2346780","title":"On Optimal Zero-Delay Coding of Vector Markov Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Bounded function; Markov chain; Quantization (signal processing); Vector quantization; Encoder; Markov decision process; Rate–distortion theory; Convex optimization; Markov model","score_opus":0.006195900892584226,"score_gpt":0.20909800651598354,"score_spread":0.2029021056233993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978595443","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.043467827,0.000008533309,0.94114786,0.000026209296,0.000180929,0.00014429241,0.000028040207,0.0006223044,0.014374012],"genre_scores_gemma":[0.99697804,0.000047581183,0.0027067473,0.0001448831,0.000009030827,0.0000498712,0.000008200839,0.000018135248,0.00003750562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991704,0.00008240985,0.00037505696,0.000056690365,0.00018599053,0.00012941645],"domain_scores_gemma":[0.9990278,0.00036221818,0.000084187384,0.00041688056,0.00006412503,0.00004477713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042295552,0.00013473092,0.00014892578,0.0003075415,0.000103861115,0.000033153738,0.00024332052,0.000100672696,0.00015643916],"category_scores_gemma":[0.000014931498,0.00013995264,0.00008062487,0.00016166434,0.000060541322,0.00056561566,0.0000014051938,0.00026275718,0.00011072228],"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.00020823548,0.00011511608,0.0000017378951,0.0002870632,0.00012265364,1.807631e-7,0.007649827,0.66093886,0.002822375,0.20236766,0.0012298285,0.12425646],"study_design_scores_gemma":[0.0010124223,0.00036706126,0.00006860128,0.00035622303,0.00005180488,0.000012363439,0.00061053975,0.33502167,0.6410065,0.009581911,0.011257116,0.0006537382],"about_ca_topic_score_codex":0.00000321568,"about_ca_topic_score_gemma":9.051189e-7,"teacher_disagreement_score":0.9535102,"about_ca_system_score_codex":0.000057613674,"about_ca_system_score_gemma":0.000008556409,"threshold_uncertainty_score":0.5707103},"labels":[],"label_agreement":null},{"id":"W1979450817","doi":"10.1109/tit.2013.2292135","title":"Streaming Universal Distortion-Free Entanglement Concentration","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":9,"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","funders":"","keywords":"Quantum entanglement; Qubit; Block (permutation group theory); Randomness; Upper and lower bounds; Mathematics; Discrete mathematics; Combinatorics; Quantum; Quantum mechanics; Physics; Statistics","score_opus":0.004739884841509299,"score_gpt":0.19242931462790566,"score_spread":0.18768942978639636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979450817","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.002844874,0.000002641177,0.9790174,0.00026919955,0.0008103622,0.00017924621,0.000017682876,0.00032185455,0.016536767],"genre_scores_gemma":[0.9954645,0.000011066905,0.003261446,0.0011242635,0.000020202453,0.000026816075,0.000017818451,0.000004189099,0.00006972219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988267,0.00009893364,0.0004041627,0.00010949015,0.00036509894,0.00019560927],"domain_scores_gemma":[0.998988,0.00010749852,0.00018253259,0.00051107496,0.00011180121,0.0000990992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043212992,0.00013886868,0.00009741903,0.00024631122,0.00034244193,0.0001971297,0.00048506778,0.00006082218,0.00016923826],"category_scores_gemma":[0.000011622607,0.00013648701,0.00010198081,0.00036188183,0.000054369142,0.0040299166,0.0000035255373,0.00013926564,0.00030797045],"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.000032567008,0.00005746384,0.000006517277,0.000016410091,0.000024783725,1.505282e-7,0.0032647336,0.00623564,0.00004260494,0.74320537,0.0006010894,0.24651268],"study_design_scores_gemma":[0.0076802163,0.0011664933,0.0011299131,0.0001554079,0.00009906891,0.000037581012,0.00548389,0.67900467,0.07443544,0.10222292,0.12687589,0.0017084993],"about_ca_topic_score_codex":0.00000609033,"about_ca_topic_score_gemma":0.0000035066066,"teacher_disagreement_score":0.9926196,"about_ca_system_score_codex":0.00010541276,"about_ca_system_score_gemma":0.000041277868,"threshold_uncertainty_score":0.55657786},"labels":[],"label_agreement":null},{"id":"W1981987481","doi":"10.1109/tit.2014.2314467","title":"On the Efficiency of Classical and Quantum Secure Function Evaluation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Oblivious transfer; Randomness; Upper and lower bounds; Quantum; Protocol (science); Quantum cryptography; One-way function; String (physics); Cryptography; Cryptographic protocol","score_opus":0.008945676533139066,"score_gpt":0.21625444062237856,"score_spread":0.20730876408923948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981987481","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.03159828,0.000005443431,0.9602851,0.0005922286,0.0005175276,0.00027968214,0.000004954779,0.000096381904,0.006620369],"genre_scores_gemma":[0.99837345,0.000007399582,0.00020206715,0.0013384845,0.00001027288,0.000050152332,0.000003018743,0.0000032205232,0.000011918549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857163,0.00026102902,0.00038934755,0.00010236429,0.0005429288,0.00013267103],"domain_scores_gemma":[0.99866325,0.0005055059,0.00020294588,0.00037897826,0.00019669379,0.00005265255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178714,0.00012254357,0.000103299084,0.00032780005,0.00030481225,0.00010844942,0.0002587286,0.0000771852,0.00010433189],"category_scores_gemma":[0.000049501854,0.0000846103,0.00008371694,0.0004635514,0.0001119483,0.001357258,0.0000023336763,0.00020308593,0.00013049174],"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.000053141404,0.000041317682,5.6467417e-7,0.000014770819,0.000011483646,7.491523e-9,0.0013896561,0.004042675,0.000037939055,0.90477437,0.00022962432,0.089404464],"study_design_scores_gemma":[0.0006669837,0.000514337,0.00020704744,0.0000367246,0.000026556148,0.000004160941,0.00048739702,0.8470179,0.004541218,0.14451942,0.0018262937,0.00015195743],"about_ca_topic_score_codex":0.0000013227783,"about_ca_topic_score_gemma":6.904598e-7,"teacher_disagreement_score":0.9667752,"about_ca_system_score_codex":0.000023656185,"about_ca_system_score_gemma":0.00004031003,"threshold_uncertainty_score":0.34503078},"labels":[],"label_agreement":null},{"id":"W1982067419","doi":"10.1109/tit.2013.2241818","title":"On the Optimal Compressions in the Compress-and-Forward Relay Schemes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":76,"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":"Decodes; Decoding methods; Relay; Computer science; Joint (building); Relay channel; Data compression; Compression (physics); Sequential decoding; Process (computing); Algorithm; List decoding; Theoretical computer science; Block code; Engineering","score_opus":0.019785315122957614,"score_gpt":0.24703301184276796,"score_spread":0.22724769671981035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982067419","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.016837696,0.000039204315,0.9699339,0.0059243655,0.0001575325,0.0004306882,0.0000029618982,0.000081184364,0.0065924567],"genre_scores_gemma":[0.9938194,0.00012662681,0.0012400735,0.004464582,0.0000071904105,0.00022075762,0.0000016570413,0.0000033455744,0.00011633703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887073,0.00041275378,0.00026677086,0.00009419117,0.00020815882,0.000147424],"domain_scores_gemma":[0.99789417,0.0012742672,0.00007559741,0.0006430409,0.0000752135,0.00003771315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006520568,0.00011529047,0.00008691514,0.00013507369,0.0006427827,0.00031053342,0.0008532505,0.000044730125,0.00020064614],"category_scores_gemma":[0.00002156837,0.000064662796,0.000048386675,0.0003357227,0.0001060614,0.001229047,0.000011246545,0.00043946007,0.00030266558],"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.000019046889,0.000084375526,0.0000024126373,0.0000048390366,0.000018243893,1.7274311e-7,0.009516767,0.031259697,0.0000519676,0.7979029,0.0026463964,0.1584932],"study_design_scores_gemma":[0.0012348221,0.0002251512,0.0014027676,0.00021195332,0.000015917727,0.000024369843,0.00364857,0.9347857,0.0044293073,0.018297672,0.035222728,0.0005010325],"about_ca_topic_score_codex":0.0000045256656,"about_ca_topic_score_gemma":0.0000031659401,"teacher_disagreement_score":0.97698176,"about_ca_system_score_codex":0.000023538065,"about_ca_system_score_gemma":0.000020802056,"threshold_uncertainty_score":0.494383},"labels":[],"label_agreement":null},{"id":"W1983388978","doi":"10.1109/tit.2006.872862","title":"On the existence of (9,3,5,240) resilient functions","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Boolean function; Degree (music); Heuristic; Mathematics; Algebraic number; Variable (mathematics); Discrete mathematics; Algebra over a field; Computer science; Theoretical computer science; Mathematical optimization; Pure mathematics","score_opus":0.008200829568955056,"score_gpt":0.19622747674530677,"score_spread":0.1880266471763517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983388978","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.015733402,0.0000061493097,0.95370674,0.00035948533,0.00052587857,0.0001640315,0.000017583005,0.00014708456,0.029339662],"genre_scores_gemma":[0.9983284,0.000003466083,0.00066671026,0.000527827,0.000013410261,0.00004801546,0.0000017476181,0.0000035787423,0.00040686596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.00014815996,0.00032898656,0.000111123634,0.00028053264,0.00014987375],"domain_scores_gemma":[0.9985405,0.0006029251,0.00013648665,0.00059476844,0.000094307885,0.000031016443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064607104,0.000114980015,0.00008927487,0.00028199627,0.00038738814,0.000075967895,0.00047220674,0.0000480885,0.00014127874],"category_scores_gemma":[0.000011521509,0.000082868944,0.00014482511,0.00060762407,0.00012920768,0.0007796539,0.0000024634135,0.00018346818,0.000245737],"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.00006577033,0.00008580014,8.8870945e-7,0.0000073206493,0.000010552827,1.461072e-7,0.0005470951,0.015322316,0.00009413072,0.96448094,0.00063617795,0.018748878],"study_design_scores_gemma":[0.0007541334,0.0006568444,0.0005045262,0.00011972758,0.00004009278,0.000019505524,0.0010509636,0.012147779,0.055711027,0.9196813,0.008877927,0.00043613176],"about_ca_topic_score_codex":0.0000097429975,"about_ca_topic_score_gemma":0.0000033935569,"teacher_disagreement_score":0.98259497,"about_ca_system_score_codex":0.000026737993,"about_ca_system_score_gemma":0.00003090225,"threshold_uncertainty_score":0.33792976},"labels":[],"label_agreement":null},{"id":"W1984673910","doi":"10.1109/tit.2014.2300867","title":"On the PMEPR of Binary Golay Sequences of Length $2^{n}$","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":22,"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":"Binary Golay code; Complementary sequences; Binary number; Mathematics; Combinatorics; Algorithm; Computer science; Discrete mathematics; Arithmetic","score_opus":0.007006034859616386,"score_gpt":0.1979122461078506,"score_spread":0.1909062112482342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984673910","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.3363239,0.000019842457,0.63234735,0.00011905531,0.0012252721,0.00021949285,0.00005232463,0.00021947616,0.029473307],"genre_scores_gemma":[0.9995531,0.00003647067,0.00017248136,0.00007578488,0.00001571455,0.0000312671,0.0000020848568,0.00000959641,0.00010351306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999184,0.00007167398,0.0003741342,0.000049061196,0.00021761932,0.00010349808],"domain_scores_gemma":[0.99899733,0.0005223072,0.00009786642,0.0002871219,0.0000671414,0.000028236924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005158339,0.00010814665,0.00012217411,0.00020815553,0.00007816411,0.0000106011985,0.00017245449,0.00007333907,0.0003345227],"category_scores_gemma":[0.000023008291,0.00008196169,0.00008380617,0.00019733995,0.00012082583,0.00043622247,5.528563e-7,0.00020715427,0.00016111905],"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.000059650527,0.000036865993,8.985995e-7,0.000120478835,0.000059939124,4.0879932e-8,0.0019231733,0.8981736,0.009114007,0.07103121,0.00051454955,0.018965635],"study_design_scores_gemma":[0.00053944334,0.00034346367,0.00012810674,0.00018471075,0.000049135455,0.000009991037,0.0020627666,0.044110358,0.9325045,0.016156586,0.0036155798,0.00029541127],"about_ca_topic_score_codex":0.0000037341251,"about_ca_topic_score_gemma":6.0449537e-7,"teacher_disagreement_score":0.92339045,"about_ca_system_score_codex":0.000036762412,"about_ca_system_score_gemma":0.00001679773,"threshold_uncertainty_score":0.36627886},"labels":[],"label_agreement":null},{"id":"W1986161523","doi":"10.1109/tit.2007.909092","title":"Joint Source–Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":19,"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":"Exponent; Channel (broadcasting); Ergodic theory; Upper and lower bounds; Source code; Discrete mathematics; Coding (social sciences); Algorithm; Markov process; Computer science; Mathematics; Statistics; Pure mathematics; Telecommunications; Mathematical analysis","score_opus":0.015357756195373173,"score_gpt":0.23069056212629213,"score_spread":0.21533280593091897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161523","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.005635049,0.00007552306,0.9878343,0.00009116829,0.00024311157,0.0009872514,0.00005904524,0.0011662804,0.0039083185],"genre_scores_gemma":[0.99421966,0.00010253401,0.0048349574,0.00010434793,0.000018810426,0.00048321145,0.0000647532,0.000045032146,0.00012670753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868035,0.00008719429,0.0006259188,0.000094465504,0.00024135396,0.00027071565],"domain_scores_gemma":[0.9984835,0.00032359708,0.00016023978,0.0007753712,0.00016056122,0.00009672794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013206503,0.00021878378,0.00021110075,0.00044562828,0.0003672485,0.00010679071,0.00032535894,0.00014064161,0.000022686165],"category_scores_gemma":[0.00000862407,0.0002123909,0.000095106785,0.0002209999,0.000089352325,0.0011040672,0.0000030681852,0.0003421066,0.000032815704],"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.0007360777,0.00013172359,0.0000016694777,0.0007414545,0.00030117296,5.6864377e-7,0.02183907,0.8831595,0.0013399121,0.019786296,0.0010585646,0.070904],"study_design_scores_gemma":[0.00316525,0.000423278,0.00011253499,0.0012377828,0.00017843691,0.000070227194,0.032572303,0.76013124,0.18161832,0.0018878527,0.016988577,0.0016141662],"about_ca_topic_score_codex":0.00002300801,"about_ca_topic_score_gemma":0.000024705212,"teacher_disagreement_score":0.9885846,"about_ca_system_score_codex":0.00024226966,"about_ca_system_score_gemma":0.000018656578,"threshold_uncertainty_score":0.86610496},"labels":[],"label_agreement":null},{"id":"W1986529826","doi":"10.1109/tit.2012.2184737","title":"Generalized Framework for the Level Crossing Analysis of Ordered Random Processes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Victoria University of Wellington; University of Victoria; University of Canterbury","keywords":"Zero (linguistics); Computer science; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Philosophy","score_opus":0.05743754988560776,"score_gpt":0.3142494260931213,"score_spread":0.25681187620751356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986529826","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.0014532218,0.00027555035,0.9971106,0.00030599456,0.00031354028,0.00028237383,0.000024385896,0.00006622472,0.00016809856],"genre_scores_gemma":[0.96333927,0.00023406389,0.035606317,0.0005875818,0.000018791585,0.00013221402,0.0000058841542,0.0000038529993,0.00007200742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991369,0.00012614898,0.0003556229,0.00006496036,0.00015705377,0.0001592632],"domain_scores_gemma":[0.99719125,0.0017683279,0.00019198889,0.00048820255,0.00031966117,0.000040566818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009354064,0.00009699449,0.00016707082,0.00026145298,0.0007430745,0.00019690875,0.0004955949,0.000052269537,0.00007063723],"category_scores_gemma":[0.00009997117,0.00006889997,0.00014523254,0.0014393092,0.00008883983,0.001440322,0.0000041193757,0.00012234508,0.00000880386],"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.0002826844,0.00013977945,0.000018556084,0.000055706234,0.00091224536,1.1577191e-8,0.027546111,0.1315737,0.00012584381,0.39907357,0.0001127116,0.44015908],"study_design_scores_gemma":[0.004149906,0.000123779,0.0013398008,0.00015298737,0.0013180649,0.000004457164,0.0017781028,0.89872724,0.054488033,0.016070876,0.021105744,0.00074102334],"about_ca_topic_score_codex":0.000002582569,"about_ca_topic_score_gemma":0.000008672197,"teacher_disagreement_score":0.96188605,"about_ca_system_score_codex":0.000026095171,"about_ca_system_score_gemma":0.000080300524,"threshold_uncertainty_score":0.5715203},"labels":[],"label_agreement":null},{"id":"W1986982576","doi":"10.1109/tit.2015.2409833","title":"Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology","keywords":"Finite field; Binary number; Computer science; Multiplication (music); Algorithm; Reduction (mathematics); NIST; Gaussian; Computational complexity theory; Arithmetic; Multiplier (economics); Mathematics; Discrete mathematics","score_opus":0.03180169573059666,"score_gpt":0.269284744914897,"score_spread":0.23748304918430035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986982576","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.008528838,0.000014349603,0.9886974,0.00040716087,0.00074458774,0.00048264614,0.000047043926,0.00016128265,0.0009166579],"genre_scores_gemma":[0.9397324,0.000012577263,0.05997755,0.000059611986,0.000030834737,0.000117262185,0.000020032558,0.000006771259,0.00004300342],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987906,0.0001197331,0.00044337907,0.00015666652,0.00030266558,0.00018695064],"domain_scores_gemma":[0.9987657,0.00012396663,0.00025473008,0.00047380436,0.00025836605,0.00012343275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007147261,0.00014256599,0.00016497419,0.00043603516,0.00024983787,0.000069689326,0.00035029973,0.000109907036,0.000012553818],"category_scores_gemma":[0.000013292489,0.0001291358,0.00014983998,0.0004915448,0.00012492748,0.0020554226,0.000003918948,0.0001480401,0.000025826013],"study_design_candidate":"design_other","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.00084127643,0.000628236,0.000025006064,0.00019064508,0.00010726378,3.2218526e-7,0.014751826,0.038177844,0.0032411353,0.19191007,0.000875299,0.74925107],"study_design_scores_gemma":[0.0038241737,0.0008605817,0.0010784238,0.00014497912,0.000079312296,0.00005492113,0.0025861056,0.2561253,0.6398231,0.09159135,0.0032006293,0.0006311274],"about_ca_topic_score_codex":0.000044606706,"about_ca_topic_score_gemma":0.000004842065,"teacher_disagreement_score":0.93120354,"about_ca_system_score_codex":0.000058484922,"about_ca_system_score_gemma":0.00006513063,"threshold_uncertainty_score":0.52660054},"labels":[],"label_agreement":null},{"id":"W1989168989","doi":"10.1109/tit.2015.2389248","title":"On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"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":"Division of Mathematical Sciences","keywords":"Code (set theory); Computer science; Algorithm; Programming language; Set (abstract data type)","score_opus":0.023123655678070294,"score_gpt":0.2397847676655345,"score_spread":0.2166611119874642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989168989","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.055800624,0.000005852461,0.92891943,0.00037206252,0.00030027548,0.00017360937,0.000008737623,0.00008931887,0.014330109],"genre_scores_gemma":[0.9968975,0.000005608248,0.002326719,0.00067906216,0.000007783426,0.000027658567,9.291501e-7,0.0000036041783,0.000051101448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988129,0.00025209814,0.000359218,0.0001077221,0.0003108043,0.00015724613],"domain_scores_gemma":[0.99829704,0.00093733385,0.000116615134,0.0004557706,0.0001279799,0.000065262466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261319,0.000118783006,0.0001273842,0.0002909133,0.00010208453,0.00006020433,0.0005728168,0.0000667238,0.00003277972],"category_scores_gemma":[0.00006365939,0.00008650854,0.00008965381,0.00058553385,0.00013637952,0.0008324778,0.000003613271,0.00022795452,0.000113042785],"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.00015895898,0.00012317533,0.0000069066705,0.000012723613,0.00001569997,4.7383654e-7,0.003225666,0.008451516,0.000051325813,0.96999466,0.000044608038,0.01791428],"study_design_scores_gemma":[0.0023059093,0.0015976651,0.0006436408,0.00030353354,0.000036255835,0.000021692837,0.0038538065,0.06617176,0.06571693,0.85676545,0.001961492,0.00062188774],"about_ca_topic_score_codex":0.0000051277852,"about_ca_topic_score_gemma":0.00000477926,"teacher_disagreement_score":0.9410969,"about_ca_system_score_codex":0.00003292096,"about_ca_system_score_gemma":0.000083818166,"threshold_uncertainty_score":0.35277158},"labels":[],"label_agreement":null},{"id":"W1991523744","doi":"10.1109/tit.2013.2253596","title":"Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Permutation (music); Decoding methods; Reduction (mathematics); Integer (computer science); Combinatorics; Algorithm; Estimator; Discrete mathematics; Point (geometry); Computer science; Statistics","score_opus":0.013602895048858223,"score_gpt":0.21152660373707408,"score_spread":0.19792370868821585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991523744","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.777263,0.000020874346,0.21705723,0.0009925904,0.00026078825,0.0017750997,0.000023606786,0.00011623931,0.0024905936],"genre_scores_gemma":[0.99935794,0.000048715752,0.0003288642,0.000071412884,0.000004826472,0.00016745491,6.026532e-7,0.000009075906,0.000011087335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989823,0.00027972547,0.00039435943,0.00005698862,0.00019778348,0.00008883306],"domain_scores_gemma":[0.9981609,0.0007491886,0.00023046767,0.00072842377,0.000115784715,0.000015250832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004698046,0.00011998228,0.00013119183,0.000047560796,0.00022502444,0.000016253842,0.00040100445,0.00005971332,0.000060124556],"category_scores_gemma":[0.00005826516,0.00005878809,0.00009481165,0.00023803832,0.00052086095,0.00040448434,0.0000072197513,0.00033007405,0.000004043775],"study_design_candidate":"bench_or_experimental","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.00022535362,0.0003592795,0.00004423657,0.0014141625,0.00021048354,1.6259381e-8,0.012143304,0.29050562,0.042057253,0.5424113,0.00042243337,0.11020656],"study_design_scores_gemma":[0.0001508191,0.000049441347,0.0021170639,0.00024321236,0.000018567234,0.000001484443,0.0006898279,0.008192741,0.93906975,0.04935646,0.00003362704,0.00007697968],"about_ca_topic_score_codex":0.000030088795,"about_ca_topic_score_gemma":0.00000803026,"teacher_disagreement_score":0.89701253,"about_ca_system_score_codex":0.00006499389,"about_ca_system_score_gemma":0.000014177219,"threshold_uncertainty_score":0.23973088},"labels":[],"label_agreement":null},{"id":"W1991621115","doi":"10.1109/tit.2011.2178155","title":"On the Application of Character Expansions for MIMO Capacity Analysis","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":54,"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 Alberta","funders":"","keywords":"Wishart distribution; Mathematics; Eigenvalues and eigenvectors; Random matrix; Unitary matrix; MIMO; Matrix (chemical analysis); Applied mathematics; Unitary state; Beamforming; Statistics","score_opus":0.010646952174405843,"score_gpt":0.21844858086931804,"score_spread":0.2078016286949122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991621115","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.012627883,0.000006005224,0.9852727,0.000025282121,0.00030575827,0.00054793106,0.00014941367,0.00013382093,0.00093120406],"genre_scores_gemma":[0.9975652,0.000007756262,0.0017663265,0.00009785574,0.000025415418,0.00045497777,0.00003569571,0.00001266179,0.00003409327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993079,0.000038236976,0.00034532542,0.00005102081,0.00011051765,0.00014700776],"domain_scores_gemma":[0.9990949,0.00036138846,0.000109845336,0.00029928886,0.00009227034,0.000042311814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037772185,0.00011319986,0.00013816127,0.0002902003,0.00013125679,0.000011851208,0.000089704685,0.00007474279,0.000063279855],"category_scores_gemma":[0.0000147666115,0.0000892841,0.00013560872,0.0004259245,0.000030329002,0.00081382645,3.2960565e-7,0.000108144886,0.00006767054],"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.000035872254,0.000039189625,0.000004560105,0.00004495027,0.00018145493,1.9751922e-9,0.0018284745,0.95398444,0.0009962451,0.03479765,0.000058801463,0.008028383],"study_design_scores_gemma":[0.00081322266,0.00009548134,0.00042476194,0.00005323023,0.0007206101,0.0000024829458,0.0016078975,0.80112904,0.18718511,0.0036223012,0.0038197339,0.00052610424],"about_ca_topic_score_codex":0.000003030628,"about_ca_topic_score_gemma":0.0000026408813,"teacher_disagreement_score":0.9849373,"about_ca_system_score_codex":0.00006782562,"about_ca_system_score_gemma":0.0000052481782,"threshold_uncertainty_score":0.36409},"labels":[],"label_agreement":null},{"id":"W1991718925","doi":"10.1109/tlt.2010.2059639","title":"Diversity Analysis and Design of Space–Time Multiblock Codes for MIMO Systems Equipped With Linear MMSE Receivers","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","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":"McMaster University","funders":"","keywords":"Fading; Minimum mean square error; Space–time block code; Block code; Diversity gain; Coding gain; MIMO; Algorithm; Computer science; Mathematics; Antenna diversity; Transmitter; Control theory (sociology); Channel (broadcasting); Decoding methods; Telecommunications; Statistics; Antenna (radio)","score_opus":0.009257133544990352,"score_gpt":0.2186271558121074,"score_spread":0.20937002226711704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991718925","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.029408738,0.000008753149,0.96948373,0.00000901106,0.00006737987,0.00046864513,0.000102111466,0.00031377436,0.00013785274],"genre_scores_gemma":[0.9511287,0.000078798425,0.048646,0.0000079450665,0.000004297934,0.00006571778,0.0000125223005,0.000010512898,0.00004547955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944735,0.00004155192,0.00023027475,0.000064307635,0.00011259814,0.00010394588],"domain_scores_gemma":[0.9990528,0.00034492672,0.00010232299,0.00030528137,0.00014734663,0.00004729007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031290593,0.000118436226,0.00019351703,0.00042802515,0.00027034467,0.00001541496,0.00014511384,0.00009098395,0.000018328848],"category_scores_gemma":[0.000009610269,0.00011259527,0.0000558437,0.00033584633,0.000093306924,0.00065197144,0.0000033039732,0.00017076019,0.0000052044966],"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.00021775419,0.00002276746,0.00001879451,0.00009458271,0.00033125715,5.8607853e-8,0.0016308901,0.9861128,0.0058637685,0.0005267906,0.000017644243,0.0051629483],"study_design_scores_gemma":[0.00065616047,0.00012079828,0.000058076126,0.000036665024,0.00030687638,0.0000022371446,0.0005428388,0.85835856,0.13929652,0.00019535184,0.00020515446,0.00022078614],"about_ca_topic_score_codex":0.000019488707,"about_ca_topic_score_gemma":0.000010650467,"teacher_disagreement_score":0.92171997,"about_ca_system_score_codex":0.000031433177,"about_ca_system_score_gemma":0.000010578826,"threshold_uncertainty_score":0.45915017},"labels":[],"label_agreement":null},{"id":"W1993724447","doi":"10.1109/tit.2013.2253892","title":"Secure and Efficient LCMQ Entity Authentication Protocol","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"RFID technology advancements","field":"Engineering","cited_by":16,"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; Cisco Systems (Canada)","funders":"","keywords":"Computer science; Authentication protocol; Theoretical computer science; Cryptographic protocol; Authentication (law); Probabilistic logic; Encryption; Cryptography; Protocol (science); Computer network; Algorithm; Computer security; Artificial intelligence","score_opus":0.003073460873445224,"score_gpt":0.20131425477226436,"score_spread":0.19824079389881913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993724447","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.036613993,0.0000020995496,0.94716805,0.00004494294,0.00021513371,0.013323149,0.000011527824,0.00055523944,0.0020658392],"genre_scores_gemma":[0.9660284,0.0000028528514,0.0007827085,0.000059293314,0.0000051479046,0.03302612,0.0000034932752,0.000009314403,0.000082655686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994607,0.000017183449,0.0002218103,0.000062609186,0.00010804306,0.00012967952],"domain_scores_gemma":[0.9996616,0.000026812564,0.000038158105,0.00018676188,0.00004792015,0.000038706174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000110961395,0.00010286023,0.00006777061,0.00019129014,0.000109543114,0.00004365119,0.00007703692,0.000087760105,0.00039928447],"category_scores_gemma":[0.0000042868214,0.00010078827,0.000023282491,0.00013563347,0.00005447982,0.0007631392,8.4735944e-7,0.00016785387,0.000805436],"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.00008629635,0.00025120395,0.00003121482,0.00063864276,0.00018258936,4.0103563e-7,0.004639888,0.45996496,0.0062945024,0.035220157,0.0009579233,0.4917322],"study_design_scores_gemma":[0.003908606,0.00024565795,0.0025459356,0.0001688468,0.000078303594,0.000030067838,0.0014803682,0.66764903,0.27054244,0.031252097,0.021063749,0.0010349066],"about_ca_topic_score_codex":0.000001827489,"about_ca_topic_score_gemma":6.229431e-7,"teacher_disagreement_score":0.9463854,"about_ca_system_score_codex":0.00005797678,"about_ca_system_score_gemma":0.00000583877,"threshold_uncertainty_score":0.9999726},"labels":[],"label_agreement":null},{"id":"W1995769095","doi":"10.1109/tit.2012.2191663","title":"On the Optimum Diversity–Multiplexing Tradeoff of the Two-User Gaussian Interference Channel With Rayleigh Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"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":"Rayleigh fading; Fading; Channel state information; Multiplexing; Computer science; Gaussian; Algorithm; Diversity gain; Code rate; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Mathematics; Telecommunications; Decoding methods; Wireless; Physics; Engineering","score_opus":0.029814992904834463,"score_gpt":0.23582685325856598,"score_spread":0.2060118603537315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995769095","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.009477829,0.000013542004,0.9834822,0.0008757563,0.00040072645,0.000255696,0.000005646082,0.00006824705,0.005420393],"genre_scores_gemma":[0.9982827,0.000026527452,0.0006201061,0.0008929406,0.000014236168,0.000025818817,7.772926e-7,0.0000046728146,0.00013224935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897784,0.00026271062,0.00023390405,0.00008373405,0.00024268847,0.00019914193],"domain_scores_gemma":[0.9985749,0.00047886078,0.00016576714,0.0006406291,0.00008571085,0.000054128413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606781,0.00013400054,0.00010205864,0.00012929244,0.0010046468,0.000082792,0.0010147652,0.00003594962,0.00007173346],"category_scores_gemma":[0.0000144087435,0.00007541991,0.000076969176,0.00046240198,0.000120108765,0.0015907093,0.00003206726,0.0003309167,0.00003552519],"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.000158541,0.0001669011,0.000049956216,0.000018325105,0.00009291456,1.0973573e-7,0.054565124,0.10115011,0.00024062874,0.8002798,0.00022921005,0.043048363],"study_design_scores_gemma":[0.007101017,0.001144133,0.0055176406,0.0022047246,0.00019330173,0.00008848045,0.01656172,0.69614583,0.24795288,0.014738612,0.006039671,0.0023120134],"about_ca_topic_score_codex":0.000003693958,"about_ca_topic_score_gemma":0.000006490167,"teacher_disagreement_score":0.9888048,"about_ca_system_score_codex":0.000061163744,"about_ca_system_score_gemma":0.000027265263,"threshold_uncertainty_score":0.77270323},"labels":[],"label_agreement":null},{"id":"W1999760780","doi":"10.1109/tit.2003.813484","title":"Near-ellipsoidal voronoi coding","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Voronoi diagram; Lambda; Combinatorics; Mathematics; Lattice (music); Ellipsoid; Discrete mathematics; Algorithm; Geometry; Physics; Quantum mechanics","score_opus":0.01112130308934732,"score_gpt":0.24285952335488822,"score_spread":0.23173822026554092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999760780","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.00026184152,0.0000088345605,0.9893354,0.000067657485,0.00055754546,0.00018512405,0.000014500744,0.000710863,0.008858203],"genre_scores_gemma":[0.845234,0.000029688554,0.1534063,0.000889783,0.000008910831,0.00007735781,0.00000398799,0.000009649362,0.00034030923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989057,0.00013603721,0.000336554,0.00015264541,0.0002534632,0.00021558486],"domain_scores_gemma":[0.99889356,0.00018027368,0.00012187775,0.0006351965,0.00008086216,0.00008822953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046751468,0.00014652722,0.00011337504,0.00018459086,0.00039416002,0.00021493569,0.00050173426,0.000074997544,0.00019271481],"category_scores_gemma":[0.000021516329,0.0001390906,0.0000689863,0.00031701272,0.000063584244,0.004268361,0.0000032153819,0.00024442555,0.0005493793],"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.000027621252,0.000073120806,0.0000010737799,0.000019053972,0.000016672751,0.0000011156222,0.0011795565,0.0320725,0.00034155278,0.63020134,0.0010289383,0.33503744],"study_design_scores_gemma":[0.0012381553,0.00027036332,0.000023994578,0.00011285104,0.000019029207,0.000091069815,0.00038909804,0.13424996,0.54384744,0.11335535,0.20545395,0.0009487254],"about_ca_topic_score_codex":0.0000019636657,"about_ca_topic_score_gemma":4.483513e-7,"teacher_disagreement_score":0.84497213,"about_ca_system_score_codex":0.000069496426,"about_ca_system_score_gemma":0.00006651738,"threshold_uncertainty_score":0.70613426},"labels":[],"label_agreement":null},{"id":"W1999977780","doi":"10.1109/tit.2015.2421520","title":"Energy Consumption of VLSI Decoders","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":25,"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":"Energy consumption; Very-large-scale integration; Computer science; Decoding methods; Energy (signal processing); Electronic engineering; Embedded system; Algorithm; Electrical engineering; Mathematics; Engineering; Statistics","score_opus":0.02388982087331856,"score_gpt":0.2543369816320384,"score_spread":0.23044716075871982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999977780","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.0021091779,0.000011749059,0.9910022,0.00006607933,0.0006916285,0.0000810618,0.00000466282,0.00050088234,0.005532538],"genre_scores_gemma":[0.98030233,0.000017610399,0.019179052,0.0003609304,0.000006600463,0.000029223873,0.000001864522,0.0000050408585,0.00009732231],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990755,0.00010377812,0.00033430068,0.00009380314,0.00026533386,0.00012731798],"domain_scores_gemma":[0.9990231,0.00014112548,0.00017117076,0.00038771582,0.00019858766,0.00007831841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919027,0.00010164337,0.00010789613,0.0003545204,0.00007113262,0.000045416746,0.00036499245,0.00007518352,0.00002739917],"category_scores_gemma":[0.000016137177,0.00010160041,0.000064300955,0.00025759853,0.000057503443,0.0018434667,0.0000026710497,0.000113626564,0.00009700097],"study_design_candidate":"design_other","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.00012626527,0.00012632231,0.000016374168,0.00004129493,0.00004423891,7.5171704e-7,0.0078797,0.015510899,0.00037322435,0.18926522,0.001555987,0.7850597],"study_design_scores_gemma":[0.0016504079,0.0007152202,0.000075522374,0.00014730412,0.000041802956,0.0000859917,0.0011493186,0.21669851,0.6836352,0.0873555,0.007720919,0.00072433625],"about_ca_topic_score_codex":0.000026505417,"about_ca_topic_score_gemma":0.00000736938,"teacher_disagreement_score":0.97819316,"about_ca_system_score_codex":0.000079100886,"about_ca_system_score_gemma":0.000083454994,"threshold_uncertainty_score":0.41431445},"labels":[],"label_agreement":null},{"id":"W2004756728","doi":"10.1109/tit.2014.2313577","title":"Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"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":"Ministry of Education - Singapore","keywords":"Quantum convolutional code; Discrete mathematics; Mathematics; Quantum algorithm; Block code; Quantum; Combinatorics; Upper and lower bounds; Physics; Quantum mechanics; Quantum error correction; Algorithm; Decoding methods","score_opus":0.007184576919945558,"score_gpt":0.2138843273454455,"score_spread":0.20669975042549993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004756728","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.022586767,0.0000129731725,0.9713809,0.0030357428,0.0012750532,0.00024818323,0.00002976176,0.00044090033,0.0009897358],"genre_scores_gemma":[0.9945222,0.000011439983,0.001144581,0.0040494916,0.000062650724,0.000035033565,0.000013219038,0.000013375262,0.0001480149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804837,0.00042751047,0.0004912455,0.00022980456,0.00039881034,0.00040427077],"domain_scores_gemma":[0.99789846,0.00091046636,0.00021463484,0.0007337529,0.0001372177,0.00010547092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013302321,0.0002589934,0.00021294276,0.00024444578,0.00096604123,0.00045441225,0.00096266385,0.000108136956,0.000033684817],"category_scores_gemma":[0.000042333177,0.00017894339,0.00014906227,0.00054453727,0.00019381593,0.0007155567,0.0000088488905,0.0004997947,0.00017091818],"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.00006834033,0.00010872432,0.0000028833326,0.00004558343,0.00010495964,0.0000018168445,0.009362338,0.2620611,0.00013975606,0.5164032,0.0012360095,0.21046531],"study_design_scores_gemma":[0.0004707479,0.00016675508,0.00008430823,0.000036064655,0.000015528345,0.000041606458,0.00021403779,0.94500005,0.0025409302,0.037941,0.013211875,0.0002770717],"about_ca_topic_score_codex":0.000093600436,"about_ca_topic_score_gemma":0.000018853245,"teacher_disagreement_score":0.97193545,"about_ca_system_score_codex":0.00006211414,"about_ca_system_score_gemma":0.0000810606,"threshold_uncertainty_score":0.7430106},"labels":[],"label_agreement":null},{"id":"W2005713623","doi":"10.1109/tit.2013.2284914","title":"A Unified Relay Framework With Both D-F and C-F Relay Nodes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"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":"Relay; Relay channel; Decoding methods; Node (physics); Upstream (networking); Computer science; Computer network; Link Access Procedure for Frame Relay; Downstream (manufacturing); Topology (electrical circuits); Cover (algebra); Mathematics; Telecommunications; Combinatorics; Engineering; Physics; Power (physics)","score_opus":0.011658895052271386,"score_gpt":0.22406793583766005,"score_spread":0.21240904078538866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005713623","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.0066006146,0.000045774086,0.9870042,0.00091895385,0.00014395609,0.0002452814,0.0000016943178,0.00021896769,0.004820566],"genre_scores_gemma":[0.9609341,0.0002861046,0.036697224,0.0015715306,0.000008853499,0.0000963869,0.0000015397834,0.000006429694,0.0003978203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918085,0.0001410621,0.00023963326,0.00012024246,0.00016335958,0.00015486097],"domain_scores_gemma":[0.9988016,0.00034210715,0.00009093185,0.00054979563,0.00012972833,0.000085847576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053004,0.00013001429,0.00010537779,0.00017609973,0.00041850348,0.00030291927,0.000360261,0.00007501783,0.00017080517],"category_scores_gemma":[0.000011972908,0.00010318125,0.000030173029,0.00039672302,0.000086123386,0.0025042882,0.0000058206506,0.00033031488,0.0002677626],"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.000058524132,0.00006885247,0.000015640258,0.000019321616,0.000056100966,4.6296998e-7,0.009656335,0.016005058,0.00009409226,0.5277018,0.00039945022,0.44592434],"study_design_scores_gemma":[0.005870376,0.0015755128,0.0070263147,0.0012641446,0.000115169496,0.00023185642,0.005156796,0.8370654,0.01612034,0.08136109,0.041223552,0.0029894428],"about_ca_topic_score_codex":0.00000466563,"about_ca_topic_score_gemma":0.0000033870201,"teacher_disagreement_score":0.9543335,"about_ca_system_score_codex":0.000034848897,"about_ca_system_score_gemma":0.000039342147,"threshold_uncertainty_score":0.42076093},"labels":[],"label_agreement":null},{"id":"W2006267017","doi":"10.1109/tit.2013.2295606","title":"On Online Energy Harvesting in Multiple Access Communication Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":55,"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":"Mathematical optimization; Computer science; Iterative method; Throughput; Energy (signal processing); Energy harvesting; Nonlinear system; Transmission (telecommunications); Mathematics; Wireless","score_opus":0.01312744350372611,"score_gpt":0.21584399428691872,"score_spread":0.20271655078319262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006267017","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.037826084,0.0000259436,0.9499604,0.000017475504,0.0007293241,0.000112397924,0.000021100042,0.0005788954,0.010728352],"genre_scores_gemma":[0.99877405,0.00006741275,0.00055550167,0.00020569525,0.00003848173,0.00010570669,0.000055222466,0.000030392706,0.00016750666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988034,0.00019542115,0.00051385025,0.00009277408,0.00017864467,0.0002159401],"domain_scores_gemma":[0.9982845,0.0010574627,0.000099430894,0.00044144594,0.00005515257,0.000061968305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048153687,0.00018257136,0.00016993092,0.00038891786,0.0001556261,0.00015009828,0.00033176356,0.00014173027,0.000018032206],"category_scores_gemma":[0.000052478765,0.00019431923,0.0000447747,0.00034136756,0.000042812426,0.0013231135,0.0000021740184,0.00038023968,0.000040725652],"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.000022255335,0.000029438452,0.000008046734,0.0000368295,0.000011979017,1.2193738e-7,0.00016303694,0.9154321,0.000021380323,0.022442015,0.00005169125,0.061781123],"study_design_scores_gemma":[0.0005095055,0.000030995896,0.0001815704,0.00032370666,0.0000067367164,0.0000032553505,0.00007878344,0.9943258,0.0012822276,0.00075592846,0.0022902843,0.00021117307],"about_ca_topic_score_codex":0.000190438,"about_ca_topic_score_gemma":0.00026306507,"teacher_disagreement_score":0.960948,"about_ca_system_score_codex":0.0001443839,"about_ca_system_score_gemma":0.000011337938,"threshold_uncertainty_score":0.79241085},"labels":[],"label_agreement":null},{"id":"W2006333615","doi":"10.1109/tit.2014.2369496","title":"The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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":"Air Force Office of Scientific Research; Wisconsin Alumni Research Foundation","keywords":"Secrecy; Emulation; Decoding methods; Key generation; Key (lock); Information-theoretic security; Channel (broadcasting); Coding (social sciences); Communication source; Information theory","score_opus":0.012116739990175047,"score_gpt":0.21277152135165342,"score_spread":0.20065478136147838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006333615","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.047051456,0.000016322836,0.9432176,0.0002157492,0.00017300519,0.00032826167,0.000033925724,0.0007087708,0.008254925],"genre_scores_gemma":[0.9972731,0.00035483442,0.0018855412,0.00023021616,0.000010372993,0.00014881499,0.000013474229,0.000018842173,0.000064841726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883294,0.00016675456,0.00043701316,0.00009512984,0.00026634726,0.00020180547],"domain_scores_gemma":[0.99871093,0.0003342385,0.00007106568,0.0006948992,0.00010469533,0.00008416811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009984141,0.00018074455,0.00013426649,0.0001631289,0.00040209354,0.00013200783,0.00029612143,0.00012006302,0.000030330328],"category_scores_gemma":[0.000020579713,0.00015581862,0.000061704115,0.00015482641,0.00013176947,0.0008650162,0.000005399261,0.00037238488,0.00005900358],"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.000097424505,0.0000843575,0.000008406981,0.00020557259,0.00011322687,7.366966e-8,0.011709221,0.7291693,0.0007136004,0.11648643,0.00085175637,0.14056061],"study_design_scores_gemma":[0.00036645148,0.000042657313,0.000042649663,0.00003935297,0.000018409299,0.000004712722,0.00038259474,0.93495893,0.012759352,0.043457273,0.0076848017,0.00024279256],"about_ca_topic_score_codex":0.000011908642,"about_ca_topic_score_gemma":0.000017527602,"teacher_disagreement_score":0.9502216,"about_ca_system_score_codex":0.00010745693,"about_ca_system_score_gemma":0.000011525105,"threshold_uncertainty_score":0.6354099},"labels":[],"label_agreement":null},{"id":"W2006624419","doi":"10.1109/18.923736","title":"Renyi's divergence and entropy rates for finite alphabet Markov sources","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":57,"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":"Mathematics; Rényi entropy; Combinatorics; Markov chain; Alphabet; Discrete mathematics; Entropy (arrow of time); Coding theory; Divergence (linguistics); Entropy rate; Statistics; Binary entropy function; Physics; Principle of maximum entropy; Quantum mechanics","score_opus":0.009192276345957163,"score_gpt":0.2380018457705932,"score_spread":0.22880956942463604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006624419","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.03114807,0.00010180569,0.966429,0.00010025858,0.00016511754,0.00028950826,0.00007208103,0.00060153456,0.0010926108],"genre_scores_gemma":[0.9942922,0.0015033096,0.003665615,0.00016842887,0.000013556558,0.00020143352,0.000020916159,0.000014280684,0.00012024085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993854,0.000037551497,0.00027143882,0.000062546795,0.000098677265,0.00014436294],"domain_scores_gemma":[0.9992448,0.00033976798,0.000049272265,0.0002498618,0.000065831846,0.00005043807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319564,0.00012511088,0.00010751145,0.00019609765,0.00019050397,0.00006860011,0.00016207052,0.00007888984,0.0001397189],"category_scores_gemma":[0.000012352509,0.00013043275,0.00005080931,0.00014424404,0.000059697948,0.0009002766,0.0000016528699,0.00014283264,0.000040181152],"study_design_candidate":"design_other","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.0007496865,0.00018844087,0.00024399937,0.00055777276,0.000376406,0.0000010493645,0.020998223,0.1428192,0.0033883855,0.044413522,0.0050917435,0.78117156],"study_design_scores_gemma":[0.0023846342,0.00034432157,0.00072259223,0.00024546587,0.00013084571,0.00003518569,0.0026993451,0.4590104,0.27575684,0.0369606,0.220373,0.0013367728],"about_ca_topic_score_codex":0.0000039998004,"about_ca_topic_score_gemma":0.0000038867406,"teacher_disagreement_score":0.9631441,"about_ca_system_score_codex":0.000034831126,"about_ca_system_score_gemma":0.000007451739,"threshold_uncertainty_score":0.53188926},"labels":[],"label_agreement":null},{"id":"W2008209264","doi":"10.1109/tit.2012.2205663","title":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":105,"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; Algorithm; Tanner graph; Decoding methods; Computer science; Degree (music); Code (set theory); Graph; Set (abstract data type); Factor graph; Belief propagation; Error floor; Mathematics; Theoretical computer science","score_opus":0.018091293421843995,"score_gpt":0.2731903225689815,"score_spread":0.2550990291471375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008209264","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.0058310083,0.000016068885,0.9917361,0.00003573298,0.0010201588,0.00041820251,0.000029026265,0.00026948654,0.0006442311],"genre_scores_gemma":[0.85717815,0.0000036805866,0.14256607,0.000093014125,0.000014607575,0.000106557534,0.000001933239,0.000006882285,0.000029093871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891406,0.000072000825,0.00041759593,0.000098544486,0.00022095485,0.00027683424],"domain_scores_gemma":[0.9988031,0.0004658248,0.00022371237,0.0003153601,0.0001257467,0.000066264336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013567992,0.0001331474,0.0001592313,0.00038893466,0.00022947523,0.000043252607,0.00033309244,0.00007841006,0.000011310161],"category_scores_gemma":[0.000020657213,0.00012570573,0.0001286447,0.000313176,0.000044147124,0.0009297507,0.00000307585,0.00013874071,0.000021994223],"study_design_candidate":"design_other","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.00003204385,0.00015098393,0.000002573501,0.00007346152,0.000033729375,9.2441304e-8,0.012390353,0.012414215,0.0010744972,0.016392892,0.00009670442,0.95733845],"study_design_scores_gemma":[0.00045455917,0.00014569463,0.00004350014,0.00011651623,0.000023422359,0.00002038434,0.0007151364,0.56457376,0.43161958,0.0015550056,0.00048671366,0.00024573394],"about_ca_topic_score_codex":0.0000046190808,"about_ca_topic_score_gemma":5.0019156e-7,"teacher_disagreement_score":0.9570927,"about_ca_system_score_codex":0.000082150036,"about_ca_system_score_gemma":0.000039311097,"threshold_uncertainty_score":0.51261306},"labels":[],"label_agreement":null},{"id":"W2008249050","doi":"10.1109/tit.2014.2373382","title":"Randomized Quantization and Source Coding With Constrained Output Distribution","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quantization (signal processing); Vector quantization; Rate–distortion theory; Probability distribution; Distortion (music); Joint probability distribution; Mathematical optimization; Applied mathematics; Algorithm; Data compression; Control theory (sociology); Computer science; Statistics; Artificial intelligence","score_opus":0.007630340906766237,"score_gpt":0.2248557356607354,"score_spread":0.21722539475396918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008249050","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.00057717384,0.0000038750286,0.9974612,0.00015782789,0.00011927666,0.00037338244,0.00002485897,0.00058221724,0.0007001977],"genre_scores_gemma":[0.9710292,0.000024915586,0.028431455,0.0003209849,0.000008363627,0.000075569,0.000038032493,0.000005846141,0.00006560357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988968,0.00025358313,0.0003353856,0.00014989304,0.0002212921,0.00014305976],"domain_scores_gemma":[0.99871945,0.0005582801,0.00020471703,0.00033112968,0.000118326505,0.00006808888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009115414,0.00014257434,0.0002081146,0.00016102492,0.0002857236,0.00016835837,0.00021448024,0.0000625519,0.000010493091],"category_scores_gemma":[0.000057464687,0.00011145158,0.000042137,0.00021677233,0.00017977567,0.002525432,0.0000040505543,0.00014808676,0.000020935033],"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.003342039,0.00003361927,0.0000010155566,0.000033070934,0.000027341115,1.7596435e-7,0.0008941306,0.010823334,0.00009348346,0.5641147,0.00008903404,0.42054805],"study_design_scores_gemma":[0.046184678,0.00023492082,0.0000176303,0.0002043489,0.000049904265,0.000059400452,0.00024069937,0.8697579,0.04431192,0.0317928,0.0066094296,0.0005363566],"about_ca_topic_score_codex":0.0000032769242,"about_ca_topic_score_gemma":5.277357e-7,"teacher_disagreement_score":0.9704521,"about_ca_system_score_codex":0.00003151078,"about_ca_system_score_gemma":0.000023129853,"threshold_uncertainty_score":0.45448634},"labels":[],"label_agreement":null},{"id":"W2011377472","doi":"10.1109/tit.2012.2236604","title":"Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"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":"Decoding methods; Encoder; Computer science; Binary number; Low-density parity-check code; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Arithmetic","score_opus":0.019698386856273575,"score_gpt":0.2729342356956928,"score_spread":0.25323584883941924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011377472","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.06692533,0.000003874558,0.92957413,0.00009859677,0.00037099805,0.00023345277,0.0000053371205,0.0005446426,0.002243656],"genre_scores_gemma":[0.9751244,0.000003681928,0.0242828,0.000486968,0.00000998009,0.000058484824,0.0000028812942,0.000009615189,0.000021189579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.00013087784,0.00024509552,0.00013736454,0.00024334269,0.00022354636],"domain_scores_gemma":[0.9987201,0.00064197346,0.00016382616,0.00030946036,0.000078483645,0.00008613495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067368406,0.00016889522,0.00012812021,0.0005480564,0.00031044526,0.00014626775,0.00020759481,0.00007169754,0.000023227689],"category_scores_gemma":[0.00002180004,0.00014814171,0.00004112129,0.00033839987,0.000043369233,0.0048662373,0.0000035813005,0.000271915,0.000047102953],"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.0016918964,0.00092227897,0.0011522071,0.00030949194,0.00021379444,0.000014566442,0.040560417,0.2460835,0.0023949451,0.07263098,0.00030904938,0.6337169],"study_design_scores_gemma":[0.0012889383,0.0017817151,0.00309881,0.00065815606,0.000060370436,0.00029072378,0.0013582308,0.89567983,0.09241299,0.0019819862,0.0004647588,0.00092348014],"about_ca_topic_score_codex":0.000007726798,"about_ca_topic_score_gemma":0.0000020431212,"teacher_disagreement_score":0.9081991,"about_ca_system_score_codex":0.00014207694,"about_ca_system_score_gemma":0.00003267742,"threshold_uncertainty_score":0.60410434},"labels":[],"label_agreement":null},{"id":"W2011984612","doi":"10.1109/tit.2014.2321143","title":"Information Transmission Using the Nonlinear Fourier Transform, Part I: Mathematical Tools","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":231,"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":"Killam Trusts; University of Toronto; Sharif University of Technology; Technische Universität München; Canada Council for the Arts","keywords":"Nonlinear system; Fourier transform; Split-step method; Dispersion (optics); Integrable system; Transmission (telecommunications); Fourier analysis; Fourier series; Multiplexing","score_opus":0.010035034534015958,"score_gpt":0.22572649239786471,"score_spread":0.21569145786384875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011984612","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.0047587645,0.0000024169426,0.98191464,0.00036260145,0.0002769779,0.00046396995,0.00008845848,0.00008008325,0.012052082],"genre_scores_gemma":[0.99600935,0.000004550534,0.0028324218,0.0005676176,0.00018504761,0.00008118304,0.0001114895,0.00001471416,0.00019364171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862707,0.00012494951,0.00061096024,0.00007340994,0.00032708107,0.00023653128],"domain_scores_gemma":[0.9991044,0.00024039278,0.00016294263,0.00027940262,0.00012626697,0.00008659388],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006459296,0.00020055684,0.00018095545,0.00013562114,0.0005316735,0.00022846174,0.00016678832,0.00008213599,0.0014730463],"category_scores_gemma":[0.0000071022446,0.00014113841,0.00018365766,0.00021181081,0.000070765695,0.0031012297,9.3044883e-7,0.00026211518,0.00034793548],"study_design_candidate":"design_other","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.000112342896,0.00006741681,0.0000023408827,0.000037030728,0.00005467736,2.015179e-8,0.0033038196,0.037885886,0.000055960856,0.042404886,0.00008548414,0.9159901],"study_design_scores_gemma":[0.0021599082,0.00012148686,0.000013170256,0.00010845238,0.00016411609,0.0000062163344,0.0024450906,0.8397717,0.012237054,0.03555793,0.10697402,0.00044083767],"about_ca_topic_score_codex":0.00000837357,"about_ca_topic_score_gemma":3.9207416e-7,"teacher_disagreement_score":0.9912506,"about_ca_system_score_codex":0.000041239146,"about_ca_system_score_gemma":0.000060803388,"threshold_uncertainty_score":0.9994397},"labels":[],"label_agreement":null},{"id":"W2012861794","doi":"10.1109/tit.2014.2360388","title":"Analytic Expressions and Bounds for Special Functions and Applications in Communication Theory","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Fading; Rician fading; Computer science; Channel (broadcasting); Wireless; Mathematics; Algorithm; Applied mathematics; Telecommunications","score_opus":0.006164776468829031,"score_gpt":0.22597116268477516,"score_spread":0.21980638621594611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012861794","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.0024830317,0.0000791155,0.98845285,0.000050983195,0.00007943276,0.00056653545,0.000055118737,0.0003449694,0.007887937],"genre_scores_gemma":[0.9935422,0.000457911,0.004614491,0.00008017643,0.00003992219,0.0010719988,0.00004401343,0.000020807549,0.00012850181],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992085,0.00010423313,0.00035712827,0.00009501452,0.000097263626,0.00013785232],"domain_scores_gemma":[0.9984744,0.00082838535,0.00006678824,0.00048932695,0.0000805554,0.000060510614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006245429,0.00014364159,0.00014709613,0.00038291523,0.00036609865,0.00006166503,0.00015909418,0.00010137399,0.00003221337],"category_scores_gemma":[0.000029981695,0.00015031901,0.00003944673,0.00022427792,0.00014378285,0.0008745368,0.0000036969107,0.00024001446,0.000010560954],"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.0001103185,0.00009081693,0.000018190853,0.00015259568,0.0000512185,1.7053802e-8,0.002910992,0.063763395,0.00048501563,0.38080457,0.00040485588,0.551208],"study_design_scores_gemma":[0.0033450604,0.00025466428,0.0013079682,0.00035949127,0.00019047782,0.000016427473,0.010636809,0.1951419,0.018386358,0.59210664,0.17685743,0.0013967649],"about_ca_topic_score_codex":0.0000023370328,"about_ca_topic_score_gemma":0.000022212977,"teacher_disagreement_score":0.9910591,"about_ca_system_score_codex":0.0000869447,"about_ca_system_score_gemma":0.000012703457,"threshold_uncertainty_score":0.6129831},"labels":[],"label_agreement":null},{"id":"W2014043378","doi":"10.1109/tit.2013.2241391","title":"Wavelength Isolation Sequence Design","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","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":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Golomb coding; Spectrometer; Complementary sequences; Binary number; Sequence (biology); Wavelength; Algorithm; Pseudorandom binary sequence; Mathematics; Computer science; Optics; Physics; Arithmetic; Discrete mathematics; Artificial intelligence; Chemistry","score_opus":0.01332491978848729,"score_gpt":0.19279997669613566,"score_spread":0.17947505690764837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014043378","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.013361262,0.0000067880583,0.9774573,0.000016809348,0.0007102362,0.0003784391,0.000012838147,0.0005311852,0.0075251535],"genre_scores_gemma":[0.9985102,0.000018288738,0.0009379635,0.000122549,0.000018290031,0.00018503326,0.0000052911464,0.00001369718,0.00018869445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.00009011673,0.0003017316,0.000060068913,0.000131808,0.00017082527],"domain_scores_gemma":[0.9995043,0.00013063804,0.000040176234,0.00019905345,0.00006221437,0.000063593325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032141412,0.0001364394,0.00009655247,0.00020742933,0.00014226427,0.000078826284,0.00010762827,0.00009266687,0.0006990598],"category_scores_gemma":[0.000003826921,0.0001303052,0.000060581173,0.00020150216,0.00003353313,0.001942722,2.3810652e-7,0.00017277947,0.002776524],"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.00004706606,0.000026981294,0.0000011612725,0.000096617274,0.00008125091,3.1113382e-7,0.0037510777,0.5831472,0.0034419466,0.022175398,0.0009699591,0.38626102],"study_design_scores_gemma":[0.0006281198,0.00012661229,0.00007469951,0.00007741993,0.00003243813,0.000030827094,0.0016219479,0.8936084,0.062569134,0.038686454,0.0019924478,0.0005515033],"about_ca_topic_score_codex":0.0000048853594,"about_ca_topic_score_gemma":3.8510348e-7,"teacher_disagreement_score":0.9851489,"about_ca_system_score_codex":0.000057536963,"about_ca_system_score_gemma":0.000011156611,"threshold_uncertainty_score":0.9979999},"labels":[],"label_agreement":null},{"id":"W2015853863","doi":"10.1109/tit.2007.909169","title":"LLL Reduction Achieves the Receive Diversity in MIMO Decoding","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":202,"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":"Decoding methods; MIMO; Fading; Lattice reduction; Mathematics; Algorithm; Reduction (mathematics); Computer science; Telecommunications; Channel (broadcasting)","score_opus":0.013892402437162821,"score_gpt":0.24020891535700553,"score_spread":0.2263165129198427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015853863","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.036028154,0.000023703948,0.9548784,0.00006349736,0.00037496584,0.00022613815,0.000007691789,0.0005175784,0.007879893],"genre_scores_gemma":[0.99694276,0.00025263565,0.0026206423,0.00007641269,0.000014206745,0.00002773987,0.00000473273,0.000009755569,0.00005109388],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929804,0.000052904383,0.00030390156,0.000056052148,0.00013195796,0.00015717237],"domain_scores_gemma":[0.99935824,0.00019577124,0.00005823684,0.0003119417,0.000044162964,0.00003163268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319591,0.00010806977,0.000082254744,0.0003090677,0.00033831687,0.000023433719,0.0002404928,0.00008311862,0.000044655968],"category_scores_gemma":[0.000008982876,0.00009816441,0.00004774547,0.0003368278,0.0000653308,0.0012048954,0.0000037242892,0.00038116955,0.00007235822],"study_design_candidate":"bench_or_experimental","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.00017498835,0.000052006286,0.00001978045,0.000040034825,0.000038815386,4.622805e-7,0.011448519,0.32951578,0.0015318958,0.012207793,0.00022682227,0.6447431],"study_design_scores_gemma":[0.0019348399,0.00018233039,0.0038665102,0.00032638392,0.00007409422,0.00007536141,0.023550404,0.056779042,0.8516791,0.047069415,0.013090938,0.0013715882],"about_ca_topic_score_codex":0.000011829854,"about_ca_topic_score_gemma":0.000029543977,"teacher_disagreement_score":0.9609146,"about_ca_system_score_codex":0.00021144791,"about_ca_system_score_gemma":0.000007061447,"threshold_uncertainty_score":0.40030286},"labels":[],"label_agreement":null},{"id":"W2016931804","doi":"10.1109/tit.2014.2313551","title":"On the Capacity of the Half-Duplex Diamond Channel Under Fixed Scheduling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nortel Networks Inc","keywords":"Scheduling (production processes); Computer science; Topology (electrical circuits); Channel capacity; Channel (broadcasting); Coding (social sciences); Mathematical optimization; Computer network; Mathematics; Engineering; Electrical engineering","score_opus":0.030280084414875487,"score_gpt":0.2322366907169289,"score_spread":0.20195660630205342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016931804","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.01666439,0.000007196491,0.9756491,0.0029488713,0.00046293144,0.00019551237,0.0000033135364,0.00006990211,0.0039987485],"genre_scores_gemma":[0.9965438,0.000028713694,0.0005993918,0.0026739866,0.0000128290185,0.00003425978,6.7770725e-7,0.000004113336,0.000102187085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998863,0.00040936173,0.00027927794,0.00008650286,0.00023223365,0.00012963834],"domain_scores_gemma":[0.9980124,0.0008181835,0.0001574174,0.00084817846,0.00012964966,0.000034154637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095262233,0.00011031185,0.000095395466,0.00009711553,0.0006356232,0.00009175174,0.000864874,0.000049569462,0.00007128478],"category_scores_gemma":[0.00005068623,0.00006653334,0.00009986792,0.00040793727,0.00012075699,0.00063449756,0.000009911811,0.00031063918,0.000078594094],"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.000011978463,0.000035180088,3.9619596e-7,0.0000057442408,0.000017167793,5.79729e-9,0.0027125445,0.17060329,0.00019339679,0.8011545,0.00008468791,0.025181144],"study_design_scores_gemma":[0.0005383532,0.00009981249,0.00030306468,0.00012682646,0.000015228011,0.0000033453102,0.000490058,0.8993724,0.05053986,0.046240803,0.002024229,0.00024603782],"about_ca_topic_score_codex":0.000003603856,"about_ca_topic_score_gemma":0.000010410832,"teacher_disagreement_score":0.97987944,"about_ca_system_score_codex":0.000041321822,"about_ca_system_score_gemma":0.00003226299,"threshold_uncertainty_score":0.48887637},"labels":[],"label_agreement":null},{"id":"W2019616249","doi":"10.1109/tit.2011.2176914","title":"Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Modulo; Mathematics; Binary number; Notation; Polynomial; Discrete mathematics; Cryptography; Exponential function; Coding theory; Number theory; Primitive root modulo n; Combinatorics; Arithmetic; Algorithm; Mathematical analysis","score_opus":0.007425260864609705,"score_gpt":0.20348652576179313,"score_spread":0.19606126489718342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019616249","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.30246395,0.000012815147,0.69550437,0.00006507004,0.0010210377,0.0001312097,0.000019754598,0.000055183933,0.00072662893],"genre_scores_gemma":[0.9994109,0.0000063796883,0.00018660851,0.0003060972,0.000018917626,0.000013445194,0.0000012519401,0.0000036014933,0.000052797295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922895,0.00012423536,0.00023943276,0.00007112572,0.00016542085,0.0001708068],"domain_scores_gemma":[0.99929565,0.00011711137,0.00012588275,0.00035978024,0.000037394755,0.00006418537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004693377,0.000101898855,0.000093829236,0.00018281506,0.00025362906,0.000053116328,0.00033783933,0.000049686154,0.000028120025],"category_scores_gemma":[0.0000057845723,0.000076776065,0.00008240176,0.00029106316,0.00012020182,0.0014172852,0.000007795015,0.00013123568,0.00003477838],"study_design_candidate":"design_other","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.0005777649,0.0007780012,0.0005227332,0.0002089076,0.0001562598,4.4552536e-7,0.035915572,0.0029467815,0.005383226,0.24640265,0.00035950184,0.7067481],"study_design_scores_gemma":[0.013244431,0.0029925173,0.24620289,0.0012926655,0.0007314,0.00055688404,0.0057806787,0.147874,0.49126256,0.038428567,0.04671953,0.0049138875],"about_ca_topic_score_codex":0.000002002671,"about_ca_topic_score_gemma":2.3463794e-7,"teacher_disagreement_score":0.70183426,"about_ca_system_score_codex":0.000015638989,"about_ca_system_score_gemma":0.00001724305,"threshold_uncertainty_score":0.3130837},"labels":[],"label_agreement":null},{"id":"W2021630594","doi":"10.1109/tit.2015.2414434","title":"On the Capacity Region of the Broadcast, the Interference, and the Cognitive Radio Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Interference (communication); Decoding methods; Computer science; Channel (broadcasting); Cognitive radio; Topology (electrical circuits); Noise (video); Channel capacity; Gaussian; Computer network; Telecommunications; Mathematics; Wireless; Physics; Artificial intelligence","score_opus":0.02625614296765145,"score_gpt":0.21775804943482716,"score_spread":0.19150190646717571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021630594","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.086849704,0.00008802119,0.895846,0.0022371372,0.0004932443,0.0010309584,0.000040319876,0.0002377066,0.013176889],"genre_scores_gemma":[0.99908036,0.00014338313,0.000018664516,0.0005213356,0.000012350571,0.00016729168,0.0000012350871,0.000008941316,0.000046410863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897987,0.00040056932,0.00027650548,0.000048555237,0.00019488581,0.00009960047],"domain_scores_gemma":[0.9980576,0.001144142,0.00011101275,0.0005246502,0.00013597886,0.00002659118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822539,0.00012353604,0.00011294944,0.00007530452,0.00027008014,0.00006257007,0.0004457411,0.00006627388,0.000014692117],"category_scores_gemma":[0.00006825337,0.000055103646,0.000075626725,0.00022802754,0.00056998426,0.00036748179,0.0000056985423,0.00048665766,0.000017665203],"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.0009404232,0.00009921826,0.0000035909127,0.000086822256,0.00031985543,1.6216967e-7,0.15345104,0.039761417,0.000063378924,0.7011225,0.004570009,0.09958157],"study_design_scores_gemma":[0.007596801,0.00058040326,0.00032425075,0.0016669229,0.00044251897,0.00023153413,0.06486979,0.28281513,0.2626543,0.3611121,0.0164463,0.0012599496],"about_ca_topic_score_codex":0.00002126297,"about_ca_topic_score_gemma":0.0000067634633,"teacher_disagreement_score":0.9122307,"about_ca_system_score_codex":0.000045601264,"about_ca_system_score_gemma":0.000019218967,"threshold_uncertainty_score":0.22470614},"labels":[],"label_agreement":null},{"id":"W2021995874","doi":"10.1109/tit.2007.907498","title":"Lagrangian Optimization of Two-Description Scalar Quantizers","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"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":"Lagrange multiplier; Parameterized complexity; Bounded function; Monotonic function; Mathematics; Mathematical optimization; Convex function; Function (biology); Computer science; Algorithm; Regular polygon","score_opus":0.011853549915452434,"score_gpt":0.2602401401358047,"score_spread":0.24838659022035228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021995874","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.00048335627,0.000008191886,0.9960047,0.000050120587,0.0004434992,0.00024342201,0.000020293313,0.00048532579,0.002261075],"genre_scores_gemma":[0.714458,0.00002176013,0.28517157,0.00025516903,0.00000958885,0.000014863944,0.000012974755,0.0000071894005,0.000048905687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871486,0.0000773665,0.0005399984,0.00013756508,0.00033769957,0.00019253307],"domain_scores_gemma":[0.9987781,0.000157764,0.00026354828,0.0005339788,0.0001911483,0.00007545907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500045,0.00013497184,0.00013514634,0.0005828983,0.00016024997,0.00006499364,0.00046799023,0.00008232801,0.0000627726],"category_scores_gemma":[0.000015272482,0.00013056779,0.00008335171,0.00057906884,0.000071145296,0.0046676174,0.0000043953955,0.00016959744,0.000051122493],"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.00016131629,0.0001348585,0.0000033896845,0.00004142452,0.000025047324,8.908647e-7,0.0013495331,0.46950617,0.0038138067,0.18553472,0.00018695022,0.3392419],"study_design_scores_gemma":[0.0013827125,0.00026307785,0.00007977224,0.00014922742,0.000025989324,0.00002374173,0.0004616477,0.29139885,0.6795707,0.024582177,0.0015830189,0.00047909757],"about_ca_topic_score_codex":0.000008779627,"about_ca_topic_score_gemma":0.0000020730733,"teacher_disagreement_score":0.71397465,"about_ca_system_score_codex":0.00006755807,"about_ca_system_score_gemma":0.000030204106,"threshold_uncertainty_score":0.53244},"labels":[],"label_agreement":null},{"id":"W2025052516","doi":"10.1109/tit.2012.2227453","title":"Energy-Efficient Full Diversity Collaborative Unitary Space-Time Block Code Designs via Unique Factorization of Signals","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":35,"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":"Unitary state; Factorization; Computer science; Block code; Space time; Code (set theory); Diversity (politics); Block (permutation group theory); Theoretical computer science; Algorithm; Decoding methods; Mathematics; Combinatorics; Engineering; Programming language","score_opus":0.011094249857033125,"score_gpt":0.21571947746838016,"score_spread":0.20462522761134705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025052516","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.007682382,0.00004932527,0.9895012,0.00001835157,0.00018840707,0.00027928967,0.00019590018,0.0005845823,0.0015005795],"genre_scores_gemma":[0.9952995,0.00013333635,0.004345299,0.000043151664,0.000011915696,0.000051590938,0.000043647477,0.000019935811,0.00005158013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989383,0.00017903709,0.00039031438,0.0000643429,0.00022792445,0.00020005801],"domain_scores_gemma":[0.9989022,0.00022670403,0.00015723378,0.00035189628,0.000267979,0.00009400806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283392,0.00018783443,0.00018767054,0.0003759778,0.0002564978,0.000013400385,0.00022040193,0.00013926205,0.00012624357],"category_scores_gemma":[0.000007649589,0.00020396909,0.00006352779,0.0005528277,0.000085689324,0.0011705045,0.000006683204,0.00019027173,0.000046104647],"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.00008874366,0.000109954635,0.0000035606893,0.000040509563,0.00007412939,6.833444e-8,0.004355418,0.9592274,0.022993974,0.0050210617,0.00013997807,0.00794522],"study_design_scores_gemma":[0.00030700228,0.00010103196,0.00002133066,0.000051723102,0.000045035067,0.0000031714192,0.0007367562,0.11828675,0.8773677,0.0016134806,0.0011440486,0.0003220244],"about_ca_topic_score_codex":0.000008134457,"about_ca_topic_score_gemma":0.0000024209867,"teacher_disagreement_score":0.98761714,"about_ca_system_score_codex":0.00020608866,"about_ca_system_score_gemma":0.000027972996,"threshold_uncertainty_score":0.83176184},"labels":[],"label_agreement":null},{"id":"W2027121408","doi":"10.1109/tit.2013.2245397","title":"Vector Gaussian Two-Terminal Source Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":36,"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":"Gaussian; Upper and lower bounds; Mathematics; Terminal (telecommunication); Coding (social sciences); Algorithm; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Telecommunications; Statistics; Physics","score_opus":0.007738102270047929,"score_gpt":0.22013845442741542,"score_spread":0.2124003521573675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027121408","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.013427773,0.000015234393,0.96757084,0.0001046728,0.00023805628,0.00028745958,0.000011865861,0.0014573789,0.016886692],"genre_scores_gemma":[0.997564,0.000062372914,0.0017428264,0.00021750986,0.000020107223,0.00022250637,0.000009275113,0.000021574395,0.0001398129],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992159,0.00005552191,0.00033239974,0.00005928911,0.00015675681,0.0001801465],"domain_scores_gemma":[0.9992895,0.00011595658,0.000052444735,0.0004024212,0.00006416274,0.00007551501],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018810225,0.0001474557,0.00011607175,0.00026466683,0.00016342851,0.00012284228,0.00024784775,0.00008218203,0.00075228553],"category_scores_gemma":[0.0000042237184,0.00015473769,0.000069056485,0.00017664152,0.000053092197,0.0016221906,0.0000014395961,0.00031653309,0.0013421575],"study_design_candidate":"design_other","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.000038694463,0.00008849844,0.0000058892747,0.00019258496,0.00011166878,6.381253e-7,0.009371013,0.06680826,0.0057880217,0.035231236,0.0021405907,0.8802229],"study_design_scores_gemma":[0.0022537878,0.00022366756,0.0007629992,0.0004384188,0.000096140466,0.00014159494,0.004839679,0.43713164,0.47798592,0.010681882,0.06348134,0.001962902],"about_ca_topic_score_codex":0.000015912039,"about_ca_topic_score_gemma":0.000003779648,"teacher_disagreement_score":0.9841362,"about_ca_system_score_codex":0.00009930568,"about_ca_system_score_gemma":0.000011720442,"threshold_uncertainty_score":0.9994354},"labels":[],"label_agreement":null},{"id":"W2028911681","doi":"10.1109/tit.2014.2331341","title":"Hidden Cliques and the Certification of the Restricted Isometry Property","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":37,"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":"Restricted isometry property; Isometry (Riemannian geometry); Underdetermined system; Property (philosophy); Mathematics; Matrix (chemical analysis); Compressed sensing; Probabilistic logic; Time complexity; Clique; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.008996019967242282,"score_gpt":0.19698555094763953,"score_spread":0.18798953098039725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028911681","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.043872602,0.000029307801,0.94655025,0.00031529609,0.00028159644,0.000339852,0.000007089472,0.00035132782,0.008252687],"genre_scores_gemma":[0.999397,0.000074735326,0.00026320436,0.00015576842,0.000011176189,0.000025786068,9.909296e-7,0.000006316106,0.00006504677],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947584,0.00010757998,0.0002121387,0.000037733418,0.00010344291,0.00006329118],"domain_scores_gemma":[0.9994479,0.00015651934,0.000059359787,0.00026188942,0.00006061258,0.000013727169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022811341,0.00007100159,0.00007968452,0.00008921317,0.00011397216,0.00002829195,0.00011905938,0.000050928767,0.000009955225],"category_scores_gemma":[0.000020622161,0.00003433182,0.000043244316,0.0001781098,0.0001234479,0.00025759765,0.0000011315215,0.00013722043,0.0000073538827],"study_design_candidate":"design_other","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.00044889768,0.000051400784,0.000016616772,0.00012224578,0.0001456543,4.7384425e-8,0.0057576387,0.03813903,0.0071115578,0.06238762,0.0024733704,0.8833459],"study_design_scores_gemma":[0.0012269072,0.00008743919,0.0019499126,0.00018292641,0.00010265494,0.0000127735575,0.0005165733,0.25049454,0.7047493,0.03057718,0.009805862,0.00029394904],"about_ca_topic_score_codex":0.000013035916,"about_ca_topic_score_gemma":0.0000014451351,"teacher_disagreement_score":0.9555244,"about_ca_system_score_codex":0.00001514969,"about_ca_system_score_gemma":0.0000065067475,"threshold_uncertainty_score":0.1400011},"labels":[],"label_agreement":null},{"id":"W2029114055","doi":"10.1109/tit.2004.830782","title":"Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":25,"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":"Maximum a posteriori estimation; Algorithm; Markov chain; Mathematics; Decoding methods; Computational complexity theory; Sequence (biology); Directed acyclic graph; Forward algorithm; Monotonic function; Markov model; Variable-order Markov model","score_opus":0.010486737747912913,"score_gpt":0.2543342481356515,"score_spread":0.24384751038773855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029114055","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.12682432,0.000010781398,0.8722795,0.000072325834,0.0002704184,0.0002734481,0.000084241154,0.000022458613,0.00016249648],"genre_scores_gemma":[0.9893545,0.000005937528,0.010005271,0.00038751657,0.00003435387,0.000055584183,0.00011145752,0.0000053496924,0.00004002012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935544,0.000031627787,0.00027507584,0.000108003376,0.00009441888,0.00013542791],"domain_scores_gemma":[0.999574,0.000040504005,0.0001306503,0.00013226201,0.000086720705,0.000035860692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027752804,0.000111458605,0.000102628575,0.0000773306,0.00011737826,0.000022332651,0.00010701681,0.00012762313,0.000018743542],"category_scores_gemma":[0.000014165232,0.000093715804,0.00011630273,0.00007506458,0.000071451526,0.000028505267,0.0000013612156,0.00006450738,0.000009414778],"study_design_candidate":"bench_or_experimental","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.0004607479,0.00011105188,0.000002662507,0.000099445715,0.000047412395,1.2692065e-7,0.0001714025,0.8667639,0.026060803,0.0012154931,0.000029271647,0.10503768],"study_design_scores_gemma":[0.0013779247,0.0007991072,0.000039983555,0.000050288352,0.000024856732,0.0000024819697,0.00014565619,0.047116417,0.9460066,0.0032878418,0.0009366172,0.00021221963],"about_ca_topic_score_codex":0.000007197219,"about_ca_topic_score_gemma":0.0000013429645,"teacher_disagreement_score":0.9199458,"about_ca_system_score_codex":0.000023501298,"about_ca_system_score_gemma":0.000058639285,"threshold_uncertainty_score":0.38216197},"labels":[],"label_agreement":null},{"id":"W2029378260","doi":"10.1109/tit.2003.814487","title":"Linear transformation shift registers","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"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":"Shift register; Primitive polynomial; Transformation (genetics); Linear feedback shift register; Enumeration; Linear map; Order (exchange); Computer science; Algorithm; Mathematics; Discrete mathematics; Arithmetic; Finite field; Combinatorics; Biology; Pure mathematics; Genetics","score_opus":0.011209562116979564,"score_gpt":0.22122789059540562,"score_spread":0.21001832847842605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029378260","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.0018783816,0.0000071893946,0.96465826,0.00023989384,0.0007673084,0.00019313396,0.000007794962,0.00036662738,0.03188141],"genre_scores_gemma":[0.9937816,0.000013886381,0.0049844934,0.0010606276,0.000009178057,0.000043205127,0.0000029126454,0.0000060847397,0.00009798383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988249,0.00020681377,0.00036901172,0.00012816406,0.00025338924,0.00021770854],"domain_scores_gemma":[0.9991345,0.00015091272,0.00010355934,0.00046314512,0.000058025773,0.00008990276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089242787,0.00015562301,0.00011164511,0.00040946578,0.0003526095,0.00014199005,0.00036791828,0.000085618,0.00013028401],"category_scores_gemma":[0.000010080931,0.00014935581,0.00015765362,0.00056877785,0.00006203714,0.003443428,7.080357e-7,0.0002179037,0.00045351568],"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.000047128295,0.000044702214,6.099133e-7,0.0000180996,0.000020465417,3.2974197e-7,0.005320906,0.0050355126,0.00002169094,0.9186925,0.00004731273,0.07075072],"study_design_scores_gemma":[0.003866856,0.0008823316,0.0001234059,0.0001562885,0.000090494286,0.00011579681,0.0024458023,0.02760686,0.10471035,0.7086034,0.1497924,0.0016060144],"about_ca_topic_score_codex":0.000001502536,"about_ca_topic_score_gemma":0.0000011033276,"teacher_disagreement_score":0.99190325,"about_ca_system_score_codex":0.00003846643,"about_ca_system_score_gemma":0.000046177935,"threshold_uncertainty_score":0.6090553},"labels":[],"label_agreement":null},{"id":"W2030357686","doi":"10.1109/tit.2013.2290539","title":"Layered Interference Networks With Delayed CSI: DoF Scaling With Distributed Transmitters","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Channel state information; Interference (communication); Computer science; Interference alignment; Transmission (telecommunications); Exploit; Scaling; Topology (electrical circuits); Channel (broadcasting); Degrees of freedom (physics and chemistry); Computer network; Control theory (sociology); Electronic engineering; Wireless; Telecommunications; MIMO; Physics; Mathematics; Engineering; Control (management); Electrical engineering","score_opus":0.0036996177127199244,"score_gpt":0.17113606625728595,"score_spread":0.16743644854456602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030357686","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.007995945,0.000011794567,0.98980635,0.00002639364,0.00021357619,0.0005648229,0.00005190363,0.0006043537,0.00072485703],"genre_scores_gemma":[0.99441004,0.000020491561,0.0050901924,0.00008698028,0.000015040177,0.00024615534,0.00006820003,0.00003340661,0.000029474857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.000038936054,0.00037982396,0.0001108991,0.00014042653,0.00026003228],"domain_scores_gemma":[0.9993501,0.00008504924,0.000081268496,0.0002467323,0.00014108438,0.00009580346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001035988,0.000234829,0.00017620143,0.00017452876,0.00013786371,0.00010418831,0.00012822276,0.00010110691,0.0001404474],"category_scores_gemma":[0.0000015981917,0.00018850686,0.000040897055,0.00036474186,0.00005923728,0.0020659578,4.3580303e-7,0.00027750002,0.00009338444],"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.00016163036,0.000012410939,0.0000021491003,0.00003763753,0.00008134255,3.5745967e-7,0.0009920909,0.98117614,0.000070874965,0.000107596454,0.000045537716,0.017312221],"study_design_scores_gemma":[0.0012633277,0.00018065264,0.00003990842,0.00020763451,0.00004828624,0.000029893486,0.0016195951,0.99055344,0.0054489677,0.00009301476,0.000100569894,0.0004147046],"about_ca_topic_score_codex":0.000017991135,"about_ca_topic_score_gemma":0.000014867019,"teacher_disagreement_score":0.98641413,"about_ca_system_score_codex":0.00013504014,"about_ca_system_score_gemma":0.000017743976,"threshold_uncertainty_score":0.7687087},"labels":[],"label_agreement":null},{"id":"W2033624859","doi":"10.1109/tit.2006.889023","title":"Generally Dimensional and Constellation Expansion Free Space–Time Block Codes for QAM With Full Diversity","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","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":"Quadrature amplitude modulation; QAM; Block code; Constellation diagram; Constellation; Rayleigh fading; Mathematics; Algorithm; Computer science; Fading; Electronic engineering; Telecommunications; Bit error rate; Decoding methods; Physics; Engineering","score_opus":0.006168638195258137,"score_gpt":0.20030309855032472,"score_spread":0.19413446035506657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033624859","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.076103665,0.00002678933,0.92171204,0.00005307828,0.00008203788,0.0003880944,0.00006681871,0.00052688026,0.0010406034],"genre_scores_gemma":[0.9726675,0.000058044978,0.02704309,0.00011714953,0.000012180697,0.000017346874,0.000027214563,0.00001565372,0.000041818766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933964,0.000021335753,0.00024369446,0.00008022351,0.00016522703,0.00014988868],"domain_scores_gemma":[0.99920803,0.000246411,0.00006960708,0.00029408353,0.00011746051,0.0000644346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033160285,0.00014476593,0.00012346127,0.00022463163,0.0003628819,0.000024706233,0.00012500094,0.00009607408,0.000024684754],"category_scores_gemma":[0.0000048999495,0.00014027192,0.00003750092,0.00011646724,0.00009134706,0.0008085391,0.0000054253924,0.00014384146,0.000011056733],"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.0008020013,0.000049028542,0.0000108089025,0.000094117815,0.00007211008,4.5582368e-7,0.00134499,0.91350645,0.0122256875,0.0045198654,0.00057769334,0.06679679],"study_design_scores_gemma":[0.004445862,0.0007460046,0.00040286864,0.0002621051,0.00015860549,0.00008358199,0.000900503,0.41107535,0.5619213,0.012140013,0.0066285576,0.0012352603],"about_ca_topic_score_codex":0.000002771117,"about_ca_topic_score_gemma":0.0000093861145,"teacher_disagreement_score":0.8965638,"about_ca_system_score_codex":0.000079635436,"about_ca_system_score_gemma":0.00001294513,"threshold_uncertainty_score":0.5720123},"labels":[],"label_agreement":null},{"id":"W2036466669","doi":"10.1109/tit.2014.2361347","title":"Prefactor Reduction of the Guruswami–Sudan Interpolation Step","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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 Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Interpolation (computer graphics); Univariate; Polynomial; Monomial; Applied mathematics; Modulo; Projection (relational algebra); Reduction (mathematics); Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis; Multivariate statistics","score_opus":0.006828599215914099,"score_gpt":0.2012428588132299,"score_spread":0.19441425959731579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036466669","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.012995884,0.0000024087633,0.9783321,0.00013491791,0.0013442041,0.00017540797,0.0000061815804,0.00013749882,0.0068714023],"genre_scores_gemma":[0.9974471,0.000002824813,0.0022439854,0.00016461338,0.000021250895,0.000019433668,0.0000011264053,0.0000041093244,0.00009558213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.00025073517,0.000331586,0.00010283275,0.00022883076,0.00011835859],"domain_scores_gemma":[0.99897355,0.00013366464,0.00020925075,0.0005520525,0.00009439616,0.000037111062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066689093,0.000107362845,0.000094403214,0.00023506524,0.0002338659,0.000068803325,0.00049387215,0.00006447502,0.000052202362],"category_scores_gemma":[0.000015592646,0.00008089749,0.00014660657,0.0004581464,0.000087099914,0.0015651342,0.0000040888635,0.00017194376,0.000048574522],"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.000083748775,0.000062536266,0.000006999449,0.000027249815,0.000029291583,1.1083516e-8,0.0032761986,0.0033160879,0.0012334554,0.6551437,0.00009600363,0.33672473],"study_design_scores_gemma":[0.0024444214,0.0011238107,0.0025984717,0.00040082814,0.00013121104,0.000058821286,0.0019793299,0.2350616,0.33421254,0.3993805,0.021554453,0.0010539974],"about_ca_topic_score_codex":0.0000045019246,"about_ca_topic_score_gemma":0.0000014284883,"teacher_disagreement_score":0.9844512,"about_ca_system_score_codex":0.00002691332,"about_ca_system_score_gemma":0.000025721169,"threshold_uncertainty_score":0.32989037},"labels":[],"label_agreement":null},{"id":"W2040420188","doi":"10.1109/tit.2013.2267772","title":"On Convexity of Error Rates in Digital Communications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"Convexity; Additive white Gaussian noise; Noise power; Gaussian noise; Convex optimization; Fading; Channel (broadcasting); White noise; Upper and lower bounds","score_opus":0.01727604170683221,"score_gpt":0.25403264414171706,"score_spread":0.23675660243488483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040420188","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.16232608,0.000037151185,0.79552877,0.000254021,0.0001559558,0.00076387764,0.00013523035,0.00078318577,0.040015742],"genre_scores_gemma":[0.9987475,0.0000893331,0.0007788383,0.000110801455,0.0000017163052,0.00020937451,0.000024229863,0.000011789574,0.000026385014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923074,0.00004563278,0.0004444841,0.00004481183,0.00012398735,0.000110324596],"domain_scores_gemma":[0.99862015,0.00038420473,0.00006953631,0.00078766135,0.00010175829,0.00003665722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018131082,0.00011337589,0.00013494573,0.00035623676,0.00006194123,0.0000522523,0.00041468613,0.000087205255,0.00021306903],"category_scores_gemma":[0.000016486121,0.00011883229,0.000054766777,0.00025657815,0.00012711516,0.001603606,0.000002971636,0.00031102725,0.00037300386],"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.00017003187,0.0010905658,0.000117032076,0.0004241579,0.0002076286,2.6942504e-7,0.018301707,0.19631621,0.001984925,0.39817122,0.0028341014,0.38038218],"study_design_scores_gemma":[0.0026667258,0.0004181734,0.0027468612,0.0006746487,0.000036516165,0.000010662057,0.005869005,0.49113935,0.27785572,0.21131451,0.005871976,0.0013958608],"about_ca_topic_score_codex":0.00001906212,"about_ca_topic_score_gemma":0.000008650389,"teacher_disagreement_score":0.83642143,"about_ca_system_score_codex":0.000072964,"about_ca_system_score_gemma":0.000014148961,"threshold_uncertainty_score":0.48458403},"labels":[],"label_agreement":null},{"id":"W2040861319","doi":"10.1109/tit.2013.2291787","title":"Optimality and Approximate Optimality of Source-Channel Separation in Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":54,"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":"Distortion (music); Channel (broadcasting); Separation (statistics); Bounded function; Quadratic equation; Decoding methods; Measure (data warehouse); Mathematics; Upper and lower bounds; Converse; Computer science; Source separation; Topology (electrical circuits); Mathematical optimization; Algorithm; Telecommunications; Combinatorics","score_opus":0.007589482128150708,"score_gpt":0.2281653840888259,"score_spread":0.22057590196067517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040861319","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.040735964,0.00002247426,0.95574415,0.000020451249,0.00007013301,0.00021724714,0.000011594736,0.00031964487,0.0028583668],"genre_scores_gemma":[0.9970425,0.00012914349,0.0026666266,0.000051884315,0.0000061517962,0.000072141556,0.000012649237,0.000011122836,0.0000078060075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909896,0.00013193075,0.0004606747,0.00006806811,0.000113784154,0.00012660836],"domain_scores_gemma":[0.99932975,0.00016187492,0.00008588447,0.00032660514,0.000056219687,0.000039698487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009031378,0.00012282355,0.00016940047,0.00022508106,0.000063323256,0.00003126777,0.00013020125,0.00012393194,0.000019698808],"category_scores_gemma":[0.000009160873,0.00013549405,0.000040778268,0.00019022118,0.000076422366,0.0008034562,0.000002256693,0.00024766906,0.0000061068927],"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.0000386635,0.00002696798,0.0000067408755,0.000079499994,0.0000114773875,1.4860681e-8,0.001643718,0.96962905,0.000058345337,0.0054824473,0.000016253598,0.02300681],"study_design_scores_gemma":[0.00027715223,0.000032047177,0.00020379352,0.00004161639,0.000007790318,0.0000020905024,0.00021240575,0.9864163,0.010288825,0.0021694796,0.00021298215,0.00013554512],"about_ca_topic_score_codex":0.000014699155,"about_ca_topic_score_gemma":0.0000077597815,"teacher_disagreement_score":0.9563065,"about_ca_system_score_codex":0.00004711847,"about_ca_system_score_gemma":0.0000061784126,"threshold_uncertainty_score":0.5525287},"labels":[],"label_agreement":null},{"id":"W2042912048","doi":"10.1109/tit.2013.2286621","title":"Broadcast Approaches to the Diamond Channel","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"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":"Relay; Rayleigh fading; Computer science; Decoding methods; Fading; Linear network coding; Channel (broadcasting); Block Error Rate; Transmission (telecommunications); Code rate; Throughput; Algorithm; Topology (electrical circuits); Computer network; Mathematics; Wireless; Telecommunications; Network packet; Telecommunications link","score_opus":0.06331252199397727,"score_gpt":0.2292682476007619,"score_spread":0.16595572560678462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042912048","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.0005321747,0.00003071559,0.9842005,0.0058858595,0.00037678555,0.0004367598,0.0000032057817,0.00015103882,0.008382997],"genre_scores_gemma":[0.9931152,0.00006589117,0.002095999,0.0036755535,0.000024483885,0.00034929859,0.0000019994927,0.0000046208197,0.00066693913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991847,0.0001531641,0.00023053499,0.00009918449,0.00016717886,0.00016520132],"domain_scores_gemma":[0.9989288,0.00016654578,0.000057440688,0.0006796902,0.00008549635,0.000082056285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004199863,0.000109468805,0.00007573154,0.00015672154,0.0005165565,0.0003367796,0.0008197861,0.000036745118,0.00015668232],"category_scores_gemma":[0.000008790494,0.00007741762,0.00005629161,0.00048843573,0.00003747149,0.0018794605,0.000009651927,0.00019465062,0.002565209],"study_design_candidate":"design_other","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.000006188736,0.00003365161,2.3748504e-7,0.0000036009858,0.000015147923,3.5054036e-8,0.009208047,0.028140478,0.00001841176,0.08351511,0.0023366916,0.8767224],"study_design_scores_gemma":[0.0008866423,0.00026828545,0.00058236095,0.00007827329,0.000019322475,0.000025115622,0.0029669974,0.8242993,0.013099892,0.015150043,0.14177929,0.0008444898],"about_ca_topic_score_codex":0.0000041826374,"about_ca_topic_score_gemma":0.000004817831,"teacher_disagreement_score":0.99258304,"about_ca_system_score_codex":0.000037249778,"about_ca_system_score_gemma":0.000024948848,"threshold_uncertainty_score":0.9982114},"labels":[],"label_agreement":null},{"id":"W2043384621","doi":"10.1109/tit.2014.2346183","title":"Tracking a Markov-Modulated Stationary Degree Distribution of a Dynamic Random Graph","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":22,"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 British Columbia","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Stationary distribution; Degree distribution; Markov process; Degree (music); Markov model; Markov kernel; Discrete mathematics; Variable-order Markov model; Algorithm; Applied mathematics; Combinatorics; Statistics; Complex network","score_opus":0.006857078902441537,"score_gpt":0.23262984795697728,"score_spread":0.22577276905453575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043384621","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.055765387,0.0000035830876,0.941704,0.000022794635,0.0000800591,0.00021480296,0.0002192007,0.00010625276,0.0018839438],"genre_scores_gemma":[0.9985274,0.0000035256817,0.00076504785,0.00002936335,0.000015206126,0.000053150437,0.0005405767,0.000008481965,0.000057236717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989184,0.0001543402,0.0004941289,0.000096993695,0.00019063718,0.00014547016],"domain_scores_gemma":[0.9990646,0.00023198241,0.00024338806,0.00023884459,0.00017881316,0.0000423481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049734116,0.00013994052,0.00019873666,0.00021988172,0.0001738187,0.000033104167,0.00011916699,0.000043981105,0.00047851814],"category_scores_gemma":[0.000004556578,0.00013724288,0.00018407719,0.0004126788,0.00006418069,0.00063713617,0.0000011660035,0.00015625182,0.0000318519],"study_design_candidate":"design_other","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.0005052069,0.00019908635,0.000056991546,0.000037121157,0.00026840373,6.871558e-8,0.0007360519,0.035834093,0.00045124604,0.022828879,0.00028164542,0.9388012],"study_design_scores_gemma":[0.006910888,0.00041940584,0.008481685,0.000307585,0.00064743054,0.000005562895,0.0015345044,0.6909901,0.027512604,0.2583283,0.0037267702,0.0011352049],"about_ca_topic_score_codex":0.000026657042,"about_ca_topic_score_gemma":0.000004429318,"teacher_disagreement_score":0.942762,"about_ca_system_score_codex":0.0000383793,"about_ca_system_score_gemma":0.000025274903,"threshold_uncertainty_score":0.55966026},"labels":[],"label_agreement":null},{"id":"W2044655549","doi":"10.1109/tit.2011.2159043","title":"Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Frame (networking); Computer science; Algorithm; Coding (social sciences); Artificial intelligence; Mathematics; Statistics","score_opus":0.025877637379072345,"score_gpt":0.247536801124163,"score_spread":0.22165916374509065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044655549","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.0031148877,0.000011687342,0.9945498,0.000110957786,0.00080217887,0.0003760018,0.00003807004,0.0007078749,0.00028851576],"genre_scores_gemma":[0.97525066,0.000031568867,0.024051674,0.00030233414,0.000016720487,0.00017246668,0.000032953838,0.000009865592,0.00013176803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998807,0.0001537159,0.00047414468,0.00020716697,0.00016070215,0.00019723232],"domain_scores_gemma":[0.998923,0.00026604944,0.0002811498,0.00028187307,0.00018205112,0.00006587813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007593215,0.0001786212,0.00018221489,0.0003492268,0.00048488282,0.00016293656,0.00030943338,0.00012098158,0.000018325549],"category_scores_gemma":[0.000027838618,0.0001665617,0.000065160806,0.0002550857,0.0000977382,0.0020883628,0.000006838541,0.00017443774,0.00003532331],"study_design_candidate":"design_other","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.00012620997,0.00008466576,0.0000066918938,0.00003468878,0.000032984837,2.4322554e-7,0.0042434507,0.0005824315,0.0005293126,0.10300565,0.00010757837,0.8912461],"study_design_scores_gemma":[0.0022405838,0.000826072,0.0025070747,0.00017136587,0.00008972381,0.000027626173,0.0016559828,0.5740088,0.21373796,0.20110857,0.0027168063,0.0009094238],"about_ca_topic_score_codex":0.0000031632856,"about_ca_topic_score_gemma":5.196176e-7,"teacher_disagreement_score":0.9721358,"about_ca_system_score_codex":0.000051380786,"about_ca_system_score_gemma":0.00003367542,"threshold_uncertainty_score":0.6792189},"labels":[],"label_agreement":null},{"id":"W2044804826","doi":"10.1109/tit.2012.2216975","title":"How Suboptimal Is the Shannon Code?","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"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 Victoria","funders":"Isfahan University of Technology","keywords":"Huffman coding; Prefix code; Canonical Huffman code; Redundancy (engineering); Mathematics; Shannon–Fano coding; Variable-length code; Information theory; Code (set theory); Algorithm; Code word; Discrete mathematics; Computer science; Code rate; Data compression; Set (abstract data type); Statistics; Linear code; Block code; Decoding methods; Systematic code","score_opus":0.014051113463751454,"score_gpt":0.22707264983542264,"score_spread":0.21302153637167118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044804826","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.00047583104,0.0000353394,0.9943851,0.0014382713,0.0010870157,0.00015684328,0.000051209805,0.00015455211,0.0022157924],"genre_scores_gemma":[0.9865906,0.00002355631,0.009836692,0.0024254278,0.00008318837,0.00005453131,0.000007275597,0.000006388766,0.00097231544],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913275,0.000074165735,0.00017584869,0.00008717167,0.00028721453,0.00024286585],"domain_scores_gemma":[0.999073,0.00012896342,0.000092336784,0.0005548321,0.00006565654,0.00008515912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005042564,0.00011924764,0.000076852164,0.000111277724,0.00042926977,0.00034344324,0.00051008567,0.00006214092,0.000097526565],"category_scores_gemma":[0.0000044886474,0.00007814544,0.00007475473,0.0002383496,0.000049755923,0.006474007,0.000006151158,0.00020236672,0.0004194688],"study_design_candidate":"design_other","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.00005941191,0.00013598047,0.0000053388485,0.000019755349,0.000044715678,3.0359877e-7,0.010854342,0.0019890927,0.00009125021,0.13327911,0.0073277056,0.846193],"study_design_scores_gemma":[0.0015509644,0.0003295477,0.00063737045,0.00007947433,0.0000622928,0.00011472782,0.0025355276,0.3348568,0.063160464,0.011472652,0.58420986,0.0009902942],"about_ca_topic_score_codex":0.0000036916338,"about_ca_topic_score_gemma":3.7758846e-7,"teacher_disagreement_score":0.9861148,"about_ca_system_score_codex":0.000031628086,"about_ca_system_score_gemma":0.00002402687,"threshold_uncertainty_score":0.53915626},"labels":[],"label_agreement":null},{"id":"W2045006214","doi":"10.1109/tit.2012.2210190","title":"Outage Probability Under Channel Distribution Uncertainty","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"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 Ottawa","funders":"","keywords":"Probability distribution; Mathematics; Fading; Channel (broadcasting); Entropy (arrow of time); Channel capacity; Statistics; Probability density function; Outage probability; Computer science; Telecommunications; Physics; Coding (social sciences); Decoding methods","score_opus":0.010613787694624507,"score_gpt":0.21289546155257033,"score_spread":0.20228167385794582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045006214","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.0036022859,0.00002166648,0.9919171,0.000019421366,0.0012416816,0.00039904504,0.00018719971,0.0006330806,0.001978557],"genre_scores_gemma":[0.9990477,0.000015288702,0.0004711258,0.00006610831,0.000047551803,0.00013514217,0.00012190475,0.000016180355,0.0000790202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991184,0.00005540044,0.000352956,0.0000662161,0.00013651431,0.00027050395],"domain_scores_gemma":[0.99945575,0.00007383187,0.00006000894,0.0002377467,0.00007520673,0.00009748198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039675055,0.00016160082,0.00012070498,0.000096425894,0.00014831437,0.0000301623,0.00007593417,0.00011661489,0.0001060487],"category_scores_gemma":[0.000010138013,0.00016062988,0.00006688672,0.00022041696,0.000039311242,0.0022488118,6.1617635e-7,0.00018708843,0.00033709436],"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.000025129406,0.000031349045,0.0000015125614,0.000059904214,0.000020789255,1.9378321e-8,0.00087754976,0.986714,0.000046339628,0.005399052,0.00007728518,0.0067470516],"study_design_scores_gemma":[0.0027921272,0.00017573783,0.00043927142,0.00020420036,0.00017108505,0.00004819647,0.0054643964,0.8938855,0.059996117,0.024754023,0.010168239,0.0019010928],"about_ca_topic_score_codex":0.000003474592,"about_ca_topic_score_gemma":0.0000022561699,"teacher_disagreement_score":0.9954454,"about_ca_system_score_codex":0.00035912215,"about_ca_system_score_gemma":0.000012388801,"threshold_uncertainty_score":0.6550296},"labels":[],"label_agreement":null},{"id":"W2045522120","doi":"10.1109/tit.2013.2248031","title":"New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Royal Society","keywords":"Chromatic scale; Projective test; Mathematics; Quantum entanglement; Quantum; Quantum channel; Zero (linguistics); Discrete mathematics; Graph; Channel (broadcasting); Exponential function; Graph coloring; Combinatorics; Pure mathematics; Computer science; Quantum mechanics; Physics; Mathematical analysis; Telecommunications","score_opus":0.018569233742588204,"score_gpt":0.2447287314144044,"score_spread":0.2261594976718162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045522120","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.077942915,0.000009990453,0.91930795,0.00047885536,0.00045019537,0.00049418036,0.000009626449,0.00019193384,0.001114332],"genre_scores_gemma":[0.9743896,0.000008957897,0.024934703,0.00044693195,0.000023236767,0.00009481447,0.0000022419797,0.0000076133338,0.00009189887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.00010784202,0.00035668616,0.00021378206,0.00020877826,0.0002786425],"domain_scores_gemma":[0.99924135,0.00017086249,0.00011681016,0.00028682844,0.00009012902,0.00009401328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767519,0.0001905143,0.00016706444,0.00027660694,0.0003234652,0.00023831334,0.00026257374,0.00009624951,0.000027509006],"category_scores_gemma":[0.000011430029,0.00017269432,0.000057688096,0.00048892485,0.000059167418,0.0028486676,0.0000072996054,0.00037923647,0.00013485595],"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.00008730177,0.0002776632,0.00001825528,0.00009709529,0.00011841921,0.000003045661,0.15166059,0.35915753,0.00030563804,0.26104343,0.0013260394,0.22590499],"study_design_scores_gemma":[0.0007325381,0.00017098169,0.0009482208,0.000069965885,0.000008012338,0.000038739305,0.00075562194,0.83720076,0.0027075952,0.15672714,0.00031515272,0.0003252854],"about_ca_topic_score_codex":0.0003126472,"about_ca_topic_score_gemma":0.00002490724,"teacher_disagreement_score":0.8964467,"about_ca_system_score_codex":0.00007314252,"about_ca_system_score_gemma":0.00009111847,"threshold_uncertainty_score":0.704227},"labels":[],"label_agreement":null},{"id":"W2048309032","doi":"10.1109/tit.2015.2417875","title":"Degrees of Freedom of MIMO Cellular Networks: Decomposition and Linear Beamforming Design","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":41,"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":"Beamforming; MIMO; Interference (communication); Degrees of freedom (physics and chemistry); Cellular network; Computer science; Spectral efficiency; Topology (electrical circuits); Zero-forcing precoding; Antenna (radio); Algorithm; Control theory (sociology); Mathematics; Precoding; Telecommunications; Artificial intelligence; Physics; Combinatorics","score_opus":0.013187863823541687,"score_gpt":0.21711590994507113,"score_spread":0.20392804612152943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048309032","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.0041546645,0.00010825184,0.9946647,0.0000019450838,0.00033698327,0.00024874872,0.000016635324,0.000111514375,0.0003565507],"genre_scores_gemma":[0.9269941,0.000053880383,0.07287314,0.000004498368,0.000017968394,0.000020029105,0.000012153503,0.000014154122,0.000010097475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992508,0.00004581534,0.00044027512,0.000049646973,0.00011217868,0.00010123193],"domain_scores_gemma":[0.99943614,0.00011060866,0.00012309165,0.00013900739,0.00013450858,0.000056662902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035769193,0.00011130355,0.00015746424,0.00021596902,0.000042100775,0.000009152658,0.00006140533,0.0000883228,0.000008742095],"category_scores_gemma":[0.000008210035,0.00011560605,0.000036499077,0.00017305776,0.000048670336,0.0009958809,7.351133e-7,0.00009364976,0.0000060991065],"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.00006732623,0.0000120297045,0.0000016888766,0.00007363304,0.000026593947,7.688281e-8,0.0010840936,0.9926389,0.0008604086,0.00042196622,0.000015016704,0.00479826],"study_design_scores_gemma":[0.0004711919,0.00008741873,0.0000031225527,0.00008077225,0.000027208489,0.0000047985523,0.0005931652,0.9527539,0.045676418,0.00016564158,0.000031901236,0.00010444892],"about_ca_topic_score_codex":0.0000065122504,"about_ca_topic_score_gemma":0.0000015258569,"teacher_disagreement_score":0.9228394,"about_ca_system_score_codex":0.00004788169,"about_ca_system_score_gemma":0.000015261536,"threshold_uncertainty_score":0.4714278},"labels":[],"label_agreement":null},{"id":"W2049608049","doi":"10.1109/tit.2006.887467","title":"On Designing Good LDPC Codes for Markov Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Low-density parity-check code; Markov chain; Decoding methods; Computer science; Schedule; Channel (broadcasting); Algorithm; Block (permutation group theory); Markov process; Code (set theory); Message passing; Theoretical computer science; Mathematics; Parallel computing; Telecommunications; Combinatorics; Set (abstract data type); Statistics","score_opus":0.01377970465499197,"score_gpt":0.2608090091921903,"score_spread":0.24702930453719832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049608049","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.0012470165,0.0000037675777,0.9889797,0.00010833112,0.0013080675,0.00051092415,0.0000100977595,0.0010444496,0.00678766],"genre_scores_gemma":[0.9104233,0.0000035193775,0.088093236,0.0010209198,0.00003148535,0.00011767084,0.0000029818455,0.000012907896,0.0002939909],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987709,0.000069316615,0.0004021517,0.00017165196,0.00026646166,0.0003195406],"domain_scores_gemma":[0.9979697,0.0012054641,0.00016635988,0.0004241692,0.0001532032,0.00008112426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095659,0.00017614693,0.00013843924,0.00052889745,0.0003778965,0.00015418287,0.0004867803,0.00011610796,0.000020419402],"category_scores_gemma":[0.000047730686,0.0001737961,0.00011929404,0.00036393767,0.000036615373,0.0015843897,0.0000024728467,0.00024020995,0.0001008234],"study_design_candidate":"bench_or_experimental","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.00039068703,0.00015222577,0.0000015823334,0.0000657705,0.000050334093,0.0000014511556,0.0062460345,0.012927732,0.0010024566,0.26052433,0.00095354737,0.71768385],"study_design_scores_gemma":[0.0010608594,0.00111133,0.000028290193,0.00020170464,0.000027925551,0.00003789762,0.0007186323,0.06308511,0.843153,0.08701486,0.0028781127,0.0006822786],"about_ca_topic_score_codex":0.000004780616,"about_ca_topic_score_gemma":0.0000039334595,"teacher_disagreement_score":0.9091763,"about_ca_system_score_codex":0.00012756232,"about_ca_system_score_gemma":0.00004424448,"threshold_uncertainty_score":0.7087199},"labels":[],"label_agreement":null},{"id":"W2049758775","doi":"10.1109/18.930940","title":"Self-dual codes over F/sub p/ and weighing matrices","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"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 Victoria","funders":"","keywords":"Dual (grammatical number); Hadamard transform; Block code; Mathematics; Linear code; Combinatorics; Hadamard matrix; Discrete mathematics; Computer science; Algorithm; Decoding methods","score_opus":0.003995417545620764,"score_gpt":0.18270862499340998,"score_spread":0.1787132074477892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049758775","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.42435738,0.0001407295,0.55891,0.000011877908,0.00092646596,0.00019157062,0.000031958174,0.00085514353,0.014574844],"genre_scores_gemma":[0.99924064,0.00039273687,0.00015391098,0.00007866936,0.000033181463,0.00003172189,0.0000035494147,0.000012728146,0.000052856307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993431,0.000049434442,0.00025878672,0.00006235716,0.00012820696,0.00015814275],"domain_scores_gemma":[0.9996251,0.000117824406,0.00003909755,0.00013313782,0.000023034201,0.00006181226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031741205,0.00013591204,0.00011242835,0.00023879232,0.00017959514,0.00008865958,0.000060626564,0.000085112726,0.00010463678],"category_scores_gemma":[0.0000016615235,0.0001305872,0.000051226412,0.00020148934,0.000028927421,0.0013001056,5.0739305e-7,0.00016282918,0.00016266256],"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.00078602374,0.00029643002,0.0001445513,0.0018866324,0.0012690384,0.000020852687,0.043429483,0.3215328,0.006074376,0.2297712,0.0017718705,0.39301676],"study_design_scores_gemma":[0.008442373,0.0007285233,0.0015985983,0.00080873934,0.0007737817,0.0011248355,0.019877162,0.46928778,0.20189975,0.06662716,0.22439496,0.004436341],"about_ca_topic_score_codex":0.0000025227525,"about_ca_topic_score_gemma":0.000002493963,"teacher_disagreement_score":0.5748833,"about_ca_system_score_codex":0.000032521606,"about_ca_system_score_gemma":0.0000060299576,"threshold_uncertainty_score":0.53251916},"labels":[],"label_agreement":null},{"id":"W2051655994","doi":"10.1109/tit.2012.2184076","title":"Erratum to “On Delayed Sequential Coding of Correlated Sources” [Jun 11 3763-3782]","year":2012,"lang":"en","type":"erratum","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Lemma (botany); Computer science; Coding (social sciences); Algorithm; Mathematics; Statistics","score_opus":0.012723183991158746,"score_gpt":0.23563188304602561,"score_spread":0.22290869905486688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051655994","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.00082072074,0.00014270065,0.92413574,0.00007354674,0.015883658,0.00086485856,0.00058482756,0.0017853939,0.05570855],"genre_scores_gemma":[0.98871416,0.00072178565,0.001046398,0.0004366629,0.0002255711,0.00034941747,0.00071641424,0.00016845329,0.0076211477],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975101,0.00018956108,0.0011425504,0.00016826208,0.0005602236,0.00042933063],"domain_scores_gemma":[0.9978644,0.00020715034,0.00035633976,0.0011131944,0.00026340413,0.00019546757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065270066,0.00052372366,0.00054345326,0.0013456818,0.00022712733,0.0000922155,0.00073154573,0.00095092406,0.0004602456],"category_scores_gemma":[0.000020966176,0.00058689894,0.00027781562,0.0006208147,0.00010054521,0.0009924178,0.000007710034,0.0018223752,0.00053388055],"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.00047871054,0.00029829083,0.0000011379062,0.0011678005,0.0008086182,0.0000015394994,0.017747998,0.19573742,0.0009854337,0.012450024,0.7330047,0.037318315],"study_design_scores_gemma":[0.0016718796,0.0006128307,0.00003167804,0.0028743239,0.0006492201,0.00004783008,0.0019501798,0.05420258,0.11669705,0.0017805235,0.8165062,0.0029756804],"about_ca_topic_score_codex":0.000037948994,"about_ca_topic_score_gemma":0.000026440033,"teacher_disagreement_score":0.9878934,"about_ca_system_score_codex":0.0003714276,"about_ca_system_score_gemma":0.000094910116,"threshold_uncertainty_score":0.9996582},"labels":[],"label_agreement":null},{"id":"W2052423140","doi":"10.1109/tit.2013.2253512","title":"Hierarchical and High-Girth QC LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":49,"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":"Low-density parity-check code; Circulant matrix; Block code; Code (set theory); Parity-check matrix; Hierarchy; Linear code; Concatenated error correction code; Turbo code","score_opus":0.006841640311332939,"score_gpt":0.21768916800015495,"score_spread":0.210847527688822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052423140","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.018805152,0.0000055503906,0.97644836,0.00055638776,0.00041027687,0.00026483665,0.0000063574034,0.0007961221,0.0027069487],"genre_scores_gemma":[0.96431947,0.00001893216,0.034405693,0.00093693275,0.000013220113,0.00010536106,0.0000018252025,0.00000634792,0.00019219056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990586,0.00011075369,0.00028328932,0.00014150486,0.00021401573,0.00019180609],"domain_scores_gemma":[0.9990398,0.00029331289,0.00008450479,0.00038585628,0.00010190342,0.000094576135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003808411,0.00013647371,0.00011949288,0.00028781508,0.0002417039,0.00024749016,0.00035683892,0.00008711596,0.0001047396],"category_scores_gemma":[0.000016262205,0.00012327511,0.000046250283,0.00024628468,0.000089024135,0.0027266315,0.000005237892,0.00029479404,0.00036061436],"study_design_candidate":"design_other","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.000023565284,0.000063331165,0.000009808363,0.000029963947,0.000024804951,5.91194e-7,0.0034331537,0.0008955634,0.00036828071,0.18333325,0.0008886547,0.810929],"study_design_scores_gemma":[0.0019102485,0.0011159651,0.0038634094,0.00020481621,0.00004238883,0.00023208292,0.0010766496,0.26513484,0.16031778,0.55783314,0.0066164765,0.0016522148],"about_ca_topic_score_codex":0.00005623856,"about_ca_topic_score_gemma":0.0000054731468,"teacher_disagreement_score":0.9455143,"about_ca_system_score_codex":0.000041045234,"about_ca_system_score_gemma":0.000033385495,"threshold_uncertainty_score":0.50270134},"labels":[],"label_agreement":null},{"id":"W2053024959","doi":"10.1109/tit.2004.842778","title":"Polyphase Sequences With Low Autocorrelation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polyphase system; Maxima and minima; Autocorrelation; Mathematics; Sequence (biology); Autocorrelation matrix; Complementary sequences; Base (topology); Algorithm; Energy (signal processing); Combinatorics; Discrete mathematics; Mathematical analysis; Statistics; Physics","score_opus":0.0054742164771853724,"score_gpt":0.2073840663128367,"score_spread":0.20190984983565133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053024959","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.0065619997,0.0000064639858,0.9858391,0.00035966112,0.00025767615,0.00019473028,0.000006501891,0.00041318618,0.0063606715],"genre_scores_gemma":[0.98874795,0.0000048253037,0.01008142,0.0009153798,0.000024452731,0.000055966888,0.0000024357926,0.0000043964546,0.00016318513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991514,0.00008346261,0.00023756466,0.00012157174,0.00023638751,0.00016960001],"domain_scores_gemma":[0.99928534,0.00012888231,0.0001045048,0.00033968853,0.000069313,0.00007226505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039992976,0.00012895974,0.00008317884,0.00034230933,0.0003146834,0.00016763149,0.00032679117,0.00005740798,0.00014829285],"category_scores_gemma":[0.000003052055,0.00010589204,0.00006988101,0.0005050809,0.00007465006,0.0040822253,0.0000011727302,0.00017562567,0.00041597377],"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.00013602516,0.00008108745,0.000002632841,0.000010053099,0.000026373578,6.285648e-7,0.002794329,0.07223192,0.000066992274,0.361177,0.000053915195,0.56341904],"study_design_scores_gemma":[0.0065968316,0.002527437,0.00054388324,0.00045748375,0.00014631326,0.0003535077,0.0019861604,0.60851,0.16649204,0.16995482,0.03993253,0.002498942],"about_ca_topic_score_codex":0.0000024667672,"about_ca_topic_score_gemma":0.0000034950215,"teacher_disagreement_score":0.98218596,"about_ca_system_score_codex":0.000043500982,"about_ca_system_score_gemma":0.00005577301,"threshold_uncertainty_score":0.534664},"labels":[],"label_agreement":null},{"id":"W2055113639","doi":"10.1109/tit.2014.2310467","title":"Grassmannian Signalling Achieves Tight Bounds on the Ergodic High-SNR Capacity of the Noncoherent MIMO Full-Duplex Relay Channel","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":12,"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":"Relay; Topology (electrical circuits); MIMO; Upper and lower bounds; Relay channel; Rayleigh fading; Mathematics; Ergodic theory; Channel (broadcasting); Grassmannian; Decoding methods; Fading; Channel capacity; Telecommunications; Computer science; Control theory (sociology); Power (physics); Combinatorics; Mathematical analysis; Physics","score_opus":0.011285040608631515,"score_gpt":0.18560483043597595,"score_spread":0.17431978982734445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055113639","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.5600593,0.000014332965,0.4368775,0.00052218355,0.0007285865,0.00038672573,0.00006964042,0.00023534319,0.0011063673],"genre_scores_gemma":[0.9989175,0.000049314218,0.00033002417,0.00027576307,0.00004253154,0.00019301409,0.0000138061605,0.000033726403,0.00014430501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828947,0.0003083841,0.00061943446,0.00011792913,0.00039185953,0.00027292018],"domain_scores_gemma":[0.9978097,0.0007679597,0.00019514006,0.0010374582,0.000115983385,0.00007375996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068337854,0.00027655554,0.00022421985,0.00021935822,0.0006828641,0.00008321968,0.00077319785,0.0001647098,0.0001713038],"category_scores_gemma":[0.000032970616,0.00018729737,0.00020788031,0.0004250235,0.00024451796,0.00054474146,0.0000057586194,0.0007655301,0.00020332648],"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.000042707976,0.000060582046,0.0000010130095,0.000051720006,0.000078683,2.793052e-8,0.002317473,0.9734139,0.0030139638,0.017851073,0.00025436736,0.002914524],"study_design_scores_gemma":[0.0007102002,0.0001781655,0.0005031879,0.00026430193,0.00009352529,0.000007038749,0.0008501475,0.91249645,0.078873366,0.0006092022,0.004975559,0.00043887677],"about_ca_topic_score_codex":0.000032761927,"about_ca_topic_score_gemma":0.00008111903,"teacher_disagreement_score":0.43885818,"about_ca_system_score_codex":0.00015520604,"about_ca_system_score_gemma":0.000033097345,"threshold_uncertainty_score":0.7637765},"labels":[],"label_agreement":null},{"id":"W2056654970","doi":"10.1109/tit.2004.831853","title":"On Skew Information","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":96,"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":"Skew; Commutator; Measure (data warehouse); Observable; Relation (database); Uncertainty principle; Mutual information; Extension (predicate logic); Mathematics; Computer science; Variance (accounting); Quantum; Statistical physics; Statistics; Pure mathematics; Data mining; Algebra over a field; Quantum mechanics; Physics; Telecommunications","score_opus":0.005274115473889611,"score_gpt":0.21547663778023862,"score_spread":0.210202522306349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056654970","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.010824086,7.145527e-7,0.9661277,0.00023083662,0.00030787164,0.00027485544,0.00015475128,0.000101713675,0.021977479],"genre_scores_gemma":[0.9985277,0.0000023299506,0.0003072463,0.0008297562,0.00003126001,0.0001573915,0.000071099006,0.0000069801827,0.00006623731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992236,0.00001855756,0.00033239793,0.00006940063,0.00019216155,0.00016391453],"domain_scores_gemma":[0.99940073,0.000057034824,0.00012911028,0.0002601246,0.00007903596,0.000073979776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017562142,0.00013933753,0.00009400107,0.00020116077,0.0003141801,0.00009854052,0.0001303454,0.00004746868,0.00077743933],"category_scores_gemma":[0.0000018845747,0.00013130401,0.00010223199,0.00021677172,0.000024804072,0.0014882892,8.0045123e-7,0.00020887154,0.0039065434],"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.00003148033,0.000074738455,2.0188449e-7,0.0000050323815,0.000019767105,1.963985e-8,0.00053006626,0.013502669,0.000017372668,0.9261811,0.000135249,0.059502337],"study_design_scores_gemma":[0.0011024328,0.0001245089,0.000015462834,0.00003424818,0.00002338085,0.0000011572946,0.0006793468,0.0013188585,0.01644334,0.9677965,0.012221408,0.0002393655],"about_ca_topic_score_codex":0.000023158482,"about_ca_topic_score_gemma":5.210585e-7,"teacher_disagreement_score":0.9877036,"about_ca_system_score_codex":0.000057594345,"about_ca_system_score_gemma":0.00006260433,"threshold_uncertainty_score":0.996869},"labels":[],"label_agreement":null},{"id":"W2057397262","doi":"10.1109/tit.2011.2170918","title":"Large Deviations for Re-Sequencing Buffer Size","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Interconnection Networks and Systems","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":"Carleton University","funders":"","keywords":"Computer science; Limit (mathematics); Network packet; Algorithm; Mathematics; Computer network","score_opus":0.02783067493420179,"score_gpt":0.23097838903289905,"score_spread":0.20314771409869725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057397262","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.00075253204,0.0000075886965,0.9828659,0.000073863324,0.0019099244,0.0003744453,0.000028702198,0.0002715203,0.013715473],"genre_scores_gemma":[0.99317116,0.000008274128,0.0045908606,0.0011707473,0.00004813586,0.00021865594,0.0000028261427,0.000007940282,0.000781394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989432,0.00008489495,0.00043293255,0.00013466741,0.00015712286,0.0002471587],"domain_scores_gemma":[0.9988815,0.00032107774,0.0001451397,0.00037591107,0.00020732258,0.000069005684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007959149,0.00012877416,0.00012530519,0.00018059656,0.00044289313,0.00011602,0.00032711786,0.00009610486,0.00028944906],"category_scores_gemma":[0.000027104023,0.00011827148,0.00014305527,0.00022286896,0.000019418432,0.0022045088,0.000001916146,0.00013998043,0.0002692299],"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.000072586336,0.000069255846,0.000001989197,0.00003847997,0.000060913626,4.073604e-7,0.021077674,0.00267559,0.00005764018,0.96327543,0.0017593419,0.010910681],"study_design_scores_gemma":[0.004864825,0.0012007912,0.00023687452,0.00032023736,0.00012361909,0.000106023566,0.012921966,0.55085903,0.058637347,0.27411792,0.094779775,0.0018316098],"about_ca_topic_score_codex":0.000011544448,"about_ca_topic_score_gemma":0.00001494061,"teacher_disagreement_score":0.99241865,"about_ca_system_score_codex":0.000113425456,"about_ca_system_score_gemma":0.00006296843,"threshold_uncertainty_score":0.4822971},"labels":[],"label_agreement":null},{"id":"W2058936451","doi":"10.1109/tit.2006.872849","title":"Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":156,"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":"Quantization (signal processing); Sigma; Mathematics; Norm (philosophy); Upper and lower bounds; Mean squared error; Delta-sigma modulation; Combinatorics; Physics; Algorithm; Mathematical analysis; Statistics; Quantum mechanics","score_opus":0.009930336720268619,"score_gpt":0.23858862365839986,"score_spread":0.22865828693813126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058936451","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.002149384,0.00006123917,0.9936622,0.00018137442,0.0005609161,0.00019799403,0.000024679664,0.00029877064,0.0028634912],"genre_scores_gemma":[0.93961054,0.000054270888,0.058145322,0.0014399526,0.000055301676,0.00003355583,0.000024824625,0.000014369818,0.0006218866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851614,0.00024236654,0.0004743111,0.00019941563,0.00031958043,0.0002482016],"domain_scores_gemma":[0.9988122,0.00039399488,0.00016172181,0.00039581282,0.00016534126,0.00007090435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008552307,0.00019748871,0.00016897319,0.00041267084,0.0004413185,0.00043785616,0.0003147778,0.00013410715,0.0000578307],"category_scores_gemma":[0.000031548618,0.00018839582,0.000085247535,0.00051039323,0.00008977687,0.00335772,0.0000045304478,0.00024306391,0.000096523865],"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.00019873428,0.00017458451,0.000016265834,0.00009759745,0.000053767344,0.0000057781135,0.0036643348,0.24661034,0.00085177756,0.29856426,0.00092328596,0.44883928],"study_design_scores_gemma":[0.002085152,0.00030283802,0.00040522416,0.00011316093,0.00006635098,0.000055683784,0.0003131957,0.83217114,0.06677075,0.08558915,0.0113238795,0.0008034665],"about_ca_topic_score_codex":0.000055791224,"about_ca_topic_score_gemma":0.0000072414455,"teacher_disagreement_score":0.93746114,"about_ca_system_score_codex":0.00004156713,"about_ca_system_score_gemma":0.00005692072,"threshold_uncertainty_score":0.7682559},"labels":[],"label_agreement":null},{"id":"W2059207464","doi":"10.1109/tit.2015.2412540","title":"Broadcasting Correlated Vector Gaussians","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":21,"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":"Bounding overwatch; Upper and lower bounds; Gaussian; Covariance; Scalar (mathematics); Distortion (music); Algorithm; Mathematics; Computer science; Constraint (computer-aided design); Fading; Bandwidth (computing); Mathematical optimization; Telecommunications; Decoding methods; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.016713693477197186,"score_gpt":0.22503294228414358,"score_spread":0.2083192488069464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059207464","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.0055403356,0.000033853103,0.96216094,0.000057668225,0.0005178358,0.00018176262,0.00002652484,0.0020446568,0.02943644],"genre_scores_gemma":[0.9978124,0.000037328147,0.0017962798,0.00013938107,0.000014022583,0.000066714965,0.000015514472,0.000021201633,0.000097184224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991975,0.00006319748,0.00034010323,0.000054302564,0.0001876112,0.00015731472],"domain_scores_gemma":[0.9992734,0.00010267665,0.00005268458,0.0003628148,0.000103870836,0.000104518804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034597906,0.00013613717,0.00011291885,0.00024980758,0.00010110975,0.00006150082,0.00020742595,0.00011763878,0.00011329421],"category_scores_gemma":[0.000015207226,0.00014545479,0.000052319567,0.00028282782,0.000043275642,0.0010751579,0.0000011535957,0.00035163472,0.00065438513],"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.000153837,0.00011618474,0.0000055167116,0.00011039975,0.00014806232,0.0000016893046,0.02059593,0.6512041,0.00080833526,0.025689648,0.006488343,0.29467797],"study_design_scores_gemma":[0.0025545713,0.00029819776,0.00011601419,0.00031649592,0.0000960918,0.00010731398,0.0053331247,0.73416597,0.17143916,0.009204069,0.07493026,0.0014387531],"about_ca_topic_score_codex":0.0000068794566,"about_ca_topic_score_gemma":0.0000026038624,"teacher_disagreement_score":0.992272,"about_ca_system_score_codex":0.00015335782,"about_ca_system_score_gemma":0.00002947943,"threshold_uncertainty_score":0.8411015},"labels":[],"label_agreement":null},{"id":"W2062185918","doi":"10.1109/tit.2014.2308998","title":"A Geometric Perspective to Multiple-Unicast Network Coding","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"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 Calgary","funders":"","keywords":"Unicast; Conjecture; Linear network coding; Computer science; Mathematical proof; Coding (social sciences); Theoretical computer science; Graph theory; Graph; Mathematics; Discrete mathematics; Combinatorics; Multicast; Distributed computing; Computer network","score_opus":0.019479413173209274,"score_gpt":0.25567090724635516,"score_spread":0.23619149407314588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062185918","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.0003642219,0.000023428991,0.98271483,0.00092562346,0.0005621659,0.00027069362,0.0000034009659,0.00029699187,0.014838646],"genre_scores_gemma":[0.9826821,0.00008498721,0.013944558,0.0029533803,0.00005316646,0.000071869545,0.0000017180895,0.0000074397058,0.00020078867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986966,0.00028996516,0.0003327184,0.00017467466,0.00023619487,0.00026980898],"domain_scores_gemma":[0.99789715,0.00080001075,0.00010407673,0.00074339955,0.00030967203,0.0001456872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010318207,0.00015489508,0.00015249714,0.00053656165,0.0006302056,0.00024135526,0.00078722154,0.00005839544,0.000079678146],"category_scores_gemma":[0.000119430246,0.00015198527,0.000088716326,0.001803016,0.00003807167,0.0014159757,0.000014568373,0.0002777264,0.00070634414],"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.00004196344,0.000046799087,0.00000400449,0.0000048350366,0.000027697575,1.3441955e-7,0.0039587677,0.12654409,0.000038005302,0.46284798,0.0007658149,0.4057199],"study_design_scores_gemma":[0.0020326325,0.00059410254,0.000869122,0.00018589225,0.000031241674,0.000026830436,0.0014258038,0.8904658,0.0047967527,0.012565778,0.085944556,0.0010614949],"about_ca_topic_score_codex":0.0000041721787,"about_ca_topic_score_gemma":0.000013260401,"teacher_disagreement_score":0.98231786,"about_ca_system_score_codex":0.00018710471,"about_ca_system_score_gemma":0.00003897803,"threshold_uncertainty_score":0.9078861},"labels":[],"label_agreement":null},{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"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":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","score_opus":0.01790983207713149,"score_gpt":0.23509185783253725,"score_spread":0.21718202575540577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062610219","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.00085504545,0.000025191364,0.99155426,0.000529199,0.0002730726,0.00035502788,0.00004832701,0.0007273623,0.0056324885],"genre_scores_gemma":[0.9980506,0.0001160287,0.0010316155,0.0005413071,0.000017097287,0.00018718556,0.0000066226653,0.000008748274,0.000040837433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941367,0.000029282013,0.0002631932,0.000049358296,0.000099646524,0.00014484584],"domain_scores_gemma":[0.99922264,0.00020572281,0.000043713495,0.000423235,0.0000682246,0.00003645203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033126527,0.00012072617,0.00009130211,0.00014243707,0.0002576296,0.00008829095,0.00032941444,0.00008048855,0.000044394583],"category_scores_gemma":[0.000007684526,0.00009884317,0.00007907436,0.00014850147,0.000057122645,0.0007952858,6.165681e-7,0.0002578593,0.000049008566],"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.00016908837,0.000108188935,2.7099128e-7,0.000102250284,0.00011777053,8.2476184e-8,0.01565024,0.110613115,0.00084845943,0.17837752,0.0029445023,0.6910685],"study_design_scores_gemma":[0.0011826815,0.0004559861,0.0002517491,0.0001995579,0.000092756185,0.00002423136,0.002175397,0.5821549,0.25095493,0.11607046,0.045510713,0.0009266047],"about_ca_topic_score_codex":0.0000030574847,"about_ca_topic_score_gemma":0.0000057752677,"teacher_disagreement_score":0.9971955,"about_ca_system_score_codex":0.000074325035,"about_ca_system_score_gemma":0.000010797298,"threshold_uncertainty_score":0.40307075},"labels":[],"label_agreement":null},{"id":"W2065060855","doi":"10.1109/tit.2013.2295392","title":"A Universal Grammar-Based Code for Lossless Compression of Binary Trees","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":28,"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":"Code word; Lossless compression; Binary tree; Computer science; Theoretical computer science; Random binary tree; K-ary tree; Binary number; Binary code; Mathematics; Algorithm; Decoding methods; Data compression; Tree structure; Arithmetic","score_opus":0.01103379855174834,"score_gpt":0.23154011697648408,"score_spread":0.22050631842473573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065060855","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.0025927362,0.00000474412,0.99589556,0.00010198137,0.00047643768,0.00024582376,0.00016429258,0.00013921158,0.00037920423],"genre_scores_gemma":[0.965326,0.0000037910236,0.03427626,0.00023428218,0.000016251824,0.00003650814,0.00003488136,0.0000064356896,0.00006559391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990865,0.00010010459,0.00030775313,0.00012892851,0.0002251761,0.00015152516],"domain_scores_gemma":[0.9987678,0.0003948898,0.0001819135,0.00044966568,0.00013828254,0.00006747643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003888402,0.00012434149,0.00014989197,0.0002622992,0.00023289541,0.0000572944,0.00044365507,0.000076894605,0.000023803612],"category_scores_gemma":[0.0000083296445,0.000106481544,0.00010315936,0.00020353531,0.000069228176,0.0015324465,0.0000045564143,0.000103870116,0.000020948944],"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.00073319825,0.0003409655,0.0000041537073,0.00015002747,0.000037264737,3.9874715e-7,0.0011803292,0.23975776,0.0021388805,0.103331275,0.0009450083,0.6513807],"study_design_scores_gemma":[0.001601054,0.00041500223,0.00008796972,0.000095717776,0.000015339585,0.0000017197691,0.00011086004,0.95278347,0.030740125,0.0036054943,0.010370223,0.00017300976],"about_ca_topic_score_codex":0.000008032273,"about_ca_topic_score_gemma":0.0000028542415,"teacher_disagreement_score":0.96273327,"about_ca_system_score_codex":0.00003028876,"about_ca_system_score_gemma":0.000054810334,"threshold_uncertainty_score":0.43421915},"labels":[],"label_agreement":null},{"id":"W2065071321","doi":"10.1109/tit.2007.913230","title":"Multicast Capacity of Packet-Switched Ring WDM Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Multicast; Computer network; Computer science; Protocol Independent Multicast; Source-specific multicast; Xcast; Unicast; Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Throughput; IP multicast; Distributed computing; Telecommunications","score_opus":0.013116982062856995,"score_gpt":0.2018120230868199,"score_spread":0.1886950410239629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065071321","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.07611384,0.000018410306,0.920137,0.000009951884,0.00033239266,0.00014710892,0.000012383778,0.0007961835,0.0024327254],"genre_scores_gemma":[0.9842586,0.00015916994,0.015464444,0.0000339144,0.00001573211,0.00003211935,0.0000026118284,0.000015600659,0.00001783506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917924,0.000017708413,0.00037621535,0.00006621452,0.00013949435,0.00022110151],"domain_scores_gemma":[0.99937713,0.00019414982,0.00005416854,0.00026462218,0.000059500813,0.00005042244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012511786,0.00015019813,0.0001718285,0.00016728342,0.00012013064,0.000008428852,0.00013579945,0.00015244774,0.000052608062],"category_scores_gemma":[0.00001738728,0.00014869956,0.00007735724,0.0002814001,0.00018298803,0.0007086994,0.0000012227474,0.0003727267,0.000067708585],"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.000030525065,0.000018360748,0.000003794391,0.000028502007,0.00003202259,5.192262e-7,0.0004327982,0.94851744,0.00022080123,0.0031856108,0.000025069256,0.047504544],"study_design_scores_gemma":[0.0009282563,0.00010213481,0.00045003084,0.00009082351,0.000036523295,0.00004020071,0.0006900229,0.9331848,0.06003057,0.003425299,0.00053742086,0.00048391108],"about_ca_topic_score_codex":0.0000015520661,"about_ca_topic_score_gemma":0.0000022744646,"teacher_disagreement_score":0.9081447,"about_ca_system_score_codex":0.00006777508,"about_ca_system_score_gemma":0.000006563261,"threshold_uncertainty_score":0.6063792},"labels":[],"label_agreement":null},{"id":"W2065435360","doi":"10.1109/tit.2014.2353514","title":"The Streaming-DMT of Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"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":"Fading; Computer science; Decoding methods; Interleaving; Encoder; Algorithm; Coherence time; Channel (broadcasting); Multiplexing; Transmission (telecommunications); Coherence (philosophical gambling strategy); Coding (social sciences); Theoretical computer science; Computer network; Mathematics; Telecommunications","score_opus":0.015299571683865755,"score_gpt":0.23978530056035957,"score_spread":0.22448572887649382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065435360","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.000980864,0.0000215097,0.9900956,0.00037986986,0.00050883734,0.00010131956,0.000001356616,0.00008592175,0.007824702],"genre_scores_gemma":[0.99827605,0.00015432022,0.0010075022,0.0003011225,0.000013885411,0.000023579385,8.4408725e-7,0.0000028404738,0.00021987461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919593,0.00018757662,0.00028122764,0.0000621445,0.00015329893,0.000119847355],"domain_scores_gemma":[0.9986014,0.00058609573,0.00012739337,0.0005196694,0.00013023819,0.00003522416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008639951,0.00007804164,0.000078008,0.00011366786,0.0005235228,0.000121015255,0.0006050146,0.00003113729,0.000020699836],"category_scores_gemma":[0.000024110093,0.0000578858,0.00005720266,0.00029152512,0.000063820145,0.000920589,0.000005040827,0.00013852191,0.000070559196],"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.000008746255,0.000013299047,4.4445025e-7,0.0000042002443,0.000011228221,1.1769907e-8,0.00226581,0.016044328,0.00008123373,0.3195241,0.0000775984,0.661969],"study_design_scores_gemma":[0.00087457825,0.00025862074,0.00012156997,0.00011985364,0.000016105236,0.00000869912,0.0007629302,0.8517243,0.061968572,0.02241027,0.061358426,0.00037606314],"about_ca_topic_score_codex":9.716313e-7,"about_ca_topic_score_gemma":0.0000024432081,"teacher_disagreement_score":0.99729514,"about_ca_system_score_codex":0.000024305107,"about_ca_system_score_gemma":0.00002247179,"threshold_uncertainty_score":0.40265667},"labels":[],"label_agreement":null},{"id":"W2067232511","doi":"10.1109/tit.2014.2346079","title":"Communication Over Finite-Chain-Ring Matrix Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"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":"Linear network coding; Finite field; Coding (social sciences); Channel code; Channel capacity; Channel (broadcasting); Finite set; Variable-length code; Transfer matrix","score_opus":0.017279621352189405,"score_gpt":0.2591361980510234,"score_spread":0.24185657669883398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067232511","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.00096991303,0.00004652541,0.98789495,0.0006364955,0.00047390015,0.0001837884,0.0000029741527,0.0003338622,0.009457594],"genre_scores_gemma":[0.99240506,0.00026564018,0.00524953,0.0014217126,0.000023369177,0.000064644635,0.000007476659,0.000007887213,0.0005546931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987142,0.0003771549,0.0003804887,0.00012224296,0.00021792737,0.00018800075],"domain_scores_gemma":[0.99787134,0.00067131897,0.00015268585,0.0010809203,0.00014662757,0.00007709389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010545277,0.00014769164,0.00012844731,0.00029967216,0.00061933225,0.00028291708,0.00089298515,0.000074262076,0.00016043837],"category_scores_gemma":[0.00003610122,0.00014722484,0.00008176115,0.00044882623,0.00005560711,0.00215627,0.000014328206,0.00030320755,0.0004735067],"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.000022388958,0.00005846426,0.0000018698072,0.000013417088,0.000021889939,6.7040496e-8,0.0042590764,0.09166354,0.00007646378,0.54464036,0.00026599248,0.35897642],"study_design_scores_gemma":[0.0007952836,0.0000871697,0.000084853105,0.00008736648,0.000010231796,0.0000052471205,0.00015106663,0.94498247,0.00468945,0.011358785,0.03740275,0.0003453108],"about_ca_topic_score_codex":0.0000030466606,"about_ca_topic_score_gemma":0.0000041426383,"teacher_disagreement_score":0.9914351,"about_ca_system_score_codex":0.00006812939,"about_ca_system_score_gemma":0.000028222717,"threshold_uncertainty_score":0.60861284},"labels":[],"label_agreement":null},{"id":"W2068344357","doi":"10.1109/tit.2012.2201342","title":"Multilayer Coding Over Multihop Single-User Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"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":"Relay; Rayleigh fading; Computer science; Linear network coding; Fading; Relay channel; Hop (telecommunications); Channel state information; Additive white Gaussian noise; Maximization; Computer network; Gaussian; Coding (social sciences); Topology (electrical circuits); Algorithm; Channel (broadcasting); Wireless; Telecommunications; Mathematics; Mathematical optimization; Network packet; Statistics","score_opus":0.026116800115298093,"score_gpt":0.25757107170549315,"score_spread":0.23145427159019505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068344357","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.0017631882,0.00007973928,0.9922024,0.00014654928,0.0012867932,0.00020615107,0.0000030914168,0.00032296544,0.0039891494],"genre_scores_gemma":[0.991976,0.00015614854,0.0054968554,0.0018417006,0.00006482397,0.000049235263,0.00000401012,0.000009690265,0.00040149683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875844,0.00020621828,0.00037160885,0.000111415735,0.00021367757,0.0003386657],"domain_scores_gemma":[0.99865043,0.00033483625,0.0001303506,0.0006222551,0.00012061413,0.00014148344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006911677,0.00017302265,0.00012879368,0.00022541003,0.00040052045,0.00019956731,0.00052114733,0.000095919175,0.00026171902],"category_scores_gemma":[0.000015371506,0.00016316504,0.00009872525,0.0004410897,0.000049284372,0.004311069,0.000010334292,0.00032625435,0.0003574439],"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.000063206804,0.00032118947,0.000039317474,0.000013583512,0.00006539148,2.6798313e-7,0.0096392175,0.060329583,0.0006207211,0.15230644,0.0011568516,0.7754442],"study_design_scores_gemma":[0.001657328,0.00010867021,0.0010402834,0.00011015697,0.000030647487,0.00002128027,0.00037113382,0.8785008,0.021352025,0.0003096375,0.09569195,0.0008060598],"about_ca_topic_score_codex":0.0000014021781,"about_ca_topic_score_gemma":0.0000026430914,"teacher_disagreement_score":0.99021286,"about_ca_system_score_codex":0.00011133481,"about_ca_system_score_gemma":0.000019713103,"threshold_uncertainty_score":0.6653677},"labels":[],"label_agreement":null},{"id":"W2072285126","doi":"10.1109/tit.2013.2243496","title":"New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Discrete mathematics; Biology","score_opus":0.007841506769423124,"score_gpt":0.19821105641457804,"score_spread":0.1903695496451549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072285126","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.15651636,0.00001188612,0.8420663,0.00017537903,0.0003930232,0.00023498184,0.000017335193,0.000111213674,0.0004735266],"genre_scores_gemma":[0.99418795,0.000014604501,0.0053115394,0.0003644289,0.0000206681,0.000036130077,0.000008224718,0.0000050254134,0.000051453702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990301,0.00012726986,0.000305966,0.00011976625,0.00026768123,0.00014922673],"domain_scores_gemma":[0.9988021,0.00038048034,0.00018063583,0.00045928595,0.000110409004,0.00006705325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022702862,0.00013819711,0.0001123888,0.00015736501,0.00029587914,0.00019743781,0.00046318816,0.000059698436,0.00027099325],"category_scores_gemma":[0.0000063603616,0.0000970559,0.000086721346,0.00040714742,0.00014805082,0.0028933396,0.0000032675125,0.00017044626,0.00015336376],"study_design_candidate":"design_other","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.00050584023,0.00014291916,0.000044746612,0.00002400204,0.00016998244,7.837154e-7,0.022941144,0.020108938,0.010874509,0.1311673,0.00036056148,0.81365925],"study_design_scores_gemma":[0.008559978,0.0017540738,0.011483747,0.00070492947,0.0002980294,0.000089580186,0.0144464625,0.15023082,0.47502455,0.33353937,0.0019001617,0.0019682907],"about_ca_topic_score_codex":0.00032697458,"about_ca_topic_score_gemma":0.000020762662,"teacher_disagreement_score":0.8376716,"about_ca_system_score_codex":0.000022609382,"about_ca_system_score_gemma":0.00009827364,"threshold_uncertainty_score":0.39578247},"labels":[],"label_agreement":null},{"id":"W2073196023","doi":"10.1109/tit.2011.2170133","title":"Novel Simple Representations for Gaussian Class Multivariate Distributions With Generalized Correlation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","cited_by":98,"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 Alberta","funders":"","keywords":"Mathematics; Weibull distribution; Applied mathematics; Gaussian; Random variable; Rician fading; Independent and identically distributed random variables; Transformation (genetics); Discrete mathematics; Algorithm; Statistics","score_opus":0.0644185346676988,"score_gpt":0.3275546531182864,"score_spread":0.2631361184505876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073196023","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.0008366199,9.2704954e-7,0.98887044,0.0001963371,0.00017023922,0.0012299209,0.0039186026,0.00034451263,0.004432405],"genre_scores_gemma":[0.8631342,0.000002374995,0.13358387,0.00024343532,0.000024205205,0.0014741754,0.0009943288,0.000027308644,0.0005160987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984718,0.00007633649,0.00068636925,0.00021560049,0.0002650084,0.00028489198],"domain_scores_gemma":[0.99781644,0.0008253548,0.0003258916,0.00043589858,0.00043265527,0.00016373118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003521513,0.00023431287,0.00021379982,0.00020429968,0.00073244044,0.00007237069,0.00016524215,0.00013134179,0.0008881831],"category_scores_gemma":[0.0001838336,0.00020742028,0.0001345312,0.00045088358,0.00016007616,0.0008683476,0.0000017973907,0.0001987568,0.00016596867],"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.00032920958,0.000377014,0.0000033163838,0.00003381669,0.000079276615,1.3898322e-7,0.0011380998,0.0021911103,0.00014914855,0.9904005,0.0009181078,0.0043802895],"study_design_scores_gemma":[0.007977375,0.00045211377,0.0027460405,0.00009333104,0.00066966034,0.00005076271,0.0027613607,0.19359373,0.017713731,0.7681073,0.0047468524,0.0010877819],"about_ca_topic_score_codex":0.000049580376,"about_ca_topic_score_gemma":0.00002344225,"teacher_disagreement_score":0.8622976,"about_ca_system_score_codex":0.00012821825,"about_ca_system_score_gemma":0.00008890184,"threshold_uncertainty_score":0.9724982},"labels":[],"label_agreement":null},{"id":"W2074437394","doi":"10.1109/tit.2012.2191682","title":"Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Synchronization (alternating current); Channel capacity; Independent and identically distributed random variables; Channel (broadcasting); Upper and lower bounds; Noise (video); Mathematics; Topology (electrical circuits); Computer science; Algorithm; Random variable; Combinatorics; Telecommunications; Statistics","score_opus":0.012901731476995451,"score_gpt":0.2245494277444444,"score_spread":0.21164769626744895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074437394","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.5904682,0.000023386126,0.40870157,0.0000475988,0.00022325838,0.000111882655,0.000033393815,0.000010719901,0.0003799371],"genre_scores_gemma":[0.9994561,0.000032219446,0.00003622028,0.00031444585,0.000035099154,0.000013665736,0.00005953432,0.0000037112848,0.000048990918],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942017,0.00010210631,0.00018535879,0.00007030951,0.00009210422,0.00012992768],"domain_scores_gemma":[0.99962723,0.000046744728,0.0001044381,0.00012804095,0.00005235983,0.00004116581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038700848,0.000095878284,0.0000738812,0.00003730792,0.00019881733,0.000019581888,0.00007170711,0.000102701895,0.000025165535],"category_scores_gemma":[0.000025137282,0.00006380968,0.000041954692,0.000082491126,0.00014503834,0.000035396417,0.0000020439106,0.00009166116,0.000009164662],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0027074195,0.0010863004,0.0009570242,0.0003690364,0.0005810925,2.706725e-7,0.0073865084,0.041313805,0.7147144,0.079635836,0.0020047214,0.14924356],"study_design_scores_gemma":[0.0005392483,0.00049113046,0.0005614194,0.000043648735,0.000042019907,0.000009302616,0.00071768404,0.0031790743,0.9902281,0.00042672898,0.0034946539,0.00026699787],"about_ca_topic_score_codex":0.0000044936423,"about_ca_topic_score_gemma":8.937137e-7,"teacher_disagreement_score":0.40898785,"about_ca_system_score_codex":0.000014662884,"about_ca_system_score_gemma":0.0000101052465,"threshold_uncertainty_score":0.26020834},"labels":[],"label_agreement":null},{"id":"W2080175226","doi":"10.1109/tit.2012.2206368","title":"Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"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":"Algorithm; Compressed sensing; Computer science; Node (physics); Context (archaeology); Dimension (graph theory); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.011176297979237939,"score_gpt":0.22129574943123265,"score_spread":0.2101194514519947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080175226","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.082148544,0.000016729999,0.9167145,0.000010482822,0.00021503634,0.0001352801,0.000029301818,0.00031069363,0.00041943323],"genre_scores_gemma":[0.9925784,0.0000029466426,0.007259295,0.00009428351,0.000009076791,0.00000901403,0.000034964847,0.000010267887,0.0000017590771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911934,0.000080955695,0.00037995982,0.000065081345,0.00018012687,0.00017453903],"domain_scores_gemma":[0.9992863,0.00016930887,0.00009080249,0.00029562105,0.000110946276,0.00004701434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183948,0.00013078828,0.00020653938,0.0009899111,0.0000669423,0.000017153465,0.00007431934,0.00010079197,0.000032692882],"category_scores_gemma":[0.000007117093,0.00014389849,0.00012295644,0.0008467966,0.000047133,0.00047685552,4.237338e-7,0.00015798118,0.00001571368],"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.000050774714,0.000052185645,0.000115544455,0.000019518846,0.00009817534,1.17484554e-7,0.00031371435,0.98688537,0.0033649658,0.00027659987,0.000020413734,0.008802619],"study_design_scores_gemma":[0.00023272281,0.000009778148,0.0030541648,0.00003378323,0.00014385884,3.4942812e-7,0.00008375453,0.7761168,0.22007753,0.00008314997,0.000044262237,0.00011984438],"about_ca_topic_score_codex":0.000055070715,"about_ca_topic_score_gemma":0.000011644935,"teacher_disagreement_score":0.91042984,"about_ca_system_score_codex":0.00015622037,"about_ca_system_score_gemma":0.0000239712,"threshold_uncertainty_score":0.586801},"labels":[],"label_agreement":null},{"id":"W2081833206","doi":"10.1109/tit.2011.2177579","title":"Single-Sample Robust Joint Source–Channel Coding: Achieving Asymptotically Optimum Scaling of SDR Versus SNR","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Companding; Mathematics; Decoding methods; Additive white Gaussian noise; Decibel; Gaussian; Channel (broadcasting); Algorithm; Computer science; Topology (electrical circuits); Telecommunications","score_opus":0.03534057016149927,"score_gpt":0.23131068069945662,"score_spread":0.19597011053795735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081833206","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.019103311,0.00004448717,0.97519165,0.000042309708,0.00060473196,0.00022199535,0.00003828992,0.0008323379,0.003920902],"genre_scores_gemma":[0.98431724,0.00007160378,0.01540555,0.000057432877,0.000035720437,0.000047306377,0.000020777747,0.000034375094,0.000009972535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860567,0.00008178117,0.00065288536,0.000073667776,0.0002703477,0.00031566952],"domain_scores_gemma":[0.9985367,0.0006180671,0.00013566134,0.00048659203,0.00009988523,0.00012310862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073616713,0.00020511486,0.00023115428,0.00039102705,0.00018472027,0.000057216188,0.00026452792,0.00017231861,0.000117447664],"category_scores_gemma":[0.00006717937,0.00022794092,0.00014010629,0.00027062956,0.000094375486,0.0015464331,0.0000053737194,0.0004148683,0.00006729109],"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.000187029,0.000227336,0.000003356608,0.00022886744,0.00016352534,7.483885e-8,0.009532883,0.914248,0.004116965,0.017187735,0.00009942338,0.05400484],"study_design_scores_gemma":[0.0021474864,0.00030145553,0.00008276362,0.0005456729,0.00018879022,0.000015866284,0.0053322027,0.45146972,0.5327995,0.0015579275,0.004399989,0.0011586769],"about_ca_topic_score_codex":0.000008562163,"about_ca_topic_score_gemma":0.0000017316534,"teacher_disagreement_score":0.96521395,"about_ca_system_score_codex":0.00017325366,"about_ca_system_score_gemma":0.000016591499,"threshold_uncertainty_score":0.92951614},"labels":[],"label_agreement":null},{"id":"W2082831697","doi":"10.1109/tit.2011.2145930","title":"Rate-Constrained Simulation and Source Coding i.i.d. Sources","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","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":"Queen's University","funders":"Tsinghua University; University of Kansas; John Simon Guggenheim Memorial Foundation; Simons Foundation","keywords":"Source code; Variable-length code; Computer science; Coding (social sciences); Asymptotically optimal algorithm; Algorithm; Shannon–Fano coding; Alphabet; Block code; Theoretical computer science; Code rate; Decoding methods; Mathematics; Statistics","score_opus":0.01999778273778776,"score_gpt":0.2306318751298479,"score_spread":0.21063409239206013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082831697","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.007070872,0.0000073110355,0.9904364,0.00002970688,0.00027436746,0.00013095165,0.000010308775,0.00022977506,0.0018103068],"genre_scores_gemma":[0.9892278,0.0000061351893,0.010293096,0.00031596154,0.0000126725945,0.00001315231,0.0000035059268,0.0000044053186,0.00012329478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992712,0.000081326645,0.00024896878,0.000124203,0.00013386818,0.00014043163],"domain_scores_gemma":[0.99930453,0.00019461542,0.000106679145,0.0002600852,0.000060315364,0.00007379747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040952032,0.000114248694,0.000089539106,0.00019800519,0.00032874342,0.00014042552,0.00020280619,0.000062934065,0.000097259435],"category_scores_gemma":[0.000009219249,0.00010070204,0.000036966427,0.00016386334,0.00006380727,0.0030002748,0.000004729043,0.00012793341,0.000091266025],"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.000103803744,0.000060806615,0.000009848339,0.000025555995,0.000030005365,8.164807e-7,0.0132427225,0.06344897,0.00011860325,0.04326682,0.000039743434,0.8796523],"study_design_scores_gemma":[0.0006465371,0.00012860108,0.00028583358,0.00004065208,0.000013979572,0.000013323829,0.00067119184,0.9785454,0.0094917035,0.007348174,0.0025638763,0.00025071835],"about_ca_topic_score_codex":0.000011000357,"about_ca_topic_score_gemma":5.5444747e-7,"teacher_disagreement_score":0.98215693,"about_ca_system_score_codex":0.000016447852,"about_ca_system_score_gemma":0.000021922795,"threshold_uncertainty_score":0.410651},"labels":[],"label_agreement":null},{"id":"W2086732540","doi":"10.1109/tit.2014.2326976","title":"Capacity Analysis of Linear Operator Channels Over Finite Fields","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"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 Waterloo","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Subspace topology; Coding (social sciences); Computer science; Rank (graph theory); Operator (biology); Algorithm; Combinatorics; Discrete mathematics; Mathematics; Artificial intelligence; Statistics; Biology","score_opus":0.023061415155887242,"score_gpt":0.2535271905335389,"score_spread":0.23046577537765164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086732540","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.010830069,0.000006294273,0.9864387,0.00018000719,0.00030818925,0.000085072854,0.000010518815,0.00007931454,0.002061818],"genre_scores_gemma":[0.9960755,0.00005829239,0.0025762026,0.0011389494,0.000013162907,0.00001815945,0.0000050337026,0.0000025917743,0.0001120813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.00020394541,0.00033593323,0.00009138982,0.00016819556,0.000108679225],"domain_scores_gemma":[0.9987024,0.00036829172,0.00011537338,0.00058444234,0.00017691776,0.000052560234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197936,0.000096092335,0.00016941238,0.00045688046,0.00022317945,0.00006622988,0.00044954292,0.00006448539,0.00022761234],"category_scores_gemma":[0.000028583761,0.000088195906,0.00013295656,0.0010535117,0.000043082204,0.0010557257,0.000005212864,0.00017098789,0.00005622712],"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.000028084569,0.00008626755,0.000012502008,0.000014968635,0.0003168122,5.124159e-8,0.00762374,0.66178715,0.00012724953,0.15940972,0.000107177075,0.17048626],"study_design_scores_gemma":[0.00023846854,0.000062570776,0.00018015777,0.000013889364,0.0000573002,3.384406e-7,0.000034333592,0.98724234,0.008551396,0.00056669477,0.0029295858,0.00012294813],"about_ca_topic_score_codex":0.0000049523915,"about_ca_topic_score_gemma":0.000011290117,"teacher_disagreement_score":0.98524547,"about_ca_system_score_codex":0.000023305316,"about_ca_system_score_gemma":0.000021888576,"threshold_uncertainty_score":0.35965246},"labels":[],"label_agreement":null},{"id":"W2087421547","doi":"10.1109/tit.2008.924721","title":"On the Outage Capacity Distribution of Correlated Keyhole MIMO Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":77,"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 Ottawa","funders":"","keywords":"MIMO; Channel capacity; Spatial correlation; Topology (electrical circuits); Channel (broadcasting); Rayleigh fading; Computer science; Signal-to-noise ratio (imaging); Mathematics; Telecommunications; Fading","score_opus":0.010529962185197783,"score_gpt":0.1859805450870394,"score_spread":0.17545058290184162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087421547","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.058063712,0.000006631044,0.9381651,0.000021193291,0.0008273565,0.00032422494,0.00018655689,0.00025917188,0.0021460417],"genre_scores_gemma":[0.9995387,0.000030179935,0.00010127848,0.00005462419,0.000012836958,0.000059162438,0.000050956045,0.000014005287,0.00013825527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991811,0.00005965919,0.00038924802,0.0000628624,0.00016391132,0.0001432096],"domain_scores_gemma":[0.999319,0.00019074492,0.00010239307,0.0002508646,0.000098632685,0.000038365455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021820789,0.00014261775,0.00013184434,0.00011084856,0.00021220285,0.000012418182,0.00010537736,0.0001068839,0.00009870646],"category_scores_gemma":[0.00002338327,0.00011720334,0.00007510295,0.00028218774,0.0000812698,0.00066448894,4.8892235e-7,0.0002407237,0.0002067294],"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.00004109785,0.000023705066,6.092971e-7,0.00002698823,0.000027559263,1.8604322e-7,0.0016483826,0.99042594,0.00017166938,0.006184362,0.00029693585,0.0011525515],"study_design_scores_gemma":[0.001572899,0.00024651558,0.000106159525,0.00023335076,0.00006033074,0.000055247925,0.0013291305,0.7838434,0.20677449,0.003544226,0.0016140048,0.0006202583],"about_ca_topic_score_codex":0.0000056011777,"about_ca_topic_score_gemma":8.177926e-7,"teacher_disagreement_score":0.941475,"about_ca_system_score_codex":0.000115506555,"about_ca_system_score_gemma":0.000012091785,"threshold_uncertainty_score":0.47794133},"labels":[],"label_agreement":null},{"id":"W2087541534","doi":"10.1109/tit.2009.2013041","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code (set theory); Constant (computer programming); Binary number; Computer science; Algorithm; Discrete mathematics; Mathematics; Programming language; Arithmetic","score_opus":0.013698900849824938,"score_gpt":0.24874483659826382,"score_spread":0.23504593574843888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087541534","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.0029195691,0.000012732347,0.9922264,0.00039946198,0.00053665385,0.00033216574,0.00004639212,0.0004138499,0.0031127597],"genre_scores_gemma":[0.98072773,0.000013454477,0.017183004,0.0019064017,0.000019267967,0.000059027778,0.00000512701,0.000004584488,0.00008140289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898773,0.00008419213,0.00034968538,0.00015369295,0.00018154774,0.00024315667],"domain_scores_gemma":[0.9989093,0.00037147308,0.00011014124,0.00042153173,0.00010213403,0.0000854521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048746,0.0001588883,0.00014305174,0.00030561216,0.00036496134,0.00019963765,0.00047409398,0.00007543617,0.000039487386],"category_scores_gemma":[0.000011049228,0.00014923314,0.00017484087,0.00026088458,0.00006702754,0.0017589682,0.000001414419,0.00014024429,0.00010768764],"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.00021783679,0.000106152394,0.0000012899932,0.000015352527,0.000029890862,5.039494e-7,0.001892182,0.0033143072,0.0003401811,0.70586044,0.00012589128,0.288096],"study_design_scores_gemma":[0.0027996055,0.0011378876,0.00013866217,0.00011535421,0.00005844258,0.000049589988,0.0006880308,0.09954635,0.04869838,0.8349978,0.010947563,0.00082233216],"about_ca_topic_score_codex":0.000001700123,"about_ca_topic_score_gemma":8.5508117e-7,"teacher_disagreement_score":0.9778082,"about_ca_system_score_codex":0.0000332985,"about_ca_system_score_gemma":0.00003690916,"threshold_uncertainty_score":0.608555},"labels":[],"label_agreement":null},{"id":"W2088124680","doi":"10.1109/tit.2014.2332336","title":"Private Broadcasting Over Independent Parallel Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"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":"Fading; Broadcasting (networking); Gaussian; Coding (social sciences); Computer science; Channel code; Block (permutation group theory); Encoding (memory); Theoretical computer science; Topology (electrical circuits); Mathematics; Algorithm; Computer network; Decoding methods; Combinatorics; Statistics","score_opus":0.00914837261323207,"score_gpt":0.2203186316881497,"score_spread":0.21117025907491763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088124680","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.018087924,0.000011453292,0.97044754,0.00003442521,0.00038834545,0.00020855348,0.000011260328,0.0012771131,0.009533369],"genre_scores_gemma":[0.99649876,0.00006454485,0.0029413302,0.0002680113,0.000026288912,0.000114259514,0.000010256951,0.000022524722,0.000054025113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990615,0.000080571226,0.00038190617,0.00007181758,0.00021568968,0.00018847587],"domain_scores_gemma":[0.99921227,0.00014961943,0.000070699025,0.00045182096,0.00005002036,0.00006556114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047880804,0.00015950992,0.00013282288,0.00027449528,0.00015444489,0.0000891207,0.00027266072,0.00012130339,0.00019399957],"category_scores_gemma":[0.000010859298,0.0001711048,0.000071608316,0.00017565291,0.000038010356,0.001107015,0.0000023771247,0.0003566055,0.00030010656],"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.00005158765,0.000056473993,0.000005183002,0.0001224796,0.0000750219,2.0443781e-7,0.0038669482,0.6861279,0.0007589216,0.063653566,0.0004598764,0.24482183],"study_design_scores_gemma":[0.001605878,0.00014621935,0.0003087982,0.00023144567,0.00004523015,0.00002386568,0.00042391624,0.79013115,0.112021156,0.025902139,0.068111144,0.0010490752],"about_ca_topic_score_codex":0.000003958889,"about_ca_topic_score_gemma":0.0000016291693,"teacher_disagreement_score":0.97841084,"about_ca_system_score_codex":0.000083985346,"about_ca_system_score_gemma":0.000007599429,"threshold_uncertainty_score":0.6977451},"labels":[],"label_agreement":null},{"id":"W2090331763","doi":"10.1109/tit.2006.876251","title":"Constructions of quadratic bent functions in polynomial forms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":89,"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":"Bent molecular geometry; Combinatorics; Mathematics; Bent function; Boolean function; Polynomial; Quadratic equation; Degree (music); Discrete mathematics; Sigma; Geometry; Physics; Mathematical analysis","score_opus":0.004477564958067519,"score_gpt":0.1895377663441877,"score_spread":0.18506020138612017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090331763","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.046096895,0.000006804148,0.94003195,0.00009143116,0.000638702,0.00017721592,0.000027981923,0.00012822295,0.012800785],"genre_scores_gemma":[0.9973793,0.0000028272436,0.0023670562,0.00008738285,0.00001428079,0.00004983324,0.00000517956,0.0000038349176,0.00009027637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893725,0.00008038507,0.0005143976,0.00011086894,0.00018186384,0.0001752459],"domain_scores_gemma":[0.99923706,0.00017245191,0.00014410765,0.0003409947,0.00006628755,0.000039117887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038405487,0.000121182944,0.00013638356,0.0007424483,0.0002008739,0.00006355447,0.0002612794,0.00007036724,0.00010254019],"category_scores_gemma":[0.0000045738316,0.00011589744,0.00013721034,0.0007795656,0.000118826996,0.0017079497,0.0000022391532,0.00017750943,0.00007639401],"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.000112813905,0.0002445493,0.000058326794,0.00002869862,0.000027935932,4.57759e-7,0.0011853593,0.03881706,0.00033784803,0.86995316,0.00020656311,0.08902722],"study_design_scores_gemma":[0.008129726,0.0014945382,0.0070054377,0.00036527435,0.00016581042,0.00021526388,0.007511236,0.06283263,0.10147233,0.79472595,0.014090439,0.0019913705],"about_ca_topic_score_codex":0.000036078654,"about_ca_topic_score_gemma":0.000043690903,"teacher_disagreement_score":0.95128244,"about_ca_system_score_codex":0.000051118586,"about_ca_system_score_gemma":0.00006366192,"threshold_uncertainty_score":0.47261605},"labels":[],"label_agreement":null},{"id":"W2090831658","doi":"10.1109/18.985979","title":"Diagonal algebraic space-time block codes","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":289,"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 Alberta","funders":"","keywords":"Block code; Mathematics; Hadamard transform; Decoding methods; Diagonal; Concatenated error correction code; Algorithm; Full Rate; Linear code; Space–time block code; Discrete mathematics","score_opus":0.007211529268538529,"score_gpt":0.1968682053189268,"score_spread":0.18965667605038827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090831658","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.003877225,0.00007663471,0.97417605,0.00010544504,0.00019995747,0.00021812649,0.000055959772,0.0018023755,0.0194882],"genre_scores_gemma":[0.9951949,0.00040494508,0.0034708122,0.00018432195,0.000017684,0.00012895062,0.00001053126,0.000025406609,0.00056244014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922585,0.000047372963,0.0003155856,0.00006537986,0.00016792172,0.00017791007],"domain_scores_gemma":[0.99921525,0.00019208662,0.00005222863,0.00042069185,0.000053710464,0.00006603508],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014368263,0.00016393694,0.00013391975,0.00026956576,0.00015962994,0.000043284537,0.00022357238,0.00009937819,0.0011871106],"category_scores_gemma":[0.000006962784,0.0001759486,0.000077219396,0.00022839085,0.00006937096,0.001129842,0.0000012026392,0.00028739692,0.0020740707],"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.000034301727,0.000115649316,0.000001320856,0.00008235584,0.000119800854,6.6992044e-7,0.0025616137,0.6808904,0.0023171986,0.015393445,0.0048650284,0.29361823],"study_design_scores_gemma":[0.00094874017,0.00013262707,0.000041784886,0.00012722918,0.000050490875,0.000042785825,0.00035125238,0.571296,0.3614082,0.011830491,0.052795336,0.0009751111],"about_ca_topic_score_codex":0.0000010930116,"about_ca_topic_score_gemma":8.6172776e-7,"teacher_disagreement_score":0.9913177,"about_ca_system_score_codex":0.00009533788,"about_ca_system_score_gemma":0.000004917965,"threshold_uncertainty_score":0.99972594},"labels":[],"label_agreement":null},{"id":"W2094676669","doi":"10.1109/tit.2012.2218792","title":"Polar Codes for Classical-Quantum Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"ExxonMobil Research and Engineering Company; Defense Advanced Research Projects Agency; École Polytechnique Fédérale de Lausanne; Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Classical capacity; Computer science; Quantum capacity; Quantum channel; Polar code; Channel capacity; Channel (broadcasting); Quantum; Puncturing; Decoding methods; Algorithm; Mathematics; Topology (electrical circuits); Theoretical computer science; Quantum information; Telecommunications; Physics; Quantum mechanics; Quantum network; Combinatorics","score_opus":0.01878489496873109,"score_gpt":0.2653956083520281,"score_spread":0.246610713383297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094676669","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.0010616364,0.000014860124,0.99326676,0.00035455826,0.0023377412,0.0003845144,0.000024008255,0.0009962532,0.0015596959],"genre_scores_gemma":[0.97378665,0.000007252514,0.02481359,0.00086407,0.00007133831,0.00020852125,0.0000041709022,0.000010828849,0.00023360533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893194,0.000086746906,0.00031717637,0.00010989641,0.00021026879,0.0003439666],"domain_scores_gemma":[0.99880195,0.0004085378,0.00013038964,0.00042215147,0.00012388796,0.00011306447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619805,0.0001512562,0.00013454806,0.00030029952,0.00030940675,0.00012720631,0.0004440196,0.000108113294,0.000024522926],"category_scores_gemma":[0.000032560158,0.00014236219,0.00012580374,0.00027869467,0.000045095625,0.003659806,0.0000030199005,0.00020442794,0.00021494832],"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.00010082438,0.00023838492,0.0000069523135,0.00007241771,0.000052462536,1.6144554e-7,0.008921013,0.0016619376,0.00062038685,0.7509344,0.0032403332,0.23415072],"study_design_scores_gemma":[0.001492417,0.00090072374,0.00010994445,0.00016951213,0.00008140411,0.00008925891,0.0011663251,0.2827327,0.47939354,0.13055696,0.10191048,0.0013967443],"about_ca_topic_score_codex":0.000004208441,"about_ca_topic_score_gemma":7.467821e-7,"teacher_disagreement_score":0.972725,"about_ca_system_score_codex":0.00008472576,"about_ca_system_score_gemma":0.00003758336,"threshold_uncertainty_score":0.5805361},"labels":[],"label_agreement":null},{"id":"W2094848842","doi":"10.1109/tit.2015.2422294","title":"Hardness of Decoding Quantum Stabilizer Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin Corporation","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Quantum convolutional code; Algorithm; Mathematics; Concatenated error correction code; Degeneracy (biology); Code (set theory); Computer science; Linear code; Discrete mathematics; Block code","score_opus":0.01790631183185298,"score_gpt":0.2424243118143725,"score_spread":0.2245179999825195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094848842","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.026075913,0.0000127086,0.97102433,0.00012019704,0.0011532863,0.000109696906,0.000013882058,0.0001738979,0.0013161049],"genre_scores_gemma":[0.9833508,0.0000036215547,0.016379723,0.00018756292,0.000016013939,0.000009610576,0.0000014941937,0.000005017555,0.000046163463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896884,0.00010866532,0.00035099284,0.00010900365,0.00029529975,0.00016719886],"domain_scores_gemma":[0.99905944,0.00016610416,0.00014150179,0.00035383846,0.000179133,0.00009997151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538447,0.00011729959,0.00015129751,0.0002432497,0.00012801682,0.00008266221,0.0004052561,0.00005398369,0.000014123218],"category_scores_gemma":[0.000021637912,0.00010066675,0.00007912678,0.00033532706,0.00006236712,0.0010189508,0.000004214125,0.00016849945,0.00007090665],"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.00010391237,0.00014308866,0.000006910468,0.00006858875,0.00005124814,8.984035e-7,0.015333678,0.41008383,0.00014570047,0.16233025,0.0004287063,0.4113032],"study_design_scores_gemma":[0.000682395,0.00020031835,0.000039346633,0.00005821985,0.00000989368,0.000022372515,0.0006933925,0.9452866,0.021236327,0.029697873,0.0018508536,0.00022243183],"about_ca_topic_score_codex":0.000010002079,"about_ca_topic_score_gemma":0.0000011762708,"teacher_disagreement_score":0.95727485,"about_ca_system_score_codex":0.000036818517,"about_ca_system_score_gemma":0.00010236125,"threshold_uncertainty_score":0.41050708},"labels":[],"label_agreement":null},{"id":"W2095026990","doi":"10.1109/tit.2015.2416068","title":"Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interpolation (computer graphics); Polynomial; List decoding; Algorithm; Decoding methods; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science; Artificial intelligence; Pure mathematics","score_opus":0.01921276658745393,"score_gpt":0.23838268054384007,"score_spread":0.21916991395638613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095026990","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.0030021854,0.000005612477,0.9948606,0.00013649976,0.00034794866,0.0004516933,0.00004508236,0.0002292782,0.00092111673],"genre_scores_gemma":[0.93667465,0.0000015121227,0.062731214,0.00029609518,0.000025811622,0.00013957769,0.000008193922,0.0000079559995,0.00011500455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.000057951656,0.00025729084,0.0001456867,0.00015948171,0.00016803728],"domain_scores_gemma":[0.9988798,0.00048544814,0.00011306323,0.00024189556,0.00017769528,0.00010211151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004276601,0.00015102522,0.00011881609,0.00031322875,0.00026864544,0.00022710039,0.00019751434,0.00006637627,0.000006173557],"category_scores_gemma":[0.000022706809,0.00012715448,0.000054377055,0.00021587986,0.000087386776,0.002071503,0.0000034194697,0.00011749524,0.000018707658],"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.001565157,0.00017236473,0.000004674803,0.000066405,0.00014160354,8.51393e-7,0.041780822,0.053925466,0.0001596621,0.14519359,0.00013652565,0.75685287],"study_design_scores_gemma":[0.0023800367,0.0006070165,0.0000126425,0.00004300862,0.000032537704,0.000030383717,0.0026936082,0.97303456,0.0026564081,0.016417028,0.0017752418,0.00031752425],"about_ca_topic_score_codex":0.000007858309,"about_ca_topic_score_gemma":0.0000041044364,"teacher_disagreement_score":0.9336724,"about_ca_system_score_codex":0.00003257829,"about_ca_system_score_gemma":0.000043796852,"threshold_uncertainty_score":0.5185209},"labels":[],"label_agreement":null},{"id":"W2095145158","doi":"10.1109/tit.2007.913417","title":"A New Generic Maximum-Likelihood Metric Expression for Space–Time Block Codes With Applications to Decoding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"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":"Decoding methods; Space–time block code; Block code; Metric (unit); Representation (politics); Algorithm; Mathematics; Block (permutation group theory); Measure (data warehouse); Computer science; Theoretical computer science; Combinatorics","score_opus":0.011081846156828766,"score_gpt":0.2301518902286362,"score_spread":0.2190700440718074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095145158","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.0014685028,0.00005161164,0.99469596,0.000055994235,0.00006542464,0.001105997,0.000059100876,0.0012288692,0.0012685114],"genre_scores_gemma":[0.5921802,0.00020037022,0.40554845,0.00014838546,0.000031898046,0.0016301175,0.000026708769,0.000048637434,0.00018521822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990595,0.000026593196,0.00035982436,0.00012336981,0.00018989971,0.00024084227],"domain_scores_gemma":[0.99887264,0.00022662098,0.00008353267,0.0005312339,0.0001250715,0.00016089425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014505157,0.00020988545,0.000188537,0.00064615154,0.00036841,0.000035494508,0.000283366,0.00009446001,0.000057342415],"category_scores_gemma":[0.000007409001,0.00020312131,0.00007456264,0.00078818307,0.000030787483,0.00084083184,0.0000024771625,0.00017882795,0.00018081476],"study_design_candidate":"bench_or_experimental","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.00015725516,0.000056301782,0.0000015288879,0.00007312168,0.00006235581,2.2011918e-7,0.0014000265,0.70585614,0.010351543,0.0011153496,0.0022410902,0.27868506],"study_design_scores_gemma":[0.0012308196,0.00026253384,0.000017384102,0.0001298976,0.000060886916,0.000053041935,0.0003507561,0.040147837,0.9120681,0.0046620364,0.040246487,0.000770204],"about_ca_topic_score_codex":0.0000029851187,"about_ca_topic_score_gemma":0.0000021731794,"teacher_disagreement_score":0.9017166,"about_ca_system_score_codex":0.00015630129,"about_ca_system_score_gemma":0.000049828035,"threshold_uncertainty_score":0.82830465},"labels":[],"label_agreement":null},{"id":"W2095214648","doi":"10.1109/tit.2013.2256952","title":"MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":67,"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":"Eavesdropping; Secrecy; Transmitter; MIMO; Computer science; Channel (broadcasting); Transmission (telecommunications); Converse; Computer network; Secure transmission; Degrees of freedom (physics and chemistry); Topology (electrical circuits); Mathematics; Telecommunications; Computer security; Combinatorics; Physics","score_opus":0.015694880566927083,"score_gpt":0.22808261236903907,"score_spread":0.21238773180211198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095214648","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.10088024,0.00002103609,0.89342403,0.000027374805,0.00012374953,0.00047524864,0.000048422018,0.00082584395,0.0041740425],"genre_scores_gemma":[0.9912804,0.00006493935,0.0082277125,0.00006645192,0.00001268205,0.00027939386,0.000024801846,0.000030288975,0.000013358846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989949,0.00006787905,0.00044111675,0.00008826997,0.00021683032,0.00019100246],"domain_scores_gemma":[0.9988492,0.00016259242,0.00010936952,0.00060260907,0.00018469809,0.00009150891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019315882,0.00019714647,0.00019399104,0.0003963991,0.00014123858,0.000118187534,0.0004984613,0.00012507707,0.00019963342],"category_scores_gemma":[0.00000573912,0.00018437221,0.000062518404,0.00029146348,0.00010135815,0.0034330797,0.0000030927201,0.00032742263,0.00006630951],"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.00011885008,0.00013595448,0.000021484673,0.00019309919,0.00011859848,2.075225e-7,0.0057563963,0.95911306,0.001578438,0.0041761273,0.00009781262,0.028689988],"study_design_scores_gemma":[0.0010357767,0.00024049351,0.0006678324,0.00019900872,0.0000397638,0.000014592707,0.0013125802,0.8685303,0.1243163,0.0028925678,0.00020072365,0.00055010547],"about_ca_topic_score_codex":0.00020227235,"about_ca_topic_score_gemma":0.000053624397,"teacher_disagreement_score":0.8904001,"about_ca_system_score_codex":0.0000556778,"about_ca_system_score_gemma":0.000025056148,"threshold_uncertainty_score":0.7518481},"labels":[],"label_agreement":null},{"id":"W2095879899","doi":"10.1109/tit.2008.2011431","title":"Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Binary number; Combinatorial design; Coding (social sciences); Code (set theory); Set (abstract data type); Mathematics; Computer science; Sequence (biology); Discrete mathematics; Theoretical computer science; Combinatorics; Algorithm; Arithmetic","score_opus":0.0055197535792343,"score_gpt":0.2091376246644924,"score_spread":0.2036178710852581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095879899","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.095669754,0.000012482991,0.8921243,0.000045197765,0.0042131166,0.00042668477,0.0002092638,0.00047304324,0.006826176],"genre_scores_gemma":[0.9983598,0.000002120831,0.0012048661,0.00013862256,0.00012297138,0.00008940977,0.000035765155,0.000012181552,0.00003428197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990031,0.000045024015,0.0004204214,0.00009469122,0.00019544561,0.00024133509],"domain_scores_gemma":[0.9993265,0.00024320479,0.00004566986,0.00017079897,0.00010453556,0.00010924509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037409534,0.00018529757,0.00018318882,0.00022647253,0.00030901702,0.000063950385,0.000107416025,0.000120950215,0.00012811083],"category_scores_gemma":[0.000008051766,0.0001865786,0.0001690805,0.00017128255,0.00009580494,0.0007320334,3.794732e-7,0.0002315188,0.00011964057],"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.00027150655,0.000050718118,3.9913022e-7,0.000021267257,0.000063021755,3.4372675e-7,0.00024405589,0.49567896,0.00056174345,0.48805007,0.00023260617,0.014825296],"study_design_scores_gemma":[0.016065905,0.0018522117,0.00020698759,0.00028739602,0.0004588526,0.00059165515,0.002566654,0.30392048,0.18717004,0.4715851,0.012804698,0.002490006],"about_ca_topic_score_codex":4.085245e-7,"about_ca_topic_score_gemma":4.7057523e-7,"teacher_disagreement_score":0.90269005,"about_ca_system_score_codex":0.000053795025,"about_ca_system_score_gemma":0.000033096574,"threshold_uncertainty_score":0.7608454},"labels":[],"label_agreement":null},{"id":"W2095880256","doi":"10.1109/tit.2006.889721","title":"Multicollision Attacks on Some Generalized Sequential Hash Functions","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":53,"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":"Hash function; Collision attack; SHA-2; Double hashing; Iterated function; Collision resistance; Hash chain; Cryptographic hash function; Computer science; MDC-2; Rolling hash; Class (philosophy); Set (abstract data type); Theoretical computer science; Mathematics; Computer security","score_opus":0.018863244168844696,"score_gpt":0.2817870051206014,"score_spread":0.2629237609517567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095880256","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.042383015,0.000005292586,0.95315707,0.0002994385,0.0018577294,0.0003530585,0.000057614965,0.00030516938,0.0015816278],"genre_scores_gemma":[0.990929,0.00002046668,0.0066328337,0.0020604779,0.00005240042,0.000054339485,0.000033367025,0.000009108394,0.00020802591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838215,0.000099504425,0.0005554946,0.00019622159,0.00044035562,0.000326254],"domain_scores_gemma":[0.99883777,0.00023539529,0.00014828298,0.0005020255,0.0001418147,0.00013469464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009733601,0.00018727603,0.00013561957,0.00076144666,0.00074159686,0.0002403607,0.0003377709,0.0001061312,0.00027742435],"category_scores_gemma":[0.0000089554,0.00017734701,0.00017849615,0.0006218786,0.000067211884,0.0024759206,0.000003942518,0.00027027586,0.00048613912],"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.00035389335,0.0004434486,0.000007147315,0.00002287636,0.000100629084,0.0000035169498,0.00481094,0.024706328,0.0008253813,0.6806677,0.0018476598,0.2862105],"study_design_scores_gemma":[0.026886411,0.0038438719,0.0038520016,0.00029572274,0.00037335916,0.00020857081,0.008079047,0.30024233,0.26986924,0.16086696,0.22081167,0.0046707923],"about_ca_topic_score_codex":0.00002722546,"about_ca_topic_score_gemma":0.000026265447,"teacher_disagreement_score":0.948546,"about_ca_system_score_codex":0.00011411178,"about_ca_system_score_gemma":0.00005832786,"threshold_uncertainty_score":0.72320014},"labels":[],"label_agreement":null},{"id":"W2096574248","doi":"10.1109/tit.2003.820019","title":"Context-dependent multilevel pattern matching for lossless image compression","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"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":"Redundancy (engineering); Arithmetic coding; Lossless compression; Data compression; Computer science; Algorithm; Code (set theory); Systematic code; Context (archaeology); Theoretical computer science; Prefix code; Coding (social sciences); Constant-weight code; Pixel; Universal code; Context model; Code rate; Mathematics; Artificial intelligence; Decoding methods; Linear code; Context-adaptive binary arithmetic coding; Block code; Statistics; Programming language","score_opus":0.014007275567787537,"score_gpt":0.24919450634582072,"score_spread":0.2351872307780332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096574248","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.0008775956,0.000019061856,0.9963005,0.00005334553,0.0011922739,0.00046378095,0.00015469463,0.00020282579,0.0007359074],"genre_scores_gemma":[0.9674857,0.000010735567,0.031391036,0.0007469798,0.000019693161,0.0001433254,0.000017546958,0.000012069206,0.00017289016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986845,0.0001234445,0.0004138448,0.0002074974,0.0003161128,0.0002545814],"domain_scores_gemma":[0.9987551,0.00028775766,0.00015745503,0.000554927,0.00014321749,0.00010156975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005762391,0.00018767537,0.00017038701,0.00018532039,0.00048600422,0.00027941438,0.00043520625,0.00008967674,0.0000979134],"category_scores_gemma":[0.000010756524,0.0001617246,0.00012964939,0.00009997924,0.00003650249,0.0033749407,0.000005724444,0.00020618508,0.00019198588],"study_design_candidate":"design_other","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.000053331354,0.00012833657,6.588046e-7,0.0000543214,0.000034287837,9.4225635e-7,0.00216199,0.008488762,0.00041478866,0.025533121,0.00029658424,0.96283287],"study_design_scores_gemma":[0.008218647,0.00049402704,0.000115981195,0.0004499265,0.00007568449,0.00009738469,0.0027781792,0.6644448,0.22012393,0.062200263,0.03947076,0.0015304204],"about_ca_topic_score_codex":0.000019312904,"about_ca_topic_score_gemma":0.0000020330988,"teacher_disagreement_score":0.9666081,"about_ca_system_score_codex":0.000058704256,"about_ca_system_score_gemma":0.000046440877,"threshold_uncertainty_score":0.6594938},"labels":[],"label_agreement":null},{"id":"W2097025603","doi":"10.1109/18.930944","title":"Relationships between different error-correcting capabilities of a code","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Hamming distance; Error detection and correction; Hamming code; Levenshtein distance; Algorithm; Channel (broadcasting); Computer science; Type (biology); Mathematics; Code (set theory); Discrete mathematics; Block code; Decoding methods; Telecommunications","score_opus":0.028585560061617523,"score_gpt":0.25362485343716373,"score_spread":0.2250392933755462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097025603","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.60040957,0.000008798166,0.39779294,0.000024214261,0.000113796545,0.00007920478,0.000024261477,0.000020352227,0.0015268815],"genre_scores_gemma":[0.99940187,0.000012562511,0.00017608705,0.000064265834,0.000046159123,0.000012954671,0.00004114561,0.0000048172305,0.00024015571],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921346,0.00014624947,0.00032669218,0.0000928749,0.00009213138,0.00012860734],"domain_scores_gemma":[0.99946004,0.00014393491,0.000117434196,0.0001632171,0.00007110981,0.000044279084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037289408,0.00010300082,0.000112643495,0.00007480472,0.00017517759,0.000013958569,0.00009852601,0.0001311931,0.000045681725],"category_scores_gemma":[0.000056605742,0.00008300748,0.0000952848,0.00008992718,0.00007300015,0.000018819466,0.000002273395,0.00017064819,0.000016815191],"study_design_candidate":"bench_or_experimental","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.002507246,0.0007992705,0.047180608,0.00038971845,0.0007609758,0.0000015697277,0.010452609,0.070637845,0.08187931,0.0071749557,0.00052444916,0.7776914],"study_design_scores_gemma":[0.002038762,0.0017473928,0.030736532,0.00016883442,0.00015342177,0.000055234294,0.011223474,0.0021459218,0.93441224,0.0076966886,0.008654019,0.00096746476],"about_ca_topic_score_codex":0.000004824478,"about_ca_topic_score_gemma":0.0000075150083,"teacher_disagreement_score":0.8525329,"about_ca_system_score_codex":0.000015599651,"about_ca_system_score_gemma":0.00001614547,"threshold_uncertainty_score":0.33849466},"labels":[],"label_agreement":null},{"id":"W2097190254","doi":"10.1109/tit.2004.839533","title":"Constellation Space Invariance of Orthogonal Space–Time Block Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":53,"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":"Decoding methods; Block code; Mathematics; Fading; Algorithm; Property (philosophy); Block (permutation group theory); Invariant (physics); Topology (electrical circuits); Computer science; Combinatorics","score_opus":0.005964522081199693,"score_gpt":0.21016204186626136,"score_spread":0.20419751978506168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097190254","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.008785237,0.00004380743,0.96583915,0.000110552,0.00010589429,0.0002513491,0.00006329705,0.0006433062,0.024157392],"genre_scores_gemma":[0.9839715,0.00021137917,0.015559414,0.00007524545,0.00001751857,0.00002454423,0.000014728152,0.000017615768,0.00010810169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991271,0.000056208613,0.00043770633,0.000064998254,0.00017850687,0.00013546385],"domain_scores_gemma":[0.9991218,0.00022402915,0.00012695679,0.00038042082,0.00009933043,0.00004750181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025439568,0.00014836286,0.00016478037,0.00025966016,0.00009365574,0.000020847074,0.00017162603,0.0001062073,0.0002881845],"category_scores_gemma":[0.0000059287963,0.0001645745,0.00006738282,0.00024260522,0.00009883464,0.0011872929,0.0000014401244,0.0002262049,0.00024901723],"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.000041140833,0.000028024408,0.0000017866981,0.000040873634,0.000032863973,5.0524662e-8,0.0005136861,0.91332984,0.0042440305,0.0106507065,0.00021383529,0.07090317],"study_design_scores_gemma":[0.0005152492,0.000052723077,0.000026632895,0.00011293662,0.000026517757,0.000013073149,0.00018932538,0.25582945,0.72586983,0.0025343325,0.014495804,0.00033413296],"about_ca_topic_score_codex":0.0000012802908,"about_ca_topic_score_gemma":0.0000023070559,"teacher_disagreement_score":0.9751862,"about_ca_system_score_codex":0.000094994815,"about_ca_system_score_gemma":0.00002557228,"threshold_uncertainty_score":0.67111534},"labels":[],"label_agreement":null},{"id":"W2097440336","doi":"10.1109/tit.2006.871608","title":"On the joint source-channel coding error exponent for discrete memoryless systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":75,"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":"Exponent; Additive white Gaussian noise; Mathematics; Channel (broadcasting); Source code; Decoding methods; Discrete mathematics; Topology (electrical circuits); Algorithm; White noise; Combinatorics; Computer science; Statistics; Telecommunications","score_opus":0.01852788324696426,"score_gpt":0.22141527418384127,"score_spread":0.20288739093687702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097440336","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.008000182,0.00002895295,0.9853379,0.00023021156,0.00047613145,0.00087896234,0.00010273743,0.00092927867,0.0040156357],"genre_scores_gemma":[0.9984008,0.000026299322,0.00021149551,0.00013801195,0.00003331441,0.00096006837,0.000027263393,0.00003232034,0.0001703998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890494,0.0000924341,0.00049634953,0.000080833095,0.00022012954,0.00020530983],"domain_scores_gemma":[0.9987881,0.00046096064,0.00010742931,0.00052209874,0.00008300313,0.000038387472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063274836,0.00018906897,0.00016448268,0.00024054086,0.00036849422,0.00013204207,0.0002653841,0.0001028937,0.000034711735],"category_scores_gemma":[0.000010247824,0.00015385673,0.00013029008,0.00014036262,0.00006113075,0.0005128738,0.0000018095404,0.0002767122,0.00008188814],"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.000054661235,0.000037033486,5.3892634e-8,0.00012964908,0.00004335677,7.6128636e-8,0.0019883304,0.8380008,0.0005513654,0.154445,0.0020742274,0.0026754444],"study_design_scores_gemma":[0.0007419739,0.00011324312,0.000011897622,0.00032813897,0.000051264185,0.00000961996,0.004469896,0.83427864,0.13671388,0.0135111995,0.009209309,0.000560967],"about_ca_topic_score_codex":0.000024210145,"about_ca_topic_score_gemma":0.000005652539,"teacher_disagreement_score":0.9904007,"about_ca_system_score_codex":0.00015566578,"about_ca_system_score_gemma":0.000010844419,"threshold_uncertainty_score":0.6274096},"labels":[],"label_agreement":null},{"id":"W2098500765","doi":"10.1109/tit.2011.2111650","title":"Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":31,"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":"Relay; MIMO; Multiplexing; Beamforming; Topology (electrical circuits); Computer science; Power (physics); Mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.026983728311104408,"score_gpt":0.2433059930569498,"score_spread":0.2163222647458454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098500765","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.009432989,0.00007271531,0.9860175,0.00005078482,0.00011244813,0.00013741788,0.0000026964904,0.000058296002,0.0041151266],"genre_scores_gemma":[0.9843406,0.00040877538,0.014871257,0.00029692464,0.0000033011077,0.000031253978,0.000002956376,0.0000033421456,0.000041569863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896276,0.00019569742,0.00045257053,0.00011032478,0.00012530036,0.0001533675],"domain_scores_gemma":[0.9990085,0.00026060524,0.00015504821,0.00044954105,0.000074901276,0.000051454448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078985305,0.00010305871,0.00019510945,0.00056238146,0.00015965797,0.00004095455,0.00033438066,0.000067820845,0.00006982939],"category_scores_gemma":[0.000011345547,0.00009913528,0.000080106045,0.0013985775,0.0000556982,0.0011007198,0.000007675125,0.00021308636,0.000016984071],"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.00014587019,0.0001286095,0.0006642506,0.000024768113,0.00046120962,7.550377e-7,0.027577218,0.37534332,0.000022222195,0.381375,0.00006389007,0.21419288],"study_design_scores_gemma":[0.0012997448,0.00022166045,0.023742285,0.00014576757,0.0002910587,0.000007508283,0.00088540453,0.9618229,0.0005512705,0.009584255,0.0009429353,0.0005051939],"about_ca_topic_score_codex":0.000009895054,"about_ca_topic_score_gemma":0.00004847744,"teacher_disagreement_score":0.97490764,"about_ca_system_score_codex":0.000034849134,"about_ca_system_score_gemma":0.000026098993,"threshold_uncertainty_score":0.40426192},"labels":[],"label_agreement":null},{"id":"W2099167905","doi":"10.1109/tit.2007.907518","title":"Throughput Scaling Laws for Wireless Networks With Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"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":"Fading; Throughput; Scaling law; Computer network; Computer science; Wireless; Scaling; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.02089898317020835,"score_gpt":0.2604493209335271,"score_spread":0.23955033776331872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099167905","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.0011566877,0.00003127045,0.9948893,0.00016767555,0.0006414472,0.0003891938,0.000002821455,0.0002659134,0.0024556506],"genre_scores_gemma":[0.9826937,0.00009015473,0.015986383,0.00093135034,0.00005552837,0.00007157394,0.000005630051,0.000010124328,0.00015561075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998974,0.00006572368,0.0003538946,0.00014109735,0.00017347666,0.00029180045],"domain_scores_gemma":[0.99863017,0.0004938662,0.00013594712,0.0004446163,0.00021424067,0.00008114174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955984,0.00015245195,0.00013644161,0.00020789332,0.0006828446,0.0002163891,0.0004883458,0.000076176446,0.00001845854],"category_scores_gemma":[0.0000055577907,0.0001330037,0.00007326029,0.00050964893,0.0000567505,0.0018792251,0.000004652645,0.00022833324,0.00002595131],"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.0001250762,0.00004003276,0.000001269604,0.000014000523,0.000036307167,3.301925e-7,0.0033585492,0.27099684,0.00004990656,0.14167048,0.000067611225,0.5836396],"study_design_scores_gemma":[0.0010374209,0.00016666269,0.000025918964,0.00012587724,0.000015851174,0.000016673519,0.0005000791,0.97845167,0.011203913,0.0013073407,0.006791632,0.0003569417],"about_ca_topic_score_codex":0.000001218151,"about_ca_topic_score_gemma":0.000009176218,"teacher_disagreement_score":0.981537,"about_ca_system_score_codex":0.00007868275,"about_ca_system_score_gemma":0.00003594471,"threshold_uncertainty_score":0.54237336},"labels":[],"label_agreement":null},{"id":"W2099685905","doi":"10.1109/tit.2010.2040887","title":"New Sets of Zero or Low Correlation Zone Sequences via Interleaving Techniques","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":40,"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":"Interleaving; Hadamard transform; Sequence (biology); Zero (linguistics); Mathematics; Code division multiple access; Complementary sequences; Ideal (ethics); Algorithm; Construct (python library); Discrete mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.01254090588742972,"score_gpt":0.2729346333241561,"score_spread":0.26039372743672634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099685905","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.0023772242,0.0000053771387,0.9944871,0.00024475277,0.0005117836,0.0002901478,0.0000051040493,0.00029967845,0.0017788325],"genre_scores_gemma":[0.9196079,0.000033407083,0.07979563,0.00011345511,0.000015085477,0.000042905274,0.000005095453,0.000007318417,0.0003792494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986367,0.00014981971,0.0005164001,0.0001242048,0.0003865945,0.00018623026],"domain_scores_gemma":[0.9981262,0.00047056447,0.00024948487,0.0008151335,0.00024014742,0.000098440316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082335103,0.00013231275,0.00014430576,0.00044919652,0.00020676866,0.00013803979,0.0010417097,0.00014347315,0.000229664],"category_scores_gemma":[0.000026616342,0.00011412388,0.00007211634,0.00065032026,0.00010994671,0.0031978488,0.000011782219,0.0005957806,0.00012039658],"study_design_candidate":"design_other","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.0000755409,0.000043647015,0.0000027387885,0.000024940273,0.000017259936,3.0280916e-7,0.0021376158,0.0073031643,0.0029145957,0.017232072,0.00022861088,0.9700195],"study_design_scores_gemma":[0.00069639453,0.00038467796,0.00013963421,0.0002679474,0.000016422293,0.00007752933,0.0002730402,0.5933924,0.3839247,0.017212776,0.003132834,0.00048167154],"about_ca_topic_score_codex":0.000052276562,"about_ca_topic_score_gemma":0.000045678848,"teacher_disagreement_score":0.96953785,"about_ca_system_score_codex":0.00005218173,"about_ca_system_score_gemma":0.00019225819,"threshold_uncertainty_score":0.4653837},"labels":[],"label_agreement":null},{"id":"W2100354145","doi":"10.1109/tit.2010.2059770","title":"Asymptotic Analysis of Robust LASSOs in the Presence of Noise With Large Variance","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Control Systems and Identification","field":"Engineering","cited_by":38,"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":"Lasso (programming language); Estimator; Mathematics; Independent and identically distributed random variables; Elastic net regularization; Outlier; Noise (video); Context (archaeology); Cauchy distribution; Asymptotic distribution; Model selection; Applied mathematics; Statistics; Algorithm; Computer science; Regression; Random variable; Artificial intelligence","score_opus":0.004034511265536936,"score_gpt":0.18252922968827578,"score_spread":0.17849471842273884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100354145","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.1866232,0.0000048337606,0.81177753,0.000014669721,0.0001537248,0.00017699787,0.000050449376,0.000023606017,0.0011749655],"genre_scores_gemma":[0.9997926,0.00000574254,0.00010606544,0.000010701719,0.000004955347,0.000040792136,0.000005809539,0.0000035004953,0.000029832167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993722,0.000039627343,0.0003134517,0.000040209925,0.00015649624,0.000078030534],"domain_scores_gemma":[0.9994124,0.00014787949,0.000090080975,0.0002634919,0.00007267849,0.000013455156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055458094,0.00006164518,0.0001269613,0.00032701818,0.00003268776,0.000018461791,0.00012481259,0.000043875385,0.00006382191],"category_scores_gemma":[0.000009359818,0.00004484807,0.000055326196,0.0006654073,0.000024943893,0.00048403197,2.4948577e-7,0.00014310503,0.000008638678],"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.000040465315,0.000051697643,0.00011280834,0.000064996675,0.00017086054,7.483589e-8,0.0033408368,0.98443514,0.0027240184,0.006093839,0.000013947196,0.0029513373],"study_design_scores_gemma":[0.000989709,0.000056102293,0.035321027,0.00006433073,0.0004500107,0.0000030742012,0.0017533677,0.9501156,0.010421239,0.00021181416,0.00043177727,0.00018192102],"about_ca_topic_score_codex":0.00003057077,"about_ca_topic_score_gemma":0.0003618236,"teacher_disagreement_score":0.8131694,"about_ca_system_score_codex":0.000011651135,"about_ca_system_score_gemma":0.0000114642235,"threshold_uncertainty_score":0.18288513},"labels":[],"label_agreement":null},{"id":"W2100525102","doi":"10.1109/tit.2009.2018350","title":"Braided Block Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":95,"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 Alberta","funders":"National Aeronautics and Space Administration; National Science Foundation","keywords":"Block code; Concatenated error correction code; Linear code; Expander code; Computer science; Decoding methods; Serial concatenated convolutional codes; Convolutional code; Tornado code; Block (permutation group theory); Sequential decoding; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.009182243179655785,"score_gpt":0.24043260148729442,"score_spread":0.23125035830763863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100525102","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.0021796634,0.0000048977963,0.9806467,0.0005637471,0.0004706374,0.00017618656,0.0000038111302,0.0014609414,0.014493386],"genre_scores_gemma":[0.9769516,0.000008242445,0.020194607,0.0025383828,0.00001368716,0.000019751807,0.0000010719186,0.000004107558,0.00026853924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990503,0.00008315925,0.0003068236,0.00012540234,0.00024244793,0.00019185324],"domain_scores_gemma":[0.99906486,0.00015964048,0.00010853704,0.0004975764,0.00010422906,0.00006517967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004903253,0.00013505301,0.00011180343,0.0003267001,0.00022664161,0.0001558955,0.000525316,0.00007948111,0.000029240966],"category_scores_gemma":[0.000017032828,0.00013134528,0.00008564612,0.00039948846,0.000028497845,0.0022891099,0.0000013982283,0.00023434675,0.0003220407],"study_design_candidate":"design_other","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.000056368146,0.00013123678,0.0000016979031,0.000012536523,0.000021168502,0.0000016371622,0.0045602215,0.007823833,0.0008632194,0.16859254,0.001565256,0.8163703],"study_design_scores_gemma":[0.0012983173,0.0012600981,0.0004734843,0.00017775939,0.000038500682,0.0002191609,0.00052757736,0.11532062,0.64423776,0.2247241,0.010481032,0.0012416033],"about_ca_topic_score_codex":0.000005023741,"about_ca_topic_score_gemma":0.0000022873576,"teacher_disagreement_score":0.9747719,"about_ca_system_score_codex":0.000065051005,"about_ca_system_score_gemma":0.000044498793,"threshold_uncertainty_score":0.5356105},"labels":[],"label_agreement":null},{"id":"W2101136017","doi":"10.1109/tit.2003.815807","title":"Simultaneous zero-tailing of parallel concatenated codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Convolutional code; Encoder; Zero (linguistics); Computer science; Encoding (memory); Trellis (graph); Algorithm; Sequence (biology); Code (set theory); Turbo code; Serial concatenated convolutional codes; Concatenated error correction code; Theoretical computer science; Decoding methods; Block code; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.007713919436351976,"score_gpt":0.22486360769626335,"score_spread":0.21714968825991138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101136017","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.004713013,0.00004973585,0.9867127,0.0000056908134,0.00015105255,0.00020393608,0.00002881684,0.00068524905,0.007449816],"genre_scores_gemma":[0.98757285,0.0002540567,0.011971045,0.000053287426,0.0000018798287,0.000054598422,0.000009349675,0.000017425502,0.00006549298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919844,0.00006717801,0.00042584838,0.000051224102,0.0001230043,0.0001342906],"domain_scores_gemma":[0.99906,0.0003725282,0.000085558095,0.00033448017,0.00010642519,0.000041022573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022008261,0.00013058285,0.00015070238,0.00020107659,0.00008982811,0.000015121965,0.00015553742,0.00009284984,0.00009621752],"category_scores_gemma":[0.000030177736,0.00013623387,0.000058809965,0.00021400304,0.00007313735,0.0005834292,5.0746655e-7,0.00021316047,0.00006392396],"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.00002507543,0.000021392852,6.666623e-7,0.00004526296,0.000031437237,1.7963768e-7,0.0005752502,0.9530496,0.0016293323,0.01700052,0.000024092657,0.027597163],"study_design_scores_gemma":[0.00065165333,0.00007234354,0.0000030818644,0.00007818413,0.000025171192,0.0000117342315,0.0007301742,0.15498546,0.8243858,0.013472832,0.0052429135,0.00034064957],"about_ca_topic_score_codex":0.0000017582065,"about_ca_topic_score_gemma":9.841075e-7,"teacher_disagreement_score":0.98285985,"about_ca_system_score_codex":0.00006531062,"about_ca_system_score_gemma":0.000015011041,"threshold_uncertainty_score":0.55554557},"labels":[],"label_agreement":null},{"id":"W2101362947","doi":"10.1109/tit.2010.2040965","title":"Error Rates of the Maximum-Likelihood Detector for Arbitrary Constellations: Convex/Concave Behavior and Applications","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; University of Ottawa","funders":"","keywords":"Additive white Gaussian noise; Pairwise error probability; Bit error rate; Orthogonal frequency-division multiplexing; Fading; Channel (broadcasting); Detector; Phase-shift keying; Convex optimization; Word error rate","score_opus":0.008903052249735794,"score_gpt":0.2465605908426803,"score_spread":0.23765753859294453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101362947","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.016150074,0.000038571878,0.97985053,0.000034223638,0.00026592537,0.0014280081,0.00028009815,0.00033315417,0.0016194234],"genre_scores_gemma":[0.98937047,0.00006730164,0.008865914,0.00008983815,0.000015491774,0.001539231,0.000016247219,0.00002079348,0.000014737828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925995,0.000029538147,0.00041021887,0.00007377903,0.00009962719,0.00012686494],"domain_scores_gemma":[0.9988149,0.00040740057,0.00012258784,0.00048456347,0.0001223327,0.00004822154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019405335,0.00013837178,0.00013669494,0.00015211415,0.0002313251,0.00002670777,0.0002257215,0.00013481277,0.000050541315],"category_scores_gemma":[0.000010956707,0.00012240703,0.00007477508,0.00017794194,0.00022017276,0.0005434012,0.0000023776938,0.00035204293,0.000010350596],"study_design_candidate":"bench_or_experimental","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.00008604114,0.00015230995,0.00006900464,0.00035985812,0.00012211852,5.130119e-8,0.001652109,0.008503354,0.040642876,0.0645774,0.0000968648,0.883738],"study_design_scores_gemma":[0.0009725123,0.00007159801,0.00051453843,0.00005420085,0.00012583939,0.000019298384,0.0010909425,0.014932188,0.9292581,0.03985766,0.01267386,0.0004292422],"about_ca_topic_score_codex":0.0000019335414,"about_ca_topic_score_gemma":0.000010512678,"teacher_disagreement_score":0.97322035,"about_ca_system_score_codex":0.000025105817,"about_ca_system_score_gemma":0.000033104512,"threshold_uncertainty_score":0.49916136},"labels":[],"label_agreement":null},{"id":"W2101989261","doi":"10.1109/tit.2011.2165793","title":"On the Per-Sample Capacity of Nondispersive Optical Fibers","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Network Technologies","field":"Engineering","cited_by":49,"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":"Optical fiber; Sample (material); Computer science; Environmental science; Telecommunications; Optics; Physics; Thermodynamics","score_opus":0.015521125366030394,"score_gpt":0.18400199555287508,"score_spread":0.16848087018684468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101989261","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.1682695,0.0000028458212,0.806157,0.0000511414,0.00029224897,0.00017906335,0.000052741652,0.000329392,0.024666077],"genre_scores_gemma":[0.9951293,0.000013814967,0.0046970085,0.00009959568,0.0000052332816,0.000032141445,0.0000015684848,0.000008891159,0.000012475554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940956,0.000021023774,0.00022470266,0.000050542174,0.00013934022,0.00015481419],"domain_scores_gemma":[0.99907655,0.0005492719,0.000030332012,0.00026974495,0.000040781764,0.000033306915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017498652,0.00011226151,0.00010127567,0.0001232517,0.00008455713,0.000011800043,0.00018025527,0.00010691004,0.00062254345],"category_scores_gemma":[0.00003593111,0.000082288556,0.00008021497,0.00015304078,0.00020302743,0.00032604413,9.903572e-7,0.0002985007,0.0002799233],"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.00012549009,0.00007597509,0.0000020080167,0.000052489933,0.00012416096,2.5683778e-7,0.0054604914,0.12304209,0.00022786076,0.84389573,0.00037939614,0.026614025],"study_design_scores_gemma":[0.001306634,0.0011430017,0.00047635895,0.00020171561,0.0001958336,0.000017358845,0.014403754,0.1362601,0.6337065,0.20979609,0.0014021461,0.001090482],"about_ca_topic_score_codex":0.0000055912856,"about_ca_topic_score_gemma":0.0000023325626,"teacher_disagreement_score":0.8268598,"about_ca_system_score_codex":0.00004977272,"about_ca_system_score_gemma":0.000006732041,"threshold_uncertainty_score":0.6816414},"labels":[],"label_agreement":null},{"id":"W2102086743","doi":"10.1109/18.959281","title":"Algorithms to enumerate codewords for DC/sup 2/-constrained channels","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"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 Alberta","funders":"","keywords":"Enumeration; Computer science; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.014081156210546595,"score_gpt":0.2420030752528459,"score_spread":0.2279219190422993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102086743","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.002422146,0.0000049895248,0.99217564,0.00064866483,0.001183532,0.00051163987,0.000051049596,0.0003882126,0.0026141205],"genre_scores_gemma":[0.9728931,0.000013848288,0.023220697,0.0029112261,0.00007758703,0.00035743965,0.000008102475,0.000011856326,0.0005061464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884504,0.00008254543,0.00035754635,0.00018956752,0.00020483522,0.00032043696],"domain_scores_gemma":[0.99891174,0.00027152905,0.0000843031,0.0004243435,0.00015402179,0.00015404599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143367,0.00018438286,0.00015356422,0.00051014515,0.00043361654,0.000250994,0.000513162,0.00008629625,0.00012038169],"category_scores_gemma":[0.000014037375,0.00018135284,0.00017416787,0.00075287913,0.00005330896,0.0017188659,0.0000030899653,0.00015114131,0.00027371309],"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.00027434845,0.00008788588,5.7404156e-7,0.00001830216,0.00005680627,0.0000010585711,0.005194401,0.041530803,0.000111125875,0.2936547,0.00029574957,0.65877426],"study_design_scores_gemma":[0.0047811205,0.0021503656,0.000034478326,0.00020107953,0.00009840376,0.00018607714,0.0022049735,0.3819757,0.056863002,0.3967306,0.15286821,0.0019059785],"about_ca_topic_score_codex":0.000002374261,"about_ca_topic_score_gemma":0.0000010183534,"teacher_disagreement_score":0.97047096,"about_ca_system_score_codex":0.000037433358,"about_ca_system_score_gemma":0.000049092836,"threshold_uncertainty_score":0.7395354},"labels":[],"label_agreement":null},{"id":"W2102278702","doi":"10.1109/tit.2014.2298436","title":"The Entropy Power Inequality for Quantum Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":74,"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":"Inequality; Quantum relative entropy; Statistical physics; Quantum; Mathematics; Physics; Quantum discord; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.00955767166377284,"score_gpt":0.23279398317528943,"score_spread":0.2232363115115166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102278702","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.00050064316,0.000011760518,0.9941564,0.0003913543,0.0025636402,0.00036748606,0.000022694272,0.00020213476,0.0017838666],"genre_scores_gemma":[0.99786764,0.000009011945,0.0011203845,0.00043434685,0.0000446866,0.00016016782,0.0000023764335,0.0000055146875,0.0003558787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.00029017474,0.00039492143,0.000110850946,0.0002183862,0.00022436706],"domain_scores_gemma":[0.99799126,0.0011166398,0.00015779851,0.0005367796,0.000131874,0.00006563277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023844843,0.00012213111,0.00011392431,0.0000936513,0.0006973927,0.00035104374,0.0005525195,0.00006144651,0.000015231987],"category_scores_gemma":[0.00004091271,0.00008353017,0.00011112814,0.00017111312,0.000058727383,0.001245716,0.0000022555948,0.00013745329,0.00020852091],"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.000055088953,0.000019316725,1.01997145e-7,0.000018102755,0.000015092102,2.8837023e-8,0.0006059551,0.0044124713,0.0000152351895,0.9575779,0.00016234019,0.03711838],"study_design_scores_gemma":[0.0009000208,0.00030359637,0.000010771986,0.000027135398,0.000014689848,0.000011241531,0.0006059375,0.63204783,0.0040396214,0.2532774,0.108469896,0.0002918852],"about_ca_topic_score_codex":0.0000030870456,"about_ca_topic_score_gemma":3.7833533e-7,"teacher_disagreement_score":0.99736696,"about_ca_system_score_codex":0.000035253073,"about_ca_system_score_gemma":0.000031679654,"threshold_uncertainty_score":0.5363851},"labels":[],"label_agreement":null},{"id":"W2103113479","doi":"10.1109/tit.2009.2025554","title":"Precoding for the AWGN Channel With Discrete Interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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 Waterloo","funders":"","keywords":"Emphasis (telecommunications); Mathematics; Channel (broadcasting); Precoding; Combinatorics; Computer science; Telecommunications","score_opus":0.011977445169591662,"score_gpt":0.2304539970844034,"score_spread":0.21847655191481175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103113479","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.00063873874,0.000026373998,0.99434924,0.0003116326,0.00012101239,0.00042583165,0.000029917064,0.0006304287,0.003466831],"genre_scores_gemma":[0.9976096,0.00012317309,0.0017094899,0.00025838922,0.000011743165,0.00023135831,0.0000064853602,0.000009876795,0.00003985402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950236,0.000022306938,0.00020943939,0.00004814985,0.00009059258,0.00012715915],"domain_scores_gemma":[0.9992912,0.00022969117,0.00004350868,0.00034601256,0.00006137482,0.00002823332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024034083,0.00011346718,0.00008312043,0.00011887362,0.00019964062,0.00007447111,0.0002679663,0.000050832794,0.000025419342],"category_scores_gemma":[0.00000441047,0.00008115094,0.00004850147,0.00013326552,0.000038821552,0.000852202,5.9162323e-7,0.00020295737,0.00002100282],"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.00036610966,0.000048931037,4.3654993e-7,0.00009640078,0.00012735857,9.770762e-8,0.01181231,0.39044142,0.00038965058,0.048872244,0.0008282356,0.5470168],"study_design_scores_gemma":[0.0013530857,0.0007313938,0.00013062396,0.00040187282,0.00011303481,0.000023062683,0.0032337313,0.70435596,0.24988234,0.025350858,0.013571291,0.0008527252],"about_ca_topic_score_codex":0.0000013369388,"about_ca_topic_score_gemma":0.0000042844035,"teacher_disagreement_score":0.9969709,"about_ca_system_score_codex":0.00004781099,"about_ca_system_score_gemma":0.000009461688,"threshold_uncertainty_score":0.33092391},"labels":[],"label_agreement":null},{"id":"W2103286274","doi":"10.1109/tit.2003.809569","title":"The inequalities of quantum information theory","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":111,"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":"Mathematics; Von Neumann entropy; Combinatorics; Multipartite; Density matrix; Quantum relative entropy; Discrete mathematics; Subadditivity; Quantum state; Entropy (arrow of time); Monotonic function; Quantum; Quantum entanglement; Quantum discord; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.007305151534862395,"score_gpt":0.2129751825237104,"score_spread":0.205670030988848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103286274","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.0037872144,0.000029947505,0.99027324,0.00017324318,0.0010661846,0.00018022199,0.000016627186,0.00016650268,0.0043068263],"genre_scores_gemma":[0.99601996,0.00003240387,0.003242065,0.0005414985,0.000012692537,0.000027326834,0.0000027121177,0.00000501564,0.000116333526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832743,0.00039496255,0.00060542463,0.00008123009,0.0003552687,0.00023568227],"domain_scores_gemma":[0.99804366,0.0009221987,0.00028668644,0.0005144383,0.00017674766,0.000056268047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019541185,0.00015534235,0.00013506226,0.00024883545,0.00057646626,0.00021613113,0.00052098185,0.00007133654,0.000024831641],"category_scores_gemma":[0.000077331046,0.00010801219,0.00011888232,0.00040839455,0.00013116223,0.0021865233,0.0000037737464,0.0002628461,0.00011285721],"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.000027518514,0.0000167171,3.3913045e-7,0.000019613011,0.000020422904,7.032398e-8,0.004867578,0.032881908,0.00000639028,0.7906913,0.000060770064,0.17140736],"study_design_scores_gemma":[0.0010787474,0.00037946829,0.00007133206,0.00009458584,0.00002499187,0.00005196307,0.00493377,0.39472866,0.023933802,0.53342944,0.040759813,0.00051340525],"about_ca_topic_score_codex":0.000005030461,"about_ca_topic_score_gemma":5.765781e-7,"teacher_disagreement_score":0.99223274,"about_ca_system_score_codex":0.00003106345,"about_ca_system_score_gemma":0.00010646832,"threshold_uncertainty_score":0.44337708},"labels":[],"label_agreement":null},{"id":"W2103374230","doi":"10.1109/18.910581","title":"Analyzing the turbo decoder using the Gaussian approximation","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Turbo code; Convolutional code; Low-density parity-check code; Serial concatenated convolutional codes; Algorithm; Additive white Gaussian noise; Decoding methods; Concatenated error correction code; Mathematics; Gaussian; Computer science; Block code; White noise; Statistics; Physics","score_opus":0.018742915787540726,"score_gpt":0.26302770636179845,"score_spread":0.24428479057425773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103374230","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.004599509,0.000016822869,0.9897672,0.00087535335,0.0005684687,0.00031464855,0.0000016556477,0.0005093469,0.0033469747],"genre_scores_gemma":[0.98419005,0.000020546515,0.014820702,0.00077829283,0.00003095351,0.000053021944,0.0000010696917,0.000008331889,0.00009700626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988126,0.00022574364,0.000356972,0.00012808327,0.00025871306,0.00021785151],"domain_scores_gemma":[0.9986337,0.00031212912,0.00019768738,0.0007087658,0.00010965442,0.000038086768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012475916,0.0001467038,0.00009248326,0.00023602968,0.00088398973,0.00034112547,0.0007729814,0.000069384754,0.00003944604],"category_scores_gemma":[0.000021790147,0.000089478366,0.000104128296,0.00078104594,0.00007682105,0.0023712004,0.0000053849894,0.00034639423,0.00007068262],"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.00006275622,0.00007673321,0.000027885028,0.000021453145,0.000075648255,0.000001269273,0.01748629,0.10651365,0.0004062268,0.066273406,0.000300634,0.808754],"study_design_scores_gemma":[0.00025702675,0.000059599763,0.00012142331,0.000059685914,0.00004333854,0.00015622817,0.0014539531,0.9439251,0.024595715,0.026896562,0.0021093285,0.0003220306],"about_ca_topic_score_codex":0.000025678173,"about_ca_topic_score_gemma":0.000010824375,"teacher_disagreement_score":0.9795906,"about_ca_system_score_codex":0.00011016569,"about_ca_system_score_gemma":0.000052749965,"threshold_uncertainty_score":0.6799024},"labels":[],"label_agreement":null},{"id":"W2103402422","doi":"10.1109/tit.2008.2011436","title":"Joint Source–Channel Coding Excess Distortion Exponent for Some Memoryless Continuous-Alphabet Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Gaussian; Exponent; Mathematics; Distortion (music); Source code; Upper and lower bounds; Discrete mathematics; Algorithm; Topology (electrical circuits); Computer science; Combinatorics; Mathematical analysis; Physics; Telecommunications","score_opus":0.01534998377513118,"score_gpt":0.22538147524452534,"score_spread":0.21003149146939415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103402422","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.015879344,0.000116412695,0.97946227,0.00010086706,0.0008692806,0.00088335417,0.00009020562,0.0015693263,0.0010289662],"genre_scores_gemma":[0.9985958,0.00015817466,0.0003431782,0.00018387259,0.00005738964,0.0004745801,0.000056966775,0.000028549483,0.00010153563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860656,0.000079557525,0.0006961775,0.00011231068,0.00024358231,0.00026181046],"domain_scores_gemma":[0.99900526,0.00013386179,0.0001642758,0.00047779892,0.00012996195,0.00008884953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006278635,0.00023050199,0.0002831571,0.00039051345,0.0002869602,0.00014496378,0.00026111442,0.00013777894,0.000017537848],"category_scores_gemma":[0.000010079921,0.0002515969,0.00014714427,0.00015326287,0.000042773383,0.0016640049,0.0000013794538,0.00027085855,0.00004636071],"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.00025529164,0.00029470594,4.7851483e-7,0.0007023658,0.00017985556,6.949264e-7,0.012122272,0.7056211,0.0066185356,0.07157222,0.0024113974,0.20022103],"study_design_scores_gemma":[0.0021666766,0.00043423404,0.000069030175,0.00068409054,0.00013711005,0.00003208091,0.0059632445,0.5154141,0.44885716,0.014286577,0.010552867,0.0014027812],"about_ca_topic_score_codex":0.000006591607,"about_ca_topic_score_gemma":0.0000012437844,"teacher_disagreement_score":0.9827164,"about_ca_system_score_codex":0.00026721915,"about_ca_system_score_gemma":0.000015759691,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W2104513950","doi":"10.1109/tit.2008.921887","title":"Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":26,"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":"Hash function; Type (biology); Discrete mathematics; Mathematics; Probabilistic logic; Combinatorics; Theoretical computer science; Perfect hash function; Computer science; Cryptographic hash function; Statistics; Computer security","score_opus":0.008902227644974814,"score_gpt":0.23285516497178477,"score_spread":0.22395293732680996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104513950","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.011475611,0.00005195719,0.98664856,0.00008834169,0.0003036469,0.000364188,0.00003146478,0.00060229417,0.0004339168],"genre_scores_gemma":[0.9523937,0.00018797154,0.046832353,0.0002888448,0.000013006118,0.0001507968,0.000007653019,0.0000074182935,0.000118270604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991614,0.00004732684,0.00033091046,0.00015025781,0.00011694419,0.00019315585],"domain_scores_gemma":[0.9992358,0.00022134667,0.00013232903,0.0002708801,0.00008904107,0.000050618266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029911034,0.00014983013,0.00014040158,0.00026684662,0.00072612416,0.00010745917,0.00022558757,0.00012242878,0.000002645608],"category_scores_gemma":[0.000011233744,0.00013719188,0.000089952126,0.00022406821,0.00014321558,0.0031541951,0.0000032582257,0.00019769717,0.000004396119],"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.0005493087,0.00023995114,0.000029209385,0.0004762429,0.00029478755,0.0000044993894,0.054672252,0.009253639,0.004164363,0.5548989,0.00060026324,0.3748166],"study_design_scores_gemma":[0.0022328377,0.00092070625,0.00014128005,0.00019134833,0.000044120392,0.00020307687,0.00091221236,0.1908111,0.17707087,0.6218251,0.0046897926,0.0009575788],"about_ca_topic_score_codex":0.0000028874283,"about_ca_topic_score_gemma":0.0000010498123,"teacher_disagreement_score":0.9409181,"about_ca_system_score_codex":0.000023685085,"about_ca_system_score_gemma":0.000039230927,"threshold_uncertainty_score":0.55945224},"labels":[],"label_agreement":null},{"id":"W2104759901","doi":"10.1109/tit.2007.915918","title":"On the Optimal Number of Active Receivers in Fading Broadcast Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"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":"Fading; Rayleigh fading; Infinity; Computer science; Channel (broadcasting); Power (physics); Topology (electrical circuits); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Telecommunications; Physics; Mathematical analysis","score_opus":0.027237080660768312,"score_gpt":0.2568009202336602,"score_spread":0.2295638395728919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104759901","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.05835139,0.000005013518,0.92778873,0.0003892401,0.0002747078,0.00018497783,0.0000047794365,0.00005087449,0.012950297],"genre_scores_gemma":[0.99834365,0.00021880743,0.00071419403,0.0005008442,0.0000062565723,0.00002829181,0.0000011897903,0.0000034335405,0.0001833634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991342,0.00020792695,0.00026540156,0.000084981686,0.00017932698,0.00012819242],"domain_scores_gemma":[0.99886096,0.00051616854,0.00011228204,0.00038191196,0.00009786482,0.000030802617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857344,0.00009839099,0.00010200341,0.00018562652,0.0002934864,0.00003202848,0.00047403527,0.000043829325,0.00020544867],"category_scores_gemma":[0.000019636776,0.000078255754,0.000061175764,0.00053469447,0.0000897546,0.0011779262,0.0000050395597,0.00027245414,0.00019050906],"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.00023416162,0.00017936078,0.000006375888,0.000009315108,0.000049544462,0.000001385579,0.057726875,0.30254942,0.00013147954,0.32232803,0.00045854863,0.31632552],"study_design_scores_gemma":[0.005080985,0.0006852826,0.00140793,0.00070720736,0.000029803514,0.00018567209,0.009699985,0.77117944,0.18382446,0.014818146,0.010890858,0.0014902102],"about_ca_topic_score_codex":0.000003885513,"about_ca_topic_score_gemma":0.0000015831187,"teacher_disagreement_score":0.93999225,"about_ca_system_score_codex":0.00007763351,"about_ca_system_score_gemma":0.000045679284,"threshold_uncertainty_score":0.31911772},"labels":[],"label_agreement":null},{"id":"W2105512769","doi":"10.1109/tit.2010.2044062","title":"On the Construction of Skew Quasi-Cyclic Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Yildiz Teknik Üniversitesi; Ohio State University","keywords":"Ring (chemistry); Skew; Polynomial ring; Computer science; Combinatorics; Algorithm; Discrete mathematics; Polynomial; Mathematics; Telecommunications","score_opus":0.006696594448420201,"score_gpt":0.2075444106367516,"score_spread":0.20084781618833142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105512769","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.066097885,0.0000016361752,0.9254663,0.0003569008,0.0010974795,0.00014576843,0.000013246568,0.00013157059,0.0066891885],"genre_scores_gemma":[0.9960459,0.0000073256288,0.0033431745,0.00052638736,0.000013710049,0.000029723324,0.0000010264914,0.0000035759617,0.000029168083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991369,0.00013337746,0.00028646865,0.00009509533,0.00022113789,0.00012699596],"domain_scores_gemma":[0.9984708,0.0007162764,0.00015365674,0.00053326564,0.00008384854,0.000042160234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885739,0.00011132434,0.000099860896,0.00027194255,0.00031512536,0.000083831554,0.00046501894,0.00007470857,0.00021366333],"category_scores_gemma":[0.000025096555,0.00008056265,0.00012543045,0.00041874906,0.00021919656,0.00089319417,0.0000020144184,0.00034863982,0.00013990852],"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.000046337136,0.000051556995,0.0000012550115,0.0000072116645,0.000017170421,5.7402712e-8,0.0009416155,0.00021474823,0.0004905286,0.890423,0.000040833183,0.107765704],"study_design_scores_gemma":[0.00041419893,0.00031552726,0.000104865896,0.000041520274,0.000020268435,0.000027174976,0.000418726,0.0042334916,0.11418487,0.87759215,0.0024256946,0.00022154518],"about_ca_topic_score_codex":0.0000032768428,"about_ca_topic_score_gemma":0.0000034384977,"teacher_disagreement_score":0.92994803,"about_ca_system_score_codex":0.000009761117,"about_ca_system_score_gemma":0.000033670778,"threshold_uncertainty_score":0.32852495},"labels":[],"label_agreement":null},{"id":"W2105546360","doi":"10.1109/tit.2005.853318","title":"An analysis of the orthogonality structures of convolutional codes for iterative decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Decoding methods; Sequential decoding; Algorithm; Orthogonality; List decoding; Computer science; Belief propagation; Mathematics; Berlekamp–Welch algorithm; Concatenated error correction code; Block code","score_opus":0.013512906685516492,"score_gpt":0.28592022626285846,"score_spread":0.272407319577342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105546360","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.07422297,0.000003820029,0.92498744,0.00006654725,0.00014000856,0.00019040791,0.0001290902,0.000082196384,0.00017750135],"genre_scores_gemma":[0.95634663,0.0000014413758,0.043432858,0.00016412248,0.0000072157604,0.000028227394,0.0000060462194,0.0000023442853,0.000011104983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990489,0.00013253739,0.00041218862,0.000093968265,0.00022012464,0.00009232026],"domain_scores_gemma":[0.99859273,0.00038628565,0.00030540556,0.00037988136,0.0003104102,0.000025277026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006538678,0.00008681226,0.00015896016,0.00033748712,0.00017412916,0.000031626245,0.00044052282,0.00005189223,0.000028383927],"category_scores_gemma":[0.000025651601,0.00006666837,0.00019523925,0.00058843597,0.0000912165,0.0012835097,0.0000024016863,0.000095441996,7.3406153e-7],"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.0001092851,0.000104369254,0.00025937488,0.000035509212,0.00036552822,1.462145e-8,0.009273735,0.3910588,0.0017859536,0.5132757,0.000025964795,0.08370579],"study_design_scores_gemma":[0.0002361394,0.00010647287,0.0051410105,0.000021772603,0.00018056289,0.0000020291075,0.00035907383,0.7036272,0.2732056,0.01688474,0.000097596465,0.00013773511],"about_ca_topic_score_codex":0.000011579482,"about_ca_topic_score_gemma":0.000052893203,"teacher_disagreement_score":0.88212365,"about_ca_system_score_codex":0.000058559715,"about_ca_system_score_gemma":0.00006627352,"threshold_uncertainty_score":0.27186573},"labels":[],"label_agreement":null},{"id":"W2105854862","doi":"10.1109/tit.2007.915887","title":"On the User Selection for MIMO Broadcast Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":108,"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":"Telecommunications link; Rayleigh fading; Base station; Throughput; Computer science; MIMO; Fading; Selection (genetic algorithm); Set (abstract data type); Communications system; Mathematical optimization; Algorithm; Mathematics; Computer network; Telecommunications; Wireless; Decoding methods; Channel (broadcasting)","score_opus":0.010630493839973889,"score_gpt":0.2045153286103264,"score_spread":0.1938848347703525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105854862","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.0033433083,0.000008091359,0.9920326,0.00004859597,0.0011077399,0.0006810243,0.000039102088,0.00044949507,0.0022900708],"genre_scores_gemma":[0.9972738,0.000039546903,0.0010921273,0.00026791473,0.000062616615,0.00045027057,0.0000141376995,0.000030389716,0.0007692033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.000036569065,0.0002945327,0.000076773,0.00012570196,0.0001801696],"domain_scores_gemma":[0.9993471,0.00027515285,0.000059830694,0.0001777003,0.00010107157,0.000039174516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020147307,0.00015528529,0.00010564619,0.00020059709,0.00040689186,0.000032141274,0.00009539905,0.00009329323,0.000119499135],"category_scores_gemma":[0.0000162713,0.00012792501,0.000082583276,0.00024878906,0.000034313736,0.00090847426,2.9290214e-7,0.00017318362,0.0002602207],"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.000067238274,0.000014863042,2.4402704e-7,0.000026047877,0.000028245679,4.7975682e-8,0.0010868689,0.98592025,0.00012663865,0.0060328525,0.0014180294,0.0052786777],"study_design_scores_gemma":[0.0015136705,0.00029641544,0.00000887712,0.00010115659,0.00004284148,0.00006752631,0.00084244914,0.8600785,0.11119701,0.0036768008,0.02158781,0.00058694277],"about_ca_topic_score_codex":0.0000020745802,"about_ca_topic_score_gemma":0.0000015254058,"teacher_disagreement_score":0.99393046,"about_ca_system_score_codex":0.00012248132,"about_ca_system_score_gemma":0.000015614982,"threshold_uncertainty_score":0.52166307},"labels":[],"label_agreement":null},{"id":"W2106235749","doi":"10.1109/tit.2010.2079590","title":"Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"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; Lakehead University","funders":"","keywords":"Polyphase system; Multiplicative function; Sequence (biology); Mathematics; Correlation; Complementary sequences; Discrete mathematics; Combinatorics; Algorithm; Computer science; Physics; Mathematical analysis; Biology; Genetics","score_opus":0.005572041426733712,"score_gpt":0.2070042543238948,"score_spread":0.2014322128971611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106235749","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.14273149,0.0000038064586,0.85545033,0.00035281002,0.00034730448,0.0002278673,0.000015369043,0.00015506042,0.0007159364],"genre_scores_gemma":[0.99765325,0.000016808395,0.0014796647,0.00070772716,0.000014385041,0.000070469716,0.0000036084277,0.0000046085825,0.000049457845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926174,0.000084873354,0.00019149785,0.00013723622,0.0001774467,0.0001472272],"domain_scores_gemma":[0.99893796,0.0003433219,0.00012839788,0.0004372212,0.000091389906,0.00006170442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047100915,0.00013597302,0.00008262575,0.00018932323,0.00060375704,0.00023770891,0.00033402757,0.00006264886,0.000019874928],"category_scores_gemma":[0.000009299233,0.000091685695,0.00004541814,0.00036278804,0.00030374693,0.002344421,0.0000030052176,0.00037868603,0.00006124741],"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.00030941225,0.00009037262,0.000041144704,0.000020879981,0.000053904136,7.924696e-7,0.01705738,0.0012525187,0.00287693,0.51890457,0.00001782143,0.45937428],"study_design_scores_gemma":[0.010927625,0.0027081794,0.016954115,0.00049701927,0.0003275739,0.00095315505,0.01931088,0.44532487,0.21281487,0.2675135,0.01877568,0.0038925435],"about_ca_topic_score_codex":0.000008833752,"about_ca_topic_score_gemma":0.000012475947,"teacher_disagreement_score":0.85492176,"about_ca_system_score_codex":0.00001390873,"about_ca_system_score_gemma":0.000042808253,"threshold_uncertainty_score":0.4643672},"labels":[],"label_agreement":null},{"id":"W2106335950","doi":"10.1109/tit.2008.926315","title":"Network Inference From Co-Occurrences","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Inference; Random walk; Random permutation; Permutation (music); Monte Carlo method; Random graph; Exponential growth; Belief propagation; Stochastic process","score_opus":0.017909350498590364,"score_gpt":0.2635177903557149,"score_spread":0.24560843985712452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106335950","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.021978416,0.000007760161,0.95864135,0.000026448179,0.00019496179,0.0001220069,0.00012130052,0.00017143549,0.018736292],"genre_scores_gemma":[0.99822265,0.0000122721485,0.0011523777,0.00019504807,0.00013589431,0.00006018986,0.00009086039,0.000005644764,0.0001250783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911815,0.00007795273,0.00033535017,0.000102276266,0.00018207745,0.00018420533],"domain_scores_gemma":[0.9991942,0.0002792434,0.0001410951,0.00026020725,0.00006531633,0.00005990878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015646797,0.00014352071,0.00015885857,0.000108243796,0.00039837972,0.00004597361,0.00018625964,0.000039178907,0.0034064709],"category_scores_gemma":[0.0000013809702,0.0001362745,0.00011941816,0.0002567365,0.000092877664,0.0007522523,0.0000011652007,0.00021925766,0.0004906182],"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.0002471201,0.00037296687,0.003915471,0.000010495637,0.0005564838,0.000001244748,0.0072901924,0.18737279,0.000055084256,0.1495025,0.023558898,0.62711674],"study_design_scores_gemma":[0.002869199,0.00047745748,0.00869236,0.000307865,0.00046195005,0.000007708119,0.0035143376,0.0749229,0.041912615,0.77403647,0.08995909,0.0028380423],"about_ca_topic_score_codex":0.000111259666,"about_ca_topic_score_gemma":0.0000031958796,"teacher_disagreement_score":0.9762442,"about_ca_system_score_codex":0.000021077441,"about_ca_system_score_gemma":0.00004897439,"threshold_uncertainty_score":0.99750453},"labels":[],"label_agreement":null},{"id":"W2106711692","doi":"10.1109/tit.2003.809560","title":"Secret-key agreement over unauthenticated public channels-part II: the simulatability condition","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"A priori and a posteriori; Computer science; Formalism (music); Key (lock); Secret sharing; Context (archaeology); Theoretical computer science; Representation (politics); Authentication (law); Channel (broadcasting); Cryptography; Computer security; Mathematics; Topology (electrical circuits); Computer network; Combinatorics","score_opus":0.014349473895898947,"score_gpt":0.2329499708838691,"score_spread":0.21860049698797016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106711692","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.07782079,0.000037863738,0.90728784,0.00028214138,0.00072770147,0.0007057307,0.00009769601,0.0010801755,0.011960076],"genre_scores_gemma":[0.99894726,0.00007829159,0.00020669804,0.00032560187,0.000012798712,0.00024090156,0.000063717605,0.000018356364,0.00010638705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986126,0.0002372243,0.00051309034,0.000101559126,0.0002941553,0.00024138525],"domain_scores_gemma":[0.99864495,0.00022617156,0.00009319461,0.0008175038,0.00014000101,0.00007815953],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009574367,0.0001961483,0.00014134584,0.00022194047,0.0005003656,0.00012581986,0.00031032474,0.00012919396,0.0017045737],"category_scores_gemma":[0.00003188527,0.00017002363,0.00010442928,0.00037986197,0.0001322133,0.0013716514,0.0000029630041,0.0003891983,0.00023496048],"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.00010895711,0.000629967,0.0000184107,0.00027356893,0.000507566,5.174671e-7,0.024854971,0.29070663,0.00076070445,0.62818223,0.004871272,0.04908519],"study_design_scores_gemma":[0.0020959047,0.00023665848,0.00017341517,0.00013871622,0.0001426935,0.000020052428,0.0030731389,0.21517791,0.18879241,0.060447987,0.5284276,0.0012735031],"about_ca_topic_score_codex":0.0000039667793,"about_ca_topic_score_gemma":0.0000061649644,"teacher_disagreement_score":0.9211264,"about_ca_system_score_codex":0.00018499866,"about_ca_system_score_gemma":0.000031205138,"threshold_uncertainty_score":0.99920803},"labels":[],"label_agreement":null},{"id":"W2107744299","doi":"10.1109/18.825842","title":"On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":26,"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":"Cyclic code; Golomb coding; BCH code; Autocorrelation; Sequence (biology); Mathematics; Code (set theory); Polynomial code; Ideal (ethics); Pseudorandom binary sequence; Binary number; Constant-weight code; Linear code; TRACE (psycholinguistics); Discrete mathematics; Error detection and correction; Algorithm; Decoding methods; Computer science; Block code; Arithmetic; Statistics","score_opus":0.012212847674001232,"score_gpt":0.24045029843727897,"score_spread":0.22823745076327773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107744299","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.07701477,0.00001014203,0.9113634,0.00016187527,0.0007582308,0.00041804192,0.000018984525,0.0005760142,0.009678531],"genre_scores_gemma":[0.99793166,0.00001160022,0.0008439949,0.00071561243,0.000008842057,0.000067087174,0.000005887739,0.000008284357,0.00040700543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986379,0.00023859023,0.00043468675,0.00022085969,0.00023828456,0.00022968715],"domain_scores_gemma":[0.9988399,0.00049891486,0.000149509,0.0003614195,0.00005282144,0.000097409626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007238436,0.00019399727,0.00015449485,0.00039434715,0.00053368823,0.00017909914,0.00027266762,0.00013609414,0.00045204768],"category_scores_gemma":[0.000026495081,0.00018547701,0.00010607836,0.0006482349,0.00009459745,0.0016939469,0.00000182552,0.00040590658,0.00029065317],"study_design_candidate":"design_other","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.00041316403,0.000075967924,0.000003259294,0.000016741218,0.00004649914,0.00000238504,0.008902442,0.0489899,0.00009973046,0.17396575,0.00007552303,0.76740867],"study_design_scores_gemma":[0.0046512103,0.0013387393,0.0007586158,0.00035450395,0.00009614349,0.00054301,0.0008681851,0.60358196,0.0076780524,0.3757589,0.00317882,0.001191839],"about_ca_topic_score_codex":0.000007406452,"about_ca_topic_score_gemma":0.0000029753644,"teacher_disagreement_score":0.9209169,"about_ca_system_score_codex":0.000058696405,"about_ca_system_score_gemma":0.000044294604,"threshold_uncertainty_score":0.7563533},"labels":[],"label_agreement":null},{"id":"W2107910740","doi":"10.1109/tit.2014.2310391","title":"Decentralized Wireless Networks: Spread Spectrum Communications Revisited","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","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":"","keywords":"Transmitter; Upper and lower bounds; Computer science; Wireless network; Entropy (arrow of time); Gaussian; Mathematics; Gaussian noise; Topology (electrical circuits); Wireless; Multiplexing; Computer network; Algorithm; Telecommunications; Combinatorics; Physics","score_opus":0.014767680682389137,"score_gpt":0.26046224802823764,"score_spread":0.2456945673458485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107910740","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.00028394427,0.000083113,0.988482,0.0020746235,0.00034048385,0.00043967197,0.0000090762305,0.0006040869,0.00768299],"genre_scores_gemma":[0.9866637,0.001203832,0.010497035,0.0012200515,0.000030943567,0.00015191712,0.000035198427,0.000018011673,0.00017930202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708736,0.0010636545,0.00068632496,0.00021890287,0.00047434575,0.00046938768],"domain_scores_gemma":[0.9945251,0.0011913736,0.00025569068,0.0036023988,0.00022077779,0.00020467484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016589002,0.00023471155,0.0002551292,0.0004357245,0.00077517756,0.00045868626,0.0033281432,0.00015241333,0.00012296329],"category_scores_gemma":[0.00003153122,0.00023403321,0.00015262482,0.0011893435,0.00021556923,0.00252625,0.000038274855,0.00070075796,0.0006279964],"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.00006399429,0.0001446384,0.0000055808514,0.000020282387,0.00005512094,2.0285827e-7,0.00076030346,0.0812944,0.000021793796,0.491966,0.0008064953,0.4248612],"study_design_scores_gemma":[0.00071865134,0.000074067575,0.000083367115,0.000079831734,0.000012974396,0.000010799847,0.000053329655,0.96835905,0.0011505685,0.006302715,0.022866128,0.00028851963],"about_ca_topic_score_codex":0.000019239666,"about_ca_topic_score_gemma":0.000012164828,"teacher_disagreement_score":0.98637974,"about_ca_system_score_codex":0.0001497831,"about_ca_system_score_gemma":0.00007387974,"threshold_uncertainty_score":0.95435977},"labels":[],"label_agreement":null},{"id":"W2108236351","doi":"10.1109/18.841196","title":"The capacity-cost function of discrete additive noise channels with and without feedback","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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":"Upper and lower bounds; Aperiodic graph; Markov chain; Mathematics; Noise (video); Function (biology); Channel capacity; Markov process; Topology (electrical circuits); Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.007147524987580594,"score_gpt":0.20126124492046119,"score_spread":0.1941137199328806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108236351","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.09497225,0.0000335045,0.89416933,0.00006522883,0.00011418057,0.0004955102,0.00012575914,0.00041851064,0.009605731],"genre_scores_gemma":[0.9987082,0.00054864853,0.00036472958,0.00005833535,0.000009051885,0.00017255964,0.00001208926,0.000014512375,0.00011191103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993479,0.000062612635,0.00026115015,0.000055950448,0.00015038183,0.000121965364],"domain_scores_gemma":[0.9993664,0.00013337993,0.000059794766,0.00031774704,0.00007979661,0.000042854303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023681433,0.00012857895,0.00011234977,0.00010612651,0.00023330525,0.000057338348,0.00012967605,0.000066874076,0.00013578037],"category_scores_gemma":[0.0000026961457,0.0000960067,0.000034602996,0.00017036726,0.00018595128,0.00092822674,7.4669236e-7,0.00023837511,0.0000429319],"study_design_candidate":"design_other","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.0010551643,0.000054447217,0.000009316685,0.00011631423,0.00026302482,8.074663e-8,0.01208893,0.11520264,0.00043620807,0.0135332495,0.0003380435,0.8569026],"study_design_scores_gemma":[0.006532038,0.001703899,0.0037475217,0.0012566055,0.0005241072,0.00010799193,0.012254805,0.22487475,0.5652953,0.019959472,0.16113713,0.0026064087],"about_ca_topic_score_codex":0.0000072557805,"about_ca_topic_score_gemma":0.000011872571,"teacher_disagreement_score":0.90373594,"about_ca_system_score_codex":0.000036949066,"about_ca_system_score_gemma":0.000009928247,"threshold_uncertainty_score":0.39150396},"labels":[],"label_agreement":null},{"id":"W2108250525","doi":"10.1109/tit.2009.2032803","title":"On the Redundancy of Slepian–Wolf Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":59,"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; University of Waterloo","funders":"","keywords":"Emphasis (telecommunications); Notation; Mathematics; Decoding methods; Discrete mathematics; Combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.009391756757221476,"score_gpt":0.22049165870512452,"score_spread":0.21109990194790304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108250525","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.00926022,0.000016817292,0.94392073,0.00034381446,0.00015316284,0.00022926852,0.000022736966,0.0005719605,0.045481313],"genre_scores_gemma":[0.99885267,0.00012244104,0.00048799606,0.0004489204,0.0000063466264,0.00003123105,0.0000037081265,0.000008307116,0.000038351278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928874,0.00006179105,0.000335365,0.000040870484,0.00016565954,0.000107590306],"domain_scores_gemma":[0.9990884,0.00028342317,0.00006890998,0.00047456918,0.000057583402,0.000027090238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666907,0.00010731681,0.000103447324,0.00020046276,0.00013211406,0.000029775067,0.00026876465,0.00007063308,0.00016518748],"category_scores_gemma":[0.0000133798785,0.00008933151,0.00007245896,0.00021873359,0.000048100443,0.0005003568,5.671533e-7,0.00028652334,0.00008480243],"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.00006903575,0.000075306576,2.1904535e-7,0.0000441299,0.000042942967,1.281126e-7,0.0046075876,0.085065685,0.0018305143,0.7279578,0.0016481534,0.1786585],"study_design_scores_gemma":[0.0006307109,0.00031702558,0.00013299182,0.00037948028,0.000037894835,0.00000951198,0.0011998841,0.059816696,0.82447505,0.10394779,0.008548114,0.000504868],"about_ca_topic_score_codex":0.0000013674769,"about_ca_topic_score_gemma":6.501568e-7,"teacher_disagreement_score":0.9895925,"about_ca_system_score_codex":0.000056489844,"about_ca_system_score_gemma":0.000010291437,"threshold_uncertainty_score":0.36428332},"labels":[],"label_agreement":null},{"id":"W2108998869","doi":"10.1109/tit.2010.2050793","title":"New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"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; Lakehead University","funders":"","keywords":"Computer science","score_opus":0.005039821469258623,"score_gpt":0.19509263527872006,"score_spread":0.19005281380946143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108998869","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.20302546,0.0000055851956,0.7956378,0.000089797846,0.00063481723,0.00013548309,0.00006789934,0.00006566369,0.00033750045],"genre_scores_gemma":[0.97257924,0.00001142859,0.027231446,0.00013590454,0.000019912126,0.00000311228,0.0000075251683,0.000003633548,0.000007792595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990338,0.00009612703,0.0003599628,0.00011693921,0.00028751092,0.00010565451],"domain_scores_gemma":[0.99854547,0.00046317454,0.00032415,0.0004568128,0.0001583354,0.00005206403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023173478,0.00013029309,0.0001343371,0.00018115876,0.00018283844,0.00005587466,0.00046375493,0.00009480549,0.00015014106],"category_scores_gemma":[0.000016469867,0.00008887718,0.000075927666,0.0005327996,0.00032150093,0.0018321946,0.0000028091076,0.0003181519,0.0000068827785],"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.00028725338,0.000026552592,0.00018274154,0.0000313791,0.000090914626,2.8308963e-7,0.008896297,0.028184371,0.026780218,0.55386084,0.000030924333,0.38162822],"study_design_scores_gemma":[0.0010562635,0.00040015203,0.0014287854,0.00020611368,0.00009355443,0.00006422462,0.003922544,0.017445317,0.5703159,0.40435794,0.00029091907,0.00041826456],"about_ca_topic_score_codex":0.000116146075,"about_ca_topic_score_gemma":0.00006452377,"teacher_disagreement_score":0.7695538,"about_ca_system_score_codex":0.000011431486,"about_ca_system_score_gemma":0.00017957955,"threshold_uncertainty_score":0.36243066},"labels":[],"label_agreement":null},{"id":"W2110210964","doi":"10.1109/tit.2009.2027557","title":"Achieving Long-Term Fairness and Optimum Multiuser Diversity Gain in Time-Varying Broadcast Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Network Optimization","field":"Engineering","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; Blackberry (Canada)","funders":"","keywords":"Fading; Base station; Scheduling (production processes); Telecommunications link; Computer science; Channel state information; Diversity gain; Channel (broadcasting); Computer network; Throughput; Term (time); Real-time computing; Telecommunications; Mathematics; Wireless; Mathematical optimization","score_opus":0.006580497590477079,"score_gpt":0.20306506775948485,"score_spread":0.19648457016900778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110210964","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.15508562,0.000030476394,0.84368736,0.000016692587,0.00021294974,0.00022987506,0.000009196574,0.00028089402,0.00044692712],"genre_scores_gemma":[0.9983579,0.00016154176,0.0012541425,0.000106771244,0.000021894353,0.000013305144,0.000017915823,0.00001387917,0.000052672498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919623,0.00004127618,0.0002810627,0.000104219456,0.00015394505,0.00022329003],"domain_scores_gemma":[0.9996191,0.00008209018,0.000050970226,0.00014912752,0.000032920034,0.000065754786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021080578,0.00017634458,0.00015305029,0.0003265227,0.00023400005,0.00006782122,0.00011955719,0.00011023081,0.00005689907],"category_scores_gemma":[0.0000041545923,0.000201256,0.00003887281,0.00027282798,0.000030562627,0.0020652828,0.0000034501966,0.00025078692,0.000051330633],"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.000059011323,0.000022428483,0.00006667124,0.00002868553,0.000010663274,0.0000012269875,0.001733351,0.905474,0.00012789495,0.00004809809,0.0000051035686,0.09242283],"study_design_scores_gemma":[0.0014888311,0.000064769265,0.0027195716,0.00022884014,0.000024961348,0.000014066262,0.00016575036,0.9898123,0.004727809,0.0002635154,0.000017210361,0.00047233907],"about_ca_topic_score_codex":0.0000015639162,"about_ca_topic_score_gemma":0.0000011163314,"teacher_disagreement_score":0.84327227,"about_ca_system_score_codex":0.000120954704,"about_ca_system_score_gemma":0.0000054889233,"threshold_uncertainty_score":0.82069814},"labels":[],"label_agreement":null},{"id":"W2110782814","doi":"10.1109/tit.2003.822610","title":"A Performance Metric for Codes With a High-Order Spectral Null at Zero Frequency","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":20,"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 Alberta","funders":"","keywords":"Mathematics; Null (SQL); Metric (unit); Block code; Linear code; Zero (linguistics); Discrete mathematics; Algorithm; Decoding methods; Computer science","score_opus":0.0063365586492950534,"score_gpt":0.20942592910170368,"score_spread":0.20308937045240863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110782814","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.046552137,0.000030379857,0.9493017,0.000039887524,0.0001416192,0.00050479296,0.00007092289,0.0009865013,0.0023720183],"genre_scores_gemma":[0.92628145,0.0002370957,0.07278223,0.00009307222,0.0000103610555,0.00046881352,0.000028788521,0.000030569176,0.0000676392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919486,0.000016257052,0.00032080684,0.00008562891,0.00016034591,0.00022208405],"domain_scores_gemma":[0.9992376,0.00011195931,0.00007476929,0.00039442032,0.00012512362,0.000056140147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015593687,0.00018953877,0.00015682259,0.0004000143,0.00025156178,0.000031045383,0.000210204,0.000088174325,0.000056525692],"category_scores_gemma":[0.0000058051355,0.00017528342,0.00005468856,0.0005219611,0.00007125138,0.0013618858,0.0000011137528,0.00021000765,0.000089139314],"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.0001246811,0.00004366854,0.0000031136644,0.000116908705,0.0000609363,1.6326752e-7,0.0008002769,0.9531691,0.0008800188,0.017214103,0.000034440996,0.027552553],"study_design_scores_gemma":[0.0034717706,0.0007825804,0.00023310425,0.00022473985,0.00009500526,0.00004751769,0.00031511512,0.027053287,0.9356417,0.028805941,0.0023584773,0.00097072683],"about_ca_topic_score_codex":0.000007653927,"about_ca_topic_score_gemma":0.000014083553,"teacher_disagreement_score":0.9347617,"about_ca_system_score_codex":0.00039813505,"about_ca_system_score_gemma":0.00003347175,"threshold_uncertainty_score":0.71478504},"labels":[],"label_agreement":null},{"id":"W2111076496","doi":"10.1109/tit.2007.913239","title":"On Slow-Fading MIMO Systems With Nonseparable Correlation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":65,"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":"Emphasis (telecommunications); Fading; Mathematics; Eigenvalues and eigenvectors; Gaussian; Matrix (chemical analysis); MIMO; Block (permutation group theory); Channel (broadcasting); Applied mathematics; Algorithm; Combinatorics; Computer science; Telecommunications; Physics; Decoding methods","score_opus":0.006191535858958085,"score_gpt":0.18529067236615554,"score_spread":0.17909913650719744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111076496","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.0064390195,0.0000228467,0.97263837,0.000005381408,0.0010809621,0.00046677052,0.000027916602,0.00069801457,0.018620696],"genre_scores_gemma":[0.9977028,0.000043451244,0.0010964216,0.000048954902,0.000026094114,0.00014769688,0.000024138593,0.000035180063,0.00087531225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990207,0.000049073664,0.00039642907,0.00010292427,0.00022127925,0.00020962015],"domain_scores_gemma":[0.9992957,0.00017530956,0.00009838152,0.00026251603,0.00009692253,0.000071142815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017655802,0.00020453302,0.00017027032,0.00036659738,0.00031931905,0.000041329145,0.000084847765,0.00011664882,0.000053739343],"category_scores_gemma":[0.0000068751556,0.00019208819,0.000047138314,0.0003392782,0.000041784046,0.0016123002,2.9620386e-7,0.00024347154,0.0006138657],"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.000114273,0.000016996803,0.0000022205134,0.000053942465,0.000033787175,0.0000012692035,0.0011149772,0.9946089,0.00004289123,0.0024999704,0.00028514134,0.0012256333],"study_design_scores_gemma":[0.001163511,0.00019293398,0.000017237218,0.00024302037,0.000030751802,0.00014228592,0.0006196269,0.9917829,0.0042068586,0.00018462651,0.0010022697,0.0004139896],"about_ca_topic_score_codex":0.0000064777987,"about_ca_topic_score_gemma":0.0000015502636,"teacher_disagreement_score":0.99126375,"about_ca_system_score_codex":0.00022410681,"about_ca_system_score_gemma":0.00002656941,"threshold_uncertainty_score":0.7890206},"labels":[],"label_agreement":null},{"id":"W2111339146","doi":"10.1109/tit.2009.2013018","title":"Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"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":"Exponent; Decoding methods; Encoder; Channel (broadcasting); Source code; Mathematics; Lossless compression; Coding (social sciences); Transmitter; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Data compression; Statistics; Telecommunications; Combinatorics","score_opus":0.015455896946020144,"score_gpt":0.2536186090595721,"score_spread":0.23816271211355197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111339146","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.0039964747,0.00005512749,0.9890539,0.000055563873,0.0005660591,0.0007819453,0.000099498655,0.0014083006,0.0039831353],"genre_scores_gemma":[0.9981691,0.00008253075,0.0009794966,0.00016468257,0.000033652406,0.000335502,0.000044289056,0.000030784493,0.00015994292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987499,0.00008083563,0.00055512134,0.000103136364,0.00024347025,0.00026752046],"domain_scores_gemma":[0.99891424,0.00026028554,0.00011609157,0.0005030599,0.0001154663,0.000090867085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005710674,0.00022311395,0.0002263025,0.0006782943,0.00027065934,0.00014223468,0.00034569434,0.00014464835,0.00001768401],"category_scores_gemma":[0.000014328768,0.00023652476,0.00012106044,0.00038599962,0.000032940945,0.0013385762,0.0000014855424,0.00030902124,0.00008404234],"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.00016681291,0.000101904065,6.6184055e-7,0.000258858,0.00012616941,2.490919e-7,0.005268831,0.8711417,0.0008074391,0.031778403,0.0010789336,0.08927008],"study_design_scores_gemma":[0.002249609,0.00023101264,0.000036562673,0.0003053338,0.00010290733,0.000020183432,0.0037563571,0.87333184,0.10340375,0.0032704065,0.012321253,0.0009707706],"about_ca_topic_score_codex":0.0000076710185,"about_ca_topic_score_gemma":0.000001417896,"teacher_disagreement_score":0.99417263,"about_ca_system_score_codex":0.0001659589,"about_ca_system_score_gemma":0.000013031338,"threshold_uncertainty_score":0.96452004},"labels":[],"label_agreement":null},{"id":"W2111394763","doi":"10.1109/tit.2011.2167214","title":"Recovering Compressively Sampled Signals Using Partial Support Information","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":266,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Computer science; Compressed sensing; Algorithm; Artificial intelligence; World Wide Web","score_opus":0.03576259163528422,"score_gpt":0.23016141952304084,"score_spread":0.19439882788775661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111394763","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.027302248,0.000004187861,0.9584883,0.0000027140836,0.000673751,0.00023595456,0.000054668308,0.00095904944,0.012279166],"genre_scores_gemma":[0.9941567,0.00002137167,0.0054949713,0.0002243721,0.00002431982,0.00003203053,0.000018550849,0.000016603522,0.000011073003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989698,0.00004325372,0.000499806,0.00006555736,0.00018808193,0.0002334785],"domain_scores_gemma":[0.9994062,0.00005571942,0.00011678356,0.00024025331,0.00010710109,0.00007393379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206864,0.00019218429,0.00016529171,0.0003422495,0.00017056867,0.000080350284,0.00014534108,0.00011878362,0.00061025814],"category_scores_gemma":[0.000006259482,0.0002021983,0.00009559884,0.00017325777,0.000042878506,0.0032295636,0.0000017733075,0.00022036333,0.00026137795],"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.00049718353,0.00007820983,0.000008320499,0.00011127982,0.00026390972,0.0000032485157,0.013326153,0.7778143,0.0075490596,0.0035433485,0.0011636617,0.1956413],"study_design_scores_gemma":[0.0006909352,0.00013756785,0.00008494694,0.00012278938,0.00007760739,0.000040909166,0.0006827273,0.24075295,0.7472233,0.0033185764,0.006297372,0.0005703306],"about_ca_topic_score_codex":0.00002926505,"about_ca_topic_score_gemma":0.0000012133717,"teacher_disagreement_score":0.96685445,"about_ca_system_score_codex":0.000087610875,"about_ca_system_score_gemma":0.000027263824,"threshold_uncertainty_score":0.82454073},"labels":[],"label_agreement":null},{"id":"W2111454628","doi":"10.1109/tit.2003.815803","title":"Almost all complete binary prefix codes have a self-synchronizing string","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Security Establishment","funders":"","keywords":"Prefix code; Synchronizing; Computer science; Binary number; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Linear code; Block code; Arithmetic; Combinatorics; Decoding methods; Topology (electrical circuits)","score_opus":0.01931613686756095,"score_gpt":0.23613473927993242,"score_spread":0.21681860241237147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111454628","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.0025894502,0.00003082143,0.99212474,0.000054356602,0.0005878769,0.00024002706,0.000054920576,0.0004120241,0.0039058104],"genre_scores_gemma":[0.9333674,0.00006882978,0.065587886,0.00071753276,0.000022099377,0.00006327808,0.00002326264,0.000012868677,0.00013687511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863416,0.00016614413,0.00039140575,0.00019717713,0.0003190454,0.0002920654],"domain_scores_gemma":[0.99890447,0.00017419129,0.000148093,0.0005679132,0.00009178592,0.000113524446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193718,0.00019226811,0.00015506758,0.00025710659,0.00046136824,0.00026177353,0.00038511102,0.0000850044,0.00009640669],"category_scores_gemma":[0.00000818712,0.00017774732,0.00008640444,0.00023823617,0.000038656017,0.0036220017,0.0000072467815,0.0002649942,0.0002782281],"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.00017217829,0.0007615454,0.000028102846,0.00027121752,0.00039127166,0.000018128341,0.018962111,0.17654534,0.0011671534,0.40906504,0.0021743386,0.39044356],"study_design_scores_gemma":[0.00237969,0.0005151812,0.00021736383,0.00023820289,0.00007126607,0.00015359276,0.00085048244,0.82400817,0.022437807,0.011854627,0.1361982,0.0010753945],"about_ca_topic_score_codex":0.000019723355,"about_ca_topic_score_gemma":0.000002669349,"teacher_disagreement_score":0.9307779,"about_ca_system_score_codex":0.000112011614,"about_ca_system_score_gemma":0.0000814182,"threshold_uncertainty_score":0.72483253},"labels":[],"label_agreement":null},{"id":"W2111686337","doi":"10.1109/tit.2009.2015989","title":"The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":20,"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":"Division of Electrical, Communications and Cyber Systems; University of Illinois at Urbana-Champaign; National Science Foundation","keywords":"Markov chain; Intersymbol interference; Markov process; Mathematics; Markov model; Algorithm; Computer science; Control theory (sociology); Decoding methods; Statistics; Artificial intelligence","score_opus":0.00820575316659722,"score_gpt":0.22780317577312845,"score_spread":0.21959742260653123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111686337","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.0045485995,0.000011692365,0.9890733,0.00035880925,0.00049179775,0.00031488226,0.000008014248,0.0004174457,0.004775455],"genre_scores_gemma":[0.97784257,0.000023925846,0.021266637,0.0005372977,0.000013802785,0.00004685807,0.0000013576076,0.000006804654,0.0002607442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987332,0.00012691668,0.0003999224,0.00013424778,0.00037372156,0.00023199391],"domain_scores_gemma":[0.99852234,0.0003653415,0.0002445264,0.0006324877,0.00017898729,0.00005634429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089025096,0.00016699842,0.00014947746,0.00020215924,0.00034297173,0.00013712028,0.0006385472,0.00007370765,0.000026974776],"category_scores_gemma":[0.000015743777,0.0001148538,0.00006833137,0.00047890557,0.00008378364,0.0016255605,0.0000030694837,0.00024459106,0.00002460023],"study_design_candidate":"design_other","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.0008761162,0.000356166,0.0000057774437,0.000063974476,0.00013841644,0.0000015984331,0.011232436,0.03721831,0.0011630509,0.29710826,0.0014531733,0.65038276],"study_design_scores_gemma":[0.0041250666,0.004959656,0.0013210219,0.0009749247,0.00016836787,0.00020430895,0.0038545956,0.30543375,0.5356664,0.12964103,0.011515927,0.0021349643],"about_ca_topic_score_codex":0.000014723763,"about_ca_topic_score_gemma":0.0000038373223,"teacher_disagreement_score":0.97329396,"about_ca_system_score_codex":0.00007047626,"about_ca_system_score_gemma":0.000075767675,"threshold_uncertainty_score":0.46836022},"labels":[],"label_agreement":null},{"id":"W2112090704","doi":"10.1109/tit.2009.2027529","title":"Rate of Channel Hardening of Antenna Selection Diversity Schemes and Its Implication on Scheduling","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":32,"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":"Transmitter; Scheduling (production processes); Channel (broadcasting); Ergodic theory; Diversity gain; Channel capacity; Fading; Selection (genetic algorithm)","score_opus":0.00838262974683803,"score_gpt":0.20911250716652008,"score_spread":0.20072987741968204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112090704","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.086973265,0.000027273407,0.9121382,0.000014262914,0.000119844924,0.00019981535,0.00001736047,0.00013211218,0.00037783687],"genre_scores_gemma":[0.9988186,0.000090739086,0.0010193635,0.000025568474,0.000009295163,0.00000790953,0.0000062260306,0.0000068332024,0.000015464953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994231,0.000027907765,0.00030459525,0.00006695877,0.00008264994,0.00009480391],"domain_scores_gemma":[0.9995476,0.00005209414,0.00013355006,0.00009016491,0.0001462075,0.000030409255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022316206,0.00010429664,0.0001314031,0.00029073408,0.00013582964,0.000009571707,0.0000535215,0.0000738825,0.000010209911],"category_scores_gemma":[0.0000130403705,0.0001144269,0.000036934744,0.00023203765,0.00001544663,0.0009474155,9.276033e-7,0.00011387512,0.000007540632],"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.00009231591,0.00001803225,0.0000019254169,0.00009024003,0.000023909846,2.4571973e-8,0.0011532174,0.965314,0.022165151,0.0021820657,0.000002221976,0.008956949],"study_design_scores_gemma":[0.00050834584,0.00014163893,0.00016755905,0.00014136314,0.000026462949,0.0000036900547,0.00040167692,0.516101,0.4815362,0.00082100474,0.000009679065,0.00014138814],"about_ca_topic_score_codex":0.000001623715,"about_ca_topic_score_gemma":4.2524252e-7,"teacher_disagreement_score":0.9118453,"about_ca_system_score_codex":0.000053728632,"about_ca_system_score_gemma":0.000007478352,"threshold_uncertainty_score":0.46661934},"labels":[],"label_agreement":null},{"id":"W2112272930","doi":"10.1109/tit.2007.899531","title":"Signal Sampling and Recovery Under Dependent Errors","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":20,"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 Manitoba","funders":"","keywords":"Interpolation (computer graphics); Sampling (signal processing); Noise (video); Algorithm; Rate of convergence; Signal reconstruction; Mathematics; Series (stratigraphy); Convergence (economics); Parametric statistics; Computer science; Statistics; Signal processing; Artificial intelligence; Filter (signal processing)","score_opus":0.04999864287832804,"score_gpt":0.33192829812513264,"score_spread":0.2819296552468046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112272930","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.02432012,0.000009444956,0.96660376,0.00006788046,0.00014328766,0.00019833035,0.000016078679,0.000105230945,0.0085358955],"genre_scores_gemma":[0.94705796,0.00002880241,0.052012634,0.00039169108,0.000023873326,0.000018203846,0.0000031330633,0.000015874644,0.0004478274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986142,0.00008513518,0.0006276938,0.00011625496,0.00031641067,0.00024033364],"domain_scores_gemma":[0.9979552,0.0015205863,0.00013063582,0.00019793025,0.00007432819,0.00012132578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026628573,0.0001716099,0.0002273807,0.00030496652,0.00024162693,0.00006623397,0.000092654634,0.00012040925,0.0007230005],"category_scores_gemma":[0.00003081411,0.00014042793,0.00014485566,0.0001984544,0.00006469212,0.00066557986,0.0000010859505,0.00025585762,0.000072295996],"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.00042755736,0.0002627564,0.00000373525,0.0003255751,0.0003241666,0.000001434996,0.0027141403,0.0043817665,0.00044218125,0.5956266,0.00002497259,0.39546514],"study_design_scores_gemma":[0.0006472804,0.00011167762,0.00005639172,0.00007468938,0.00020466854,0.000031410887,0.0024873354,0.0017636437,0.023655828,0.97033226,0.00032633272,0.000308506],"about_ca_topic_score_codex":0.000005556391,"about_ca_topic_score_gemma":0.000025174439,"teacher_disagreement_score":0.92273784,"about_ca_system_score_codex":0.000053926953,"about_ca_system_score_gemma":0.000020979312,"threshold_uncertainty_score":0.79163486},"labels":[],"label_agreement":null},{"id":"W2112285705","doi":"10.1109/tit.2008.929970","title":"Unitary Space–Time Group Codes: Diversity Sums From Character Tables","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Ottawa","funders":"","keywords":"Character (mathematics); Mathematics; Emphasis (telecommunications); Character table; Unitary group; Group (periodic table); Unitary state; Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Computer science; Telecommunications","score_opus":0.009208507019421275,"score_gpt":0.1877450062702172,"score_spread":0.17853649925079593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112285705","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.058021463,0.000035753408,0.9365803,0.00003301888,0.00023571937,0.00020120783,0.00032199538,0.001368226,0.0032023338],"genre_scores_gemma":[0.9940616,0.0006803547,0.0046157856,0.0002044556,0.000021448153,0.00004838933,0.00018326916,0.000021173804,0.00016353148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992173,0.00006243101,0.00028421354,0.00007993901,0.00018636302,0.00016976144],"domain_scores_gemma":[0.99913156,0.00020371664,0.00006319344,0.00046856076,0.00006302969,0.00006991645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013701314,0.00017684506,0.0001648143,0.00024230426,0.00048947934,0.000020614982,0.00029260849,0.00011977637,0.0006174668],"category_scores_gemma":[0.0000042766173,0.00019289054,0.00007743355,0.00020612235,0.00010396105,0.0020943992,0.0000061810874,0.0003235768,0.00063417613],"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.0009912773,0.00075004966,0.00029012523,0.00029104727,0.0011307158,0.000017221782,0.04320722,0.61127925,0.020257577,0.018753225,0.012085245,0.29094705],"study_design_scores_gemma":[0.0048728343,0.00042725573,0.0058009424,0.0005457556,0.0002859668,0.00009463462,0.003997001,0.22143373,0.6325909,0.028857822,0.097079575,0.0040136],"about_ca_topic_score_codex":0.00005008483,"about_ca_topic_score_gemma":0.000007686139,"teacher_disagreement_score":0.9360401,"about_ca_system_score_codex":0.00012970429,"about_ca_system_score_gemma":0.0000108506965,"threshold_uncertainty_score":0.8151263},"labels":[],"label_agreement":null},{"id":"W2112657180","doi":"10.1109/tit.2011.2111630","title":"Correction of Convergence Proof for Iterative Water-Filling in Gaussian MIMO Broadcast Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":15,"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":"Convergence (economics); Gaussian; MIMO; Algorithm; Applied mathematics; Mathematics; Computer science; Antenna (radio); Topology (electrical circuits); Power (physics); Iterative method; Mathematical optimization; Theoretical computer science; Telecommunications; Discrete mathematics; Combinatorics; Channel (broadcasting); Physics","score_opus":0.01291361571096476,"score_gpt":0.21360702392163136,"score_spread":0.2006934082106666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112657180","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.003702573,0.000010108278,0.99075174,0.0000024904925,0.0023868876,0.000642514,0.00003406129,0.00012040808,0.002349194],"genre_scores_gemma":[0.99729365,0.00001619462,0.0022020012,0.00001248422,0.000016639657,0.0002637261,0.000020917538,0.000017855731,0.00015653443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991562,0.000031888118,0.00048784804,0.000079035955,0.00007565559,0.00016937891],"domain_scores_gemma":[0.99959296,0.00005582971,0.000078967634,0.00012982833,0.000108755026,0.000033680564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023360542,0.00013531628,0.00015350003,0.00034936535,0.000065608285,0.000012311258,0.00007125001,0.0000907905,0.00010044252],"category_scores_gemma":[0.0000073267847,0.00012463478,0.000054285018,0.0001807871,0.000029564173,0.0013473673,4.6585282e-7,0.00011841279,0.000026300413],"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.00012870447,0.00002753395,0.0000016292696,0.00014075013,0.000020009293,1.0181666e-7,0.018403841,0.9651035,0.0012000264,0.0003296898,0.000014214304,0.014630017],"study_design_scores_gemma":[0.00041993885,0.00008519006,0.000004192086,0.00011731695,0.000009349806,0.0000030056544,0.0012643221,0.41504398,0.58235955,0.00043757897,0.00011920434,0.000136378],"about_ca_topic_score_codex":0.000009656663,"about_ca_topic_score_gemma":0.0000070619094,"teacher_disagreement_score":0.99359107,"about_ca_system_score_codex":0.000088479224,"about_ca_system_score_gemma":0.00001013059,"threshold_uncertainty_score":0.5082459},"labels":[],"label_agreement":null},{"id":"W2113292808","doi":"10.1109/tit.2010.2040867","title":"Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Alphabet; Encoder; Coding (social sciences); Algorithm; Artificial intelligence; Information retrieval; Mathematics; Statistics; Philosophy; Operating system","score_opus":0.007401680144173783,"score_gpt":0.2182925791372947,"score_spread":0.2108908989931209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113292808","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.14504665,0.000008347972,0.8494106,0.0001316203,0.00020850985,0.0004788477,0.000032511543,0.00043209517,0.004250833],"genre_scores_gemma":[0.99239963,0.000111552654,0.006905242,0.0001827964,0.000013576219,0.0002845421,0.000034518365,0.000019838113,0.00004831013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999182,0.000051305364,0.00036631338,0.00006911771,0.00015704408,0.00017420533],"domain_scores_gemma":[0.9985982,0.0007465758,0.00013987866,0.00030961222,0.00015239957,0.00005329595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054563885,0.00016529395,0.00013590053,0.00020315356,0.0006114081,0.0002558369,0.00018216901,0.00012114526,0.00007690929],"category_scores_gemma":[0.000041257223,0.0001378945,0.000054875756,0.0001509967,0.000119953846,0.0034231828,0.000004864175,0.00062276836,0.000053018946],"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.00085587817,0.000052888903,0.00002172308,0.00028380397,0.00026573904,1.5703665e-7,0.028753076,0.25177917,0.004702366,0.0103348475,0.00030214837,0.7026482],"study_design_scores_gemma":[0.0021069,0.00038475206,0.00028068785,0.000312451,0.00014937519,0.00008706032,0.0065455223,0.5200488,0.41592476,0.004359229,0.048767585,0.0010328679],"about_ca_topic_score_codex":0.000008058057,"about_ca_topic_score_gemma":0.00007749997,"teacher_disagreement_score":0.847353,"about_ca_system_score_codex":0.000113356386,"about_ca_system_score_gemma":0.000022694878,"threshold_uncertainty_score":0.56231743},"labels":[],"label_agreement":null},{"id":"W2113594177","doi":"10.1109/tit.2009.2032818","title":"${\\BBZ}_4$-Valued Quadratic Forms and Quaternary Sequence Families","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sequence (biology); Algorithm; Computer science; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.01237484903717348,"score_gpt":0.2342085310195714,"score_spread":0.22183368198239792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113594177","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.04449709,0.000019967209,0.95033926,0.00028796538,0.0002818909,0.00017194281,0.0000080718755,0.00033731165,0.0040564868],"genre_scores_gemma":[0.9944395,0.000055452354,0.003790351,0.0016047397,0.000010540389,0.000021096459,0.0000021906972,0.000003744734,0.000072401956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989805,0.000099131685,0.00032449057,0.00015470988,0.0002263775,0.00021479573],"domain_scores_gemma":[0.9992258,0.00012601481,0.0000999915,0.00040304154,0.000055233446,0.00008990586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053679105,0.00016862224,0.00013451507,0.00037219093,0.0003649264,0.0002260348,0.00038417024,0.0000709352,0.000028570768],"category_scores_gemma":[0.000007300075,0.00014571792,0.00008981684,0.000399142,0.00009320762,0.003433647,0.0000024401072,0.00018912382,0.00011079439],"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.000084422965,0.000050038114,0.0000030574138,0.00001955571,0.000019428684,0.0000014681398,0.0049858796,0.0013183343,0.00033252404,0.6101245,0.00002831405,0.38303244],"study_design_scores_gemma":[0.0014179095,0.0012078033,0.00056281436,0.0001515442,0.000045778565,0.00014275582,0.0019764705,0.09499393,0.025256658,0.8717863,0.0016055038,0.0008525146],"about_ca_topic_score_codex":0.000004241059,"about_ca_topic_score_gemma":0.0000012895081,"teacher_disagreement_score":0.9499424,"about_ca_system_score_codex":0.0000291731,"about_ca_system_score_gemma":0.00003274587,"threshold_uncertainty_score":0.59422046},"labels":[],"label_agreement":null},{"id":"W2114074598","doi":"10.1109/tit.2010.2048448","title":"On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":75,"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 Alberta","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Bit error rate; Code (set theory); Computer science; Turbo code; Concatenated error correction code; Iterative method; Topology (electrical circuits); Mathematics; Block code; Combinatorics","score_opus":0.008429924930415729,"score_gpt":0.23618999613754812,"score_spread":0.2277600712071324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114074598","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.2272339,8.21231e-7,0.7691649,0.0006707147,0.0010000803,0.00039385076,0.000017057768,0.00016689338,0.001351757],"genre_scores_gemma":[0.99686,0.0000015029848,0.0023846002,0.00046821116,0.0000058831765,0.00013775469,0.0000010294411,0.0000069800644,0.00013403724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989201,0.00015113564,0.00036036744,0.000108139495,0.00030403305,0.00015624193],"domain_scores_gemma":[0.9984573,0.00038022918,0.00018197551,0.00085423235,0.00009921892,0.00002704052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635881,0.00012915727,0.0001083787,0.00023262204,0.00021453148,0.00006153127,0.0010212474,0.00010797278,0.00005308783],"category_scores_gemma":[0.00005756085,0.00008180035,0.00011016388,0.00049859716,0.00013981242,0.0007170724,0.000007101924,0.0006512855,0.000043163243],"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.000075669086,0.00029499482,0.00006655923,0.000026972524,0.000017607144,6.308376e-7,0.0058852616,0.006147987,0.0019579441,0.8271689,0.00015538307,0.1582021],"study_design_scores_gemma":[0.0009990849,0.0004657567,0.00811864,0.00024682487,0.00006241548,0.00006975751,0.002130081,0.43246558,0.45189258,0.102432035,0.00035398622,0.00076324225],"about_ca_topic_score_codex":0.000037546844,"about_ca_topic_score_gemma":0.00032550923,"teacher_disagreement_score":0.7696261,"about_ca_system_score_codex":0.00006869868,"about_ca_system_score_gemma":0.00006921556,"threshold_uncertainty_score":0.33357212},"labels":[],"label_agreement":null},{"id":"W2115698032","doi":"10.1109/tit.2008.928269","title":"The Quantum Capacity With Symmetric Side Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Engineering and Physical Sciences Research Council; European Commission; Natural Sciences and Engineering Research Council of Canada; University of Bristol; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum capacity; Classical capacity; Amplitude damping channel; Channel capacity; Quantum entanglement; Channel (broadcasting); Upper and lower bounds; Quantum channel","score_opus":0.014279002359468707,"score_gpt":0.19879657959996472,"score_spread":0.184517577240496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115698032","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.010907062,0.000013002503,0.9771042,0.0003766956,0.0007821544,0.00024284981,0.000007893441,0.00034358402,0.010222543],"genre_scores_gemma":[0.99713707,0.00009400409,0.0013422816,0.0012056507,0.000016543427,0.00008095256,0.000001898132,0.000005911289,0.00011566243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985753,0.00010250537,0.00041999508,0.000110414956,0.00049697835,0.0002947969],"domain_scores_gemma":[0.99860513,0.00033097508,0.00019326003,0.00055159663,0.00020557914,0.00011347565],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005658374,0.00017630184,0.000120982986,0.000528398,0.0014032768,0.0002470798,0.00061363046,0.00006883031,0.000022535656],"category_scores_gemma":[0.000012916602,0.000113672024,0.0001161471,0.0014140076,0.00021106134,0.0036711227,0.0000024565602,0.00028752486,0.0005660261],"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.00009678343,0.00006134387,0.0000032992496,0.000015242588,0.00005723918,0.0000012860759,0.0055755535,0.010628366,0.0000075189214,0.91876173,0.00054622634,0.0642454],"study_design_scores_gemma":[0.005924486,0.0022285273,0.0018274933,0.00015647472,0.00008432314,0.0014355124,0.0055318163,0.67267424,0.05432767,0.1184979,0.1347719,0.0025396396],"about_ca_topic_score_codex":0.000010433682,"about_ca_topic_score_gemma":0.0000025008508,"teacher_disagreement_score":0.98623,"about_ca_system_score_codex":0.000045970843,"about_ca_system_score_gemma":0.00008234866,"threshold_uncertainty_score":0.99989676},"labels":[],"label_agreement":null},{"id":"W2115938507","doi":"10.1109/tit.2007.915972","title":"Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","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 Alberta","funders":"","keywords":"Scrambling; Quotient; Encoder; Code word; Mathematics; Discrete mathematics; Coding (social sciences); Unit interval; Algorithm; Computer science; Arithmetic; Combinatorics; Decoding methods; Statistics","score_opus":0.03989844807251743,"score_gpt":0.25606012661305605,"score_spread":0.2161616785405386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115938507","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.051107027,0.000009976952,0.945906,0.00022591936,0.00090170855,0.00037492777,0.000039168008,0.00033641644,0.0010989003],"genre_scores_gemma":[0.9918678,0.00001256685,0.006918946,0.000826253,0.000035484933,0.00015104953,0.00000879255,0.00000844506,0.00017065536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987503,0.00012525996,0.0004779964,0.00016856022,0.00023093948,0.00024692304],"domain_scores_gemma":[0.998643,0.0005008387,0.00016000401,0.00046878474,0.0001325297,0.00009488376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007644778,0.00016152795,0.0001425257,0.0005290169,0.0010137269,0.00014113357,0.00043003468,0.000091734706,0.00006586331],"category_scores_gemma":[0.000033724547,0.00016013082,0.0002217967,0.0004035853,0.000074379896,0.0020337498,0.000002850024,0.00017603149,0.00014138441],"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.00035235233,0.00026016173,0.00032149168,0.00010811334,0.00011129118,0.000002055412,0.021471838,0.034894414,0.00020903164,0.81224763,0.0013381272,0.12868349],"study_design_scores_gemma":[0.018506275,0.0039067706,0.0150544355,0.00086614164,0.00039423606,0.0009732404,0.007121493,0.2073383,0.16107254,0.5134722,0.06513739,0.0061569614],"about_ca_topic_score_codex":0.000004088043,"about_ca_topic_score_gemma":0.0000013062298,"teacher_disagreement_score":0.9407608,"about_ca_system_score_codex":0.000058829526,"about_ca_system_score_gemma":0.00007982219,"threshold_uncertainty_score":0.77968705},"labels":[],"label_agreement":null},{"id":"W2116213015","doi":"10.1109/tit.2010.2080470","title":"Capacity Bounds for Wireless Optical Intensity Channels With Gaussian Noise","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":143,"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":"Upper and lower bounds; Channel capacity; Mathematics; Topology (electrical circuits); Entropy (arrow of time); Optical wireless; Channel (broadcasting); Gaussian; Telecommunications; Wireless; Mathematical analysis; Combinatorics; Physics; Computer science; Quantum mechanics","score_opus":0.009872243119052807,"score_gpt":0.20609275115421613,"score_spread":0.19622050803516333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116213015","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.16335616,0.0000023958803,0.8320621,0.00027353296,0.00058618677,0.00030559435,0.000040728348,0.0009925518,0.0023807155],"genre_scores_gemma":[0.99191016,0.000014832295,0.0076325582,0.00011106614,0.000019635478,0.00024301381,0.000010939322,0.000022874552,0.000034938486],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992157,0.0000127320245,0.00029725616,0.00009274052,0.00013466195,0.0002468863],"domain_scores_gemma":[0.99893546,0.00021260431,0.000045710407,0.0005518992,0.00016507017,0.00008923738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025371969,0.00019151904,0.0001880377,0.00022161053,0.00023394813,0.00010240931,0.00030313505,0.00021919946,0.00005018833],"category_scores_gemma":[0.000022620286,0.00016240947,0.00007591109,0.00021289983,0.0002896517,0.0008665146,0.000002110793,0.0006749185,0.000110362955],"study_design_candidate":"bench_or_experimental","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.00081413885,0.0003116234,0.000007675865,0.00036272864,0.00031935825,7.2958665e-7,0.003713784,0.09037763,0.018421259,0.4045556,0.0003770491,0.48073843],"study_design_scores_gemma":[0.0012269572,0.00027173435,0.00011107486,0.00006778273,0.000043561282,0.000038254268,0.0012523156,0.21560958,0.76707387,0.010267896,0.0033825287,0.0006544318],"about_ca_topic_score_codex":0.00000285762,"about_ca_topic_score_gemma":0.000015728583,"teacher_disagreement_score":0.828554,"about_ca_system_score_codex":0.000060209233,"about_ca_system_score_gemma":0.000020622474,"threshold_uncertainty_score":0.66228664},"labels":[],"label_agreement":null},{"id":"W2117673653","doi":"10.1109/tit.2010.2040942","title":"Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":24,"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":"Generalization; Quotient; Mathematics; Upper and lower bounds; Constraint (computer-aided design); Emphasis (telecommunications); Combinatorics; Applied mathematics; Discrete mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.00975577503316551,"score_gpt":0.22282044891041353,"score_spread":0.213064673877248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117673653","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.15451917,0.0000021057579,0.83983326,0.000032595533,0.0010800353,0.00021775856,0.000056267327,0.00012802203,0.004130776],"genre_scores_gemma":[0.9944452,0.0000032728128,0.0051879054,0.00020770133,0.000015238388,0.00002821475,0.000005869923,0.000006885136,0.00009968794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893695,0.000041502917,0.00041814006,0.00014005289,0.00027093603,0.00019244316],"domain_scores_gemma":[0.9988232,0.00017699355,0.00020562245,0.0005620649,0.00015316729,0.000078936646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035405686,0.00014782604,0.00014188311,0.0005536646,0.0002775824,0.00011790134,0.0004235181,0.0001061003,0.00016879568],"category_scores_gemma":[0.000014955595,0.00014105711,0.00011562767,0.0006018213,0.00029175502,0.0012645376,0.000003292894,0.00030088608,0.00010518272],"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.000087796936,0.0005777592,0.000004688437,0.00008150105,0.0000989005,8.1848765e-7,0.004970982,0.0047502755,0.044050064,0.69922876,0.00009022531,0.24605823],"study_design_scores_gemma":[0.0022590396,0.00050431746,0.00021786275,0.000098386154,0.000080270765,0.00007618968,0.0012970046,0.35926783,0.61446357,0.017522838,0.0033506167,0.0008620922],"about_ca_topic_score_codex":0.000017657194,"about_ca_topic_score_gemma":0.0000029852022,"teacher_disagreement_score":0.83992606,"about_ca_system_score_codex":0.000044432654,"about_ca_system_score_gemma":0.00010047223,"threshold_uncertainty_score":0.5752142},"labels":[],"label_agreement":null},{"id":"W2118552966","doi":"10.1109/tit.2010.2053873","title":"Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":26,"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 Alberta","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Low-density parity-check code; Turbo code; Mathematics; Upper and lower bounds; Concatenated error correction code; Bounding overwatch; Discrete mathematics; Combinatorics; Algorithm; Block code; Computer science; Decoding methods","score_opus":0.006618558313170579,"score_gpt":0.23229913271338398,"score_spread":0.2256805744002134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118552966","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.013724349,0.0000086384,0.9828479,0.00026569943,0.0005528981,0.00028089847,0.000028476992,0.00059507263,0.00169602],"genre_scores_gemma":[0.927257,0.0000038463763,0.071927354,0.0004627207,0.000029537232,0.00012500472,0.0000055055452,0.000008450349,0.00018058054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990192,0.000045976703,0.00033133605,0.00017022177,0.00021476983,0.00021849907],"domain_scores_gemma":[0.99887484,0.00042999827,0.00014607247,0.0002870469,0.0001818303,0.00008021151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260721,0.00014305563,0.0001282187,0.00018794557,0.0006881603,0.00032105396,0.0003287994,0.00010469008,0.000036596917],"category_scores_gemma":[0.000070212576,0.000145843,0.00007109044,0.00017690018,0.00016160586,0.002000271,0.000004697532,0.0003366178,0.000040984436],"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.00026493412,0.00015344139,0.00004438061,0.00019936208,0.000075241005,0.0000011370514,0.009091695,0.0014324754,0.029642288,0.58225876,0.00066756667,0.37616873],"study_design_scores_gemma":[0.0017504786,0.00040364015,0.0002510921,0.00024545137,0.000049204056,0.00020536876,0.0004302931,0.7593385,0.14499515,0.07299992,0.018176014,0.0011549197],"about_ca_topic_score_codex":0.0000057467823,"about_ca_topic_score_gemma":0.000008503689,"teacher_disagreement_score":0.9135327,"about_ca_system_score_codex":0.000046214176,"about_ca_system_score_gemma":0.00009847003,"threshold_uncertainty_score":0.5947305},"labels":[],"label_agreement":null},{"id":"W2118878768","doi":"10.1109/tit.2008.924689","title":"On Information Embedding When Watermarks and Covertexts are Correlated","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":6,"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":"Digital watermarking; Watermark; Embedding; Channel (broadcasting); Information hiding; Computer science; Algorithm; SIGNAL (programming language); Information protection policy; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Artificial intelligence; Image (mathematics); Computer network","score_opus":0.007538539725554383,"score_gpt":0.21307800025802887,"score_spread":0.2055394605324745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118878768","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.012705269,0.0000069786097,0.9833331,0.00011540016,0.00043463823,0.0002520847,0.000022037328,0.00061375985,0.0025167135],"genre_scores_gemma":[0.9923268,0.00008367208,0.0061838427,0.0012447465,0.0000064940295,0.000048312944,0.000013729522,0.0000060085295,0.00008639475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988902,0.00008266991,0.0004070751,0.00012517953,0.0002719233,0.00022292302],"domain_scores_gemma":[0.99908245,0.00015230938,0.00021503872,0.00035985882,0.000105785766,0.00008458983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026814325,0.0001955893,0.00015168944,0.0005435868,0.00059548026,0.0001526754,0.00029792305,0.00013575777,0.00002371192],"category_scores_gemma":[0.0000108517725,0.00017330072,0.0000772831,0.00024528167,0.000091470436,0.0072163027,0.0000054073885,0.00031205005,0.000113379654],"study_design_candidate":"design_other","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.0011339815,0.00028120508,0.00008967612,0.0002627233,0.00020027669,0.000020269117,0.055517104,0.07153072,0.0001413325,0.14857127,0.0053178687,0.71693355],"study_design_scores_gemma":[0.006896071,0.001795217,0.0027840068,0.0012261802,0.00009318577,0.0010039075,0.0012446968,0.5056729,0.11010517,0.33865002,0.027477644,0.0030510223],"about_ca_topic_score_codex":0.0000039229535,"about_ca_topic_score_gemma":3.3831523e-7,"teacher_disagreement_score":0.9796215,"about_ca_system_score_codex":0.000054452346,"about_ca_system_score_gemma":0.000023171602,"threshold_uncertainty_score":0.70669985},"labels":[],"label_agreement":null},{"id":"W2119258844","doi":"10.1109/tit.2005.853326","title":"Toward a General Correlation Theorem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"University of Waterloo","funders":"","keywords":"Cryptography; Modulo; Mathematics; Discrete mathematics; S-box; Algebra over a field; Computer science; Algorithm; Pure mathematics; Block cipher","score_opus":0.011220516436408423,"score_gpt":0.2151863566428308,"score_spread":0.2039658402064224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119258844","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.0034137096,0.000010854457,0.9785082,0.00045353538,0.00069430505,0.00014995215,0.000007710128,0.00043928702,0.016322475],"genre_scores_gemma":[0.9859527,0.00001248662,0.012052527,0.0015772476,0.000057105022,0.000038242466,0.0000036014067,0.0000057535954,0.0003003336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899715,0.00013044894,0.00030834883,0.00013207777,0.00023527123,0.00019667212],"domain_scores_gemma":[0.9992107,0.00014553266,0.000101820166,0.00038947476,0.00007494509,0.00007753139],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006107639,0.00014120356,0.00009823469,0.0003588106,0.00027394455,0.00016747222,0.00041997762,0.00008182714,0.00024147569],"category_scores_gemma":[0.000006256485,0.00013122476,0.00013910136,0.00043213624,0.000058287667,0.003056055,0.0000024975757,0.00021024703,0.00089169876],"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.00004444561,0.0000343382,7.005151e-7,0.000003948874,0.000014021065,1.7835039e-7,0.002368691,0.028649239,0.000029755689,0.6133925,0.00011284414,0.3553494],"study_design_scores_gemma":[0.0019858114,0.00042677502,0.00018004193,0.000061889834,0.00005325255,0.000096968506,0.0005823928,0.50483793,0.031919815,0.40766326,0.051259767,0.00093208754],"about_ca_topic_score_codex":0.0000014548738,"about_ca_topic_score_gemma":8.645246e-7,"teacher_disagreement_score":0.982539,"about_ca_system_score_codex":0.00005377447,"about_ca_system_score_gemma":0.000035243098,"threshold_uncertainty_score":0.9998862},"labels":[],"label_agreement":null},{"id":"W2119581773","doi":"10.1109/tit.2006.880015","title":"Optimal Power/Rate Allocation and Code Selection for Iterative Joint Detection of Coded Random CDMA","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":48,"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 Alberta","funders":"","keywords":"Additive white Gaussian noise; Mathematics; Algorithm; Channel capacity; Single antenna interference cancellation; Noise power; Code division multiple access; Upper and lower bounds; Code rate; Minimum mean square error; Statistics; Computer science; Decoding methods; Channel (broadcasting); Telecommunications; White noise; Power (physics); Estimator","score_opus":0.012475995207875562,"score_gpt":0.24750041395363806,"score_spread":0.2350244187457625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119581773","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.02556272,0.000022241704,0.9727754,0.00022249855,0.00018203602,0.0006982499,0.000030146633,0.00014099843,0.00036571798],"genre_scores_gemma":[0.98771423,0.000024113631,0.011754858,0.00007275246,0.000015705073,0.00027078498,0.00001499976,0.000008783579,0.0001237893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985522,0.0003124305,0.00055189,0.00016008485,0.00023434682,0.00018906714],"domain_scores_gemma":[0.99833137,0.000503941,0.00027212274,0.00033688603,0.0005068274,0.000048883976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012087674,0.00014276606,0.00017484736,0.0004195479,0.0003858938,0.00016992046,0.0002547234,0.00010501091,0.000012590015],"category_scores_gemma":[0.00002547131,0.00014210524,0.000081627644,0.00047588698,0.00009566377,0.0020906746,0.000004939589,0.00020355512,0.000012769942],"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.0013322192,0.00023028554,0.00000336613,0.000104350605,0.000082927974,9.005989e-8,0.003572695,0.73151344,0.039899915,0.08184148,0.00013698034,0.14128225],"study_design_scores_gemma":[0.0016787222,0.00030013733,0.00016059547,0.000024562933,0.000012009162,0.000007818711,0.00013643388,0.7244483,0.26971558,0.0028603168,0.0005115872,0.00014393628],"about_ca_topic_score_codex":0.000022218468,"about_ca_topic_score_gemma":0.00004191308,"teacher_disagreement_score":0.96215147,"about_ca_system_score_codex":0.000103255,"about_ca_system_score_gemma":0.00006672731,"threshold_uncertainty_score":0.5794884},"labels":[],"label_agreement":null},{"id":"W2119604283","doi":"10.1109/tit.2013.2251395","title":"On the Girth of Quasi-Cyclic Protograph LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":89,"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":"Girth (graph theory); Low-density parity-check code; Mathematics; Tanner graph; Combinatorics; Upper and lower bounds; Discrete mathematics; Odd graph; Base (topology); Degree (music); Graph; Decoding methods; Chordal graph; Algorithm; 1-planar graph; Error floor","score_opus":0.009495993991673227,"score_gpt":0.22409884733800917,"score_spread":0.21460285334633594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119604283","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.018917436,0.0000027404662,0.97239166,0.0004424506,0.00029588767,0.0010468012,0.0000058171627,0.00048067377,0.0064165127],"genre_scores_gemma":[0.9941199,0.0000075146963,0.004273445,0.00084061344,0.0000063113325,0.00063856173,7.7790395e-7,0.000006996162,0.000105899046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881095,0.00018786624,0.00038895378,0.00011756599,0.0003180985,0.00017656303],"domain_scores_gemma":[0.9982134,0.00066774565,0.0002160152,0.00068889937,0.00016897057,0.000044960707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909975,0.00014466181,0.00012935986,0.00035557768,0.00023123808,0.00011978608,0.0007056858,0.00007272594,0.00014737797],"category_scores_gemma":[0.000036014975,0.00010098146,0.000120249555,0.0005295725,0.000105179264,0.0015159682,0.000003494702,0.0002823229,0.0003316481],"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.00007167336,0.00037239876,0.000016721473,0.00007860008,0.00007375521,2.476553e-7,0.009581912,0.0029752252,0.0011159417,0.6077703,0.0021050167,0.3758382],"study_design_scores_gemma":[0.00079447526,0.0017104773,0.0006921522,0.00036882953,0.000031702373,0.000028901915,0.0019019751,0.06820802,0.5706623,0.35317257,0.0016390004,0.000789565],"about_ca_topic_score_codex":0.000053386557,"about_ca_topic_score_gemma":0.0000053139565,"teacher_disagreement_score":0.97520244,"about_ca_system_score_codex":0.000033544024,"about_ca_system_score_gemma":0.00003810453,"threshold_uncertainty_score":0.4262776},"labels":[],"label_agreement":null},{"id":"W2120455086","doi":"10.1109/tit.2007.899467","title":"Derivatives of Entropy Rate in Special Families of Hidden Markov Chains","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":28,"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":"Markov chain; Mathematics; Entropy (arrow of time); Entropy rate; Markov process; Markov kernel; Variable-order Markov model; Markov chain mixing time; Maximum-entropy Markov model; Markov property; Markov model; Binary number; Statistical physics; Applied mathematics; Simplex; Combinatorics; Discrete mathematics; Binary entropy function; Principle of maximum entropy; Statistics; Physics; Thermodynamics","score_opus":0.008171476541206538,"score_gpt":0.2405677896695639,"score_spread":0.23239631312835737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120455086","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.057929486,0.0000036552863,0.9342341,0.00006744655,0.00019186083,0.0001979734,0.000010009706,0.00007962148,0.0072858375],"genre_scores_gemma":[0.98552006,0.000029910863,0.014134868,0.00020565781,0.000018228533,0.00001122044,0.0000020853554,0.0000036719468,0.00007432169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885815,0.00013616099,0.00058256654,0.00008229523,0.00020809715,0.00013274107],"domain_scores_gemma":[0.9990632,0.00028542042,0.00024485515,0.0002542349,0.00012154003,0.000030736588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013115475,0.00009878595,0.00015414778,0.00073096214,0.00004543058,0.000023631565,0.000302004,0.00007161929,0.00005058069],"category_scores_gemma":[0.000019743662,0.000096848984,0.00006719679,0.00054369034,0.00009797541,0.001488783,0.0000029384776,0.00014351447,0.000013312776],"study_design_candidate":"bench_or_experimental","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.00029540228,0.00021160167,0.00004119731,0.00006126339,0.000033548833,7.8621304e-7,0.053758163,0.00193209,0.0044305795,0.6034109,0.00007074795,0.3357537],"study_design_scores_gemma":[0.0008831208,0.00024544811,0.0046921717,0.000071959,0.000006335317,0.0000024353512,0.002958863,0.00515077,0.9667226,0.018314892,0.0007263582,0.00022506001],"about_ca_topic_score_codex":0.00000888554,"about_ca_topic_score_gemma":0.000017564314,"teacher_disagreement_score":0.962292,"about_ca_system_score_codex":0.000043394095,"about_ca_system_score_gemma":0.000058834303,"threshold_uncertainty_score":0.3949387},"labels":[],"label_agreement":null},{"id":"W2122694741","doi":"10.1109/tit.2003.817423","title":"Linear threaded algebraic space-time constellations","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":92,"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 Alberta","funders":"","keywords":"Quadrature amplitude modulation; Constellation; Constellation diagram; QAM; Mathematics; Amplitude and phase-shift keying; Phase-shift keying; Diversity gain; Signal-to-noise ratio (imaging); Coding gain; Control theory (sociology); Algorithm; Computer science; Mathematical optimization; Topology (electrical circuits); Fading; Bit error rate; Decoding methods; Statistics","score_opus":0.007537560666553184,"score_gpt":0.214086294556839,"score_spread":0.20654873389028583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122694741","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.0012489046,0.000036287394,0.937101,0.000042942353,0.00022983104,0.00028363222,0.000034163557,0.0015037834,0.059519466],"genre_scores_gemma":[0.9845549,0.00016211726,0.01456956,0.00015478846,0.000010188413,0.000095860036,0.000018794184,0.00003037429,0.00040341588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991225,0.00008782298,0.00037956782,0.000074024,0.00015180293,0.00018430263],"domain_scores_gemma":[0.9990347,0.00024556433,0.000064243286,0.0005011907,0.00008181402,0.00007245942],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024697167,0.00017612526,0.00014663767,0.00031108697,0.000205349,0.00003468896,0.00016534203,0.000120803015,0.0008128112],"category_scores_gemma":[0.000016252628,0.00019118717,0.00008168421,0.00033621624,0.000089072935,0.0010499202,6.9746335e-7,0.0003033635,0.0013203361],"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.00003059186,0.000069926224,0.000002288979,0.000058290516,0.00010562636,3.503859e-7,0.001425703,0.76630294,0.0026331488,0.16728656,0.0009044775,0.061180085],"study_design_scores_gemma":[0.0011314852,0.0000993808,0.000016926553,0.000106647116,0.000063128005,0.000041836385,0.0008216238,0.101060316,0.77887917,0.051494364,0.065338135,0.0009469898],"about_ca_topic_score_codex":8.822136e-7,"about_ca_topic_score_gemma":8.9440744e-7,"teacher_disagreement_score":0.983306,"about_ca_system_score_codex":0.00009938331,"about_ca_system_score_gemma":0.000028006782,"threshold_uncertainty_score":0.99945724},"labels":[],"label_agreement":null},{"id":"W2125668638","doi":"10.1109/tit.2009.2013031","title":"Nonlinear Estimation for a Class of Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Control Systems and Identification","field":"Engineering","cited_by":9,"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 Ottawa","funders":"","keywords":"Mathematics; Nonlinear system; Probability distribution; Joint probability distribution; Entropy (arrow of time); Applied mathematics; Kullback–Leibler divergence; Random variable; Mathematical optimization; Constraint (computer-aided design); Convergence (economics); Kernel (algebra); Statistics; Discrete mathematics","score_opus":0.006326217940353604,"score_gpt":0.20953149620438888,"score_spread":0.20320527826403528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125668638","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.0057178563,0.000028937959,0.99107236,0.00002671041,0.0007425977,0.0004851088,0.000083560335,0.00017310824,0.0016697509],"genre_scores_gemma":[0.9990363,0.000009330151,0.00068662164,0.000023585166,0.000026537195,0.00008200899,0.0000232566,0.0000062416884,0.000106101776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933696,0.00001644764,0.00040738995,0.00004230898,0.00010915154,0.00008775725],"domain_scores_gemma":[0.9995692,0.00006544121,0.00008071008,0.00015321583,0.00010462819,0.000026810298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002674076,0.00008042102,0.000118817734,0.00018779765,0.000058795842,0.000040568477,0.00005962988,0.000065035085,0.000009784421],"category_scores_gemma":[0.0000068373165,0.00008041115,0.00006944974,0.000113178656,0.000009616817,0.0006513207,7.214993e-8,0.000057028676,0.00004488681],"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.000060257127,0.00002684741,8.7366494e-8,0.0001558902,0.000027456805,1.6776882e-8,0.0004957202,0.85746866,0.002074344,0.010486404,0.00023319994,0.12897111],"study_design_scores_gemma":[0.0004886218,0.00008308171,0.000024490653,0.000050016544,0.000024290162,0.0000021724577,0.00019116222,0.98356587,0.012086358,0.00067761104,0.0027129448,0.00009336753],"about_ca_topic_score_codex":0.0000035789017,"about_ca_topic_score_gemma":8.7736686e-7,"teacher_disagreement_score":0.99331844,"about_ca_system_score_codex":0.000050233473,"about_ca_system_score_gemma":0.000011172888,"threshold_uncertainty_score":0.32790715},"labels":[],"label_agreement":null},{"id":"W2126115158","doi":"10.1109/tit.2014.2321151","title":"Information Transmission Using the Nonlinear Fourier Transform, Part II: Numerical Methods","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":261,"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":"Eigenvalues and eigenvectors; Nonlinear system; Mathematical analysis; Integrable system; Spectrum (functional analysis); Mathematics; Fourier transform; Transmission (telecommunications); Optics; Algorithm; Physics; Telecommunications; Computer science","score_opus":0.012022830921292787,"score_gpt":0.2905410076675263,"score_spread":0.27851817674623347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126115158","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.003236967,0.0000032247858,0.98561347,0.0004053434,0.000516333,0.00033146513,0.000112113754,0.00007354635,0.009707519],"genre_scores_gemma":[0.85990536,0.000014278858,0.13646035,0.0019158064,0.0006013219,0.000115338575,0.00020953856,0.0000427696,0.0007352361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985105,0.00026368437,0.0005926357,0.00008411568,0.0002648743,0.00028420627],"domain_scores_gemma":[0.99906415,0.00023071733,0.00016044792,0.00031991265,0.000103008286,0.00012174312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009551932,0.0002179779,0.00019671052,0.00014338687,0.0009405921,0.00012370652,0.00019770919,0.00008936898,0.00087340886],"category_scores_gemma":[0.000004732369,0.0001545409,0.00025230442,0.00026942109,0.00008268736,0.0019121519,0.0000017868706,0.00039879084,0.00011783929],"study_design_candidate":"design_other","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.0001015337,0.00008210352,0.0000019142678,0.000017387709,0.000064470434,1.8656474e-8,0.0040375236,0.029509302,0.00004627092,0.01620422,0.00010901264,0.94982624],"study_design_scores_gemma":[0.00089406373,0.00013741455,0.000007166768,0.000039402337,0.00011125409,0.000004303549,0.0020703399,0.51702684,0.015585372,0.009786042,0.45401156,0.00032626637],"about_ca_topic_score_codex":0.000032656044,"about_ca_topic_score_gemma":2.5415437e-7,"teacher_disagreement_score":0.94949996,"about_ca_system_score_codex":0.00003310258,"about_ca_system_score_gemma":0.00007183019,"threshold_uncertainty_score":0.9563215},"labels":[],"label_agreement":null},{"id":"W2126979605","doi":"10.1109/tit.2010.2059651","title":"New Coding Schemes for the Symmetric $K$-Description Problem","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":37,"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":"Erasure; Gaussian; Linear network coding; Computer science; Algorithm; Rate–distortion theory; Decoding methods; Theoretical computer science; Coding (social sciences); Multiple description coding; Quantization (signal processing); Binary erasure channel; Quadratic equation; Mathematical optimization; Mathematics; Channel (broadcasting); Channel capacity; Data compression; Telecommunications; Statistics; Network packet","score_opus":0.025355686392186504,"score_gpt":0.2554970244999948,"score_spread":0.2301413381078083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126979605","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.00012571842,0.0000373239,0.9941592,0.0013867513,0.0010767902,0.00046572075,0.0000037852053,0.00020923969,0.0025354482],"genre_scores_gemma":[0.9430603,0.00019852935,0.054566693,0.0010289334,0.00006249244,0.00016749468,0.0000043037667,0.000007195978,0.0009040928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992301,0.00005682363,0.0002822442,0.00010265794,0.00016693579,0.00016125859],"domain_scores_gemma":[0.99851555,0.0005796385,0.000113178845,0.00054696586,0.00017986349,0.000064812215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079946505,0.000111900954,0.00008161409,0.00025425214,0.000761254,0.00037363643,0.00070911774,0.00006267034,0.00008015354],"category_scores_gemma":[0.00003223013,0.000084209285,0.00008845892,0.00064599497,0.000036673595,0.00209179,0.0000053981644,0.00034045643,0.00013371753],"study_design_candidate":"design_other","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.000011370015,0.000010630839,3.641036e-7,0.0000046229407,0.000011906791,1.0152292e-8,0.0006670079,0.0005925085,0.00042804793,0.45982403,0.0006196969,0.5378298],"study_design_scores_gemma":[0.0017545419,0.00019150463,0.00013264909,0.00006448983,0.00005064004,0.000022600098,0.000406807,0.50712395,0.03299259,0.036556944,0.4201493,0.0005539968],"about_ca_topic_score_codex":0.000002398357,"about_ca_topic_score_gemma":0.000012666722,"teacher_disagreement_score":0.9429346,"about_ca_system_score_codex":0.00003451822,"about_ca_system_score_gemma":0.00008751891,"threshold_uncertainty_score":0.5855027},"labels":[],"label_agreement":null},{"id":"W2127300249","doi":"10.1109/tit.2009.2016018","title":"Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\\ell _{1}$-Constrained Quadratic Programming (Lasso)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1252,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Lasso (programming language); Compressed sensing; Dimension (graph theory); Algorithm; Mathematics; Quadratic programming; Quadratic equation; Gaussian; Combinatorics; Noise (video); Computer science; Applied mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence; Physics","score_opus":0.012850320717291912,"score_gpt":0.22059973371260508,"score_spread":0.20774941299531316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127300249","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.12470822,0.000027948388,0.87357336,0.000043257416,0.00030392723,0.0003962514,0.000037996124,0.00053792336,0.00037111176],"genre_scores_gemma":[0.9809972,0.000012638673,0.018598067,0.00029372107,0.000029839428,0.000019360288,0.000015575224,0.000013111411,0.000020469814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922824,0.000022071894,0.00030211595,0.00010499086,0.00013169486,0.00021089568],"domain_scores_gemma":[0.999541,0.00008909875,0.000063856955,0.00016760227,0.00007686798,0.000061608465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162533,0.00017856836,0.00017018084,0.00022072032,0.00022166711,0.00009122672,0.000071428694,0.00011863824,0.000019363544],"category_scores_gemma":[0.000006770702,0.00018365294,0.000074696094,0.00012198033,0.00004835572,0.0008475124,8.6304084e-7,0.00016561797,0.000007160446],"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.00035210684,0.00009565264,0.0000028119289,0.000086494954,0.00010830034,0.0000021453282,0.00076040905,0.4795767,0.010162247,0.008514641,0.00037843047,0.49996006],"study_design_scores_gemma":[0.00211998,0.0007485817,0.00025258746,0.0004425502,0.00024350476,0.00013181672,0.00033112933,0.7359084,0.2051868,0.05210207,0.0014285232,0.0011040452],"about_ca_topic_score_codex":0.000006305319,"about_ca_topic_score_gemma":0.000003219958,"teacher_disagreement_score":0.856289,"about_ca_system_score_codex":0.00006909486,"about_ca_system_score_gemma":0.000023103334,"threshold_uncertainty_score":0.74891496},"labels":[],"label_agreement":null},{"id":"W2128031934","doi":"10.1109/tit.2013.2294368","title":"Lossless Coding for Distributed Streaming Sources","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":22,"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":"Distributed source coding; Encoder; Decoding methods; Computer science; Algorithm; Source code; Variable-length code; Lossless compression; Entropy encoding; Upper and lower bounds; Entropy (arrow of time); Theoretical computer science; Coding (social sciences); Data compression; Mathematics; Statistics","score_opus":0.008494965284645975,"score_gpt":0.22043993110051716,"score_spread":0.2119449658158712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128031934","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.011268616,0.000009083196,0.9851144,0.000042295487,0.00019054157,0.0002471353,0.00015742297,0.0011214801,0.0018490519],"genre_scores_gemma":[0.9969702,0.000035244793,0.0026029488,0.00008851338,0.000018841702,0.0001820388,0.00006714357,0.000017725772,0.000017346156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932384,0.00004444927,0.000307176,0.00005703669,0.000111644484,0.00015584931],"domain_scores_gemma":[0.9991289,0.00037344842,0.00005836769,0.00031489177,0.00007785282,0.0000465723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037458426,0.00012694318,0.00012296985,0.00018589382,0.00021205442,0.000080294514,0.0002105699,0.00009086588,0.000030114788],"category_scores_gemma":[0.00001559789,0.00013685388,0.00007428988,0.00013931951,0.00004223384,0.00073419686,9.993395e-7,0.00017015685,0.00004340872],"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.000097003656,0.000073256946,0.000005631158,0.00040189887,0.00012378217,6.451467e-8,0.005012675,0.39028215,0.0015181571,0.122432135,0.000948507,0.47910473],"study_design_scores_gemma":[0.0010355882,0.00010367486,0.00005773201,0.00017020165,0.000053171923,0.0000058241594,0.0015273611,0.61523885,0.32195505,0.011617064,0.04763958,0.00059590454],"about_ca_topic_score_codex":0.0000023076634,"about_ca_topic_score_gemma":0.000002925768,"teacher_disagreement_score":0.98570156,"about_ca_system_score_codex":0.00007314041,"about_ca_system_score_gemma":0.000007346133,"threshold_uncertainty_score":0.55807394},"labels":[],"label_agreement":null},{"id":"W2128555802","doi":"10.1109/tit.2009.2032817","title":"On Metrics for Error Correction in Network Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":169,"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":"Linear network coding; Error detection and correction; Subspace topology; Computer science; Algorithm; Constant-weight code; Metric (unit); Coding (social sciences); Variable-length code; Theoretical computer science; Decoding methods; Topology (electrical circuits); Linear code; Mathematics; Block code; Computer network; Artificial intelligence; Statistics","score_opus":0.027735625260103845,"score_gpt":0.2775726853735803,"score_spread":0.24983706011347648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128555802","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.00043541365,0.000020666099,0.992286,0.00051635195,0.0013687531,0.0003501943,0.000002486124,0.00016968016,0.0048504146],"genre_scores_gemma":[0.9921335,0.00011789957,0.0047011306,0.002716468,0.00002810293,0.00006437841,0.000005019194,0.0000040717828,0.00022942638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.00013050376,0.0003431574,0.000120360906,0.00015587617,0.00020174058],"domain_scores_gemma":[0.998691,0.0006711858,0.00010974666,0.00036695608,0.000113129514,0.00004795943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571407,0.000119486416,0.00012076391,0.00045841956,0.00036420638,0.00013109266,0.0003645141,0.00006791636,0.000024991567],"category_scores_gemma":[0.0000479137,0.00011923214,0.00007366317,0.0010792838,0.000016009802,0.0012399845,0.0000017845905,0.00024561642,0.000060655002],"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.00008076928,0.00005949377,7.29371e-7,0.0000029253072,0.000005424006,9.677875e-8,0.00084686367,0.20133704,0.000013240732,0.2359505,0.0013342795,0.56036866],"study_design_scores_gemma":[0.0010411205,0.00045909907,0.00023938021,0.00010674135,0.0000073090628,0.0000045694087,0.00012170088,0.9668459,0.0022886465,0.022077924,0.0065276558,0.0002799137],"about_ca_topic_score_codex":6.707767e-7,"about_ca_topic_score_gemma":0.000007031877,"teacher_disagreement_score":0.9916981,"about_ca_system_score_codex":0.00014427722,"about_ca_system_score_gemma":0.00003684396,"threshold_uncertainty_score":0.48621458},"labels":[],"label_agreement":null},{"id":"W2129568979","doi":"10.1109/tit.2010.2040888","title":"Optimal Frequency-Hopping Sequences With New Parameters","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Prime (order theory); Combinatorics; Algorithm; Discrete mathematics; Computer science; Mathematics","score_opus":0.009472739349772318,"score_gpt":0.2108607350587515,"score_spread":0.20138799570897917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129568979","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.062288884,0.0000032470775,0.9322631,0.00025114443,0.00075785554,0.00013891025,0.0000047291987,0.00034889564,0.0039432347],"genre_scores_gemma":[0.9072733,0.0000040723007,0.09199411,0.00060817273,0.000019200064,0.000025786929,0.0000013598193,0.000005516574,0.00006848892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.000052959705,0.00024566727,0.00015598738,0.00024494005,0.00022551017],"domain_scores_gemma":[0.99902874,0.00019252907,0.000109905515,0.00046866445,0.000066271845,0.00013391652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045836807,0.00015858206,0.00010836974,0.00033678132,0.0003227075,0.00027746838,0.0005675811,0.00008085315,0.00013518438],"category_scores_gemma":[0.0000075950834,0.00013059679,0.00009244367,0.0005248056,0.00013006783,0.003124405,0.00000193194,0.00040271663,0.00017027148],"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.00014229618,0.000058224912,0.000015191123,0.000018322524,0.00008512048,0.0000024115877,0.0057099736,0.036428913,0.0017112375,0.679022,0.00009155505,0.27671477],"study_design_scores_gemma":[0.0048058014,0.0028487619,0.0005871483,0.00036025603,0.00019569704,0.00069290015,0.003589177,0.051571954,0.2971699,0.6257549,0.009124702,0.0032987979],"about_ca_topic_score_codex":0.00002137009,"about_ca_topic_score_gemma":0.000014404448,"teacher_disagreement_score":0.8449844,"about_ca_system_score_codex":0.0000175137,"about_ca_system_score_gemma":0.00012534864,"threshold_uncertainty_score":0.53255826},"labels":[],"label_agreement":null},{"id":"W2130279916","doi":"10.1109/tit.2004.833337","title":"Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":14,"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":"Decoding methods; Redundancy (engineering); Algorithm; Encoder; Computer science; Markov process; Computational complexity theory; Markov chain; Maximum a posteriori estimation; A priori and a posteriori; Channel (broadcasting); Mathematics; Telecommunications; Maximum likelihood; Statistics","score_opus":0.014590783378292657,"score_gpt":0.2393267624969861,"score_spread":0.22473597911869342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130279916","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.038233403,0.000035912122,0.9572045,0.00002528315,0.0006054152,0.00030041495,0.000017928342,0.0011624406,0.002414705],"genre_scores_gemma":[0.97901165,0.000049061255,0.02051295,0.00018743853,0.000025698599,0.00008551886,0.000006490805,0.00004578716,0.00007540328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989229,0.000041046984,0.0004352827,0.00010601801,0.00023601031,0.00025873832],"domain_scores_gemma":[0.9991638,0.000082387036,0.00008919748,0.00048218435,0.00010585866,0.00007657383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002452103,0.00022609033,0.000172438,0.00038127758,0.0002668689,0.00006992265,0.00025043168,0.000135997,0.00013981311],"category_scores_gemma":[0.0000033259303,0.00024507724,0.0000843732,0.0004027657,0.000065930435,0.0009689875,0.00000344078,0.0003333443,0.00006365996],"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.000022712564,0.0000309797,7.167637e-8,0.000035833717,0.000026478181,1.8052148e-7,0.0011596772,0.97272444,0.00084617786,0.0048974147,0.000008933043,0.020247119],"study_design_scores_gemma":[0.0006158555,0.000017239083,0.00000197267,0.00011148182,0.0000226071,0.000007330665,0.00027715543,0.92037886,0.07231425,0.0054573948,0.00044835926,0.00034746356],"about_ca_topic_score_codex":0.000011730559,"about_ca_topic_score_gemma":0.0000015192359,"teacher_disagreement_score":0.94077826,"about_ca_system_score_codex":0.00038756907,"about_ca_system_score_gemma":0.000028192773,"threshold_uncertainty_score":0.999396},"labels":[],"label_agreement":null},{"id":"W2130433404","doi":"10.1109/tit.2003.818411","title":"Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":102,"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":"Algorithm; Data compression; Lossless compression; Mathematics; Countable set; Entropy encoding; Arithmetic coding; Discrete mathematics; Theoretical computer science; Computer science; Context-adaptive binary arithmetic coding","score_opus":0.026234722003755918,"score_gpt":0.242439027781114,"score_spread":0.21620430577735808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130433404","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.00067212054,0.000010455079,0.993987,0.00011931136,0.0010194087,0.0005672753,0.0004517245,0.00027742886,0.0028952786],"genre_scores_gemma":[0.9728691,0.000009045784,0.02600628,0.000740456,0.000029446335,0.000046883397,0.00018048091,0.00002130278,0.000096998505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761647,0.00028436622,0.00047277476,0.00044673288,0.00078929355,0.00039038708],"domain_scores_gemma":[0.99772376,0.00020143627,0.00019089156,0.0015096188,0.00016773077,0.00020656482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007547612,0.00033377585,0.00025152997,0.00037823932,0.0006146493,0.0002733529,0.001061294,0.000114430026,0.000105099396],"category_scores_gemma":[0.0000044398703,0.00026327415,0.00008998843,0.00047446965,0.00014071434,0.0028826192,0.000010664988,0.0004082618,0.00009999248],"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.00036983262,0.0002791502,2.2099755e-7,0.000020946865,0.00003250262,0.000006175139,0.0005973238,0.8354628,0.000018808763,0.033896085,0.00021133544,0.12910481],"study_design_scores_gemma":[0.0030944536,0.00032890312,0.000001408187,0.00015417108,0.00003324141,0.000023833087,0.00030176967,0.98644507,0.003205988,0.0009907171,0.005062479,0.00035798814],"about_ca_topic_score_codex":0.000046361918,"about_ca_topic_score_gemma":0.000011246045,"teacher_disagreement_score":0.972197,"about_ca_system_score_codex":0.0001221869,"about_ca_system_score_gemma":0.00023768448,"threshold_uncertainty_score":0.99998194},"labels":[],"label_agreement":null},{"id":"W2130581765","doi":"10.1109/tit.2010.2059630","title":"On the Limitations of the Naive Lattice Decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"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":"Decoding methods; Multiplexing; Fading; MIMO; Upper and lower bounds; Lattice (music); Mathematics; Algorithm; Diversity gain; Maximum likelihood; Computer science; Topology (electrical circuits); Discrete mathematics; Telecommunications; Combinatorics; Statistics; Physics; Channel (broadcasting); Mathematical analysis","score_opus":0.0385577405410906,"score_gpt":0.25083432302036807,"score_spread":0.21227658247927747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130581765","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.013805512,0.000004904951,0.9643574,0.0031409564,0.0008338652,0.00022017573,0.0000050610247,0.00006617421,0.017565958],"genre_scores_gemma":[0.99609697,0.000073386254,0.0015713095,0.0020287978,0.000009448872,0.000040687773,5.429e-7,0.0000032587557,0.00017558681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991865,0.00019993728,0.00025038669,0.0000677986,0.0001951509,0.00010021894],"domain_scores_gemma":[0.99687195,0.0020010474,0.00013997716,0.00078552146,0.00017300042,0.000028512583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064953556,0.00008444647,0.00006335243,0.0001007406,0.00070280756,0.00009669212,0.0008959126,0.000042721847,0.00007439978],"category_scores_gemma":[0.00013336932,0.00005084605,0.00008494693,0.00047260022,0.000109226945,0.000748554,0.000007937153,0.00043897034,0.00012180666],"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.0000070739347,0.000027572676,8.181675e-7,0.0000015312593,0.000011647576,1.4705697e-8,0.0031701915,0.003105182,0.000369532,0.8634842,0.00018605837,0.12963618],"study_design_scores_gemma":[0.0018630747,0.00036234985,0.002210223,0.00028519955,0.00009389582,0.000034489174,0.003390404,0.5182876,0.23025036,0.17624249,0.0659969,0.0009830398],"about_ca_topic_score_codex":9.840893e-7,"about_ca_topic_score_gemma":0.00001809622,"teacher_disagreement_score":0.98229146,"about_ca_system_score_codex":0.000019838331,"about_ca_system_score_gemma":0.0000553221,"threshold_uncertainty_score":0.5405499},"labels":[],"label_agreement":null},{"id":"W2131291700","doi":"10.1109/tit.2009.2018178","title":"Multiple Description Coding for Stationary Gaussian Sources","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"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":"Gaussian; Mathematics; Rate–distortion theory; Algorithm; Coding (social sciences); Quantization (signal processing); Variable-length code; Shannon–Fano coding; Rate distortion; Frequency domain; Computer science; Decoding methods; Data compression; Statistics; Mathematical analysis; Physics","score_opus":0.017455649650962517,"score_gpt":0.2585403780087817,"score_spread":0.2410847283578192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131291700","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.00032824746,0.000008698826,0.9971798,0.0003173478,0.00031467082,0.00044011927,0.0000742926,0.00073817646,0.0005986322],"genre_scores_gemma":[0.7836667,0.000018252462,0.21486999,0.0011515247,0.00001835986,0.00011676163,0.000034146404,0.000005373322,0.00011892457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.00005896041,0.0003565865,0.00015573886,0.00021855102,0.00019263245],"domain_scores_gemma":[0.998989,0.00027064994,0.00016216855,0.00038795016,0.0001203934,0.00006987601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034037782,0.00013808075,0.00010951877,0.00033584863,0.00040640327,0.00017016468,0.00041527994,0.00006891657,0.000022774584],"category_scores_gemma":[0.00002576521,0.00013138865,0.00007617382,0.00023307464,0.000030219015,0.005664243,0.000002089604,0.00013527695,0.000050378447],"study_design_candidate":"design_other","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.00014121998,0.00008964968,0.0000012910617,0.000020245598,0.000010912999,3.0487263e-7,0.001557131,0.013344239,0.0020647016,0.15289284,0.0010123422,0.8288651],"study_design_scores_gemma":[0.001757953,0.0006741694,0.00035068445,0.00015037539,0.000020916488,0.000025275467,0.0005932754,0.34849113,0.28473014,0.33911064,0.023404138,0.00069132436],"about_ca_topic_score_codex":0.00000146032,"about_ca_topic_score_gemma":6.4211935e-7,"teacher_disagreement_score":0.8281738,"about_ca_system_score_codex":0.000073158015,"about_ca_system_score_gemma":0.000034375742,"threshold_uncertainty_score":0.53578734},"labels":[],"label_agreement":null},{"id":"W2131876845","doi":"10.1109/tit.2007.904773","title":"Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":109,"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":"Block code; Computer science; Decoding methods; Cooperative diversity; Antenna diversity; Code (set theory); Linear code; Transmission (telecommunications); Space–time block code; Fountain code; Full Rate; Constellation; Theoretical computer science; Algorithm; Telecommunications; Antenna (radio); Fading","score_opus":0.023432815274668107,"score_gpt":0.2602419983474376,"score_spread":0.2368091830727695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131876845","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.0021318786,0.000022764312,0.9949913,0.0002865963,0.00042842905,0.00036517045,0.000105890205,0.00020515389,0.0014628221],"genre_scores_gemma":[0.9937874,0.00006501011,0.0049186787,0.0010199982,0.00001797378,0.000035763285,0.000033783195,0.000004230476,0.00011715901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902153,0.000097166,0.0003338915,0.00012936926,0.00018824406,0.00022977398],"domain_scores_gemma":[0.99850416,0.00051310525,0.000109084496,0.0004060427,0.00037210775,0.00009551169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010702523,0.00014055058,0.00013307754,0.00018428617,0.0013477743,0.0001414634,0.0005844617,0.00006616667,0.000052128737],"category_scores_gemma":[0.000017704628,0.0001324368,0.000096048134,0.00041560555,0.000075012795,0.0016999525,0.000016327003,0.00019266647,0.00007367114],"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.00037393929,0.00021312307,0.000012853023,0.000024559433,0.00012217202,0.0000013361332,0.012586836,0.043861683,0.00013794847,0.42581683,0.0013656811,0.515483],"study_design_scores_gemma":[0.0074468777,0.0012078825,0.0013401348,0.00023075035,0.00013539106,0.000074756375,0.004887524,0.7793854,0.08597059,0.014132278,0.10308386,0.0021045678],"about_ca_topic_score_codex":0.000002856854,"about_ca_topic_score_gemma":0.000028367896,"teacher_disagreement_score":0.9916555,"about_ca_system_score_codex":0.000117271775,"about_ca_system_score_gemma":0.000047518966,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W2132750713","doi":"10.1109/18.959286","title":"On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication 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":"McMaster University","funders":"","keywords":"Upper and lower bounds; Multiuser detection; Computer science; Sequence (biology); Code division multiple access; Detector; Algorithm; Decoding methods; Mathematics; Theoretical computer science; Computer network; Telecommunications","score_opus":0.011484776584219331,"score_gpt":0.238168862175082,"score_spread":0.22668408559086267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132750713","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.10398835,0.000018220115,0.89417523,0.000013607965,0.00023074404,0.00057550997,0.000024926283,0.000545904,0.00042753425],"genre_scores_gemma":[0.9957427,0.00016960262,0.003795426,0.00006217377,0.000012084802,0.00017638579,0.0000063538823,0.00002636776,0.000008931264],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991022,0.000045637287,0.00042840955,0.00010288405,0.00013832001,0.0001825864],"domain_scores_gemma":[0.9991338,0.0002727949,0.00012766193,0.00029084136,0.00012770307,0.000047168633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003016823,0.00016949362,0.00015259563,0.0003437712,0.00023336668,0.000038358085,0.00011590301,0.0001311654,0.000011003568],"category_scores_gemma":[0.00001592543,0.00018265902,0.0000682557,0.00023771578,0.00006951667,0.00092844415,0.0000016862915,0.0002543414,0.000011607284],"study_design_candidate":"design_other","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.00017857055,0.000039624443,0.0000016462467,0.00016031222,0.00003698913,6.609608e-8,0.0011769779,0.23942637,0.024544263,0.0007249913,0.0000035632434,0.7337066],"study_design_scores_gemma":[0.00094580755,0.00030853171,0.00005220442,0.00015785413,0.000027503911,0.00002094921,0.0004693479,0.46011335,0.5196575,0.016556919,0.0013920667,0.00029799345],"about_ca_topic_score_codex":0.000009060607,"about_ca_topic_score_gemma":0.0000242349,"teacher_disagreement_score":0.8917543,"about_ca_system_score_codex":0.00015834614,"about_ca_system_score_gemma":0.000010703675,"threshold_uncertainty_score":0.74486184},"labels":[],"label_agreement":null},{"id":"W2135139954","doi":"10.1109/tit.2011.2158062","title":"On Powers of Gaussian White Noise","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":23,"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":"White noise; Additive white Gaussian noise; Gaussian noise; Gaussian; Renormalization; Gaussian random field; Gaussian process; Limit (mathematics)","score_opus":0.009333145729572064,"score_gpt":0.21432349563983333,"score_spread":0.20499034991026127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135139954","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.004194093,4.1838726e-7,0.90830326,0.00001332201,0.00031210127,0.000089598965,0.00014515156,0.000020451422,0.086921595],"genre_scores_gemma":[0.99891865,7.009895e-7,0.0007427707,0.00011656502,0.000010584031,0.00001768937,0.000007988886,0.0000060958314,0.00017896421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994849,0.000021031461,0.00022512759,0.000055873552,0.00009824984,0.00011484845],"domain_scores_gemma":[0.9996014,0.00005790797,0.00008431634,0.00015660634,0.000040580926,0.00005918957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000100484875,0.00009171865,0.00009400801,0.000110192836,0.00007013921,0.000011010307,0.000077026954,0.000027167358,0.0052489215],"category_scores_gemma":[0.0000018149984,0.000077418976,0.00007659098,0.00009094225,0.000029153844,0.00023516739,4.4755166e-7,0.00011072877,0.00038676904],"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.00015361958,0.00010039813,0.0000046309824,0.000006955438,0.000034430104,7.4561044e-8,0.0014616315,0.00052400335,0.000026010752,0.9494277,0.00012215522,0.04813838],"study_design_scores_gemma":[0.002931794,0.0012762073,0.00062778004,0.0001565014,0.00013491674,0.000001955372,0.0071845083,0.020944744,0.114230625,0.85013163,0.001626392,0.0007529134],"about_ca_topic_score_codex":0.00001742647,"about_ca_topic_score_gemma":1.3530989e-7,"teacher_disagreement_score":0.9947246,"about_ca_system_score_codex":0.000011858685,"about_ca_system_score_gemma":0.000016088865,"threshold_uncertainty_score":0.9956604},"labels":[],"label_agreement":null},{"id":"W2135381110","doi":"10.1109/tit.2009.2016058","title":"Fairness in Multiuser Systems With Polymatroid Capacity Region","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Computer science; Channel capacity; Mathematics; Telecommunications","score_opus":0.005846899715241029,"score_gpt":0.17508205607595353,"score_spread":0.1692351563607125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135381110","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.021619974,0.00002411565,0.9754939,0.000019347532,0.00032269827,0.00031224464,0.0000078302,0.00046420709,0.0017356885],"genre_scores_gemma":[0.99862224,0.000044476514,0.001117544,0.00007307945,0.000020058687,0.000054292563,0.000008702509,0.000015993779,0.0000436414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921703,0.000040676663,0.00031295186,0.00007948979,0.00015169836,0.00019814997],"domain_scores_gemma":[0.9995872,0.00004885405,0.00005901122,0.0002048078,0.00005029767,0.00004984746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011507062,0.00016302417,0.00014294346,0.00029886892,0.00007785315,0.00004423307,0.0000840685,0.0000994363,0.000009519418],"category_scores_gemma":[0.000001875031,0.00015341767,0.00003011908,0.00037990313,0.000027350092,0.0016254738,1.7979376e-7,0.00022895737,0.000041871488],"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.00008627138,0.000020142636,0.0000056970407,0.000028410044,0.00000882712,8.4768146e-7,0.0007473324,0.9811226,0.000035689063,0.0019049271,0.00001969067,0.016019529],"study_design_scores_gemma":[0.001449112,0.0001238744,0.00045124989,0.00022364095,0.00001745964,0.000046431727,0.00074633834,0.9903137,0.005233158,0.0006676326,0.00028486358,0.00044255666],"about_ca_topic_score_codex":0.0000064814867,"about_ca_topic_score_gemma":0.000007986127,"teacher_disagreement_score":0.97700226,"about_ca_system_score_codex":0.00017282032,"about_ca_system_score_gemma":0.000010328099,"threshold_uncertainty_score":0.6256191},"labels":[],"label_agreement":null},{"id":"W2135689668","doi":"10.1109/tit.2006.880024","title":"How Do More Golay Sequences Arise?","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Binary Golay code; Combinatorics; Algorithm; Computer science; Mathematics","score_opus":0.005058092395743148,"score_gpt":0.19375325435244775,"score_spread":0.1886951619567046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135689668","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.018704474,0.00005743492,0.9526151,0.00025044376,0.0016995041,0.00019103686,0.00006615327,0.00087912305,0.025536725],"genre_scores_gemma":[0.9977171,0.00003347288,0.00071213645,0.00008094179,0.00008734604,0.00007896341,0.000013138013,0.00001784716,0.0012590545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919385,0.000027888098,0.00027222533,0.00007922856,0.00022720036,0.00019959331],"domain_scores_gemma":[0.999543,0.000059479,0.0000523203,0.00023323084,0.000058982714,0.000052962103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015845345,0.00016775254,0.00011423625,0.0002948552,0.00015946433,0.00018402773,0.0001372509,0.00011085745,0.00020269431],"category_scores_gemma":[0.0000037177965,0.0001659079,0.000089418005,0.00027069374,0.00008608696,0.0018091924,3.9092282e-7,0.000243672,0.00035707542],"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.000027821809,0.000029018338,0.0000043077453,0.00007090802,0.000055033597,9.394911e-7,0.0010245818,0.9323716,0.0013718866,0.0112293875,0.0039431755,0.049871325],"study_design_scores_gemma":[0.0028006323,0.0002116182,0.000741933,0.00022386396,0.00020841486,0.00027714422,0.011934118,0.076379105,0.5597662,0.04624718,0.29873437,0.002475465],"about_ca_topic_score_codex":0.000008323783,"about_ca_topic_score_gemma":0.0000020936382,"teacher_disagreement_score":0.9790126,"about_ca_system_score_codex":0.00012619278,"about_ca_system_score_gemma":0.000018818606,"threshold_uncertainty_score":0.6765528},"labels":[],"label_agreement":null},{"id":"W2136017419","doi":"10.1109/tit.2008.928999","title":"New Binary Sequences With Optimal Autocorrelation Magnitude","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":47,"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; Lakehead University","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Statistics; Arithmetic","score_opus":0.010572955385884828,"score_gpt":0.20558574709073885,"score_spread":0.19501279170485403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136017419","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.013829869,0.000009085492,0.98032993,0.00015656417,0.00035182154,0.0002095674,0.0000040336176,0.00044676685,0.0046623726],"genre_scores_gemma":[0.95180535,0.0000172691,0.047257133,0.00039278873,0.000022131733,0.0000417655,0.0000034173047,0.0000060207526,0.00045413504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905753,0.00008842738,0.00024534113,0.00014144942,0.00028451503,0.00018275235],"domain_scores_gemma":[0.99924463,0.0001307746,0.00010638472,0.0003400259,0.00007595957,0.0001022373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737442,0.00014962739,0.00010210044,0.00037436507,0.00048595332,0.000096079864,0.00038129854,0.00006730023,0.00017704822],"category_scores_gemma":[0.000003115186,0.00012583107,0.00008129076,0.00062723126,0.0000920128,0.0035823274,0.0000021482426,0.00021155005,0.0003133822],"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.0005617702,0.00013074456,0.00003415482,0.000024444782,0.00009348946,0.00001401594,0.013180545,0.30987975,0.00014655398,0.3621122,0.0006975987,0.31312475],"study_design_scores_gemma":[0.01630786,0.013092982,0.011749912,0.00087861874,0.00041190253,0.004108866,0.0055506956,0.54026824,0.10437012,0.24737565,0.049059212,0.0068259244],"about_ca_topic_score_codex":0.0000085830325,"about_ca_topic_score_gemma":0.0000012352027,"teacher_disagreement_score":0.93797547,"about_ca_system_score_codex":0.000034307777,"about_ca_system_score_gemma":0.00014769855,"threshold_uncertainty_score":0.51312417},"labels":[],"label_agreement":null},{"id":"W2136538368","doi":"10.1109/tit.2009.2034880","title":"Semiorthogonal Space–Time Block Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication 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 Alberta","funders":"University of Moratuwa","keywords":"Block code; Circulant matrix; Mathematics; Linear code; Code word; MIMO; Decoding methods; Hadamard transform; Computer science; Theoretical computer science; Discrete mathematics; Algorithm; Channel (broadcasting); Telecommunications","score_opus":0.003952170585215408,"score_gpt":0.20877374937507892,"score_spread":0.2048215787898635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136538368","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.020687558,0.000008474494,0.96191806,0.00005961126,0.00040879083,0.00019411226,0.00006391517,0.0016760922,0.014983391],"genre_scores_gemma":[0.98945266,0.00006237907,0.0099389795,0.00012134096,0.000022976064,0.000099714984,0.000015837011,0.000022750439,0.00026337345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930876,0.000029952962,0.0002929109,0.00006076982,0.00014997565,0.00015764657],"domain_scores_gemma":[0.9991754,0.00016841115,0.00005101985,0.00046507688,0.00007173522,0.00006831198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024029928,0.00014972872,0.000119166034,0.00023165863,0.00015286569,0.00004129231,0.00022617602,0.00012812672,0.0004651609],"category_scores_gemma":[0.000008507747,0.00015797529,0.00007046036,0.00017440804,0.000077835786,0.0009946704,0.0000011702912,0.0005452489,0.0007642435],"study_design_candidate":"bench_or_experimental","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.00009519876,0.00011250065,0.000004899003,0.000100412886,0.00012563395,6.945498e-7,0.0018217145,0.6057434,0.06796288,0.041656505,0.0022994773,0.2800767],"study_design_scores_gemma":[0.00052672654,0.0000573934,0.00006648008,0.000051024446,0.000029632864,0.00004096955,0.00018640314,0.12925322,0.8106894,0.008744736,0.049731452,0.00062254723],"about_ca_topic_score_codex":0.0000011222374,"about_ca_topic_score_gemma":0.0000034512466,"teacher_disagreement_score":0.9687651,"about_ca_system_score_codex":0.000038125527,"about_ca_system_score_gemma":0.00001639718,"threshold_uncertainty_score":0.9823059},"labels":[],"label_agreement":null},{"id":"W2136621718","doi":"10.1109/tit.2011.2133010","title":"From Multi-Keyholes to Measure of Correlation and Power Imbalance in MIMO Channels: Outage Capacity Analysis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":39,"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 Ottawa","funders":"","keywords":"Spatial correlation; Channel capacity; MIMO; Mathematics; Rayleigh fading; Fading; Topology (electrical circuits); Gaussian; Channel (broadcasting); Measure (data warehouse); Applied mathematics; Computer science; Statistics; Telecommunications; Physics; Decoding methods; Combinatorics","score_opus":0.015612821770921891,"score_gpt":0.2031892998202911,"score_spread":0.18757647804936922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136621718","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.084068164,0.000018449213,0.9145444,0.0000026391199,0.000308155,0.0002408572,0.00011458967,0.000098618024,0.0006041114],"genre_scores_gemma":[0.99160945,0.000010914904,0.0082680285,0.000020742149,0.000005127842,0.000040893814,0.000013634073,0.000010585541,0.000020645812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992465,0.000046887697,0.00040428853,0.000088714434,0.00010406939,0.00010957954],"domain_scores_gemma":[0.9995566,0.000052464075,0.00008328271,0.0001801628,0.00007681452,0.000050671657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022284288,0.00012538128,0.00019417072,0.0005464686,0.000036953777,0.00001266884,0.00006579079,0.00009949086,0.00006583882],"category_scores_gemma":[0.000013511001,0.00013390685,0.00005131903,0.0005131133,0.000025652304,0.0009052823,7.0530507e-7,0.000126587,0.000027597314],"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.000052393414,0.000020519705,0.00019260551,0.000021223077,0.00009070169,1.1481512e-7,0.019830242,0.9774318,0.0003399633,0.0001446843,0.0000028775348,0.0018729288],"study_design_scores_gemma":[0.0013386749,0.00007539044,0.007837514,0.00016251137,0.0001940308,0.0000017134728,0.005109184,0.95067596,0.03347171,0.00061602384,0.000044283894,0.00047300945],"about_ca_topic_score_codex":0.00010077255,"about_ca_topic_score_gemma":0.000088821085,"teacher_disagreement_score":0.9075413,"about_ca_system_score_codex":0.00008212607,"about_ca_system_score_gemma":0.000006483509,"threshold_uncertainty_score":0.5460563},"labels":[],"label_agreement":null},{"id":"W2137004714","doi":"10.1109/tit.2009.2013001","title":"Performance Analysis and Design Criteria of BICM-ID With Signal Space Diversity for Keyhole Nakagami-$m$ Fading Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":13,"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 Saskatchewan; McGill University","funders":"","keywords":"Fading; Additive white Gaussian noise; Algorithm; Nakagami distribution; Computer science; Signal-to-noise ratio (imaging); Mathematics; Topology (electrical circuits); Decoding methods; Statistics; Telecommunications; Channel (broadcasting); Combinatorics","score_opus":0.012652215745970741,"score_gpt":0.22574185394208274,"score_spread":0.21308963819611199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137004714","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.0305988,0.000013294932,0.96844417,0.000019464731,0.000035385914,0.00029398562,0.000036219568,0.00025488395,0.00030381265],"genre_scores_gemma":[0.9753443,0.00011168396,0.024426349,0.000037757225,0.0000047808335,0.00003806545,0.000010381233,0.000007427798,0.000019229998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944663,0.000030774332,0.00022115865,0.000066139044,0.000111650625,0.0001236638],"domain_scores_gemma":[0.99944866,0.00012408434,0.00008182593,0.0002145928,0.00009041121,0.00004044589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025124985,0.00012449239,0.00017330436,0.00044788144,0.00023260483,0.000023249406,0.00013654957,0.000058801885,0.000024531553],"category_scores_gemma":[0.000002250621,0.00012205662,0.000050167153,0.00038923175,0.000050967446,0.001136786,0.0000018234845,0.00010707469,0.0000021904534],"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.00022454423,0.000024232468,0.000011354225,0.00007304717,0.00014406495,5.9666476e-8,0.0021746156,0.94117963,0.0019364207,0.0006046104,0.00002249488,0.053604897],"study_design_scores_gemma":[0.00052394,0.00036204586,0.00032671719,0.0000622716,0.00019908512,0.0000028031182,0.00037765296,0.5805342,0.41613334,0.0011231318,0.00009806013,0.0002567683],"about_ca_topic_score_codex":0.0000020631956,"about_ca_topic_score_gemma":7.117473e-7,"teacher_disagreement_score":0.94474554,"about_ca_system_score_codex":0.000047755253,"about_ca_system_score_gemma":0.0000077096265,"threshold_uncertainty_score":0.49773246},"labels":[],"label_agreement":null},{"id":"W2137106574","doi":"10.1109/tit.2005.850045","title":"A Generalized Framework for Distributed Power Control in Wireless Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":173,"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; Power control; Throughput; Wireless; Computer network; Transmitter power output; Signal-to-interference ratio; Coding (social sciences); Transmission (telecommunications); Interference (communication); Wireless network; Code rate; Power (physics); Real-time computing; Algorithm; Telecommunications; Mathematics; Decoding methods; Transmitter; Channel (broadcasting)","score_opus":0.004185315579633416,"score_gpt":0.21034552537403284,"score_spread":0.20616020979439942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137106574","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.003505663,0.00003285825,0.9944865,0.00007578375,0.000567313,0.00060461625,0.00014392217,0.0004214439,0.00016189828],"genre_scores_gemma":[0.9837596,0.000088044246,0.01530447,0.00039191832,0.0000637873,0.00026871383,0.00007598328,0.00003178668,0.00001572698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904764,0.000039905543,0.0004136642,0.00009278934,0.000112772665,0.00029323332],"domain_scores_gemma":[0.9993044,0.00029826217,0.00007012503,0.00019895367,0.00006541502,0.00006281431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002038623,0.00018818321,0.00019657785,0.00019189334,0.00010128383,0.000043688982,0.00011004689,0.00020286994,0.000100252146],"category_scores_gemma":[0.00000818657,0.00020323094,0.00008650623,0.0003293608,0.00002946504,0.000971788,3.8933734e-7,0.00028814047,0.000032951186],"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.00020469664,0.00002870417,0.0000012431273,0.000013280742,0.000027971537,1.0980022e-7,0.00025741963,0.93987966,0.000010099783,0.015147829,0.00012933141,0.044299647],"study_design_scores_gemma":[0.0016138452,0.000025999709,0.000017276334,0.00004824018,0.000015188004,0.0000016489419,0.0000837804,0.9940129,0.0007194087,0.0018966723,0.0013420017,0.00022302408],"about_ca_topic_score_codex":6.2223177e-7,"about_ca_topic_score_gemma":0.0000045320153,"teacher_disagreement_score":0.98025393,"about_ca_system_score_codex":0.00019692285,"about_ca_system_score_gemma":0.000012216689,"threshold_uncertainty_score":0.82875174},"labels":[],"label_agreement":null},{"id":"W2137543927","doi":"10.1109/tit.2013.2257918","title":"Upper Bounds on Matching Families in <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$\\BBZ_{pq}^{n}$</tex></formula>","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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 Calgary","funders":"","keywords":"Matching (statistics); Combinatorics; Upper and lower bounds; Modulo; Discrete mathematics; Mathematics; Statistics; Mathematical analysis","score_opus":0.007942866790031734,"score_gpt":0.21923461337938616,"score_spread":0.21129174658935443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137543927","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.20051278,0.000066374334,0.77473414,0.000529135,0.0017197882,0.001105674,0.00007517786,0.0007816816,0.02047526],"genre_scores_gemma":[0.99047595,0.00015551088,0.005907709,0.0019838084,0.00011818828,0.00038047024,0.00007117502,0.0000609187,0.0008462703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950798,0.00034152254,0.0016857915,0.0006573658,0.0011539373,0.0010815443],"domain_scores_gemma":[0.9963425,0.0008644821,0.00055463053,0.0014707108,0.000432742,0.00033494606],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018650688,0.0008151079,0.0006406841,0.0022282477,0.0012870759,0.0010431674,0.0014792201,0.00046044102,0.00052314176],"category_scores_gemma":[0.000057615158,0.00077103585,0.00058452133,0.0018777052,0.0002609833,0.009099512,0.00003719064,0.00091250415,0.0022678406],"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.00036904225,0.00044086936,0.000017036842,0.00014781296,0.00014801582,0.000004428863,0.015497947,0.03729755,0.0023902112,0.76462644,0.00058528763,0.17847534],"study_design_scores_gemma":[0.009448272,0.0022365267,0.0050465856,0.0012640607,0.0002571734,0.00021232144,0.00425926,0.3119991,0.025585206,0.5343647,0.1002819,0.0050448794],"about_ca_topic_score_codex":0.000039029426,"about_ca_topic_score_gemma":0.00011022389,"teacher_disagreement_score":0.7899632,"about_ca_system_score_codex":0.0003517858,"about_ca_system_score_gemma":0.00021250953,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W2137813581","doi":"10.1109/18.910572","title":"Factor graphs and the sum-product algorithm","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":6481,"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; University of Toronto","funders":"Massachusetts Institute of Technology","keywords":"Factor graph; Algorithm; Computer science; Prime-factor FFT algorithm; Viterbi algorithm; Bipartite graph; Mathematics; Graph; Decoding methods; Theoretical computer science; Fourier transform; Fractional Fourier transform; Fourier analysis","score_opus":0.010481317734682657,"score_gpt":0.23217440628737365,"score_spread":0.221693088552691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137813581","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.0035990616,0.000030480027,0.99169314,0.0006205517,0.00067853404,0.0002816712,0.0000062058803,0.00074919284,0.0023411673],"genre_scores_gemma":[0.9816319,0.00015891252,0.016850503,0.00096656766,0.000014945249,0.00007415002,9.652571e-7,0.0000071021827,0.00029500574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907154,0.00014158132,0.00025975375,0.00013686658,0.00022192979,0.00016833827],"domain_scores_gemma":[0.99895483,0.0002982474,0.000101780206,0.0005044638,0.00009242124,0.000048231846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867711,0.00013096006,0.00011226278,0.00023784515,0.00035133027,0.00018436537,0.0004298205,0.000046439087,0.000032033036],"category_scores_gemma":[0.000019014298,0.00009261659,0.00007466841,0.0004193758,0.00014018004,0.0018381051,0.000004024537,0.00025412784,0.000074900876],"study_design_candidate":"design_other","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.000041748142,0.000020472087,0.000003886127,0.0000056437957,0.000018746494,6.7878955e-7,0.004323466,0.00017559648,0.000018686162,0.054490346,0.00013409968,0.94076663],"study_design_scores_gemma":[0.0069744578,0.0006659149,0.0014068414,0.00019016696,0.00012140467,0.0013138168,0.003139769,0.3171036,0.10772813,0.5269408,0.032288622,0.0021264185],"about_ca_topic_score_codex":0.000026025808,"about_ca_topic_score_gemma":0.000005167108,"teacher_disagreement_score":0.97803277,"about_ca_system_score_codex":0.00003089788,"about_ca_system_score_gemma":0.000025915939,"threshold_uncertainty_score":0.3776795},"labels":[],"label_agreement":null},{"id":"W2138445373","doi":"10.1109/tit.2002.806147","title":"Power margin quality measures for correlated random variates derived from the normal distribution","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":21,"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 Alberta","funders":"","keywords":"Multivariate normal distribution; Convolution random number generator; Random variate; Measure (data warehouse); Computer science; Margin (machine learning); Multivariate statistics; Gaussian; Quality (philosophy); Random variable; Statistics; Mathematics; Data mining; Machine learning","score_opus":0.010638575999605219,"score_gpt":0.23652707672789042,"score_spread":0.2258885007282852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138445373","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.0051695863,0.000072636176,0.99114525,0.00005602326,0.000467004,0.00057211524,0.000525757,0.0006907336,0.0013008702],"genre_scores_gemma":[0.99599487,0.00012222884,0.0031356884,0.00013943882,0.000008021707,0.00036505997,0.00019253565,0.000018027395,0.000024143334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988699,0.00023840003,0.00048022476,0.0000764895,0.00016071183,0.00017427282],"domain_scores_gemma":[0.9981714,0.0010925247,0.00010634743,0.00044344805,0.00014396786,0.00004233371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007715947,0.00016778655,0.00015846947,0.00005573139,0.00033247098,0.00005936017,0.00021515384,0.00012916229,0.00016538879],"category_scores_gemma":[0.00009362275,0.00014028918,0.000114822215,0.00017297358,0.00006789029,0.000837923,9.3931203e-7,0.0002787817,0.000049341026],"study_design_candidate":"bench_or_experimental","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.0017631394,0.0001882407,0.000024669918,0.00007684767,0.00055974216,1.813391e-7,0.0069465903,0.7601158,0.007962038,0.11180495,0.0016633779,0.10889443],"study_design_scores_gemma":[0.008143693,0.00013501121,0.0013994701,0.00015219681,0.00017479916,0.00000846224,0.0035994437,0.05927152,0.8157837,0.053087857,0.056978997,0.0012648975],"about_ca_topic_score_codex":0.000011276865,"about_ca_topic_score_gemma":0.000005648776,"teacher_disagreement_score":0.9908253,"about_ca_system_score_codex":0.00011888071,"about_ca_system_score_gemma":0.00002285857,"threshold_uncertainty_score":0.57208264},"labels":[],"label_agreement":null},{"id":"W2138628599","doi":"10.1109/tit.2010.2094870","title":"Normal Factor Graphs and Holographic Transformations","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":59,"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 Ottawa","funders":"","keywords":"Factor graph; Factor (programming language); Discrete mathematics; Mathematics; Transformation (genetics); Intersection (aeronautics); Algebraic number; Holography; Combinatorics; Computer science; Algorithm; Decoding methods","score_opus":0.01763422653024705,"score_gpt":0.22108139237653862,"score_spread":0.20344716584629158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138628599","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.021886041,0.000010089155,0.9668022,0.00006170631,0.0004404437,0.00024623267,0.000019735227,0.0011495181,0.00938407],"genre_scores_gemma":[0.98223275,0.00005698648,0.01715821,0.0004251259,0.0000025826955,0.0000742346,0.0000017619215,0.0000070228634,0.000041331874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989904,0.00009597103,0.00036186774,0.0001368624,0.00019289443,0.00022201239],"domain_scores_gemma":[0.9992072,0.00010358198,0.000109114946,0.00038807146,0.000095639894,0.00009636522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003794803,0.000167428,0.00011993349,0.00071857276,0.00033485767,0.000095683594,0.00040587323,0.00010877962,0.000087346685],"category_scores_gemma":[0.000006345567,0.00015953161,0.00009983248,0.0005381223,0.00010272691,0.0041826125,0.0000026638058,0.0002876268,0.00008289341],"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.00008386833,0.00016036132,0.0001225003,0.00005373108,0.00006838529,0.0000017080309,0.042200793,0.000104024315,0.00020052317,0.2783658,0.00008857024,0.67854977],"study_design_scores_gemma":[0.004568354,0.0033446725,0.02926871,0.00033509952,0.0002174085,0.00083820237,0.0049080616,0.039903257,0.385271,0.5218233,0.005502725,0.004019222],"about_ca_topic_score_codex":0.000020932606,"about_ca_topic_score_gemma":0.000010795652,"teacher_disagreement_score":0.9603467,"about_ca_system_score_codex":0.000021686928,"about_ca_system_score_gemma":0.00003006855,"threshold_uncertainty_score":0.6505511},"labels":[],"label_agreement":null},{"id":"W2138674143","doi":"10.1109/tit.2011.2165149","title":"High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"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 Guelph; University of Waterloo","funders":"","keywords":"Dimension (graph theory); Code word; Decoding methods; Block code; Amplitude; Algorithm; Construct (python library); Quantum; Block (permutation group theory); Computer science; Discrete mathematics; Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.02439391026629164,"score_gpt":0.23118838118950652,"score_spread":0.20679447092321487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138674143","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.1191284,0.000005863389,0.8779785,0.000058473575,0.0017160431,0.00025073544,0.000013976227,0.00044260718,0.00040538138],"genre_scores_gemma":[0.9349479,0.0000038058263,0.06441501,0.00047239175,0.000047443526,0.00005704287,0.00000524638,0.000012047838,0.000039132763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987149,0.00006842954,0.00044344546,0.00021108572,0.00021142946,0.00035067392],"domain_scores_gemma":[0.9988544,0.0003095705,0.00020824086,0.00041104236,0.00013520631,0.00008153774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066593423,0.00020612252,0.00018124288,0.00029133615,0.0006449084,0.00016545916,0.0005419032,0.000083250095,0.000021977197],"category_scores_gemma":[0.00001819075,0.0001890576,0.000114774426,0.0003144133,0.000057198777,0.0014768888,0.0000057790703,0.00026622796,0.00006652146],"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.00013560949,0.00014932598,0.000004757376,0.000103815255,0.000053586966,5.759043e-7,0.016031852,0.15205377,0.00016231455,0.034573194,0.0000422157,0.796689],"study_design_scores_gemma":[0.0005875478,0.00047755922,0.00016371685,0.00012397175,0.000017530116,0.000047644153,0.00048727004,0.9392555,0.046710376,0.011246652,0.00049515866,0.0003871215],"about_ca_topic_score_codex":0.000021644053,"about_ca_topic_score_gemma":0.0000018372432,"teacher_disagreement_score":0.8158195,"about_ca_system_score_codex":0.000056684792,"about_ca_system_score_gemma":0.000043803935,"threshold_uncertainty_score":0.77095455},"labels":[],"label_agreement":null},{"id":"W2139079991","doi":"10.1109/tit.2006.880059","title":"Equivalence of Decoupling Schemes and Orthogonal Arrays","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":31,"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":"Hamiltonian (control theory); Unitary state; Decoupling (probability); Hadamard transform; Equivalence (formal languages); Multipartite; Discrete mathematics; Computer science; Mathematics; Quantum; Physics; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.006340167027529227,"score_gpt":0.2088020951819668,"score_spread":0.20246192815443756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139079991","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.036579926,0.00002080381,0.95834935,0.000058831134,0.0001933211,0.00009357251,0.000010603771,0.00012139251,0.0045722118],"genre_scores_gemma":[0.98840517,0.000025130688,0.011281535,0.00023543912,0.000008144635,0.00001464524,0.0000029209211,0.000002650018,0.00002436645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911284,0.000023146982,0.00041249784,0.000077353245,0.00023798177,0.00013615334],"domain_scores_gemma":[0.9993569,0.00010282825,0.00016761778,0.0002192047,0.00010945706,0.00004395996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035250006,0.000102202226,0.000099080324,0.0003500363,0.00016599843,0.00008864252,0.0002210323,0.00005234431,0.000033594355],"category_scores_gemma":[0.0000039690754,0.00009585568,0.00007087275,0.00035646575,0.0000904206,0.0026984052,0.0000023345942,0.000110146335,0.000036528403],"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.000028334383,0.0000417636,0.000028752233,0.00005421481,0.000014094848,1.3567721e-7,0.0007587928,0.012374802,0.00023055264,0.91138506,0.00005516323,0.07502835],"study_design_scores_gemma":[0.0025449407,0.0004019276,0.0021231954,0.00021144065,0.000047337395,0.000079843194,0.0013771534,0.46860525,0.22694457,0.2894599,0.0072020683,0.0010023597],"about_ca_topic_score_codex":0.0000038310823,"about_ca_topic_score_gemma":0.0000013000207,"teacher_disagreement_score":0.95182526,"about_ca_system_score_codex":0.000011664386,"about_ca_system_score_gemma":0.000035331726,"threshold_uncertainty_score":0.3908881},"labels":[],"label_agreement":null},{"id":"W2139246501","doi":"10.1109/tit.2004.824914","title":"Interleaver Pruning for Construction of Variable-Length Turbo Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Partenariat Canadien Contre Le Cancer","keywords":"Pruning; Turbo code; Algorithm; Convolutional code; Computer science; Variable (mathematics); Code (set theory); Puncturing; Turbo; Mathematics; Decoding methods; Telecommunications","score_opus":0.006460125963590239,"score_gpt":0.21681012869910746,"score_spread":0.2103500027355172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139246501","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.0029838649,0.000013713776,0.9930592,0.000014843669,0.0003459329,0.0003417992,0.00007624942,0.00055071287,0.00261368],"genre_scores_gemma":[0.86292464,0.00007346612,0.13675618,0.000043387652,0.000009853976,0.0001464748,0.00001607595,0.000016013559,0.000013888052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993327,0.00002068772,0.0003851993,0.000052776497,0.000093835966,0.00011476701],"domain_scores_gemma":[0.9993316,0.00014666705,0.00009552587,0.0002734559,0.00012295852,0.00002980234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019903132,0.00011719921,0.00013532395,0.0002458686,0.00009745945,0.00001717813,0.00014787975,0.000089475754,0.00004217637],"category_scores_gemma":[0.000011668025,0.00012636586,0.0000518549,0.00017823884,0.00008516838,0.0010118777,9.094772e-7,0.00016873065,0.000012266159],"study_design_candidate":"bench_or_experimental","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.00007110524,0.000025308715,3.0001658e-7,0.00014209285,0.000049546863,2.0991974e-8,0.0011663329,0.70306724,0.0035212312,0.11814587,0.000019062958,0.17379189],"study_design_scores_gemma":[0.0006114467,0.00009621527,0.0000033935285,0.00014746567,0.000024513594,0.000007832839,0.00080836564,0.0122477105,0.93012995,0.05386304,0.0018661752,0.0001938756],"about_ca_topic_score_codex":0.0000030385067,"about_ca_topic_score_gemma":0.0000010904415,"teacher_disagreement_score":0.92660874,"about_ca_system_score_codex":0.00012418472,"about_ca_system_score_gemma":0.000023692086,"threshold_uncertainty_score":0.515305},"labels":[],"label_agreement":null},{"id":"W2139416652","doi":"10.1109/tit.2008.926449","title":"Coding for Errors and Erasures in Random Network Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1097,"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":"Grassmannian; Decoding methods; Mathematics; Code word; Discrete mathematics; List decoding; Linear network coding; Vector space; Coding theory; Linear space; Linear code; Combinatorics; Algorithm; Concatenated error correction code; Block code; Computer science; Network packet; Pure mathematics","score_opus":0.02987853723354601,"score_gpt":0.25694821302863624,"score_spread":0.22706967579509024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139416652","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.0036067765,0.0000922399,0.99371535,0.0002925744,0.00034246832,0.00034448132,0.0000032435428,0.00011396988,0.0014888768],"genre_scores_gemma":[0.99030244,0.0009956417,0.007742696,0.0007286435,0.000021268346,0.000107908185,0.0000026137718,0.000005082616,0.000093694085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990949,0.00014490115,0.00033754655,0.00011214498,0.00011763601,0.00019289636],"domain_scores_gemma":[0.998881,0.00063201366,0.00008806521,0.00026266987,0.00008382021,0.00005245393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082806585,0.00011371788,0.00014704195,0.00020915912,0.0006317331,0.000081731196,0.00027300333,0.00005317134,0.000016671387],"category_scores_gemma":[0.000024500256,0.00011130225,0.000053639975,0.00036297948,0.000062865685,0.0013790834,0.000004761314,0.00017874583,0.0000131216275],"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.0005339042,0.00009762297,0.00007983009,0.000058629295,0.0000624484,0.0000016922861,0.021248497,0.1556764,0.00019081697,0.42011786,0.0014420678,0.40049025],"study_design_scores_gemma":[0.008771189,0.0002511142,0.0015983926,0.00032484005,0.000022637918,0.00008691279,0.0006806886,0.95353866,0.0051784,0.010885065,0.017813755,0.0008483347],"about_ca_topic_score_codex":0.0000017945003,"about_ca_topic_score_gemma":0.000014709123,"teacher_disagreement_score":0.98669565,"about_ca_system_score_codex":0.000047412675,"about_ca_system_score_gemma":0.000049850332,"threshold_uncertainty_score":0.4858844},"labels":[],"label_agreement":null},{"id":"W2139961280","doi":"10.1109/tit.2007.901177","title":"Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":65,"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":"Upper and lower bounds; Monomial; Mathematics; Block code; Diagonal; Covariance; Combinatorics; Block (permutation group theory); Diagonal matrix; Discrete mathematics; Symbol (formal); Algorithm; Decoding methods; Computer science; Statistics","score_opus":0.02328828392727936,"score_gpt":0.26116469290481564,"score_spread":0.23787640897753629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139961280","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.0004581499,0.000048797072,0.99556977,0.00024474759,0.00070673105,0.00052226224,0.00003437205,0.00029841752,0.002116758],"genre_scores_gemma":[0.9894739,0.00009147274,0.008627106,0.0013430548,0.000042112177,0.000105353116,0.000051267827,0.000010206025,0.00025554304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987039,0.00011748947,0.0005034964,0.00016174625,0.00017765237,0.00033570832],"domain_scores_gemma":[0.99797374,0.0007698288,0.0001514787,0.0005520169,0.00043357202,0.00011938505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059757,0.0001822058,0.00016312145,0.00021517772,0.000738004,0.00025780033,0.0005919816,0.000105384745,0.00007077142],"category_scores_gemma":[0.000035611087,0.0001738974,0.00010432034,0.0006727357,0.00006441032,0.0019418553,0.0000069145394,0.00025645935,0.00006956625],"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.00023217204,0.00020948931,0.0000017907173,0.000013801951,0.00007305278,5.212421e-7,0.002752693,0.2103574,0.00024564337,0.15769687,0.0014025007,0.62701404],"study_design_scores_gemma":[0.0021684603,0.0005232637,0.00007976806,0.00008905648,0.000033395725,0.000017574088,0.0011894075,0.8980016,0.04334289,0.0025891783,0.051261693,0.0007036743],"about_ca_topic_score_codex":8.785184e-7,"about_ca_topic_score_gemma":0.000022960528,"teacher_disagreement_score":0.98901576,"about_ca_system_score_codex":0.00015752664,"about_ca_system_score_gemma":0.00005913604,"threshold_uncertainty_score":0.709133},"labels":[],"label_agreement":null},{"id":"W2140544378","doi":"10.1109/tit.2007.901250","title":"On the Capacity of Time-Varying Channels With Periodic Feedback","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Transmitter; Codebook; Channel capacity; Channel state information; Additive white Gaussian noise; Fading; Channel (broadcasting); Multiplexing; Binary erasure channel; Gaussian; Computer science; Control theory (sociology); Mathematics; Telecommunications; Algorithm; Wireless; Physics","score_opus":0.006388680630493221,"score_gpt":0.1829608959703504,"score_spread":0.17657221533985717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140544378","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.062372312,0.0000047735293,0.93047005,0.000020459334,0.00023553967,0.00023171985,0.000014588762,0.00019551872,0.0064550294],"genre_scores_gemma":[0.9985656,0.00001856759,0.0011602358,0.00012446563,0.000019378715,0.000022670498,0.0000060205302,0.00001863043,0.000064422806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926853,0.000026499702,0.00027999232,0.000057099474,0.00019330962,0.00017458276],"domain_scores_gemma":[0.9993136,0.0002912894,0.00007785092,0.00020872931,0.000069202986,0.000039328268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485742,0.00013754191,0.00011241452,0.00017187941,0.00016264593,0.00002355136,0.00010044228,0.00006801261,0.00021437643],"category_scores_gemma":[0.0000057311854,0.000102255304,0.000044013654,0.0003172554,0.00008268639,0.000605394,4.0317846e-7,0.00022496146,0.00013737268],"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.00012563,0.000013963457,3.7385044e-7,0.00002379724,0.000028583625,1.2897675e-7,0.0014255092,0.9853494,0.00024688855,0.0024616148,0.00003741207,0.01028666],"study_design_scores_gemma":[0.0011800792,0.00029166698,0.00004604877,0.00029456732,0.000052488824,0.00001870691,0.000977081,0.7570311,0.23661834,0.0024790117,0.00048823594,0.0005227245],"about_ca_topic_score_codex":0.0000013488973,"about_ca_topic_score_gemma":0.0000013614947,"teacher_disagreement_score":0.9361933,"about_ca_system_score_codex":0.00007590547,"about_ca_system_score_gemma":0.0000098578685,"threshold_uncertainty_score":0.41698503},"labels":[],"label_agreement":null},{"id":"W2141665878","doi":"10.1109/tit.2005.846405","title":"Risk-Sensitive Filtering and Smoothing for Continuous-Time Markov Processes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Control Systems and Identification","field":"Engineering","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 Calgary","funders":"Australian Research Council; Australian Government; National ICT Australia","keywords":"Markov process; Smoothing; Markov chain; Stochastic process; Markov model; Markov renewal process; Applied mathematics; Mathematics; Brownian motion; Stochastic differential equation; Computer science; Filtering problem; Markov kernel; Markov property; Variable-order Markov model; Hidden Markov model; Algorithm; Kalman filter; Statistics; Artificial intelligence; Extended Kalman filter","score_opus":0.00330768301444699,"score_gpt":0.18179415811875344,"score_spread":0.17848647510430646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141665878","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.029901437,0.00004147677,0.9669582,0.000035554815,0.00022988352,0.00040045512,0.00011457653,0.0002699395,0.0020484412],"genre_scores_gemma":[0.9984044,0.0000558029,0.00096576154,0.000041436175,0.000057555728,0.00012254238,0.00001041468,0.000013656628,0.0003284711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994361,0.000021847269,0.0002758803,0.0000676979,0.000076357646,0.00012215623],"domain_scores_gemma":[0.9995015,0.00019134984,0.000070646485,0.00010004722,0.00009929518,0.000037155598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032006484,0.000105581064,0.00011652317,0.00013995722,0.00017522588,0.00010969599,0.00004124915,0.00005716905,0.00003308537],"category_scores_gemma":[0.000022704458,0.00010812778,0.000039645995,0.00007365368,0.000017584382,0.0011636455,3.7272972e-7,0.000092998416,0.00008292778],"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.00018751757,0.00002655,0.0000028195936,0.0004576044,0.00014605248,1.2127853e-7,0.0072044423,0.14872894,0.0063048983,0.00043500238,0.0004907671,0.8360153],"study_design_scores_gemma":[0.0028357634,0.0001444688,0.00041263006,0.0003031264,0.00019476682,0.000032462944,0.0031780878,0.8088893,0.1448516,0.00076128193,0.03757053,0.00082593656],"about_ca_topic_score_codex":0.0000063545426,"about_ca_topic_score_gemma":0.000010596493,"teacher_disagreement_score":0.96850294,"about_ca_system_score_codex":0.000049452887,"about_ca_system_score_gemma":0.000010196783,"threshold_uncertainty_score":0.44093227},"labels":[],"label_agreement":null},{"id":"W2141746073","doi":"10.1109/tit.2012.2236381","title":"Incremental Relaying for the Gaussian Interference Channel With a Degraded Broadcasting Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":9,"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":"Relay; Relay channel; Computer science; Channel (broadcasting); Topology (electrical circuits); Broadcasting (networking); Transmitter; Interference (communication); Computer network; Transmission (telecommunications); Telecommunications; Mathematics; Physics; Power (physics)","score_opus":0.02062139363930787,"score_gpt":0.23517059458312273,"score_spread":0.21454920094381486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141746073","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.0077086636,0.00007336987,0.988311,0.00009180799,0.0002332045,0.00048037074,0.000024668723,0.0006145936,0.0024623536],"genre_scores_gemma":[0.9949707,0.00006191534,0.00424785,0.00014980216,0.000024653862,0.0004918061,0.00000804749,0.000023218216,0.000022050262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992427,0.000047760732,0.00029304007,0.000051324627,0.0001334204,0.00023171534],"domain_scores_gemma":[0.999081,0.0003941106,0.00007547749,0.00034136738,0.000051805448,0.000056252742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005594441,0.0001482409,0.00010029488,0.00016182457,0.00034663093,0.00006396089,0.00025208687,0.00007323716,0.000036131667],"category_scores_gemma":[0.00001067871,0.00011104647,0.000055833498,0.00018784631,0.00006148757,0.0014335786,0.0000021896417,0.00032951465,0.00003307972],"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.00095228787,0.00029576058,0.00005487938,0.0005766791,0.000728062,3.3111968e-7,0.08966977,0.26593167,0.003266753,0.06514091,0.0013173702,0.57206553],"study_design_scores_gemma":[0.0031152458,0.0005616381,0.0005775569,0.000989927,0.00032645467,0.00016699819,0.028087039,0.51532966,0.43256608,0.0019752262,0.014557092,0.0017470929],"about_ca_topic_score_codex":0.000006554851,"about_ca_topic_score_gemma":0.0000051544253,"teacher_disagreement_score":0.987262,"about_ca_system_score_codex":0.00011049798,"about_ca_system_score_gemma":0.000011636446,"threshold_uncertainty_score":0.45283437},"labels":[],"label_agreement":null},{"id":"W2142162318","doi":"10.1109/tit.2010.2046236","title":"Is SP BP?","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","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 Ottawa","funders":"","keywords":"Unification; Constraint satisfaction problem; Probabilistic logic; Constraint (computer-aided design); Emphasis (telecommunications); Belief propagation; Notation; Computer science; Constraint satisfaction; Security token; Local consistency; Reduction (mathematics); Theoretical computer science; Algorithm; Factor graph; Mathematics; Discrete mathematics; Artificial intelligence; Decoding methods; Arithmetic; Programming language","score_opus":0.009486741150574348,"score_gpt":0.24544525729776595,"score_spread":0.2359585161471916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142162318","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.0051192585,0.0000012222637,0.97536683,0.00044233358,0.001831006,0.00014815562,0.000006579126,0.0011162235,0.015968407],"genre_scores_gemma":[0.96479946,0.0000039487313,0.032167267,0.0025575594,0.000022413078,0.000043658838,8.452469e-7,0.000006879806,0.00039798662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991626,0.000040711973,0.00026220034,0.000124515,0.00023558189,0.00017435818],"domain_scores_gemma":[0.99893856,0.00013823804,0.00009896706,0.00064327446,0.0001124195,0.000068533],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005208605,0.000121900186,0.00008546167,0.0003029731,0.00022497348,0.0001544285,0.00059538626,0.00010612863,0.00024247197],"category_scores_gemma":[0.000013347271,0.00011777521,0.00008671321,0.00033306977,0.000046410303,0.0024080114,0.0000028177867,0.00047267435,0.0009611557],"study_design_candidate":"bench_or_experimental","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.00003336553,0.0000976966,0.000009570705,0.00002393527,0.00002676879,0.0000010496536,0.009434475,0.0004607656,0.0028875,0.17525382,0.0036426943,0.80812836],"study_design_scores_gemma":[0.00059252896,0.0002347712,0.00019710444,0.000045131106,0.00002009114,0.00011248676,0.0003161806,0.052032787,0.81420505,0.08076317,0.0507745,0.0007062093],"about_ca_topic_score_codex":0.000010630263,"about_ca_topic_score_gemma":0.0000073490755,"teacher_disagreement_score":0.9596802,"about_ca_system_score_codex":0.000028650686,"about_ca_system_score_gemma":0.000051210613,"threshold_uncertainty_score":0.9998167},"labels":[],"label_agreement":null},{"id":"W2142486636","doi":"10.1109/tit.2005.846404","title":"On Factor Graphs and the Fourier Transform","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":44,"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; University of Ottawa","funders":"","keywords":"Mathematics; Multiplicative function; Factor graph; Discrete mathematics; Duality (order theory); Convolutional code; Combinatorics; Cograph; Chordal graph; 1-planar graph; Algorithm; Graph","score_opus":0.007316594167935572,"score_gpt":0.22462673122805185,"score_spread":0.2173101370601163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142486636","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.00509843,0.000010182872,0.98250085,0.0018796445,0.00033440057,0.00033781247,0.0000081649205,0.00061289326,0.009217634],"genre_scores_gemma":[0.9904821,0.000037040834,0.0068191364,0.0023353042,0.0000098759665,0.00007969561,5.430875e-7,0.0000065676677,0.00022972291],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990687,0.000099238976,0.00027563688,0.000117773,0.00027086397,0.00016783254],"domain_scores_gemma":[0.99888253,0.00049726566,0.000081828126,0.000429145,0.00005511341,0.000054096494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061346125,0.00014344571,0.00011252029,0.00025295635,0.00033995102,0.00015298407,0.00038630885,0.00007109646,0.000051091745],"category_scores_gemma":[0.0000145364065,0.000098062286,0.0000992157,0.00025062702,0.00011741549,0.0018127295,0.0000016328694,0.00030594625,0.00011754958],"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.00010662373,0.000024360495,2.6845862e-7,0.000005762143,0.000015028753,1.0648357e-7,0.0058991513,0.0009257835,0.000008305913,0.3185681,0.00015809834,0.6742884],"study_design_scores_gemma":[0.0056342296,0.00074944575,0.00014715991,0.00014931445,0.00006325293,0.00011284669,0.0008352993,0.23782548,0.10022142,0.6317969,0.021377536,0.0010871094],"about_ca_topic_score_codex":0.0000065467107,"about_ca_topic_score_gemma":0.000011317533,"teacher_disagreement_score":0.9853837,"about_ca_system_score_codex":0.000047497575,"about_ca_system_score_gemma":0.000025168778,"threshold_uncertainty_score":0.3998864},"labels":[],"label_agreement":null},{"id":"W2143019587","doi":"10.1109/tit.2002.804044","title":"New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":144,"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":"Autocorrelation; Mathematics; Linear span; Sequence (biology); Quadratic equation; Binary number; Span (engineering); Discrete mathematics; Algorithm; Combinatorics; Statistics; Arithmetic; Engineering","score_opus":0.016014499892090993,"score_gpt":0.23097149485726928,"score_spread":0.21495699496517828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143019587","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.00297751,0.00001894966,0.9953304,0.00013490475,0.00021482835,0.00043502834,0.00004274738,0.00020584662,0.0006398049],"genre_scores_gemma":[0.97452796,0.000010838519,0.024226341,0.0004908282,0.000026993795,0.00006732277,0.000004142249,0.000009709253,0.0006358662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990833,0.00007555229,0.00026623224,0.00017286508,0.0001663548,0.00023571055],"domain_scores_gemma":[0.99910885,0.00024183163,0.00011051841,0.00028290405,0.00013257086,0.00012330382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046864478,0.00016273034,0.00012126046,0.00019235202,0.00058842567,0.00023063313,0.00020411398,0.000079130325,0.00016187488],"category_scores_gemma":[0.0000069144,0.00012004363,0.00006601343,0.00034121066,0.00006571579,0.0021986233,0.000002622736,0.00016511983,0.00006784292],"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.001056469,0.00038379416,0.00013426844,0.00022755968,0.00017026684,0.000039644525,0.021254497,0.0934521,0.000056317567,0.16506895,0.0016840502,0.7164721],"study_design_scores_gemma":[0.003116395,0.00071218325,0.000052111296,0.00009827826,0.0000425914,0.0009337861,0.00025062656,0.9724854,0.0030577148,0.011631199,0.007108006,0.00051167194],"about_ca_topic_score_codex":0.0000047805615,"about_ca_topic_score_gemma":0.0000060512093,"teacher_disagreement_score":0.97155046,"about_ca_system_score_codex":0.00002207866,"about_ca_system_score_gemma":0.000036025114,"threshold_uncertainty_score":0.4895237},"labels":[],"label_agreement":null},{"id":"W2143772938","doi":"10.1109/tit.2007.901248","title":"Dual RSA and Its Security Analysis","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":119,"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":"PKCS #1; Public-key cryptography; Computer science; Dual (grammatical number); Secrecy; Cryptography; Key generation; Information-theoretic security; Key size; Authentication (law); Security analysis; Key (lock); Theoretical computer science; Mathematics; Computer security; Encryption","score_opus":0.006610957988836975,"score_gpt":0.2277177245244399,"score_spread":0.2211067665356029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143772938","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.038961776,0.000030778283,0.95799667,0.0000664007,0.00023999649,0.000096691365,0.000053517117,0.00016329443,0.0023908848],"genre_scores_gemma":[0.9977278,0.00004031368,0.0017954488,0.00039816694,0.00001244631,0.0000059742815,0.000009928183,0.0000018891758,0.000008042483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991215,0.00005108087,0.0002856123,0.00013258161,0.00022633228,0.00018291066],"domain_scores_gemma":[0.9992312,0.00018593593,0.000080928476,0.00031101124,0.00008043072,0.000110472836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010132415,0.000107632026,0.00011494628,0.0007063189,0.00025392158,0.0001365356,0.00020568541,0.0000749115,0.00007438535],"category_scores_gemma":[0.0000067768638,0.000103343475,0.000113701346,0.0012354989,0.000041003772,0.0027621672,0.0000033599645,0.00018275209,0.000073093346],"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.000104768376,0.00012440368,0.0000222571,0.000026869457,0.00029588386,0.0000028566224,0.016565869,0.0012260631,0.000046835845,0.8513578,0.00007825138,0.13014816],"study_design_scores_gemma":[0.006115261,0.0010963184,0.016591962,0.00009108944,0.0017300637,0.00020064368,0.008391244,0.38773414,0.15768495,0.36873412,0.048106212,0.0035239754],"about_ca_topic_score_codex":0.000009839948,"about_ca_topic_score_gemma":0.000033302636,"teacher_disagreement_score":0.95876604,"about_ca_system_score_codex":0.000019355713,"about_ca_system_score_gemma":0.000017598224,"threshold_uncertainty_score":0.42142245},"labels":[],"label_agreement":null},{"id":"W2144323841","doi":"10.1109/tit.2011.2159478","title":"Two New Measures for Permutations: Ambiguity and Deficiency","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"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":"Permutation (music); Abelian group; Ambiguity; Combinatorics; Multiplicative function; Function (biology); Inverse; Mathematics; Discrete mathematics; Finite field; Computer science","score_opus":0.030470348110095424,"score_gpt":0.24476481365843122,"score_spread":0.2142944655483358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144323841","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.002573564,0.000029820496,0.99042386,0.000064498796,0.00036861992,0.00024132211,0.0000116715755,0.00021471556,0.0060719415],"genre_scores_gemma":[0.9793769,0.000015855027,0.019987678,0.0004565782,0.000011840209,0.00006173203,0.000001265489,0.0000042938477,0.00008385914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992808,0.00006318949,0.00023353177,0.00012586499,0.00013909336,0.00015753313],"domain_scores_gemma":[0.9993149,0.00015524849,0.00007706263,0.0002703793,0.00009366162,0.00008875697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735554,0.000110388486,0.000085063235,0.0002757347,0.00038089935,0.0001104783,0.00028152813,0.00004204206,0.0000456087],"category_scores_gemma":[0.000016664899,0.00010379456,0.00008700881,0.00028318932,0.00006725692,0.0018176029,0.0000020411433,0.00009517492,0.000041120227],"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.00006474736,0.00003583872,0.0000024253568,0.0000107093865,0.000011635539,7.930855e-8,0.006816545,0.00027964325,0.00003167659,0.71704674,0.00004990052,0.27565008],"study_design_scores_gemma":[0.0012012772,0.00034339272,0.00031883933,0.000026828688,0.00004215527,0.000023155266,0.00094890414,0.0053080143,0.012291463,0.9774337,0.0017356301,0.000326667],"about_ca_topic_score_codex":0.00001632062,"about_ca_topic_score_gemma":0.0000063171856,"teacher_disagreement_score":0.97680336,"about_ca_system_score_codex":0.000016279442,"about_ca_system_score_gemma":0.000058692396,"threshold_uncertainty_score":0.42326194},"labels":[],"label_agreement":null},{"id":"W2144437575","doi":"10.1109/18.978755","title":"On the structure of optimal entropy-constrained scalar quantizers","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":71,"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":"Mathematics; Rate–distortion theory; Regular polygon; Entropy (arrow of time); Applied mathematics; Monotone polygon; Piecewise; Quantization (signal processing); Convex function; Monotonic function; Convex optimization; Mathematical optimization; Discrete mathematics; Mathematical analysis; Algorithm; Data compression","score_opus":0.009559750896264157,"score_gpt":0.22328289237964716,"score_spread":0.213723141483383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144437575","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.004877684,0.0000062265517,0.99295723,0.00035997832,0.00025463887,0.00025009448,0.00010141903,0.0002582117,0.0009344854],"genre_scores_gemma":[0.97609794,0.000017430048,0.023125617,0.0006818289,0.0000065639592,0.000012331575,0.0000031866243,0.0000054524703,0.000049672555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988915,0.00012078006,0.0003621675,0.00012708725,0.00033300772,0.00016547204],"domain_scores_gemma":[0.99854785,0.0004198318,0.00019604593,0.0007015499,0.000084324536,0.000050381313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019091247,0.00014706224,0.00012853666,0.00022807487,0.0002150489,0.00006837825,0.0007302597,0.00007437554,0.00067298615],"category_scores_gemma":[0.000027775033,0.00010139375,0.000088740744,0.00031754383,0.00014115374,0.001603202,0.0000049294913,0.0002804814,0.00009644655],"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.00005442481,0.00008363346,2.9258763e-7,0.000017343697,0.000034003602,6.361945e-7,0.0017475861,0.036992118,0.0053914585,0.819901,0.0014717343,0.1343058],"study_design_scores_gemma":[0.0006412865,0.0002720584,0.000009533832,0.00009199879,0.000015039514,0.000023327833,0.00034484259,0.17164527,0.7744587,0.05018607,0.0020045757,0.0003072893],"about_ca_topic_score_codex":0.0000012982341,"about_ca_topic_score_gemma":1.7498368e-7,"teacher_disagreement_score":0.97122025,"about_ca_system_score_codex":0.000032864213,"about_ca_system_score_gemma":0.000015484598,"threshold_uncertainty_score":0.7368726},"labels":[],"label_agreement":null},{"id":"W2144916011","doi":"10.1109/tit.2015.2413780","title":"Bit-Error Resilient Index Assignment for Multiple Description Scalar Quantizers","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":5,"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":"Hamming distance; Hypercube; Discrete mathematics; Algorithm; Mathematics; Computer science; Permutation (music); Connection (principal bundle); Combinatorics","score_opus":0.042513704087232124,"score_gpt":0.2742095388981154,"score_spread":0.23169583481088327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144916011","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.005258532,0.000008255295,0.9902196,0.0002688193,0.00168011,0.00076935155,0.000016559574,0.0009481523,0.0008306113],"genre_scores_gemma":[0.95878434,0.0000035382961,0.04013373,0.00050190743,0.000020108017,0.0003369631,0.000006259134,0.000012818477,0.00020034604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843484,0.00014509584,0.000476165,0.00021247666,0.00044768065,0.0002837585],"domain_scores_gemma":[0.998543,0.00025465718,0.00020767814,0.00055009266,0.00028803825,0.00015650668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014411148,0.00019000599,0.00015673527,0.00046939624,0.0002593747,0.0001929568,0.00049938273,0.00013010782,0.000008793303],"category_scores_gemma":[0.00008894126,0.00018484057,0.00012682048,0.0003747359,0.00005350432,0.0027309393,0.000005178488,0.00021744514,0.00012662004],"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.0018383005,0.00090279576,0.00022435526,0.00020043482,0.00017720975,0.0000027511473,0.029649919,0.29855683,0.002999116,0.079044394,0.014359719,0.5720442],"study_design_scores_gemma":[0.002629822,0.0009621736,0.00019104072,0.00012639479,0.0000374405,0.000028091723,0.002614484,0.83183753,0.12409261,0.025762947,0.0110031925,0.0007142472],"about_ca_topic_score_codex":0.000028291013,"about_ca_topic_score_gemma":0.000016156297,"teacher_disagreement_score":0.9535258,"about_ca_system_score_codex":0.0003510374,"about_ca_system_score_gemma":0.000127114,"threshold_uncertainty_score":0.75375795},"labels":[],"label_agreement":null},{"id":"W2145282297","doi":"10.1109/tit.2003.809509","title":"On two high-rate algebraic space-time codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":30,"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 Alberta","funders":"","keywords":"Block code; Coding gain; Constellation; Algebraic number; Irrational number; Mathematics; Coding (social sciences); Upper and lower bounds; Discrete mathematics; Block size; Combinatorics; Algorithm; Computer science; Decoding methods; Statistics; Physics","score_opus":0.004756270344318835,"score_gpt":0.2111808571031491,"score_spread":0.20642458675883027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145282297","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.009149715,0.000016242602,0.9659833,0.00004115654,0.00029104747,0.00025306267,0.000041699426,0.0013983051,0.022825476],"genre_scores_gemma":[0.9941332,0.0001155368,0.004921777,0.00028954545,0.0000079439615,0.00013792033,0.000016236341,0.00003178076,0.00034610985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910194,0.00014017496,0.00033394463,0.00008180582,0.00014773218,0.00019442692],"domain_scores_gemma":[0.99891347,0.00034982752,0.00006736416,0.0005421033,0.00006108316,0.00006612645],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003656163,0.00019719006,0.0001576987,0.0003249455,0.00018025326,0.000048816448,0.00019155955,0.00008887258,0.00058405084],"category_scores_gemma":[0.00001946571,0.00020515114,0.000068476336,0.0002698921,0.000060396243,0.0009822383,6.9521093e-7,0.00033042522,0.0015096625],"study_design_candidate":"bench_or_experimental","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.000043795182,0.00004419337,2.1093824e-7,0.000028168164,0.000047893693,2.798305e-7,0.0004365634,0.66637695,0.0016608009,0.29494512,0.00045945024,0.03595657],"study_design_scores_gemma":[0.000941542,0.00012451342,0.0000161262,0.000092191956,0.000026181304,0.000008299443,0.00017463537,0.01944851,0.8596905,0.1107735,0.008156046,0.00054794503],"about_ca_topic_score_codex":0.0000028223628,"about_ca_topic_score_gemma":0.0000019860374,"teacher_disagreement_score":0.98498344,"about_ca_system_score_codex":0.00013736889,"about_ca_system_score_gemma":0.000017136355,"threshold_uncertainty_score":0.99926776},"labels":[],"label_agreement":null},{"id":"W2145630771","doi":"10.1109/tit.2007.904983","title":"Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":174,"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":"Low-density parity-check code; Bilayer; Relay; Code (set theory); Channel (broadcasting); Channel capacity; Decoding methods","score_opus":0.020269394365844212,"score_gpt":0.2708845776144249,"score_spread":0.2506151832485807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145630771","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.022959165,0.00003466116,0.9747583,0.00041628827,0.00042714644,0.00035706555,0.0000053812128,0.00012491982,0.00091704197],"genre_scores_gemma":[0.99038833,0.00021617154,0.008071115,0.0010953791,0.000016363425,0.000055373734,0.0000041007556,0.000005624775,0.00014755578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.00009904148,0.00042203316,0.00014154572,0.00014233179,0.00023183196],"domain_scores_gemma":[0.9987079,0.0005639244,0.00010039109,0.00039359092,0.00015130773,0.000082917904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019155954,0.00013118885,0.00014935527,0.0003444892,0.00034325285,0.00013110472,0.0003377509,0.00009435708,0.000019449923],"category_scores_gemma":[0.000031533662,0.00012688777,0.00006697465,0.0003936064,0.000056409663,0.0014460132,0.000007748404,0.000244881,0.000046229055],"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.0002962455,0.00017802758,0.00004684549,0.0000610344,0.000044525812,9.875237e-7,0.011911455,0.021115812,0.0003918012,0.24432208,0.00024369157,0.7213875],"study_design_scores_gemma":[0.005171908,0.00047370858,0.0032493514,0.00036565596,0.000043086347,0.000050457424,0.0018198119,0.77985454,0.15391217,0.032431863,0.021208907,0.0014185568],"about_ca_topic_score_codex":0.000004167631,"about_ca_topic_score_gemma":0.00007606457,"teacher_disagreement_score":0.96742916,"about_ca_system_score_codex":0.00008178765,"about_ca_system_score_gemma":0.00003993618,"threshold_uncertainty_score":0.51743335},"labels":[],"label_agreement":null},{"id":"W2146198330","doi":"10.1109/tit.2011.2146350","title":"Feedback Capacity of a Class of Symmetric Finite-State Markov Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":17,"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":"International Federation of Automatic Control","keywords":"Finite state; Markov process; Markov chain; Entropy (arrow of time); Mathematics; Channel capacity; Channel (broadcasting); Symmetry (geometry); Function (biology); Noise (video); Class (philosophy); Finite set; Topology (electrical circuits); Applied mathematics; Statistical physics; Discrete mathematics; Control theory (sociology); Computer science; Combinatorics; Mathematical analysis; Telecommunications; Physics; Statistics; Quantum mechanics","score_opus":0.021283171149604256,"score_gpt":0.2088022663887609,"score_spread":0.18751909523915664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146198330","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.069194354,0.000022361472,0.9116325,0.0000067302717,0.00022739453,0.0002398346,0.00012847582,0.00034966998,0.01819873],"genre_scores_gemma":[0.9963662,0.00017860316,0.0033230502,0.000031433152,0.0000030684857,0.00005079913,0.0000052711775,0.000014608394,0.000026936938],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990053,0.000073472365,0.0005666431,0.00005098811,0.00017420245,0.00012939217],"domain_scores_gemma":[0.99896,0.00022062844,0.00015840026,0.00045338125,0.00016268215,0.00004490991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040553775,0.00013059718,0.00019511959,0.0006900011,0.000043653134,0.00000943457,0.0002549446,0.00010018345,0.00018866306],"category_scores_gemma":[0.00001683928,0.00013957804,0.0001007744,0.00056594197,0.00010601536,0.00075803365,0.0000019264899,0.00023456517,0.000047175927],"study_design_candidate":"bench_or_experimental","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.0008263322,0.00095758884,0.00002703311,0.0025821305,0.000796242,0.0000011769092,0.09317775,0.26361594,0.0053748973,0.11060846,0.00064465584,0.5213878],"study_design_scores_gemma":[0.0005650053,0.00015866722,0.00018134284,0.00014678616,0.00003904533,0.000005556402,0.0006696176,0.052596636,0.9331472,0.011300278,0.0008682781,0.00032157183],"about_ca_topic_score_codex":0.00002749917,"about_ca_topic_score_gemma":0.0000035890228,"teacher_disagreement_score":0.92777234,"about_ca_system_score_codex":0.00004904006,"about_ca_system_score_gemma":0.0000150375445,"threshold_uncertainty_score":0.56918275},"labels":[],"label_agreement":null},{"id":"W2146798857","doi":"10.1109/tit.2007.909163","title":"Analytic Properties and Covariance Functions for a New Class of Generalized Gibbs Random Fields","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Soil Geostatistics and Mapping","field":"Environmental Science","cited_by":62,"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 Alberta","funders":"","keywords":"Covariance; Mathematics; Covariance function; Random field; Curvature; Applied mathematics; Mathematical analysis; Statistical physics; Statistics; Physics; Geometry","score_opus":0.01774177763700703,"score_gpt":0.22192969903968612,"score_spread":0.2041879214026791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146798857","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.016938936,0.000010979297,0.9798698,0.000106606494,0.0002094146,0.00028418546,0.00002688824,0.000023720828,0.0025294619],"genre_scores_gemma":[0.9938371,0.00001964495,0.004088075,0.00035606677,0.000013736127,0.000026256093,0.000004862016,0.000004257977,0.0016499892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999415,0.00001686613,0.00026790844,0.000069571324,0.00011129621,0.00011935435],"domain_scores_gemma":[0.9995738,0.00015758688,0.000085253196,0.00010613463,0.000019995561,0.0000571949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041543174,0.00007377416,0.00010068039,0.000072936054,0.00014749469,0.000020869702,0.000051220064,0.000049861763,0.00026918692],"category_scores_gemma":[0.00002275023,0.00006374628,0.000045600023,0.00012759879,0.00008344859,0.00034036709,0.0000012081115,0.00006299654,0.000030905703],"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.0042430386,0.00014913938,0.00008672974,0.00019271212,0.00019376008,5.5236694e-7,0.009643956,0.32033056,0.0042723026,0.020706238,0.005486001,0.634695],"study_design_scores_gemma":[0.04111665,0.0022408988,0.0078953095,0.00041632805,0.0010697355,0.00008527748,0.010929823,0.49282485,0.15189964,0.09458531,0.19450678,0.0024293864],"about_ca_topic_score_codex":0.0001299138,"about_ca_topic_score_gemma":0.000078741265,"teacher_disagreement_score":0.9768982,"about_ca_system_score_codex":0.000032984775,"about_ca_system_score_gemma":0.00001879111,"threshold_uncertainty_score":0.2947408},"labels":[],"label_agreement":null},{"id":"W2146818257","doi":"10.1109/tit.2008.2011518","title":"Capacity of a Class of Modulo-Sum Relay Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":103,"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":"Relay channel; Relay; Transmitter; Channel capacity; Modulo; Topology (electrical circuits); Channel (broadcasting); Mathematics; Noise (video); Computer science; Telecommunications; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.024531877540790243,"score_gpt":0.24454734895392333,"score_spread":0.22001547141313307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146818257","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.011083865,0.00001918008,0.9832116,0.0004418642,0.00026260177,0.00013557258,0.0000070603423,0.000073332994,0.004764931],"genre_scores_gemma":[0.99540055,0.00011209244,0.0039653205,0.00041553774,0.0000064630367,0.000008860019,0.0000013622689,0.000002014763,0.00008778995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.0001354494,0.00040845198,0.00007317272,0.00018404274,0.00010681025],"domain_scores_gemma":[0.9988993,0.00012272953,0.0001931686,0.00052580284,0.00021715298,0.000041843923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004860745,0.00009012502,0.0001406482,0.0002338164,0.00012249443,0.000027903528,0.00047047742,0.000055940764,0.00004121605],"category_scores_gemma":[0.000012249311,0.000085169995,0.000084697625,0.00044447815,0.000059832728,0.0012294883,0.0000026800055,0.0001652595,0.000026188944],"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.000057541805,0.00017172663,0.0000011049339,0.000022457327,0.000029477138,8.6264876e-8,0.00823986,0.075784355,0.0026488262,0.46372938,0.00013493514,0.44918025],"study_design_scores_gemma":[0.0015959295,0.00078226125,0.0005741188,0.00024051446,0.00002846735,0.000014630135,0.00039008024,0.5527851,0.41278395,0.025465837,0.004837916,0.0005012222],"about_ca_topic_score_codex":0.0000014782817,"about_ca_topic_score_gemma":0.0000012115518,"teacher_disagreement_score":0.9843167,"about_ca_system_score_codex":0.00003218036,"about_ca_system_score_gemma":0.000035883233,"threshold_uncertainty_score":0.34731317},"labels":[],"label_agreement":null},{"id":"W2149258547","doi":"10.1109/tit.2010.2046244","title":"A Kraft-Type Sufficient Condition for the Existence of $D$-Ary Fix-Free Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"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 Victoria","funders":"","keywords":"Code (set theory); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematics; Programming language","score_opus":0.012721158278693646,"score_gpt":0.261712197880996,"score_spread":0.24899103960230234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149258547","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.010874565,0.000006938168,0.9850923,0.00035480593,0.0016947818,0.0005117401,0.000044292272,0.0003499415,0.0010706275],"genre_scores_gemma":[0.9745457,0.000010236936,0.024789596,0.00039220904,0.000018358103,0.00013470929,0.000004232092,0.000006653755,0.00009830023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990235,0.000056290675,0.0003717709,0.00012308247,0.00026018292,0.00016519913],"domain_scores_gemma":[0.997515,0.0010073103,0.00022280682,0.00086567877,0.00034145912,0.00004769262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010179653,0.00012249843,0.00011680429,0.00020829316,0.0003168291,0.00008158264,0.0009599032,0.00008916791,0.000046418525],"category_scores_gemma":[0.00014104634,0.0000950136,0.00010551247,0.00036669424,0.00015414268,0.0011316716,0.0000066956677,0.000293392,0.000027305721],"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.00034861383,0.00037020416,0.000008714789,0.00019576965,0.00010259726,5.941391e-7,0.01637016,0.015656807,0.013225853,0.754779,0.0034994292,0.19544226],"study_design_scores_gemma":[0.001180016,0.0009826492,0.00027511196,0.00012677458,0.000079281155,0.00007009819,0.0014513988,0.271079,0.6496122,0.06623662,0.008338404,0.0005684609],"about_ca_topic_score_codex":0.000015830678,"about_ca_topic_score_gemma":0.00002314243,"teacher_disagreement_score":0.96367115,"about_ca_system_score_codex":0.000029893521,"about_ca_system_score_gemma":0.0001020932,"threshold_uncertainty_score":0.3874542},"labels":[],"label_agreement":null},{"id":"W2149567218","doi":"10.1109/tit.2009.2032831","title":"On Properties of Locally Optimal Multiple Description Scalar Quantizers With Convex Cells","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":21,"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":"Mathematics; Scalar (mathematics); Regular polygon; Uniqueness; Probability density function; Applied mathematics; Convex function; Convex optimization; Mathematical optimization; Discrete mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.01224115883879454,"score_gpt":0.21044769094134413,"score_spread":0.1982065321025496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149567218","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.013454156,0.000007457281,0.9851641,0.0000838246,0.00015596113,0.00036769843,0.000018220531,0.00040091388,0.000347648],"genre_scores_gemma":[0.9442043,0.000015740756,0.055158354,0.00053229625,0.0000040748396,0.000031900938,0.000003367639,0.0000059761182,0.000044019605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988049,0.00008790298,0.0003932401,0.0001632569,0.0003710816,0.00017957464],"domain_scores_gemma":[0.9989322,0.00008827623,0.00020468532,0.00053101056,0.00017669273,0.00006717068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027459912,0.00017243554,0.00017260884,0.0003183438,0.00015882376,0.00008384482,0.0004629285,0.00007701287,0.000017484987],"category_scores_gemma":[0.000010888701,0.00013128377,0.000059748912,0.00028154431,0.00010547672,0.0033584337,0.000002725159,0.00021087895,0.000060955615],"study_design_candidate":"bench_or_experimental","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.0022264975,0.00060757453,0.0000015093441,0.000099176905,0.00005093709,0.0000024418298,0.0035993722,0.49562484,0.093172565,0.07363386,0.00048653912,0.3304947],"study_design_scores_gemma":[0.0006296532,0.0007941424,0.000016431992,0.0001998719,0.000007714841,0.0000067377528,0.00016678513,0.08055799,0.9151199,0.0020760733,0.0002290197,0.0001956806],"about_ca_topic_score_codex":0.0000040659515,"about_ca_topic_score_gemma":6.331889e-7,"teacher_disagreement_score":0.93075013,"about_ca_system_score_codex":0.0000544628,"about_ca_system_score_gemma":0.00005382674,"threshold_uncertainty_score":0.5353597},"labels":[],"label_agreement":null},{"id":"W2149940508","doi":"10.1109/tit.2007.909168","title":"Information conversion, effective samples, and parameter size","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":19,"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":"National Cancer Institute","keywords":"Principle of maximum entropy; Kullback–Leibler divergence; Sample size determination; Mathematics; Entropy (arrow of time); Bayesian probability; Independence (probability theory); Posterior probability; Sample (material); Statistics; Computer science","score_opus":0.007705106554193773,"score_gpt":0.2319841043563846,"score_spread":0.22427899780219085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149940508","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.0025763358,0.000009404203,0.99323136,0.00011764386,0.00055387797,0.00037390247,0.0000133459225,0.00016816464,0.0029559399],"genre_scores_gemma":[0.84201324,0.000021270012,0.15513387,0.002716499,0.000014991862,0.000031344734,0.0000034844825,0.000004258766,0.00006103527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990041,0.000118428805,0.00035769682,0.0000919987,0.00021504183,0.00021268666],"domain_scores_gemma":[0.9980909,0.0012447701,0.00013376237,0.0002908579,0.00012518882,0.000114523325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014915182,0.00014584577,0.0001314475,0.0002618424,0.00023629506,0.00017112552,0.00020289602,0.000116196825,0.000036533784],"category_scores_gemma":[0.000055494085,0.00012879279,0.00006448241,0.00027700042,0.00006586296,0.0049463846,0.0000035861376,0.00021481549,0.00012319852],"study_design_candidate":"design_other","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.00009774047,0.00001813979,0.0000025661182,0.00003185202,0.000022996364,4.3848732e-7,0.0044604237,0.00012149966,0.00004000278,0.08583068,0.00013529371,0.90923834],"study_design_scores_gemma":[0.009564523,0.0017913567,0.007582599,0.0002818144,0.00020514676,0.0005068175,0.003135444,0.07440827,0.23914981,0.5720378,0.088539146,0.0027972267],"about_ca_topic_score_codex":0.000010006035,"about_ca_topic_score_gemma":0.0000010594737,"teacher_disagreement_score":0.90644115,"about_ca_system_score_codex":0.000058169444,"about_ca_system_score_gemma":0.000028784072,"threshold_uncertainty_score":0.52520174},"labels":[],"label_agreement":null},{"id":"W2152374199","doi":"10.1109/tit.2010.2043876","title":"Theoretical and Empirical Results for Recovery From Multiple Measurements","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":270,"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":"Compressed sensing; Minification; Computer science; Algorithm; Extension (predicate logic); Mathematics","score_opus":0.021461781453337735,"score_gpt":0.24830981903981864,"score_spread":0.2268480375864809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152374199","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.09174324,0.000005180047,0.9028624,0.000062262865,0.0007283214,0.0002261317,0.00018039627,0.00044882233,0.0037432043],"genre_scores_gemma":[0.99268496,0.000012960682,0.0069448007,0.00023961505,0.00003590706,0.000042363088,0.000019314213,0.000011383001,0.000008682175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994468,0.000021561882,0.00022986448,0.00007635549,0.000108300694,0.00011712588],"domain_scores_gemma":[0.9993111,0.00036372963,0.000027583988,0.00018588775,0.000058981495,0.000052735308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000230381,0.00010634547,0.00009351,0.00009688955,0.00009733036,0.00005159088,0.00006800442,0.00011672499,0.000044960067],"category_scores_gemma":[0.000043052598,0.0000989972,0.000050919753,0.000048071855,0.000071206734,0.00036807006,6.788179e-7,0.00020868951,0.000024319585],"study_design_candidate":"design_other","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.0042484617,0.00021405825,0.00003292349,0.000071735,0.000500565,0.0000011756799,0.0046442416,0.06610089,0.059694257,0.021345802,0.013842364,0.8293035],"study_design_scores_gemma":[0.0022557098,0.00017718745,0.00028230282,0.0000654011,0.00007527069,0.00000804235,0.0001534109,0.21637668,0.6772507,0.09331235,0.00958684,0.00045609384],"about_ca_topic_score_codex":0.0000030868648,"about_ca_topic_score_gemma":0.0000067998176,"teacher_disagreement_score":0.9009417,"about_ca_system_score_codex":0.000016716664,"about_ca_system_score_gemma":0.000009082821,"threshold_uncertainty_score":0.4036989},"labels":[],"label_agreement":null},{"id":"W2152678257","doi":"10.1109/tit.2014.2321155","title":"Information Transmission Using the Nonlinear Fourier Transform, Part III: Spectrum Modulation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Network Technologies","field":"Engineering","cited_by":156,"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":"Multiplexing; Nonlinear system; Fourier transform; Modulation (music); Nonlinear distortion; Transmission (telecommunications); SIGNAL (programming language); Delta modulation; Wavelength-division multiplexing; Signal processing","score_opus":0.007045735550853316,"score_gpt":0.20007439072444058,"score_spread":0.19302865517358728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152678257","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.01754318,0.000008993818,0.9757077,0.000345992,0.00067116733,0.00043270577,0.000023688051,0.0009593004,0.0043072426],"genre_scores_gemma":[0.989981,0.00009162124,0.009456843,0.00026011988,0.00007494527,0.000050539587,0.00003011949,0.000022077433,0.000032751155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865437,0.00005395267,0.0005951068,0.00006863409,0.00032174378,0.0003062268],"domain_scores_gemma":[0.9992894,0.00015825461,0.00007436826,0.00035345348,0.000055994682,0.00006851243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053300825,0.00023177627,0.00016897278,0.00028046788,0.0003546584,0.0001272695,0.00021487981,0.00021895602,0.00015106743],"category_scores_gemma":[0.000009461178,0.00017991813,0.00012503426,0.00040603196,0.00009963417,0.002922087,9.931342e-7,0.00044645308,0.00016544161],"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.000045652374,0.0000095495125,2.795492e-7,0.00003201086,0.000022798858,3.101072e-8,0.0007097057,0.6412528,0.00003658805,0.0043154615,0.00007371369,0.3535014],"study_design_scores_gemma":[0.0005066383,0.0000590507,0.000010423727,0.000045252553,0.000038017304,0.000007335758,0.00042137667,0.95325583,0.009537636,0.0052026436,0.030688105,0.00022767138],"about_ca_topic_score_codex":0.0000045274182,"about_ca_topic_score_gemma":0.00000224987,"teacher_disagreement_score":0.9724378,"about_ca_system_score_codex":0.00011091563,"about_ca_system_score_gemma":0.000017636155,"threshold_uncertainty_score":0.73368484},"labels":[],"label_agreement":null},{"id":"W2153598200","doi":"10.1109/tit.2010.2054532","title":"Trading classical communication, quantum communication, and entanglement in quantum Shannon theory","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum entanglement; Converse; Quantum capacity; Superdense coding; Quantum channel; Amplitude damping channel; Quantum; Qubit; Quantum teleportation; Classical capacity","score_opus":0.00915777248199206,"score_gpt":0.24361061087349356,"score_spread":0.2344528383915015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153598200","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.19901992,0.000028251292,0.7939687,0.0012992036,0.00023057216,0.00057341735,0.00013287099,0.000093562856,0.0046535],"genre_scores_gemma":[0.9987718,0.000034106644,0.00044403496,0.00022445459,0.00002192166,0.0003238627,0.00008921596,0.000017137974,0.00007347846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863666,0.00020919113,0.00058647833,0.00015626909,0.00017991687,0.0002315099],"domain_scores_gemma":[0.99844927,0.0004325647,0.00019765439,0.0007200033,0.00009469688,0.000105796615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116691,0.00019649693,0.0001835364,0.00024976578,0.000527629,0.0001344697,0.00036605043,0.00009089901,0.0009019982],"category_scores_gemma":[0.0000066689204,0.00019617654,0.000080700884,0.00027844057,0.00015572766,0.00082271616,0.00000749286,0.00070146384,0.000085007065],"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.000041618274,0.00019119802,0.00003903051,0.000008286903,0.000026573824,4.1653777e-8,0.0018552776,0.00009902011,0.0004181442,0.97475547,0.00015614215,0.022409191],"study_design_scores_gemma":[0.0010505291,0.000053416672,0.0003324082,0.00005165219,0.00004086773,0.0000035158428,0.0051093767,0.053850677,0.0040726294,0.92506444,0.010028921,0.00034159218],"about_ca_topic_score_codex":0.00004820015,"about_ca_topic_score_gemma":0.00003575653,"teacher_disagreement_score":0.7997519,"about_ca_system_score_codex":0.000037090507,"about_ca_system_score_gemma":0.000055429413,"threshold_uncertainty_score":0.98762476},"labels":[],"label_agreement":null},{"id":"W2154006376","doi":"10.1109/tit.2006.871062","title":"A new binary sequence family with low correlation and large size","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":53,"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":"Combinatorics; Binary number; Integer (computer science); Physics; Correlation; Sequence (biology); Mathematics; Arithmetic; Geometry; Chemistry","score_opus":0.005060276466135727,"score_gpt":0.19318052446566364,"score_spread":0.18812024799952792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154006376","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.021745544,0.000017229357,0.97416407,0.000099254525,0.00022717216,0.00015543579,0.000012042587,0.00026458516,0.0033146534],"genre_scores_gemma":[0.98853725,0.000009923818,0.010619249,0.0005268401,0.000016450676,0.000017350678,0.0000034637567,0.0000051358174,0.0002643345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992139,0.00007098507,0.00021384496,0.00013343427,0.00019376165,0.00017412248],"domain_scores_gemma":[0.9992929,0.0002237431,0.000093122115,0.00026941736,0.000055501605,0.00006529375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285462,0.0001311705,0.00009072268,0.00020567443,0.00029491194,0.0001563644,0.00019641612,0.00006224746,0.000041307456],"category_scores_gemma":[0.0000033050524,0.00011438195,0.000046213947,0.0004810025,0.000050453535,0.0024275552,0.0000022345478,0.00015963364,0.000071527655],"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.0003401946,0.00010348836,0.000036179128,0.000036057223,0.000030506544,0.000003439725,0.0022706632,0.023041125,0.0005776836,0.7848322,0.00040760828,0.18832088],"study_design_scores_gemma":[0.010836024,0.0026161603,0.012239666,0.00064600527,0.00017993725,0.00034252094,0.0021819046,0.29889053,0.017624846,0.62882257,0.023007013,0.0026128117],"about_ca_topic_score_codex":0.000017268432,"about_ca_topic_score_gemma":0.0000049926975,"teacher_disagreement_score":0.9667917,"about_ca_system_score_codex":0.000025769203,"about_ca_system_score_gemma":0.00006326614,"threshold_uncertainty_score":0.46643606},"labels":[],"label_agreement":null},{"id":"W2154495006","doi":"10.1109/tit.2003.819340","title":"Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"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":"Mathematics; Entropy (arrow of time); Gaussian; Maximum entropy probability distribution; Principle of maximum entropy; Rate–distortion theory; Finite set; Differential entropy; Probability distribution; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Data compression; Statistics","score_opus":0.016081819938457403,"score_gpt":0.28269953385516056,"score_spread":0.26661771391670314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154495006","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.0010768397,0.0000051517964,0.9921285,0.00003912044,0.00032069592,0.00030402493,0.00011552999,0.0003574274,0.0056526964],"genre_scores_gemma":[0.7726944,0.000047771584,0.22655368,0.0003633431,0.000005870514,0.00007902763,0.00000826345,0.0000109181465,0.00023671555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982829,0.000203737,0.0006780643,0.00019733132,0.00037307854,0.00026486415],"domain_scores_gemma":[0.9979358,0.00066750834,0.00033723967,0.00076224876,0.00019141349,0.00010579551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055170595,0.00021875545,0.00023986763,0.00034493764,0.00018129025,0.0001140091,0.00057431794,0.00012010792,0.0007302244],"category_scores_gemma":[0.000097164564,0.00018522152,0.00012358009,0.00047023944,0.00016181673,0.0031780517,0.000006305206,0.00029284478,0.00018373373],"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.00047002075,0.00027792974,0.000017820266,0.00008711103,0.00009979617,0.0000058319915,0.004198464,0.05616218,0.00063311256,0.7821126,0.00048558693,0.15544954],"study_design_scores_gemma":[0.006075819,0.00083904236,0.00004069292,0.00062533596,0.00009917056,0.00035065445,0.0036867778,0.13903892,0.6942376,0.09574818,0.0573554,0.0019024329],"about_ca_topic_score_codex":0.0000033068377,"about_ca_topic_score_gemma":6.8392563e-7,"teacher_disagreement_score":0.7716176,"about_ca_system_score_codex":0.00004966132,"about_ca_system_score_gemma":0.00014200201,"threshold_uncertainty_score":0.7995445},"labels":[],"label_agreement":null},{"id":"W2156237015","doi":"10.1109/tit.2011.2111110","title":"Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multiplicative function; Mathematics","score_opus":0.012477722220665894,"score_gpt":0.19537316860760717,"score_spread":0.18289544638694127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156237015","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.11823022,0.0000035006076,0.8797219,0.000023343802,0.00014696739,0.00018741343,0.00006338656,0.00018131016,0.0014419779],"genre_scores_gemma":[0.9920844,0.00003230646,0.007403626,0.00036680145,0.000006104654,0.000076089724,0.000012665191,0.0000047360218,0.0000132747955],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999284,0.00010047408,0.00018892363,0.00016191187,0.00013524585,0.00012940397],"domain_scores_gemma":[0.99916255,0.00025940908,0.00013967967,0.0002758463,0.00009630061,0.00006618627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001696329,0.00014053461,0.00010175427,0.0002147921,0.00025161818,0.000070316404,0.00022023078,0.00005868868,0.000054659577],"category_scores_gemma":[0.0000056559825,0.0001201064,0.000041189865,0.000267721,0.00018047058,0.0027558447,0.0000026455652,0.0001670595,0.00008222314],"study_design_candidate":"design_other","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.0009811755,0.00014880125,0.00007929988,0.000019154208,0.00018073252,0.0000024962985,0.10972757,0.0008943993,0.0013360538,0.16424184,0.0000095717205,0.7223789],"study_design_scores_gemma":[0.0070115966,0.0024670216,0.076271646,0.0008142021,0.00027099365,0.000094235016,0.029864443,0.1299392,0.5375878,0.2120268,0.00073190074,0.0029201538],"about_ca_topic_score_codex":0.000024303163,"about_ca_topic_score_gemma":0.0000054391667,"teacher_disagreement_score":0.87385416,"about_ca_system_score_codex":0.000025105797,"about_ca_system_score_gemma":0.000027373055,"threshold_uncertainty_score":0.48977968},"labels":[],"label_agreement":null},{"id":"W2156244284","doi":"10.1109/tit.2004.840891","title":"On Simple Oversampled A/D Conversion in Shift-Invariant Spaces","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":28,"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 Alberta","funders":"","keywords":"Quantization (signal processing); Mathematics; Invariant (physics); Logarithm; Computational complexity theory; Algorithm; Mathematical analysis","score_opus":0.02554465644098247,"score_gpt":0.3007204093504523,"score_spread":0.27517575290946983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156244284","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.030146962,0.0000032901405,0.9532381,0.00043141993,0.00010465337,0.0003282447,0.0000388674,0.00011623346,0.015592187],"genre_scores_gemma":[0.98932344,0.000013502074,0.009681107,0.00068493,0.000022315031,0.000046101643,0.000008433769,0.00001447503,0.0002056714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835616,0.00020066727,0.00065538095,0.00014360176,0.00038078043,0.00026342145],"domain_scores_gemma":[0.99773824,0.001640895,0.00014773656,0.00032693267,0.00004549842,0.00010070295],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013794632,0.00021373533,0.000314755,0.0004494348,0.00015813598,0.0000715979,0.00015788777,0.00013271222,0.0030186009],"category_scores_gemma":[0.0000863292,0.00017242714,0.00019994474,0.00034823435,0.000053041793,0.00084880186,0.000001156415,0.00031244324,0.00054223556],"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.00036151524,0.00042454878,0.0000021390574,0.00015652321,0.00008133541,0.0000011225907,0.003249676,0.006987455,0.00003121809,0.96258456,0.0002470196,0.025872901],"study_design_scores_gemma":[0.0020811951,0.00019316847,0.000029026842,0.000116089184,0.0001158567,0.0000043115238,0.0010418573,0.027682522,0.01615643,0.9473932,0.004797904,0.00038843378],"about_ca_topic_score_codex":0.00002034344,"about_ca_topic_score_gemma":0.00004660136,"teacher_disagreement_score":0.9591765,"about_ca_system_score_codex":0.00012300385,"about_ca_system_score_gemma":0.000032458425,"threshold_uncertainty_score":0.9978928},"labels":[],"label_agreement":null},{"id":"W2157927886","doi":"10.1109/tit.2014.2334657","title":"On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":69,"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; Coding (social sciences); Computer science; Node (physics); Variable (mathematics); Set (abstract data type); Characterization (materials science); Tanner graph; Graph; Class (philosophy); Simple (philosophy); Code (set theory); Discrete mathematics; Combinatorics; Decoding methods; Mathematics; Theoretical computer science; Algorithm; Error floor; Statistics","score_opus":0.006652840438808025,"score_gpt":0.21760076857416752,"score_spread":0.2109479281353595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157927886","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.05388786,8.2020495e-7,0.94368225,0.000053736247,0.00036483444,0.00021957039,0.000025991467,0.00023180085,0.0015331248],"genre_scores_gemma":[0.9840318,0.0000056971,0.015514514,0.00036455414,0.0000070559936,0.000029249113,0.000015641928,0.0000070500487,0.000024451365],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875695,0.00017268497,0.00052702246,0.00011807172,0.00029111546,0.00013413587],"domain_scores_gemma":[0.99874413,0.00025990568,0.000359724,0.00044870772,0.00015212999,0.000035429603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009543938,0.00012875843,0.00017798849,0.0004239775,0.00010423687,0.000028299415,0.00037532588,0.000074585856,0.00004501166],"category_scores_gemma":[0.000020760675,0.00012960701,0.000071197486,0.00039355797,0.00004804303,0.0013193949,0.0000029119424,0.00014259212,0.00001382234],"study_design_candidate":"bench_or_experimental","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.00021768727,0.00033328548,0.000014290423,0.00031647072,0.00010796654,1.77807e-7,0.0069877324,0.019696485,0.10653479,0.4121604,0.000085721396,0.453545],"study_design_scores_gemma":[0.00045001457,0.00046280312,0.00023421005,0.0002498607,0.000022885582,0.000005125704,0.00011692753,0.09054017,0.8864021,0.021001639,0.00029587402,0.00021840517],"about_ca_topic_score_codex":0.000010673861,"about_ca_topic_score_gemma":8.7125414e-7,"teacher_disagreement_score":0.93014395,"about_ca_system_score_codex":0.000043459666,"about_ca_system_score_gemma":0.000037667785,"threshold_uncertainty_score":0.5285221},"labels":[],"label_agreement":null},{"id":"W2158247330","doi":"10.1109/tit.2008.2008149","title":"A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":36,"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 Alberta","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Demodulation; Turbo code; Decoding methods; Algorithm; Electronic engineering; Code division multiple access; Redundancy (engineering); Channel (broadcasting); Telecommunications; Engineering","score_opus":0.016638460407197894,"score_gpt":0.2937934868894657,"score_spread":0.2771550264822678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158247330","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.0013080544,0.000030430576,0.9941328,0.00007899837,0.00047353093,0.0007454134,0.000066128945,0.0014118794,0.0017527188],"genre_scores_gemma":[0.77725804,0.000066349065,0.222008,0.00022068333,0.000043115255,0.00024117711,0.000021727732,0.000024280671,0.00011663549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988692,0.00009813989,0.0005382137,0.00010231808,0.00015351373,0.00023865628],"domain_scores_gemma":[0.99876344,0.00048655432,0.00012103524,0.00041607063,0.00014665209,0.000066271765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843438,0.0002114636,0.00022944408,0.00042400096,0.00033462935,0.00008446148,0.00023237553,0.000107464584,0.00005448296],"category_scores_gemma":[0.000035553145,0.00022947435,0.00014849998,0.00026214795,0.00002583222,0.0017043755,9.5187573e-7,0.00028576533,0.000032219636],"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.00006922668,0.000016230633,1.2937826e-7,0.000044906315,0.00002427331,4.350454e-8,0.0009165196,0.78413314,0.0023666953,0.019899854,0.000038061575,0.1924909],"study_design_scores_gemma":[0.0017107031,0.00007034594,0.000005497264,0.000073697665,0.00003082799,0.000005761464,0.000299988,0.8354825,0.14313692,0.014859088,0.003951834,0.00037287924],"about_ca_topic_score_codex":0.000002563218,"about_ca_topic_score_gemma":0.0000014732142,"teacher_disagreement_score":0.77594995,"about_ca_system_score_codex":0.0001539641,"about_ca_system_score_gemma":0.000012775754,"threshold_uncertainty_score":0.93576926},"labels":[],"label_agreement":null},{"id":"W2158492447","doi":"10.1109/tit.2007.909095","title":"Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":76,"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":"Precoding; MIMO; Lattice reduction; Reduction (mathematics); Constellation; Lattice (music); Topology (electrical circuits); Word error rate; Communications system","score_opus":0.012903267006971775,"score_gpt":0.24248664435860254,"score_spread":0.22958337735163076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158492447","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.017482707,0.000063312415,0.97694886,0.000011685921,0.0013691442,0.00035764973,0.000021053303,0.00055316405,0.0031923992],"genre_scores_gemma":[0.9899821,0.000086649095,0.009587432,0.000051291034,0.00006462052,0.000029005769,0.000029306602,0.00003586015,0.00013370131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.00005773777,0.00055502396,0.00009358182,0.0001810523,0.00024309964],"domain_scores_gemma":[0.99916893,0.000101768936,0.00013179408,0.00039352733,0.00012739204,0.00007658892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062781305,0.00018923962,0.00014489605,0.0004768607,0.0002772511,0.000068221,0.00013175388,0.00015845892,0.00013372552],"category_scores_gemma":[0.000008035666,0.00021656946,0.00007601566,0.00044579865,0.00005263129,0.0024269917,0.0000010991558,0.00026161052,0.00013912862],"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.000057721216,0.000022465196,7.093787e-7,0.00005074241,0.000035422785,1.5403903e-7,0.0018783516,0.9522119,0.0012892758,0.0008766704,0.0000473783,0.043529216],"study_design_scores_gemma":[0.0018760099,0.00009100325,0.000049135237,0.0003468533,0.00014263105,0.00011867682,0.0048964564,0.75810486,0.22707534,0.002167716,0.0041429442,0.0009883533],"about_ca_topic_score_codex":0.000015872318,"about_ca_topic_score_gemma":0.0000036676602,"teacher_disagreement_score":0.97249943,"about_ca_system_score_codex":0.000351855,"about_ca_system_score_gemma":0.000016373742,"threshold_uncertainty_score":0.8831446},"labels":[],"label_agreement":null},{"id":"W2158736939","doi":"10.1109/tit.2005.850075","title":"LMS Algorithms for Tracking Slow Markov Chains With Applications to Hidden Markov Estimation and Adaptive Multiuser Detection","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":20,"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":"Markov chain; Hidden Markov model; Algorithm; Mathematics; Ordinary differential equation; Markov process; Markov model; Sequence (biology); Tracking (education); Convergence (economics); Least mean squares filter; Computer science; Differential equation; Adaptive filter; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.020038522571419488,"score_gpt":0.274585423800872,"score_spread":0.2545469012294525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158736939","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.001114364,0.00001789531,0.99543107,0.00091102044,0.00008787633,0.0016757894,0.00003235312,0.00029755314,0.00043208638],"genre_scores_gemma":[0.68386424,0.000026100202,0.31385192,0.00032960318,0.00003750979,0.00167816,0.000009993954,0.000014930587,0.0001875161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985126,0.00013871674,0.00041085854,0.0002633983,0.00036738295,0.00030702865],"domain_scores_gemma":[0.99806565,0.0005446812,0.00016097305,0.00068351993,0.00037634416,0.00016882419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079376245,0.00020372187,0.00016015867,0.00053605065,0.00069583283,0.00031182254,0.00053974555,0.000111594956,0.000012776984],"category_scores_gemma":[0.000016029997,0.00019365092,0.000059618236,0.00070103037,0.00007905077,0.0030548999,0.000010391837,0.0002914376,0.00007413105],"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.000157854,0.000058585305,7.844528e-7,0.000018185092,0.000029204131,5.7878317e-8,0.0016092105,0.06848027,0.00008188587,0.005245071,0.000026937563,0.92429197],"study_design_scores_gemma":[0.00083368324,0.00019111432,0.00021712099,0.000044835673,0.000016058291,0.000015785232,0.000344932,0.98824036,0.00751853,0.0005906788,0.0017237662,0.0002631059],"about_ca_topic_score_codex":0.00001061582,"about_ca_topic_score_gemma":0.00004512943,"teacher_disagreement_score":0.9240289,"about_ca_system_score_codex":0.0002121893,"about_ca_system_score_gemma":0.000070139766,"threshold_uncertainty_score":0.78968555},"labels":[],"label_agreement":null},{"id":"W2159581371","doi":"10.1109/tit.2003.811928","title":"Optical intensity-modulated direct detection channels: signal space and lattice codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":114,"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":"Bandwidth (computing); Coding (social sciences); Constellation diagram; Coding gain; Lattice (music); Intensity modulation; Optical communication; Constellation; Optical wireless; Channel capacity; Computer science; Channel (broadcasting); Mathematics; Topology (electrical circuits); Electronic engineering; Wireless; Algorithm; Telecommunications; Optics; Decoding methods; Physics; Bit error rate; Phase modulation; Acoustics; Engineering","score_opus":0.008450431315789961,"score_gpt":0.20001165199693458,"score_spread":0.19156122068114462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159581371","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.05359939,0.000059398062,0.9345279,0.000071855415,0.0003187127,0.00017731953,0.000008092049,0.0011334996,0.010103851],"genre_scores_gemma":[0.99786794,0.00017795924,0.0017834409,0.00005803767,0.0000051957836,0.000045760073,0.0000025751103,0.000015711657,0.000043388645],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992718,0.00006212447,0.00026822917,0.00008662975,0.00012912221,0.0001820624],"domain_scores_gemma":[0.9992432,0.00028510595,0.000035325716,0.0002781849,0.00009345188,0.00006471666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032510265,0.00015784758,0.0001604697,0.00025740854,0.00018250721,0.000081376005,0.000108196306,0.000171136,0.000057450332],"category_scores_gemma":[0.000052135852,0.00015918596,0.000044584263,0.00028662456,0.00013747977,0.00071313453,0.0000017540716,0.0003827233,0.00012836812],"study_design_candidate":"bench_or_experimental","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.0002593944,0.00016080821,0.000005830459,0.00021272672,0.0003305846,0.0000018233931,0.0021274397,0.42148924,0.011253996,0.13415127,0.00006996411,0.42993695],"study_design_scores_gemma":[0.00046306915,0.00011516793,0.00005727955,0.00004857678,0.00003753205,0.000032455995,0.0012435045,0.17144713,0.81703585,0.0075645437,0.0016138897,0.0003410149],"about_ca_topic_score_codex":0.0000020045522,"about_ca_topic_score_gemma":0.000002111602,"teacher_disagreement_score":0.9442685,"about_ca_system_score_codex":0.00007800837,"about_ca_system_score_gemma":0.000008187265,"threshold_uncertainty_score":0.6491415},"labels":[],"label_agreement":null},{"id":"W2159931694","doi":"10.1109/tit.2010.2059570","title":"Finite-SNR Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":26,"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 Ottawa","funders":"","keywords":"Fading; Rayleigh fading; Outage probability; MIMO; Multiplexing; Diversity gain; Channel (broadcasting); Monte Carlo method; Range (aeronautics); Asymptotic analysis","score_opus":0.006208467953776733,"score_gpt":0.20304277104291074,"score_spread":0.19683430308913402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159931694","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.009491039,0.000013694954,0.98659414,0.0000039756264,0.0013128376,0.00028073057,0.00026998037,0.00033981525,0.0016937823],"genre_scores_gemma":[0.9986101,0.000012343489,0.0011559805,0.000020926285,0.000019810808,0.000029991123,0.00006664306,0.000017658382,0.00006655607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887174,0.00005064362,0.00055215147,0.00009677299,0.00021580057,0.0002128991],"domain_scores_gemma":[0.9990988,0.00022233627,0.00015397824,0.0003281095,0.0001212556,0.00007555604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359001,0.00017752819,0.00028999068,0.00097539177,0.00024244,0.00003422834,0.00016996058,0.00016326072,0.00017987353],"category_scores_gemma":[0.000017770215,0.00019096244,0.0001762296,0.0009014694,0.000037544098,0.0012629963,0.0000022485594,0.00030486417,0.00006951248],"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.000022223947,0.000029326267,0.000024810453,0.00010418448,0.0003183234,2.0852694e-7,0.002233595,0.9929295,0.00087249157,0.0016200192,0.000009979206,0.0018352926],"study_design_scores_gemma":[0.0004673641,0.000021822618,0.00010280614,0.000026325495,0.00033363863,0.000002207129,0.0007123689,0.9932773,0.0044977735,0.00006391001,0.00029142006,0.00020302362],"about_ca_topic_score_codex":0.000017972261,"about_ca_topic_score_gemma":0.000033748223,"teacher_disagreement_score":0.98911905,"about_ca_system_score_codex":0.00007218074,"about_ca_system_score_gemma":0.000011196364,"threshold_uncertainty_score":0.7787222},"labels":[],"label_agreement":null},{"id":"W2160348245","doi":"10.1109/tit.2008.2011516","title":"A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"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; University of Calgary","funders":"","keywords":"Linear network coding; Multicast; Computer science; Coding (social sciences); Computer network; Upper and lower bounds; Bounded function; Throughput; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.017006967950831335,"score_gpt":0.2562433237211498,"score_spread":0.23923635577031843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160348245","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.0032039625,0.000043807042,0.9893751,0.00031942155,0.0003991972,0.00034623494,0.0000036662975,0.00012402958,0.0061845765],"genre_scores_gemma":[0.9959317,0.00034533552,0.0021365893,0.0014982745,0.000018248213,0.000025206647,0.0000039152087,0.0000041924573,0.000036538582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.00016116675,0.00057437527,0.00014136407,0.00020543876,0.0002544139],"domain_scores_gemma":[0.9987446,0.00035655772,0.00019292417,0.0005236183,0.00012438228,0.00005793445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157405,0.00015702384,0.00019498888,0.00023056047,0.00025441186,0.00010522118,0.00042633884,0.0000734706,0.000042480235],"category_scores_gemma":[0.000013642108,0.00014960115,0.00007221462,0.0007738812,0.000065277934,0.0008745457,0.0000050872986,0.0003198923,0.000022278324],"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.00012053325,0.0001596555,0.0000029173352,0.000006260165,0.000020825284,6.2592795e-7,0.0016902538,0.29572472,0.00021827914,0.23133272,0.00011150399,0.47061172],"study_design_scores_gemma":[0.0020892178,0.0007990248,0.0006563803,0.0004164503,0.000015395657,0.000006213216,0.0002975421,0.9788372,0.007867838,0.0074587385,0.0011098073,0.0004462147],"about_ca_topic_score_codex":0.0000027783624,"about_ca_topic_score_gemma":0.000016099128,"teacher_disagreement_score":0.99272776,"about_ca_system_score_codex":0.00013464603,"about_ca_system_score_gemma":0.00005667395,"threshold_uncertainty_score":0.6100558},"labels":[],"label_agreement":null},{"id":"W2160860009","doi":"10.1109/tit.2007.911265","title":"New Nonbinary Self-Dual Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"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 Victoria","funders":"","keywords":"Dual (grammatical number); Circulant matrix; Code (set theory); Construct (python library); Computer science; Minimum distance; Mathematics; Discrete mathematics; Combinatorics; Programming language","score_opus":0.010026629562084466,"score_gpt":0.20623723997782367,"score_spread":0.1962106104157392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160860009","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.005147147,0.000012544653,0.98265016,0.00014576704,0.00069317897,0.00012653065,0.000007141807,0.00073104,0.0104864985],"genre_scores_gemma":[0.974264,0.000045563476,0.024320435,0.00090512424,0.00003775655,0.000021504862,0.000002450366,0.000006383122,0.00039676504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990451,0.00010444735,0.00027121502,0.00012859666,0.00025055878,0.00020010855],"domain_scores_gemma":[0.9991221,0.00018576357,0.00008198005,0.0004274187,0.00006034354,0.00012241084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034124238,0.00014437051,0.00011329463,0.00034974286,0.0004994913,0.00008307803,0.00039713352,0.00007273298,0.00018500653],"category_scores_gemma":[0.0000035057801,0.00013874898,0.00013413177,0.0005250441,0.000054287342,0.0025070154,0.0000030462463,0.00020412852,0.0006805898],"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.000197954,0.00021277703,0.00000884888,0.000026269765,0.00011568401,0.000010579306,0.017122393,0.0060202735,0.00010502116,0.6934079,0.0040335697,0.2787387],"study_design_scores_gemma":[0.008961077,0.0036700107,0.0025364687,0.00026282686,0.0002246744,0.0027420684,0.0024405501,0.06787021,0.14111453,0.61025435,0.15582769,0.0040955427],"about_ca_topic_score_codex":0.0000048614584,"about_ca_topic_score_gemma":7.227215e-7,"teacher_disagreement_score":0.96911687,"about_ca_system_score_codex":0.000033008324,"about_ca_system_score_gemma":0.000110446024,"threshold_uncertainty_score":0.8747832},"labels":[],"label_agreement":null},{"id":"W2160902920","doi":"10.1109/tit.2004.830781","title":"Performance Analysis of Grammar-Based Codes Revisited","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","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":"University of Waterloo","funders":"","keywords":"Data compression; Mathematics; Combinatorics; Algorithm; Arithmetic coding; Context (archaeology); Markov chain; Discrete mathematics; Context-adaptive binary arithmetic coding","score_opus":0.008600087559121712,"score_gpt":0.22529205400680585,"score_spread":0.21669196644768415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160902920","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.013380456,0.000006814454,0.9854558,0.00004991127,0.00014180456,0.000106033054,0.00006248369,0.00011981921,0.00067684526],"genre_scores_gemma":[0.9801653,0.000017701004,0.019452475,0.0002888287,0.000004491734,0.000015379686,0.000035394598,0.000002711297,0.000017699862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.000044000615,0.00036002832,0.0001083779,0.00027718997,0.00012649727],"domain_scores_gemma":[0.9990495,0.00008604514,0.00016634742,0.00051210047,0.00013289138,0.000053106774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035973833,0.000104708066,0.00017293969,0.00068703806,0.00016842778,0.00006254693,0.00035438203,0.000053129457,0.00005821668],"category_scores_gemma":[0.0000049376476,0.000089579575,0.00013207058,0.0013468786,0.00004699117,0.0018673044,0.0000023564498,0.0001100894,0.000054014778],"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.00006712957,0.00009780487,0.000014014568,0.000037486225,0.0001547381,2.9186393e-7,0.00062904955,0.7887021,0.000103209,0.018610027,0.00001683238,0.19156738],"study_design_scores_gemma":[0.0009681785,0.00022528238,0.0014555494,0.00008713547,0.00021414596,0.000002122421,0.00006960579,0.9584729,0.036119934,0.0014130427,0.00073056587,0.00024151572],"about_ca_topic_score_codex":0.000014770681,"about_ca_topic_score_gemma":0.0000015304906,"teacher_disagreement_score":0.96678483,"about_ca_system_score_codex":0.000047892925,"about_ca_system_score_gemma":0.00006335692,"threshold_uncertainty_score":0.3652949},"labels":[],"label_agreement":null},{"id":"W2161065057","doi":"10.1109/18.850705","title":"On the training distortion of vector quantizers","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":38,"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":"Distortion (music); Mathematics; Set (abstract data type); Training set; Upper and lower bounds; Algorithm; Training (meteorology); Rate distortion; Function (biology); Computer science; Artificial intelligence; Mathematical optimization; Statistics; Telecommunications; Mathematical analysis","score_opus":0.016630669044424097,"score_gpt":0.24418621375826616,"score_spread":0.22755554471384207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161065057","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.0047125528,0.0000033910796,0.9897813,0.00023519112,0.00020953627,0.00018855321,0.000028441635,0.0002773316,0.0045636822],"genre_scores_gemma":[0.9943329,0.000019246007,0.004852771,0.000580634,0.000006241038,0.0000537688,0.0000035997382,0.0000048558913,0.00014597093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990631,0.00011034341,0.000326739,0.000102482045,0.00027055625,0.00012682438],"domain_scores_gemma":[0.9988374,0.0003952584,0.00013195211,0.0005530612,0.00004574777,0.000036546702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039299057,0.00010599933,0.00010087971,0.00014911588,0.00020768338,0.000043492662,0.0005037533,0.000046888923,0.00047648879],"category_scores_gemma":[0.00001631918,0.00007584985,0.000074585034,0.00028038205,0.00007366963,0.0016228701,0.0000014807174,0.00018398547,0.00016646723],"study_design_candidate":"design_other","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.000088290835,0.000045196295,7.878202e-8,0.000007947847,0.000011329397,1.7019954e-7,0.0027710423,0.011767371,0.00024294773,0.21686162,0.0004102031,0.7677938],"study_design_scores_gemma":[0.001296851,0.00094923447,0.00019351579,0.00042926,0.00003436186,0.000026804926,0.0013453239,0.07051354,0.6781404,0.22280996,0.023411008,0.00084976206],"about_ca_topic_score_codex":0.0000031254854,"about_ca_topic_score_gemma":4.6287795e-7,"teacher_disagreement_score":0.9896204,"about_ca_system_score_codex":0.000041519415,"about_ca_system_score_gemma":0.000029921914,"threshold_uncertainty_score":0.5217218},"labels":[],"label_agreement":null},{"id":"W2162421771","doi":"10.1109/tit.2009.2039167","title":"Communication Over Finite-Field Matrix Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":66,"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":"Finite field; Computer science; Matrix (chemical analysis); Field (mathematics); Mathematics; Discrete mathematics; Pure mathematics; Materials science","score_opus":0.014475936530199839,"score_gpt":0.26941802016374566,"score_spread":0.2549420836335458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162421771","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.0022308058,0.000026099151,0.9867651,0.0012461374,0.00096995913,0.00018618291,0.0000041240605,0.00027895134,0.008292657],"genre_scores_gemma":[0.9905892,0.00029060617,0.0064919037,0.0020475516,0.00002354904,0.00006651916,0.0000064462924,0.0000060507277,0.00047816496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905604,0.00015650023,0.00032867322,0.00010589932,0.00019194436,0.00016096038],"domain_scores_gemma":[0.99782574,0.00068592845,0.0001242027,0.00113146,0.0001571255,0.00007554459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601867,0.00012900979,0.00010159768,0.00025792656,0.0005251069,0.0002810367,0.00096697273,0.00010537048,0.0005564111],"category_scores_gemma":[0.0000414111,0.00012584831,0.00007827906,0.00042461779,0.000049417395,0.0023677954,0.000011805247,0.00058416516,0.0005168687],"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.000036829377,0.00009697485,0.0000028450634,0.000007954464,0.000024326064,1.8893773e-7,0.0037266796,0.007998416,0.0006951199,0.5431417,0.0012386363,0.44303033],"study_design_scores_gemma":[0.0021324267,0.00030647032,0.00021798418,0.00011845245,0.000025296633,0.000030449903,0.00041831867,0.67259365,0.08153885,0.036407143,0.20513067,0.0010803124],"about_ca_topic_score_codex":0.0000038246753,"about_ca_topic_score_gemma":0.000014074917,"teacher_disagreement_score":0.9883584,"about_ca_system_score_codex":0.000025971909,"about_ca_system_score_gemma":0.00004682427,"threshold_uncertainty_score":0.66434735},"labels":[],"label_agreement":null},{"id":"W2163750149","doi":"10.1109/tit.2005.856934","title":"Analysis of Low-Density Parity-Check Codes for the Gilbert–Elliott Channel","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":80,"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":"Low-density parity-check code; Decoding methods; List decoding; Algorithm; Sequential decoding; Channel (broadcasting); Computer science; Concatenated error correction code; Theoretical computer science; Mathematics; Telecommunications; Block code","score_opus":0.012693858256569409,"score_gpt":0.25261944954217297,"score_spread":0.23992559128560356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163750149","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.003504484,0.000013757628,0.99421746,0.00053435017,0.00031033639,0.00034759066,0.000028978568,0.00031273853,0.00073033094],"genre_scores_gemma":[0.9881947,0.00003079333,0.010841108,0.0006390118,0.000018930694,0.000086147775,0.0000044055128,0.000005734818,0.00017914033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988759,0.00008998458,0.00045027657,0.00014005705,0.00025863235,0.00018514408],"domain_scores_gemma":[0.99781007,0.0009850021,0.00024629434,0.00065632263,0.00025821532,0.00004412905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012176861,0.00013947947,0.00021911318,0.0005619123,0.00032145,0.00008446754,0.0006283661,0.00008953508,0.00002412165],"category_scores_gemma":[0.000037547296,0.000110483146,0.0002929816,0.0010401261,0.00007927337,0.0012732606,0.000004510103,0.00019104511,0.000027186661],"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.00025201446,0.00034300567,0.000023549912,0.00011084855,0.0013531856,2.1543613e-7,0.019514436,0.465844,0.0003929099,0.07259789,0.00078714505,0.4387808],"study_design_scores_gemma":[0.00025862118,0.00009429632,0.00026988782,0.000026490128,0.0003364337,0.000003480206,0.0003939269,0.87394667,0.11951161,0.0038037666,0.001138609,0.00021623229],"about_ca_topic_score_codex":0.000035089113,"about_ca_topic_score_gemma":0.00011092055,"teacher_disagreement_score":0.98469025,"about_ca_system_score_codex":0.00007021743,"about_ca_system_score_gemma":0.000042321193,"threshold_uncertainty_score":0.4505372},"labels":[],"label_agreement":null},{"id":"W2163934701","doi":"10.1109/tit.2006.876253","title":"Algebraic immunity for cryptographically significant Boolean functions: analysis and construction","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":241,"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":"Boolean function; Mathematics; Hamming weight; Cryptography; Algebraic function; Discrete mathematics; Boolean expression; Algebraic number; Hamming distance; Symmetric function; Addition theorem; Degree (music); Function (biology); Hamming code; Algorithm","score_opus":0.004967897182034475,"score_gpt":0.19394458703232492,"score_spread":0.18897668985029045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163934701","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.023545876,0.000013289219,0.97441304,0.00014263797,0.00034294135,0.00029116508,0.0000617412,0.0002811594,0.0009081253],"genre_scores_gemma":[0.97368556,0.000016357157,0.025820078,0.00024959666,0.000018112236,0.00012946218,0.000029129369,0.000005932793,0.00004578172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988389,0.00014023983,0.00042894893,0.00019390562,0.000187035,0.00021096694],"domain_scores_gemma":[0.9987926,0.00038273667,0.00016302645,0.0004300367,0.00015976562,0.00007184712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676086,0.00017201072,0.00018207428,0.0012013926,0.00070011354,0.00026139338,0.0002593946,0.00009988058,0.00005398518],"category_scores_gemma":[0.000009680372,0.00016739454,0.00029401132,0.0016052512,0.00019837616,0.001533445,0.0000028707493,0.00019174998,0.000019455614],"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.0001882218,0.000110071254,0.00009123178,0.00002689297,0.00033196373,1.5713118e-7,0.00039638797,0.005791818,0.00021757433,0.81874925,0.00006567793,0.17403075],"study_design_scores_gemma":[0.0020549723,0.0006791161,0.0051255906,0.00003840227,0.0009675718,0.00003534003,0.0012790668,0.046874464,0.0093739135,0.92769873,0.0049479064,0.00092494214],"about_ca_topic_score_codex":0.000029365516,"about_ca_topic_score_gemma":0.000015868342,"teacher_disagreement_score":0.9501397,"about_ca_system_score_codex":0.000025216877,"about_ca_system_score_gemma":0.000031302712,"threshold_uncertainty_score":0.6826151},"labels":[],"label_agreement":null},{"id":"W2164337876","doi":"10.1109/tit.2008.928992","title":"Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":83,"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":"Toeplitz matrix; Space–time block code; Fading; Block code; Diversity gain; Algorithm; Transmit diversity; Mathematics; Transmission (telecommunications); Channel state information; Computer science; Topology (electrical circuits); Telecommunications; Wireless; Decoding methods; Combinatorics","score_opus":0.020409445866000242,"score_gpt":0.23106335685369495,"score_spread":0.2106539109876947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164337876","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.021947427,0.000021366855,0.975336,0.0000094122615,0.00020033677,0.0005590289,0.000109726236,0.001242256,0.0005744462],"genre_scores_gemma":[0.987975,0.00019377716,0.011325171,0.00004269034,0.000015932777,0.00023784643,0.00001778505,0.000022941362,0.00016887755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992755,0.000035313333,0.000287225,0.0000720406,0.00016038679,0.00016951097],"domain_scores_gemma":[0.9991155,0.00025073905,0.0000774687,0.00035701363,0.00013892671,0.00006035107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016134548,0.00016056381,0.00016328257,0.00021640654,0.0005199266,0.00001928132,0.00022661201,0.00009805369,0.000034960143],"category_scores_gemma":[0.000008446002,0.00013685336,0.00005779827,0.00020669591,0.00008595497,0.0009712743,0.0000023442208,0.00018560767,0.000041294308],"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.0011077119,0.000042881504,0.000004125194,0.00022805805,0.00011148025,8.2648944e-7,0.0027380479,0.9816427,0.0006305736,0.0010615085,0.00026005192,0.012172012],"study_design_scores_gemma":[0.0042559947,0.0016264713,0.000054240216,0.00037795716,0.00015149564,0.0002118657,0.0044955197,0.63682544,0.32881686,0.00064460095,0.021000408,0.0015391298],"about_ca_topic_score_codex":0.000007961328,"about_ca_topic_score_gemma":0.00001030486,"teacher_disagreement_score":0.96602756,"about_ca_system_score_codex":0.00012704004,"about_ca_system_score_gemma":0.000026500222,"threshold_uncertainty_score":0.5580718},"labels":[],"label_agreement":null},{"id":"W2164524962","doi":"10.1109/tit.2006.872863","title":"The peak sidelobe level of families of binary sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"PSL; Aperiodic graph; Binary number; Sequence (biology); Pseudorandom binary sequence; Combinatorics; Mathematics; Arithmetic; Biology; Genetics","score_opus":0.01606365660202252,"score_gpt":0.20974368044353547,"score_spread":0.19368002384151295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164524962","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.08180808,0.00021230541,0.89813393,0.00001946902,0.0004330563,0.00011632674,0.00006884872,0.000089966314,0.019118002],"genre_scores_gemma":[0.99962544,0.000045574932,0.00016758106,0.0000077869145,0.000012171502,0.00000941769,0.0000019665308,0.000004673632,0.00012537673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930173,0.000024699435,0.0004056392,0.00002859871,0.00015372332,0.00008563653],"domain_scores_gemma":[0.9995895,0.00013410722,0.00008494455,0.000110116016,0.000069029324,0.0000122796855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027069473,0.00007532584,0.00009752155,0.00011048376,0.00012559447,0.000020583382,0.000096610245,0.000042125823,0.000012276766],"category_scores_gemma":[0.0000027857193,0.00005438931,0.00005668711,0.00015212643,0.00008321436,0.0005245961,2.3914964e-7,0.000079377016,0.000009094354],"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.00003710779,0.000014924348,0.0000029616701,0.00026134783,0.000037923633,1.6440146e-7,0.0013983477,0.9170151,0.009521486,0.0076495763,0.00025998265,0.06380108],"study_design_scores_gemma":[0.0009693225,0.00023117241,0.0019723848,0.00048496886,0.00007638119,0.000026234848,0.016647918,0.14681485,0.81275034,0.014018242,0.0054381215,0.0005700482],"about_ca_topic_score_codex":0.00006922514,"about_ca_topic_score_gemma":0.00002319938,"teacher_disagreement_score":0.91781735,"about_ca_system_score_codex":0.000021272672,"about_ca_system_score_gemma":0.000023199442,"threshold_uncertainty_score":0.22179317},"labels":[],"label_agreement":null},{"id":"W2164604678","doi":"10.1109/18.887870","title":"Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":46,"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 Manitoba","funders":"","keywords":"BCH code; Coset; Mathematics; Minimum distance; Reed–Solomon error correction; Discrete mathematics; Dimension (graph theory); Block code; Linear code; Combinatorics; Decoding methods; Algorithm","score_opus":0.008859276577574706,"score_gpt":0.24117491621440465,"score_spread":0.23231563963682994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164604678","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.06423735,0.00003454937,0.93061054,0.0003118567,0.000063310574,0.00041881014,0.0000762051,0.0001906172,0.0040567648],"genre_scores_gemma":[0.99553263,0.00013001442,0.0030465992,0.0008287162,0.000012261064,0.00023913817,0.0000055000805,0.0000057675834,0.00019938432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991377,0.00013379002,0.00025672762,0.0001995132,0.00010630242,0.00016595048],"domain_scores_gemma":[0.9989977,0.00040398058,0.00005497541,0.00037502174,0.000046290326,0.00012207065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041652482,0.0001533172,0.00013789564,0.00026243238,0.00042429424,0.00021652252,0.00027157826,0.000053232092,0.00008483485],"category_scores_gemma":[0.00000401931,0.0001345551,0.00005197462,0.0003889473,0.00015483242,0.0011618115,0.000004564729,0.00012635197,0.00008921057],"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.00017600309,0.00007940279,0.000010673609,0.000028911087,0.000055520843,2.7502347e-7,0.014042925,0.0014717857,0.0005335577,0.14675097,0.00013933847,0.83671063],"study_design_scores_gemma":[0.004053199,0.0013548105,0.0033357632,0.0002773785,0.00012780809,0.0003236865,0.013093367,0.048289496,0.10493273,0.7191933,0.10256839,0.002450081],"about_ca_topic_score_codex":0.000005110688,"about_ca_topic_score_gemma":0.0000040846803,"teacher_disagreement_score":0.9312953,"about_ca_system_score_codex":0.000014884936,"about_ca_system_score_gemma":0.000018630311,"threshold_uncertainty_score":0.5486998},"labels":[],"label_agreement":null},{"id":"W2164881538","doi":"10.1109/tit.2010.2054650","title":"Robust Network Coding in the Presence of Untrusted Nodes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"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":"Computer science; Computer network; Linear network coding; Multicast; Network packet; Disjoint sets; Transformation (genetics); Adversary; Distributed computing; Computer security; Mathematics","score_opus":0.026553637394490848,"score_gpt":0.24598326984372462,"score_spread":0.21942963244923377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164881538","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.0053736805,0.00001364718,0.987617,0.0004486863,0.00050280656,0.00018792051,0.0000022261947,0.000056390345,0.0057976474],"genre_scores_gemma":[0.9940321,0.00011376525,0.00522657,0.0005324382,0.000018064247,0.000036635123,0.0000014158661,0.0000024876813,0.000036547826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904233,0.00023693623,0.0003197073,0.00007587288,0.00018269803,0.00014245862],"domain_scores_gemma":[0.99855185,0.0006138069,0.00011436205,0.0005912767,0.00010368734,0.000025040436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012918233,0.00008411395,0.000088808316,0.00014027678,0.00024916176,0.00010210289,0.0008967734,0.000051781128,0.000068555644],"category_scores_gemma":[0.00002870352,0.00006413463,0.000044290922,0.0007117144,0.00007833902,0.001218877,0.000005789506,0.0004092522,0.00002898419],"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.000029470784,0.00006328612,0.00003157554,0.0000126627665,0.000010684622,2.0751895e-7,0.0076248394,0.18875073,0.00038741625,0.6089068,0.00026191364,0.19392042],"study_design_scores_gemma":[0.0010965349,0.00009561509,0.002749148,0.00016119094,0.0000153644,0.00003068735,0.0012277596,0.96376294,0.010024593,0.011969662,0.008450091,0.00041639432],"about_ca_topic_score_codex":0.0000036713789,"about_ca_topic_score_gemma":0.000049138,"teacher_disagreement_score":0.98865837,"about_ca_system_score_codex":0.000013520961,"about_ca_system_score_gemma":0.00003948085,"threshold_uncertainty_score":0.2615334},"labels":[],"label_agreement":null},{"id":"W2165136113","doi":"10.1109/tit.2007.911263","title":"Asymptotic Minimax Bounds for Stochastic Deconvolution Over Groups","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":23,"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 Guelph","funders":"","keywords":"Mathematics; Deconvolution; Fourier transform; Minimax; Applied mathematics; Impulse response; Fourier inversion theorem; Convolution (computer science); Algorithm; Mathematical optimization; Mathematical analysis; Fourier analysis; Short-time Fourier transform; Computer science; Artificial intelligence","score_opus":0.041077642679164465,"score_gpt":0.30965514196650673,"score_spread":0.26857749928734226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165136113","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.02484364,0.000009097173,0.9710967,0.00006882776,0.00032693218,0.00059845514,0.00007105867,0.00017547049,0.0028098035],"genre_scores_gemma":[0.97161585,0.00001373467,0.026894616,0.00026370047,0.00004959628,0.00029928752,0.000015951442,0.000026544598,0.00082069746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982918,0.00010698207,0.0007780202,0.00015901275,0.00035231764,0.00031190264],"domain_scores_gemma":[0.9975721,0.0015870907,0.00019714539,0.00033712274,0.00018122864,0.00012527639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054447,0.00024412434,0.00035967177,0.0003331352,0.0005414109,0.00004945412,0.00016423607,0.00015243998,0.0007438867],"category_scores_gemma":[0.0001335764,0.00020770833,0.0003907955,0.00028232945,0.00013608391,0.0009195797,9.2978763e-7,0.00020216122,0.00021019689],"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.0007343088,0.0007790168,0.0000025060185,0.00070197263,0.0005363923,0.0000011549213,0.0065730675,0.005730866,0.0001369093,0.9507079,0.0012184308,0.032877453],"study_design_scores_gemma":[0.002376319,0.00034560193,0.000061490035,0.00010290957,0.00048012016,0.00006848756,0.0005802839,0.06464401,0.0036704931,0.9260985,0.001005921,0.00056585745],"about_ca_topic_score_codex":0.0000028309132,"about_ca_topic_score_gemma":0.0000046432256,"teacher_disagreement_score":0.9467722,"about_ca_system_score_codex":0.000103151615,"about_ca_system_score_gemma":0.000062920626,"threshold_uncertainty_score":0.84701},"labels":[],"label_agreement":null},{"id":"W2166779638","doi":"10.1109/tit.2004.833363","title":"Performance Bounds for Space–Time Block Codes With Receive Antenna Selection","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Antenna (radio); Upper and lower bounds; Block code; Mathematics; Signal-to-noise ratio (imaging); Bit error rate; Selection (genetic algorithm); Block (permutation group theory); Maximal-ratio combining; Algorithm; Diversity combining; Computer science; Fading; Topology (electrical circuits); Telecommunications; Decoding methods; Combinatorics; Mathematical analysis","score_opus":0.005225569943576393,"score_gpt":0.20579423676560102,"score_spread":0.20056866682202462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166779638","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.031104717,0.0000114856275,0.96502674,0.00006178137,0.00011394735,0.00049067836,0.00003948652,0.0013044709,0.0018467226],"genre_scores_gemma":[0.976892,0.0002025682,0.022229563,0.000079665195,0.000016525511,0.00037801755,0.000021192105,0.000031966527,0.0001485145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928045,0.000019061932,0.00028014177,0.00008303273,0.00013867076,0.00019862458],"domain_scores_gemma":[0.9993514,0.00008862827,0.00007678058,0.00027025637,0.00016332055,0.00004960743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018598407,0.00018040497,0.00014517718,0.00027261162,0.0002999485,0.00004900256,0.00015381761,0.0000975426,0.00002815781],"category_scores_gemma":[0.00000461302,0.00017384737,0.000053990643,0.0003069188,0.00007290068,0.0015419961,6.676632e-7,0.00023331294,0.00009259545],"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.00023044065,0.000037228074,0.0000015352117,0.00008724013,0.000058619546,5.445286e-8,0.0009413562,0.9696412,0.0033333118,0.0017157779,0.000058191563,0.023895059],"study_design_scores_gemma":[0.0020008218,0.0007570723,0.000058163227,0.00030375266,0.00006732756,0.00005682753,0.0004708783,0.3208052,0.66560704,0.0037175152,0.0054486627,0.00070677773],"about_ca_topic_score_codex":0.000002619535,"about_ca_topic_score_gemma":0.0000055569826,"teacher_disagreement_score":0.94578725,"about_ca_system_score_codex":0.0002524432,"about_ca_system_score_gemma":0.000038669747,"threshold_uncertainty_score":0.708929},"labels":[],"label_agreement":null},{"id":"W2166905766","doi":"10.1109/tit.2007.911261","title":"Affine Reflection Group Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","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 Ottawa","funders":"","keywords":"Decoding methods; Correctness; Rank (graph theory); Mathematics; Affine transformation; Reflection (computer programming); Dimension (graph theory); Affine plane (incidence geometry); Affine space; Affine hull; Group (periodic table); Affine group; Homogeneous space; Vector space; Affine coordinate system; Affine combination; Combinatorics; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Geometry","score_opus":0.015213679010986246,"score_gpt":0.2250112200735565,"score_spread":0.20979754106257026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166905766","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.0071039135,0.000008655359,0.97830194,0.0001124573,0.00077525375,0.00012362609,0.0000062173644,0.00052063155,0.013047293],"genre_scores_gemma":[0.9939498,0.00004482575,0.0049572466,0.0006979788,0.000027689443,0.00004308605,0.0000034478007,0.000005137625,0.00027079473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908495,0.00012261872,0.00026682927,0.00012778948,0.00022116989,0.00017662391],"domain_scores_gemma":[0.9992447,0.00015008544,0.00008671193,0.0003823869,0.00006992913,0.00006619451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004539123,0.00012893176,0.00010307575,0.00041543777,0.0005913007,0.000076342745,0.00034051418,0.00007080781,0.00014228182],"category_scores_gemma":[0.000006118698,0.00012288455,0.00012040163,0.0006430352,0.0000839852,0.0024485176,0.0000019611061,0.00019592613,0.0003694683],"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.00021484194,0.00017358741,0.0000056650993,0.000018779243,0.000051920466,0.0000025065456,0.004607985,0.005440262,0.00056587567,0.68700904,0.00056937337,0.30134013],"study_design_scores_gemma":[0.0064874114,0.003376498,0.0022553175,0.00023536077,0.00012724778,0.001346791,0.0016261182,0.067072906,0.21525817,0.5582869,0.1408559,0.0030713868],"about_ca_topic_score_codex":0.000003936586,"about_ca_topic_score_gemma":0.0000024311923,"teacher_disagreement_score":0.98684585,"about_ca_system_score_codex":0.000041480533,"about_ca_system_score_gemma":0.000025848954,"threshold_uncertainty_score":0.50110865},"labels":[],"label_agreement":null},{"id":"W2166972143","doi":"10.1109/tit.2010.2046213","title":"Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"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":"Emphasis (telecommunications); Relay; Computer science; Scheduling (production processes); Telecommunications; Computer network; Mathematics; Mathematical optimization; Physics","score_opus":0.019772793341809557,"score_gpt":0.2550017752339384,"score_spread":0.23522898189212885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166972143","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.0068212585,0.00002469924,0.98199534,0.0031136703,0.0005789373,0.00026701533,0.0000015337504,0.00015035202,0.007047204],"genre_scores_gemma":[0.9882628,0.00014551074,0.009162456,0.002111703,0.000028741604,0.00011004918,0.0000039952897,0.0000060228326,0.00016872326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.00026965985,0.00039713958,0.0001347568,0.00024158656,0.0002202889],"domain_scores_gemma":[0.99853075,0.00034849104,0.0001165349,0.0008610145,0.00008508119,0.00005812083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014728501,0.0001451274,0.000110007575,0.00028449198,0.0005413549,0.00025526262,0.0010829963,0.00010157942,0.00009089645],"category_scores_gemma":[0.000028988012,0.00011082437,0.00007848798,0.0006504871,0.00007438905,0.0019217073,0.0000070809506,0.0008962714,0.00030471798],"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.000045257344,0.00013945314,0.0000040942646,0.000011288383,0.000020006844,0.0000014740733,0.02229509,0.28189018,0.0002215391,0.5404608,0.00024523388,0.15466553],"study_design_scores_gemma":[0.0011790112,0.00010200588,0.0005891281,0.00007325525,0.0000113518245,0.000054830973,0.0015770252,0.96855927,0.0016142542,0.0049447054,0.020840757,0.000454387],"about_ca_topic_score_codex":0.0000056872277,"about_ca_topic_score_gemma":0.00008137901,"teacher_disagreement_score":0.98144156,"about_ca_system_score_codex":0.000033749682,"about_ca_system_score_gemma":0.000060092178,"threshold_uncertainty_score":0.45192865},"labels":[],"label_agreement":null},{"id":"W2167093538","doi":"10.1109/tit.2008.924653","title":"Worst Case Nonzero-Error Interactive Communication","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complexity and Algorithms in Graphs","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":"Université de Montréal; University of British Columbia","funders":"","keywords":"Emphasis (telecommunications); Mathematics; Computer science; Telecommunications","score_opus":0.0233208811436139,"score_gpt":0.2516708182198281,"score_spread":0.2283499370762142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167093538","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.0057367813,0.000012887528,0.9874546,0.00031645483,0.00055359234,0.00019049458,0.000020132697,0.00029651067,0.0054185283],"genre_scores_gemma":[0.97725064,0.000029970157,0.021563021,0.00087389944,0.00001268111,0.00005838915,0.0000056158765,0.0000055273217,0.00020026491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.00013636792,0.00034694932,0.00012689627,0.00021236415,0.00017400153],"domain_scores_gemma":[0.99856,0.00035174473,0.00014189107,0.0007231035,0.0001431703,0.00008005171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033569644,0.00014346249,0.00012003356,0.00035000133,0.0008798974,0.000103923834,0.0005481912,0.000066785884,0.00010262335],"category_scores_gemma":[0.000010088119,0.0001426169,0.0001124252,0.00047950415,0.00014991498,0.003639693,0.0000071238705,0.000359293,0.00044256306],"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.00020993651,0.00053255685,0.0000036650154,0.000037058835,0.00015479472,0.000121855635,0.05622985,0.01656152,0.000035916357,0.29834667,0.0013233952,0.6264428],"study_design_scores_gemma":[0.005083939,0.00094143755,0.00041828176,0.00032461237,0.0000969311,0.022775091,0.010045197,0.7009295,0.035259075,0.19236511,0.0293206,0.0024401823],"about_ca_topic_score_codex":0.00004049482,"about_ca_topic_score_gemma":0.00001625556,"teacher_disagreement_score":0.97151387,"about_ca_system_score_codex":0.00007811413,"about_ca_system_score_gemma":0.000049560083,"threshold_uncertainty_score":0.67675483},"labels":[],"label_agreement":null},{"id":"W2167134753","doi":"10.1109/tit.2007.909105","title":"Decoherence-Insensitive Quantum Communication by Optimal $C^{\\ast }$-Encoding","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":45,"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 Guelph; University of Waterloo","funders":"","keywords":"Quantum decoherence; Decoding methods; Quantum channel; Decoherence-free subspaces; Quantum state; Quantum; Quantum information; Computer science; Amplitude damping channel; Quantum error correction; Mathematics; Theoretical computer science; Topology (electrical circuits); Algorithm; Quantum network; Quantum mechanics; Physics; Combinatorics","score_opus":0.008997089798467105,"score_gpt":0.23643823642066703,"score_spread":0.2274411466221999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167134753","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.009291269,0.00002021947,0.9724494,0.00020865002,0.00047051272,0.0002533998,0.000026374313,0.00042417744,0.016856002],"genre_scores_gemma":[0.9889116,0.00005696705,0.009350362,0.001543912,0.000010249681,0.000028156503,0.000024377436,0.0000074472623,0.00006689671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983007,0.00012241893,0.0006801311,0.00014150358,0.00041623012,0.00033901742],"domain_scores_gemma":[0.998328,0.0003735266,0.00028811765,0.0006152115,0.00024295392,0.00015222885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015352683,0.00020470092,0.00015301352,0.0005699373,0.0006192437,0.00029893217,0.0006437077,0.00012910352,0.00011105034],"category_scores_gemma":[0.000014520913,0.00020333848,0.00013675998,0.00077051163,0.00012494113,0.005102166,0.0000058596356,0.00036205858,0.0006210571],"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.00021337744,0.0001880843,0.000006155986,0.000032437103,0.000081202474,0.0000013164115,0.01701236,0.0067992243,0.00053541135,0.6461223,0.003002779,0.3260054],"study_design_scores_gemma":[0.00545759,0.0011293804,0.0007584649,0.00036963593,0.000095092466,0.00024088685,0.028856626,0.53478724,0.32327306,0.041874945,0.060289245,0.0028678365],"about_ca_topic_score_codex":0.000013838013,"about_ca_topic_score_gemma":0.0000049139853,"teacher_disagreement_score":0.97962034,"about_ca_system_score_codex":0.000093268995,"about_ca_system_score_gemma":0.000055940447,"threshold_uncertainty_score":0.82919025},"labels":[],"label_agreement":null},{"id":"W2167304554","doi":"10.1109/tit.2004.839525","title":"Using Directed Hill-Climbing for the Construction of Difference Triangle Sets","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","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":"Memorial University of Newfoundland","funders":"","keywords":"Climbing; Mathematics; Computer science; Combinatorics; Hill climbing; Algorithm; Discrete mathematics; Engineering; Structural engineering","score_opus":0.017309932888172046,"score_gpt":0.2257718704049267,"score_spread":0.20846193751675465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167304554","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.08884928,0.000051790725,0.90864795,0.00001898236,0.0008812988,0.00036319037,0.00007934424,0.00023513912,0.0008730069],"genre_scores_gemma":[0.99859023,0.000024022062,0.0012107859,0.000031906733,0.000029069948,0.00006319584,0.000004487399,0.000010903078,0.000035376615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.00007138982,0.000404202,0.000050933853,0.00010648085,0.00013089649],"domain_scores_gemma":[0.99920136,0.00042935577,0.00009724856,0.0001756069,0.000066426976,0.00003003179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049204985,0.000112134236,0.00013999805,0.00016626698,0.00020396004,0.000027915914,0.000098007935,0.00007597042,0.000060033784],"category_scores_gemma":[0.000012633391,0.00008931024,0.00011880788,0.00019153529,0.0000665394,0.00046721456,3.7066823e-7,0.000120604534,0.000013670514],"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.00021873809,0.00003190421,0.0000030105525,0.00017000524,0.00017661841,3.917037e-8,0.003239936,0.5776567,0.006159489,0.021942317,0.00004178873,0.39035946],"study_design_scores_gemma":[0.0013210685,0.00006347705,0.00006655763,0.00013228877,0.00014091707,0.000029223103,0.0026866077,0.8224373,0.16584839,0.005305523,0.0016837209,0.00028493092],"about_ca_topic_score_codex":0.0000032938797,"about_ca_topic_score_gemma":0.0000031905277,"teacher_disagreement_score":0.909741,"about_ca_system_score_codex":0.000050857423,"about_ca_system_score_gemma":0.000013202356,"threshold_uncertainty_score":0.3641966},"labels":[],"label_agreement":null},{"id":"W2168256033","doi":"10.1109/tit.2011.2104990","title":"Fast Encoder Optimization for Multi-Resolution Scalar Quantizer Design","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"","keywords":"Encoder; Algorithm; Convex optimization; Distortion (music); Computer science; Scalar (mathematics); Mathematics; Quadratic equation; Mathematical optimization; Regular polygon; Bandwidth (computing)","score_opus":0.0618109044380348,"score_gpt":0.278808517238661,"score_spread":0.2169976128006262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168256033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074486015,0.0000086511045,0.9975606,0.000028719698,0.0004660426,0.00076165795,0.000045210705,0.0007720224,0.00034963846],"genre_scores_gemma":[0.041066434,0.000027335682,0.9580533,0.0003498187,0.000009760201,0.0003705222,0.000015836185,0.000012870617,0.00009410431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876446,0.00014120927,0.00043651467,0.00020595868,0.00021459101,0.00023726774],"domain_scores_gemma":[0.99876404,0.00015369253,0.00020400397,0.00056520384,0.0002322483,0.00008079962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005935029,0.000180134,0.00013576543,0.00036895214,0.00034865979,0.00008940495,0.00056223373,0.00012341439,0.00011288613],"category_scores_gemma":[0.000026614429,0.0001689242,0.0000915187,0.0002941719,0.000060437804,0.0050977897,0.0000055686146,0.0001514352,0.000099012825],"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.00026020862,0.00022070418,3.9344962e-7,0.000030692834,0.00002771846,3.3496568e-7,0.0027152475,0.7582892,0.00020842231,0.05725667,0.00052521063,0.18046518],"study_design_scores_gemma":[0.00055158045,0.00013883834,0.000006165189,0.00003162997,0.000011017081,0.0000053831673,0.000085829044,0.91421074,0.078630775,0.005684796,0.0004356599,0.00020758061],"about_ca_topic_score_codex":0.0000043330174,"about_ca_topic_score_gemma":5.913703e-7,"teacher_disagreement_score":0.18025759,"about_ca_system_score_codex":0.00006975101,"about_ca_system_score_gemma":0.000049884882,"threshold_uncertainty_score":0.6888529},"labels":[],"label_agreement":null},{"id":"W2168888523","doi":"10.1109/tit.2004.838341","title":"Binary Sequences With Merit Factor Greater Than<tex>$6.34$</tex>","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Binary number; Figure of merit; Value (mathematics); Mathematics; Combinatorics; Construct (python library); Statistics; Physics; Computer science; Arithmetic","score_opus":0.021632181448261484,"score_gpt":0.2330094041940499,"score_spread":0.2113772227457884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168888523","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.14745449,0.00006249122,0.84537387,0.00047566125,0.001036176,0.00045600225,0.00011788607,0.00082635693,0.004197049],"genre_scores_gemma":[0.97773093,0.00007389181,0.02014361,0.0008292502,0.000078763114,0.00016022645,0.000047407673,0.00003689001,0.00089901855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968065,0.0003074411,0.0007989524,0.0005327648,0.0008391189,0.00071521744],"domain_scores_gemma":[0.9973593,0.00028357652,0.0003674329,0.001407371,0.0002760175,0.00030631074],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00083691074,0.0006056311,0.0004288292,0.0009950476,0.0009953263,0.0005824753,0.0012359228,0.00026894882,0.0009011352],"category_scores_gemma":[0.000018646742,0.0005034014,0.00037306646,0.0014748471,0.0004404029,0.0048355823,0.000017000253,0.0005903822,0.002264004],"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.0038512186,0.0017333257,0.00018915231,0.0006327344,0.0017107454,0.000028216242,0.10607575,0.123263896,0.020755244,0.48936903,0.0015755371,0.25081515],"study_design_scores_gemma":[0.016432531,0.004614157,0.00378531,0.0030054606,0.0011426171,0.0019956117,0.002929908,0.0016233383,0.09006265,0.3369225,0.52624,0.011245944],"about_ca_topic_score_codex":0.000032670247,"about_ca_topic_score_gemma":0.0001362719,"teacher_disagreement_score":0.8302764,"about_ca_system_score_codex":0.00020239118,"about_ca_system_score_gemma":0.00020187684,"threshold_uncertainty_score":0.99974173},"labels":[],"label_agreement":null},{"id":"W2168925234","doi":"10.1109/18.887886","title":"Tight error bounds for nonuniform signaling over AWGN channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":70,"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":"Additive white Gaussian noise; Upper and lower bounds; Phase-shift keying; Mathematics; Pairwise error probability; Quadrature amplitude modulation; Algorithm; QAM; Decoding methods; Greedy algorithm; Discrete mathematics; Combinatorics; Bit error rate; Statistics; White noise; Mathematical analysis","score_opus":0.01015930525569288,"score_gpt":0.24117117990057135,"score_spread":0.23101187464487846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168925234","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.0064636418,0.000025285884,0.98256457,0.00003649942,0.00032603415,0.00045089642,0.00008526571,0.0011906015,0.008857188],"genre_scores_gemma":[0.99031883,0.00014648016,0.007914963,0.00028927537,0.00003948249,0.000474072,0.000039874187,0.0000374441,0.0007395748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991322,0.000023036411,0.00040312088,0.000077033495,0.00014354501,0.00022104301],"domain_scores_gemma":[0.99926776,0.00016013451,0.000052341693,0.0003911026,0.00006650494,0.00006214692],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024007398,0.00017975758,0.00014585927,0.0002440064,0.0002627287,0.000068825786,0.00023623393,0.00012236598,0.0011136141],"category_scores_gemma":[0.0000033195972,0.00018968871,0.00011124455,0.00020499111,0.00004903389,0.0016429211,6.264234e-7,0.00022659631,0.00021424738],"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.000109448156,0.00003355476,1.5587185e-7,0.000079367645,0.000048819584,9.481301e-8,0.0015108819,0.6946004,0.000710036,0.005413711,0.00048474732,0.2970088],"study_design_scores_gemma":[0.0014452587,0.00018391943,0.00000891562,0.0001624122,0.000053091353,0.0000111292675,0.00047532032,0.3672805,0.42951238,0.02135995,0.17865321,0.00085389183],"about_ca_topic_score_codex":0.000002037991,"about_ca_topic_score_gemma":0.0000015773134,"teacher_disagreement_score":0.9838552,"about_ca_system_score_codex":0.00012851685,"about_ca_system_score_gemma":0.000016225302,"threshold_uncertainty_score":0.9997995},"labels":[],"label_agreement":null},{"id":"W2169773204","doi":"10.1109/tit.2011.2112030","title":"Randomized Resource Allocation in Decentralized Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Transmitter; Computer science; Transmission (telecommunications); Mutual information; Random variable; Gaussian; Wireless network; Wireless; Signal-to-noise ratio (imaging); Interference (communication); Frequency-hopping spread spectrum; Topology (electrical circuits); Theoretical computer science; Algorithm; Mathematics; Telecommunications; Statistics; Combinatorics; Artificial intelligence; Physics","score_opus":0.008641948144708471,"score_gpt":0.19861223029093286,"score_spread":0.18997028214622438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169773204","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.0022991272,0.000039113715,0.98775226,0.000006139927,0.00047948284,0.0006587229,0.0000051080265,0.00042737884,0.008332652],"genre_scores_gemma":[0.99748164,0.00018681437,0.0018805091,0.000076013996,0.000012022058,0.00025324745,0.000021561797,0.000024617475,0.00006355832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.00017101927,0.00061312807,0.000083128114,0.000109999855,0.00021097698],"domain_scores_gemma":[0.9994187,0.00016496144,0.000093558476,0.00021559652,0.000050498762,0.000056712703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064072903,0.00016606522,0.00025676793,0.00032788736,0.000066762455,0.000024247445,0.00011130432,0.00013432327,0.00014914369],"category_scores_gemma":[0.0000108156555,0.0001679406,0.00008222058,0.0003322688,0.00005283346,0.0010928711,4.8678527e-7,0.0002121489,0.000081506674],"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.00410844,0.000020920259,7.221549e-7,0.000027262713,0.000028521705,2.7109638e-7,0.0028833842,0.96736395,0.000014719572,0.004143594,0.00002080488,0.021387406],"study_design_scores_gemma":[0.03258577,0.00001575122,0.000008213477,0.0000876566,0.000028758146,0.00000517454,0.00052348594,0.9604643,0.004954669,0.00083988154,0.00022884794,0.00025746567],"about_ca_topic_score_codex":0.000014238276,"about_ca_topic_score_gemma":0.0000116893625,"teacher_disagreement_score":0.9951825,"about_ca_system_score_codex":0.00013350262,"about_ca_system_score_gemma":0.000011408293,"threshold_uncertainty_score":0.6848419},"labels":[],"label_agreement":null},{"id":"W2170056754","doi":"10.1109/tit.2007.904783","title":"Multisource, Multidestination, Multirelay Wireless Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":77,"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":"Decoding methods; Computer network; Computer science; Relay; Multicast; Wireless sensor network; Fading; Transmitter; Linear network coding; Coding (social sciences); Node (physics); Algorithm; Mathematics; Engineering; Network packet; Channel (broadcasting)","score_opus":0.013172078739805838,"score_gpt":0.2488425138796668,"score_spread":0.23567043513986097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170056754","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.002452519,0.000033296605,0.9918019,0.00016386836,0.0007280157,0.0002783618,0.0000027014555,0.00047357637,0.004065723],"genre_scores_gemma":[0.98583686,0.00013375022,0.012432593,0.0011360273,0.000032146258,0.00003528633,0.0000069244015,0.000009733426,0.00037665383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856895,0.00016375213,0.0005393679,0.00016474207,0.00026416813,0.00029900824],"domain_scores_gemma":[0.9980819,0.00065133016,0.00018194855,0.00064676546,0.00030792522,0.00013012825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471332,0.00018339761,0.00013510253,0.00037290898,0.00064274087,0.00017652729,0.0006893802,0.00011039645,0.00006859348],"category_scores_gemma":[0.000026206711,0.00018053988,0.00009137892,0.000736528,0.000077844554,0.0019874105,0.0000080644,0.0003919729,0.00025810875],"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.000034704855,0.00007630852,0.000009585139,0.0000048427873,0.000018649704,7.688115e-7,0.002281332,0.07199533,0.00008134669,0.053869374,0.00012932224,0.8714984],"study_design_scores_gemma":[0.000996683,0.00006957112,0.0009329521,0.000052565305,0.000009123626,0.00001744757,0.00025696354,0.982858,0.0064950697,0.00039226114,0.0075597935,0.00035958752],"about_ca_topic_score_codex":0.0000036537253,"about_ca_topic_score_gemma":0.000019187852,"teacher_disagreement_score":0.9833844,"about_ca_system_score_codex":0.000111228976,"about_ca_system_score_gemma":0.000034262615,"threshold_uncertainty_score":0.73622024},"labels":[],"label_agreement":null},{"id":"W2171435376","doi":"10.1109/tit.2002.802646","title":"On sampling in shift invariant spaces","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":68,"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 Alberta","funders":"","keywords":"Invariant (physics); Mathematics; Perturbation (astronomy); Nonuniform sampling; Mathematical analysis; Algorithm; Physics","score_opus":0.06451775407263553,"score_gpt":0.31489992836451763,"score_spread":0.2503821742918821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171435376","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.010124576,0.000006682642,0.94826293,0.00028908462,0.00013218466,0.00025120805,0.000017651133,0.000104705396,0.04081098],"genre_scores_gemma":[0.98556507,0.000029469511,0.013552534,0.0004324147,0.000014346048,0.00006680519,0.0000018930052,0.000014427056,0.00032304734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851066,0.00016875086,0.00063916255,0.00012415648,0.0003222352,0.00023500947],"domain_scores_gemma":[0.9978325,0.0016236965,0.00012090597,0.0003078604,0.000034148994,0.00008093592],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011978747,0.0001898143,0.00028238256,0.00046206362,0.00014948721,0.00008800075,0.00015210123,0.000114070965,0.0032309142],"category_scores_gemma":[0.00009967575,0.0001512216,0.00016657515,0.0003927158,0.00004662837,0.0006131004,7.2606525e-7,0.00034088272,0.0005996944],"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.00006572018,0.00033027245,7.751579e-7,0.0001256611,0.00005124326,0.0000010360259,0.0038746637,0.0035140968,0.000011778432,0.96357435,0.0000811269,0.028369283],"study_design_scores_gemma":[0.0007202427,0.00010560281,0.000011971001,0.00015006035,0.000059120248,0.0000045557367,0.0005260808,0.015936509,0.0024393355,0.9792428,0.0005548879,0.0002488387],"about_ca_topic_score_codex":0.0000075278767,"about_ca_topic_score_gemma":0.000016646707,"teacher_disagreement_score":0.9754405,"about_ca_system_score_codex":0.000058492056,"about_ca_system_score_gemma":0.000009174301,"threshold_uncertainty_score":0.99768025},"labels":[],"label_agreement":null},{"id":"W2171940859","doi":"10.1109/tit.2011.2165794","title":"Cooperative Diversity With Mobile Nodes: Capacity Outage Rate and Duration","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"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":"Cooperative diversity; Rayleigh fading; Diversity gain; Computer science; Fading; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Mathematics; Channel (broadcasting); Logarithm; Topology (electrical circuits); Statistics; Telecommunications","score_opus":0.032222188495190485,"score_gpt":0.21865799383427495,"score_spread":0.18643580533908446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171940859","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.052551154,0.000009894387,0.9426449,0.000047064572,0.00011675728,0.0002625601,0.000009217674,0.00014516954,0.004213277],"genre_scores_gemma":[0.9949766,0.0001315391,0.0041677356,0.00053109106,0.000004398296,0.000054281954,0.0000026594907,0.0000033829133,0.00012835971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992115,0.00021681724,0.00020531911,0.0001238266,0.00012242637,0.00012013685],"domain_scores_gemma":[0.99918,0.0001061801,0.00009986556,0.00034474264,0.00020111381,0.000068075424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046344718,0.00012469232,0.00010136905,0.00013871446,0.0008631489,0.0001115123,0.000291596,0.000045506484,0.00010964436],"category_scores_gemma":[0.000005960611,0.00010371671,0.000026756805,0.00027632958,0.00011491994,0.0028696666,0.000014041318,0.00018682938,0.00006264844],"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.00066520995,0.0004369886,0.00018603385,0.000059587852,0.00023258792,0.0000032990229,0.25054157,0.01257,0.0005530509,0.40401238,0.00015964513,0.33057964],"study_design_scores_gemma":[0.013426533,0.0051877997,0.019743335,0.0005872943,0.00030050438,0.00021762976,0.020816514,0.60981727,0.294417,0.020987421,0.009811046,0.004687638],"about_ca_topic_score_codex":0.000009907501,"about_ca_topic_score_gemma":0.000025964437,"teacher_disagreement_score":0.9424254,"about_ca_system_score_codex":0.00004536943,"about_ca_system_score_gemma":0.00003080303,"threshold_uncertainty_score":0.6638731},"labels":[],"label_agreement":null},{"id":"W2172174005","doi":"10.1109/tit.2007.915976","title":"Broadcast in MIMO Systems Based on a Generalized QR Decomposition: Signaling and Performance Analysis","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":57,"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":"Orthogonalization; Dirty paper coding; Mathematics; QR decomposition; MIMO; Diversity gain; Interference (communication); Cumulative distribution function; Algorithm; Spectral efficiency; Upper and lower bounds; Topology (electrical circuits); Single antenna interference cancellation; Computer science; Beamforming; Precoding; Telecommunications; Combinatorics; Decoding methods; Probability density function; Statistics; Eigenvalues and eigenvectors; Channel (broadcasting); Mathematical analysis; Physics","score_opus":0.007469975098461612,"score_gpt":0.20647308531790842,"score_spread":0.1990031102194468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172174005","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.14071396,0.000040401294,0.8576357,0.0000056814574,0.00023933238,0.00026199914,0.000025677266,0.00020584467,0.0008714179],"genre_scores_gemma":[0.99746317,0.00009538983,0.0021452287,0.00006749943,0.000017361212,0.00012144894,0.000035156852,0.000016809256,0.00003792413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990053,0.00007407519,0.00047820306,0.00010809569,0.00016419667,0.00017009916],"domain_scores_gemma":[0.9995007,0.00010467275,0.00007684462,0.00019844138,0.000058827256,0.000060502385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023336809,0.00017642512,0.00022888901,0.00093002524,0.00018424899,0.000040593648,0.00006558623,0.000094436735,0.00004172222],"category_scores_gemma":[0.0000027759086,0.00018607354,0.000069174734,0.00074259925,0.000032669075,0.0009376722,4.02719e-7,0.00016987663,0.000038223123],"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.00010029317,0.000018628414,0.000046718,0.00008066317,0.000056369798,9.915377e-7,0.0006782202,0.9961246,0.00013683784,0.00009351703,0.0000065542094,0.002656589],"study_design_scores_gemma":[0.0007990067,0.000056357356,0.00015351665,0.00008174793,0.000051817093,0.000013794953,0.00014696598,0.9944817,0.003946617,0.000007714329,0.00006410943,0.00019666222],"about_ca_topic_score_codex":0.0000106250145,"about_ca_topic_score_gemma":0.0000030865463,"teacher_disagreement_score":0.85674924,"about_ca_system_score_codex":0.00015948479,"about_ca_system_score_gemma":0.000016120062,"threshold_uncertainty_score":0.75878584},"labels":[],"label_agreement":null},{"id":"W2173327270","doi":"10.1109/tit.2008.2008131","title":"Parity Forwarding for Multiple-Relay Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":33,"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":"Relay; Decodes; Computer science; Computer network; Parity (physics); Decoding methods; Telecommunications","score_opus":0.01993550998774262,"score_gpt":0.25861174214127597,"score_spread":0.23867623215353334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173327270","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.00023390459,0.000042915668,0.9957091,0.0006784078,0.0005191151,0.00037608104,0.0000055176765,0.00029435407,0.002140568],"genre_scores_gemma":[0.9825569,0.00015505089,0.014719764,0.0023189313,0.000032013355,0.00007636568,0.0000073185925,0.0000042077445,0.0001294984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907845,0.00010550188,0.0003414881,0.00012358336,0.00013259219,0.0002184013],"domain_scores_gemma":[0.99868107,0.00046405828,0.00010953952,0.00050787075,0.00016183486,0.00007564717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006851703,0.00013317178,0.00012708192,0.0001687672,0.00061681046,0.00019565808,0.00052786514,0.00007937007,0.000022291963],"category_scores_gemma":[0.000026684853,0.00012802554,0.00012904059,0.00033534758,0.000026900716,0.0018799518,0.0000029190799,0.00022587163,0.00004452989],"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.000049922215,0.000046318364,0.0000013044703,0.000003779067,0.000015957623,6.579529e-8,0.0008601482,0.16466048,0.000030409281,0.12838162,0.00047122245,0.7054787],"study_design_scores_gemma":[0.00078348257,0.00014104292,0.00010955583,0.000030380521,0.000009959081,0.000004033674,0.00006590496,0.98192626,0.0021000365,0.0040230104,0.010591653,0.00021470206],"about_ca_topic_score_codex":4.942724e-7,"about_ca_topic_score_gemma":0.0000028490638,"teacher_disagreement_score":0.98232293,"about_ca_system_score_codex":0.00006719153,"about_ca_system_score_gemma":0.00003102227,"threshold_uncertainty_score":0.52207303},"labels":[],"label_agreement":null},{"id":"W2175517595","doi":"10.1109/tit.2013.2266656","title":"Joint Optimization of the Transmit Covariance and Relay Precoder in General Gaussian Amplify-and-Forward Relay Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Relay; Covariance; Transmitter power output; Gaussian; Asymptotically optimal algorithm; Control theory (sociology); Computer science; Optimization problem; Mathematics; Precoding; Mathematical optimization; Topology (electrical circuits); MIMO; Power (physics); Beamforming; Telecommunications; Channel (broadcasting); Statistics; Transmitter; Artificial intelligence; Physics","score_opus":0.015046071366985781,"score_gpt":0.2189897081310967,"score_spread":0.20394363676411092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175517595","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.006039539,0.000056600307,0.9910077,0.0013010626,0.0002041639,0.000406391,0.0000037670504,0.000041192314,0.00093959196],"genre_scores_gemma":[0.98141384,0.0006192751,0.016940784,0.00064829685,0.000007633807,0.00009988947,0.0000017133807,0.000005455334,0.00026312986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990107,0.00022087402,0.00039702686,0.0001132725,0.00013225652,0.00012591333],"domain_scores_gemma":[0.99930674,0.00010370437,0.00013140841,0.0003233547,0.000087708824,0.00004710753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545559,0.000109672386,0.00012683126,0.00016412287,0.00021612225,0.00011587658,0.0002690492,0.00007406129,0.00007517562],"category_scores_gemma":[0.000010936997,0.00008428792,0.000038922506,0.00035538088,0.00008586946,0.0016330893,0.000008062602,0.0002340555,0.000011473963],"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.000015715264,0.000035622194,0.000008955038,0.000022731781,0.000016378954,4.3261316e-8,0.0069732135,0.85487056,0.00017073628,0.04883097,0.00006401308,0.088991076],"study_design_scores_gemma":[0.00060804316,0.000047395435,0.0012013735,0.00008930458,0.000007510105,0.000008911428,0.00014093377,0.9929386,0.0027241644,0.0016055246,0.0004756313,0.0001526574],"about_ca_topic_score_codex":0.000012582543,"about_ca_topic_score_gemma":0.000008651492,"teacher_disagreement_score":0.9753743,"about_ca_system_score_codex":0.000034086715,"about_ca_system_score_gemma":0.000033275177,"threshold_uncertainty_score":0.34371617},"labels":[],"label_agreement":null},{"id":"W2178984881","doi":"10.1109/tit.2005.856948","title":"The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"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":"Mathematics; Alphabet; Combinatorics; Universality (dynamical systems); Discrete mathematics; Countable set; Lambda; Grammar; Physics; Linguistics","score_opus":0.008000919638424399,"score_gpt":0.2201732323105906,"score_spread":0.2121723126721662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178984881","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.0028797719,0.000013505078,0.99585444,0.00026982217,0.00013103474,0.00024378175,0.000103500504,0.00008502563,0.00041915048],"genre_scores_gemma":[0.97167504,0.000014300711,0.027726375,0.00041230803,0.00001609823,0.00004631322,0.000014207225,0.0000048567267,0.0000904809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922717,0.000057076122,0.00025008302,0.00008605673,0.00023637578,0.00014322586],"domain_scores_gemma":[0.9986823,0.00054317625,0.00017397518,0.0003768887,0.00018088022,0.000042768297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052441354,0.00009880756,0.00009443491,0.00009974446,0.000441997,0.000116526295,0.00037961575,0.00004144133,0.00001043052],"category_scores_gemma":[0.000005574639,0.00006339198,0.00005468705,0.00018903527,0.00011537482,0.0017067622,0.0000021997696,0.00009103943,0.000012115561],"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.0005907377,0.00010664884,0.0000065436634,0.0000417844,0.000054744443,1.1462095e-7,0.0016725741,0.15180507,0.000049074886,0.08352174,0.0002979883,0.761853],"study_design_scores_gemma":[0.003115091,0.0007467738,0.00021639004,0.000108833214,0.000052564843,0.00000611289,0.0012863667,0.7880044,0.052941173,0.0050900816,0.14802903,0.00040319312],"about_ca_topic_score_codex":0.000016750128,"about_ca_topic_score_gemma":0.00002418235,"teacher_disagreement_score":0.9687953,"about_ca_system_score_codex":0.000035544246,"about_ca_system_score_gemma":0.00009777715,"threshold_uncertainty_score":0.33995283},"labels":[],"label_agreement":null},{"id":"W220014954","doi":"10.1109/tit.2019.2942615","title":"On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Commission","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); Upper and lower bounds; Dirty paper coding; Algorithm; Computer network; Theoretical computer science; Precoding; Mathematics; MIMO; Artificial intelligence","score_opus":0.02810047614797787,"score_gpt":0.2340389823542498,"score_spread":0.20593850620627194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W220014954","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.041861136,0.000060930317,0.9516952,0.00011819466,0.0009601839,0.00073288294,0.00012016706,0.0008395538,0.0036117642],"genre_scores_gemma":[0.9981577,0.0007971027,0.00044613198,0.00022115035,0.000017847222,0.0002534864,0.000035210833,0.000034273013,0.000037136044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879974,0.00015640189,0.0004944965,0.00015020948,0.00020616766,0.0001929536],"domain_scores_gemma":[0.9981071,0.0008149815,0.0001608628,0.0007649779,0.00009978234,0.00005231253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006034958,0.0003105688,0.00024263629,0.0004001987,0.00028453465,0.0003288318,0.00042405498,0.0002737519,0.00006384551],"category_scores_gemma":[0.000026913109,0.0002798652,0.00009907227,0.00011882883,0.000096508666,0.0007158622,0.00001759137,0.0012769012,0.00013689428],"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.00024099917,0.000099552635,0.0000055425508,0.0010046861,0.0002851328,5.761554e-7,0.019395849,0.8260026,0.0009065477,0.043634243,0.0014243413,0.10699994],"study_design_scores_gemma":[0.00043444283,0.000077064324,0.000057161193,0.0013430567,0.000049829767,0.000014315414,0.0016504299,0.9483756,0.027113168,0.0193162,0.0009200491,0.0006486878],"about_ca_topic_score_codex":0.000015345768,"about_ca_topic_score_gemma":0.000009970091,"teacher_disagreement_score":0.9562965,"about_ca_system_score_codex":0.00022592205,"about_ca_system_score_gemma":0.000023120216,"threshold_uncertainty_score":0.99996537},"labels":[],"label_agreement":null},{"id":"W2201585720","doi":"10.1109/tit.2016.2641455","title":"Additive Bounds of Minimum Output Entropies for Unital Channels and an Exact Qubit Formula","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":4,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; John Templeton Foundation","keywords":"Hermitian matrix; Upper and lower bounds; Classical capacity; Tensor product; Quantum channel; Unital; Pauli exclusion principle; Corollary; Qubit; Entropy (arrow of time)","score_opus":0.01084520098555793,"score_gpt":0.23519328669445907,"score_spread":0.22434808570890113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201585720","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.018623244,0.000006632797,0.9788558,0.0001820282,0.00046274587,0.00033071873,0.00021697413,0.00012376196,0.0011980823],"genre_scores_gemma":[0.99699885,0.000035986915,0.0023704104,0.0003387114,0.000021543232,0.00009888864,0.000011462551,0.000005597872,0.0001185554],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999005,0.000050068305,0.00042798574,0.00010667563,0.00021015444,0.00020011085],"domain_scores_gemma":[0.99888456,0.00029425797,0.00021071351,0.00028249674,0.00022647239,0.00010147377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034740526,0.00014717865,0.00014922701,0.00047538814,0.00021919227,0.000127681,0.0002722646,0.00007863751,0.000050973194],"category_scores_gemma":[0.00001505991,0.00010791578,0.00010852023,0.00022039188,0.00013716573,0.0060286284,0.0000029481503,0.00006365929,0.000031356365],"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.0002537281,0.000091823975,0.0000025030636,0.000055908553,0.00006706333,1.11992776e-7,0.010778887,0.00019998988,0.00023716882,0.46168512,0.00033634022,0.5262914],"study_design_scores_gemma":[0.0169105,0.0074954918,0.00084426434,0.0005791421,0.00017880532,0.000095455405,0.017371843,0.15442467,0.3479626,0.34681058,0.104778156,0.0025485088],"about_ca_topic_score_codex":0.0000021150388,"about_ca_topic_score_gemma":0.000001461096,"teacher_disagreement_score":0.9783756,"about_ca_system_score_codex":0.00002628888,"about_ca_system_score_gemma":0.000050103692,"threshold_uncertainty_score":0.44006777},"labels":[],"label_agreement":null},{"id":"W2202618705","doi":"10.1109/tit.2015.2401567","title":"New Constructions of Codes for Asymmetric Channels via Concatenation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"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 Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Concatenation (mathematics); Linear code; Block code; Ternary operation; Reed–Muller code; Expander code; Construct (python library); Binary number","score_opus":0.018501015907497177,"score_gpt":0.23904405395493267,"score_spread":0.2205430380474355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202618705","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.00068716827,0.000014243866,0.99510455,0.00013986047,0.0015028217,0.00029821563,0.000027303642,0.00017433798,0.002051527],"genre_scores_gemma":[0.9754482,0.000005190491,0.024172375,0.0001757691,0.000028998671,0.000050745835,0.00000648306,0.0000048011334,0.00010746763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991061,0.00007537944,0.00035725563,0.00010556954,0.00021189461,0.00014376757],"domain_scores_gemma":[0.9988221,0.0002945627,0.00015893271,0.00027506473,0.0003278823,0.00012147386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071125175,0.00011113882,0.00013774817,0.00073877804,0.000153146,0.00007557206,0.00031352733,0.00007352575,0.000020678413],"category_scores_gemma":[0.000031237025,0.00010795201,0.00012525,0.00089277845,0.00006687068,0.0017196327,0.0000019803247,0.00009273617,0.000036229943],"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.00010730127,0.00003916603,9.920683e-7,0.000017599534,0.000044078693,4.956456e-8,0.0020088593,0.01871314,0.0000615041,0.5654219,0.0003660968,0.4132193],"study_design_scores_gemma":[0.0034067621,0.000958515,0.000023103454,0.000053026542,0.00008388185,0.000048662005,0.0013210317,0.11582833,0.13478553,0.73629034,0.00671837,0.00048246334],"about_ca_topic_score_codex":0.0000097539005,"about_ca_topic_score_gemma":0.0000012925428,"teacher_disagreement_score":0.974761,"about_ca_system_score_codex":0.000040928517,"about_ca_system_score_gemma":0.00013088324,"threshold_uncertainty_score":0.44021553},"labels":[],"label_agreement":null},{"id":"W2202812032","doi":"10.1109/tit.2015.2491941","title":"Exploiting the <inline-formula> <tex-math notation=\"LaTeX\">$N$ </tex-math></inline-formula>-to-1 Mapping in Compress-and-Forward Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"Carleton University","funders":"","keywords":"Decoding methods; Algorithm; Linear network coding; Computer science; Relay; Constraint (computer-aided design); Diagonal; Notation; Relaxation (psychology); Bin; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Computer network; Network packet","score_opus":0.038691171714455956,"score_gpt":0.2660263468825533,"score_spread":0.22733517516809731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202812032","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.09953065,0.00034153255,0.8909087,0.0019464521,0.0009851365,0.0011163431,0.000037919537,0.0005505107,0.004582726],"genre_scores_gemma":[0.9818855,0.00062772445,0.014197141,0.0022892714,0.00011719183,0.00034366144,0.000054210686,0.000049851693,0.0004354389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952588,0.0005938358,0.0018048616,0.00054758205,0.0009862041,0.00080868235],"domain_scores_gemma":[0.99549186,0.0011407118,0.000631415,0.0015328118,0.0008018433,0.00040132983],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0036410075,0.00063096546,0.0005975008,0.00104758,0.0015104455,0.0008561536,0.0017211082,0.00026740102,0.00003748669],"category_scores_gemma":[0.00023725073,0.0005429317,0.00024614466,0.0019088148,0.00019064412,0.005291388,0.00012352786,0.0009786028,0.00052820286],"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.0001742816,0.0002479455,0.000033795022,0.00012097292,0.00015769199,0.0000062530085,0.067485,0.19888924,0.0020879495,0.40409034,0.0005704796,0.32613605],"study_design_scores_gemma":[0.0023211762,0.00017770425,0.0004518041,0.0005599254,0.000047986065,0.000073085066,0.0020066728,0.9447662,0.0018919241,0.0039442712,0.042807497,0.00095170125],"about_ca_topic_score_codex":0.000013442214,"about_ca_topic_score_gemma":0.00009891955,"teacher_disagreement_score":0.88235486,"about_ca_system_score_codex":0.0004520505,"about_ca_system_score_gemma":0.00028925316,"threshold_uncertainty_score":0.9997895},"labels":[],"label_agreement":null},{"id":"W2209642983","doi":"10.1109/tit.2015.2502244","title":"Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":24,"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":"Research Executive Agency; Ministero dello Sviluppo Economico; European Commission","keywords":"Decoding methods; Transmission (telecommunications); Gaussian; Channel (broadcasting); Convergence (economics); Interference (communication); Range (aeronautics); Covariance matrix; Covariance; Rate of convergence","score_opus":0.023492707347087985,"score_gpt":0.2501169766940112,"score_spread":0.2266242693469232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209642983","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.00032316742,0.00007379097,0.9918856,0.00014993428,0.0013503586,0.00070014514,0.000058502377,0.000745026,0.0047134496],"genre_scores_gemma":[0.9960733,0.000101213445,0.0030240768,0.0002376133,0.00005952942,0.00022252323,0.00003538976,0.000046038404,0.00020033283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986571,0.00009399037,0.00054040854,0.00013147343,0.0002730221,0.00030398104],"domain_scores_gemma":[0.99899596,0.0002168859,0.000104214305,0.00040200647,0.00014627517,0.00013468774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035166554,0.00027121045,0.00019470815,0.00018545667,0.00028581085,0.00013594652,0.00035593892,0.00015649869,0.00005565175],"category_scores_gemma":[0.000025884545,0.00020781583,0.000109188644,0.0004123707,0.00006984766,0.0039181607,0.000001972694,0.00033750603,0.00023544101],"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.00012136087,0.000025797133,0.000001101973,0.000051625826,0.00003765605,4.3916202e-7,0.0063121957,0.9803879,0.000112639085,0.00025282035,0.0003121466,0.012384307],"study_design_scores_gemma":[0.0016583429,0.00005781867,0.000010295255,0.0000960964,0.000035318753,0.00002132885,0.003234969,0.9740032,0.012280441,0.0014128713,0.0068247532,0.00036454436],"about_ca_topic_score_codex":0.000020363126,"about_ca_topic_score_gemma":0.000008849146,"teacher_disagreement_score":0.9957501,"about_ca_system_score_codex":0.00016563585,"about_ca_system_score_gemma":0.000036812242,"threshold_uncertainty_score":0.8474484},"labels":[],"label_agreement":null},{"id":"W2212474043","doi":"10.1109/tit.2017.2710058","title":"The MIMO Wiretap Channel Decomposed","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Toronto","funders":"Qatar National Research Fund; Israel Science Foundation; German-Israeli Foundation for Scientific Research and Development","keywords":"MIMO; Computer science; Channel (broadcasting); Channel capacity; Gaussian; Precoding; Topology (electrical circuits); Secure transmission; Transmission (telecommunications); Dirty paper coding; Coding (social sciences); Multi-user MIMO; Telecommunications; Computer network; Mathematics; Physics; Statistics; Combinatorics","score_opus":0.015344077174099914,"score_gpt":0.2497384821419171,"score_spread":0.2343944049678172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212474043","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.0012363623,0.00027363346,0.97429025,0.00035141502,0.002208985,0.0006987189,0.000170658,0.0018681983,0.018901782],"genre_scores_gemma":[0.99578184,0.002515438,0.00064899185,0.0001400001,0.000044928405,0.0005752397,0.000055371056,0.00004637226,0.000191818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985854,0.00012974771,0.0006066734,0.00012291786,0.0002950393,0.00026020475],"domain_scores_gemma":[0.99704975,0.00034004508,0.0002607385,0.0021084303,0.00016134208,0.00007969278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079515897,0.00033720257,0.0002580712,0.000267309,0.00091485365,0.0005255483,0.0014547564,0.00039999996,0.00004794857],"category_scores_gemma":[0.00001705713,0.0002972611,0.00022909036,0.00007027588,0.0001880273,0.00076277636,0.000014971431,0.0013770693,0.00030626953],"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.00017241949,0.00009116646,4.7218538e-7,0.0005928964,0.00062190316,0.0000010500572,0.010848625,0.46323466,0.00011060258,0.016608398,0.006727179,0.5009906],"study_design_scores_gemma":[0.0013801347,0.00011481984,0.00013149157,0.0012261842,0.00025703976,0.000030158983,0.0013718172,0.5840542,0.112358,0.16243757,0.13409786,0.0025407653],"about_ca_topic_score_codex":0.00001569807,"about_ca_topic_score_gemma":0.000025940095,"teacher_disagreement_score":0.99454546,"about_ca_system_score_codex":0.00018829097,"about_ca_system_score_gemma":0.00006392116,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W2237131797","doi":"10.1109/tit.2016.2616125","title":"New One Shot Quantum Protocols With Application to Communication Complexity","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"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":"Alice and Bob; Quantum entanglement; Randomness; No-teleportation theorem; Communication complexity; Quantum information science; Quantum cryptography; Quantum information; Quantum; Quantum state","score_opus":0.02807333754258406,"score_gpt":0.2720108777424362,"score_spread":0.24393754019985214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237131797","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.00083134096,0.0000015585239,0.9916629,0.003025251,0.0000691762,0.003273863,0.0000139094855,0.00040787645,0.0007141148],"genre_scores_gemma":[0.82353663,0.0000027622493,0.17302698,0.0011562816,0.00003491464,0.002060058,0.0000047253875,0.000013552902,0.00016411739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878734,0.00012308788,0.0003412962,0.00019361528,0.00033495898,0.00021967402],"domain_scores_gemma":[0.99838465,0.00019710498,0.00015834863,0.0009570292,0.00013979455,0.0001630731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044627814,0.00016353994,0.00014494912,0.00023842468,0.00034497998,0.00015465305,0.00078476925,0.000058986454,0.00004235699],"category_scores_gemma":[0.0000072024445,0.00011253935,0.000050940183,0.00047302892,0.000062854575,0.0011565827,0.000008343441,0.00016889867,0.00040072206],"study_design_candidate":"design_other","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.00014112954,0.00007722656,0.0000016583027,0.000015587379,0.000020740401,1.0379531e-7,0.001553064,0.013994732,0.00047413245,0.19434611,0.0001837022,0.7891918],"study_design_scores_gemma":[0.0067443266,0.0029584952,0.0021409553,0.0015894008,0.00005436593,0.00010634533,0.00031352934,0.49780482,0.1070987,0.32558897,0.053431954,0.0021681276],"about_ca_topic_score_codex":0.000027698898,"about_ca_topic_score_gemma":0.000012457995,"teacher_disagreement_score":0.82270527,"about_ca_system_score_codex":0.00007774784,"about_ca_system_score_gemma":0.00010174984,"threshold_uncertainty_score":0.5150605},"labels":[],"label_agreement":null},{"id":"W2261490368","doi":"10.1109/tit.2018.2865701","title":"Energy, Latency, and Reliability Tradeoffs in Coding Circuits","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"University of Toronto","funders":"","keywords":"Decoding methods; Omega; Scaling; Energy (signal processing); Combinatorics; Probability of error; Mathematics; Computation; Block (permutation group theory); Discrete mathematics; Physics; Algorithm; Quantum mechanics; Statistics; Geometry","score_opus":0.009392919158752048,"score_gpt":0.22056353697268588,"score_spread":0.21117061781393384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261490368","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.009351601,0.000035595076,0.98651606,0.0004330897,0.0015565549,0.00019485828,0.000031957752,0.0002651089,0.0016151731],"genre_scores_gemma":[0.98991066,0.000102947284,0.009175423,0.0006654606,0.000056091005,0.000039711904,0.000006743284,0.000009970067,0.00003300075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826163,0.00024258574,0.00057100086,0.0003615116,0.0002901352,0.00027316247],"domain_scores_gemma":[0.9986057,0.0003309363,0.0002018056,0.000652514,0.000114068025,0.00009495746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010747155,0.0002709681,0.0002598806,0.0004940661,0.00021757025,0.00026706333,0.0006029858,0.00027814644,0.000013228715],"category_scores_gemma":[0.000019367802,0.0002586758,0.00010602574,0.00029717688,0.00012854782,0.00079147634,0.000026368798,0.00074558286,0.00002063837],"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.000028611159,0.000103906365,0.0000032851096,0.00016249015,0.000028943601,0.0000034461286,0.008788212,0.1649702,0.000008412569,0.020764064,0.000078661,0.8050598],"study_design_scores_gemma":[0.0004358225,0.000115254,0.00020192089,0.00031213491,0.000014202789,0.00003805575,0.00009397693,0.9040337,0.0012234383,0.09180091,0.0012867902,0.00044376962],"about_ca_topic_score_codex":0.00006297382,"about_ca_topic_score_gemma":0.0000048832258,"teacher_disagreement_score":0.98055905,"about_ca_system_score_codex":0.000100057805,"about_ca_system_score_gemma":0.00012907523,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2272279111","doi":"10.1109/tit.2015.2448658","title":"Restricted Isometry Property of Random Subdictionaries","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"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":"Division of Computing and Communication Foundations","keywords":"Restricted isometry property; Block matrix; Property (philosophy); Isometry (Riemannian geometry); Matrix (chemical analysis); Coherence (philosophical gambling strategy); Row; Random matrix","score_opus":0.01640946113108891,"score_gpt":0.21075955234719673,"score_spread":0.19435009121610783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272279111","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.012687032,0.00003334566,0.9726618,0.000020261095,0.00048389466,0.00016498132,0.000021527505,0.0007043427,0.013222806],"genre_scores_gemma":[0.998741,0.000042339754,0.000984241,0.000054615542,0.000014818392,0.000022379638,0.0000063111943,0.00000962271,0.00012472116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938947,0.00003769871,0.0002685106,0.00004130098,0.00016944845,0.0000935956],"domain_scores_gemma":[0.9995129,0.00006843736,0.000045702738,0.00017377584,0.00015021699,0.000048969257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014491582,0.000094913565,0.000119929704,0.00030073835,0.00005139671,0.00002145219,0.00008074039,0.00007300273,0.000037235965],"category_scores_gemma":[0.000015335489,0.00007228292,0.000050619077,0.00028220017,0.0000527245,0.0006043343,5.4393513e-7,0.00013428465,0.000051038445],"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.0015358434,0.00015076046,0.00001374053,0.00010295985,0.00027875046,0.0000017325832,0.005590833,0.77367157,0.0040624025,0.006187924,0.017481804,0.19092171],"study_design_scores_gemma":[0.0033836875,0.0003317795,0.000119437034,0.0001565719,0.00009031961,0.000035772104,0.0019147296,0.11984009,0.834561,0.011496064,0.02755752,0.00051300525],"about_ca_topic_score_codex":0.00001152463,"about_ca_topic_score_gemma":8.855476e-7,"teacher_disagreement_score":0.98605394,"about_ca_system_score_codex":0.000045080033,"about_ca_system_score_gemma":0.00002879105,"threshold_uncertainty_score":0.29476118},"labels":[],"label_agreement":null},{"id":"W2294622949","doi":"10.1109/tit.2017.2688381","title":"Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":114,"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":"Army Research Office; Simons Foundation; American Institute of Mathematics; National Science Foundation","keywords":"Quantization (signal processing); Oversampling; Algorithm; Compressed sensing; Thresholding; Binary number; Computer science; Normalization (sociology); Signal reconstruction; Exponential function; Mathematics; Signal processing; Artificial intelligence; Bandwidth (computing); Digital signal processing; Arithmetic","score_opus":0.03830852518159136,"score_gpt":0.25052995034117015,"score_spread":0.21222142515957879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294622949","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.39136258,0.000015105376,0.6036249,0.0000057605694,0.00077618787,0.0001266032,0.000053733624,0.00014418985,0.0038909572],"genre_scores_gemma":[0.9979008,0.000023473174,0.0020132703,0.000009238775,0.00001698602,0.000011501357,0.00000517974,0.000009539134,0.00001004587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992687,0.00003583279,0.0003712827,0.00005622304,0.00017752827,0.000090449794],"domain_scores_gemma":[0.9992239,0.000040916482,0.0002147879,0.00037967975,0.00011044318,0.000030296203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018263965,0.00010542729,0.0001575954,0.00018244465,0.00012373507,0.000025573656,0.00016448715,0.00008424401,0.00016745813],"category_scores_gemma":[0.0000064092314,0.00010901736,0.00008780955,0.00004086491,0.000095424715,0.00087802176,0.000001289739,0.00010197047,0.00002127722],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00047552862,0.0001087749,0.00006548838,0.00008158782,0.00039783726,7.642415e-7,0.0016787511,0.18515627,0.47647762,0.00030993513,0.00031556457,0.33493185],"study_design_scores_gemma":[0.00031153922,0.000044028846,0.00034638707,0.00015626871,0.000041959967,0.0000023535401,0.00013545809,0.0074666655,0.9901824,0.0011662854,0.000043254353,0.00010341944],"about_ca_topic_score_codex":0.00004155771,"about_ca_topic_score_gemma":0.000004467489,"teacher_disagreement_score":0.6065382,"about_ca_system_score_codex":0.000026305534,"about_ca_system_score_gemma":0.000014380552,"threshold_uncertainty_score":0.4445599},"labels":[],"label_agreement":null},{"id":"W2299446443","doi":"10.1109/tit.2016.2523979","title":"Efficient Search of Girth-Optimal QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":77,"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; Girth (graph theory); Mathematics; Tanner graph; Block code; Concatenated error correction code; Combinatorics; Discrete mathematics; Block (permutation group theory); Upper and lower bounds; Linear code; Decoding methods; Algorithm","score_opus":0.011629056580062485,"score_gpt":0.24846695922497924,"score_spread":0.23683790264491675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299446443","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.03879605,0.0000040990794,0.95739764,0.00020022862,0.00040934386,0.00019839001,0.000021388292,0.00049402105,0.0024788196],"genre_scores_gemma":[0.9795384,0.00000802049,0.020103589,0.0001114723,0.000008510087,0.000031396376,4.870152e-7,0.0000065135932,0.00019162649],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987284,0.00013506932,0.00039498755,0.00013888233,0.00038415534,0.00021851732],"domain_scores_gemma":[0.9986053,0.00044037914,0.00013170383,0.0005366064,0.00022023082,0.00006578312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095184013,0.00012892544,0.00013733073,0.00042238485,0.00014455392,0.00004654984,0.0005553697,0.00007852252,0.0000818784],"category_scores_gemma":[0.000023090444,0.000095033705,0.00010191261,0.00037281675,0.00011327472,0.0007374388,0.000005904138,0.00015218764,0.00022944476],"study_design_candidate":"bench_or_experimental","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.00018922705,0.00023345489,0.000012093911,0.000071665505,0.000054611206,0.0000011510481,0.008250663,0.07547378,0.009380896,0.109568484,0.0002577252,0.7965062],"study_design_scores_gemma":[0.00064910844,0.00038623554,0.00013785508,0.00018399039,0.000012756222,0.000026616595,0.00034741563,0.08355824,0.9113414,0.002509744,0.0005264143,0.0003201884],"about_ca_topic_score_codex":0.000010811034,"about_ca_topic_score_gemma":0.000001739818,"teacher_disagreement_score":0.9407423,"about_ca_system_score_codex":0.000091405826,"about_ca_system_score_gemma":0.00008268187,"threshold_uncertainty_score":0.3875362},"labels":[],"label_agreement":null},{"id":"W2308615846","doi":"10.1109/tit.2019.2906374","title":"T-Count Optimization and Reed–Muller Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Upper and lower bounds; Controlled NOT gate; Quantum gate; Power of two; Sequential decoding; Integer (computer science)","score_opus":0.004116110082280556,"score_gpt":0.1944803577710045,"score_spread":0.19036424768872395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308615846","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.011222727,0.000011070944,0.98583174,0.0002357059,0.00060336624,0.00016922742,0.0000067668,0.0001913093,0.0017280694],"genre_scores_gemma":[0.95624304,0.000022294309,0.042566516,0.00087403925,0.00001850888,0.000011066486,0.0000033890835,0.000006281898,0.00025487907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929386,0.0000549984,0.00020502233,0.00012766792,0.00018013692,0.00013829004],"domain_scores_gemma":[0.9994033,0.00012704574,0.0000775996,0.0002791503,0.00006260469,0.000050273822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031709322,0.000109537075,0.00009619038,0.00019356085,0.00017738188,0.0001769743,0.00020710082,0.00005734677,0.000069129026],"category_scores_gemma":[0.0000034732013,0.00009514352,0.00003965968,0.00020649754,0.000030171672,0.0010625445,0.00000334614,0.00016191309,0.00017498768],"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.000013515899,0.000015717129,0.0000021539456,0.000015789816,0.000011274497,1.6845868e-7,0.0013497875,0.88307863,0.00001907326,0.01453369,0.000036941343,0.10092324],"study_design_scores_gemma":[0.00033284535,0.00008717475,0.00005055742,0.00002664577,0.00000401127,0.00001768593,0.000086543376,0.99505,0.0010593251,0.0020028225,0.0011467108,0.00013566331],"about_ca_topic_score_codex":0.000004522134,"about_ca_topic_score_gemma":3.7616115e-7,"teacher_disagreement_score":0.9450203,"about_ca_system_score_codex":0.00002207907,"about_ca_system_score_gemma":0.000027321277,"threshold_uncertainty_score":0.38798404},"labels":[],"label_agreement":null},{"id":"W2331758476","doi":"10.1109/tit.2016.2549541","title":"Signaling Over Two-User Parallel Gaussian Interference Channels: Outage Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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 Waterloo","funders":"","keywords":"Interference (communication); Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Topology (electrical circuits); Fading; Decoding methods; Gaussian; Gaussian noise; Random variable; Signal-to-interference-plus-noise ratio; Noise (video); Statistics; Mathematics; Computer science; Physics; Telecommunications; Combinatorics; Artificial intelligence","score_opus":0.011325656484158807,"score_gpt":0.24767207146870363,"score_spread":0.2363464149845448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331758476","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.012500283,0.000015494004,0.98251843,0.00009529811,0.0002146471,0.00016773082,0.00005660296,0.0010032085,0.0034283225],"genre_scores_gemma":[0.9975665,0.00010999582,0.001790059,0.00015913347,0.000016320031,0.00012592568,0.000010086501,0.00001914788,0.00020278532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998961,0.00009012973,0.00046016768,0.00009893797,0.00018566406,0.00020410422],"domain_scores_gemma":[0.99898374,0.00020892757,0.00008490169,0.0005735675,0.00007086946,0.00007798662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036525924,0.00018835305,0.00019849108,0.00068606116,0.0001210627,0.00008671662,0.0003469885,0.000102387174,0.000911008],"category_scores_gemma":[0.000007178318,0.00015273898,0.00016834844,0.0004848646,0.00006264578,0.0015573715,0.00000270502,0.00022205838,0.0003050331],"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.00024074555,0.00015064878,0.000049557046,0.00012678113,0.0017760247,0.0000014995278,0.012320283,0.69281733,0.008346981,0.058057435,0.00071290834,0.22539982],"study_design_scores_gemma":[0.004697302,0.0003045491,0.00048329492,0.0008801699,0.0011517457,0.000017960832,0.0029247971,0.3226531,0.61134225,0.026189268,0.026220098,0.0031354544],"about_ca_topic_score_codex":0.0000092114005,"about_ca_topic_score_gemma":0.0000138239675,"teacher_disagreement_score":0.98506624,"about_ca_system_score_codex":0.00012548229,"about_ca_system_score_gemma":0.000012180804,"threshold_uncertainty_score":0.99748987},"labels":[],"label_agreement":null},{"id":"W2339007906","doi":"10.1109/tit.2016.2553147","title":"Arbitrarily Tight Bounds on Differential Entropy of Gaussian Mixtures","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":29,"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":"Differential entropy; Gaussian; Upper and lower bounds; Mathematics; Entropy (arrow of time); Sequence (biology); Information theory; Gaussian process; Amplitude; Algorithm; Statistical physics; Applied mathematics; Mathematical analysis; Principle of maximum entropy; Maximum entropy probability distribution; Physics; Statistics; Quantum mechanics","score_opus":0.007034788668061615,"score_gpt":0.22466821346675284,"score_spread":0.21763342479869122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339007906","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.0061082896,0.000002566955,0.9849981,0.000746034,0.0004529113,0.00018335388,0.000027245584,0.00032662507,0.007154884],"genre_scores_gemma":[0.9956514,0.000017673758,0.0030345595,0.00084364513,0.00001961157,0.000038054164,0.0000025305367,0.0000066764383,0.00038584776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99879724,0.0001446143,0.000407114,0.00013432486,0.00034994783,0.00016673405],"domain_scores_gemma":[0.99896383,0.00020368178,0.00019212316,0.00048086245,0.00008992686,0.000069573405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027466935,0.00015111463,0.0001439059,0.00041658554,0.00013665578,0.00010556426,0.0004318634,0.00010858507,0.00022481683],"category_scores_gemma":[0.000009503793,0.00010254681,0.00012329764,0.00021110244,0.00009057698,0.0016763663,0.0000024839599,0.00015701291,0.00018542299],"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.00015551048,0.0001348863,0.0000011353021,0.000013715545,0.000036728856,3.122776e-7,0.0019057132,0.00017905679,0.0063262084,0.8912531,0.00052047253,0.099473156],"study_design_scores_gemma":[0.0009936243,0.00045590548,0.00019656871,0.00009717597,0.000014643513,0.000006978536,0.000042099015,0.0015868951,0.92561346,0.06565511,0.005062535,0.00027502512],"about_ca_topic_score_codex":0.0000034586992,"about_ca_topic_score_gemma":0.0000012629478,"teacher_disagreement_score":0.98954314,"about_ca_system_score_codex":0.00005300068,"about_ca_system_score_gemma":0.00006571689,"threshold_uncertainty_score":0.41817376},"labels":[],"label_agreement":null},{"id":"W2340260419","doi":"10.1109/tit.2016.2555949","title":"Convolutional Codes With Maximum Column Sum Rank for Network Streaming","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"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":"Hamming(7,4); Hamming distance; Column (typography); Convolutional code; Mathematics; Diagonal; Rank (graph theory); Linear code; Discrete mathematics; Block code; Computer science; Algorithm; Combinatorics; Decoding methods","score_opus":0.01632930772736306,"score_gpt":0.23528945024017728,"score_spread":0.2189601425128142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340260419","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.00061152794,0.000032474283,0.99592996,0.00088204694,0.00036312526,0.00035167887,0.000035534904,0.00020903986,0.0015846165],"genre_scores_gemma":[0.9792052,0.00015168064,0.018888103,0.0008340319,0.000047987312,0.0002340993,0.000008671765,0.000008756744,0.00062145136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901295,0.000120617675,0.00029837945,0.00013545206,0.00018850798,0.0002441082],"domain_scores_gemma":[0.9983595,0.00073477376,0.00012736917,0.0004316122,0.00027410965,0.000072647315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005702808,0.00013727776,0.00012964841,0.000120301724,0.0006095022,0.00012690418,0.00043715985,0.000055791344,0.00010094821],"category_scores_gemma":[0.000012188037,0.00009806784,0.00006924442,0.00029133185,0.00010347678,0.001704564,0.0000045616953,0.00010225779,0.000085173044],"study_design_candidate":"design_other","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.00028601088,0.00006109428,0.000020298789,0.000016659636,0.00008159978,2.1526849e-7,0.00069960806,0.01641766,0.00015187482,0.38821477,0.001330093,0.59272015],"study_design_scores_gemma":[0.025659645,0.002416688,0.0034716548,0.0020804352,0.00022800587,0.00016168786,0.0012504611,0.47137088,0.031869255,0.15021165,0.30743638,0.0038432672],"about_ca_topic_score_codex":0.000001068211,"about_ca_topic_score_gemma":0.000015307673,"teacher_disagreement_score":0.9785937,"about_ca_system_score_codex":0.000095443145,"about_ca_system_score_gemma":0.00010500215,"threshold_uncertainty_score":0.46878594},"labels":[],"label_agreement":null},{"id":"W2467251259","doi":"10.1109/tit.2017.2692215","title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Markov process; Aperiodic graph; Markov model; Mathematical optimization; Applied mathematics; Combinatorics; Statistics","score_opus":0.014241607280895673,"score_gpt":0.24529759658405986,"score_spread":0.23105598930316418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467251259","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.025320685,0.00021446554,0.96610284,0.0000324042,0.00033039565,0.0004311798,0.0006441052,0.0005616715,0.006362282],"genre_scores_gemma":[0.9849464,0.00187191,0.012673354,0.00006728186,0.000013246959,0.00018556324,0.00013039443,0.00003484674,0.00007698886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00011636917,0.00067465747,0.000129071,0.00026256597,0.00016437983],"domain_scores_gemma":[0.997972,0.0005213204,0.0003530234,0.0009022909,0.00018147519,0.000069857924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065313926,0.00028591568,0.00034304033,0.000516536,0.00025975646,0.00014079172,0.00050596206,0.00033659153,0.00008476138],"category_scores_gemma":[0.00002669197,0.0003259007,0.00012091956,0.00006558629,0.00022283586,0.0009315909,0.000018427309,0.00078808126,0.000017795372],"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.000100937476,0.00003970111,0.0000025272104,0.0011068493,0.00021809038,5.275785e-7,0.009704026,0.92996114,0.00011581463,0.0028935184,0.00031879023,0.055538077],"study_design_scores_gemma":[0.0018214278,0.00020170303,0.00029741763,0.0031564224,0.00040643493,0.000048111142,0.0037998336,0.8101599,0.137702,0.035209265,0.0049707065,0.0022267245],"about_ca_topic_score_codex":0.000019206924,"about_ca_topic_score_gemma":0.0000042078927,"teacher_disagreement_score":0.9596257,"about_ca_system_score_codex":0.00009265559,"about_ca_system_score_gemma":0.000063290005,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W2518633271","doi":"10.1109/tit.2016.2595778","title":"The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"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 Victoria","funders":"University of Victoria","keywords":"Cayley graph; Ramanujan's sum; Modulo; Abelian group; Conjecture; Ring of integers; Vertex-transitive graph; Prime number; Gaussian integer","score_opus":0.007879767939820391,"score_gpt":0.2004266449231333,"score_spread":0.1925468769833129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518633271","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.045202393,0.000030770003,0.9514991,0.00069738535,0.00063419895,0.00028291997,0.000043483782,0.00054362306,0.0010660951],"genre_scores_gemma":[0.99881446,0.00008904833,0.00020785465,0.00057330757,0.000011022275,0.00010588865,0.0000022295276,0.000011386184,0.00018480694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821675,0.000402132,0.0003777967,0.00020977938,0.00041132324,0.00038220588],"domain_scores_gemma":[0.99741447,0.0013057773,0.00028221324,0.00071577885,0.00017068753,0.00011108672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014012954,0.0002454837,0.00018617397,0.0004071144,0.0011785176,0.00031297255,0.0007909596,0.00010616953,0.000033035307],"category_scores_gemma":[0.000036881505,0.0001351235,0.00021516214,0.0007939925,0.00032068175,0.002844074,0.0000044258686,0.00024527204,0.00012652784],"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.0002782014,0.00014208036,0.000057552257,0.000010276378,0.00021489045,0.0000016036826,0.0015911441,0.00038323578,0.00016330431,0.8515061,0.00020869754,0.1454429],"study_design_scores_gemma":[0.0035134633,0.0014154348,0.0025459179,0.00051424897,0.00012959931,0.00004160564,0.0015256199,0.001710265,0.028979825,0.95557564,0.002888142,0.0011602265],"about_ca_topic_score_codex":0.0000045936945,"about_ca_topic_score_gemma":0.000030319368,"teacher_disagreement_score":0.9536121,"about_ca_system_score_codex":0.000061564235,"about_ca_system_score_gemma":0.00005603846,"threshold_uncertainty_score":0.90643233},"labels":[],"label_agreement":null},{"id":"W2521520100","doi":"10.1109/tit.2016.2613113","title":"New Characterization and Efficient Exhaustive Search Algorithm for Leafless Elementary Trapping Sets of Variable-Regular LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"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":"Huawei Technologies","keywords":"Characterization (materials science); Algorithm; Tanner graph; Mathematics; Simple (philosophy); Low-density parity-check code; Multiplicity (mathematics); Graph theory; Graph; Data structure; Combinatorics; Discrete mathematics; Decoding methods; Computer science; Error floor","score_opus":0.011586395829305646,"score_gpt":0.24724546566781472,"score_spread":0.23565906983850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521520100","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.007767884,0.0000045806105,0.99079615,0.00015119731,0.00031210022,0.00056672277,0.000103416336,0.00022769351,0.00007025857],"genre_scores_gemma":[0.7268658,0.000028252329,0.27253586,0.00020386252,0.000025196347,0.00011517125,0.00001905962,0.000014818766,0.00019192426],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989292,0.00007405873,0.00038621962,0.00017136129,0.00024206063,0.00019712627],"domain_scores_gemma":[0.99900115,0.00028723883,0.0001664583,0.00027239835,0.0002019451,0.00007083476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806437,0.00013930786,0.0001555362,0.00035014114,0.00017757347,0.0000567548,0.00026404197,0.000074892065,0.000024807368],"category_scores_gemma":[0.000008452703,0.00011556479,0.000052790747,0.00028830828,0.000055845176,0.0012252883,0.0000055627133,0.000089590416,0.0000054368884],"study_design_candidate":"design_other","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.000048988422,0.00003507805,0.0000023425048,0.000043371387,0.000031563246,9.445194e-8,0.002332741,0.0008878891,0.012291745,0.009204837,0.000022773454,0.97509855],"study_design_scores_gemma":[0.0013785627,0.00041027064,0.00020910044,0.00036290108,0.00003793874,0.000017114355,0.00053356955,0.24666955,0.7459349,0.0036762562,0.00042927038,0.00034054666],"about_ca_topic_score_codex":0.000015799893,"about_ca_topic_score_gemma":7.9732825e-7,"teacher_disagreement_score":0.974758,"about_ca_system_score_codex":0.00008314549,"about_ca_system_score_gemma":0.000099202516,"threshold_uncertainty_score":0.47125953},"labels":[],"label_agreement":null},{"id":"W2525693147","doi":"10.1109/tit.2016.2613988","title":"On Base Field of Linear Network Coding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Coset; Multicast; Linear network coding; Multiplicative function; Finite field; Base (topology); Algebraic number; Topology (electrical circuits)","score_opus":0.018813647294524616,"score_gpt":0.2582966965281903,"score_spread":0.2394830492336657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525693147","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.0009343212,0.000009987636,0.991667,0.0008920982,0.00043212308,0.000107219974,0.000004450626,0.00010673371,0.0058460925],"genre_scores_gemma":[0.99437135,0.00019698797,0.0034206808,0.0017039946,0.000022128686,0.000018595983,6.8080374e-7,0.0000035871856,0.0002619749],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991973,0.00013644695,0.00029710965,0.00008294007,0.00015430484,0.00013192189],"domain_scores_gemma":[0.99819964,0.0010116262,0.000114169365,0.00051567296,0.00011103128,0.000047880192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954921,0.0000904829,0.00009822072,0.00014244246,0.00023116959,0.000029184008,0.00041055947,0.000048738402,0.00025011087],"category_scores_gemma":[0.000034548044,0.00006544354,0.00006770128,0.00029863894,0.00003276854,0.00092701474,0.0000047124795,0.00012256592,0.00020085498],"study_design_candidate":"bench_or_experimental","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.000068983616,0.000036724512,0.0000014221309,0.0000066237358,0.000016318452,1.5409333e-7,0.00065324485,0.012694254,0.00027511042,0.45657873,0.0009973275,0.5286711],"study_design_scores_gemma":[0.0056140707,0.002276665,0.00020987699,0.0019218574,0.000052728657,0.000023226796,0.0003215778,0.32001272,0.5508206,0.076870546,0.040369965,0.0015061914],"about_ca_topic_score_codex":6.21916e-7,"about_ca_topic_score_gemma":0.0000017300212,"teacher_disagreement_score":0.99343705,"about_ca_system_score_codex":0.000033268185,"about_ca_system_score_gemma":0.000032441367,"threshold_uncertainty_score":0.27385387},"labels":[],"label_agreement":null},{"id":"W2535290256","doi":"10.1109/tit.2018.2823326","title":"Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"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":"Danmarks Frie Forskningsfond; University of Toronto","keywords":"Finite field; Secret sharing; Mathematics; Algebraic number; Algebraic geometry; Construct (python library); Computer science; Discrete mathematics; Field (mathematics); Theoretical computer science; Topology (electrical circuits); Cryptography; Algorithm; Geometry; Combinatorics; Computer network; Pure mathematics","score_opus":0.008154257861510495,"score_gpt":0.22425740015464313,"score_spread":0.21610314229313263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535290256","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.090727575,0.000017644998,0.90556276,0.00014557638,0.00021566286,0.00016453276,0.000016576894,0.00024666905,0.0029030256],"genre_scores_gemma":[0.99496764,0.000008661603,0.0042828294,0.0006587469,0.000015592623,0.000030816977,0.0000074730856,0.0000066084117,0.000021632004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898887,0.00012944096,0.00026490202,0.0001777259,0.00024764458,0.00019139612],"domain_scores_gemma":[0.9986648,0.00030355845,0.00011857577,0.0007181684,0.00011415195,0.00008075334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089568814,0.00015671526,0.00011428515,0.000540826,0.00062343455,0.0002544004,0.00053960306,0.00008236689,0.000105262516],"category_scores_gemma":[0.000014346036,0.00014922823,0.000073871815,0.00056852313,0.00019142512,0.00088562566,0.000008784802,0.0002475781,0.000095383955],"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.0002573702,0.00017422663,0.00002396297,0.00005173934,0.000049357757,2.712459e-7,0.004231348,0.028493496,0.00010906047,0.85608834,0.00006326522,0.11045755],"study_design_scores_gemma":[0.0013624383,0.000701443,0.0004735628,0.0002683622,0.000035440626,0.000009667768,0.0007877651,0.93202627,0.025500085,0.035883147,0.0024279363,0.00052386563],"about_ca_topic_score_codex":0.000002512649,"about_ca_topic_score_gemma":0.0000019979207,"teacher_disagreement_score":0.9042401,"about_ca_system_score_codex":0.00003857692,"about_ca_system_score_gemma":0.00003005463,"threshold_uncertainty_score":0.60853505},"labels":[],"label_agreement":null},{"id":"W2564674459","doi":"10.1109/tit.2019.2932255","title":"Testing Ising Models","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Bayesian Modeling and Causal Inference","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 Waterloo","funders":"Office of Naval Research; Microsoft Research; National Science Foundation","keywords":"Ising model; Curse of dimensionality; Goodness of fit; Markov chain; Independence (probability theory); Mathematics; Statistical physics; Multivariate statistics; Bounding overwatch; Applied mathematics; Computer science; Econometrics; Statistics; Artificial intelligence; Physics","score_opus":0.04918319522837164,"score_gpt":0.2626929005692624,"score_spread":0.21350970534089078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564674459","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.0006311987,0.000015987189,0.9801971,0.00011429942,0.0019191288,0.00021943393,0.000031795924,0.0007528248,0.01611823],"genre_scores_gemma":[0.89567673,0.00001311014,0.10319617,0.00083717826,0.00007468759,0.0000665193,0.0000071423697,0.00001404174,0.00011443525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983087,0.00013038567,0.0005743688,0.0003071571,0.00038299084,0.00029638814],"domain_scores_gemma":[0.9980516,0.00022418433,0.000289611,0.0009080955,0.000413046,0.000113449634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008143033,0.00029580452,0.0002224074,0.00040340613,0.0003709822,0.0006322701,0.0010049919,0.00030751035,0.000032482872],"category_scores_gemma":[0.00001924364,0.0002972967,0.00013420105,0.00031127202,0.000082855695,0.0024377801,0.000021129881,0.00080139097,0.00044570965],"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.000016624706,0.000037564798,1.4043034e-7,0.00008194171,0.000035992096,6.604109e-7,0.002576915,0.6341337,0.000022293665,0.04626183,0.0001791428,0.3166532],"study_design_scores_gemma":[0.00009958585,0.000044684733,0.0000019732902,0.00020713992,0.000014259153,0.000009342119,0.000036731755,0.7181271,0.001823203,0.27931175,0.000059729075,0.00026454803],"about_ca_topic_score_codex":0.000022138442,"about_ca_topic_score_gemma":7.9692205e-7,"teacher_disagreement_score":0.8950455,"about_ca_system_score_codex":0.00011497167,"about_ca_system_score_gemma":0.0002869899,"threshold_uncertainty_score":0.9999479},"labels":[],"label_agreement":null},{"id":"W2568383335","doi":"10.1109/tit.2012.2218215","title":"On the Capacity of the $K$-User Cyclic Gaussian Interference Channel","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":39,"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":"Interference (communication); Gaussian; Channel (broadcasting); Computer science; Topology (electrical circuits); Algorithm; Combinatorics; Mathematics; Physics; Telecommunications","score_opus":0.01632402139219326,"score_gpt":0.21589665316033885,"score_spread":0.19957263176814558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568383335","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.10821981,0.000015397058,0.87255955,0.00035423605,0.0005637843,0.0003567669,0.00004791545,0.00036313184,0.017519418],"genre_scores_gemma":[0.99937993,0.000037611193,0.00009155064,0.00033135654,0.000010658315,0.00009977785,0.0000013492208,0.000010828388,0.00003692961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992579,0.00012271391,0.0002792127,0.000034036715,0.00016002284,0.00014606814],"domain_scores_gemma":[0.998931,0.0002705345,0.000078858946,0.0006419645,0.000042487918,0.00003514035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044197604,0.000116166746,0.000090175454,0.00011166678,0.00015917212,0.000022341672,0.0004341611,0.00007776355,0.00014289346],"category_scores_gemma":[0.000015903364,0.00007342372,0.00008377886,0.00020860016,0.000111776855,0.0006696949,0.0000028584986,0.0003952131,0.00011075217],"study_design_candidate":"bench_or_experimental","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.0000974474,0.0002788923,0.00001708185,0.00017932469,0.00017878892,2.6312874e-8,0.04384579,0.04790402,0.003162696,0.8740355,0.0024258383,0.027874643],"study_design_scores_gemma":[0.00032771548,0.000071590664,0.0010571792,0.00029471904,0.00004238178,0.000008778127,0.0021376247,0.011862211,0.95981973,0.018432878,0.0055362647,0.00040894514],"about_ca_topic_score_codex":0.0000070743627,"about_ca_topic_score_gemma":0.000004798313,"teacher_disagreement_score":0.956657,"about_ca_system_score_codex":0.000063281535,"about_ca_system_score_gemma":0.0000075619832,"threshold_uncertainty_score":0.29941323},"labels":[],"label_agreement":null},{"id":"W2569741146","doi":"10.1109/tit.2013.2274264","title":"An Algebraic Approach to Physical-Layer Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":234,"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":"Linear network coding; Decoding methods; Algebraic number; Computer science; Theoretical computer science; Coding (social sciences); Relay; Gaussian; Lattice (music); Encoding (memory); Mathematics; Algorithm; Topology (electrical circuits); Computer network; Artificial intelligence","score_opus":0.0224123968946915,"score_gpt":0.25542126826280737,"score_spread":0.23300887136811588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569741146","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.0040255385,0.000006819737,0.97979075,0.0003004031,0.00029131607,0.00041486978,0.0000018080841,0.0003330827,0.014835438],"genre_scores_gemma":[0.9762765,0.0000221144,0.020107538,0.0031402996,0.000061780585,0.00024162437,0.0000049642827,0.000008057861,0.00013708911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891144,0.00018150987,0.00027189357,0.00016476656,0.00021064446,0.00025972284],"domain_scores_gemma":[0.99863213,0.00015096142,0.0000756325,0.0008004766,0.00017008609,0.00017068654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040618412,0.00015457788,0.00013530916,0.00017820376,0.0005183918,0.0004139144,0.00082730316,0.000047797203,0.00009796574],"category_scores_gemma":[0.0000059552463,0.00014194839,0.00006999894,0.00069931545,0.000033060904,0.0036354824,0.000007755749,0.00023898538,0.0012802808],"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.000010817676,0.00013043155,0.0000010290493,0.000007054503,0.000021620577,4.3654186e-8,0.0065685497,0.16478722,0.00042994443,0.4007551,0.0014908103,0.42579737],"study_design_scores_gemma":[0.00038369585,0.00016262723,0.0002982661,0.000034074124,0.000009744941,0.0000059996687,0.00035309556,0.9779976,0.004647646,0.011810026,0.0038705592,0.00042665558],"about_ca_topic_score_codex":0.0000029465923,"about_ca_topic_score_gemma":9.895801e-7,"teacher_disagreement_score":0.972251,"about_ca_system_score_codex":0.000056935474,"about_ca_system_score_gemma":0.000031408366,"threshold_uncertainty_score":0.99949735},"labels":[],"label_agreement":null},{"id":"W2574730918","doi":"10.1109/tit.2017.2784839","title":"On Short Cycle Enumeration in Biregular Bipartite Graphs","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":16,"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":"Bipartite graph; Combinatorics; Mathematics; Girth (graph theory); Odd graph; Tanner graph; Discrete mathematics; Complete bipartite graph; Low-density parity-check code; Probability of error; Dense graph; Enumeration; Chordal graph; Graph; 1-planar graph; Decoding methods; Algorithm; Error floor","score_opus":0.011482672351554502,"score_gpt":0.25786941242606776,"score_spread":0.24638674007451325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574730918","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.055794384,0.000002541029,0.9366357,0.00024267993,0.0007766433,0.00024436787,0.0000044117846,0.00046095875,0.0058383206],"genre_scores_gemma":[0.99625415,0.000009303487,0.0031615251,0.00038687797,0.000009156405,0.000090902,0.0000017894804,0.000007681863,0.00007863428],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989277,0.0000930828,0.00033599776,0.00016941696,0.00027589872,0.0001978958],"domain_scores_gemma":[0.9986233,0.00011952506,0.00013750473,0.0009947517,0.00007086453,0.00005402701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076578325,0.00014495605,0.00012001959,0.0005375122,0.00055280974,0.00037745145,0.00070377294,0.00009642324,0.000022669901],"category_scores_gemma":[0.000037854967,0.00014564718,0.000080553036,0.00020417469,0.000061351326,0.003735803,0.0000044613043,0.0002714232,0.00018986413],"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.00011643537,0.00019754046,0.00008843003,0.000026176629,0.000024978359,0.0000040868945,0.004334872,0.030403048,0.00079990015,0.33789694,0.00023861094,0.625869],"study_design_scores_gemma":[0.001133371,0.00062978506,0.004338096,0.00033403674,0.00002202052,0.000031315652,0.00021302991,0.30012345,0.38253337,0.30828354,0.0013678148,0.0009901657],"about_ca_topic_score_codex":0.000034847504,"about_ca_topic_score_gemma":0.00004268042,"teacher_disagreement_score":0.9404597,"about_ca_system_score_codex":0.000086976186,"about_ca_system_score_gemma":0.000036572044,"threshold_uncertainty_score":0.593932},"labels":[],"label_agreement":null},{"id":"W2579410364","doi":"10.1109/tit.2018.2805906","title":"On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":60,"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; Bipartite graph; Degree distribution; Poisson distribution; Random graph; Discrete mathematics; Combinatorics; Degree (music); Graph; Decoding methods; Algorithm; Statistics; Physics","score_opus":0.00874073550674255,"score_gpt":0.23439110394418125,"score_spread":0.2256503684374387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579410364","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.05820962,0.000018864976,0.93721783,0.0005425315,0.00050161796,0.0019128544,0.00008295129,0.00058416906,0.0009295508],"genre_scores_gemma":[0.99690783,0.000026717616,0.0017631919,0.0005689162,0.000028151955,0.00063864124,0.000015155161,0.000016821417,0.00003455364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736756,0.0006622732,0.00079117104,0.00029536372,0.0005403682,0.00034324196],"domain_scores_gemma":[0.9961262,0.002109676,0.00046271124,0.00084505853,0.0003544464,0.00010195919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024436763,0.00032728256,0.00038779186,0.00047736507,0.0007316532,0.00019385773,0.0006408879,0.00017216509,0.000045114393],"category_scores_gemma":[0.00017441576,0.00023889335,0.00028155037,0.0008768158,0.0005216557,0.0012023379,0.000007606259,0.00039160455,0.00004123993],"study_design_candidate":"bench_or_experimental","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.05289158,0.0031299607,0.00020726639,0.0008262964,0.0009872401,0.0000069461216,0.029643418,0.026678888,0.013068065,0.35341778,0.0075328224,0.51160973],"study_design_scores_gemma":[0.025532046,0.002164035,0.00025636368,0.0006684807,0.00018074579,0.000043425385,0.0007356708,0.14925437,0.7364474,0.08111392,0.0025497626,0.0010537687],"about_ca_topic_score_codex":0.000047729176,"about_ca_topic_score_gemma":0.000036266283,"teacher_disagreement_score":0.93869823,"about_ca_system_score_codex":0.000061732695,"about_ca_system_score_gemma":0.00009653202,"threshold_uncertainty_score":0.9741788},"labels":[],"label_agreement":null},{"id":"W2590834615","doi":"10.1109/tit.2017.2780233","title":"Some Results on the Existence of $t$ -All-or-Nothing Transforms Over Arbitrary Alphabets","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Tuple; Integer (computer science); Mathematics; Bijection; Nothing; Alphabet; Combinatorics; Discrete mathematics; Literal (mathematical logic); Algorithm; Computer science","score_opus":0.03565162858536676,"score_gpt":0.2716290594767765,"score_spread":0.23597743089140977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590834615","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.0104576135,0.000050156512,0.9715892,0.0015616098,0.0027312518,0.0007975145,0.00031991422,0.0003514225,0.012141314],"genre_scores_gemma":[0.99482024,0.00030778087,0.0016033746,0.0027172472,0.000086834305,0.00015633543,0.000017099697,0.000020130135,0.00027096822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733984,0.00026730308,0.0009541323,0.0003854815,0.00069912797,0.00035413034],"domain_scores_gemma":[0.99560416,0.001074334,0.0008119084,0.0022775962,0.0001261831,0.00010579605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002270412,0.00042983476,0.0003894366,0.000577831,0.00068483356,0.00047909815,0.0026403181,0.00034791956,0.00005695336],"category_scores_gemma":[0.00005298234,0.00028789265,0.0005223145,0.00022495273,0.00030990227,0.0027494417,0.000024674226,0.0013490529,0.00007473998],"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.0018371758,0.00022465925,2.7564434e-7,0.00029782837,0.00032209564,0.00000490573,0.02669823,0.011811134,0.00006883512,0.787976,0.0002663275,0.17049249],"study_design_scores_gemma":[0.0020286397,0.0007797889,0.00012041711,0.0019576475,0.00015683445,0.000026706497,0.00084829784,0.01811285,0.045542635,0.92215896,0.0070527857,0.0012144155],"about_ca_topic_score_codex":0.000018768911,"about_ca_topic_score_gemma":0.000003974733,"teacher_disagreement_score":0.9843626,"about_ca_system_score_codex":0.00007068651,"about_ca_system_score_gemma":0.00022048254,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W2606965020","doi":"10.1109/tit.2017.2694013","title":"Hammerstein System Identification With the Nearest Neighbor Algorithm","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Control Systems and Identification","field":"Engineering","cited_by":20,"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 Manitoba","funders":"","keywords":"Mathematics; Nonlinear system; Nonparametric statistics; k-nearest neighbors algorithm; A priori and a posteriori; Cascade; Algorithm; Convergence (economics); Rate of convergence; Impulse response; Applied mathematics; Control theory (sociology); Mathematical optimization; Computer science; Statistics; Artificial intelligence; Mathematical analysis","score_opus":0.004999165672656964,"score_gpt":0.18449934738332363,"score_spread":0.17950018171066667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606965020","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.0042984644,0.000020777085,0.98888826,0.00018564581,0.0011467601,0.00043533058,0.00004752112,0.00030085334,0.004676382],"genre_scores_gemma":[0.9989712,0.000009978097,0.000096625474,0.000027309572,0.0000615571,0.00019958793,0.000011064242,0.000016628253,0.0006059973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991706,0.000044830027,0.00032052328,0.00008674401,0.00022895898,0.00014833051],"domain_scores_gemma":[0.9988691,0.00005359111,0.00018283422,0.000735546,0.0001121663,0.00004674706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483376,0.00013632729,0.000113682676,0.00011518183,0.000949521,0.00065290893,0.0002992615,0.000067007866,0.000030002786],"category_scores_gemma":[0.000004235901,0.000097276716,0.000063339125,0.00008017425,0.00006963671,0.0016681695,7.756512e-7,0.0001621081,0.00055240124],"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.0001068677,0.000032363532,0.0000047174353,0.00025142674,0.00025651365,0.0000012551426,0.0032341657,0.08979421,0.0013999376,0.012903286,0.001376775,0.8906385],"study_design_scores_gemma":[0.00219847,0.00010677016,0.0046223695,0.00027285176,0.0002426224,0.000056693778,0.008817281,0.93258065,0.026114756,0.0001891868,0.024057325,0.00074101484],"about_ca_topic_score_codex":0.000049279628,"about_ca_topic_score_gemma":0.000028426572,"teacher_disagreement_score":0.9946728,"about_ca_system_score_codex":0.00011619775,"about_ca_system_score_gemma":0.000017364835,"threshold_uncertainty_score":0.7303044},"labels":[],"label_agreement":null},{"id":"W2613810684","doi":"10.1109/tit.2019.2941895","title":"Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","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":"Université de Montréal","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; Horizon 2020 Framework Programme; European Commission","keywords":"Lossless compression; Context-adaptive variable-length coding; Variable-length code; Entropy encoding; Entropy (arrow of time); Shannon–Fano coding; Entropy rate; Source code; Rate–distortion theory; Tunstall coding","score_opus":0.006594828244757613,"score_gpt":0.2022408314730425,"score_spread":0.1956460032282849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613810684","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.0024003163,0.000003952692,0.973462,0.00006689245,0.0013182468,0.00023282369,0.00006207497,0.0002564492,0.022197232],"genre_scores_gemma":[0.9851705,0.0000330909,0.0105810575,0.001777893,0.000047424594,0.000022682147,0.000037397436,0.000016595237,0.0023133669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.000092701936,0.0003062348,0.00019531562,0.00039897885,0.0002510513],"domain_scores_gemma":[0.998707,0.00032645446,0.00015033867,0.00062021543,0.00009969788,0.00009627274],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046478372,0.00018082214,0.00014935038,0.0003309024,0.0003112148,0.00023822005,0.00052207324,0.00010606739,0.0003379296],"category_scores_gemma":[0.000006076359,0.0001659931,0.00006420109,0.00038276298,0.000032869277,0.0039782478,0.000008728439,0.00032146514,0.0017506642],"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.00029309175,0.0001754383,0.000008055634,0.000058981623,0.00008054213,0.0000011763079,0.0027780803,0.19840777,0.0003134747,0.38139895,0.001442287,0.41504216],"study_design_scores_gemma":[0.0028904653,0.0007083401,0.000105734274,0.00029341673,0.000032312986,0.000029393908,0.0018154441,0.78245103,0.0065759867,0.0043294528,0.1999837,0.00078473246],"about_ca_topic_score_codex":0.00002442665,"about_ca_topic_score_gemma":7.700899e-7,"teacher_disagreement_score":0.9827702,"about_ca_system_score_codex":0.0001072613,"about_ca_system_score_gemma":0.00008874241,"threshold_uncertainty_score":0.9990266},"labels":[],"label_agreement":null},{"id":"W2636034934","doi":"10.1109/tit.2018.2876280","title":"A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","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":"Perimeter Institute","funders":"Ministry of Education, India; National Research Foundation Singapore; National Science Foundation, United Arab Emirates; National Research Foundation","keywords":"Converse; Communication source; Decoding methods; Quantum channel; Channel (broadcasting); Quantum; Independent and identically distributed random variables; Quantum capacity; Amplitude damping channel","score_opus":0.03868913772233459,"score_gpt":0.2499863663796165,"score_spread":0.2112972286572819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2636034934","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.0018954773,0.000006815188,0.98683864,0.00013518942,0.00031289077,0.0005885787,0.00004843789,0.00039902597,0.0097749615],"genre_scores_gemma":[0.90806687,0.000007230592,0.089959145,0.0015739757,0.000028471559,0.0002914588,0.000023080247,0.000010526877,0.000039244853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852777,0.0001215312,0.0005970097,0.0001555697,0.00031612732,0.00028198102],"domain_scores_gemma":[0.99795,0.0005661365,0.00032428274,0.0006929775,0.00037316667,0.000093433126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087036303,0.00019714002,0.00016184709,0.0005332484,0.0008816706,0.0003443613,0.0007016269,0.00009550865,0.000055344906],"category_scores_gemma":[0.000038173224,0.00018941112,0.00014640445,0.00080046826,0.00015099237,0.0031759308,0.0000063727784,0.0001553588,0.00013659465],"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.00043568877,0.00072603737,0.000008732736,0.000232375,0.00025902575,2.0013842e-7,0.017220581,0.004552055,0.00041874082,0.5019988,0.0039016614,0.47024614],"study_design_scores_gemma":[0.0019131055,0.00044663905,0.00034861092,0.00006111046,0.000041529813,0.000025931644,0.0018419031,0.948123,0.008059889,0.03384177,0.004792556,0.0005039613],"about_ca_topic_score_codex":0.000012060067,"about_ca_topic_score_gemma":0.0000026873174,"teacher_disagreement_score":0.9435709,"about_ca_system_score_codex":0.00007906234,"about_ca_system_score_gemma":0.00005514636,"threshold_uncertainty_score":0.7723961},"labels":[],"label_agreement":null},{"id":"W2673438180","doi":"10.1109/tit.2018.2865936","title":"Adversarial Network Coding","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","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 Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Adversarial system; Linear network coding; Computer science; Coding (social sciences); Hamming distance; Theoretical computer science; Point (geometry); Topology (electrical circuits); Algorithm; Mathematics; Computer network; Artificial intelligence; Combinatorics; Statistics","score_opus":0.025143518722477394,"score_gpt":0.26193329017676964,"score_spread":0.23678977145429225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2673438180","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.00011511895,0.000055122957,0.97693354,0.0003699633,0.0059142783,0.0003974718,0.000019927518,0.00052222854,0.015672354],"genre_scores_gemma":[0.97223127,0.0010321405,0.022718156,0.0026727172,0.0005370448,0.00019717311,0.00004313966,0.000021912649,0.0005464643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981039,0.00039126308,0.00059726567,0.00026318937,0.00033397775,0.00031036278],"domain_scores_gemma":[0.99755853,0.00030130206,0.0003336621,0.0013792476,0.0003182535,0.0001090292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011585532,0.0002949251,0.00025657695,0.0002903742,0.00071865215,0.0005048221,0.0015481443,0.0002728614,0.0003214094],"category_scores_gemma":[0.000018797293,0.00030169028,0.00019994091,0.00040942596,0.000107689266,0.0014100717,0.00005997001,0.00091468263,0.0007759341],"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.00013240562,0.000084650885,0.0000011794574,0.00007057833,0.00019636838,9.4190597e-7,0.0057167658,0.273049,0.000012071622,0.26730165,0.011687332,0.44174707],"study_design_scores_gemma":[0.0016668289,0.00026889605,0.000067563415,0.0008892227,0.000103852915,0.000020405385,0.00018959542,0.8237149,0.003533296,0.080640644,0.087248616,0.0016561481],"about_ca_topic_score_codex":0.0000022762792,"about_ca_topic_score_gemma":0.000005559466,"teacher_disagreement_score":0.9721161,"about_ca_system_score_codex":0.00017702115,"about_ca_system_score_gemma":0.00021426837,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W2725229240","doi":"10.1109/tit.2018.2878452","title":"Interference Mitigation via Relaying","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"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; Huawei Technologies","keywords":"MIMO; Quantization (signal processing); Relay; Covariance matrix; Covariance; Relay channel; Control theory (sociology); Topology (electrical circuits); Telecommunications link","score_opus":0.018691038927703612,"score_gpt":0.25415666686620425,"score_spread":0.23546562793850065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725229240","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.0013829604,0.000010952045,0.98461634,0.0004068378,0.00068774377,0.00012429745,0.0000017209223,0.00026287953,0.012506295],"genre_scores_gemma":[0.99154836,0.00005388682,0.006706888,0.0014051438,0.000029810863,0.00003192581,0.000002457566,0.000003949379,0.00021758086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916595,0.0001490199,0.00028826096,0.000109239496,0.00014734332,0.00014016023],"domain_scores_gemma":[0.9989517,0.00013547864,0.00009979078,0.0005167556,0.00023891746,0.000057363286],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045059953,0.000103218044,0.00007586035,0.00021532095,0.0005005732,0.00016667244,0.0005350293,0.00005128877,0.00021002712],"category_scores_gemma":[0.0000125950355,0.00009982252,0.000047973317,0.00043778124,0.00009230788,0.0024733897,0.000006132026,0.00019346797,0.0010960896],"study_design_candidate":"design_other","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.00002439359,0.000028234126,0.00000157048,0.000004961947,0.00001492876,1.12372966e-7,0.0050390605,0.00067291176,0.00066556915,0.11348046,0.00025154444,0.87981623],"study_design_scores_gemma":[0.0013160992,0.0006777999,0.0003566976,0.00024555612,0.000024017014,0.000049652106,0.00062254746,0.7503094,0.18755469,0.035701923,0.022272369,0.0008692734],"about_ca_topic_score_codex":0.0000011640404,"about_ca_topic_score_gemma":0.000004853948,"teacher_disagreement_score":0.9901654,"about_ca_system_score_codex":0.000065051696,"about_ca_system_score_gemma":0.000036389123,"threshold_uncertainty_score":0.99968165},"labels":[],"label_agreement":null},{"id":"W2734457061","doi":"10.1109/tit.2018.2865558","title":"Estimation Efficiency Under Privacy Constraints","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random variable; Piecewise; Gaussian; Constraint (computer-aided design); Maximization; Binary number; Minification; Variable (mathematics); Probability density function","score_opus":0.018222165837315882,"score_gpt":0.2650558598470876,"score_spread":0.24683369400977173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734457061","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.0025854155,0.0000035206976,0.98652637,0.0026191727,0.0010008462,0.00024389,0.000026209453,0.0012737457,0.0057208426],"genre_scores_gemma":[0.8825363,0.00000650972,0.11660008,0.0007633583,0.0000152491075,0.000031520933,0.0000058712735,0.0000060890734,0.000035022902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986663,0.0000822181,0.0003976332,0.00021459538,0.0003545637,0.00028469897],"domain_scores_gemma":[0.9959426,0.0002328548,0.00016049121,0.0034516116,0.00014762532,0.00006480192],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066726055,0.0001661419,0.00011632537,0.00042666623,0.00040665333,0.00023167973,0.0069279573,0.00013587829,0.00022649781],"category_scores_gemma":[0.0008287887,0.0001586371,0.00005872515,0.0006541608,0.00047915793,0.0038583546,0.00025548151,0.00025940174,0.001661774],"study_design_candidate":"design_other","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.000028191926,0.000092967384,9.1908106e-7,0.00001883702,0.000029100238,6.1892666e-7,0.0008985673,0.0031686488,0.00014170047,0.10815137,0.0058934395,0.88157564],"study_design_scores_gemma":[0.00049690745,0.00018789279,0.0000527238,0.00004467972,0.000010328826,0.000034190674,0.00017428295,0.5481803,0.05373602,0.3959104,0.0008876714,0.0002846123],"about_ca_topic_score_codex":0.0000031795241,"about_ca_topic_score_gemma":6.995302e-7,"teacher_disagreement_score":0.88129103,"about_ca_system_score_codex":0.00012051082,"about_ca_system_score_gemma":0.000101695776,"threshold_uncertainty_score":0.9991155},"labels":[],"label_agreement":null},{"id":"W2734950220","doi":"10.1109/tit.2017.2726064","title":"Fast Decoding of Expander Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Clemson University","keywords":"Expander graph; Decoding methods; List decoding; Mathematics; Linear code; Sequential decoding; Berlekamp–Welch algorithm; Combinatorics; Bipartite graph; Expander code; Concatenated error correction code; Algorithm; Block code; Discrete mathematics; Vertex (graph theory); Tanner graph; Graph","score_opus":0.01820089463018002,"score_gpt":0.27448185760968963,"score_spread":0.2562809629795096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734950220","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.007543072,0.0000028151544,0.9786197,0.00009464236,0.00061877025,0.00011715517,0.000005772013,0.00030389975,0.012694181],"genre_scores_gemma":[0.98088795,0.000010454382,0.018795712,0.00012812483,0.000008309376,0.000023044066,4.6133596e-7,0.0000044090493,0.00014153363],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992633,0.000039191244,0.00028298414,0.00009214297,0.00019295591,0.00012945787],"domain_scores_gemma":[0.9986132,0.00014290564,0.00029045396,0.00079486315,0.000119307886,0.000039296778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504108,0.00009713602,0.00011518543,0.00021420304,0.00047697496,0.0001901815,0.00081143243,0.000060813396,0.000030462808],"category_scores_gemma":[0.000033080763,0.00009299399,0.00007661867,0.0000789059,0.000080493744,0.0030209664,0.000005525589,0.00014757054,0.000060630646],"study_design_candidate":"bench_or_experimental","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.000048901722,0.00007174907,0.000048277434,0.00005194588,0.000038718314,6.798314e-7,0.0069744918,0.0031488573,0.0013063499,0.08488018,0.00020319523,0.9032267],"study_design_scores_gemma":[0.0007028996,0.00022143437,0.00089244853,0.00021256859,0.000022885974,0.00003070886,0.00082276843,0.058663804,0.90339345,0.033954423,0.00062930625,0.00045333576],"about_ca_topic_score_codex":0.000018160263,"about_ca_topic_score_gemma":0.0000074458567,"teacher_disagreement_score":0.97334486,"about_ca_system_score_codex":0.00003631345,"about_ca_system_score_gemma":0.00003804172,"threshold_uncertainty_score":0.3792185},"labels":[],"label_agreement":null},{"id":"W2766265081","doi":"10.1109/tit.2018.2833466","title":"Complexity and Capacity Bounds for Quantum Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"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":"Quantum capacity; Quantum channel; Mathematics; Quantum algorithm; Hilbert space; Quantum; Quantum information; Classical capacity; Quantum error correction; Quantum operation; Upper and lower bounds; Discrete mathematics; Quantum network; Quantum mechanics; Open quantum system; Pure mathematics; Physics","score_opus":0.02387081041126787,"score_gpt":0.2446334930440721,"score_spread":0.2207626826328042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766265081","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.03315563,0.0000041778276,0.96425444,0.0004165044,0.0013186886,0.00021772762,0.00003363883,0.00022738821,0.00037179093],"genre_scores_gemma":[0.9717208,0.0000023890918,0.027263384,0.00083881157,0.0000953586,0.00002741053,0.0000021694252,0.000005220979,0.000044410754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920326,0.00005722863,0.00023075775,0.000148234,0.0001449273,0.00021555969],"domain_scores_gemma":[0.9992432,0.00017816122,0.00008680073,0.00027639454,0.00013450667,0.00008093426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001537,0.0001290303,0.0001183096,0.00017452113,0.0006727872,0.00022663783,0.00027385325,0.000060582428,0.000014834725],"category_scores_gemma":[0.000010247206,0.00011445346,0.00006370153,0.0001932264,0.00023296491,0.0008469155,0.0000037719387,0.00014319264,0.000046035264],"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.00009941608,0.00007978521,8.8844564e-7,0.00006903172,0.000046828085,2.1225557e-7,0.011148388,0.005503105,0.0001015044,0.6211823,0.0003967191,0.36137182],"study_design_scores_gemma":[0.00043520506,0.00033896932,0.00004604484,0.000021311336,0.000006153766,0.000022945822,0.00007315825,0.83991534,0.0050956253,0.14927313,0.0045981263,0.00017397112],"about_ca_topic_score_codex":0.0000102201875,"about_ca_topic_score_gemma":0.0000027983529,"teacher_disagreement_score":0.9385652,"about_ca_system_score_codex":0.000023031875,"about_ca_system_score_gemma":0.000029724646,"threshold_uncertainty_score":0.5174603},"labels":[],"label_agreement":null},{"id":"W2772479553","doi":"10.1109/tit.2019.2904988","title":"Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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; Subcategory; Additive white Gaussian noise; Trapping; Decoding methods; Error floor; Gaussian; Code (set theory); Mathematics; Channel (broadcasting); Discrete mathematics; Computer science; Algorithm; Combinatorics; Physics; Telecommunications; Biology","score_opus":0.026400803656583087,"score_gpt":0.2843982716759575,"score_spread":0.2579974680193744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772479553","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.079887144,0.00002522125,0.91308,0.00021258646,0.002277007,0.0009795722,0.00040652536,0.00055015046,0.0025818117],"genre_scores_gemma":[0.9837018,0.00012219779,0.015282383,0.0005684697,0.000019824569,0.0001156444,0.00010101512,0.000025668001,0.000062983476],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99701715,0.00029391653,0.0011997484,0.0005037687,0.00061712967,0.00036831238],"domain_scores_gemma":[0.997196,0.00057753955,0.0008893973,0.0010750417,0.00017155489,0.00009045381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001984632,0.00045218543,0.00049439794,0.0010565824,0.0003091679,0.00022435855,0.0009434813,0.00029069989,0.000021728747],"category_scores_gemma":[0.000024650497,0.00048143152,0.00019140444,0.00030073343,0.00008848799,0.00157654,0.0000525161,0.001069782,0.000031534757],"study_design_candidate":"design_other","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.0011293107,0.00039433362,0.000053773947,0.0024254497,0.0006376815,0.0000060813636,0.04319599,0.22061098,0.00078212115,0.005830482,0.0023875188,0.7225463],"study_design_scores_gemma":[0.006405197,0.0019849148,0.0011626082,0.012096264,0.00043673185,0.000117082294,0.010614655,0.4156514,0.51516616,0.029967075,0.0021586504,0.0042392453],"about_ca_topic_score_codex":0.0000975553,"about_ca_topic_score_gemma":0.000021817574,"teacher_disagreement_score":0.9038147,"about_ca_system_score_codex":0.00027154916,"about_ca_system_score_gemma":0.00015716089,"threshold_uncertainty_score":0.9997637},"labels":[],"label_agreement":null},{"id":"W2774002047","doi":"10.1109/tit.2018.2879823","title":"From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"Mathematics; Trapping; Low-density parity-check code; Girth (graph theory); Combinatorics; Upper and lower bounds; Degree (music); Discrete mathematics; Minimum weight; Cage; Minimum distance; Decoding methods; Algorithm; Physics; Biology","score_opus":0.013445672666642514,"score_gpt":0.2622321549856071,"score_spread":0.24878648231896458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774002047","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.14766772,0.00003285684,0.8485099,0.00075171195,0.00042380422,0.0013545094,0.00033659246,0.00026335896,0.0006595244],"genre_scores_gemma":[0.9570733,0.00005899856,0.04165875,0.00066423236,0.00002044422,0.00046264692,0.000006163103,0.000022323018,0.00003319671],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997622,0.00030221965,0.0008765257,0.00046899586,0.00044341187,0.00028681126],"domain_scores_gemma":[0.99630624,0.0016993654,0.00053810695,0.0010217815,0.00030214523,0.00013234316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012395858,0.00042264655,0.00052651664,0.0005541082,0.0002885795,0.00019899441,0.00088330905,0.0002835594,0.000021950755],"category_scores_gemma":[0.00012956059,0.0003629475,0.00014089275,0.00044784765,0.00027998627,0.0007231634,0.00005504044,0.0005844273,0.00000558271],"study_design_candidate":"bench_or_experimental","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.0029808192,0.0009384092,0.00010839055,0.0035410996,0.0015121818,0.000010911488,0.58165854,0.011341986,0.061964303,0.02400942,0.0064701387,0.3054638],"study_design_scores_gemma":[0.00075572735,0.001305774,0.0009326435,0.007367163,0.00017282381,0.00004069006,0.0060105724,0.022589983,0.8959531,0.061925083,0.0013151454,0.0016312614],"about_ca_topic_score_codex":0.00008732577,"about_ca_topic_score_gemma":0.000050158447,"teacher_disagreement_score":0.83398885,"about_ca_system_score_codex":0.00011104237,"about_ca_system_score_gemma":0.00014538737,"threshold_uncertainty_score":0.9998822},"labels":[],"label_agreement":null},{"id":"W2774323520","doi":"10.1109/tit.2017.2779851","title":"Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"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":"Erasure code; Computer science; Rank (graph theory); Multiplicative function; Channel (broadcasting); Binary erasure channel; Erasure; Communication source; Matrix (chemical analysis); Algorithm; Discrete mathematics; Mathematics; Channel capacity; Decoding methods; Combinatorics; Computer network","score_opus":0.024671034538534992,"score_gpt":0.2913047066467689,"score_spread":0.2666336721082339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774323520","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.0018245644,0.000022537606,0.9947025,0.0009295061,0.00030729896,0.00050742785,0.000029984607,0.00017383808,0.0015023496],"genre_scores_gemma":[0.98665047,0.00012799246,0.012217775,0.00023848678,0.000027779412,0.00026547496,0.000007388511,0.000008161571,0.0004564964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991508,0.00007500956,0.00026254734,0.00015304855,0.00016062833,0.00019792745],"domain_scores_gemma":[0.9979389,0.00035292734,0.00026127248,0.0010937105,0.00028016604,0.000073058945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004990864,0.00015638852,0.00015070594,0.00015106851,0.0017959003,0.0005594327,0.0010558042,0.00005587275,0.00002111659],"category_scores_gemma":[0.000027258673,0.00013158354,0.000074874144,0.00011950126,0.00014111804,0.0028905536,0.000008640995,0.00016536762,0.0000641308],"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.0003028398,0.00013508092,0.000013622885,0.000050270595,0.0001186724,5.862586e-7,0.007239124,0.03085656,0.00020491744,0.24626541,0.0001636914,0.7146492],"study_design_scores_gemma":[0.0077820825,0.0008074922,0.0007697873,0.00050070434,0.00008483238,0.00004603024,0.0014081358,0.87252545,0.06547996,0.0097245285,0.0394526,0.0014183791],"about_ca_topic_score_codex":0.000003510744,"about_ca_topic_score_gemma":0.000012063657,"teacher_disagreement_score":0.9848259,"about_ca_system_score_codex":0.000054411088,"about_ca_system_score_gemma":0.00005348958,"threshold_uncertainty_score":0.9995036},"labels":[],"label_agreement":null},{"id":"W2780186416","doi":"10.1109/tit.2020.3030855","title":"Low SNR Asymptotic Rates of Vector Channels With One-Bit Outputs","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Manitoba","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"MIMO; Quantization (signal processing); Mutual information; Computer science; Channel (broadcasting); Algorithm; Channel state information; Bit error rate; Mathematics; Topology (electrical circuits); Telecommunications; Wireless","score_opus":0.012784451578956878,"score_gpt":0.21709124646309927,"score_spread":0.20430679488414238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780186416","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.0013489549,0.00004096056,0.9937726,0.000045326717,0.0015117201,0.00086397445,0.00024106675,0.0005808512,0.0015945276],"genre_scores_gemma":[0.99542356,0.00008193005,0.0038749934,0.00005872706,0.00006744895,0.00023177796,0.0001117218,0.00006590282,0.000083971514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985514,0.00006149697,0.0007212485,0.0001754311,0.00027411155,0.00021630542],"domain_scores_gemma":[0.9988509,0.000119470154,0.00028753842,0.00043203385,0.00020844606,0.000101606434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017434293,0.00036861034,0.0004493682,0.00038589822,0.00007372421,0.00006797985,0.00023219264,0.00028429448,0.00010984414],"category_scores_gemma":[0.000011847103,0.0003749274,0.00012782005,0.00028130336,0.0000602594,0.0008387788,0.0000035454752,0.00060068606,0.00017487937],"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.00011371803,0.000031843032,4.0612215e-7,0.0014532408,0.00020753121,4.323217e-7,0.0024146591,0.9906278,0.00026862518,0.0009629369,0.000031271866,0.0038875001],"study_design_scores_gemma":[0.001983031,0.00039803697,0.000032150376,0.002856153,0.00033696237,0.000015231325,0.0011182426,0.51872474,0.46930215,0.00351446,0.0002704639,0.001448417],"about_ca_topic_score_codex":0.0000049065975,"about_ca_topic_score_gemma":0.0000028182244,"teacher_disagreement_score":0.9940746,"about_ca_system_score_codex":0.00018277385,"about_ca_system_score_gemma":0.0000781478,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W2780712151","doi":"10.1109/tit.2018.2849066","title":"Expected Communication Cost of Distributed Quantum Tasks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Research Foundation; Ministry of Education - Singapore; National Research Foundation Singapore; Princeton University; National Science Foundation","keywords":"Quantum entanglement; Quantum capacity; Quantum information; Quantum channel; Von Neumann entropy; Quantum information science; Quantum mutual information; Upper and lower bounds; Independent and identically distributed random variables; Information theory","score_opus":0.010972053440012869,"score_gpt":0.24972759221655508,"score_spread":0.2387555387765422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780712151","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.02094746,0.0000029842286,0.97456926,0.00008287528,0.0001419402,0.0002951823,0.0006227962,0.000059577484,0.0032779388],"genre_scores_gemma":[0.9992379,0.000004156727,0.00024749764,0.00006021814,0.000027737988,0.00014878156,0.00022917733,0.000007863411,0.00003670182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992149,0.00006184098,0.00038479952,0.00007554423,0.00013286402,0.00013005374],"domain_scores_gemma":[0.99893975,0.00010119327,0.0002164606,0.0004438685,0.00024620976,0.00005248608],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021807305,0.00010837118,0.0001195177,0.00011424135,0.00029473854,0.000032266962,0.00020046852,0.00004384435,0.001079131],"category_scores_gemma":[0.0000025799159,0.00010612961,0.00008154624,0.00029964178,0.00011255057,0.00043227483,0.0000018818004,0.00013960895,0.00030517174],"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.0000720371,0.00017747919,0.0000062146783,0.000007377075,0.000057236364,9.692558e-9,0.0010768513,0.00037462646,0.00060478045,0.96388495,0.0005530631,0.033185396],"study_design_scores_gemma":[0.0022999218,0.00035518757,0.00032456356,0.00013020518,0.00015199094,0.0000023217283,0.008023631,0.06843715,0.28317893,0.6062638,0.030149719,0.0006825764],"about_ca_topic_score_codex":0.000039757055,"about_ca_topic_score_gemma":0.000002011329,"teacher_disagreement_score":0.9782904,"about_ca_system_score_codex":0.00002401167,"about_ca_system_score_gemma":0.000039973587,"threshold_uncertainty_score":0.999834},"labels":[],"label_agreement":null},{"id":"W2781533064","doi":"10.1109/tit.2020.3005015","title":"Secure Communication Over Fully Quantum Gel’fand-Pinsker Wiretap Channel","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","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":"Perimeter Institute; University of Waterloo","funders":"Ministry of Education - Singapore; Japan Society for the Promotion of Science; National Research Foundation; Kayamori Foundation of Informational Science Advancement","keywords":"Channel (broadcasting); Binary erasure channel; Quantum; Decoding methods; Quantum channel; Lemma (botany); Quantum capacity; Quantum entanglement; Topology (electrical circuits); Coding (social sciences)","score_opus":0.011342262858673501,"score_gpt":0.21602012749370994,"score_spread":0.20467786463503643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781533064","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.0030014028,0.000034713732,0.98656267,0.0027893218,0.00045977646,0.00032772985,0.000039607898,0.000624938,0.006159836],"genre_scores_gemma":[0.986829,0.000101271224,0.0016204963,0.011272596,0.000025592873,0.00007304132,0.000028799044,0.000011111239,0.000038091246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829364,0.00015949599,0.00063678116,0.00016620987,0.0004674081,0.00027647457],"domain_scores_gemma":[0.998518,0.00012073162,0.0002787379,0.0006803976,0.00018918405,0.00021296303],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045332962,0.00023964455,0.00019372256,0.00034777093,0.00048720377,0.00035272687,0.00089296815,0.00014695631,0.0003054576],"category_scores_gemma":[0.000013341627,0.0002288127,0.00020523861,0.00089465396,0.000096855605,0.0058624772,0.0000094227225,0.00043429402,0.0012286166],"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.0002694895,0.00014610711,0.000004364472,0.00013570367,0.00013136672,0.0000010118587,0.047448475,0.016479215,0.000105110885,0.861854,0.0076704975,0.06575463],"study_design_scores_gemma":[0.0023813476,0.0004355198,0.0003794899,0.0000885195,0.000045372253,0.00002508449,0.0027525246,0.9050495,0.0073422985,0.03244863,0.048143186,0.00090852694],"about_ca_topic_score_codex":0.000008454743,"about_ca_topic_score_gemma":0.000002013188,"teacher_disagreement_score":0.9849422,"about_ca_system_score_codex":0.000045922967,"about_ca_system_score_gemma":0.0000747622,"threshold_uncertainty_score":0.99954903},"labels":[],"label_agreement":null},{"id":"W2782312501","doi":"10.1109/tit.2017.2789208","title":"Explicit Full Correlation Distribution of Sequence Families Using Plateaued Functions","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"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":"Orta Doğu Teknik Üniversitesi","keywords":"Correlation; Sequence (biology); Mathematics; Distribution (mathematics); Statistics; Computer science; Genetics; Biology; Mathematical analysis","score_opus":0.020004070796250637,"score_gpt":0.2379385320035846,"score_spread":0.21793446120733398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782312501","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.08476172,0.0000039369465,0.9127135,0.000026731146,0.0009371505,0.00015426106,0.000071125134,0.00020408531,0.0011274886],"genre_scores_gemma":[0.9971849,0.0000071923782,0.0026077232,0.0000935591,0.000026899796,0.000018354924,0.000021462445,0.0000045457564,0.00003538219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.00011661571,0.0004495206,0.00013885897,0.00023499434,0.0001736719],"domain_scores_gemma":[0.99888575,0.00016386666,0.00022981754,0.00040487887,0.00026055734,0.000055149136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544783,0.00013666126,0.00012238654,0.00033559278,0.0004729233,0.00007451898,0.0002887529,0.00009271122,0.0000782744],"category_scores_gemma":[0.000016475564,0.00013641689,0.00011359041,0.00084851665,0.00016385343,0.0025091416,0.000003640167,0.00015430007,0.00014881122],"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.00059677503,0.00018381064,0.000023097105,0.00005883089,0.00010520072,4.73575e-7,0.008425645,0.06282837,0.008243756,0.7052203,0.0001426495,0.2141711],"study_design_scores_gemma":[0.0015629461,0.0013753899,0.000462813,0.0002421314,0.0001284775,0.000085144995,0.0030448302,0.7949523,0.110363446,0.08332767,0.0036086165,0.0008462445],"about_ca_topic_score_codex":0.000013285409,"about_ca_topic_score_gemma":0.0000032432342,"teacher_disagreement_score":0.9124232,"about_ca_system_score_codex":0.000071098264,"about_ca_system_score_gemma":0.000058486017,"threshold_uncertainty_score":0.55629194},"labels":[],"label_agreement":null},{"id":"W2790441935","doi":"","title":"Costas Cubes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"graph theory and CDMA systems","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Order (exchange); Cube (algebra); Discrete mathematics; Physics","score_opus":0.005618808715518931,"score_gpt":0.19095043561900055,"score_spread":0.18533162690348162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790441935","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.023008756,0.000013342549,0.9105064,0.000013571115,0.0017483524,0.00013562625,0.000037120084,0.0005647051,0.06397207],"genre_scores_gemma":[0.99938107,0.000014829333,0.00006923078,0.000176173,0.000055388075,0.00003704967,0.00000397485,0.000011307924,0.00025099557],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942577,0.000040217186,0.00022915725,0.00004692285,0.000111085246,0.00014684543],"domain_scores_gemma":[0.99962366,0.0000528971,0.00002327055,0.00019507938,0.000051708594,0.000053381824],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025226263,0.00010940644,0.00008350028,0.00018912638,0.00016730605,0.000044204342,0.00009939058,0.00007035823,0.0006697886],"category_scores_gemma":[0.000002326173,0.000104363964,0.000060894676,0.00018911403,0.00007663463,0.0007656384,2.2576393e-7,0.00011950488,0.00291656],"study_design_candidate":"bench_or_experimental","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.00041327527,0.00009836657,0.0000046566597,0.00027258793,0.00036534856,0.0000014108955,0.017981058,0.1235227,0.0026892177,0.26628765,0.0067763245,0.5815874],"study_design_scores_gemma":[0.0021934074,0.00060133904,0.00013970268,0.00022573004,0.000117326934,0.000089222056,0.005683163,0.11034714,0.5858738,0.039826747,0.25353572,0.0013666924],"about_ca_topic_score_codex":0.0000014112608,"about_ca_topic_score_gemma":0.000002206663,"teacher_disagreement_score":0.9763723,"about_ca_system_score_codex":0.000036396483,"about_ca_system_score_gemma":0.000007385734,"threshold_uncertainty_score":0.9978598},"labels":[],"label_agreement":null},{"id":"W2796240652","doi":"10.1109/tit.2019.2946361","title":"Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base (topology); Cache; Cover (algebra); Coding (social sciences); Clique; Mathematical optimization; Set cover problem; Set (abstract data type); Base station; Time complexity; Algorithm; Parallel computing; Mathematics; Computer network","score_opus":0.010654967407908342,"score_gpt":0.2184766131450712,"score_spread":0.20782164573716286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796240652","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.078554675,0.000013424059,0.91783065,0.000092206676,0.0017503037,0.0010127366,0.0005643158,0.000061365514,0.00012033494],"genre_scores_gemma":[0.9976841,0.00010960509,0.0014790748,0.00023367222,0.00002623876,0.00013509567,0.0001502091,0.000010610047,0.00017134521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998416,0.000089471876,0.00077319663,0.0001865659,0.00036683265,0.0001679551],"domain_scores_gemma":[0.99761254,0.00037362648,0.0007861369,0.0007550387,0.0004360139,0.000036650188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075253,0.00023639211,0.00031636344,0.0003086472,0.00014219026,0.00009551746,0.0007429597,0.00022874888,0.00002944703],"category_scores_gemma":[0.0000087865465,0.00018633019,0.000309936,0.00014461738,0.00006114633,0.0008865638,0.000020958867,0.0003577865,0.000017313256],"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.0014445034,0.0000771374,0.0000013509515,0.00046829224,0.0002990673,9.3170584e-8,0.0037943071,0.9579689,0.0045129643,0.009539222,0.000046606434,0.021847593],"study_design_scores_gemma":[0.0014172313,0.00046987357,0.00010756428,0.00025774507,0.00016441998,0.000005794789,0.00040491365,0.94092846,0.054599445,0.00096187973,0.00033084265,0.00035185795],"about_ca_topic_score_codex":0.00001592243,"about_ca_topic_score_gemma":0.0000026590521,"teacher_disagreement_score":0.9191295,"about_ca_system_score_codex":0.000099903344,"about_ca_system_score_gemma":0.0002545232,"threshold_uncertainty_score":0.75983244},"labels":[],"label_agreement":null},{"id":"W2796841874","doi":"10.1109/tit.2018.2873140","title":"Stopping Redundancy Hierarchy Beyond the Minimum Distance","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Illinois at Urbana-Champaign; ITMO University; University of Cambridge; Tallinna Tehnikaülikool; Tartu Ülikool; Nanyang Technological University; Belarusian State University; Saint Petersburg State University; Lunds Universitet; McGill University; Eesti Teadusagentuur; Technion-Israel Institute of Technology; University College Dublin","keywords":"Redundancy (engineering); Row; Mathematics; Code (set theory); Decoding methods; Combinatorics; Upper and lower bounds; Binary erasure channel; Discrete mathematics; Algorithm; Computer science; Coding (social sciences); Statistics; Set (abstract data type)","score_opus":0.013488795517293851,"score_gpt":0.2542901375572471,"score_spread":0.24080134203995326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796841874","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.0007910672,0.000058145186,0.97710747,0.0010606679,0.0051827137,0.0006974241,0.000051319348,0.0014022555,0.013648969],"genre_scores_gemma":[0.9617196,0.00009413697,0.034068074,0.002341083,0.00017497009,0.0005049052,0.000016558997,0.000035573263,0.001045099],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975938,0.00033875852,0.0007314935,0.00038994537,0.00057123747,0.00037471726],"domain_scores_gemma":[0.996591,0.0004862957,0.0005366697,0.0019724006,0.00032333314,0.00009034251],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015437483,0.00038537942,0.000272399,0.0004633574,0.00075299933,0.0005964729,0.002304413,0.00030352006,0.000057423727],"category_scores_gemma":[0.000043327156,0.00031686795,0.00025716453,0.00047030576,0.00027109086,0.0017001379,0.000047689926,0.0013721796,0.00027297193],"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.00022266593,0.00021465492,0.000003847627,0.00045959372,0.00026538834,0.0000046531186,0.048565574,0.016474504,0.000117794894,0.17494024,0.012342124,0.746389],"study_design_scores_gemma":[0.00076791266,0.00048162782,0.00008251293,0.0012465927,0.00013983104,0.00010103789,0.001182623,0.17400771,0.044537593,0.73105866,0.04419596,0.0021979497],"about_ca_topic_score_codex":0.000016328293,"about_ca_topic_score_gemma":0.000011503807,"teacher_disagreement_score":0.96092856,"about_ca_system_score_codex":0.00027574957,"about_ca_system_score_gemma":0.00026973162,"threshold_uncertainty_score":0.99992836},"labels":[],"label_agreement":null},{"id":"W2799662396","doi":"10.1109/tit.2019.2916646","title":"Optimal Universal Learning Machines for Quantum State Discrimination","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Qubit; Quantum; Quantum state; Limit (mathematics); Quantum information; Generality; State (computer science); Process (computing); Quantum algorithm","score_opus":0.005544976962360111,"score_gpt":0.2164692786406838,"score_spread":0.21092430167832368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799662396","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.07606035,0.0000037586387,0.92187834,0.00019927502,0.0008517807,0.00026491078,0.00001539941,0.00026627205,0.0004599086],"genre_scores_gemma":[0.98138386,0.0000040722525,0.017767817,0.00016602899,0.000019786658,0.000016537719,0.000010996318,0.000008733038,0.00062217156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.00007819869,0.00022709362,0.00014585885,0.00018557278,0.00019989278],"domain_scores_gemma":[0.9992761,0.00024792258,0.000120905475,0.00021073635,0.00009391462,0.00005044852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038999683,0.0001326776,0.000109752444,0.00026083112,0.00029118347,0.00015927381,0.0003023891,0.000045072262,0.000025773323],"category_scores_gemma":[0.000007775506,0.00011855795,0.00009829564,0.00020479107,0.000024856847,0.0013855783,0.0000035938672,0.00023066714,0.00013663468],"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.000056117475,0.000021318216,0.0000012909826,0.000029111296,0.00001456126,1.7514017e-7,0.0033649828,0.7437097,0.00008182169,0.03423562,0.000017965172,0.21846737],"study_design_scores_gemma":[0.0005517747,0.00025971333,0.000046621702,0.000025411635,0.000006464688,0.00000709223,0.00026120892,0.98930335,0.0020469395,0.0057038125,0.0016248582,0.00016272838],"about_ca_topic_score_codex":0.0000064196192,"about_ca_topic_score_gemma":6.9307197e-7,"teacher_disagreement_score":0.9053235,"about_ca_system_score_codex":0.000041552757,"about_ca_system_score_gemma":0.000043295386,"threshold_uncertainty_score":0.4834653},"labels":[],"label_agreement":null},{"id":"W2799710179","doi":"10.1109/tit.2018.2834516","title":"Capacity Achieving Distributions and Separation Principle for Feedback Gaussian Channels With Memory: the LQG Theory of Directed Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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 Ottawa","funders":"","keywords":"Linear-quadratic-Gaussian control; Information theory; Separation principle; Gaussian; Separation (statistics); Computer science; Control theory (sociology); Mathematics; Control (management); Artificial intelligence; Statistics; Machine learning; Physics","score_opus":0.0127012307515208,"score_gpt":0.2407918347222992,"score_spread":0.2280906039707784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799710179","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.05593637,0.000011563786,0.9400139,0.00013100321,0.00016038159,0.00083170744,0.00026810568,0.0005517633,0.0020952069],"genre_scores_gemma":[0.9962641,0.000039815786,0.003134917,0.0000800607,0.000023314704,0.00033845683,0.000086638494,0.000013375575,0.000019329133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990037,0.00012460127,0.0004581474,0.00006725433,0.00017605638,0.00017025658],"domain_scores_gemma":[0.99869317,0.00033206635,0.00018011194,0.00043258828,0.00031173276,0.000050347026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081023434,0.0001723464,0.0001611326,0.00021742609,0.00046642046,0.000098950644,0.00020869903,0.00011968462,0.000034991383],"category_scores_gemma":[0.000036221605,0.00013423526,0.000055088356,0.0003260653,0.000292369,0.002208456,0.0000033768633,0.00023127277,0.000017420896],"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.0017452019,0.00023150597,0.000028677525,0.0010905849,0.0006915942,7.958274e-8,0.07538481,0.063616864,0.0024622583,0.5242901,0.001091242,0.32936707],"study_design_scores_gemma":[0.0036019695,0.0011667748,0.0022496989,0.0006515933,0.00038389213,0.000054323245,0.0077066673,0.40472975,0.5189797,0.028079811,0.030933034,0.0014627292],"about_ca_topic_score_codex":0.0000066417647,"about_ca_topic_score_gemma":0.000016540605,"teacher_disagreement_score":0.9403277,"about_ca_system_score_codex":0.00008541714,"about_ca_system_score_gemma":0.000029307706,"threshold_uncertainty_score":0.54739547},"labels":[],"label_agreement":null},{"id":"W2801400867","doi":"10.1109/tit.2019.2912165","title":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"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":"Natur og Univers, Det Frie Forskningsråd","keywords":"Linear network coding; Decoding methods; Network packet; Channel code; Information-theoretic security; Secrecy; Coding (social sciences); Code (set theory); Shannon–Fano coding; Computational complexity theory","score_opus":0.01899466051068887,"score_gpt":0.2509348176087943,"score_spread":0.23194015709810545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801400867","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.012078004,0.000088348235,0.98426646,0.0001133226,0.00060798874,0.0003013439,0.0000041757708,0.00018384412,0.0023565167],"genre_scores_gemma":[0.9774112,0.00043915396,0.021077786,0.00077386835,0.000025897954,0.000015925396,0.0000049360483,0.000007860247,0.00024338765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989971,0.0001288413,0.00033746945,0.00015248556,0.00016741216,0.0002167083],"domain_scores_gemma":[0.99893737,0.00022818815,0.00013687879,0.00049156015,0.00013526817,0.000070757946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153822,0.00013904492,0.00016765586,0.00014512887,0.00048243883,0.00025795033,0.00034698486,0.00008930029,0.000088811226],"category_scores_gemma":[0.000008324831,0.00014173305,0.00005287379,0.00042204908,0.000046185927,0.0019473525,0.000012536581,0.00030389847,0.00011324826],"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.00023922331,0.00009556221,0.00013357091,0.0000932657,0.00011358744,0.0000010360242,0.0094703315,0.62061036,0.0022483913,0.15807344,0.0004293017,0.2084919],"study_design_scores_gemma":[0.0007726055,0.00007133773,0.00007460493,0.00013735077,0.000011732103,0.000015670423,0.00019727129,0.9915155,0.0027568212,0.0011631321,0.0030457976,0.00023816431],"about_ca_topic_score_codex":0.000006356841,"about_ca_topic_score_gemma":0.0000069856446,"teacher_disagreement_score":0.96533316,"about_ca_system_score_codex":0.00006000588,"about_ca_system_score_gemma":0.000045060413,"threshold_uncertainty_score":0.57797056},"labels":[],"label_agreement":null},{"id":"W2806758424","doi":"10.1109/tit.2019.2895356","title":"On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Multiplicity (mathematics); Low-density parity-check code; Discrete mathematics; Tanner graph; Degree (music); Graph; Algorithm; Decoding methods; Physics","score_opus":0.02405202218869541,"score_gpt":0.25488724770940535,"score_spread":0.23083522552070995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806758424","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.24818023,0.000023299915,0.74960506,0.00044010297,0.00064926036,0.00085686287,0.000039615385,0.000069183996,0.00013640113],"genre_scores_gemma":[0.9991582,0.00003944387,0.0005829141,0.00016964976,0.000008183786,0.000029947165,0.0000023091727,0.0000071567824,0.0000021672554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977734,0.000764644,0.00068559585,0.00018430632,0.00040422863,0.00018779315],"domain_scores_gemma":[0.9960973,0.0017283133,0.00084082986,0.0012035782,0.00011269585,0.000017252107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027621004,0.0002230294,0.00026593934,0.00020184577,0.0004267953,0.00011044459,0.0013208629,0.0001454619,0.0000023378636],"category_scores_gemma":[0.00007045042,0.00010714385,0.00025456882,0.00061618985,0.0005347941,0.000334803,0.0000699942,0.0010126253,0.0000017794129],"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.00038868244,0.00014481515,0.0004370157,0.0002665384,0.00014830315,1.5888983e-7,0.0281526,0.66084474,0.000202485,0.26469368,0.000034365596,0.044686615],"study_design_scores_gemma":[0.00077632803,0.00006540166,0.005447867,0.0008047782,0.00007579127,0.000014410672,0.0011059454,0.7872905,0.050757732,0.1533813,0.000010882105,0.00026902714],"about_ca_topic_score_codex":0.00036366584,"about_ca_topic_score_gemma":0.000092777205,"teacher_disagreement_score":0.750978,"about_ca_system_score_codex":0.000082316044,"about_ca_system_score_gemma":0.00008177735,"threshold_uncertainty_score":0.43994096},"labels":[],"label_agreement":null},{"id":"W2808059776","doi":"10.1109/tit.2019.2898224","title":"Coupling Data Transmission for Multiple-Access Communications","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Demodulation; Decoding methods; Computer science; Additive white Gaussian noise; Algorithm; Data stream; Encoder; Error detection and correction; Single antenna interference cancellation; Channel (broadcasting); Theoretical computer science; Telecommunications","score_opus":0.0903698762017232,"score_gpt":0.3513965285180419,"score_spread":0.26102665231631866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808059776","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.00010335173,0.00007048475,0.9924217,0.0006603322,0.0018234284,0.0019903684,0.0005069109,0.0015140054,0.0009094374],"genre_scores_gemma":[0.6949131,0.00040457075,0.30249527,0.00056080776,0.00003938043,0.0007676173,0.0006149947,0.000044258417,0.00016001624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978508,0.00012783277,0.00083610957,0.00049804366,0.0003805596,0.00030668732],"domain_scores_gemma":[0.9912598,0.0015328279,0.0005446218,0.0062058247,0.00035936307,0.00009756431],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017325256,0.0003645613,0.00035042732,0.0005930008,0.0005271546,0.000708542,0.0090241935,0.00040072767,0.000016669826],"category_scores_gemma":[0.00004868606,0.00037810882,0.00020636183,0.0003045172,0.00008380627,0.004185539,0.00020416755,0.0010881309,0.0000767151],"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.00019220589,0.00026987627,0.0000067376013,0.00089468976,0.00016666453,2.6717436e-7,0.0039193644,0.43799612,0.000109625405,0.011356245,0.0019391726,0.54314905],"study_design_scores_gemma":[0.00039648422,0.000056046243,0.0000074730265,0.0003819292,0.000051040468,0.0000043362193,0.00008109665,0.9738033,0.0048789424,0.007484305,0.012428884,0.00042617938],"about_ca_topic_score_codex":0.000044097196,"about_ca_topic_score_gemma":0.000013656413,"teacher_disagreement_score":0.69480973,"about_ca_system_score_codex":0.00017443624,"about_ca_system_score_gemma":0.00036353755,"threshold_uncertainty_score":0.9998671},"labels":[],"label_agreement":null},{"id":"W2870662404","doi":"10.1109/tit.2019.2919295","title":"Capacity of Two-Way Channels With Symmetry Properties","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Channel capacity; Channel (broadcasting); Symmetry (geometry); Coding (social sciences); Ergodic theory; Upper and lower bounds; Computer science; Mathematics; Topology (electrical circuits); Statistical physics; Telecommunications; Combinatorics; Physics; Statistics; Mathematical analysis","score_opus":0.024722353565253572,"score_gpt":0.22488235480685229,"score_spread":0.20016000124159872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2870662404","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.06296343,0.000018587427,0.9300193,0.00015368569,0.00031433543,0.00024211904,0.0000032021492,0.00010497146,0.0061803474],"genre_scores_gemma":[0.99684983,0.000037648748,0.002431036,0.00034899698,0.0000066499088,0.000028222063,9.671942e-7,0.0000041559915,0.00029246663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992125,0.0001240925,0.0002525853,0.00008954069,0.00019998342,0.00012132011],"domain_scores_gemma":[0.9990132,0.000089123045,0.00011997944,0.0005412462,0.00019664581,0.00003982414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038497767,0.00010491167,0.00012627356,0.00020458177,0.00014076017,0.000074514915,0.00043612169,0.000033938224,0.00009204158],"category_scores_gemma":[0.000003852885,0.00007919575,0.000046541845,0.00040706215,0.00006369208,0.0017732447,0.0000042849533,0.00017343272,0.00020157063],"study_design_candidate":"bench_or_experimental","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.00018671004,0.00019200583,0.00003217814,0.0001237039,0.00011731704,1.9169858e-7,0.01583944,0.09235022,0.003912694,0.5977198,0.00007069355,0.28945506],"study_design_scores_gemma":[0.003604637,0.0010004962,0.00028973632,0.00060733967,0.00003671425,0.000041507865,0.001278398,0.340068,0.64251846,0.0055762115,0.00406461,0.0009138863],"about_ca_topic_score_codex":0.0000036931515,"about_ca_topic_score_gemma":0.000003079156,"teacher_disagreement_score":0.9338864,"about_ca_system_score_codex":0.00003651406,"about_ca_system_score_gemma":0.00004198773,"threshold_uncertainty_score":0.3229509},"labels":[],"label_agreement":null},{"id":"W2883360900","doi":"10.1109/tit.2020.2981573","title":"Partially Smoothed Information Measures","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":22,"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":"Australian Research Council; Science and Engineering Research Board; National Research Foundation Singapore","keywords":"Smoothing; Information theory; Ball (mathematics); State (computer science); Entropy (arrow of time); Quantum; Quantum information","score_opus":0.01407074606768822,"score_gpt":0.20858650071095977,"score_spread":0.19451575464327156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883360900","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.00045781297,0.0000051620345,0.98222536,0.0020194075,0.0005235751,0.00028496774,0.000025594556,0.000748193,0.013709926],"genre_scores_gemma":[0.97789526,0.000019573536,0.0039573833,0.017999021,0.000025704425,0.00006851119,0.000014244673,0.000005648682,0.000014632523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983162,0.00010127303,0.0006841364,0.0001026283,0.00054550136,0.00025025406],"domain_scores_gemma":[0.99886143,0.000084182255,0.00024321217,0.00036837353,0.00022582569,0.00021699184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004584514,0.00019690045,0.00015475736,0.00037970484,0.0003174426,0.00047207612,0.00062090467,0.00010360263,0.00020977005],"category_scores_gemma":[0.000029238818,0.00018269347,0.00016715087,0.0008079309,0.000058395613,0.012256685,0.0000039002553,0.00026175455,0.0031196957],"study_design_candidate":"design_other","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.00018551508,0.00004314603,0.0000028213378,0.00005624798,0.00006111849,3.6752067e-7,0.01818155,0.028563445,0.000059878057,0.40508464,0.0023603,0.545401],"study_design_scores_gemma":[0.004014287,0.0008686269,0.00028919638,0.00006610663,0.0000611471,0.000025007126,0.0034561842,0.47546488,0.055589143,0.023222938,0.43549964,0.001442833],"about_ca_topic_score_codex":0.0000026576388,"about_ca_topic_score_gemma":8.7877555e-7,"teacher_disagreement_score":0.97826797,"about_ca_system_score_codex":0.00003445948,"about_ca_system_score_gemma":0.00009657763,"threshold_uncertainty_score":0.99765646},"labels":[],"label_agreement":null},{"id":"W2892912714","doi":"10.1109/tit.2018.2872053","title":"A Joint Typicality Approach to Compute–Forward","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":17,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Ministerio de Economía y Competitividad; National Science Foundation","keywords":"Decoding methods; Computer science; Encoding (memory); Gaussian; Joint (building); Theoretical computer science; Algorithm; Context (archaeology); Channel (broadcasting); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03505041804431539,"score_gpt":0.26141645457964996,"score_spread":0.22636603653533457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892912714","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.00053519075,0.0000049834607,0.9690327,0.00071748946,0.00045447104,0.00024914084,0.0000045832558,0.0002783084,0.02872315],"genre_scores_gemma":[0.94840014,0.000016147238,0.04545903,0.0057841795,0.000044405908,0.000058458936,0.0000028772965,0.0000047476988,0.000230028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998936,0.00018613026,0.0003364887,0.00014821975,0.00020966861,0.00018351065],"domain_scores_gemma":[0.99871933,0.00008143313,0.00007130256,0.0007418561,0.00025457397,0.00013150483],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068951765,0.00012298253,0.00012470229,0.00023323,0.0005077046,0.00018762701,0.0006392752,0.00005378474,0.00008886457],"category_scores_gemma":[0.000013752201,0.00011205089,0.00007324821,0.00062797556,0.00007749556,0.0014555751,0.0000128809625,0.00019293153,0.0013759036],"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.000050154966,0.00015046833,4.524815e-7,0.000010491117,0.000029437768,7.372667e-8,0.006801325,0.005807383,0.0001177491,0.49044412,0.002520504,0.49406785],"study_design_scores_gemma":[0.0016044477,0.000746841,0.0005806225,0.00010812153,0.000026111376,0.000038662685,0.0006306788,0.7679167,0.03978549,0.014776813,0.17271729,0.0010682332],"about_ca_topic_score_codex":0.0000015717577,"about_ca_topic_score_gemma":0.0000016521059,"teacher_disagreement_score":0.94786495,"about_ca_system_score_codex":0.000073339295,"about_ca_system_score_gemma":0.00004920068,"threshold_uncertainty_score":0.9994016},"labels":[],"label_agreement":null},{"id":"W2894949059","doi":"10.1109/tit.2018.2878219","title":"Lattice-Based Robust Distributed Source Coding","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Distributed source coding; Algorithm; Computer science; Lattice (music); Shannon–Fano coding; Coding (social sciences); Source code; Variable-length code; Rate distortion; Rate–distortion theory; Theoretical computer science; Mathematics; Decoding methods; Statistics; Physics; Data compression","score_opus":0.013600685699314686,"score_gpt":0.22163363051763968,"score_spread":0.208032944818325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894949059","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.004538368,0.000007143382,0.98796624,0.000080959864,0.00024302353,0.00017745889,0.00008540296,0.0018657969,0.0050356314],"genre_scores_gemma":[0.99539053,0.000018759145,0.0041140784,0.00028649942,0.00002526428,0.00006822492,0.00004365703,0.000020234596,0.000032723972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921554,0.000060789152,0.00032351862,0.000062665866,0.00016467499,0.00017283665],"domain_scores_gemma":[0.9991246,0.00017515983,0.000056748548,0.0004517705,0.00012974117,0.0000619904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031091817,0.00014125777,0.000110746594,0.00024657635,0.00024460623,0.000080767095,0.0002493202,0.00011092992,0.0003291522],"category_scores_gemma":[0.000010361083,0.00015442696,0.000064592095,0.0003044388,0.00011396156,0.0007814124,0.0000011726372,0.00026511977,0.00045885635],"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.0001661338,0.0001252543,0.0000062593117,0.00019222689,0.00012236161,3.774491e-7,0.004246273,0.8132848,0.0011373934,0.020294055,0.0033658184,0.15705901],"study_design_scores_gemma":[0.00064441457,0.00009284385,0.000045547804,0.0001160859,0.000035206205,0.0000053528033,0.00049233483,0.70020133,0.25857013,0.0011342858,0.03823321,0.00042925045],"about_ca_topic_score_codex":0.0000040845903,"about_ca_topic_score_gemma":0.0000051162224,"teacher_disagreement_score":0.9908522,"about_ca_system_score_codex":0.00012268324,"about_ca_system_score_gemma":0.000019939373,"threshold_uncertainty_score":0.6297349},"labels":[],"label_agreement":null},{"id":"W2911101083","doi":"10.1109/tit.2021.3132675","title":"A Deterministic Algorithm for the Capacity of Finite-State Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","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":"National Natural Science Foundation of China; Research Grants Council, University Grants Committee; William and Flora Hewlett Foundation; National Science Foundation","keywords":"Mathematics; Algorithm; Polynomial; Mutual information; Channel (broadcasting); Finite state; Regular polygon; Exponential function; Channel capacity; Euclidean space; Mathematical optimization; Applied mathematics; Computer science; Markov chain; Combinatorics; Mathematical analysis; Statistics","score_opus":0.021461174823274375,"score_gpt":0.25001115417279673,"score_spread":0.22854997934952237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911101083","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.00039274205,0.0000081733515,0.9975461,0.00014066616,0.001075025,0.00027036387,0.000056640205,0.00022445832,0.00028582814],"genre_scores_gemma":[0.90012383,0.00002067136,0.098807134,0.0005720504,0.000017609178,0.00020699139,0.0000024913795,0.000008057864,0.00024113814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913394,0.00008599509,0.00033664008,0.000108579035,0.00018170869,0.00015313581],"domain_scores_gemma":[0.9975738,0.0014606755,0.00016133982,0.00047468653,0.00029561,0.00003388247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061383075,0.00010629416,0.00011945698,0.00013639877,0.00023280414,0.00008853118,0.00040393363,0.000048979055,0.00001567256],"category_scores_gemma":[0.00007058481,0.00008676874,0.00012381264,0.0003363986,0.00006439572,0.0007730399,0.0000037422076,0.00015599924,0.00001948546],"study_design_candidate":"design_other","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.000016700777,0.000052961048,1.3357445e-7,0.000040356197,0.000035796413,0.0000010264272,0.0055522188,0.016530901,0.00012454843,0.0071799345,0.0000643414,0.9704011],"study_design_scores_gemma":[0.00026563564,0.00013299748,0.000004601601,0.000043615546,0.000021406628,0.000036358648,0.0002586702,0.7516728,0.2226818,0.02348711,0.0012473357,0.00014765853],"about_ca_topic_score_codex":0.0000074036984,"about_ca_topic_score_gemma":0.0000042104352,"teacher_disagreement_score":0.9702534,"about_ca_system_score_codex":0.000035769724,"about_ca_system_score_gemma":0.0000901785,"threshold_uncertainty_score":0.35383263},"labels":[],"label_agreement":null},{"id":"W2918569083","doi":"","title":"Intrinsic Capacity","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"","keywords":"Generalization; Channel (broadcasting); Binary number; Encoder; Convex combination; State (computer science); Channel capacity; Realization (probability); Mathematics; Regular polygon; Decoding methods; Binary erasure channel; Computer science; Information theory; Topology (electrical circuits); Algorithm; Convex optimization; Combinatorics; Telecommunications; Arithmetic; Mathematical analysis; Statistics","score_opus":0.007868082910500965,"score_gpt":0.19756019010329598,"score_spread":0.189692107192795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918569083","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.101577155,0.000010494456,0.86195743,0.000039140257,0.00045498018,0.00026785236,0.000026929072,0.0014114074,0.03425463],"genre_scores_gemma":[0.9984948,0.00006097376,0.0010726592,0.00021099941,0.00000724071,0.0000540064,0.000006199793,0.00001295454,0.00008017714],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940795,0.000040720002,0.00024811144,0.000047364567,0.00013586857,0.000120015895],"domain_scores_gemma":[0.9993234,0.000093370545,0.000033655546,0.00044943867,0.000060033493,0.000040057726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002202758,0.000108028886,0.00010059193,0.00023224668,0.000062182415,0.000040842166,0.00019891543,0.000089286514,0.0005518614],"category_scores_gemma":[0.0000029649595,0.00011546232,0.000057539193,0.00018457122,0.000031164902,0.0010697835,8.331788e-7,0.0002960414,0.0021917145],"study_design_candidate":"bench_or_experimental","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.00011191883,0.00012859261,0.000021268923,0.00036421712,0.00017838398,2.835651e-7,0.009795362,0.21079364,0.003422893,0.17498736,0.0020831006,0.59811294],"study_design_scores_gemma":[0.001905279,0.00023913934,0.0006183506,0.00022809865,0.00005371654,0.000036582343,0.0016243428,0.09283958,0.7432021,0.029667983,0.12810796,0.0014769007],"about_ca_topic_score_codex":0.0000037208847,"about_ca_topic_score_gemma":0.0000019162017,"teacher_disagreement_score":0.89691764,"about_ca_system_score_codex":0.00009115945,"about_ca_system_score_gemma":0.000009451449,"threshold_uncertainty_score":0.9985852},"labels":[],"label_agreement":null},{"id":"W2923426534","doi":"10.1109/tit.2020.3011556","title":"On Computing the Number of Short Cycles in Bipartite Graphs Using the Spectrum of the Directed Edge Matrix","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","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":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Discrete mathematics; Lambda; Low-density parity-check code; Dense graph; Multiplicity (mathematics); Triangle-free graph; Graph; 1-planar graph; Line graph; Algorithm; Decoding methods; Physics","score_opus":0.021742185949613677,"score_gpt":0.2936117421233498,"score_spread":0.2718695561737361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923426534","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.15069264,0.0000118735625,0.8455031,0.0005146499,0.001186642,0.0006679281,0.000024491721,0.0003018892,0.001096809],"genre_scores_gemma":[0.9964282,0.00001598593,0.0032651632,0.00022397187,0.000016903441,0.00002790047,0.0000015866527,0.000013996725,0.000006283487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766403,0.0005683475,0.0008526985,0.000215346,0.00048788814,0.00021165583],"domain_scores_gemma":[0.997267,0.0008525044,0.00058816967,0.001143411,0.00011982,0.00002910071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049905,0.0002569611,0.00029943357,0.0002616605,0.00028087888,0.00010364166,0.0017232939,0.00016184317,0.000013597324],"category_scores_gemma":[0.00005145694,0.00015357591,0.00030012263,0.0010319444,0.00021039686,0.00036164527,0.00006650815,0.0011725109,0.000007756971],"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.00029438443,0.0003504656,0.00070587697,0.0006026453,0.00033241982,0.0000016610713,0.061316226,0.6735161,0.0018416503,0.21294229,0.00021795175,0.047878325],"study_design_scores_gemma":[0.00025854894,0.00006354952,0.0020236652,0.0011764384,0.00009187892,0.00002846793,0.0009684356,0.6826234,0.19330777,0.11896551,0.000040364182,0.0004519587],"about_ca_topic_score_codex":0.00014316953,"about_ca_topic_score_gemma":0.000032971537,"teacher_disagreement_score":0.84573555,"about_ca_system_score_codex":0.00011224426,"about_ca_system_score_gemma":0.0001493162,"threshold_uncertainty_score":0.6262644},"labels":[],"label_agreement":null},{"id":"W2925280121","doi":"10.1109/tit.2020.2966197","title":"Fundamental Limits of Decentralized Data Shuffling","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Université de Montréal","funders":"National Science Foundation of Sri Lanka; European Research Council; European Commission","keywords":"Shuffling; Converse; Computer science; Distributed computing; Constraint (computer-aided design); Distributed data store; Theoretical computer science; Engineering; Mathematics","score_opus":0.0561776954809643,"score_gpt":0.2902311953398642,"score_spread":0.2340534998588999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925280121","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.004008478,0.00016643052,0.989036,0.0001254997,0.00067575043,0.0005239295,0.0014433556,0.0012534388,0.00276708],"genre_scores_gemma":[0.98893225,0.0016598671,0.008483791,0.00014472076,0.000017516228,0.00008371257,0.00063485745,0.000036801823,0.000006478848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984687,0.000103729624,0.000801922,0.00015517004,0.00030168527,0.0001687997],"domain_scores_gemma":[0.997867,0.00017765403,0.00021402704,0.0015657365,0.000089497065,0.0000860916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003831049,0.0002681134,0.0003378378,0.00029885996,0.00007693264,0.00008382231,0.0012565319,0.00028044256,0.00019249691],"category_scores_gemma":[0.000016160699,0.00031317538,0.00012460061,0.00018213062,0.00007815759,0.00091810705,0.000026957501,0.00093320664,0.000091388705],"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.00045586246,0.00029871028,0.000006131083,0.0037380585,0.001235579,0.0000015124792,0.017598763,0.6525872,0.0034202402,0.016304884,0.004496462,0.29985663],"study_design_scores_gemma":[0.0013904133,0.0001015851,0.00004734917,0.0011946864,0.00032856732,0.000010781227,0.0016410198,0.6387972,0.31582233,0.014620662,0.02467386,0.0013715532],"about_ca_topic_score_codex":0.000011747348,"about_ca_topic_score_gemma":0.0000049968376,"teacher_disagreement_score":0.9849238,"about_ca_system_score_codex":0.00013094835,"about_ca_system_score_gemma":0.000070139846,"threshold_uncertainty_score":0.99993205},"labels":[],"label_agreement":null},{"id":"W2943388400","doi":"10.1109/tit.2020.3016510","title":"New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"Wilfrid Laurier University; University of Windsor; University of Waterloo","funders":"","keywords":"Quaternion; Conjecture; Perfect power; Sequence (biology); Connection (principal bundle); Power of two","score_opus":0.01412715130810025,"score_gpt":0.21804413429190164,"score_spread":0.2039169829838014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943388400","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.049555197,0.00003918124,0.94815826,0.00046525415,0.00022144214,0.00011280294,0.000010994819,0.00016109267,0.001275758],"genre_scores_gemma":[0.99490035,0.00014277089,0.0042789527,0.00063119916,0.000016516738,0.000008078384,0.0000014123439,0.0000031997506,0.000017502836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991148,0.00012253919,0.00030056734,0.00013114342,0.00020622065,0.00012468985],"domain_scores_gemma":[0.999326,0.00020485261,0.00013213923,0.00018140217,0.000052518197,0.00010312587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419304,0.00012844737,0.00013972967,0.00021685206,0.00015407377,0.00010957968,0.00031941585,0.00005690708,0.000051631523],"category_scores_gemma":[0.000011939278,0.000112181595,0.000079915124,0.0004730064,0.00010857227,0.0021472487,0.0000037892794,0.00014029103,0.000040587627],"study_design_candidate":"design_other","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.00019617325,0.000022353366,0.00006519836,0.00012495396,0.00006133254,7.8469793e-7,0.035900746,0.0082448665,0.0019394311,0.22749403,0.00007412297,0.725876],"study_design_scores_gemma":[0.0038468342,0.0052336166,0.0013727464,0.00064004736,0.00019273652,0.00007829247,0.015998248,0.10031321,0.51224107,0.34119275,0.01672646,0.0021640265],"about_ca_topic_score_codex":0.000028912225,"about_ca_topic_score_gemma":0.000002776019,"teacher_disagreement_score":0.94534516,"about_ca_system_score_codex":0.0000100864345,"about_ca_system_score_gemma":0.00005915403,"threshold_uncertainty_score":0.45746326},"labels":[],"label_agreement":null},{"id":"W2945033151","doi":"10.1109/tit.2019.2917222","title":"Code Design Based on Connecting Spatially Coupled Graph Chains","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Low-density parity-check code; Decoding methods; Code (set theory); Computer science; Block (permutation group theory); Chain (unit); Concatenated error correction code; Algorithm; Block code; Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.014462411306443178,"score_gpt":0.23470088814558632,"score_spread":0.22023847683914313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945033151","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.003209006,0.0000018186404,0.989665,0.00018436839,0.0011895589,0.0006568785,0.000009548593,0.001521155,0.0035627172],"genre_scores_gemma":[0.95441526,0.000002574694,0.043642778,0.0017257914,0.000012395087,0.000070268055,0.0000035177488,0.00001648038,0.00011096117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984186,0.00023497027,0.00042149183,0.00023223013,0.00041428235,0.0002784132],"domain_scores_gemma":[0.9977817,0.0009844416,0.00023945347,0.000748555,0.00016524267,0.00008062718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013219764,0.00022073046,0.00018630188,0.0006271107,0.0002991648,0.00018293224,0.00062575215,0.00012407624,0.0001277623],"category_scores_gemma":[0.000043797732,0.00021823,0.0001287538,0.0005369631,0.0000308172,0.0014369293,0.0000029501305,0.0003810462,0.0005514108],"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.0002750305,0.00014868793,0.0000065521826,0.000047523863,0.00003267249,0.0000016070096,0.003971136,0.8752794,0.0011228191,0.032911114,0.00009880395,0.0861046],"study_design_scores_gemma":[0.0006143371,0.00048973894,0.000016819218,0.00009255591,0.000009042652,0.0000067029528,0.00013164435,0.93923134,0.05620213,0.002704453,0.00021530666,0.00028592855],"about_ca_topic_score_codex":0.000014473476,"about_ca_topic_score_gemma":0.0000073733113,"teacher_disagreement_score":0.9512062,"about_ca_system_score_codex":0.00012757163,"about_ca_system_score_gemma":0.000116173665,"threshold_uncertainty_score":0.8899161},"labels":[],"label_agreement":null},{"id":"W2945448702","doi":"10.1109/tit.2019.2917683","title":"Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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":"Decoding methods; Computer science; Upper and lower bounds; Algorithm; Energy (signal processing); Encoder; Encoding (memory); Polar code; Block (permutation group theory); Topology (electrical circuits); Discrete mathematics; Mathematics; Combinatorics; Artificial intelligence; Statistics","score_opus":0.017824784635746438,"score_gpt":0.24351747872334242,"score_spread":0.22569269408759599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945448702","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.15884995,0.000005713656,0.8366866,0.0003275744,0.00027205187,0.00017452752,0.00000784854,0.00011844157,0.0035572783],"genre_scores_gemma":[0.9895702,0.000006605935,0.009770475,0.0006050265,0.0000045028128,0.000008372254,9.5736e-7,0.0000039489473,0.000029915645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992598,0.00008763812,0.00023486529,0.00010724668,0.00020383883,0.00010658644],"domain_scores_gemma":[0.99894404,0.00059657136,0.000120107274,0.00023073485,0.00007712848,0.000031427368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597946,0.000098237564,0.00010136862,0.00019509059,0.00023060244,0.00010931687,0.00020602175,0.00004494329,0.000040949275],"category_scores_gemma":[0.000015033613,0.00007735199,0.000039297196,0.00016554598,0.00012468938,0.0009872009,0.000007758566,0.00018797709,0.000026981726],"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.000081485305,0.00006068807,0.00019775497,0.000056774035,0.00003668329,2.3319852e-7,0.006972053,0.006272058,0.00043241223,0.92611384,0.0000855575,0.059690468],"study_design_scores_gemma":[0.0010755956,0.0008349748,0.004314929,0.00034675357,0.000025741623,0.000090333735,0.0017227924,0.6318847,0.033831365,0.32450747,0.0007252676,0.00064008974],"about_ca_topic_score_codex":0.000009318821,"about_ca_topic_score_gemma":0.0000017279941,"teacher_disagreement_score":0.83072025,"about_ca_system_score_codex":0.000033510838,"about_ca_system_score_gemma":0.00002642258,"threshold_uncertainty_score":0.31543228},"labels":[],"label_agreement":null},{"id":"W2949119876","doi":"10.1109/tit.2019.2915242","title":"Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"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","funders":"National Research Foundation Singapore","keywords":"Randomness; Trace distance; Computer science; Decoding methods; Alice and Bob; Algorithm; Theoretical computer science; Mathematics; Quantum; Quantum state; Statistics; Quantum mechanics; Alice (programming language)","score_opus":0.04634266103087381,"score_gpt":0.23633352703571267,"score_spread":0.18999086600483886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949119876","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.099505536,0.000021937549,0.8980883,0.00012047992,0.00033077574,0.0004671673,0.000005832491,0.0001764287,0.0012835381],"genre_scores_gemma":[0.9608172,0.000007508555,0.038731143,0.00035968213,0.000019325667,0.000036268495,7.3203506e-7,0.000008325825,0.00001980926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.00014430586,0.00033491105,0.00025600923,0.0004179288,0.0002128118],"domain_scores_gemma":[0.9987882,0.0004911293,0.00013044443,0.0003150267,0.00014789151,0.00012732203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030366,0.000181744,0.00021103778,0.00028594388,0.00033757297,0.00025479312,0.0002119903,0.00007471625,0.000007197386],"category_scores_gemma":[0.000036078407,0.00015953218,0.000041108953,0.00030351337,0.00003837044,0.00094107876,0.00000858348,0.00024331336,0.000043976102],"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.00027360147,0.00017656559,0.000015570617,0.00021240639,0.000052256666,3.6701383e-7,0.004779449,0.09387542,0.00431186,0.010266793,0.000023924886,0.8860118],"study_design_scores_gemma":[0.0016541563,0.00021974073,0.0014612684,0.00021041659,0.000021992762,0.000058914415,0.00031816258,0.9829312,0.0071648564,0.005229566,0.00037336585,0.0003563781],"about_ca_topic_score_codex":0.0000149465095,"about_ca_topic_score_gemma":4.8711667e-7,"teacher_disagreement_score":0.8890558,"about_ca_system_score_codex":0.00004283432,"about_ca_system_score_gemma":0.000034086854,"threshold_uncertainty_score":0.65055335},"labels":[],"label_agreement":null},{"id":"W2950033884","doi":"10.1109/tit.2019.2923198","title":"Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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; Mathematics; Multiplicity (mathematics); Tanner graph; Code (set theory); Infinity; Block (permutation group theory); Combinatorics; Discrete mathematics; Trapping; Decoding methods; Algorithm; Error floor; Set (abstract data type); Computer science; Geometry; Mathematical analysis","score_opus":0.013411385765304781,"score_gpt":0.24217016432167512,"score_spread":0.22875877855637033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950033884","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.42523238,0.00010530995,0.57334125,0.000027646742,0.00043560023,0.0005980085,0.00004920647,0.0001711278,0.000039475744],"genre_scores_gemma":[0.99111086,0.00016468999,0.008578362,0.0000443491,0.0000052026417,0.00005443747,0.000014805246,0.000019360445,0.000007926854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738824,0.00038806096,0.0011383106,0.0003956214,0.00042698497,0.000262754],"domain_scores_gemma":[0.9974326,0.00066352676,0.00090073247,0.0007606862,0.0001709956,0.000071451235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012783627,0.00042796507,0.00075578166,0.00089897425,0.00015911726,0.00013990674,0.00050944585,0.0003598784,0.000004743635],"category_scores_gemma":[0.000055148463,0.0004093223,0.0001370276,0.00022958395,0.00018902679,0.00095459924,0.000054300832,0.00079104654,6.2968707e-7],"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.0009306697,0.00020918321,0.00065583887,0.0069518257,0.0004951881,0.000005788223,0.14327882,0.7123519,0.0071754144,0.020807577,0.000025005982,0.10711274],"study_design_scores_gemma":[0.003277206,0.00021369052,0.0048379865,0.0029230807,0.00013115392,0.000083257204,0.0026414122,0.64362663,0.2581935,0.082998835,0.0000074845843,0.0010657522],"about_ca_topic_score_codex":0.00014099469,"about_ca_topic_score_gemma":0.00006670884,"teacher_disagreement_score":0.5658785,"about_ca_system_score_codex":0.00010601039,"about_ca_system_score_gemma":0.00013476584,"threshold_uncertainty_score":0.99983585},"labels":[],"label_agreement":null},{"id":"W2953243231","doi":"10.1109/tit.2019.2924888","title":"Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"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":"Natur og Univers, Det Frie Forskningsråd","keywords":"Locality; Erasure code; Erasure; Mathematics; Discrete mathematics; Code (set theory); Disjoint sets; Bounded function; Computer science; Combinatorics; Algorithm; Decoding methods","score_opus":0.007122627266543371,"score_gpt":0.21609901505059081,"score_spread":0.20897638778404745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953243231","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.007620523,0.000040536204,0.98843074,0.00022345118,0.0005685908,0.0006968538,0.000409018,0.0012517828,0.0007584975],"genre_scores_gemma":[0.9047162,0.00022533949,0.09450909,0.00021441207,0.000005215856,0.00007810996,0.000071528324,0.000018950665,0.00016117211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814594,0.00014697784,0.0004958783,0.00051820464,0.0003746032,0.00031840685],"domain_scores_gemma":[0.9973179,0.00034806816,0.0003766966,0.0016636469,0.00021820911,0.000075473225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006621834,0.0003950515,0.0004011319,0.00046160445,0.00026731694,0.0002627137,0.0010033157,0.00037664862,0.000029356393],"category_scores_gemma":[0.00002434219,0.00036078945,0.00009713053,0.00030057377,0.00038474164,0.0037147426,0.000058418045,0.0010080966,0.00009004786],"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.0009528701,0.00017188274,0.00003339536,0.0007161085,0.00026616143,0.000010480062,0.0019005113,0.6405558,0.00007219115,0.024087556,0.000095557276,0.3311375],"study_design_scores_gemma":[0.002177958,0.00087962387,0.00048354012,0.0006317421,0.00014794974,0.00016206923,0.0015091401,0.8363764,0.006159401,0.14810553,0.0015596683,0.0018069491],"about_ca_topic_score_codex":0.00004460203,"about_ca_topic_score_gemma":0.000042827283,"teacher_disagreement_score":0.8970957,"about_ca_system_score_codex":0.00041673184,"about_ca_system_score_gemma":0.0002575408,"threshold_uncertainty_score":0.9998844},"labels":[],"label_agreement":null},{"id":"W2954032997","doi":"10.1109/tit.2019.2927006","title":"Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"National Science Foundation","keywords":"Independent and identically distributed random variables; Transmitter power output; Energy (signal processing); Additive white Gaussian noise; Channel (broadcasting); Block (permutation group theory); Gaussian process; Dirty paper coding; Markov process; Mathematics; Computer science; Gaussian; Topology (electrical circuits); Discrete mathematics; Algorithm; Transmitter; Statistics; Combinatorics; Telecommunications; Random variable; Physics; Precoding; MIMO","score_opus":0.006378262579874359,"score_gpt":0.20853425113656973,"score_spread":0.20215598855669537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954032997","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.09954272,0.00008631037,0.8939583,0.00003220336,0.00090504996,0.00034299848,0.000024144516,0.00033460537,0.004773705],"genre_scores_gemma":[0.9965517,0.00018035536,0.0018535625,0.00013961567,0.00007027229,0.0001840523,0.000021458183,0.000047558297,0.00095140893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896115,0.00002115192,0.00039928936,0.00015400638,0.00013426911,0.00033015554],"domain_scores_gemma":[0.99922925,0.00032180638,0.000069199086,0.0002114806,0.000052153893,0.00011612321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033901495,0.00025586464,0.00022979782,0.00024151588,0.00022166001,0.00015370724,0.00011180689,0.00016772856,0.00003977608],"category_scores_gemma":[0.0000057201737,0.00025933018,0.000067814886,0.00017152783,0.00005911533,0.0012771386,0.0000015544088,0.00023065727,0.000040122508],"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.000047569454,0.000021209782,0.000033063425,0.00034356778,0.0000902497,2.57185e-7,0.00072606653,0.93520176,0.0003935395,0.007735859,0.000034477653,0.055372365],"study_design_scores_gemma":[0.0014000621,0.00028141378,0.00010577368,0.00044459596,0.00010010595,0.000031402826,0.00045676075,0.9651736,0.025117097,0.0018553063,0.0044168383,0.0006170267],"about_ca_topic_score_codex":0.000022862687,"about_ca_topic_score_gemma":0.000011952799,"teacher_disagreement_score":0.897009,"about_ca_system_score_codex":0.00004870905,"about_ca_system_score_gemma":0.000018914163,"threshold_uncertainty_score":0.9999859},"labels":[],"label_agreement":null},{"id":"W2961176507","doi":"10.1109/tit.2019.2928292","title":"A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"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 Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Notation; Mathematics; Bounded function; Discrete mathematics; Successor cardinal; Disjoint sets; Conjecture; Correctness; Sequence (biology); Combinatorics; Computer science; Algebra over a field; Algorithm; Pure mathematics; Arithmetic","score_opus":0.007995481466533831,"score_gpt":0.23025340793767662,"score_spread":0.22225792647114279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961176507","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.12678184,0.000011804315,0.8712355,0.00017792181,0.000443799,0.00017693228,0.000020535736,0.00012167508,0.0010300289],"genre_scores_gemma":[0.9592357,0.000011359267,0.04014334,0.00054932927,0.000012659462,0.000018251743,0.000001234789,0.0000038029732,0.00002427559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.0000712243,0.00017763066,0.00011635191,0.000116442185,0.00017454935],"domain_scores_gemma":[0.99882,0.0007639328,0.000096531345,0.00019939156,0.00005140491,0.000068714995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042715267,0.00010121194,0.00009946006,0.00015716751,0.00023694709,0.00014314352,0.00027136042,0.00006972097,0.00005160602],"category_scores_gemma":[0.00001679784,0.00009909921,0.00005950943,0.00020771287,0.0000755198,0.0015558365,0.0000030620215,0.00015585031,0.000014753747],"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.0000906617,0.00001234332,0.00006672184,0.000047853406,0.0000295938,2.844772e-7,0.0020895577,0.001885778,0.00011976779,0.8998489,0.000010603394,0.09579793],"study_design_scores_gemma":[0.0010512327,0.00023393337,0.00024415698,0.00018716235,0.00003564718,0.000064959386,0.006761147,0.02040404,0.028870393,0.93992454,0.0017373916,0.00048541412],"about_ca_topic_score_codex":0.00010995333,"about_ca_topic_score_gemma":0.00003670809,"teacher_disagreement_score":0.8324539,"about_ca_system_score_codex":0.00003964621,"about_ca_system_score_gemma":0.00014867439,"threshold_uncertainty_score":0.40411484},"labels":[],"label_agreement":null},{"id":"W2962700135","doi":"10.1109/tit.2019.2930568","title":"Generalized Compression Strategy for the Downlink Cloud Radio Access Network","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":18,"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":"Telecommunications link; Computer science; Computer network; Radio access network; Relay; Broadcasting (networking); Transmission (telecommunications); Data compression; Base station; Telecommunications; Power (physics); Algorithm; Mobile station","score_opus":0.014178961278244152,"score_gpt":0.24907458270117538,"score_spread":0.23489562142293124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962700135","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.00086225674,0.00009750781,0.9924559,0.000029213077,0.0026361805,0.0011518517,0.00005511044,0.00038579665,0.0023261707],"genre_scores_gemma":[0.9965346,0.00013604962,0.002012762,0.0002216733,0.00020851115,0.00033888107,0.00006783961,0.000036808753,0.00044290087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911815,0.000051306026,0.0003975693,0.00008664778,0.00012427756,0.00022205041],"domain_scores_gemma":[0.9991309,0.00032898167,0.00009591107,0.00032763628,0.000072487564,0.00004410167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031737957,0.00016836215,0.00015943157,0.00009176566,0.00023235973,0.00011891617,0.00024665918,0.00011112011,0.00020622999],"category_scores_gemma":[0.000003058281,0.0001294452,0.00009614975,0.00021115116,0.000023817285,0.0014510053,0.0000011797921,0.00018744334,0.00014346562],"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.00010428297,0.000006172527,7.7877365e-7,0.000065704495,0.000046969893,2.7562837e-8,0.00020047203,0.97135,0.00006725404,0.0043591605,0.0015499281,0.022249233],"study_design_scores_gemma":[0.0012846022,0.00004812102,0.00001192446,0.00006477253,0.000039474362,0.0000046816713,0.0002390328,0.974855,0.0045544626,0.0017951203,0.016855784,0.00024701486],"about_ca_topic_score_codex":0.0000027775325,"about_ca_topic_score_gemma":0.0000022676454,"teacher_disagreement_score":0.99567235,"about_ca_system_score_codex":0.00008264718,"about_ca_system_score_gemma":0.000018557861,"threshold_uncertainty_score":0.5278622},"labels":[],"label_agreement":null},{"id":"W2963021833","doi":"10.1109/tit.2017.2673805","title":"On the VLSI Energy Complexity of LDPC Decoder Circuits","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":14,"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":"Very-large-scale integration; Low-density parity-check code; Decoding methods; Computer science; Electronic circuit; Energy (signal processing); Forward error correction; Electronic engineering; Algorithm; Mathematics; Electrical engineering; Engineering; Embedded system","score_opus":0.03635577643927789,"score_gpt":0.26470977847563254,"score_spread":0.22835400203635464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963021833","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.003363409,0.000002318927,0.96983486,0.0006256643,0.0006639932,0.00012986796,0.000011147298,0.00027519223,0.025093537],"genre_scores_gemma":[0.9970241,0.0000074050577,0.001824087,0.00092955615,0.0000104325845,0.0000418666,8.411213e-7,0.0000061390583,0.00015552592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896467,0.00012727854,0.00032250673,0.00012135827,0.0003019142,0.00016225132],"domain_scores_gemma":[0.99770993,0.0004126497,0.0003552558,0.0013279766,0.00015097127,0.00004320774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720432,0.00013278138,0.00012921325,0.00018098338,0.00078606606,0.0001958371,0.0013421683,0.00007301693,0.00007453138],"category_scores_gemma":[0.00006234652,0.00010127153,0.00010801255,0.00011868165,0.00023470851,0.0015396252,0.000007791226,0.00021668729,0.00007717657],"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.000016870827,0.000052071147,0.0000016265677,0.0000092085365,0.000019931244,2.4899646e-7,0.0013690635,0.001019487,0.00012989859,0.8376865,0.00040595155,0.15928917],"study_design_scores_gemma":[0.00052412297,0.00032951272,0.000578895,0.00015320715,0.000021434253,0.000022890441,0.00024731125,0.06366418,0.36082146,0.571353,0.0018510547,0.00043288723],"about_ca_topic_score_codex":0.000060700026,"about_ca_topic_score_gemma":0.000028771039,"teacher_disagreement_score":0.99366075,"about_ca_system_score_codex":0.00005174909,"about_ca_system_score_gemma":0.000051196646,"threshold_uncertainty_score":0.6045864},"labels":[],"label_agreement":null},{"id":"W2963368320","doi":"10.1109/tit.2017.2664811","title":"Improving on the Cut-Set Bound via Geometric Analysis of Typical Sets","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"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":"National Science Foundation","keywords":"Notation; Mathematics; Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.0322578583127779,"score_gpt":0.28179019127044364,"score_spread":0.24953233295766575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963368320","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.014764487,0.000011992937,0.9815516,0.0006067187,0.00026218357,0.00013457568,0.000013618573,0.000051585983,0.0026032631],"genre_scores_gemma":[0.99877757,0.000064568594,0.0004802409,0.00055664644,0.000006933981,0.000022843178,0.0000038204385,0.0000029423395,0.00008444298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.00016067,0.0003186876,0.00010246946,0.00024023229,0.00013036624],"domain_scores_gemma":[0.9976223,0.00052118703,0.0002988947,0.0013504084,0.00016220182,0.0000450205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089464686,0.00010293348,0.00014808009,0.00063204864,0.0010877221,0.00032515376,0.0011583297,0.000051525123,0.00015174657],"category_scores_gemma":[0.000069814014,0.00007541429,0.00014721425,0.00091610174,0.000110419984,0.0012323589,0.000013553398,0.00023524498,0.00009890046],"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.00007515458,0.0000835776,0.000018586612,0.000009162558,0.00035295569,2.1968913e-7,0.0022025895,0.0162136,0.00013214999,0.11250422,0.00016864354,0.86823916],"study_design_scores_gemma":[0.00053163734,0.00017839899,0.00667623,0.00003514815,0.00021940104,0.000003118562,0.00021111479,0.972695,0.01467709,0.0025738953,0.0018864847,0.00031247883],"about_ca_topic_score_codex":0.000008250617,"about_ca_topic_score_gemma":0.000020230862,"teacher_disagreement_score":0.9840131,"about_ca_system_score_codex":0.00005013366,"about_ca_system_score_gemma":0.000037177415,"threshold_uncertainty_score":0.8365989},"labels":[],"label_agreement":null},{"id":"W2963477777","doi":"10.1109/tit.2016.2554598","title":"ADMM LP Decoding of Non-Binary LDPC Codes in &lt;inline-formula&gt; &lt;tex-math notation=\"LaTeX\"&gt;$ \\mathbb {F}_{2^{m}}$ &lt;/tex-math&gt; &lt;/inline-formula&gt;","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":9,"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":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decoding methods; Binary number; Low-density parity-check code; Notation; Discrete mathematics; Arithmetic; Binary code; Combinatorics; Algorithm","score_opus":0.011951475316008963,"score_gpt":0.2540117262449244,"score_spread":0.24206025092891545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963477777","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.24393062,0.00007554624,0.74894017,0.0003907376,0.0014048913,0.0010976905,0.00015743628,0.0012617733,0.0027411554],"genre_scores_gemma":[0.9577155,0.00032011358,0.040272217,0.00049334415,0.00009946758,0.0003516045,0.000046816094,0.000094372735,0.0006065828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933091,0.00037650488,0.002848987,0.0008538201,0.0014297063,0.0011818899],"domain_scores_gemma":[0.9936934,0.0016469145,0.0014012195,0.0019505636,0.0009491218,0.00035876842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00332964,0.0009826993,0.0010437458,0.0023118628,0.00070853863,0.00033157176,0.0021074908,0.0006446041,0.00010867344],"category_scores_gemma":[0.00028908584,0.0008465956,0.00057362794,0.0020097655,0.00033347151,0.008214912,0.00007623547,0.0007938141,0.0006844935],"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.0010160649,0.0016229411,0.00014070487,0.00097607943,0.00041647957,0.00004884617,0.028675219,0.030645996,0.118245654,0.2957475,0.0014080649,0.5210565],"study_design_scores_gemma":[0.005142725,0.0014624994,0.0014221326,0.0026229732,0.00019478364,0.0002866829,0.00058882334,0.73497623,0.22529243,0.018056678,0.0072190943,0.0027349156],"about_ca_topic_score_codex":0.00003580759,"about_ca_topic_score_gemma":0.00018052253,"teacher_disagreement_score":0.7137849,"about_ca_system_score_codex":0.0007954776,"about_ca_system_score_gemma":0.00056820293,"threshold_uncertainty_score":0.99939847},"labels":[],"label_agreement":null},{"id":"W2963548849","doi":"10.1109/tit.2017.2788445","title":"Robustness to Unknown Error in Sparse Regularization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; Alfred P. Sloan Foundation","keywords":"Robustness (evolution); Orthonormal basis; Compressed sensing; Mathematics; Bounded function; Quadratic growth; Quotient; Gaussian; Algorithm; A priori and a posteriori; Computer science; Mathematical optimization; Combinatorics","score_opus":0.01239149005046198,"score_gpt":0.2279077615430635,"score_spread":0.21551627149260152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963548849","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.030914279,0.0000028443555,0.96004605,0.00004240599,0.0005756443,0.00020816871,0.00000627708,0.000592553,0.0076117977],"genre_scores_gemma":[0.99596167,0.000005952509,0.0035284061,0.00025385883,0.00003888868,0.000038509228,0.000004917318,0.000014716849,0.00015305977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939007,0.000031459953,0.0002436835,0.000069638896,0.00011453482,0.00015058996],"domain_scores_gemma":[0.9995919,0.00003117372,0.000024705567,0.00022251121,0.000082312,0.000047381505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016479126,0.000113263006,0.00009470581,0.00040834412,0.0000760916,0.00003933056,0.000100954305,0.000083874314,0.00010629145],"category_scores_gemma":[0.000006228701,0.000119384495,0.0000311711,0.00038555704,0.000035012796,0.00059914356,8.019409e-7,0.00012400188,0.00017259427],"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.0000582608,0.00001854667,8.0933904e-7,0.000009542872,0.000010887106,4.8359703e-7,0.0009979082,0.94046664,0.0010372321,0.0034132283,0.0006327404,0.053353716],"study_design_scores_gemma":[0.00045797505,0.00013778206,0.00013217545,0.00017368786,0.000016994267,0.000010554838,0.00029303684,0.59548825,0.39204115,0.0029795903,0.007872714,0.00039609533],"about_ca_topic_score_codex":0.000004375497,"about_ca_topic_score_gemma":0.00002093961,"teacher_disagreement_score":0.9650474,"about_ca_system_score_codex":0.00008039735,"about_ca_system_score_gemma":0.0000123079335,"threshold_uncertainty_score":0.48683584},"labels":[],"label_agreement":null},{"id":"W2963653945","doi":"10.1109/tit.2018.2862354","title":"Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Computer science; Burst noise; Noise (video); Noise measurement; Speech recognition; Electronic engineering; Telecommunications; Noise reduction; Noise floor; Engineering; Artificial intelligence","score_opus":0.011346760449429784,"score_gpt":0.2231064487628214,"score_spread":0.21175968831339162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963653945","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.12812345,0.000018292456,0.86960196,0.0000244014,0.00007944129,0.00025187308,0.00003566056,0.00026666775,0.0015982209],"genre_scores_gemma":[0.99478537,0.00015798233,0.0048840777,0.000059405753,0.000011689026,0.000059190654,0.000003303095,0.000014362607,0.000024631585],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994927,0.000027697166,0.00021716853,0.000058933474,0.00010215538,0.00010135887],"domain_scores_gemma":[0.9994538,0.000053644417,0.00006577057,0.00025512115,0.00012151493,0.000050142975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015901821,0.00012216355,0.00013284029,0.00016293397,0.00011359144,0.00002584804,0.000086161104,0.000071969036,0.000021228616],"category_scores_gemma":[0.0000038066587,0.00011143454,0.000015108644,0.00014212726,0.00028261708,0.0008629257,0.0000013828936,0.00016615236,0.000009586737],"study_design_candidate":"bench_or_experimental","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.0012917677,0.0002109357,0.00055724266,0.0013194339,0.00053284684,3.151934e-7,0.039542913,0.15259443,0.0150109185,0.026148153,0.00027305016,0.762518],"study_design_scores_gemma":[0.0022031968,0.0006236908,0.0015405545,0.0005039055,0.00008335322,0.00006395366,0.001583824,0.06477144,0.91806704,0.005574884,0.0041835615,0.00080060406],"about_ca_topic_score_codex":0.000006241432,"about_ca_topic_score_gemma":0.0000093605995,"teacher_disagreement_score":0.9030561,"about_ca_system_score_codex":0.000033177774,"about_ca_system_score_gemma":0.00000844571,"threshold_uncertainty_score":0.45441687},"labels":[],"label_agreement":null},{"id":"W2964193638","doi":"10.1109/tit.2015.2453352","title":"Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":13,"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":"Lossy compression; Channel (broadcasting); Characterization (materials science); Computer science; Atomic broadcast; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Wireless; Combinatorics; Physics; Artificial intelligence; Optics","score_opus":0.02515607787475048,"score_gpt":0.22412970652069783,"score_spread":0.19897362864594736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964193638","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.011903412,0.000026652866,0.981343,0.00045159092,0.00026917722,0.0005626634,0.000017514023,0.0009847503,0.0044412618],"genre_scores_gemma":[0.9978785,0.00002785385,0.000517429,0.0005514319,0.000025634548,0.00037617562,0.000017673023,0.000033363354,0.00057195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917096,0.000071986164,0.00028640465,0.000078094665,0.00020894717,0.00018362381],"domain_scores_gemma":[0.9988953,0.0002677871,0.00008695139,0.00050425914,0.00015456609,0.00009117107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042270916,0.00017965316,0.00012959227,0.00022545451,0.00024979544,0.00014188264,0.00028941556,0.00012264961,0.00003057603],"category_scores_gemma":[0.000014585969,0.00013151286,0.000066676876,0.00023243036,0.00008172775,0.0007255844,0.0000015123233,0.00032216308,0.000101720565],"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.0008243146,0.00011036972,0.0000027609844,0.00008967513,0.00017421466,5.073781e-7,0.025970912,0.87034017,0.00005118248,0.015521022,0.011938154,0.07497669],"study_design_scores_gemma":[0.0031723392,0.0012548367,0.000009664029,0.000539986,0.00012860114,0.0000889705,0.01037602,0.48042887,0.12198391,0.008648968,0.37220627,0.0011615495],"about_ca_topic_score_codex":0.000005246177,"about_ca_topic_score_gemma":0.0000024158899,"teacher_disagreement_score":0.9859751,"about_ca_system_score_codex":0.00010696809,"about_ca_system_score_gemma":0.000035214354,"threshold_uncertainty_score":0.5362939},"labels":[],"label_agreement":null},{"id":"W2970745594","doi":"10.1109/tit.2019.2937459","title":"Delay in Cooperative Communications: Achieving Higher Multiplexing Gain in Gaussian Interference Channels With Full-Duplex Transmitters","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","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 Waterloo","funders":"","keywords":"Multiplexing; Interference (communication); Computer science; Transmitter; Electronic engineering; Gaussian; Duplex (building); Telecommunications; Computer network; Physics; Channel (broadcasting); Engineering","score_opus":0.023909063175136695,"score_gpt":0.25656301582826224,"score_spread":0.23265395265312555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970745594","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.02585351,0.000071708564,0.9695643,0.0014141173,0.00025123908,0.0006288714,0.000006047762,0.00012257395,0.0020876047],"genre_scores_gemma":[0.99273336,0.00026112184,0.0055156634,0.0011408576,0.0000057916786,0.00018459934,0.000011678906,0.000011088746,0.00013585963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817175,0.00054428313,0.0005770873,0.00022563626,0.00019506314,0.00028617564],"domain_scores_gemma":[0.99812454,0.00046898,0.00014381351,0.0010744502,0.00012005162,0.00006815957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993269,0.00022799651,0.000236217,0.0006191577,0.00022364053,0.00022493169,0.0012234342,0.00008630741,0.00012766385],"category_scores_gemma":[0.000008466786,0.00020366012,0.000053108794,0.0010699647,0.00010362002,0.0029917324,0.000017984166,0.00063946453,0.00012889226],"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.00031111977,0.00023009602,0.00012863119,0.000038747727,0.00004148245,0.0000018545744,0.029936597,0.76159525,0.000895281,0.06712502,0.000017061084,0.13967885],"study_design_scores_gemma":[0.0025327338,0.0003098241,0.0007316408,0.0007506741,0.000006099574,0.00001437949,0.0019333921,0.98986167,0.0019381209,0.00015979509,0.0012145905,0.0005470538],"about_ca_topic_score_codex":0.000018671964,"about_ca_topic_score_gemma":0.00029340247,"teacher_disagreement_score":0.96687984,"about_ca_system_score_codex":0.00022447102,"about_ca_system_score_gemma":0.000088562134,"threshold_uncertainty_score":0.83050185},"labels":[],"label_agreement":null},{"id":"W2972280902","doi":"10.1109/tit.2019.2939113","title":"On Inverses of Permutation Polynomials of Small Degree Over Finite Fields","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"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; Dongguan University of Technology; Guangdong Polytechnic of Science and Technology; China Postdoctoral Science Foundation; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China; Peng Cheng Laboratory; National Science Foundation","keywords":"Finite field; Degree (music); Permutation (music); Inverse; Coding theory; Binomial (polynomial); Class (philosophy); Discrete orthogonal polynomials; Generalized permutation matrix","score_opus":0.015786315832481093,"score_gpt":0.2181984177347041,"score_spread":0.20241210190222303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972280902","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.19547726,0.0000029567834,0.7975659,0.000029428731,0.00042483117,0.00013782049,0.000013338844,0.000047498535,0.006300978],"genre_scores_gemma":[0.998291,0.000007096644,0.0012042935,0.00039354194,0.0000049447553,0.00000920002,0.0000023404941,0.000003365012,0.00008417988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918467,0.00009852577,0.00034712246,0.00009059171,0.0001777872,0.000101281745],"domain_scores_gemma":[0.9986815,0.00063007197,0.00020972635,0.00036445135,0.000082538216,0.00003172276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041089286,0.00009908663,0.00013774939,0.0004225988,0.000057871766,0.000026473692,0.00028838043,0.00007995842,0.00025764885],"category_scores_gemma":[0.000016959639,0.00009255916,0.0001372492,0.00032052907,0.00004099095,0.00084334775,0.0000023979962,0.00012124512,0.00009947911],"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.00053499197,0.00016371463,0.000046127254,0.0001395576,0.000081828475,2.1726022e-7,0.008215114,0.08164681,0.0008597164,0.72306216,0.00007934833,0.18517044],"study_design_scores_gemma":[0.005230303,0.003718013,0.0036223603,0.0006135689,0.0001222665,0.000011325616,0.0016809806,0.13239862,0.51133925,0.33878422,0.0013687429,0.0011103691],"about_ca_topic_score_codex":0.000008254752,"about_ca_topic_score_gemma":0.000002129384,"teacher_disagreement_score":0.80281377,"about_ca_system_score_codex":0.000015564781,"about_ca_system_score_gemma":0.000039137758,"threshold_uncertainty_score":0.3774453},"labels":[],"label_agreement":null},{"id":"W2973453427","doi":"10.1109/tit.2019.2940975","title":"Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":12,"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 Victoria","funders":"","keywords":"Hamming code; Hamming distance; Combinatorics; Discrete mathematics; Disjoint sets; Mathematics; Locality; Node (physics); Computer science; Linear code; Set (abstract data type); Algorithm; Block code; Decoding methods; Physics","score_opus":0.01562384479844742,"score_gpt":0.2370479118258966,"score_spread":0.22142406702744918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973453427","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.00077026134,0.000016949303,0.9936296,0.00031135016,0.0007451927,0.00088609045,0.00012388207,0.0026692858,0.00084743],"genre_scores_gemma":[0.5442155,0.000026967246,0.45368153,0.00096288463,0.000014589748,0.00034494203,0.000033557066,0.000018472932,0.0007015329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849397,0.000058137157,0.00053568144,0.0002944396,0.0002822226,0.0003355561],"domain_scores_gemma":[0.9980207,0.00030851926,0.00022343696,0.0012008839,0.00018473675,0.00006172176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061109057,0.00021602731,0.0002270159,0.0003564381,0.00027101918,0.00013343449,0.00068619265,0.0001536839,0.00006499614],"category_scores_gemma":[0.0000705413,0.00020498072,0.00021324329,0.00031984292,0.000094249284,0.0043556252,0.000012237331,0.00025667678,0.0006574588],"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.00041719768,0.00018244749,0.000007765487,0.00027768046,0.00016864792,0.0000025436482,0.0021036633,0.6407745,0.0018658488,0.2745237,0.0040267166,0.0756493],"study_design_scores_gemma":[0.0030032124,0.0005906578,0.000023308196,0.00013337964,0.000037217247,0.000040274987,0.0014524746,0.80058575,0.07404513,0.047753554,0.07148048,0.0008545666],"about_ca_topic_score_codex":0.000018224368,"about_ca_topic_score_gemma":0.00001174571,"teacher_disagreement_score":0.5434452,"about_ca_system_score_codex":0.00015722169,"about_ca_system_score_gemma":0.00009233701,"threshold_uncertainty_score":0.8450522},"labels":[],"label_agreement":null},{"id":"W2974990958","doi":"10.1109/tit.2021.3063093","title":"Polarization of Quantum Channels Using Clifford-Based Channel Combining","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Qubit; Topology (electrical circuits); Quantum channel; Decoding methods; Quantum entanglement; Quantum capacity; Computer science; Quantum mechanics; Quantum; Mathematics; Physics; Algorithm; Quantum network; Combinatorics","score_opus":0.014365904557510625,"score_gpt":0.23517192678589288,"score_spread":0.22080602222838225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974990958","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.026408758,0.000014518654,0.971676,0.00017695273,0.0013126865,0.00010799955,0.000017103712,0.0001598356,0.0001261396],"genre_scores_gemma":[0.9832931,0.000002500926,0.01610739,0.0005277452,0.000023500123,0.0000055146265,0.000010057785,0.000008474077,0.000021685577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877506,0.0001485821,0.000431328,0.00015189392,0.00028629194,0.0002068105],"domain_scores_gemma":[0.998928,0.00017832857,0.0002220207,0.0003716601,0.00023501342,0.000064963504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004296178,0.00014509131,0.00017335064,0.00032583054,0.00030147587,0.00011895805,0.00028117734,0.00008601479,0.000019599564],"category_scores_gemma":[0.000017322376,0.00014572803,0.00011951875,0.0006920482,0.000046861114,0.0008522411,0.0000046506498,0.00021548272,0.000016065349],"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.000020385938,0.00008490062,0.0000011589567,0.000048109076,0.000021959446,0.000001373115,0.0016170657,0.9400395,0.000838715,0.027567094,0.0000051784214,0.029754564],"study_design_scores_gemma":[0.0004476865,0.00007826794,0.000013637887,0.00009370786,0.000010279419,0.000018058165,0.0001480846,0.9225481,0.069845885,0.0065883687,0.000061880564,0.00014600494],"about_ca_topic_score_codex":0.000009209624,"about_ca_topic_score_gemma":3.5424878e-7,"teacher_disagreement_score":0.9568844,"about_ca_system_score_codex":0.000034999222,"about_ca_system_score_gemma":0.00017312123,"threshold_uncertainty_score":0.59426165},"labels":[],"label_agreement":null},{"id":"W2979569747","doi":"10.1109/tit.2020.2977319","title":"On the Weights of General MDS Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Code word; Discrete mathematics; Binary number; Mathematical proof; Linear code; Binary code; Block code; Arithmetic; Algorithm; Decoding methods","score_opus":0.0161087276406441,"score_gpt":0.22740331890276427,"score_spread":0.21129459126212016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979569747","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.006342687,0.000012092756,0.98029184,0.0009719333,0.001311682,0.00032726882,0.00009002958,0.00021876772,0.010433677],"genre_scores_gemma":[0.99517775,0.000037997925,0.0027640795,0.0017851145,0.00004092081,0.00009554306,0.000008950682,0.000008758875,0.00008090908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984433,0.0003264262,0.00047747736,0.00020424325,0.00038319454,0.00016535578],"domain_scores_gemma":[0.99799687,0.00062209764,0.00030643019,0.0008934736,0.00011204332,0.000069061236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071670813,0.00024455888,0.0002331139,0.0003425239,0.00026877617,0.000170099,0.0012367998,0.00016869802,0.00015141386],"category_scores_gemma":[0.000015532622,0.00017639075,0.00034158328,0.00036769174,0.00013615351,0.00050965627,0.000017241624,0.0007136082,0.00016273481],"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.00009879178,0.000048405625,1.6369994e-7,0.000055236953,0.00008707465,3.3419732e-7,0.0028122955,0.017044919,0.000037260346,0.95356363,0.00039311592,0.02585878],"study_design_scores_gemma":[0.00023670137,0.00019137956,0.00002146906,0.00014603222,0.000039167095,0.0000033063864,0.00012052997,0.031911932,0.032673746,0.9329762,0.0013890238,0.00029052456],"about_ca_topic_score_codex":0.000006122797,"about_ca_topic_score_gemma":8.1915573e-7,"teacher_disagreement_score":0.98883504,"about_ca_system_score_codex":0.00003413256,"about_ca_system_score_gemma":0.0000976029,"threshold_uncertainty_score":0.71930057},"labels":[],"label_agreement":null},{"id":"W2982555860","doi":"10.1109/tit.2020.3039308","title":"Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Debiasing; Sampling (signal processing); Matrix (chemical analysis); Algorithm; Metric (unit); Simple (philosophy); Matrix completion; Simple random sample; Matching (statistics); Mathematical optimization; Computer science; Mathematics; Function (biology); Projection (relational algebra); Upper and lower bounds; Statistics; Mathematical analysis; Computer vision","score_opus":0.019417091726446442,"score_gpt":0.24739547555178007,"score_spread":0.22797838382533364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982555860","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.02260354,0.000018377314,0.97017115,0.00005914628,0.0018841057,0.00066892436,0.000878925,0.0017040606,0.0020117569],"genre_scores_gemma":[0.9855548,0.00023288504,0.012931364,0.00025084952,0.00016941738,0.00014064448,0.0006419985,0.000062200124,0.000015850179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984111,0.00004992647,0.0007252724,0.00022399708,0.00032555175,0.00026412186],"domain_scores_gemma":[0.998808,0.00018629493,0.00019647801,0.0005651404,0.00012646633,0.00011760834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017367021,0.0004555539,0.00048022668,0.00039475103,0.00018253124,0.00021228814,0.00035248944,0.00042146133,0.00027023721],"category_scores_gemma":[0.0000039294064,0.00048521633,0.00028124865,0.00015203578,0.00003791029,0.00054127426,0.000009833511,0.001139296,0.00036667584],"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.00034713998,0.000047871858,0.0000028582656,0.00033639852,0.00046185235,0.0000036626186,0.003320049,0.94890714,0.0028683003,0.00030214785,0.0010310845,0.042371504],"study_design_scores_gemma":[0.0010833436,0.00006231167,0.00008559619,0.0008085676,0.0001885474,0.0000053332105,0.00030803264,0.8941281,0.08776324,0.013130365,0.0016566591,0.0007799339],"about_ca_topic_score_codex":0.00010722886,"about_ca_topic_score_gemma":0.000009623444,"teacher_disagreement_score":0.96295124,"about_ca_system_score_codex":0.00018394129,"about_ca_system_score_gemma":0.000040286715,"threshold_uncertainty_score":0.99976},"labels":[],"label_agreement":null},{"id":"W2991340697","doi":"10.1109/tit.2021.3130131","title":"Incompressibility of Classical Distributions","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Quantum entanglement; Upper and lower bounds; Quantum; Qubit; State (computer science); No-teleportation theorem; Constant (computer programming); Mathematics; Quantum information; Quantum state; Alice and Bob; Statistical physics; Quantum mechanics; Quantum information science; Physics; Computer science; Algorithm; Mathematical analysis","score_opus":0.011739026981428402,"score_gpt":0.24271622443170224,"score_spread":0.23097719745027384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991340697","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.006526179,0.000022750533,0.9862122,0.00024240604,0.0015846477,0.00032118705,0.00031319584,0.00029736178,0.0044800933],"genre_scores_gemma":[0.9893591,0.000042898137,0.009990785,0.00032161735,0.000015352258,0.00010927897,0.00012799732,0.0000058367923,0.000027137567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976962,0.00024313755,0.0010648208,0.00023129364,0.0005368178,0.0002276797],"domain_scores_gemma":[0.9973302,0.00022730778,0.000536414,0.0012836072,0.0004889325,0.00013357445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000644944,0.0002729102,0.00035401498,0.00048703235,0.00022263566,0.0003268262,0.0009492906,0.0003382041,0.00019929868],"category_scores_gemma":[0.000025324951,0.00026633983,0.00047334473,0.00059617846,0.00018648204,0.002321223,0.000032400345,0.0008607529,0.00008031993],"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.00012593609,0.00081355695,0.000010643918,0.0008008202,0.00032038722,0.0000016340136,0.008321354,0.052722618,0.000097343676,0.7059887,0.00089692324,0.22990006],"study_design_scores_gemma":[0.0032375508,0.00049080176,0.0026395337,0.0013133136,0.0002922202,0.0000618103,0.0035815928,0.5438493,0.17188315,0.25905597,0.010863101,0.0027316334],"about_ca_topic_score_codex":0.000009130604,"about_ca_topic_score_gemma":0.0000030215272,"teacher_disagreement_score":0.9828329,"about_ca_system_score_codex":0.00009815159,"about_ca_system_score_gemma":0.0003578165,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W2996211895","doi":"10.1109/tit.2020.3005544","title":"On the Algebraic Combinatorics of Injections and its Applications to Injection Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Set (abstract data type); Algebraic number; Mathematics; Algebraic combinatorics; Element (criminal law); Enumerative combinatorics; Discrete mathematics; Combinatorial proof; Extremal combinatorics; Computer science","score_opus":0.017538525243185533,"score_gpt":0.23840092839491958,"score_spread":0.22086240315173405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996211895","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.0053858696,0.000022856582,0.9888888,0.0013096761,0.0007450252,0.0010364539,0.00011668862,0.00026951515,0.0022251431],"genre_scores_gemma":[0.99747545,0.000049346163,0.00052328076,0.0011968486,0.000021930264,0.00067431823,0.000008061294,0.000010767359,0.000040014336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852324,0.0002479849,0.00047668352,0.00027365496,0.00031864425,0.00015978367],"domain_scores_gemma":[0.997806,0.0009130253,0.00027375692,0.00067336217,0.00021780262,0.00011604813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067082286,0.00024685875,0.00022571645,0.0006027401,0.0005141413,0.00018967058,0.0007233616,0.00017596011,0.000029858895],"category_scores_gemma":[0.00004931594,0.00021199016,0.0001629201,0.0010305111,0.00007771946,0.00050514494,0.000030735293,0.0007076381,0.00010746954],"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.000056963592,0.00007893391,3.943584e-7,0.00008477966,0.000065591244,6.4643345e-8,0.0028468834,0.021475647,0.00005251047,0.96068317,0.00016106662,0.014493992],"study_design_scores_gemma":[0.00025619354,0.0004902725,0.000047159694,0.00014292917,0.00006447669,0.000009152426,0.00048725423,0.01367261,0.009392409,0.9735375,0.0015346336,0.00036537542],"about_ca_topic_score_codex":0.0000056649233,"about_ca_topic_score_gemma":0.0000021329604,"teacher_disagreement_score":0.99208957,"about_ca_system_score_codex":0.00006125062,"about_ca_system_score_gemma":0.00009326698,"threshold_uncertainty_score":0.8644708},"labels":[],"label_agreement":null},{"id":"W2998178972","doi":"10.1109/tit.2019.2962495","title":"Optimization of Heterogeneous Coded Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"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; Defence Research and Development Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Optimization problem; Scheme (mathematics); Function (biology); Mathematical optimization; CPU cache; Perspective (graphical); Encoding (memory); Distributed computing; Algorithm; Parallel computing; Mathematics","score_opus":0.006795102457840474,"score_gpt":0.19685538488288654,"score_spread":0.19006028242504605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998178972","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.022849606,0.0000072377316,0.97409517,0.000038803122,0.0006275452,0.00014187579,0.000009071839,0.00013317777,0.0020975089],"genre_scores_gemma":[0.9971939,0.000009138001,0.0022839494,0.0003179901,0.000004911818,0.000007994023,0.0000034328234,0.0000038877565,0.00017479605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927545,0.00006937744,0.00027103027,0.00008701436,0.00019305912,0.000104049155],"domain_scores_gemma":[0.99933755,0.000095302945,0.000121700876,0.00032768905,0.00008421744,0.000033537675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027316893,0.00008408005,0.00010133599,0.00021403961,0.00008576251,0.000060212897,0.00026091456,0.00004793588,0.00007609859],"category_scores_gemma":[0.0000037990446,0.00008111819,0.00008468643,0.00017096117,0.000015742315,0.0014048195,0.0000019002293,0.00011247716,0.00017021503],"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.00003148801,0.000023327531,0.0000019482704,0.000014366068,0.0000162967,1.4346257e-7,0.00063488755,0.9724245,0.0003034802,0.005962636,0.0000073680885,0.020579522],"study_design_scores_gemma":[0.00045225225,0.00010909167,0.0000059579143,0.00003194081,0.0000086514965,0.000014411343,0.00010090957,0.9816397,0.016928772,0.00048527017,0.000095673844,0.00012736549],"about_ca_topic_score_codex":0.000013025078,"about_ca_topic_score_gemma":6.667282e-7,"teacher_disagreement_score":0.9743443,"about_ca_system_score_codex":0.000033971166,"about_ca_system_score_gemma":0.000029562085,"threshold_uncertainty_score":0.3307904},"labels":[],"label_agreement":null},{"id":"W3002259915","doi":"10.1109/tit.2021.3100931","title":"A Signal-Space Distance Measure for Nondispersive Optical Fiber","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Optical Network Technologies","field":"Engineering","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":"Measure (data warehouse); Mathematics; Nonlinear system; Decoding methods; Topology (electrical circuits); Mathematical optimization; Algorithm; Computer science; Physics","score_opus":0.008150545619281425,"score_gpt":0.20751841541519922,"score_spread":0.1993678697959178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002259915","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.0015118679,0.00013700347,0.98803127,0.00018635632,0.0010061655,0.00074794015,0.00027239462,0.0010966855,0.0070103],"genre_scores_gemma":[0.9729284,0.00010076071,0.025588412,0.000087905086,0.00006134442,0.00075922546,0.00009340048,0.00005599611,0.0003245633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871063,0.000030310226,0.00044336898,0.0001989779,0.0002769268,0.0003397914],"domain_scores_gemma":[0.99873567,0.00038252713,0.00007322545,0.00051257876,0.00020913234,0.000086876404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002469892,0.00035253316,0.000341283,0.00021744793,0.00013014366,0.00018498965,0.00030296232,0.00061384385,0.00031158043],"category_scores_gemma":[0.000030714735,0.00036680562,0.00030051282,0.00020638318,0.00012654507,0.00053728546,0.0000062557524,0.0010322204,0.00016935986],"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.000096970194,0.00003526116,1.0200445e-7,0.00047955546,0.0002326174,0.0000013554711,0.0006282713,0.91922677,0.000047093465,0.019472217,0.00077691476,0.059002865],"study_design_scores_gemma":[0.002403517,0.0003275461,0.000018581979,0.0021008581,0.00081642246,0.000033600805,0.0066358354,0.83145016,0.095556386,0.036243983,0.021281006,0.0031321086],"about_ca_topic_score_codex":8.178693e-7,"about_ca_topic_score_gemma":0.000005205866,"teacher_disagreement_score":0.97141653,"about_ca_system_score_codex":0.0002735907,"about_ca_system_score_gemma":0.000064821565,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W3002578304","doi":"10.1109/tit.2020.2999889","title":"On the Capacity of Waveform Channels Under Square-Law Detection of Time-Limited Signals","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":4,"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":"Upper and lower bounds; Waveform; Channel capacity; Channel (broadcasting); Detection theory; Signal-to-noise ratio (imaging); Cramér–Rao bound; SIGNAL (programming language)","score_opus":0.015984965946948752,"score_gpt":0.18829617638084287,"score_spread":0.1723112104338941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002578304","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.09656028,0.000008983871,0.8969633,0.00006954871,0.00019743969,0.0002187763,0.000039488303,0.00012201989,0.005820173],"genre_scores_gemma":[0.99962634,0.0000043525874,0.00002404517,0.0002794186,0.000018365008,0.000017061495,0.000002153924,0.000012421315,0.000015826568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991217,0.000054318436,0.00043552715,0.00005516422,0.00022304986,0.00011023569],"domain_scores_gemma":[0.9994183,0.00019724529,0.000120828845,0.0001313461,0.000087034954,0.00004521699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002997439,0.00012409869,0.00016613454,0.00010554323,0.00011954904,0.000025303936,0.00009972686,0.00008565535,0.00014345319],"category_scores_gemma":[0.000008827248,0.000092896036,0.00009777934,0.00026239752,0.000059968537,0.0005369551,5.0049624e-7,0.0001932635,0.000082163846],"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.00011614657,0.000020764093,3.895298e-8,0.00026352078,0.00008029466,6.331934e-8,0.0034403403,0.92823,0.052059934,0.009216035,0.00002983274,0.0065430338],"study_design_scores_gemma":[0.00024475998,0.0001622712,0.000002229877,0.00009501622,0.000021459322,0.0000020633179,0.00080816343,0.19577667,0.8001284,0.0024934348,0.00015013776,0.00011538665],"about_ca_topic_score_codex":0.000014406453,"about_ca_topic_score_gemma":0.0000017019378,"teacher_disagreement_score":0.9030661,"about_ca_system_score_codex":0.000042172545,"about_ca_system_score_gemma":0.000010967469,"threshold_uncertainty_score":0.37881905},"labels":[],"label_agreement":null},{"id":"W3005412203","doi":"10.1109/tit.2020.2971474","title":"Generalized Gaussian Multiterminal Source Coding: The Symmetric Case","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Distortion (music); Gaussian; Encoder; Coding (social sciences); Distributed source coding; Rate–distortion theory; Source code; Algorithm; Mathematics; Decoding methods; Discrete mathematics; Rate distortion; Computer science; Variable-length code; Theoretical computer science; Topology (electrical circuits); Data compression; Combinatorics; Statistics; Telecommunications; Physics","score_opus":0.017665512023352065,"score_gpt":0.23361914236221765,"score_spread":0.21595363033886558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005412203","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.013539532,0.00003712352,0.9811163,0.0005211342,0.00014059205,0.00027647903,0.0000354388,0.0011094519,0.0032239484],"genre_scores_gemma":[0.99712634,0.00009958819,0.0014511816,0.0011371068,0.000026933652,0.00009672633,0.00000777401,0.000019958126,0.000034390334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916875,0.00010590101,0.00034970723,0.00006587068,0.00016098226,0.00014877881],"domain_scores_gemma":[0.9992358,0.00019383579,0.00006180637,0.00036672974,0.00005090835,0.00009091869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002530504,0.00014776873,0.00011997709,0.00020604311,0.00027658217,0.000102067126,0.00028661868,0.00008477243,0.00016358445],"category_scores_gemma":[0.000014796219,0.0001239259,0.00008986297,0.0004909119,0.0000626025,0.00066765386,0.0000022821403,0.00039006176,0.00022151116],"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.00017843796,0.00008187506,0.00000312846,0.0002815738,0.00020062993,0.000026077172,0.038885955,0.3326633,0.0010406075,0.05233048,0.003421561,0.5708864],"study_design_scores_gemma":[0.0008994678,0.00007346545,0.000012135358,0.000039500275,0.00006768182,0.0004475151,0.0026958007,0.88193876,0.05456437,0.0005210232,0.05826219,0.00047806103],"about_ca_topic_score_codex":0.000010945408,"about_ca_topic_score_gemma":0.0000032119517,"teacher_disagreement_score":0.9835868,"about_ca_system_score_codex":0.000059151,"about_ca_system_score_gemma":0.000012495374,"threshold_uncertainty_score":0.5053552},"labels":[],"label_agreement":null},{"id":"W3006937682","doi":"10.1109/tit.2020.2975162","title":"Sliding-Window Superposition Coding: Two-User Interference Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Single antenna interference cancellation; Coding (social sciences); Computer science; Dirty paper coding; Algorithm; Encoder; Channel (broadcasting); Interference (communication); Superposition principle; Mathematics; Theoretical computer science; Telecommunications; MIMO; Precoding; Statistics","score_opus":0.03212389064269327,"score_gpt":0.25489287824595375,"score_spread":0.22276898760326047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006937682","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.0014219368,0.000020070836,0.99089664,0.002873388,0.0005871809,0.00023585615,0.000007216706,0.00039132993,0.0035663927],"genre_scores_gemma":[0.99243325,0.00013203047,0.002098044,0.0051200115,0.00004479257,0.0000568923,0.0000074084896,0.0000071502805,0.000100426885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00020587545,0.000367476,0.00017015038,0.00020490783,0.00019505213],"domain_scores_gemma":[0.9989787,0.00018013072,0.00010354102,0.00041901617,0.00017594546,0.00014267632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034882277,0.00016529483,0.00014144262,0.00017457863,0.00042359595,0.00034015102,0.00075059966,0.000056369594,0.00021521849],"category_scores_gemma":[0.000020388481,0.00016303791,0.00008881489,0.00055004936,0.000038009115,0.0028719788,0.000012448016,0.0003287195,0.0006614798],"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.0001549507,0.000097468335,0.0000048410197,0.000036541882,0.00006568104,0.0000014042954,0.02397139,0.03682112,0.0037198856,0.6625412,0.00090120995,0.2716843],"study_design_scores_gemma":[0.002617242,0.00065060955,0.00006633236,0.00022863338,0.00003705608,0.000033116117,0.0011847626,0.80859846,0.16616772,0.0039550667,0.015463102,0.000997873],"about_ca_topic_score_codex":0.0000011587487,"about_ca_topic_score_gemma":0.0000012430693,"teacher_disagreement_score":0.9910113,"about_ca_system_score_codex":0.000065705055,"about_ca_system_score_gemma":0.000048249738,"threshold_uncertainty_score":0.85022044},"labels":[],"label_agreement":null},{"id":"W3010632924","doi":"10.1109/tit.2021.3132397","title":"Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":54,"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; National Natural Science Foundation of China","keywords":"Covariance matrix; Covariance; MIMO; Algorithm; Mathematics; Computer science; Estimation of covariance matrices; Statistic; Random matrix; Statistics","score_opus":0.01330173829105591,"score_gpt":0.2559547341470029,"score_spread":0.24265299585594702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010632924","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.00045342132,0.000009644943,0.9968019,0.00082545384,0.00049714954,0.00045162212,0.00040312964,0.00023123936,0.00032644265],"genre_scores_gemma":[0.9708925,0.0000149405805,0.026459686,0.0018860684,0.000041055857,0.00033619552,0.00026034744,0.000011671,0.000097537355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985546,0.00015532631,0.00042993663,0.00026862722,0.00033155072,0.00025997037],"domain_scores_gemma":[0.998201,0.00038265463,0.0002255137,0.00045690368,0.00060864206,0.00012529855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032473996,0.00020660918,0.00028604714,0.00045112977,0.00043935774,0.000568018,0.0003073307,0.00011186833,0.0001752324],"category_scores_gemma":[0.000011099948,0.00018543769,0.00031368205,0.0019552654,0.000059341804,0.002391824,0.0000014009105,0.00018860932,0.000026272402],"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.0010730993,0.0002671484,1.771603e-7,0.000025154706,0.00043880453,0.000006918277,0.00040720496,0.93320256,0.000036816124,0.0038463322,0.000101166734,0.060594603],"study_design_scores_gemma":[0.010502311,0.00036022835,0.000005367677,0.000031596224,0.00040021626,0.000011002681,0.0003010043,0.9433346,0.041562892,0.0014816872,0.0017024461,0.00030664788],"about_ca_topic_score_codex":0.0000070463852,"about_ca_topic_score_gemma":0.000015052806,"teacher_disagreement_score":0.9704391,"about_ca_system_score_codex":0.00009304123,"about_ca_system_score_gemma":0.00019302449,"threshold_uncertainty_score":0.7561929},"labels":[],"label_agreement":null},{"id":"W3013193461","doi":"10.1109/tit.2020.2983152","title":"Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":45,"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":"Decoding methods; Erasure; Convolutional code; Erasure code; Binary erasure channel; Algorithm; Computer science; Network packet; Channel (broadcasting); Code (set theory); Mathematics; Discrete mathematics; Channel capacity; Telecommunications; Computer network","score_opus":0.021994799599024367,"score_gpt":0.24223113768561425,"score_spread":0.22023633808658988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013193461","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.003955463,0.000046333505,0.99362487,0.0014015163,0.00010638611,0.0003387116,0.000013366255,0.00015058466,0.00036274907],"genre_scores_gemma":[0.9907162,0.00014191419,0.007614941,0.0013526158,0.000021448275,0.000097378776,0.0000054583866,0.0000054086117,0.000044600773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993642,0.00010414594,0.00019850464,0.000111603265,0.00009676897,0.00012478934],"domain_scores_gemma":[0.9991269,0.00039950208,0.00007488267,0.00018972099,0.00012795643,0.00008100059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034939163,0.00011353213,0.00012519183,0.000084020525,0.00039944856,0.00023182452,0.00024338132,0.000033794106,0.000017562868],"category_scores_gemma":[0.000016332095,0.00009368808,0.000036750753,0.00021219526,0.0000540272,0.0013477826,0.0000035375226,0.0001222816,0.000013364466],"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.001608077,0.000075207325,0.000004173397,0.000096896016,0.00016387657,8.807708e-7,0.027924236,0.24400733,0.0007842802,0.10282792,0.00042510073,0.622082],"study_design_scores_gemma":[0.0047512846,0.00063880696,0.000042054042,0.00009005619,0.00003578161,0.000014251803,0.0012830129,0.9579283,0.025004204,0.0007479549,0.009043447,0.00042085897],"about_ca_topic_score_codex":7.1956964e-7,"about_ca_topic_score_gemma":0.0000020078542,"teacher_disagreement_score":0.9867608,"about_ca_system_score_codex":0.000015816242,"about_ca_system_score_gemma":0.000035802106,"threshold_uncertainty_score":0.3820489},"labels":[],"label_agreement":null},{"id":"W3026218946","doi":"10.1109/tit.2020.2996543","title":"Levenshtein Distance, Sequence Comparison and Biological Database Search","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":150,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"National Institute of General Medical Sciences; National Institutes of Health","keywords":"Levenshtein distance; Edit distance; Nearest neighbor search; Heuristics; Computer science; Metric (unit); Similarity (geometry); Data mining; Smith–Waterman algorithm; Database; Theoretical computer science; Artificial intelligence; Sequence alignment; Biology","score_opus":0.047823995648945954,"score_gpt":0.2778887731993038,"score_spread":0.2300647775503578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026218946","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.42545688,0.00013102697,0.5732668,0.0001933938,0.00006961595,0.00012298812,0.00024166265,0.000008396717,0.0005092022],"genre_scores_gemma":[0.9979577,0.00030084318,0.00075306953,0.00086668774,0.000030256568,0.000015905462,0.00004359604,0.0000043690466,0.000027540957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946517,0.000052945954,0.00017346637,0.00012299092,0.00006993812,0.00011548185],"domain_scores_gemma":[0.99970067,0.000024401348,0.00003606262,0.00012294728,0.000040469873,0.000075476106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013420462,0.00009417493,0.00009086418,0.000023906596,0.00013453448,0.000022720102,0.00008430226,0.000058094196,0.000022286482],"category_scores_gemma":[0.00001070892,0.00008253601,0.000034188244,0.000060636103,0.00011118338,0.0000054763304,0.000004582408,0.00009510548,0.000029710269],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0020927233,0.00017930665,0.0012718239,0.00017307156,0.00030145128,0.0000023295495,0.0054659867,0.019498896,0.7712341,0.010164083,0.0015367711,0.18807948],"study_design_scores_gemma":[0.0025663301,0.0021597536,0.0027448484,0.000040559215,0.00006758585,0.000027065254,0.0053472654,0.012667327,0.8740139,0.0009072214,0.09845048,0.0010076459],"about_ca_topic_score_codex":0.0000029353025,"about_ca_topic_score_gemma":0.0000020945802,"teacher_disagreement_score":0.57251376,"about_ca_system_score_codex":0.0000060816533,"about_ca_system_score_gemma":0.000020919233,"threshold_uncertainty_score":0.33657208},"labels":[],"label_agreement":null},{"id":"W3036019187","doi":"10.1109/tit.2020.3002993","title":"Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Planarity testing; Computer science; Mathematics; Theoretical computer science; Combinatorics; Algorithm","score_opus":0.011628620521478302,"score_gpt":0.19264855307998355,"score_spread":0.18101993255850524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036019187","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.0069829393,0.00000810726,0.98764634,0.0024237703,0.00034843036,0.00025290466,0.000027864946,0.0001392986,0.002170348],"genre_scores_gemma":[0.99779457,0.000010610106,0.00017497079,0.0019369418,0.000023728597,0.00004975645,0.0000025761171,0.0000035192206,0.0000033473757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.00014981689,0.00026339944,0.00011984677,0.00014735977,0.00009882404],"domain_scores_gemma":[0.99895597,0.0004880388,0.00013085749,0.00030435462,0.00006024142,0.000060561135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057430053,0.0001121312,0.00010989652,0.000099313744,0.00035109,0.000090188165,0.00032175783,0.000054038283,0.000023269666],"category_scores_gemma":[0.000019373181,0.00007909315,0.00008512205,0.00040206127,0.00008035136,0.0008157577,0.000004528333,0.0002450563,0.000043359192],"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.00013097716,0.000046255947,0.0000010963574,0.000020489026,0.00003131355,4.9114664e-8,0.006282794,0.0013998633,0.00025190477,0.9106411,0.00011105691,0.081083134],"study_design_scores_gemma":[0.0019393692,0.0014722741,0.00014640582,0.00012104259,0.000068164445,0.00001737658,0.006920205,0.1306825,0.062049907,0.7786015,0.017340897,0.00064036],"about_ca_topic_score_codex":0.0000032746032,"about_ca_topic_score_gemma":7.356768e-7,"teacher_disagreement_score":0.9908116,"about_ca_system_score_codex":0.000014895955,"about_ca_system_score_gemma":0.000022778453,"threshold_uncertainty_score":0.32253253},"labels":[],"label_agreement":null},{"id":"W3038982663","doi":"10.1109/tit.2020.3007406","title":"Nonparametric Specification Testing for Signal Models","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki","keywords":"Nonparametric statistics; Statistical hypothesis testing; Parametric statistics; Kernel (algebra); SIGNAL (programming language); Algorithm; Mathematics; False alarm; Ratio test; Sampling (signal processing); Computer science; Statistical power; Kernel method; Statistics; Artificial intelligence; Discrete mathematics; Support vector machine","score_opus":0.1462756064590311,"score_gpt":0.3273261080644624,"score_spread":0.1810505016054313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038982663","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.000830688,0.000004703336,0.98644763,0.0003418252,0.000068640526,0.0005969418,0.00006434334,0.00020511278,0.011440128],"genre_scores_gemma":[0.753481,0.000004658507,0.24556255,0.0005870659,0.000053229316,0.00018045228,0.000008541622,0.00002007909,0.0001024367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985586,0.00009148313,0.0007011449,0.00014731153,0.0002976636,0.00020382144],"domain_scores_gemma":[0.99683625,0.0023964322,0.00019902167,0.00019773706,0.00023180926,0.00013872948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009459587,0.00017781908,0.00027467174,0.00022414456,0.00022994615,0.000081022285,0.0001740721,0.0000957785,0.00033599915],"category_scores_gemma":[0.00020418043,0.00015128838,0.00022496097,0.00073802395,0.000040088995,0.00090196123,7.2025983e-7,0.00019564055,0.000117867436],"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.00027609518,0.0001975901,4.1413438e-7,0.00054590835,0.00014092628,2.0412399e-7,0.0028959508,0.030266466,0.00033014166,0.7045198,0.00028063494,0.26054585],"study_design_scores_gemma":[0.00051547715,0.00017466725,0.0000011854929,0.000026473102,0.00014066763,0.0000021954525,0.00037588686,0.4056052,0.012386071,0.5801942,0.00039030134,0.00018771006],"about_ca_topic_score_codex":0.0000011843134,"about_ca_topic_score_gemma":3.1456153e-7,"teacher_disagreement_score":0.7526503,"about_ca_system_score_codex":0.000037949336,"about_ca_system_score_gemma":0.000034430388,"threshold_uncertainty_score":0.6169361},"labels":[],"label_agreement":null},{"id":"W3041773245","doi":"10.1109/tit.2020.3008973","title":"Design and Practical Decoding of Full-Diversity Construction A Lattices for Block-Fading Channels","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","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; Institute for Research in Fundamental Sciences","keywords":"Low-density parity-check code; Fading; Decoding methods; Lattice (music); List decoding; Algorithm; Computer science; Binary number; Algebraic structure; Mathematics; Block code; Theoretical computer science; Topology (electrical circuits); Concatenated error correction code; Combinatorics; Arithmetic; Pure mathematics; Physics","score_opus":0.07568244227812168,"score_gpt":0.2984073980971861,"score_spread":0.2227249558190644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041773245","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.0012008115,0.00003646552,0.99583805,0.0010717162,0.00079754787,0.0007179347,0.000018950226,0.00014542953,0.0001731259],"genre_scores_gemma":[0.774019,0.0004418651,0.22515751,0.00026170153,0.000024505252,0.00007454924,0.0000056715617,0.0000060234215,0.000009168069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00028545482,0.0004439244,0.00021407013,0.00019816677,0.00014596625],"domain_scores_gemma":[0.99776655,0.001056501,0.00042186154,0.0003692865,0.0002985306,0.00008723766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329693,0.00018742752,0.000253586,0.00027101932,0.0005958023,0.00020577769,0.0003726708,0.00016377665,0.000014629783],"category_scores_gemma":[0.00006461203,0.00019923362,0.00010131606,0.00021277595,0.000106767126,0.0013002981,0.00007903893,0.0004445922,0.0000075967546],"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.00085825863,0.00014232396,0.0000031679263,0.0007451197,0.0004670716,0.0000013410963,0.03901762,0.41064972,0.00096740824,0.20187183,0.00034737802,0.34492877],"study_design_scores_gemma":[0.00065167545,0.00017903573,0.0000046403284,0.00020775275,0.00008739496,0.000037460773,0.0004658033,0.974157,0.009216205,0.014352177,0.0003418431,0.00029900583],"about_ca_topic_score_codex":0.0000014045373,"about_ca_topic_score_gemma":8.3031176e-7,"teacher_disagreement_score":0.7728182,"about_ca_system_score_codex":0.000067646455,"about_ca_system_score_gemma":0.0001292491,"threshold_uncertainty_score":0.8124511},"labels":[],"label_agreement":null},{"id":"W3053432656","doi":"10.1109/tit.2020.3017127","title":"On Finding Bipartite Graphs With a Small Number of Short Cycles and Large Girth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":3,"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":"Bipartite graph; Combinatorics; Mathematics; Tanner graph; Discrete mathematics; Degree (music); Low-density parity-check code; Girth (graph theory); Time complexity; Complete bipartite graph; Graph; Algorithm; Decoding methods","score_opus":0.018327880795423034,"score_gpt":0.24767533766889085,"score_spread":0.22934745687346783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3053432656","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.13395348,0.0000023070934,0.86343247,0.00013055593,0.00007713055,0.00015273754,0.000011976663,0.00033893329,0.0019003932],"genre_scores_gemma":[0.9850008,0.000009405002,0.01425012,0.0006881878,0.000003992119,0.000026199124,0.0000012574648,0.0000069034772,0.000013163427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923,0.000058608475,0.00024758736,0.00013117435,0.0001854294,0.00014718987],"domain_scores_gemma":[0.99936956,0.00017091235,0.00009332507,0.00022953772,0.000063898005,0.00007275232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029196127,0.0001225578,0.00012648394,0.0001693264,0.00013539675,0.00006236852,0.00019424372,0.000052259904,0.000021161131],"category_scores_gemma":[0.000012149624,0.0001055398,0.000047312165,0.0003958637,0.000044741748,0.00090493984,0.0000036491306,0.00019688212,0.00002884904],"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.0008159356,0.00032140894,0.0010691037,0.00033789716,0.00018797575,0.0000097284255,0.045555275,0.009043006,0.0008547996,0.63139796,0.00029112687,0.31011578],"study_design_scores_gemma":[0.004551098,0.004480091,0.0036371802,0.0013929496,0.00021795,0.00040079246,0.0043831947,0.26443857,0.6204546,0.0891851,0.0041100127,0.0027484568],"about_ca_topic_score_codex":0.000004754494,"about_ca_topic_score_gemma":0.0000072557905,"teacher_disagreement_score":0.8510473,"about_ca_system_score_codex":0.000016449409,"about_ca_system_score_gemma":0.000025652758,"threshold_uncertainty_score":0.43037882},"labels":[],"label_agreement":null},{"id":"W3085262258","doi":"10.1109/tit.2020.3023962","title":"On List Recovery of High-Rate Tensor Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Google; Simons Foundation; United States-Israel Binational Science Foundation; European Research Council; National Science Foundation","keywords":"Decoding methods; List decoding; Probabilistic logic; Tensor product; Mathematics; Linear code; Upper and lower bounds; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code; Concatenated error correction code; Statistics","score_opus":0.015167629555816676,"score_gpt":0.2153799879103764,"score_spread":0.20021235835455972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085262258","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.0068631624,0.0000041693506,0.9888734,0.0008386665,0.00055689004,0.00013000693,0.00008292354,0.00016811625,0.0024826156],"genre_scores_gemma":[0.99015975,0.000025272217,0.006731721,0.0029670459,0.000020601989,0.000015667754,0.0000047808103,0.000004737664,0.00007041639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991023,0.00010072975,0.0003340969,0.00012329136,0.00020978016,0.00012979488],"domain_scores_gemma":[0.99902815,0.0003663677,0.00013496199,0.00030311052,0.000091177426,0.00007621107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027586528,0.000117634074,0.00014835711,0.00018480093,0.00016272647,0.000084311214,0.00041554807,0.000054124066,0.00015135044],"category_scores_gemma":[0.000024758416,0.00010963507,0.000108977234,0.0004340755,0.00007429225,0.0012565047,0.0000030601343,0.00019451504,0.00022984984],"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.00032878295,0.00015142286,5.767189e-7,0.000066823115,0.00006753141,0.0000013130718,0.002888622,0.081794925,0.0001886571,0.6631086,0.0008583561,0.2505444],"study_design_scores_gemma":[0.0027689557,0.0032208634,0.00033544932,0.00023488681,0.000048720045,0.00001854229,0.00080615917,0.30144304,0.20616403,0.4760089,0.007900948,0.0010495329],"about_ca_topic_score_codex":0.000013344009,"about_ca_topic_score_gemma":0.0000018975475,"teacher_disagreement_score":0.9832966,"about_ca_system_score_codex":0.000022271262,"about_ca_system_score_gemma":0.000037264515,"threshold_uncertainty_score":0.44707882},"labels":[],"label_agreement":null},{"id":"W3095036730","doi":"10.1109/tit.2020.3034469","title":"Distributed Source Simulation With No Communication","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Notation; Mathematics; Divergence (linguistics); Discrete mathematics; Algorithm; Combinatorics; Computer science; Arithmetic; Linguistics","score_opus":0.018241854921236787,"score_gpt":0.2386866876029684,"score_spread":0.22044483268173162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095036730","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.0005587377,0.000005487563,0.9895384,0.0072755935,0.00008750016,0.00023001905,0.000062164516,0.0013555757,0.00088654354],"genre_scores_gemma":[0.9384346,0.000012605697,0.060193054,0.0012383751,0.000007893467,0.000035804485,0.00005653281,0.000007241982,0.000013874093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901235,0.00010551039,0.00029046563,0.0001522254,0.0002771737,0.00016229693],"domain_scores_gemma":[0.9963927,0.00031890476,0.00016417228,0.0028822622,0.00017219248,0.00006975676],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002728075,0.00013524207,0.000107925036,0.00011948829,0.00027822782,0.00018713665,0.005741957,0.00009220136,0.000048008595],"category_scores_gemma":[0.00070315704,0.00012105626,0.000038898826,0.0005916029,0.00008749073,0.0035114044,0.00020993552,0.00031466977,0.00056131074],"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.0003168825,0.00009242222,0.000008383426,0.00006262127,0.00008018783,7.9690943e-7,0.002020389,0.73948216,0.00008761315,0.009980492,0.009803144,0.23806493],"study_design_scores_gemma":[0.00044044215,0.0001382114,0.000024337705,0.000026237885,0.000010041393,0.0000028078498,0.00014076717,0.9761731,0.0037951025,0.009603409,0.009465122,0.00018041513],"about_ca_topic_score_codex":0.000005054788,"about_ca_topic_score_gemma":8.851486e-7,"teacher_disagreement_score":0.93787587,"about_ca_system_score_codex":0.0000727856,"about_ca_system_score_gemma":0.000040662606,"threshold_uncertainty_score":0.9996374},"labels":[],"label_agreement":null},{"id":"W3107548225","doi":"10.1109/tit.2020.3040255","title":"Information Density in Multi-Layer Resistive Memories","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":1,"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":"Layer (electronics); Resistive touchscreen; Computer science; Materials science; Nanotechnology; Operating system","score_opus":0.022912714619729005,"score_gpt":0.23359460668806378,"score_spread":0.21068189206833476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107548225","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.07558698,0.0000058811042,0.9222966,0.00006700248,0.00032757537,0.00017538585,0.000019520321,0.00036019395,0.0011608733],"genre_scores_gemma":[0.9981839,0.0000150367005,0.0009813064,0.0007595151,0.000015733121,0.000016698577,0.000008927455,0.000006791092,0.000012077414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932325,0.000033268057,0.000339027,0.000045627057,0.000113866205,0.00014497082],"domain_scores_gemma":[0.9996546,0.00009225324,0.000047531605,0.00009342771,0.000048043363,0.00006414318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013288154,0.00012605364,0.000116123236,0.0001477385,0.000113399416,0.00003579024,0.00007946252,0.00006481434,0.00004207153],"category_scores_gemma":[0.000025216177,0.00013115178,0.00004409701,0.00027226057,0.000025498939,0.002742846,0.0000010717661,0.00029464843,0.00030103687],"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.00018524236,0.000010075897,0.0000038245016,0.00010055184,0.000014928849,8.4038504e-7,0.009959673,0.93562746,0.0008506523,0.0006242143,0.000063294545,0.052559223],"study_design_scores_gemma":[0.0022378697,0.00013480254,0.0011096429,0.00010037692,0.000028621216,0.000011739778,0.006607089,0.37604457,0.6082371,0.0009778723,0.0038412607,0.00066906895],"about_ca_topic_score_codex":0.0000012076499,"about_ca_topic_score_gemma":0.00000338481,"teacher_disagreement_score":0.92259693,"about_ca_system_score_codex":0.00006511906,"about_ca_system_score_gemma":0.000011930416,"threshold_uncertainty_score":0.53482145},"labels":[],"label_agreement":null},{"id":"W3113266841","doi":"10.1109/tit.2020.3045179","title":"Capacity Limits of Full-Duplex Cellular Network","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":6,"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; Huawei Technologies; National Natural Science Foundation of China","keywords":"Telecommunications link; Computer network; Computer science; Relay; Converse; Duplex (building); Mathematics; Physics","score_opus":0.020674005965716776,"score_gpt":0.19717258727237402,"score_spread":0.17649858130665724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113266841","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.13699605,0.00004922213,0.8594842,0.00020435175,0.00032213173,0.00021809744,0.00007950806,0.00046819245,0.0021782583],"genre_scores_gemma":[0.99648803,0.0000846144,0.002943734,0.000326014,0.00004166642,0.00004955122,0.00002069353,0.000022182117,0.000023499531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989733,0.000070846625,0.0004950387,0.00007314948,0.00018949574,0.0001981427],"domain_scores_gemma":[0.99911207,0.0001886911,0.00008767381,0.00040589154,0.0000922986,0.0001133666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019172199,0.00016564928,0.00018844222,0.000100991536,0.00014262825,0.000027953294,0.0003075905,0.00011312786,0.00036347576],"category_scores_gemma":[0.000014071553,0.00018175518,0.00011677814,0.000405766,0.00007993883,0.0005652778,0.0000015626329,0.0003578006,0.00040795578],"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.0000415489,0.000018545878,8.9518744e-7,0.000088880806,0.000055533976,1.0402448e-7,0.0020888841,0.9795512,0.0046705343,0.0038810163,0.000573355,0.00902953],"study_design_scores_gemma":[0.000464137,0.00009059017,0.00003560478,0.000047645924,0.00004464054,0.000003406726,0.00039692727,0.91447973,0.0772313,0.00008976441,0.006843528,0.0002726974],"about_ca_topic_score_codex":0.0000051599645,"about_ca_topic_score_gemma":0.0000045771967,"teacher_disagreement_score":0.859492,"about_ca_system_score_codex":0.000051442574,"about_ca_system_score_gemma":0.000020634086,"threshold_uncertainty_score":0.7411761},"labels":[],"label_agreement":null},{"id":"W3113771923","doi":"10.1109/tit.2021.3124598","title":"NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Logarithm; Compressed sensing; Rate of convergence; Algorithm; Inverse; Approximation error; Square root; Mathematics; Convergence (economics); Thresholding; Word error rate; Binary number; Mean squared error; Computer science; Key (lock); Arithmetic; Statistics; Mathematical analysis; Artificial intelligence; Image (mathematics)","score_opus":0.01472685111849848,"score_gpt":0.23878166739774134,"score_spread":0.22405481627924287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113771923","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.02136574,0.000040402603,0.97435415,0.000013603186,0.0012057482,0.0008426246,0.00021707728,0.0014031935,0.0005574655],"genre_scores_gemma":[0.8190459,0.00003487461,0.1801926,0.00014815551,0.000069530004,0.00013835165,0.00025209412,0.00008401325,0.00003447053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998587,0.00011067449,0.00049452955,0.0002508252,0.00023863718,0.00031829491],"domain_scores_gemma":[0.9985911,0.00017254706,0.00015318024,0.00063167326,0.00033789471,0.00011355897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003285299,0.0004286324,0.00039374185,0.00035993158,0.0002409929,0.00031214432,0.0002107229,0.0003093876,0.00003455506],"category_scores_gemma":[0.0000028778543,0.0004220236,0.00018586311,0.00015147211,0.00007960022,0.00045088635,0.000005331663,0.00065425143,0.000012554139],"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.000078689314,0.0000399879,1.36741996e-8,0.000087066095,0.00014261813,0.0000035163037,0.0012624749,0.8826385,0.00044015583,0.00006221115,0.000049506634,0.11519522],"study_design_scores_gemma":[0.000478811,0.00008368479,0.0000019057668,0.00034485108,0.000114977396,0.000020283205,0.0006438238,0.8060954,0.19130392,0.00011753064,0.00036496905,0.00042982778],"about_ca_topic_score_codex":0.000012841809,"about_ca_topic_score_gemma":0.0000056469253,"teacher_disagreement_score":0.79768014,"about_ca_system_score_codex":0.0001336849,"about_ca_system_score_gemma":0.00008930976,"threshold_uncertainty_score":0.99982315},"labels":[],"label_agreement":null},{"id":"W3121050167","doi":"10.1109/tit.2021.3049309","title":"Boundary of the Gaussian Han-Kobayashi Rate Region","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Boundary (topology); Gaussian; Mathematics; Interference (communication); Function (biology); Envelope (radar); Combinatorics; Channel (broadcasting); Topology (electrical circuits); Applied mathematics; Mathematical analysis; Computer science; Physics; Telecommunications","score_opus":0.00927483194062176,"score_gpt":0.21333466880189694,"score_spread":0.20405983686127518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121050167","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.014808731,0.00007637794,0.9667571,0.00035617163,0.0004742236,0.00017521445,0.000026697035,0.0004596358,0.016865859],"genre_scores_gemma":[0.9986949,0.00023652095,0.000516632,0.00027420532,0.000008268789,0.00004280025,0.000007757102,0.00001346599,0.0002054442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991983,0.00014796843,0.00034939538,0.00005155372,0.00014399289,0.0001087956],"domain_scores_gemma":[0.9990238,0.00011374198,0.00007780769,0.000667864,0.00008564195,0.000031122127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025069359,0.000106692896,0.00011125559,0.000114522554,0.00016753917,0.00004863281,0.0002577944,0.00009255062,0.00008779413],"category_scores_gemma":[0.000011750287,0.00009410575,0.0001077535,0.0003474646,0.0000971701,0.00068511383,0.0000025457582,0.0002896627,0.000046744874],"study_design_candidate":"bench_or_experimental","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.000249014,0.00042642673,0.000032738197,0.0010104589,0.0005518424,0.000004701941,0.028571302,0.18908995,0.028679801,0.19675525,0.009588429,0.5450401],"study_design_scores_gemma":[0.00039954542,0.00002464181,0.00041161274,0.00019259282,0.00003582807,0.000034289682,0.0010675765,0.009261743,0.9439275,0.011251618,0.03312934,0.00026367436],"about_ca_topic_score_codex":0.00000291973,"about_ca_topic_score_gemma":0.000008741834,"teacher_disagreement_score":0.9838862,"about_ca_system_score_codex":0.00007067746,"about_ca_system_score_gemma":0.00005592153,"threshold_uncertainty_score":0.38375214},"labels":[],"label_agreement":null},{"id":"W3123137409","doi":"10.1109/tit.2021.3053166","title":"Rate Splitting and Successive Decoding for Gaussian Interference Channels","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Interference (communication); Gaussian; List decoding; Mathematics; Sequential decoding; Coding (social sciences); Algorithm; Dirty paper coding; Joint (building); Computer science; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Statistics; Block code; Combinatorics; Concatenated error correction code; Precoding; MIMO; Physics","score_opus":0.013263367387529885,"score_gpt":0.24525816857805932,"score_spread":0.23199480119052943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123137409","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.009624668,0.000052986976,0.9870929,0.000117175376,0.00026938194,0.00019297091,0.000034556466,0.0004175997,0.0021977404],"genre_scores_gemma":[0.9945045,0.00018958074,0.004872251,0.000168636,0.000013718527,0.00016317189,0.000015380238,0.00001355387,0.000059200906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940354,0.000053243333,0.00028310655,0.00007104254,0.000056411493,0.00013268163],"domain_scores_gemma":[0.99917996,0.0003840296,0.00005313456,0.00022732982,0.00010922147,0.00004634048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031688862,0.00011085475,0.000113077214,0.00015185808,0.0001731499,0.00012763779,0.0001172397,0.000073204435,0.00005363385],"category_scores_gemma":[0.00002758066,0.00012266237,0.00004490775,0.00013968424,0.00003420209,0.0009822443,0.000002221714,0.0001797908,0.000015622752],"study_design_candidate":"design_other","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.00013987836,0.00006507999,0.0000045763272,0.0008108275,0.00019544893,0.0000015362989,0.01950149,0.06326586,0.008296236,0.12781584,0.00035974727,0.77954346],"study_design_scores_gemma":[0.000626713,0.000049695933,0.000016295297,0.0003170952,0.00003169458,0.000017145709,0.002832414,0.31164056,0.6684175,0.0128003275,0.002858785,0.0003917467],"about_ca_topic_score_codex":0.0000013153848,"about_ca_topic_score_gemma":0.0000037055609,"teacher_disagreement_score":0.98487985,"about_ca_system_score_codex":0.000048947342,"about_ca_system_score_gemma":0.000017999313,"threshold_uncertainty_score":0.5002026},"labels":[],"label_agreement":null},{"id":"W3123272013","doi":"10.1109/tit.2021.3053487","title":"Maximum Entropy Estimation of Density Function Using Order Statistics","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":8,"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 Victoria","funders":"","keywords":"Mathematics; Order statistic; Quantile; Statistic; Principle of maximum entropy; Applied mathematics; Divergence (linguistics); Entropy (arrow of time); Mathematical optimization; Parametric statistics; Estimation theory; Maximum entropy probability distribution; Sufficient statistic; Probability density function; Kullback–Leibler divergence; Statistics","score_opus":0.030122263193890733,"score_gpt":0.287290642662606,"score_spread":0.2571683794687153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123272013","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.026263017,0.000006479572,0.97161484,0.000041877334,0.00089024164,0.00023479285,0.00029284178,0.00011142882,0.00054447603],"genre_scores_gemma":[0.8914268,0.00001140125,0.10797318,0.00011948393,0.000026227584,0.000027386015,0.00013128492,0.000019380523,0.00026486188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983228,0.00020222279,0.0006979678,0.00013407075,0.0004596295,0.00018334202],"domain_scores_gemma":[0.9976619,0.00065372186,0.0003507848,0.0003495283,0.0009156983,0.00006839417],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033505922,0.00017570305,0.0002182863,0.00031745335,0.0003548849,0.0000535931,0.000079572994,0.00013300644,0.0012266325],"category_scores_gemma":[0.00027723776,0.00019171907,0.000110693996,0.00055324513,0.00009206421,0.0010726,0.000002467874,0.00024329346,0.00015495377],"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.00025351945,0.0004688256,0.000003455184,0.0001631223,0.00023510437,0.000001080353,0.0006421877,0.20373322,0.0022071558,0.7551733,0.00037739964,0.036741596],"study_design_scores_gemma":[0.0009890913,0.00010269006,0.00019901316,0.00008885563,0.00053235487,0.00004150538,0.00080655114,0.23760214,0.04154568,0.71755075,0.0002245953,0.00031677625],"about_ca_topic_score_codex":0.000019851268,"about_ca_topic_score_gemma":0.000018449775,"teacher_disagreement_score":0.8651638,"about_ca_system_score_codex":0.00018429905,"about_ca_system_score_gemma":0.00026533275,"threshold_uncertainty_score":0.99968636},"labels":[],"label_agreement":null},{"id":"W3135612806","doi":"10.1109/tit.2021.3129767","title":"Space–Time Codes From Sum-Rank Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"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":"Block code; Rank (graph theory); Generalization; Mathematics; Metric (unit); Concatenated error correction code; Construct (python library); Linear code; Expander code; Computer science; Discrete mathematics; Algorithm; Decoding methods; Combinatorics; Engineering","score_opus":0.010482989564470219,"score_gpt":0.22020837598437343,"score_spread":0.2097253864199032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135612806","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.013679399,0.00010593209,0.9767936,0.0003187885,0.0023400623,0.00031999545,0.00036258803,0.00074281247,0.0053368276],"genre_scores_gemma":[0.98058844,0.00018285062,0.017464623,0.0010026539,0.00008614286,0.00016032557,0.00018710314,0.000024185794,0.00030367798],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756426,0.00049054914,0.0006551967,0.00044509882,0.0005060756,0.00033884114],"domain_scores_gemma":[0.9970867,0.00072161923,0.00033785775,0.0014590032,0.00023986463,0.00015495616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000918337,0.00044254377,0.00045902943,0.00060357974,0.00042734115,0.0010115325,0.0012929082,0.00040964945,0.0008550375],"category_scores_gemma":[0.0000205785,0.00045748573,0.000509708,0.0005011604,0.00015284303,0.001972194,0.00003499328,0.0009880837,0.0006744298],"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.0006793861,0.0007894434,0.000014207871,0.00048615568,0.0017784998,0.000026000285,0.034274492,0.17074698,0.001426162,0.35941726,0.0015396641,0.42882174],"study_design_scores_gemma":[0.002754648,0.00032676788,0.00045933985,0.0019876212,0.0005906328,0.000053127405,0.0030222056,0.16043219,0.14149822,0.6752435,0.009733315,0.0038984169],"about_ca_topic_score_codex":0.00005157671,"about_ca_topic_score_gemma":0.0000086972605,"teacher_disagreement_score":0.96690905,"about_ca_system_score_codex":0.00009682854,"about_ca_system_score_gemma":0.00022492043,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W3136561982","doi":"10.1109/tit.2021.3138769","title":"Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Discrete mathematics; Markov process; Zero (linguistics); Coding (social sciences); Combinatorics; Algorithm; Statistics","score_opus":0.01219420957808383,"score_gpt":0.24095987537929608,"score_spread":0.22876566580121224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136561982","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.19993189,0.00015215101,0.79733473,0.000021586296,0.000055576467,0.0001865934,0.00055508077,0.00015541776,0.0016070002],"genre_scores_gemma":[0.96926343,0.0004922409,0.030074252,0.000036946894,0.0000041980957,0.000027551003,0.00006527532,0.000015811242,0.000020260708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984814,0.0002038857,0.0008397251,0.000092504524,0.0002587746,0.00012371854],"domain_scores_gemma":[0.9980225,0.0007941197,0.0002603448,0.00047452038,0.00039656166,0.000051964947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475026,0.00015867082,0.00033661845,0.00018871999,0.00011234947,0.000022639666,0.0001845836,0.00013003395,0.0001328583],"category_scores_gemma":[0.00005143861,0.00017849357,0.00010472915,0.00029281873,0.00030003686,0.0007454078,0.0000071562827,0.0002468947,0.0000033649305],"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.0004093186,0.00030890302,0.00008961327,0.0029253415,0.00042023958,0.0000011420137,0.02012737,0.9291094,0.012584721,0.014921942,0.00010416501,0.018997839],"study_design_scores_gemma":[0.00066004234,0.00010116313,0.0005431216,0.0003487052,0.000080046826,0.0000109228495,0.0023135392,0.24843183,0.7453045,0.0016361871,0.0002829286,0.00028699203],"about_ca_topic_score_codex":0.000029061042,"about_ca_topic_score_gemma":0.0000053836375,"teacher_disagreement_score":0.7693316,"about_ca_system_score_codex":0.000045281628,"about_ca_system_score_gemma":0.00007387232,"threshold_uncertainty_score":0.7278757},"labels":[],"label_agreement":null},{"id":"W3138307748","doi":"10.1109/tit.2022.3193316","title":"Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Popularity; Cache; Computer science; Upper and lower bounds; Parallel computing; Theoretical computer science; Algorithm; Mathematics","score_opus":0.010605159614481403,"score_gpt":0.20613410890999112,"score_spread":0.1955289492955097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138307748","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.010581166,0.000009309979,0.9859169,0.00045362374,0.0006804487,0.00053792563,0.00005435051,0.00023531944,0.0015309606],"genre_scores_gemma":[0.99592775,0.000004325342,0.0009944877,0.0018173248,0.000015961516,0.000444926,0.000017651988,0.000010249421,0.00076733995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987541,0.00015509389,0.00033777807,0.00016701833,0.00034299138,0.00024301244],"domain_scores_gemma":[0.9990222,0.00034259743,0.00014777061,0.00034897806,0.000067202076,0.00007124813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012133652,0.00016666284,0.0001605299,0.00029332246,0.0011022587,0.0001653324,0.00040569107,0.000034006403,0.000070085414],"category_scores_gemma":[0.0000036986005,0.00014488978,0.00012831802,0.0002700306,0.000028528064,0.0014745836,0.0000049523824,0.00029082887,0.000020707048],"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.0011707266,0.00007974837,2.984536e-7,0.000021002597,0.000084391926,8.196374e-7,0.0029441996,0.95448804,0.00010985218,0.013754016,0.00016459051,0.027182344],"study_design_scores_gemma":[0.015369653,0.0014932556,0.000019027502,0.00005228737,0.00013351542,0.00010835459,0.008506462,0.95391244,0.009177515,0.0064459154,0.0039726077,0.0008089889],"about_ca_topic_score_codex":0.000020656546,"about_ca_topic_score_gemma":0.000011545846,"teacher_disagreement_score":0.98534656,"about_ca_system_score_codex":0.00019340224,"about_ca_system_score_gemma":0.000100507306,"threshold_uncertainty_score":0.8477794},"labels":[],"label_agreement":null},{"id":"W3156699190","doi":"10.1109/tit.2023.3271316","title":"One-Shot Quantum State Redistribution and Quantum Markov Chains","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation Singapore; Harvard University; National Science Foundation","keywords":"Quantum channel; Conditional entropy; Quantum capacity; Quantum relative entropy; Quantum error correction; Quantum information; Quantum operation; Quantum discord; Quantum network; Quantum algorithm; Statistical physics; Quantum information science; Mathematics; Computer science; Open quantum system; Quantum; Quantum mechanics; Physics; Quantum entanglement; Principle of maximum entropy; Statistics","score_opus":0.020777402120530714,"score_gpt":0.24566066746144508,"score_spread":0.22488326534091435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156699190","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.018723916,0.000009882528,0.9762493,0.00062615925,0.0008384623,0.00028762335,0.00013322973,0.0009798119,0.0021516473],"genre_scores_gemma":[0.99824446,0.0001666349,0.0004728901,0.00086158095,0.000015576185,0.0000770731,0.0000621189,0.000008638778,0.00009101148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998316,0.00011561972,0.0005765591,0.00017801092,0.0004466359,0.00036715897],"domain_scores_gemma":[0.9988565,0.00017213442,0.00019829538,0.00045380983,0.00015412467,0.00016516427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009872398,0.00019798566,0.00017127286,0.0008651018,0.0005125772,0.00032893082,0.00036605215,0.00010287074,0.000051543306],"category_scores_gemma":[0.000017102475,0.00020502813,0.000112651425,0.0013817844,0.00011338938,0.0040051774,0.0000071859304,0.0002711544,0.0007641826],"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.000113257316,0.00006560227,0.000003452002,0.00008073516,0.000053766234,0.0000011935504,0.00638522,0.0019879017,0.00016221197,0.8255687,0.0011111879,0.16446677],"study_design_scores_gemma":[0.0015814578,0.00038732062,0.0016495452,0.00009300219,0.000027138967,0.000026569835,0.0019934704,0.86387616,0.009272316,0.11153996,0.0088214185,0.00073164375],"about_ca_topic_score_codex":0.000005387538,"about_ca_topic_score_gemma":0.0000018103775,"teacher_disagreement_score":0.97952056,"about_ca_system_score_codex":0.00005437753,"about_ca_system_score_gemma":0.00006450025,"threshold_uncertainty_score":0.98222756},"labels":[],"label_agreement":null},{"id":"W3163505986","doi":"10.1109/tit.2021.3079124","title":"New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":59,"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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Sequence (biology); Computer science; Complementary sequences; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics","score_opus":0.026502366856615955,"score_gpt":0.25675772026220933,"score_spread":0.2302553534055934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163505986","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.024079666,0.000042408345,0.97077364,0.00017258816,0.0010983077,0.00023421552,0.00081781147,0.00022226313,0.0025591056],"genre_scores_gemma":[0.95315284,0.00023765353,0.045900434,0.00033815156,0.00004070842,0.000028697359,0.00018446875,0.000022371547,0.00009470364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888855,0.00006983896,0.00053910876,0.0001083273,0.00021801269,0.00017616681],"domain_scores_gemma":[0.9993398,0.00014661474,0.00009362258,0.0002252853,0.00009309407,0.00010153695],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015971091,0.00017251038,0.00021116044,0.00020865336,0.00015425218,0.000039507864,0.00009507825,0.000053740758,0.0020538755],"category_scores_gemma":[0.000004419948,0.0001818126,0.000060526552,0.00025789635,0.00013322686,0.0008754158,0.0000018314248,0.00018785096,0.00004604725],"study_design_candidate":"bench_or_experimental","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.0008287235,0.00015597603,0.00013186713,0.0014516534,0.0013655025,0.000010661283,0.010829799,0.22927864,0.08665159,0.041507997,0.008292025,0.6194956],"study_design_scores_gemma":[0.0060184835,0.0003990861,0.0008516852,0.00049227296,0.00035093026,0.0013565033,0.024726525,0.025051795,0.85486794,0.022019077,0.06245253,0.0014131868],"about_ca_topic_score_codex":0.000034983186,"about_ca_topic_score_gemma":0.00003162166,"teacher_disagreement_score":0.92907315,"about_ca_system_score_codex":0.00009913532,"about_ca_system_score_gemma":0.00007279045,"threshold_uncertainty_score":0.9988584},"labels":[],"label_agreement":null},{"id":"W3183286299","doi":"10.1109/tit.2021.3100781","title":"Two-Way Source-Channel Coding","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Channel (broadcasting); Distributed source coding; Exploit; Decoding methods; Algorithm; Source code; Theoretical computer science; Computer network; Mathematics; Statistics","score_opus":0.022539314999622067,"score_gpt":0.25231251251290154,"score_spread":0.2297731975132795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183286299","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.00040076138,0.00005681452,0.9814476,0.00063919404,0.0006319789,0.00009066232,0.0000038587486,0.00027739833,0.016451726],"genre_scores_gemma":[0.9919742,0.0002849105,0.004147955,0.00232984,0.000024921304,0.000034150216,0.00000591849,0.000006371091,0.001191761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.00021851178,0.00030373465,0.00012854557,0.00019785143,0.00017872528],"domain_scores_gemma":[0.99873763,0.00024874182,0.00008545275,0.0006173917,0.00023178275,0.00007898616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046229674,0.00012107564,0.00011036129,0.00017345288,0.0005248795,0.00025952645,0.00043940038,0.00004644396,0.00024104833],"category_scores_gemma":[0.000018891795,0.00012369786,0.000089875255,0.00054440903,0.000037809943,0.0017268296,0.000009413628,0.00025539295,0.00049733545],"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.000018524492,0.00007748023,6.180939e-7,0.000012842836,0.000040993957,0.000001556351,0.006193768,0.05211335,0.00051892403,0.32661128,0.00045122448,0.61395943],"study_design_scores_gemma":[0.002668616,0.00013688693,0.00007327699,0.00021574499,0.00003722766,0.00015223118,0.002813407,0.73602134,0.17404473,0.017335616,0.06547175,0.0010291508],"about_ca_topic_score_codex":0.0000010903382,"about_ca_topic_score_gemma":0.0000059912095,"teacher_disagreement_score":0.9915734,"about_ca_system_score_codex":0.000064330365,"about_ca_system_score_gemma":0.00007433733,"threshold_uncertainty_score":0.6392407},"labels":[],"label_agreement":null},{"id":"W3193396119","doi":"10.1109/tit.2021.3107215","title":"Vector Gaussian Successive Refinement With Degraded Side Information","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Science Foundation of Tianjin City; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Converse; Mathematics; Gaussian; Monotone polygon; Quadratic equation; Upper and lower bounds; Random variable; Algorithm; Gaussian process; Matching (statistics); Gaussian random field; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.006778377218197648,"score_gpt":0.20762778639906698,"score_spread":0.20084940918086933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193396119","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.004232194,0.000037779228,0.9702486,0.00034784203,0.00020791889,0.0002610406,0.000063056366,0.0010493553,0.02355222],"genre_scores_gemma":[0.9952522,0.00017330966,0.003714099,0.00044698437,0.000010841321,0.00020766111,0.00011839971,0.000016792226,0.00005969343],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989202,0.00007581017,0.00046609747,0.00006677976,0.00028396468,0.00018714303],"domain_scores_gemma":[0.9989446,0.00013178804,0.000104363084,0.0005248217,0.00021673329,0.000077684635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019252782,0.00018757385,0.00015324341,0.00029065085,0.00018125631,0.00014955187,0.00019840557,0.000108965774,0.00025485622],"category_scores_gemma":[0.000012735978,0.00017960882,0.000062989144,0.00042287237,0.000050104827,0.0029091125,0.0000020909154,0.00033579164,0.00023994994],"study_design_candidate":"bench_or_experimental","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.00040726305,0.0002545652,0.000012284737,0.00070328615,0.0005422835,0.000007304182,0.021909101,0.20646721,0.0027438072,0.14276493,0.0017831225,0.6224048],"study_design_scores_gemma":[0.002366308,0.00024185995,0.00063597236,0.00042657566,0.00012409201,0.0000843412,0.0072741127,0.029190416,0.8766014,0.0024350528,0.07941535,0.0012045343],"about_ca_topic_score_codex":0.0000082657025,"about_ca_topic_score_gemma":0.000031730746,"teacher_disagreement_score":0.99102,"about_ca_system_score_codex":0.00017487722,"about_ca_system_score_gemma":0.00006817441,"threshold_uncertainty_score":0.7324235},"labels":[],"label_agreement":null},{"id":"W3194645875","doi":"10.1109/tit.2021.3104847","title":"Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"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":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Relay; Computer science; Duality (order theory); Beamforming; Channel (broadcasting); Computer network; Mathematical optimization; Mathematics; Power (physics); Telecommunications; Discrete mathematics","score_opus":0.0421963491770048,"score_gpt":0.28397457090203526,"score_spread":0.24177822172503047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194645875","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.009035875,0.00007371909,0.98808295,0.00068593264,0.00023048808,0.00020428578,0.000012481079,0.00018471241,0.0014895548],"genre_scores_gemma":[0.9923896,0.0002336552,0.0064865532,0.0006877667,0.000027488733,0.0000433494,0.000016772721,0.0000066233547,0.00010815653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988643,0.00024745578,0.0003426481,0.00018164935,0.00018682114,0.0001771268],"domain_scores_gemma":[0.998526,0.00043175477,0.00011363571,0.0005776992,0.00025257855,0.00009837901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044888747,0.00015117927,0.00016961723,0.00014254615,0.0006380094,0.00060747593,0.0004297296,0.00006800026,0.000041518135],"category_scores_gemma":[0.000015566786,0.00013657084,0.00004333595,0.00047503054,0.00009157486,0.002940784,0.000022103477,0.00032310843,0.000030566396],"study_design_candidate":"design_other","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.00006550726,0.00009033736,0.00017454242,0.000055567238,0.000096439595,0.000002842406,0.0070067015,0.040540077,0.00015784228,0.021992788,0.00008502589,0.9297323],"study_design_scores_gemma":[0.0057628243,0.00034878138,0.006300436,0.00083888764,0.00011945159,0.00023010607,0.0012596875,0.8633127,0.091880724,0.0060528796,0.02212939,0.001764082],"about_ca_topic_score_codex":0.0000031628656,"about_ca_topic_score_gemma":0.000007419133,"teacher_disagreement_score":0.98335373,"about_ca_system_score_codex":0.000041693347,"about_ca_system_score_gemma":0.0000744042,"threshold_uncertainty_score":0.5857904},"labels":[],"label_agreement":null},{"id":"W3196800729","doi":"10.1109/tit.2021.3099020","title":"Error Floor Analysis of LDPC Row Layered Decoders","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":11,"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; Computer science; Algorithm; Scheduling (production processes); Flooding (psychology); Schedule; Error floor; Decoding methods; Mathematics; Mathematical optimization","score_opus":0.013671819245897388,"score_gpt":0.25843046877430004,"score_spread":0.24475864952840265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196800729","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.009942371,0.000011400821,0.9855671,0.00015485588,0.00044922007,0.00010058412,0.000027509797,0.0004359764,0.0033109721],"genre_scores_gemma":[0.9709573,0.000013274835,0.028260596,0.00050681975,0.0000048628112,0.000029779436,0.000010530004,0.000006016188,0.00021086057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987341,0.00015800392,0.00047234347,0.00016074756,0.00030391142,0.00017088516],"domain_scores_gemma":[0.9985656,0.00021614238,0.00020291551,0.0006832607,0.00027041382,0.000061629755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005482463,0.00013105675,0.00022980465,0.0007879968,0.000141413,0.00008020951,0.00043143434,0.000099078745,0.000219171],"category_scores_gemma":[0.000037458074,0.000135881,0.0002348912,0.0019789306,0.000042014035,0.0014961675,0.0000043662835,0.00020587695,0.00007721913],"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.0001437661,0.00043197314,0.00004434005,0.00011374554,0.0019649272,0.00000783393,0.019518761,0.44578254,0.0034821928,0.05367753,0.000660861,0.47417152],"study_design_scores_gemma":[0.0005100912,0.00012924976,0.0005074906,0.00005159818,0.00044629123,0.00002080182,0.0015675469,0.5687535,0.42138717,0.0051192683,0.0010632612,0.00044378542],"about_ca_topic_score_codex":0.000023548513,"about_ca_topic_score_gemma":0.00005479793,"teacher_disagreement_score":0.96101487,"about_ca_system_score_codex":0.00006808153,"about_ca_system_score_gemma":0.00011837078,"threshold_uncertainty_score":0.55410665},"labels":[],"label_agreement":null},{"id":"W3200081493","doi":"10.1109/tit.2021.3112492","title":"A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":44,"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":"Guangxi Higher Institutions Scientific Research Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Notation; Matrix (chemical analysis); Mathematical notation; Computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","score_opus":0.01486356533431173,"score_gpt":0.23907085925973967,"score_spread":0.22420729392542793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200081493","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.014433808,0.00002253512,0.98328304,0.00011983946,0.0010492018,0.00020307218,0.000051002986,0.00012347524,0.000713998],"genre_scores_gemma":[0.94291556,0.000024988287,0.056350783,0.00057937676,0.000017805,0.000038602797,0.000008335866,0.0000056014223,0.000058961232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988964,0.000108715016,0.0004372866,0.00013686846,0.00022423887,0.00019648697],"domain_scores_gemma":[0.998577,0.00061353965,0.00018754242,0.0003325002,0.000230637,0.00005876902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043886757,0.00012115275,0.0001733431,0.00015004916,0.00023580914,0.000109651904,0.00023182345,0.000076636505,0.00004154725],"category_scores_gemma":[0.000046000077,0.0001255317,0.00017254047,0.00022015805,0.000037543774,0.0009984428,0.000003440881,0.00019925859,0.000013884404],"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.0004947818,0.00022707801,0.000011158345,0.00025243455,0.00031699272,0.0000032096818,0.010623595,0.19314128,0.008226209,0.5205984,0.00015593917,0.2659489],"study_design_scores_gemma":[0.006443901,0.00041791203,0.000014380292,0.00095240696,0.00020492513,0.00014693956,0.016928304,0.3940585,0.5372591,0.039386187,0.0030855369,0.0011019276],"about_ca_topic_score_codex":0.000005692774,"about_ca_topic_score_gemma":0.0000017869427,"teacher_disagreement_score":0.92848176,"about_ca_system_score_codex":0.000063492655,"about_ca_system_score_gemma":0.00012723084,"threshold_uncertainty_score":0.5119034},"labels":[],"label_agreement":null},{"id":"W3200992440","doi":"10.1109/tit.2021.3114584","title":"Minimum Feedback for Collision-Free Scheduling in Massive Random Access","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":16,"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":"Notation; Mathematics; Computer science; Discrete mathematics; Combinatorics; Algorithm; Arithmetic","score_opus":0.012921867751084611,"score_gpt":0.2544921354203341,"score_spread":0.2415702676692495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200992440","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.0057655866,0.00003166805,0.9869994,0.0001040007,0.0008843031,0.002390724,0.00008166988,0.00013732024,0.0036053075],"genre_scores_gemma":[0.988347,0.00009897487,0.004680068,0.00047166803,0.00011631053,0.00591365,0.00004505146,0.00003719473,0.00029006661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991336,0.000044716882,0.00039928276,0.00008382154,0.00012840224,0.00021018437],"domain_scores_gemma":[0.9991232,0.00041595663,0.00004742927,0.0002541877,0.000107898006,0.000051297957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034314097,0.00013760624,0.00017400477,0.00018056195,0.00012075696,0.00014930996,0.0001941033,0.00012760209,0.00019610203],"category_scores_gemma":[0.000027111724,0.00014137814,0.00010361932,0.00033622206,0.000019855366,0.0011456971,0.000001852921,0.00021160803,0.000053813026],"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.0003288365,0.000020417128,0.0000010927597,0.00012356203,0.000029643874,9.1640277e-7,0.0005075382,0.9752022,0.00007066712,0.0009867296,0.0006493556,0.022079015],"study_design_scores_gemma":[0.012190565,0.00008357808,0.000050634964,0.000431705,0.000044811237,0.0000103538105,0.0011680716,0.85245246,0.10088614,0.018164363,0.013940173,0.0005771576],"about_ca_topic_score_codex":0.0000014949815,"about_ca_topic_score_gemma":0.000011106923,"teacher_disagreement_score":0.98258144,"about_ca_system_score_codex":0.00008040616,"about_ca_system_score_gemma":0.00005276838,"threshold_uncertainty_score":0.5765233},"labels":[],"label_agreement":null},{"id":"W3202377376","doi":"10.1109/tit.2022.3197592","title":"A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"European Regional Development Fund; National Research Foundation of Korea; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Discretization; Gaussian; Algorithm; Mathematics; Lattice (music); Discrete mathematics; Theoretical computer science; Computer science","score_opus":0.013801175014339485,"score_gpt":0.23428728378413494,"score_spread":0.22048610876979546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202377376","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.0016385854,0.000009803011,0.9880997,0.0015449586,0.00059088995,0.00063449226,0.00008361128,0.00031304502,0.007084909],"genre_scores_gemma":[0.9689125,0.000012609255,0.023674669,0.0065378645,0.000023841838,0.00037866065,0.000079197955,0.0000111357585,0.00036956053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982709,0.00041341613,0.0004341108,0.00024199359,0.00041348563,0.00022603599],"domain_scores_gemma":[0.99858886,0.00017877933,0.000116030285,0.00080169423,0.00013711325,0.00017752527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059993326,0.00017805805,0.00018478613,0.00043015878,0.0010288605,0.00028026683,0.0011070485,0.000037886086,0.00014098475],"category_scores_gemma":[0.000014341486,0.0001829949,0.00008270343,0.0012236243,0.000025158864,0.0011054035,0.000054631153,0.00031850408,0.00022379452],"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.00015088699,0.00016012034,0.0000025212612,0.0000063550306,0.00005111373,3.8951654e-7,0.025232594,0.5976441,0.00022232071,0.14498493,0.0019060657,0.22963859],"study_design_scores_gemma":[0.0020404162,0.000734921,0.00037301713,0.00006696868,0.000042859276,0.000019050063,0.0031043335,0.807835,0.005988951,0.0062560253,0.17224409,0.0012943678],"about_ca_topic_score_codex":0.00001208474,"about_ca_topic_score_gemma":0.0000056129907,"teacher_disagreement_score":0.9672739,"about_ca_system_score_codex":0.00017838605,"about_ca_system_score_gemma":0.000068901216,"threshold_uncertainty_score":0.79132664},"labels":[],"label_agreement":null},{"id":"W3211079129","doi":"10.1109/tit.2022.3150597","title":"Decoder Ties Do Not Affect the Error Exponent of the Memoryless Binary Symmetric Channel","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Binary symmetric channel; Decoding methods; Probability of error; Binary number; Mathematics; Upper and lower bounds; Channel (broadcasting); Algorithm; Context (archaeology); Combinatorics; Binary erasure channel; Discrete mathematics; Coding (social sciences); Channel code; Computer science; Statistics; Channel capacity; Telecommunications; Arithmetic","score_opus":0.01571022881577252,"score_gpt":0.2302066348714496,"score_spread":0.21449640605567707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211079129","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.28488982,0.00042818938,0.69979525,0.0011298544,0.0022176662,0.0017846539,0.0003737669,0.0012419114,0.008138888],"genre_scores_gemma":[0.9989236,0.000102448685,0.000081901344,0.000263636,0.000007783661,0.0005299868,0.0000054597535,0.000019161997,0.00006603081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987485,0.0002988879,0.00037465658,0.000061602695,0.00037450148,0.00014187713],"domain_scores_gemma":[0.99868286,0.00036553084,0.00012103748,0.0007461816,0.000058719877,0.000025646073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080619095,0.0001391219,0.000133556,0.00036772268,0.0005394814,0.000034021894,0.0006891384,0.000052530642,0.00020087294],"category_scores_gemma":[0.000010360737,0.00010174199,0.00014609273,0.0007000774,0.000100518286,0.0004453045,0.0000144004125,0.00051047344,0.000022243892],"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.000120728255,0.00013817895,0.0000020265545,0.00014274725,0.00013269544,1.9864663e-7,0.018323513,0.92762405,0.0010006384,0.017941825,0.0014627376,0.03311066],"study_design_scores_gemma":[0.0018311897,0.0004283968,0.0013640859,0.00019492758,0.00022674327,0.00007100016,0.036274806,0.3349766,0.5914589,0.008935113,0.023030173,0.0012080538],"about_ca_topic_score_codex":0.000010556257,"about_ca_topic_score_gemma":0.00000319569,"teacher_disagreement_score":0.7140338,"about_ca_system_score_codex":0.00014582771,"about_ca_system_score_gemma":0.000025750227,"threshold_uncertainty_score":0.41493094},"labels":[],"label_agreement":null},{"id":"W3213378669","doi":"10.1109/tit.2023.3320098","title":"Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; King Abdullah University of Science and Technology; Google; National Science Foundation","keywords":"Overfitting; Interpolation (computer graphics); Artificial intelligence; Pattern recognition (psychology); Computer science; Lead (geology); Machine learning; Mathematics; Algorithm; Data mining; Artificial neural network; Geology; Image (mathematics)","score_opus":0.02861077349041017,"score_gpt":0.28863320351680366,"score_spread":0.26002243002639347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213378669","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.008948492,0.0000020216182,0.98369235,0.0023873344,0.0006401631,0.00029423335,0.000014578954,0.0006126398,0.0034081903],"genre_scores_gemma":[0.9922401,0.000013640717,0.0061773704,0.00095538114,0.000024964267,0.000120954835,0.000056977853,0.000009392307,0.00040122005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984317,0.00020437292,0.00053008023,0.00024983485,0.0003219235,0.0002620797],"domain_scores_gemma":[0.9987614,0.00032196823,0.00015255548,0.0005837301,0.00009027549,0.00009004129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012617242,0.00015069902,0.00012472393,0.0009660172,0.00018601766,0.0002285494,0.00048545186,0.000097944176,0.00003122343],"category_scores_gemma":[0.000086158536,0.00015583089,0.000058242065,0.0013479103,0.00002366012,0.0024232017,0.0000069466782,0.0003096096,0.0024610776],"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.000100330966,0.00009374992,0.00014652005,0.00003358631,0.00002239262,0.000001238622,0.01255325,0.08166648,0.002353508,0.09114589,0.0011211232,0.8107619],"study_design_scores_gemma":[0.00048713738,0.000081147315,0.00889129,0.0000465736,0.0000055442233,0.0000038302405,0.0010179636,0.9757869,0.0016432354,0.0015926255,0.010204827,0.00023892745],"about_ca_topic_score_codex":0.000028233166,"about_ca_topic_score_gemma":0.000020423955,"teacher_disagreement_score":0.9832916,"about_ca_system_score_codex":0.00012994652,"about_ca_system_score_gemma":0.000048876253,"threshold_uncertainty_score":0.99831563},"labels":[],"label_agreement":null},{"id":"W3216186171","doi":"10.1109/tit.2021.3130672","title":"Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Computer science; Combinatorics","score_opus":0.05892772905386916,"score_gpt":0.32781759948506356,"score_spread":0.2688898704311944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216186171","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.3441148,0.000033639866,0.654254,0.0001369004,0.00009681684,0.00019794916,0.00032964099,0.000019467152,0.00081675587],"genre_scores_gemma":[0.9980476,0.000019234167,0.0013255867,0.00007401389,0.000009697145,0.00008873825,0.00001138366,0.0000046823966,0.000419088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852675,0.0001461506,0.0007703725,0.00013097415,0.00030580314,0.00011996326],"domain_scores_gemma":[0.99755985,0.0011078948,0.00030026905,0.00032980242,0.00065174093,0.000050430965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013159543,0.00009915925,0.00021983797,0.000112525566,0.00017205108,0.00006451147,0.00017689099,0.00006936639,0.0003839731],"category_scores_gemma":[0.0003202487,0.00007874177,0.00013234314,0.00043715283,0.00026823967,0.0008251191,0.0000035156456,0.00008333476,0.000054390603],"study_design_candidate":"bench_or_experimental","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.0007238835,0.00036435822,0.000058171925,0.0002186594,0.00016271853,2.1710846e-7,0.007874971,0.0060439375,0.13797303,0.7045756,0.00029659754,0.14170787],"study_design_scores_gemma":[0.00048307292,0.000047033205,0.000057049187,0.00006358435,0.000044079196,0.000011565349,0.005794154,0.0016158982,0.8144408,0.17582433,0.0015076249,0.000110812],"about_ca_topic_score_codex":0.000002115183,"about_ca_topic_score_gemma":0.000001447356,"teacher_disagreement_score":0.6764678,"about_ca_system_score_codex":0.000016335447,"about_ca_system_score_gemma":0.00010350225,"threshold_uncertainty_score":0.4204236},"labels":[],"label_agreement":null},{"id":"W3217635768","doi":"10.1109/tit.2021.3130753","title":"Interference Alignment for the <i>K</i>-User MIMO Interference Channel","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"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 Waterloo","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Interference (communication); Channel (broadcasting); MIMO; Transmitter; Mathematics; Algorithm; Topology (electrical circuits); Discrete mathematics; Combinatorics; Computer science; Telecommunications; Arithmetic","score_opus":0.011101293968142552,"score_gpt":0.21886471907639016,"score_spread":0.2077634251082476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217635768","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.00010586648,0.000074970245,0.99519545,0.00010015837,0.0017082653,0.00041376392,0.00008301894,0.0002554196,0.0020630888],"genre_scores_gemma":[0.99654454,0.00016569564,0.0017632109,0.00032755765,0.000037503964,0.00047381033,0.000021116868,0.000022052303,0.00064451806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922055,0.00003439203,0.0003636789,0.00009687121,0.000099481935,0.0001850412],"domain_scores_gemma":[0.99913687,0.00029099357,0.000058885435,0.0003131491,0.00015569724,0.000044431978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020678331,0.00015907345,0.00012196846,0.000091835915,0.00017308311,0.00007822435,0.00016732614,0.00007290402,0.00012486034],"category_scores_gemma":[0.0000160056,0.00013281246,0.000084381514,0.00018478346,0.000034319528,0.0008539301,0.0000016300727,0.00016031839,0.0001232824],"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.00004725237,0.000017903569,1.3210301e-7,0.000081225095,0.0000658169,1.9963322e-7,0.0018941782,0.9654975,0.00044482728,0.0038861185,0.0005010561,0.027563773],"study_design_scores_gemma":[0.001457345,0.00014712218,0.0000069524626,0.00032269527,0.000112014895,0.000041096206,0.007153296,0.62453985,0.3441421,0.0040211906,0.017410751,0.0006455329],"about_ca_topic_score_codex":0.0000014560155,"about_ca_topic_score_gemma":0.000008348872,"teacher_disagreement_score":0.9964387,"about_ca_system_score_codex":0.00011030242,"about_ca_system_score_gemma":0.000025935733,"threshold_uncertainty_score":0.5415935},"labels":[],"label_agreement":null},{"id":"W4220797294","doi":"10.1109/tit.2022.3155349","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220797294","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4226151169","doi":"10.1109/tit.2023.3332425","title":"Degree-of-Freedom of Modulating Information in the Phases of Reconfigurable Intelligent Surface","year":2023,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Huawei Technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Aarhus Universitets Forskningsfond","keywords":"Transmitter; MIMO; Channel (broadcasting); Transmission (telecommunications); SIGNAL (programming language); Computer science; Path loss; Path (computing); Electronic engineering; Telecommunications; Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Computer network","score_opus":0.045166150927529146,"score_gpt":0.26641068414909036,"score_spread":0.2212445332215612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226151169","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.03873475,0.00008844712,0.9576513,0.000037838385,0.00041778496,0.0005725902,0.00027143388,0.00032077075,0.0019050685],"genre_scores_gemma":[0.9941315,0.0010521798,0.004619302,0.000007898205,0.000003007911,0.0000924296,0.000068676236,0.000014878423,0.000010113536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980423,0.000087297325,0.0013782679,0.000065757406,0.00028261275,0.00014375475],"domain_scores_gemma":[0.9975488,0.0007107037,0.0006146128,0.00090033,0.00021076055,0.000014756757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078693865,0.0002056658,0.00034388644,0.00068167126,0.000048004273,0.00002083536,0.0007333573,0.00025141507,0.000033791694],"category_scores_gemma":[0.000088529676,0.0001869957,0.00013290836,0.0005105987,0.00015237299,0.000977578,0.000009303947,0.00066920137,0.00001718525],"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.000029808758,0.000024690635,0.0000027282317,0.0005064945,0.00005077901,3.1041477e-8,0.004125051,0.9159277,0.00020892701,0.0017815697,0.000022071014,0.077320136],"study_design_scores_gemma":[0.000501026,0.00008785238,0.00009626961,0.0010172462,0.00004336501,0.000002298257,0.015755605,0.6444639,0.32375947,0.013673682,0.00023946303,0.0003598277],"about_ca_topic_score_codex":0.00007196649,"about_ca_topic_score_gemma":0.000017176333,"teacher_disagreement_score":0.9553968,"about_ca_system_score_codex":0.0000932199,"about_ca_system_score_gemma":0.000046728648,"threshold_uncertainty_score":0.76254636},"labels":[],"label_agreement":null},{"id":"W4226248578","doi":"10.1109/tit.2022.3163833","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Computer security; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226248578","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4226326665","doi":"10.1109/tit.2021.3137975","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226326665","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4226367741","doi":"10.1109/tit.2022.3147661","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Statistics; Mathematics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226367741","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4231770681","doi":"10.1109/tit.2019.2910956","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Information retrieval; Theoretical computer science; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231770681","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4232596258","doi":"10.1109/tit.2018.2881822","title":"IEEE Transactions on Information Theory publication information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Mathematics; Statistics","score_opus":0.009859260653836669,"score_gpt":0.2267323195932553,"score_spread":0.21687305893941863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232596258","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.00071259914,0.0000036592517,0.97809505,0.001505015,0.0017916678,0.0009330339,0.00014365009,0.0009054222,0.01590988],"genre_scores_gemma":[0.9853488,0.000052620166,0.004236419,0.00897931,0.00012192275,0.0006005573,0.00009876567,0.000017915365,0.0005436397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703634,0.0002309112,0.0012116361,0.00025543844,0.00074321945,0.00052243966],"domain_scores_gemma":[0.99672335,0.00038568463,0.0005957446,0.0011687932,0.0008762902,0.0002501092],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011869002,0.00041078354,0.00025333976,0.0010972411,0.0013309658,0.0010169373,0.0010035634,0.0002808003,0.0005118649],"category_scores_gemma":[0.000025905945,0.00039019663,0.00023106419,0.001575345,0.00022092405,0.023022909,0.0000031656064,0.00060609396,0.0073732766],"study_design_candidate":"design_other","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.00020040708,0.00014172938,3.095279e-7,0.000034220142,0.000058538175,1.1354978e-7,0.003964857,0.018158726,0.000056385554,0.20284365,0.0036575666,0.7708835],"study_design_scores_gemma":[0.004763006,0.0019849641,0.00025602864,0.00026442486,0.00020660422,0.00013251991,0.0023691405,0.43269992,0.12502897,0.07554904,0.3540324,0.0027129743],"about_ca_topic_score_codex":0.000016363068,"about_ca_topic_score_gemma":0.000006411242,"teacher_disagreement_score":0.98463625,"about_ca_system_score_codex":0.00023614563,"about_ca_system_score_gemma":0.00018391141,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4237535683","doi":"10.1109/tit.2013.2285984","title":"IEEE Transactions on Information Theory publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Information theory; Computer science; Information retrieval; Mathematics; Statistics","score_opus":0.008243812519496796,"score_gpt":0.21042254786751838,"score_spread":0.20217873534802158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237535683","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.0009413472,0.000004751901,0.98150176,0.002248285,0.0012398529,0.0014276244,0.00010340804,0.00089828373,0.011634718],"genre_scores_gemma":[0.9840628,0.00007046377,0.004196392,0.009214456,0.000057771438,0.0015914545,0.00012006281,0.000018683188,0.00066790695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698776,0.00022928513,0.0012722868,0.00024289111,0.00073662243,0.0005311575],"domain_scores_gemma":[0.99678755,0.00045216182,0.00059483707,0.0011228488,0.00076399103,0.00027858614],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000887387,0.0004242295,0.0002642224,0.0010631476,0.001021085,0.0014107012,0.0009833184,0.00028171315,0.0008410559],"category_scores_gemma":[0.000022548458,0.00039566393,0.00024904864,0.0013676139,0.00012436294,0.03290255,0.0000029902872,0.00068753236,0.0111869],"study_design_candidate":"design_other","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.00006946313,0.00013803814,3.4793436e-7,0.000039966853,0.000052647505,7.951882e-8,0.0025124508,0.053324584,0.000059330076,0.1428481,0.0046477444,0.79630727],"study_design_scores_gemma":[0.0048958426,0.0011654389,0.0005331019,0.0002594086,0.00018854062,0.00012235313,0.0032554676,0.6361192,0.06427283,0.11258806,0.17355052,0.0030492335],"about_ca_topic_score_codex":0.000039417384,"about_ca_topic_score_gemma":0.0000033257238,"teacher_disagreement_score":0.98312145,"about_ca_system_score_codex":0.00023428086,"about_ca_system_score_gemma":0.00015215838,"threshold_uncertainty_score":0.9998495},"labels":[],"label_agreement":null},{"id":"W4239836826","doi":"10.1109/tit.2018.2876186","title":"IEEE Transactions on Information Theory publication information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009859260653836669,"score_gpt":0.2267323195932553,"score_spread":0.21687305893941863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239836826","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.00071259914,0.0000036592517,0.97809505,0.001505015,0.0017916678,0.0009330339,0.00014365009,0.0009054222,0.01590988],"genre_scores_gemma":[0.9853488,0.000052620166,0.004236419,0.00897931,0.00012192275,0.0006005573,0.00009876567,0.000017915365,0.0005436397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703634,0.0002309112,0.0012116361,0.00025543844,0.00074321945,0.00052243966],"domain_scores_gemma":[0.99672335,0.00038568463,0.0005957446,0.0011687932,0.0008762902,0.0002501092],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011869002,0.00041078354,0.00025333976,0.0010972411,0.0013309658,0.0010169373,0.0010035634,0.0002808003,0.0005118649],"category_scores_gemma":[0.000025905945,0.00039019663,0.00023106419,0.001575345,0.00022092405,0.023022909,0.0000031656064,0.00060609396,0.0073732766],"study_design_candidate":"design_other","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.00020040708,0.00014172938,3.095279e-7,0.000034220142,0.000058538175,1.1354978e-7,0.003964857,0.018158726,0.000056385554,0.20284365,0.0036575666,0.7708835],"study_design_scores_gemma":[0.004763006,0.0019849641,0.00025602864,0.00026442486,0.00020660422,0.00013251991,0.0023691405,0.43269992,0.12502897,0.07554904,0.3540324,0.0027129743],"about_ca_topic_score_codex":0.000016363068,"about_ca_topic_score_gemma":0.000006411242,"teacher_disagreement_score":0.98463625,"about_ca_system_score_codex":0.00023614563,"about_ca_system_score_gemma":0.00018391141,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4241735485","doi":"10.1109/tit.2013.2281126","title":"IEEE Transactions on Information Theory publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Information theory; Computer science; Computer security; Information retrieval; Mathematics; Statistics","score_opus":0.008243812519496796,"score_gpt":0.21042254786751838,"score_spread":0.20217873534802158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241735485","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.0009413472,0.000004751901,0.98150176,0.002248285,0.0012398529,0.0014276244,0.00010340804,0.00089828373,0.011634718],"genre_scores_gemma":[0.9840628,0.00007046377,0.004196392,0.009214456,0.000057771438,0.0015914545,0.00012006281,0.000018683188,0.00066790695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698776,0.00022928513,0.0012722868,0.00024289111,0.00073662243,0.0005311575],"domain_scores_gemma":[0.99678755,0.00045216182,0.00059483707,0.0011228488,0.00076399103,0.00027858614],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000887387,0.0004242295,0.0002642224,0.0010631476,0.001021085,0.0014107012,0.0009833184,0.00028171315,0.0008410559],"category_scores_gemma":[0.000022548458,0.00039566393,0.00024904864,0.0013676139,0.00012436294,0.03290255,0.0000029902872,0.00068753236,0.0111869],"study_design_candidate":"design_other","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.00006946313,0.00013803814,3.4793436e-7,0.000039966853,0.000052647505,7.951882e-8,0.0025124508,0.053324584,0.000059330076,0.1428481,0.0046477444,0.79630727],"study_design_scores_gemma":[0.0048958426,0.0011654389,0.0005331019,0.0002594086,0.00018854062,0.00012235313,0.0032554676,0.6361192,0.06427283,0.11258806,0.17355052,0.0030492335],"about_ca_topic_score_codex":0.000039417384,"about_ca_topic_score_gemma":0.0000033257238,"teacher_disagreement_score":0.98312145,"about_ca_system_score_codex":0.00023428086,"about_ca_system_score_gemma":0.00015215838,"threshold_uncertainty_score":0.9998495},"labels":[],"label_agreement":null},{"id":"W4243526850","doi":"10.1109/tit.2017.2763858","title":"IEEE Transactions on Information Theory publication information","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.012543147841475616,"score_gpt":0.23790893327885437,"score_spread":0.22536578543737876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243526850","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.0006704429,0.0000038262237,0.9753776,0.0024745492,0.001771177,0.00094207184,0.00016879152,0.0006692528,0.01792226],"genre_scores_gemma":[0.99075407,0.000084304746,0.0028503987,0.0048575117,0.00006903938,0.0006459795,0.000082137354,0.000016440503,0.000640126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972027,0.00017952238,0.0011330027,0.0002514228,0.0007351479,0.00049819914],"domain_scores_gemma":[0.9958235,0.0003373134,0.0009936615,0.0019872843,0.0006063836,0.00025188306],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0012419131,0.00041260038,0.00027322143,0.00083014683,0.0027770507,0.0024460966,0.0016715243,0.00028392364,0.00027206063],"category_scores_gemma":[0.000044542096,0.00039355754,0.00026606402,0.00054612017,0.00019427008,0.034854755,0.0000048284846,0.00069524423,0.003920434],"study_design_candidate":"design_other","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.0001428076,0.00011917217,6.717603e-7,0.000038373953,0.0000547723,1.905642e-7,0.0020750728,0.031827834,0.00003189237,0.1975997,0.0018730358,0.7662365],"study_design_scores_gemma":[0.007382881,0.0012847722,0.0012481177,0.00041476302,0.00029268055,0.00014915643,0.0021988906,0.4930989,0.08580794,0.110890664,0.29359055,0.0036406715],"about_ca_topic_score_codex":0.000028553457,"about_ca_topic_score_gemma":0.000007142492,"teacher_disagreement_score":0.99008363,"about_ca_system_score_codex":0.00021421757,"about_ca_system_score_gemma":0.00017412301,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W4245823426","doi":"10.1109/tit.2019.2922560","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245823426","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4248611014","doi":"10.1109/tit.2018.2836451","title":"IEEE Transactions on Information Theory publication information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009859260653836669,"score_gpt":0.2267323195932553,"score_spread":0.21687305893941863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248611014","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.00071259914,0.0000036592517,0.97809505,0.001505015,0.0017916678,0.0009330339,0.00014365009,0.0009054222,0.01590988],"genre_scores_gemma":[0.9853488,0.000052620166,0.004236419,0.00897931,0.00012192275,0.0006005573,0.00009876567,0.000017915365,0.0005436397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703634,0.0002309112,0.0012116361,0.00025543844,0.00074321945,0.00052243966],"domain_scores_gemma":[0.99672335,0.00038568463,0.0005957446,0.0011687932,0.0008762902,0.0002501092],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011869002,0.00041078354,0.00025333976,0.0010972411,0.0013309658,0.0010169373,0.0010035634,0.0002808003,0.0005118649],"category_scores_gemma":[0.000025905945,0.00039019663,0.00023106419,0.001575345,0.00022092405,0.023022909,0.0000031656064,0.00060609396,0.0073732766],"study_design_candidate":"design_other","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.00020040708,0.00014172938,3.095279e-7,0.000034220142,0.000058538175,1.1354978e-7,0.003964857,0.018158726,0.000056385554,0.20284365,0.0036575666,0.7708835],"study_design_scores_gemma":[0.004763006,0.0019849641,0.00025602864,0.00026442486,0.00020660422,0.00013251991,0.0023691405,0.43269992,0.12502897,0.07554904,0.3540324,0.0027129743],"about_ca_topic_score_codex":0.000016363068,"about_ca_topic_score_gemma":0.000006411242,"teacher_disagreement_score":0.98463625,"about_ca_system_score_codex":0.00023614563,"about_ca_system_score_gemma":0.00018391141,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4248786075","doi":"10.1109/tit.2013.2272495","title":"IEEE Transactions on Information Theory publication information","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Computer science; Information theory; Mathematics; Statistics","score_opus":0.008243812519496796,"score_gpt":0.21042254786751838,"score_spread":0.20217873534802158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248786075","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.0009413472,0.000004751901,0.98150176,0.002248285,0.0012398529,0.0014276244,0.00010340804,0.00089828373,0.011634718],"genre_scores_gemma":[0.9840628,0.00007046377,0.004196392,0.009214456,0.000057771438,0.0015914545,0.00012006281,0.000018683188,0.00066790695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698776,0.00022928513,0.0012722868,0.00024289111,0.00073662243,0.0005311575],"domain_scores_gemma":[0.99678755,0.00045216182,0.00059483707,0.0011228488,0.00076399103,0.00027858614],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000887387,0.0004242295,0.0002642224,0.0010631476,0.001021085,0.0014107012,0.0009833184,0.00028171315,0.0008410559],"category_scores_gemma":[0.000022548458,0.00039566393,0.00024904864,0.0013676139,0.00012436294,0.03290255,0.0000029902872,0.00068753236,0.0111869],"study_design_candidate":"design_other","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.00006946313,0.00013803814,3.4793436e-7,0.000039966853,0.000052647505,7.951882e-8,0.0025124508,0.053324584,0.000059330076,0.1428481,0.0046477444,0.79630727],"study_design_scores_gemma":[0.0048958426,0.0011654389,0.0005331019,0.0002594086,0.00018854062,0.00012235313,0.0032554676,0.6361192,0.06427283,0.11258806,0.17355052,0.0030492335],"about_ca_topic_score_codex":0.000039417384,"about_ca_topic_score_gemma":0.0000033257238,"teacher_disagreement_score":0.98312145,"about_ca_system_score_codex":0.00023428086,"about_ca_system_score_gemma":0.00015215838,"threshold_uncertainty_score":0.9998495},"labels":[],"label_agreement":null},{"id":"W4250965548","doi":"10.1109/tit.2019.2926694","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250965548","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4252414370","doi":"10.1109/tit.2019.2893007","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252414370","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4253393619","doi":"10.1109/tit.2019.2898915","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253393619","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4254024741","doi":"10.1109/tit.2019.2905061","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254024741","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4255425592","doi":"10.1109/tit.2018.2826784","title":"IEEE Transactions on Information Theory publication information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Computer security; Mathematics; Statistics","score_opus":0.009859260653836669,"score_gpt":0.2267323195932553,"score_spread":0.21687305893941863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255425592","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.00071259914,0.0000036592517,0.97809505,0.001505015,0.0017916678,0.0009330339,0.00014365009,0.0009054222,0.01590988],"genre_scores_gemma":[0.9853488,0.000052620166,0.004236419,0.00897931,0.00012192275,0.0006005573,0.00009876567,0.000017915365,0.0005436397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703634,0.0002309112,0.0012116361,0.00025543844,0.00074321945,0.00052243966],"domain_scores_gemma":[0.99672335,0.00038568463,0.0005957446,0.0011687932,0.0008762902,0.0002501092],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011869002,0.00041078354,0.00025333976,0.0010972411,0.0013309658,0.0010169373,0.0010035634,0.0002808003,0.0005118649],"category_scores_gemma":[0.000025905945,0.00039019663,0.00023106419,0.001575345,0.00022092405,0.023022909,0.0000031656064,0.00060609396,0.0073732766],"study_design_candidate":"design_other","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.00020040708,0.00014172938,3.095279e-7,0.000034220142,0.000058538175,1.1354978e-7,0.003964857,0.018158726,0.000056385554,0.20284365,0.0036575666,0.7708835],"study_design_scores_gemma":[0.004763006,0.0019849641,0.00025602864,0.00026442486,0.00020660422,0.00013251991,0.0023691405,0.43269992,0.12502897,0.07554904,0.3540324,0.0027129743],"about_ca_topic_score_codex":0.000016363068,"about_ca_topic_score_gemma":0.000006411242,"teacher_disagreement_score":0.98463625,"about_ca_system_score_codex":0.00023614563,"about_ca_system_score_gemma":0.00018391141,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4256207213","doi":"10.1109/tit.2018.2886695","title":"IEEE Transactions on Information Theory publication information","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.007383270973087514,"score_gpt":0.21237916444984037,"score_spread":0.20499589347675284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256207213","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.0017611668,0.0000047298413,0.97675866,0.0012743387,0.0018015781,0.0013045116,0.00014038383,0.0008085163,0.016146088],"genre_scores_gemma":[0.9884364,0.00006216102,0.0025086578,0.0072975415,0.00004578394,0.0005668499,0.00012780025,0.000018020497,0.0009367601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970459,0.00021955663,0.0011960954,0.00026012957,0.00077788974,0.00050047704],"domain_scores_gemma":[0.9969184,0.0004607175,0.00060473057,0.0012367709,0.00055628706,0.00022312572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011147712,0.0004125719,0.00028252916,0.0010719263,0.0007288349,0.00095485925,0.0009778944,0.00028352448,0.00065288733],"category_scores_gemma":[0.0000160087,0.00039292715,0.0002640009,0.0013831971,0.000088206536,0.024584675,0.0000030147105,0.000705324,0.011329563],"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.00019196249,0.00014914223,9.693994e-7,0.00006572751,0.0000640161,1.10942466e-7,0.002894124,0.11892681,0.000075782336,0.2375852,0.0018193661,0.6382268],"study_design_scores_gemma":[0.0063422616,0.0015005065,0.0003926256,0.0003284827,0.00019180871,0.00012148259,0.0029697788,0.57864577,0.06913903,0.05676823,0.28055188,0.0030481284],"about_ca_topic_score_codex":0.000014048391,"about_ca_topic_score_gemma":0.000002614576,"teacher_disagreement_score":0.98667526,"about_ca_system_score_codex":0.00024849412,"about_ca_system_score_gemma":0.00017723184,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W4280632894","doi":"10.1109/tit.2022.3166330","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Computer security; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280632894","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4283034429","doi":"10.1109/tit.2022.3178828","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Theoretical computer science; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283034429","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4285082555","doi":"10.1109/tit.2022.3186602","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285082555","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4285147830","doi":"10.1109/tit.2022.3187669","title":"State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","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 Toronto","funders":"","keywords":"Relay; Linear network coding; Computer science; Header; Network packet; Upper and lower bounds; Computer network; Telecommunications link; Mathematics","score_opus":0.01148312834417782,"score_gpt":0.24025608922336264,"score_spread":0.2287729608791848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285147830","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.010029818,0.00013721178,0.9877249,0.000237833,0.00054519996,0.00027381143,0.000025417594,0.00022161978,0.000804177],"genre_scores_gemma":[0.9956085,0.00065122015,0.0016718773,0.0014375492,0.000009710396,0.00016682163,0.000008692305,0.00000896187,0.0004366858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00034980362,0.00037228,0.00016389426,0.0002856508,0.00021240844],"domain_scores_gemma":[0.9988172,0.00033079117,0.00013533265,0.0005370526,0.00008300925,0.00009661697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723391,0.00015057919,0.00013734393,0.00023904092,0.0009242794,0.00020143526,0.0005304259,0.000038621623,0.00024982874],"category_scores_gemma":[0.000008469896,0.00015320179,0.00006505112,0.00037437753,0.00005413711,0.0014676735,0.00003250328,0.00045355072,0.000036586145],"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.00009204469,0.00007935632,0.000014183284,0.000007802001,0.000044693188,0.0000010495556,0.006690669,0.6447533,0.000041543364,0.021478,0.000417724,0.3263797],"study_design_scores_gemma":[0.0010535985,0.00014762853,0.00023070822,0.000018179975,0.000015012207,0.000026854805,0.0006417224,0.9849343,0.0009400085,0.0014804743,0.010183947,0.0003276139],"about_ca_topic_score_codex":0.0000052482255,"about_ca_topic_score_gemma":0.000018368171,"teacher_disagreement_score":0.98605305,"about_ca_system_score_codex":0.00013266127,"about_ca_system_score_gemma":0.000049532788,"threshold_uncertainty_score":0.7108903},"labels":[],"label_agreement":null},{"id":"W4292261520","doi":"10.1109/tit.2022.3195652","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Theoretical computer science; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292261520","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4296131057","doi":"10.1109/tit.2022.3202450","title":"IEEE Transactions on Information Theory publication information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Information theory; Computer science; Theoretical computer science; Information retrieval; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296131057","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4308468268","doi":"10.1109/tit.2022.3211169","title":"IEEE Transactions on Information Theory Publication Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Theoretical computer science; Mathematics; Statistics","score_opus":0.009156959172592861,"score_gpt":0.21540977404581182,"score_spread":0.20625281487321898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308468268","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.0006295061,0.0000062532613,0.98455584,0.0019678748,0.0017525624,0.0010748762,0.00032877782,0.0008517227,0.008832612],"genre_scores_gemma":[0.98488784,0.000044897602,0.0021214,0.01014752,0.000045789533,0.0018682175,0.00021021217,0.00001869045,0.00065541227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0003871082,0.0012004932,0.00025144394,0.00099864,0.0004912954],"domain_scores_gemma":[0.9972165,0.0004340467,0.0006404491,0.0010896904,0.000407665,0.00021162996],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014901024,0.0003792772,0.00024869194,0.001227242,0.0022058405,0.00078388455,0.0011656485,0.0001547862,0.000925845],"category_scores_gemma":[0.000016490392,0.00039103298,0.0002641272,0.0018161201,0.00009693323,0.017775962,0.0000062531267,0.00095374056,0.0020072681],"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.00018315883,0.0001770099,2.408658e-7,0.000027709422,0.000049523296,2.04856e-7,0.003536651,0.26369184,0.000030483186,0.18497625,0.0033392804,0.54398763],"study_design_scores_gemma":[0.004108231,0.001365013,0.0001189433,0.00007560233,0.00015776447,0.00018099612,0.0047244057,0.45790768,0.022519488,0.05442363,0.45227772,0.0021405113],"about_ca_topic_score_codex":0.000017974737,"about_ca_topic_score_gemma":0.0000024949086,"teacher_disagreement_score":0.98425835,"about_ca_system_score_codex":0.000417809,"about_ca_system_score_gemma":0.00021857268,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W4312763750","doi":"10.1109/tit.2022.3227538","title":"Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Università degli Studi dell'Aquila; Centre National de la Recherche Scientifique; Killam Trusts; Bundesministerium für Bildung und Forschung; University of Technology Sydney; University of New South Wales; School of Electronic Engineering and Computer Science, Queen Mary University of London; Académie des Sciences, Institut de France; Queen Mary University of London; Commonwealth Scientific and Industrial Research Organisation; National Science Foundation; Beijing University of Posts and Telecommunications; European Commission; Alexander von Humboldt-Stiftung; Vodafone Foundation; University of Warwick; Northumbria University; Deutsche Forschungsgemeinschaft; Nokia Foundation; Jiangsu Science and Technology Department; China Scholarship Council; University of Essex; National Natural Science Foundation of China; Royal Academy of Engineering","keywords":"Rician fading; MIMO; Fading; Computer science; Channel state information; Beamforming; Transmitter power output; Base station; Channel (broadcasting); Spatial correlation; Control theory (sociology); Algorithm; Electronic engineering; Wireless; Telecommunications; Engineering; Transmitter","score_opus":0.015442856237525065,"score_gpt":0.22243749516262468,"score_spread":0.20699463892509962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312763750","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.002513976,0.00016478941,0.9926837,0.000056273188,0.00047435306,0.0011653516,0.00014232993,0.0011235835,0.0016756072],"genre_scores_gemma":[0.98957664,0.00012275994,0.008340028,0.000043303182,0.0000057096904,0.0015459844,0.00003009731,0.000037981103,0.0002974938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989212,0.00012127054,0.00041194906,0.000110546134,0.00018772778,0.00024729114],"domain_scores_gemma":[0.99866414,0.000535708,0.00012340603,0.00052814273,0.00010364577,0.000044977656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004745659,0.00020037757,0.00020443251,0.0002591702,0.00048843614,0.00006270548,0.0003562808,0.0000635097,0.00017220058],"category_scores_gemma":[0.000010014567,0.00019615373,0.00007390811,0.00034560167,0.000063700616,0.0007814413,0.000002429273,0.00038997625,0.000061582556],"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.0001563618,0.000023280121,2.475105e-7,0.0000563804,0.000076572374,2.0550424e-7,0.0006115972,0.9775185,0.00065055897,0.0031488524,0.000267144,0.017490322],"study_design_scores_gemma":[0.0011389758,0.00045552186,8.8876806e-7,0.000056267254,0.00003961825,0.000026307178,0.011489353,0.67312247,0.30435225,0.0021056477,0.006734833,0.00047787564],"about_ca_topic_score_codex":0.000007419323,"about_ca_topic_score_gemma":0.0000016122814,"teacher_disagreement_score":0.9870627,"about_ca_system_score_codex":0.00036294523,"about_ca_system_score_gemma":0.000043121752,"threshold_uncertainty_score":0.7998917},"labels":[],"label_agreement":null},{"id":"W4312881858","doi":"10.1109/tit.2022.3222231","title":"Almost Optimal Variance-Constrained Best Arm Identification","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"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 Alberta","funders":"Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Identification (biology); Computer science; Variance (accounting); Algorithm; Mathematical optimization; Statistics; Mathematics","score_opus":0.0076063456983573785,"score_gpt":0.22817551988501886,"score_spread":0.22056917418666147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312881858","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.0014308406,0.0000065767276,0.99101454,0.0005675553,0.0014273645,0.00017814353,0.00004822935,0.0002971336,0.005029627],"genre_scores_gemma":[0.98867285,0.0000054357624,0.008567811,0.00063417864,0.00003269307,0.00016367613,0.000022039481,0.0000075289645,0.0018937921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987047,0.0001961993,0.0003685051,0.00016759725,0.00037289274,0.00019011582],"domain_scores_gemma":[0.9991537,0.00012287729,0.00017468886,0.00041566783,0.000067132314,0.00006593686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085027586,0.00012516479,0.00009857584,0.00029048428,0.0009256374,0.000210756,0.000557694,0.000035211935,0.00069125067],"category_scores_gemma":[0.000010382671,0.00013429135,0.00008467841,0.0005033236,0.000045266257,0.001557182,0.000006486668,0.00042044953,0.000497557],"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.00003898581,0.00019127638,7.472301e-7,0.000011761876,0.000028600489,0.0000017355169,0.0036804052,0.5036213,0.000111228495,0.075535655,0.00019707077,0.41658127],"study_design_scores_gemma":[0.0010526865,0.0004554013,0.000059768292,0.000014398388,0.000027213158,0.00015786648,0.001985769,0.9641205,0.004283738,0.006534106,0.02084931,0.00045924893],"about_ca_topic_score_codex":0.000012964755,"about_ca_topic_score_gemma":3.4810938e-7,"teacher_disagreement_score":0.987242,"about_ca_system_score_codex":0.0000883159,"about_ca_system_score_gemma":0.0000849859,"threshold_uncertainty_score":0.75687104},"labels":[],"label_agreement":null},{"id":"W4319302639","doi":"10.1109/tit.2023.3242612","title":"Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Reed–Solomon error correction; Mathematics; Finite field; Reed–Muller code; Factorial; Linear code; Simple (philosophy); Distribution (mathematics); Discrete mathematics; Error detection and correction; Function (biology); Combinatorics; Decoding methods; Block code; Algorithm; Mathematical analysis","score_opus":0.013738735108576653,"score_gpt":0.245341328404443,"score_spread":0.23160259329586635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319302639","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.0031484521,0.000012507177,0.99476177,0.00032816874,0.0007002292,0.00034441878,0.00022088486,0.0002712121,0.00021233445],"genre_scores_gemma":[0.9989911,0.000023884206,0.000523866,0.00012739343,0.000013844289,0.00017830804,0.000029237815,0.000004527622,0.0001078883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.00006861324,0.0003152348,0.00010790136,0.00016172825,0.00018536838],"domain_scores_gemma":[0.9985278,0.0007251315,0.00015241139,0.00043390665,0.00012645619,0.000034273922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010500018,0.00010332255,0.00010756325,0.00014007668,0.0004758847,0.000096444186,0.00047683562,0.000057473615,0.000008828175],"category_scores_gemma":[0.0000263351,0.00008168405,0.0001642783,0.0007775861,0.0001322523,0.0010148502,0.0000033192885,0.000115395145,0.000024705796],"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.00035786882,0.000053138127,0.0000024402625,0.00007169642,0.00006961509,1.03266544e-7,0.00282453,0.008609697,0.0004394732,0.7610133,0.00043288883,0.22612523],"study_design_scores_gemma":[0.001865721,0.00080308877,0.0008382193,0.000118403696,0.000109943074,0.0000089864725,0.0027004299,0.65588313,0.06719158,0.24919078,0.020692991,0.00059673755],"about_ca_topic_score_codex":0.0000045984875,"about_ca_topic_score_gemma":0.000005888401,"teacher_disagreement_score":0.9958426,"about_ca_system_score_codex":0.000029473436,"about_ca_system_score_gemma":0.000034301505,"threshold_uncertainty_score":0.36601686},"labels":[],"label_agreement":null},{"id":"W4321021502","doi":"10.1109/tit.2023.3245985","title":"The Platypus of the Quantum Channel Zoo","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Quantum channel; Channel (broadcasting); Qutrit; Quantum information; Quantum; Qubit; Computer science; Variety (cybernetics); Classical capacity; Amplitude damping channel; Topology (electrical circuits); Information theory; Quantum capacity; Information flow; Mathematics; Theoretical computer science; Physics; Quantum network; Quantum mechanics; Telecommunications; Combinatorics; Artificial intelligence; Statistics","score_opus":0.009318222917835708,"score_gpt":0.21274370301989065,"score_spread":0.20342548010205494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321021502","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.004054801,0.000008314241,0.98785406,0.001130915,0.0019341653,0.00023344661,0.000017513235,0.00028877307,0.0044780117],"genre_scores_gemma":[0.9988692,0.00006554809,0.000072849005,0.0006968477,0.000010048182,0.000053327716,0.0000018180294,0.0000041716985,0.00022622052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988021,0.00009617301,0.00043501944,0.00006724676,0.00039256958,0.0002068589],"domain_scores_gemma":[0.99870265,0.00032269227,0.00020870905,0.00060344435,0.00011849039,0.00004402293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080982404,0.00010851981,0.00008458155,0.00026540319,0.00074343715,0.00013689348,0.00087783945,0.00005960805,0.00001938643],"category_scores_gemma":[0.000016871018,0.0000631459,0.00017535995,0.0013918073,0.0001325501,0.0015246336,0.000006614002,0.00019736188,0.00058326713],"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.00004093168,0.000022178196,0.0000014890562,0.000022881364,0.000037279257,1.0295109e-7,0.006504812,0.017395554,0.000026416703,0.9035424,0.0024296187,0.06997632],"study_design_scores_gemma":[0.0012478546,0.00020794249,0.0014432032,0.0000892106,0.000028047933,0.000024589375,0.006345721,0.68301165,0.032516368,0.22591385,0.048684143,0.00048741672],"about_ca_topic_score_codex":0.0000038872327,"about_ca_topic_score_gemma":0.0000022732609,"teacher_disagreement_score":0.9948144,"about_ca_system_score_codex":0.000019183593,"about_ca_system_score_gemma":0.00005929794,"threshold_uncertainty_score":0.7496913},"labels":[],"label_agreement":null},{"id":"W4321488391","doi":"10.1109/tit.2023.3247860","title":"Transition Waste Optimization for Coded Elastic Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; Ministry of Science and Technology, Taiwan","keywords":"Computer science; Cloud computing; Joins; Redundancy (engineering); Theoretical computer science; Notice; Distributed computing; Database; Programming language","score_opus":0.012898203094649624,"score_gpt":0.2385268382463974,"score_spread":0.22562863515174778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321488391","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.0002216778,0.000001732356,0.9956102,0.00029480166,0.0008762191,0.00072382763,0.000044095796,0.0018586307,0.00036884125],"genre_scores_gemma":[0.7456622,0.000015540398,0.25293818,0.0008018977,0.000045631095,0.0002907605,0.00011152858,0.000025104977,0.00010911324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987162,0.00007229446,0.00046927214,0.0001927474,0.00027860614,0.00027091746],"domain_scores_gemma":[0.99872476,0.00047668166,0.00016370926,0.00031881794,0.00024110792,0.0000749036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304508,0.00016989974,0.00014564469,0.00075088395,0.00043042935,0.00017577416,0.00034138115,0.000101432066,0.000031553405],"category_scores_gemma":[0.000035319197,0.00017962336,0.00011232706,0.0010345887,0.000043504908,0.0018519674,0.0000025844433,0.00012339278,0.000114424874],"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.000037190628,0.000023105658,3.7011926e-8,0.000031677704,0.000015347718,1.6345547e-7,0.00197498,0.9297168,0.000030684012,0.040968865,0.00022476306,0.026976375],"study_design_scores_gemma":[0.0006076801,0.00014324041,0.0000013491369,0.00004557194,0.000016373984,0.0000057700636,0.0003024584,0.98464423,0.0072041485,0.006773504,0.00006789859,0.00018775271],"about_ca_topic_score_codex":0.0000011795273,"about_ca_topic_score_gemma":2.3786897e-7,"teacher_disagreement_score":0.74544054,"about_ca_system_score_codex":0.00008177465,"about_ca_system_score_gemma":0.000048765814,"threshold_uncertainty_score":0.7324828},"labels":[],"label_agreement":null},{"id":"W4322707172","doi":"10.1109/tit.2023.3250099","title":"Martingale Methods for Sequential Estimation of Convex Functionals and Divergences","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Regular polygon; Martingale (probability theory); Applied mathematics; Convex function; Kullback–Leibler divergence; Logarithm; Probability measure; Combinatorics; Discrete mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.07514884128663901,"score_gpt":0.4022217221927577,"score_spread":0.3270728809061187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322707172","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.01005859,0.000011301614,0.9876017,0.00009137802,0.00068466004,0.0003985586,0.00010780364,0.00012709627,0.00091888657],"genre_scores_gemma":[0.53173614,0.00007599041,0.46550736,0.00027782403,0.000054115997,0.00043523926,0.000051552768,0.000026672185,0.0018351049],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.00021401195,0.00044694546,0.000089307905,0.00014066056,0.00012987082],"domain_scores_gemma":[0.9975563,0.001901834,0.00021026867,0.000141079,0.0001452631,0.00004522205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002743013,0.000106187814,0.00018385964,0.00026809803,0.00018713783,0.000024559906,0.00006394744,0.00008072669,0.000088435474],"category_scores_gemma":[0.00025307998,0.00009643077,0.00010474682,0.00023087168,0.00007490612,0.0004601623,0.0000019381814,0.00007786708,0.0000014273686],"study_design_candidate":"design_other","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.00038302765,0.000056806824,0.000002765134,0.0007093475,0.00017358774,1.1731999e-7,0.003984858,0.009963075,0.001737633,0.14364317,0.0016591274,0.8376865],"study_design_scores_gemma":[0.0018993366,0.00043080345,0.000042974083,0.00015193522,0.0003546235,0.000012014734,0.004347557,0.37730172,0.20418242,0.40321505,0.007577432,0.00048412252],"about_ca_topic_score_codex":0.0000031302686,"about_ca_topic_score_gemma":9.212471e-7,"teacher_disagreement_score":0.83720237,"about_ca_system_score_codex":0.0000197435,"about_ca_system_score_gemma":0.00003011452,"threshold_uncertainty_score":0.39323324},"labels":[],"label_agreement":null},{"id":"W4323645584","doi":"10.1109/tit.2023.3254464","title":"Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"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":"Computer science; Online codes; Relay; Erasure; Computer network; Node (physics); Erasure code; Fountain code; Decoding methods; Luby transform code; Tornado code; Block code; Telecommunications; Concatenated error correction code; Power (physics); Engineering","score_opus":0.035659493448446315,"score_gpt":0.2660728999179509,"score_spread":0.2304134064695046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323645584","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.0023868016,0.000043824937,0.99425316,0.0004421651,0.00048637282,0.00041359497,0.000012089881,0.00037869785,0.0015833176],"genre_scores_gemma":[0.9858958,0.00019974243,0.012882508,0.00052992796,0.000029566847,0.00028309686,0.000011067444,0.0000103309485,0.00015792459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988404,0.00014975923,0.00039722704,0.00015215029,0.00017291089,0.00028757722],"domain_scores_gemma":[0.99840736,0.00085035776,0.00011521871,0.00045761277,0.00011835383,0.00005111348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088575,0.00014174507,0.00015079073,0.0003426464,0.00053324003,0.00013032494,0.00048374583,0.000083729945,0.000017074743],"category_scores_gemma":[0.000028382805,0.00014184826,0.00008562611,0.0011894805,0.00003693662,0.0015551092,0.000008785656,0.00029503138,0.00012807445],"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.00007476835,0.000022801029,0.00001797742,0.000011467373,0.000025394475,5.122728e-7,0.0033135025,0.60134244,0.000029073659,0.11212116,0.000375016,0.28266588],"study_design_scores_gemma":[0.000787894,0.00008951163,0.0006524553,0.00016706974,0.000008502645,0.0000030740966,0.00048212378,0.98275405,0.0004707971,0.012421568,0.0019154102,0.000247532],"about_ca_topic_score_codex":0.0000034031634,"about_ca_topic_score_gemma":0.00009639983,"teacher_disagreement_score":0.983509,"about_ca_system_score_codex":0.000103319624,"about_ca_system_score_gemma":0.0000657606,"threshold_uncertainty_score":0.5784404},"labels":[],"label_agreement":null},{"id":"W4380905717","doi":"10.1109/tit.2023.3286870","title":"On the Hardness of the Minimum Distance Problem of Quantum Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Notation; Mathematics; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum; Quantum computer; Graph; Code (set theory); Computer science; Arithmetic; Quantum mechanics; Physics","score_opus":0.00872148690654637,"score_gpt":0.21461079546155076,"score_spread":0.2058893085550044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380905717","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.042578198,0.000003682314,0.9547142,0.0011708296,0.00059821084,0.00021799473,0.00004192227,0.000101838676,0.00057315256],"genre_scores_gemma":[0.9990004,0.000006512024,0.00054824766,0.0002775809,0.000007769161,0.000022120941,0.0000011607523,0.0000043593104,0.0001318597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896616,0.00014696582,0.00033046646,0.0000903569,0.00032521616,0.0001408566],"domain_scores_gemma":[0.998609,0.000574515,0.00021113906,0.00049799937,0.00008501172,0.000022354676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066725444,0.000101938116,0.00011490066,0.00012522873,0.00026965313,0.000040833307,0.0007256478,0.000038191287,0.0000102279955],"category_scores_gemma":[0.00001567756,0.000055944536,0.00011710073,0.0007716957,0.0001374313,0.00024952722,0.0000069601,0.0001969061,0.00003581479],"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.000046307814,0.000058323465,0.0000015295535,0.000078626465,0.000031442472,1.7907091e-7,0.007725946,0.353538,0.00013029849,0.58720917,0.00066887843,0.05051129],"study_design_scores_gemma":[0.00025779946,0.0001186958,0.00022687904,0.00018906445,0.000008532863,0.0000036138647,0.00047859896,0.88782144,0.022292262,0.087448284,0.0010331582,0.00012168865],"about_ca_topic_score_codex":0.0000054952707,"about_ca_topic_score_gemma":0.0000011772776,"teacher_disagreement_score":0.9564222,"about_ca_system_score_codex":0.000013788956,"about_ca_system_score_gemma":0.000047739373,"threshold_uncertainty_score":0.2281352},"labels":[],"label_agreement":null},{"id":"W4381233098","doi":"10.1109/tit.2023.3287478","title":"An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Moment (physics); Ergodicity; Ergodic theory; Lyapunov function; Adaptive control; Rate of convergence; Stochastic process; Applied mathematics; Discrete mathematics; Control theory (sociology); Computer science; Pure mathematics; Control (management); Statistics","score_opus":0.008386160963190855,"score_gpt":0.21905586136783475,"score_spread":0.2106697004046439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381233098","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.027953364,0.0000056499666,0.9682069,0.00008275874,0.0007109439,0.0007335942,0.00012702345,0.0009606181,0.0012191496],"genre_scores_gemma":[0.99841803,0.000006098021,0.0006519305,0.00021458336,0.000104122184,0.00047033897,0.000039945287,0.000028805021,0.00006616607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988118,0.000087115455,0.0004471001,0.00012868566,0.00016777754,0.00035756695],"domain_scores_gemma":[0.9988125,0.0005643513,0.00006345388,0.0002969562,0.00013864672,0.00012411857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009623745,0.00021256253,0.0002462836,0.00019601827,0.00027423218,0.00015369,0.00015930753,0.000104167455,0.00006394809],"category_scores_gemma":[0.000012094379,0.00018842696,0.0001059342,0.00032116703,0.0000668136,0.0011309166,4.055806e-7,0.00019431411,0.00015461662],"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.0007871299,0.000020890657,0.000002632481,0.000073721916,0.0001313536,3.7312674e-7,0.0006481555,0.9855624,0.00080899347,0.004050746,0.000104572886,0.007809042],"study_design_scores_gemma":[0.0033472637,0.00024510932,0.000022453505,0.00006312083,0.00004830928,0.0000038748963,0.0008853705,0.99060166,0.0018537603,0.0004431807,0.0022125978,0.00027328916],"about_ca_topic_score_codex":0.0000037812047,"about_ca_topic_score_gemma":0.000012174475,"teacher_disagreement_score":0.97046465,"about_ca_system_score_codex":0.00009656311,"about_ca_system_score_gemma":0.00004759348,"threshold_uncertainty_score":0.76838285},"labels":[],"label_agreement":null},{"id":"W4381747951","doi":"10.1109/tit.2023.3287556","title":"How to Sample From the Limiting Distribution of a Continuous-Time Quantum Walk","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Notation; Mathematics; Limiting; Discrete mathematics; Random walk; Quantum algorithm; Combinatorics; Eigenvalues and eigenvectors; Graph; Algorithm; Quantum; Statistics; Arithmetic; Quantum mechanics; Physics","score_opus":0.008506631016310617,"score_gpt":0.20876107434522276,"score_spread":0.20025444332891215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381747951","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.08193912,0.0000039640236,0.9143188,0.0024046327,0.0004280282,0.00018884722,0.00035171036,0.00031754252,0.000047366266],"genre_scores_gemma":[0.995752,0.000003967921,0.0036836464,0.00039761962,0.00004566148,0.00001568779,0.00005854313,0.0000050677345,0.000037845457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.00012035185,0.0002838199,0.0001355468,0.00027913915,0.00021788599],"domain_scores_gemma":[0.9979581,0.0013246029,0.0001396793,0.00041118174,0.00010496809,0.00006143964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005443292,0.00012459035,0.00014076523,0.00012282713,0.00033077653,0.00022241432,0.0005137054,0.000051946347,0.000014558619],"category_scores_gemma":[0.00009125723,0.00009266389,0.00010596889,0.0007106867,0.000041995696,0.0005863563,0.000007548844,0.00018785968,0.00018783647],"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.00008282164,0.000034351695,0.000007803534,0.000016310101,0.000055738554,8.3086803e-7,0.006880418,0.16520621,0.00028955346,0.021380523,0.0007435126,0.8053019],"study_design_scores_gemma":[0.00031641475,0.00021318658,0.0010541506,0.00007575279,0.000012696474,0.00000401952,0.0006181441,0.97122455,0.0060973,0.016540127,0.003652857,0.00019083235],"about_ca_topic_score_codex":0.00005557475,"about_ca_topic_score_gemma":0.0000032083822,"teacher_disagreement_score":0.9138128,"about_ca_system_score_codex":0.000022470089,"about_ca_system_score_gemma":0.000035713725,"threshold_uncertainty_score":0.37787238},"labels":[],"label_agreement":null},{"id":"W4385820017","doi":"10.1109/tit.2023.3304712","title":"Constructions and Bounds for Codes With Restricted Overlaps","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"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; University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Prefix; Parity-check matrix; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Linear code; Block code; Suffix; Binary code; Prefix code; Binary number; Computer science; Algorithm; Arithmetic; Decoding methods; Set (abstract data type)","score_opus":0.008990036429457308,"score_gpt":0.21692075491641294,"score_spread":0.20793071848695563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385820017","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.015286057,0.000003804073,0.9814489,0.00020113161,0.0003350568,0.00023408141,0.000056598,0.0005603732,0.0018739912],"genre_scores_gemma":[0.9906488,0.00002940651,0.008713964,0.00026714322,0.0000133061385,0.00015188425,0.000010011535,0.0000063223288,0.00015916313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999357,0.00004862404,0.00018014779,0.00011715539,0.00013178572,0.00016529571],"domain_scores_gemma":[0.9991354,0.0004026865,0.00006650109,0.0002468167,0.00008783952,0.000060768805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028767192,0.000103293074,0.00009078164,0.00047464343,0.00053572387,0.00019314337,0.00017246538,0.000050765822,0.000013420854],"category_scores_gemma":[0.000008894312,0.00008997108,0.000052507017,0.0008820544,0.0001332706,0.0013446785,0.0000018520471,0.0001043674,0.00003487341],"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.000182235,0.00002160151,0.0000065277163,0.000028990022,0.000053686585,4.2449227e-7,0.001598295,0.0025982906,0.00008741001,0.8557175,0.00032614858,0.13937889],"study_design_scores_gemma":[0.0062587317,0.0022371388,0.0019989687,0.00022009497,0.00018068861,0.00026660686,0.0054803817,0.105153084,0.018153043,0.798769,0.059853896,0.0014283647],"about_ca_topic_score_codex":0.000002010116,"about_ca_topic_score_gemma":0.0000026221178,"teacher_disagreement_score":0.9753627,"about_ca_system_score_codex":0.000015778005,"about_ca_system_score_gemma":0.000045369812,"threshold_uncertainty_score":0.4120409},"labels":[],"label_agreement":null},{"id":"W4386634662","doi":"10.1109/tit.2023.3314048","title":"Universal Graph Compression: Stochastic Block Models","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjacency matrix; Lossless compression; Computer science; Cluster analysis; Adjacency list; Data compression; Asymptotically optimal algorithm; Algorithm; Discrete mathematics; Graph; Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.012661189230647275,"score_gpt":0.23654637498944184,"score_spread":0.22388518575879457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386634662","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.004409064,0.0000016510979,0.98240304,0.000056090576,0.00016071416,0.00016766947,0.000060758513,0.00046131908,0.012279721],"genre_scores_gemma":[0.9991053,0.0000023402804,0.00021950506,0.000056928264,0.000038238257,0.000049141516,0.000045792796,0.000009813734,0.00047297325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992182,0.000058101567,0.00025437068,0.00009691664,0.0001892614,0.00018311663],"domain_scores_gemma":[0.99940586,0.00011044355,0.00009120072,0.00025665818,0.00007151572,0.00006430501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018121181,0.00013334506,0.0001331281,0.0004215033,0.0002831131,0.00004989304,0.00016255207,0.000037474136,0.0005415087],"category_scores_gemma":[4.4132332e-7,0.00013019792,0.0001563721,0.0006254596,0.000050437346,0.0007668775,0.0000024670746,0.00019030872,0.0003915475],"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.000044484786,0.000038875423,0.0000012497185,0.0000046909545,0.00008767613,1.7757947e-7,0.0008196027,0.8861665,0.000023749673,0.06835015,0.0019074435,0.042555355],"study_design_scores_gemma":[0.00077505433,0.00007114215,0.00002978297,0.00007348888,0.0001320261,0.0000015716818,0.0028339154,0.6838936,0.002312302,0.30778566,0.0016572403,0.00043417377],"about_ca_topic_score_codex":0.00001937881,"about_ca_topic_score_gemma":0.0000010455258,"teacher_disagreement_score":0.9946962,"about_ca_system_score_codex":0.000025167728,"about_ca_system_score_gemma":0.000025635194,"threshold_uncertainty_score":0.5929141},"labels":[],"label_agreement":null},{"id":"W4386918690","doi":"10.1109/tit.2023.3318152","title":"An Analysis of Transformed Unadjusted Langevin Algorithm for Heavy-Tailed Sampling","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Algorithm; Sampling (signal processing); Computer science; Statistical physics; Langevin dynamics; Statistics; Mathematics; Physics; Telecommunications; Detector","score_opus":0.02100305471321971,"score_gpt":0.27133019036829364,"score_spread":0.2503271356550739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386918690","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.029020268,0.000006014617,0.9687277,0.000008305514,0.00018691164,0.0002544395,0.00027522797,0.0012499058,0.0002712392],"genre_scores_gemma":[0.9935614,0.00004832499,0.0060446616,0.00004849289,0.000013057803,0.000085244574,0.00016258107,0.00001693209,0.000019300507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.000024668574,0.00032076385,0.000067464294,0.00012332588,0.00015743857],"domain_scores_gemma":[0.99945307,0.0001571384,0.00004348782,0.00021290006,0.000088583365,0.000044794568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002451601,0.000114574636,0.00020466343,0.00089643965,0.000084840925,0.000024803661,0.00010262334,0.000086641056,0.00004291638],"category_scores_gemma":[0.0000028744607,0.00011553606,0.00016481246,0.0008957006,0.000023654884,0.00046041433,2.416168e-7,0.0000906975,0.0000151303375],"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.000047616086,0.000018511353,0.0000011338886,0.000029272394,0.0003725994,1.2888387e-7,0.0012325516,0.6923957,0.0014737529,0.00033431122,0.00007496212,0.30401945],"study_design_scores_gemma":[0.00026663629,0.00006653118,0.00014180978,0.000025122396,0.00030498067,5.746289e-7,0.0006459357,0.8956582,0.101711676,0.0005662329,0.0004747784,0.00013751759],"about_ca_topic_score_codex":0.000009202196,"about_ca_topic_score_gemma":0.000013442078,"teacher_disagreement_score":0.96454114,"about_ca_system_score_codex":0.00003982048,"about_ca_system_score_gemma":0.0000121070825,"threshold_uncertainty_score":0.47114238},"labels":[],"label_agreement":null},{"id":"W4387623780","doi":"10.1109/tit.2023.3323839","title":"A Lego-Brick Approach to Coding for Network Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"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 British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable-length code; Shannon–Fano coding; Tunstall coding; Linear network coding; Context-adaptive binary arithmetic coding; Coding tree unit; Theoretical computer science; Computer science; Coding (social sciences); Algorithm; Context-adaptive variable-length coding; Multiple description coding; Channel code; Huffman coding; Mathematics; Decoding methods; Computer network; Data compression; Statistics","score_opus":0.03895929421103779,"score_gpt":0.273654423902628,"score_spread":0.23469512969159023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387623780","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.00013362391,0.000021664373,0.98696727,0.0010839383,0.00036460275,0.000645709,0.000009491325,0.0006242515,0.01014945],"genre_scores_gemma":[0.93974113,0.00033966458,0.055306423,0.0027808251,0.00004474848,0.00083600485,0.000046643087,0.00001444296,0.00089009025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988388,0.00019850548,0.00036678356,0.00014562791,0.00018070791,0.00026959312],"domain_scores_gemma":[0.998192,0.00054377166,0.00010154269,0.0008762241,0.00019371958,0.0000927449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378846,0.00013381398,0.00013414398,0.0003242022,0.00089485716,0.00025629223,0.00093578047,0.000061614934,0.0000138482665],"category_scores_gemma":[0.000027686232,0.00013620108,0.00009322252,0.0014528056,0.00003185551,0.0014154703,0.000016421824,0.00018700928,0.00042392765],"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.000038674047,0.00003971092,6.06019e-7,0.000018479517,0.000026207861,3.2343344e-8,0.0047015334,0.23959865,0.000031512132,0.5223338,0.009704861,0.22350591],"study_design_scores_gemma":[0.0007280805,0.00010648736,0.00009336186,0.00008142076,0.000014435432,0.0000050930994,0.0005787109,0.90311706,0.0010812293,0.010852099,0.08295852,0.0003834915],"about_ca_topic_score_codex":0.0000011850346,"about_ca_topic_score_gemma":0.0000027099707,"teacher_disagreement_score":0.93960756,"about_ca_system_score_codex":0.0000767486,"about_ca_system_score_gemma":0.000044167973,"threshold_uncertainty_score":0.68826085},"labels":[],"label_agreement":null},{"id":"W4389169165","doi":"10.1109/tit.2023.3338215","title":"On a Class of Time-Varying Gaussian ISI Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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":"Columbia College","funders":"","keywords":"Channel (broadcasting); Upper and lower bounds; Computer science; Algorithm; Combinatorics; Mathematics; Telecommunications; Mathematical analysis","score_opus":0.010432682626857485,"score_gpt":0.2313363599901174,"score_spread":0.22090367736325991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389169165","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.020159561,0.000009873621,0.9332366,0.00015733279,0.00040963214,0.00035544956,0.00008793612,0.0027546121,0.042828985],"genre_scores_gemma":[0.99919945,0.000107122716,0.00027599902,0.00011350115,0.000009344364,0.00009576625,0.000025208326,0.000021516746,0.00015208429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916744,0.000056089924,0.00036609342,0.000057682275,0.00019881704,0.00015387073],"domain_scores_gemma":[0.9991575,0.00024828533,0.00006478545,0.00043224945,0.000052693173,0.0000445159],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035204337,0.00012840284,0.00014215079,0.00061961287,0.00011744821,0.00003073707,0.00023021699,0.0001068691,0.00023068712],"category_scores_gemma":[0.000009254514,0.00013670602,0.00008224685,0.00052053854,0.00004389859,0.00063271297,0.0000016571631,0.00025352783,0.0012366697],"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.0000944123,0.00006338408,3.2837602e-7,0.0001965118,0.00009878167,5.643453e-7,0.0066095875,0.8670347,0.0026534898,0.036343798,0.0028146068,0.084089875],"study_design_scores_gemma":[0.0007525917,0.00018142696,0.000023345803,0.00034817352,0.00002937471,0.0000063965426,0.0006225419,0.51263106,0.46200547,0.015133121,0.0077543654,0.0005121314],"about_ca_topic_score_codex":0.0000027266058,"about_ca_topic_score_gemma":6.400143e-7,"teacher_disagreement_score":0.9790399,"about_ca_system_score_codex":0.000063501975,"about_ca_system_score_gemma":0.000011050299,"threshold_uncertainty_score":0.999541},"labels":[],"label_agreement":null},{"id":"W4389923777","doi":"10.1109/tit.2023.3344141","title":"Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Privacy-Preserving Technologies in Data","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 Alberta","funders":"","keywords":"Regular polygon; Computer science; Order (exchange); Convex function; Convex optimization; Mathematical optimization; Mathematics; Economics","score_opus":0.03241622595127306,"score_gpt":0.2781650566507077,"score_spread":0.24574883069943462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389923777","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.007967405,0.000002722071,0.9840879,0.0024350674,0.0011561165,0.00042810084,0.0000979108,0.0024939715,0.0013308062],"genre_scores_gemma":[0.9419007,0.000045247678,0.055140935,0.00065677165,0.00004526457,0.00052697485,0.00018054074,0.00003164027,0.0014719848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984433,0.00006918452,0.00044052387,0.00027986057,0.00033295166,0.00043418762],"domain_scores_gemma":[0.9971828,0.00046792146,0.00015893138,0.0018640208,0.00025273295,0.00007357943],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084245414,0.00021025079,0.00018662901,0.00068049866,0.0010570668,0.0005225356,0.003538664,0.00020768352,0.00014948366],"category_scores_gemma":[0.00089773024,0.00022146401,0.000107898486,0.0016018102,0.00012197925,0.0039167204,0.00025028805,0.0005002776,0.0008683462],"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.00071537145,0.00046555288,0.000042729152,0.00036527799,0.00069967954,0.000009844345,0.0040923003,0.35064563,0.0019063719,0.024292188,0.17680755,0.43995753],"study_design_scores_gemma":[0.0010314616,0.00023052437,0.00011411526,0.000043809032,0.000024668081,0.000013096669,0.00055274635,0.9561629,0.009597298,0.01959709,0.0122453915,0.00038685024],"about_ca_topic_score_codex":0.000010463792,"about_ca_topic_score_gemma":0.0000041081557,"teacher_disagreement_score":0.93393326,"about_ca_system_score_codex":0.00012572225,"about_ca_system_score_gemma":0.0001345549,"threshold_uncertainty_score":0.9999096},"labels":[],"label_agreement":null},{"id":"W4390659502","doi":"10.1109/tit.2024.3351107","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Algorithm; Vertex (graph theory); Graph; Time complexity; Theoretical computer science; Efficient algorithm; Connectivity","score_opus":0.02218252933870495,"score_gpt":0.2538713566313062,"score_spread":0.23168882729260126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659502","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.0007837981,0.000035187622,0.99590683,0.00081526395,0.0012125314,0.0006190661,0.000037143862,0.00023143983,0.00035873885],"genre_scores_gemma":[0.9954788,0.00003295917,0.0034904224,0.00064860494,0.000014967392,0.00020951762,0.00000538571,0.000009028472,0.00011030481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989546,0.000078765275,0.00033419856,0.0001548883,0.0002828574,0.00019468648],"domain_scores_gemma":[0.998451,0.0008910029,0.00009601231,0.0004258209,0.00009127055,0.00004487762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004914512,0.0001387097,0.00011217378,0.00029953325,0.00022857572,0.000094571675,0.0003761504,0.000059975682,0.000010473458],"category_scores_gemma":[0.000009955905,0.000095610725,0.00017874937,0.00075181416,0.00007072897,0.0005917437,0.0000025471454,0.00017630217,0.00003746146],"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.00006186672,0.00004799475,3.5804366e-8,0.00003257251,0.000037566973,7.6028124e-7,0.00066029263,0.3840645,0.000041991767,0.5155399,0.00079498754,0.098717526],"study_design_scores_gemma":[0.0005192567,0.000446928,0.0000057044504,0.00019901116,0.00003117898,0.000030580246,0.00019009557,0.80368066,0.042529944,0.14916052,0.0029665758,0.00023953528],"about_ca_topic_score_codex":0.000001254919,"about_ca_topic_score_gemma":3.001857e-7,"teacher_disagreement_score":0.994695,"about_ca_system_score_codex":0.000060299437,"about_ca_system_score_gemma":0.000030459723,"threshold_uncertainty_score":0.38988924},"labels":[],"label_agreement":null},{"id":"W4391093842","doi":"10.1109/tit.2024.3352313","title":"IEEE Transactions on Information Theory publication information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Information theory; Information retrieval; Mathematics; Statistics","score_opus":0.009183430584671939,"score_gpt":0.22731554049427508,"score_spread":0.21813210990960313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391093842","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.0002928739,0.000019851657,0.9809198,0.002272614,0.0024169846,0.0009202613,0.0002112143,0.0015626469,0.011383781],"genre_scores_gemma":[0.9892697,0.00014788273,0.0027707536,0.0058523314,0.000088362176,0.00086138747,0.00015031615,0.000022953065,0.0008363315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971305,0.00020351428,0.0011791503,0.0002720375,0.00073863554,0.00047616402],"domain_scores_gemma":[0.9975141,0.00056536234,0.0003130857,0.00095680344,0.00042507687,0.00022557034],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0012020112,0.00041314264,0.00023864929,0.001374166,0.00086110615,0.0018922221,0.0008419425,0.00027333343,0.00040389856],"category_scores_gemma":[0.000017700298,0.00038301863,0.00028951105,0.0018350902,0.0001133881,0.027003823,0.0000026641906,0.0008009986,0.0066878432],"study_design_candidate":"design_other","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.00007196285,0.0000699823,6.7104104e-8,0.000074724994,0.000058077985,2.8669947e-7,0.0026553734,0.048477583,0.000031678956,0.2752116,0.0031509812,0.67019767],"study_design_scores_gemma":[0.0014407097,0.00053895125,0.00004565279,0.00031647194,0.0001489299,0.00011049874,0.0011451708,0.5976893,0.029059155,0.055737305,0.31234044,0.0014274241],"about_ca_topic_score_codex":0.000013057267,"about_ca_topic_score_gemma":0.000003050482,"teacher_disagreement_score":0.98897684,"about_ca_system_score_codex":0.00028385795,"about_ca_system_score_gemma":0.00023105474,"threshold_uncertainty_score":0.9998622},"labels":[],"label_agreement":null},{"id":"W4392158582","doi":"10.1109/tit.2024.3370311","title":"Privacy-Preserving Average Consensus: Fundamental Analysis and a Generic Framework Design","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"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 Victoria","funders":"Shenzhen Science and Technology Innovation Program; National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Theoretical computer science; Computer security","score_opus":0.02391222297149408,"score_gpt":0.26197529139750897,"score_spread":0.23806306842601488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392158582","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.0034877216,0.00015942838,0.99066347,0.0029350314,0.00060889544,0.0002617721,0.00006834392,0.0014840943,0.00033123326],"genre_scores_gemma":[0.68511444,0.00011607208,0.31427184,0.0003723386,0.000011839825,0.000055140794,0.0000062059034,0.0000091897755,0.00004292805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984142,0.0001895824,0.00042147958,0.00033321613,0.0003451164,0.00029640328],"domain_scores_gemma":[0.9953506,0.001088211,0.00009146511,0.0033298226,0.000053188178,0.00008673884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101671,0.00021666374,0.0002019692,0.0011189077,0.00031337424,0.0008143064,0.0051714876,0.00017856566,0.00016026948],"category_scores_gemma":[0.0007757359,0.00020501507,0.00012819532,0.0020291398,0.00013892037,0.0022878158,0.0006192324,0.0004925162,0.00017742366],"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.00020153554,0.00020080905,0.00005033943,0.00045381632,0.003219102,0.00006255084,0.00951741,0.07156667,0.00085113005,0.07219447,0.028208764,0.8134734],"study_design_scores_gemma":[0.00013012445,0.0000638451,0.000055691915,0.00007509679,0.000111309026,0.000031754334,0.00016297786,0.7677403,0.0070688007,0.22330135,0.0010040322,0.0002547254],"about_ca_topic_score_codex":0.000012519945,"about_ca_topic_score_gemma":0.0000013858225,"teacher_disagreement_score":0.81321865,"about_ca_system_score_codex":0.00013397489,"about_ca_system_score_gemma":0.00007580183,"threshold_uncertainty_score":0.96099967},"labels":[],"label_agreement":null},{"id":"W4398188080","doi":"10.1109/tit.2024.3403810","title":"Attributed Graph Alignment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science","score_opus":0.012539927480566348,"score_gpt":0.2348382409553279,"score_spread":0.22229831347476156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398188080","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.0006219012,0.00006282426,0.9919607,0.0007038214,0.0018361695,0.00012014881,0.000013107492,0.0007944837,0.0038868375],"genre_scores_gemma":[0.99525523,0.00005057042,0.0034842703,0.00081943953,0.000013346606,0.00004342507,0.0000033227163,0.0000039221786,0.00032647356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992376,0.000052873304,0.00022866549,0.000112454305,0.00020903625,0.00015938646],"domain_scores_gemma":[0.99941564,0.0001775348,0.000027618542,0.00029648564,0.00003756354,0.000045143115],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038635457,0.0001020346,0.00008284665,0.00030057665,0.00013808633,0.00027299978,0.00030879327,0.000056773166,0.00008943982],"category_scores_gemma":[0.0000045869815,0.00008406999,0.00009244077,0.00040780148,0.000037487756,0.0018527585,0.0000017947307,0.0001283624,0.0010076335],"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.000016765323,0.000037440215,6.9494206e-7,0.000046201065,0.000074604526,0.0000045913157,0.002546955,0.005600099,0.000085912274,0.52200735,0.002294086,0.46728534],"study_design_scores_gemma":[0.0014949954,0.0006005389,0.0003984601,0.0003530741,0.00012819465,0.00021857812,0.002206038,0.26050967,0.1745557,0.3838514,0.17435862,0.0013247085],"about_ca_topic_score_codex":0.000005623852,"about_ca_topic_score_gemma":0.0000013936499,"teacher_disagreement_score":0.9946333,"about_ca_system_score_codex":0.00004664565,"about_ca_system_score_gemma":0.000042859447,"threshold_uncertainty_score":0.9997702},"labels":[],"label_agreement":null},{"id":"W4399487636","doi":"10.1109/tit.2024.3411919","title":"Capacity of Finite State Channels With Feedback: Algorithmic and Optimization Theoretic Properties","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Computer science; Mathematical optimization; Finite state; State (computer science); Algorithm; Theoretical computer science; Mathematics; Markov chain","score_opus":0.00788907769546026,"score_gpt":0.18740917849742497,"score_spread":0.1795201008019647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487636","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.0129936375,0.000053690223,0.9857524,0.00020044771,0.00038790383,0.00020122885,0.000021072845,0.0002392542,0.00015037315],"genre_scores_gemma":[0.9696983,0.000046981215,0.030053424,0.00009741195,0.000014658954,0.00002037008,0.0000016752261,0.000008548766,0.000058615944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.0000800426,0.00025084123,0.00014416414,0.00020303897,0.0001486676],"domain_scores_gemma":[0.99943984,0.0001456584,0.000069751,0.00020639409,0.000089283596,0.00004907401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035044912,0.00014073186,0.00012097473,0.00029550356,0.00015500098,0.00023400033,0.00018045273,0.00004117993,0.000011869253],"category_scores_gemma":[0.0000049921337,0.00009859036,0.000039791892,0.00037210793,0.00015164449,0.0010868977,0.0000035152673,0.00019585567,0.000012613351],"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.000026170892,0.0000141290275,7.886986e-8,0.00011600661,0.00002623255,9.3230057e-7,0.006540484,0.83796275,0.000021236732,0.007912098,0.0000026282369,0.14737727],"study_design_scores_gemma":[0.00019470966,0.00019393324,0.0000028705697,0.00021418132,0.000011399376,0.000047756934,0.00009358627,0.9856157,0.008089776,0.0053370246,0.00006515493,0.00013394847],"about_ca_topic_score_codex":0.000006927683,"about_ca_topic_score_gemma":4.515162e-7,"teacher_disagreement_score":0.9567047,"about_ca_system_score_codex":0.000019527279,"about_ca_system_score_gemma":0.00005573866,"threshold_uncertainty_score":0.40203983},"labels":[],"label_agreement":null},{"id":"W4399728557","doi":"10.1109/tit.2024.3416063","title":"Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Markov chain; Zero (linguistics); Computer science; Markov process; Markov decision process; Variable-order Markov model; Mathematical optimization; Algorithm; Markov model; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.0141723234347798,"score_gpt":0.23272736396143434,"score_spread":0.21855504052665453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728557","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.00088431477,0.000082351624,0.99717873,0.000011435981,0.00047820673,0.00057398033,0.000028713708,0.00025377268,0.0005084717],"genre_scores_gemma":[0.9833402,0.00006925504,0.01563618,0.00004222225,0.000019032293,0.0002850032,0.000018736253,0.000023259416,0.0005661141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999254,0.000020299749,0.0003703866,0.000071174065,0.00011735561,0.00016677384],"domain_scores_gemma":[0.9993863,0.00036195767,0.00003790882,0.00010700201,0.00007061473,0.00003620871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004830564,0.00012755532,0.00012814438,0.00015509492,0.00015601979,0.00009398873,0.00009042895,0.000073786956,0.00011414561],"category_scores_gemma":[0.0000103652865,0.000118797536,0.00012057585,0.00010423515,0.000039312232,0.0005115503,5.1574904e-7,0.00013064203,0.00003154337],"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.00011745939,0.000005504497,6.172047e-8,0.0003334391,0.000084252206,7.793974e-8,0.0022617183,0.9227744,0.0003231445,0.0037918405,0.0002669816,0.07004115],"study_design_scores_gemma":[0.00015682189,0.00018890554,2.8524082e-7,0.0000774432,0.000039938008,0.0000027810775,0.00027933618,0.93215466,0.057796348,0.00086021493,0.00831441,0.00012883807],"about_ca_topic_score_codex":0.0000021068258,"about_ca_topic_score_gemma":2.5300986e-7,"teacher_disagreement_score":0.9824559,"about_ca_system_score_codex":0.000043707005,"about_ca_system_score_gemma":0.000027984193,"threshold_uncertainty_score":0.4844423},"labels":[],"label_agreement":null},{"id":"W4400021395","doi":"10.1109/tit.2024.3418471","title":"Bounds on the Minimum Field Size of Network MDS Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Discrete mathematics","score_opus":0.017239924169623284,"score_gpt":0.2541513440171451,"score_spread":0.23691141984752184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400021395","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.0011442226,0.00012388747,0.97645456,0.0030587406,0.0008980025,0.0001508377,0.0000052531313,0.00015630602,0.01800817],"genre_scores_gemma":[0.99541146,0.0003113072,0.000770681,0.0028628416,0.000034744837,0.00004137773,0.0000010696513,0.000004316547,0.0005622317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911517,0.00018767046,0.00029452686,0.00008758405,0.00018404154,0.00013100468],"domain_scores_gemma":[0.99667156,0.0026221317,0.0000594009,0.00053685834,0.000078626734,0.000031432883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007552331,0.00010177553,0.000093511146,0.00009338985,0.0003243317,0.00021736289,0.0005544645,0.00005163905,0.0002785747],"category_scores_gemma":[0.00003106083,0.00007187115,0.000093123745,0.00054333603,0.000059092767,0.00073996605,0.0000057579014,0.00027624972,0.00017612347],"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.000036824054,0.000027560916,4.9172434e-7,0.000022913631,0.000044723853,2.5435344e-7,0.0030367766,0.010726005,0.000060094095,0.7519156,0.0063731107,0.22775567],"study_design_scores_gemma":[0.00072224665,0.00097596087,0.00012504995,0.0010910237,0.000061403895,0.00002298537,0.0009878353,0.694593,0.054822057,0.07878714,0.16705431,0.0007569942],"about_ca_topic_score_codex":0.0000012918804,"about_ca_topic_score_gemma":0.000003106086,"teacher_disagreement_score":0.9942672,"about_ca_system_score_codex":0.000031076226,"about_ca_system_score_gemma":0.000060356488,"threshold_uncertainty_score":0.3050198},"labels":[],"label_agreement":null},{"id":"W4400035848","doi":"10.1109/tit.2024.3417894","title":"A New Version of q-Ary Varshamov-Tenengolts Codes With More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Advanced Education and Technology","keywords":"Differential coding; Block code; Luby transform code; Encoder; Turbo code; Linear code; Computer science; Differential (mechanical device); Raptor code; Concatenated error correction code; Algorithm; Mathematics; Discrete mathematics; Decoding methods; Physics","score_opus":0.005042429923905955,"score_gpt":0.20200954126550688,"score_spread":0.19696711134160091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400035848","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.115050755,0.000103612176,0.8826541,0.0005927149,0.0005795077,0.0003857829,0.000082307626,0.00024662705,0.00030460206],"genre_scores_gemma":[0.99884534,0.000071989016,0.00072586513,0.00019721573,0.000035948375,0.00004506394,0.000011968479,0.000011569804,0.000055037435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831283,0.00033282847,0.0004008462,0.00023041193,0.0004819027,0.00024120176],"domain_scores_gemma":[0.9981233,0.0010423842,0.00013640491,0.000510518,0.000085120846,0.000102290025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062431896,0.00025848747,0.0002482321,0.00032834648,0.0005599892,0.00043380284,0.00061584165,0.000092874776,0.00012442318],"category_scores_gemma":[0.000011888275,0.00014035474,0.00019867494,0.00062116823,0.0005295029,0.0007788166,0.00001743074,0.00036081742,0.000018157934],"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.0040389798,0.00023597643,0.0000067141523,0.00030069955,0.00069825473,0.0000037589316,0.052791208,0.018930772,0.00071542914,0.77924556,0.00050835434,0.14252427],"study_design_scores_gemma":[0.008842259,0.0011620747,0.0011578555,0.0013815814,0.0009486071,0.00015392472,0.008910935,0.8478415,0.048565745,0.07782682,0.0019601004,0.0012485874],"about_ca_topic_score_codex":0.000033034186,"about_ca_topic_score_gemma":0.000011384716,"teacher_disagreement_score":0.8837946,"about_ca_system_score_codex":0.000029281367,"about_ca_system_score_gemma":0.0001080569,"threshold_uncertainty_score":0.57235},"labels":[],"label_agreement":null},{"id":"W4401070871","doi":"10.1109/tit.2024.3435412","title":"The Existence of Distinguishable Bases in Three-Dimensional Subspaces of Qutrit-Qudit Systems Under One-Way Local Projective Measurements and Classical Communication","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Information 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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Projective test; Linear subspace; Qutrit; Mathematics; Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Physics; Quantum entanglement; Quantum mechanics","score_opus":0.030725599677192867,"score_gpt":0.2514976949696649,"score_spread":0.22077209529247202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070871","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.01186921,0.00034441552,0.98523927,0.0002577102,0.00028732256,0.00034133173,0.000019334633,0.00006833094,0.0015731066],"genre_scores_gemma":[0.9990057,0.000057485606,0.00079778634,0.000046184075,0.0000039211486,0.000065287204,0.0000026016369,0.0000034873412,0.00001755907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985977,0.00018174271,0.00055565935,0.00009571878,0.00043972884,0.0001294565],"domain_scores_gemma":[0.9983788,0.0008459693,0.00018494455,0.00031420926,0.00023942027,0.000036649515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012104588,0.0001072868,0.00014181019,0.00031559737,0.0002051252,0.00015002719,0.0003040173,0.000061162784,0.000005983292],"category_scores_gemma":[0.000024912402,0.000080553815,0.00006154827,0.0006078954,0.00029253092,0.001566255,0.000007500277,0.0001942989,0.000009261866],"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.00013328706,0.00017156477,0.000065240354,0.0003683101,0.00010615165,1.7850353e-7,0.0045255665,0.03627003,0.00007525525,0.9155715,0.00008915939,0.04262376],"study_design_scores_gemma":[0.00069808034,0.00030374766,0.0028859428,0.0015555049,0.000040298117,0.000016831236,0.004937694,0.9470622,0.0066036945,0.034901552,0.00068688235,0.00030757292],"about_ca_topic_score_codex":0.00008378963,"about_ca_topic_score_gemma":0.00011157943,"teacher_disagreement_score":0.9871365,"about_ca_system_score_codex":0.000050755014,"about_ca_system_score_gemma":0.00009543465,"threshold_uncertainty_score":0.32848892},"labels":[],"label_agreement":null},{"id":"W4402187268","doi":"10.1109/tit.2024.3454119","title":"Reconstruction From Noisy Substrings","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Algorithms and Data Compression","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":"McMaster University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Substring; Computer science; Algorithm; Artificial intelligence; Mathematics; Data structure","score_opus":0.007290395334684244,"score_gpt":0.21114702613363967,"score_spread":0.20385663079895544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402187268","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.0028134168,0.000051290383,0.99052924,0.00015265499,0.0031884122,0.000100887075,0.000078085286,0.0006079327,0.002478111],"genre_scores_gemma":[0.9748416,0.00006488333,0.024189794,0.00040652274,0.00009732158,0.00004401912,0.000027778055,0.000009471434,0.00031860225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919057,0.000043364544,0.00026562286,0.00016206193,0.000206718,0.00013165451],"domain_scores_gemma":[0.9993282,0.00016105585,0.000046527482,0.00035686162,0.00004545509,0.00006193183],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022483927,0.00011303862,0.00008054688,0.0002617505,0.00018863319,0.00042953165,0.00027893626,0.00007531786,0.00025014003],"category_scores_gemma":[0.0000032235246,0.00009872072,0.000073750285,0.0003208255,0.000032315544,0.0051557883,0.0000030972749,0.00022549022,0.0012101197],"study_design_candidate":"design_other","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.000014239493,0.000011285951,3.624108e-7,0.000010150604,0.000020247167,0.0000011939655,0.00083192944,0.0012958365,0.00011890187,0.027444448,0.00035093533,0.9699005],"study_design_scores_gemma":[0.000699064,0.00016145509,0.00014403889,0.00037804066,0.000041960364,0.00011364362,0.00044305588,0.783376,0.056764692,0.098761104,0.05849309,0.0006238665],"about_ca_topic_score_codex":0.000030162892,"about_ca_topic_score_gemma":0.0000013937804,"teacher_disagreement_score":0.9720282,"about_ca_system_score_codex":0.00005926511,"about_ca_system_score_gemma":0.00005067696,"threshold_uncertainty_score":0.99956757},"labels":[],"label_agreement":null},{"id":"W4402218308","doi":"10.1109/tit.2024.3454239","title":"Rate-Limited Quantum-to-Classical Optimal Transport in Finite and Continuous-Variable Quantum Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum and electron transport phenomena","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Quantum; Variable (mathematics); Statistical physics; Quantum channel; Mathematics; Computer science; Physics; Quantum information; Quantum mechanics; Mathematical analysis","score_opus":0.006453913103212024,"score_gpt":0.21228300115515117,"score_spread":0.20582908805193914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402218308","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.13748033,0.00006368619,0.8574542,0.00014728172,0.00065453735,0.00044712718,0.00028498992,0.00016543033,0.0033024459],"genre_scores_gemma":[0.9988903,0.000017366547,0.00008744577,0.00012849845,0.000055169865,0.00019195897,0.00008754113,0.000026567282,0.0005151554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984143,0.00009854199,0.00063999114,0.00024419275,0.00018766562,0.00041531504],"domain_scores_gemma":[0.99922526,0.00029140586,0.00005855562,0.00020393434,0.000054556498,0.00016627481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000663541,0.00027093774,0.000313734,0.0004844086,0.00015933772,0.00016992641,0.0001258667,0.00010100074,0.0004178692],"category_scores_gemma":[0.0000018765527,0.00025419093,0.00010115488,0.0005820496,0.000066115834,0.0010477903,7.7320584e-7,0.00049385644,0.00026622976],"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.0006098439,0.00021851066,0.00008820133,0.00021990202,0.00021759282,0.000005963856,0.004845648,0.17570546,0.0005551635,0.8069122,0.00021374921,0.010407779],"study_design_scores_gemma":[0.0041004876,0.0011755561,0.0010707154,0.001036447,0.0003959856,0.00001907173,0.009706893,0.87783813,0.004884152,0.029614016,0.06816862,0.0019899104],"about_ca_topic_score_codex":0.0001093046,"about_ca_topic_score_gemma":0.000003609869,"teacher_disagreement_score":0.86140996,"about_ca_system_score_codex":0.00005560141,"about_ca_system_score_gemma":0.00012175054,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W4402811173","doi":"10.1109/tit.2024.3467194","title":"The Mean and Variance of the Reciprocal Merit Factor of Four Classes of Binary Sequences","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reciprocal; Binary number; Variance (accounting); Mathematics; Statistics; Factor (programming language); Combinatorics; Computer science; Arithmetic; Linguistics","score_opus":0.013838930947939402,"score_gpt":0.22778885495100865,"score_spread":0.21394992400306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811173","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.061483413,0.00014837841,0.936444,0.00029147908,0.00067892304,0.00013518115,0.000033048604,0.00004795538,0.00073764834],"genre_scores_gemma":[0.9991852,0.00010296103,0.00061967445,0.000038081314,0.0000055311657,0.000010299674,1.4871196e-7,0.0000022854194,0.0000358029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991964,0.00014925378,0.0003076032,0.00007182168,0.00019533005,0.00007958343],"domain_scores_gemma":[0.99880636,0.00068645674,0.00012637218,0.00028775036,0.00007410726,0.000018985727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058452337,0.00007406052,0.00009286768,0.00011926645,0.00016327441,0.0000498289,0.0004052361,0.000042017768,0.000012465593],"category_scores_gemma":[0.000013063671,0.000042928117,0.00010058867,0.0004944132,0.00029544454,0.00082926796,0.0000050841613,0.00013525526,0.0000021685698],"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.000103922896,0.000032742995,0.00000724316,0.00021046029,0.000099630925,2.1899226e-7,0.009598513,0.0016724331,0.0042907214,0.7659304,0.00003138711,0.21802229],"study_design_scores_gemma":[0.0007080915,0.0010930893,0.0019440276,0.0011624916,0.00013974399,0.000065330125,0.0050844117,0.064463615,0.49540055,0.4225612,0.006858296,0.00051915785],"about_ca_topic_score_codex":0.0000045738584,"about_ca_topic_score_gemma":0.0000031522052,"teacher_disagreement_score":0.9377018,"about_ca_system_score_codex":0.000008563911,"about_ca_system_score_gemma":0.000065306696,"threshold_uncertainty_score":0.17505579},"labels":[],"label_agreement":null},{"id":"W4402833556","doi":"10.1109/tit.2024.3467282","title":"Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":8,"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; University of Toronto","funders":"Huawei Technologies","keywords":"Measure (data warehouse); Perception; Distortion (music); Statistics; Computer science; Mathematics; Psychology; Data mining; Telecommunications; Bandwidth (computing)","score_opus":0.013791544852949008,"score_gpt":0.24139434534527027,"score_spread":0.22760280049232126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402833556","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.004324332,0.000005700834,0.98765427,0.0029119698,0.0019702448,0.0004414695,0.0001369649,0.0008340664,0.0017209549],"genre_scores_gemma":[0.9968812,0.000011754838,0.00019551888,0.0020703757,0.00007104072,0.00021936478,0.00019782485,0.000012216196,0.0003407399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788,0.00045753448,0.0004914975,0.0002943604,0.0006378449,0.00023875578],"domain_scores_gemma":[0.99886125,0.00031851637,0.00010620219,0.00043238112,0.00019113637,0.00009048799],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014681803,0.00024087421,0.00012445179,0.00038136131,0.00081359886,0.0005362463,0.0003259366,0.00016035585,0.00087568036],"category_scores_gemma":[0.00003119467,0.0001845038,0.0002580073,0.00081802486,0.000099259385,0.002531988,0.0000016462963,0.00047601384,0.0025870383],"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.00041314808,0.00052386225,0.0000026729876,0.0001699163,0.00012195714,0.0000042350216,0.004609281,0.12747961,0.005340034,0.33581975,0.012048782,0.5134668],"study_design_scores_gemma":[0.00063166145,0.00045221695,0.0017913558,0.00017943225,0.000055117052,0.000032091088,0.0009818738,0.9664482,0.0051818867,0.011639161,0.012124683,0.00048234145],"about_ca_topic_score_codex":0.0000065952163,"about_ca_topic_score_gemma":0.0000025395027,"teacher_disagreement_score":0.9925568,"about_ca_system_score_codex":0.0004626648,"about_ca_system_score_gemma":0.00011527275,"threshold_uncertainty_score":0.99818957},"labels":[],"label_agreement":null},{"id":"W4402979687","doi":"10.1109/tit.2024.3470952","title":"Covariance-Based Activity Detection in Cooperative Multi-Cell Massive MIMO: Scaling Law and Efficient Algorithms","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"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":"National Science and Technology Planning Project; National Natural Science Foundation of China","keywords":"Covariance; MIMO; Algorithm; Scaling law; Computer science; Scaling; Mathematics; Telecommunications; Statistics","score_opus":0.007208132064249445,"score_gpt":0.21732735211668625,"score_spread":0.2101192200524368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402979687","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.004006138,0.00013193562,0.99327075,0.000009310147,0.0010274679,0.00046778683,0.000060340393,0.00043291078,0.0005933619],"genre_scores_gemma":[0.9964673,0.000026655227,0.003256326,0.000035869878,0.000017016459,0.00014681544,0.000007135499,0.000023803967,0.00001906939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922794,0.000074247786,0.00028810845,0.00013471914,0.00010949626,0.00016545958],"domain_scores_gemma":[0.9995553,0.00017339906,0.000037029244,0.00012232352,0.00006170269,0.000050234015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026322066,0.00017580154,0.00013722286,0.00033520078,0.0001382012,0.00010793915,0.000044319222,0.00010738132,0.000016317195],"category_scores_gemma":[0.000005570446,0.00018173548,0.000041124385,0.00039389168,0.00005148678,0.0009531297,5.378912e-7,0.0003305978,0.00005823111],"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.000043184933,0.000030882165,6.15533e-8,0.00018856961,0.000011277883,8.865216e-7,0.0011138398,0.9393604,0.0020464924,0.000343545,9.837507e-7,0.0568599],"study_design_scores_gemma":[0.00062772573,0.000025039399,0.0000029450882,0.0001342785,0.000012387378,0.0000025988122,0.00028458165,0.8545579,0.14403406,0.00002585665,0.000132715,0.00015990873],"about_ca_topic_score_codex":0.00001660434,"about_ca_topic_score_gemma":0.00002807262,"teacher_disagreement_score":0.99246114,"about_ca_system_score_codex":0.0002784718,"about_ca_system_score_gemma":0.000029219153,"threshold_uncertainty_score":0.7410958},"labels":[],"label_agreement":null},{"id":"W4404371577","doi":"10.1109/tit.2024.3498033","title":"Repairing Schemes for Tamo-Barg Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","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":"McMaster University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.010232256204397735,"score_gpt":0.24582375622435343,"score_spread":0.23559150001995569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404371577","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.00058324065,0.00005972453,0.99465674,0.0004324784,0.00054731424,0.00029972903,0.000043581338,0.0009878236,0.0023893928],"genre_scores_gemma":[0.972105,0.000023936891,0.026119709,0.00039886194,0.000035923313,0.00039046802,0.000016068534,0.000010027944,0.000900001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992887,0.000021711478,0.0002555337,0.0001434526,0.00013938097,0.00015122596],"domain_scores_gemma":[0.999249,0.0002440372,0.000037414306,0.0003634523,0.000056561083,0.000049555678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038171778,0.00010210764,0.00007905097,0.00022834528,0.00026652755,0.0003403854,0.00029795157,0.00005291652,0.000047236434],"category_scores_gemma":[0.0000061974706,0.000095669995,0.00012443819,0.00033402225,0.00003290062,0.0018741369,0.0000020379125,0.00011520376,0.0004621825],"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.000008226155,0.000025059795,1.3449055e-7,0.000084888685,0.00003209907,3.2091344e-7,0.0010554441,0.0019926983,0.00045874916,0.6510687,0.00095392246,0.34431976],"study_design_scores_gemma":[0.00025824714,0.000061112376,0.000006604618,0.000077173754,0.000026487174,0.000021633325,0.00017538098,0.5756243,0.0975194,0.03690206,0.28907195,0.00025570163],"about_ca_topic_score_codex":0.0000018345056,"about_ca_topic_score_gemma":8.2891415e-7,"teacher_disagreement_score":0.97152174,"about_ca_system_score_codex":0.00004548959,"about_ca_system_score_gemma":0.00006162356,"threshold_uncertainty_score":0.5940575},"labels":[],"label_agreement":null},{"id":"W4404788977","doi":"10.1109/tit.2024.3503770","title":"Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"McMaster University","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Peng Cheng Laboratory","keywords":"Reed–Solomon error correction; Generator matrix; Computer science; Coding (social sciences); Block code; Linear code; Algorithm; Decoding methods; Theoretical computer science; Mathematics; Statistics","score_opus":0.010043670841173455,"score_gpt":0.23847043933896916,"score_spread":0.2284267684977957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788977","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.0029636584,0.00010105046,0.99539477,0.00008345597,0.00019236672,0.00037165658,0.000023700135,0.00046590422,0.00040341547],"genre_scores_gemma":[0.98244673,0.000045892033,0.016964264,0.00017981675,0.000026758158,0.00016545273,0.000011196754,0.000011002146,0.00014885838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989529,0.0001104644,0.0003443744,0.00021044831,0.00014960891,0.00023217824],"domain_scores_gemma":[0.99918544,0.00033848675,0.00006835429,0.00028894978,0.000047265075,0.0000714992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333669,0.00016659156,0.00015449588,0.00040871304,0.00029410733,0.00036683065,0.00023695405,0.00008694013,0.000031067964],"category_scores_gemma":[0.0000037794161,0.00014828485,0.00006519588,0.00089790014,0.00012336018,0.0012506518,0.00000418895,0.00028057912,0.00003902763],"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.00022529704,0.00011759751,0.00004022307,0.00017599716,0.00011934477,0.0000056414287,0.0077507314,0.08525985,0.00048282507,0.61609083,0.000050748742,0.2896809],"study_design_scores_gemma":[0.0033209573,0.0006336041,0.00019256295,0.000517042,0.00014024696,0.00019541707,0.0023548987,0.9358459,0.007970394,0.026038202,0.021516334,0.0012744183],"about_ca_topic_score_codex":0.000005635861,"about_ca_topic_score_gemma":0.000013189875,"teacher_disagreement_score":0.9794831,"about_ca_system_score_codex":0.0000322892,"about_ca_system_score_gemma":0.00007015464,"threshold_uncertainty_score":0.60468805},"labels":[],"label_agreement":null},{"id":"W4404914946","doi":"10.1109/tit.2024.3509825","title":"Rate-Distortion Theory for Mixed States","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Semiconductor Lasers and Optical Devices","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Distortion (music); Rate–distortion theory; Computer science; Mathematics; Algorithm; Telecommunications; Bandwidth (computing); Data compression","score_opus":0.0071240915907535875,"score_gpt":0.21410166768623806,"score_spread":0.20697757609548448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404914946","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.022453176,0.0001710271,0.97146845,0.00003637283,0.0026192141,0.00023560967,0.00017816976,0.0007446491,0.002093321],"genre_scores_gemma":[0.9988125,0.00009511001,0.00027189046,0.00017725324,0.00004539912,0.000144747,0.000055220054,0.000022648004,0.00037521802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939644,0.00003251932,0.0002570443,0.00007507003,0.00008274458,0.00015619375],"domain_scores_gemma":[0.9993095,0.00045962335,0.000015641097,0.00012007509,0.000040641873,0.00005455816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000418828,0.00012762831,0.000094751136,0.00018785268,0.000093911345,0.00012116434,0.00007104575,0.00007812347,0.00031234088],"category_scores_gemma":[0.000007799855,0.000112505215,0.00010165754,0.00014798851,0.000034968496,0.0010277852,2.6965066e-7,0.00014070577,0.00037716547],"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.00031776124,0.00004444258,3.1533924e-7,0.0011291172,0.0003502474,0.000001346501,0.004054092,0.4288856,0.0034299856,0.1503917,0.0063137747,0.4050816],"study_design_scores_gemma":[0.00081980793,0.00020187667,0.000027745853,0.00023977722,0.00020703835,0.000009208422,0.0028964682,0.48317027,0.2865657,0.108570375,0.11656917,0.00072257355],"about_ca_topic_score_codex":0.0000011716276,"about_ca_topic_score_gemma":0.000001974388,"teacher_disagreement_score":0.97635937,"about_ca_system_score_codex":0.000079749494,"about_ca_system_score_gemma":0.000015466005,"threshold_uncertainty_score":0.4847825},"labels":[],"label_agreement":null},{"id":"W4405718309","doi":"10.1109/tit.2024.3521236","title":"On Constructing Bent Functions From Cyclotomic Mappings","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"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":"National Key Research and Development Program of China; Natural Science Foundation of Hubei Province; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Bent function; Mathematics; Discrete mathematics; Computer science; Boolean function; Combinatorics; Algebra over a field; Pure mathematics; Engineering; Structural engineering","score_opus":0.00626930448683798,"score_gpt":0.20340754927411842,"score_spread":0.19713824478728043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405718309","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.024530092,0.00003448873,0.9625588,0.00032581534,0.0034469087,0.00018152547,0.00010777186,0.0011482191,0.0076663783],"genre_scores_gemma":[0.99476576,0.000014723252,0.0035208876,0.0012037741,0.00005937047,0.0000621651,0.000016232889,0.000012381947,0.00034473298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987929,0.00008284769,0.0003924558,0.00023487558,0.00027483178,0.00022211338],"domain_scores_gemma":[0.99864256,0.00069269474,0.00007696706,0.00046062804,0.000043183158,0.000083986364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003987579,0.00018832221,0.00013220026,0.00044983864,0.0003029317,0.0005058908,0.0003771673,0.000092348935,0.00046406817],"category_scores_gemma":[0.000010660035,0.00017115062,0.00014530405,0.00042367136,0.000068019384,0.002278533,0.000004059248,0.0003565195,0.0028454605],"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.000035616507,0.00004232336,4.986443e-7,0.000028256003,0.00009104346,0.0000035105177,0.0029573515,0.0075302045,0.0005809973,0.51885015,0.0009099517,0.46897012],"study_design_scores_gemma":[0.0013249398,0.00036135112,0.000079780046,0.0008234402,0.00010914921,0.00014275135,0.0042944793,0.4372317,0.05525136,0.46849954,0.030667191,0.0012143251],"about_ca_topic_score_codex":0.000016006608,"about_ca_topic_score_gemma":0.0000011251767,"teacher_disagreement_score":0.97023565,"about_ca_system_score_codex":0.00012301187,"about_ca_system_score_gemma":0.00007243124,"threshold_uncertainty_score":0.99793094},"labels":[],"label_agreement":null},{"id":"W4406949747","doi":"10.1109/tit.2025.3536463","title":"Optimal Short-Term Forecast for Locally Stationary Functional Time Series","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Energy Load and Power Forecasting","field":"Engineering","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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Term (time); Series (stratigraphy); Time series; Computer science; Econometrics; Mathematics; Machine learning","score_opus":0.007304194607999415,"score_gpt":0.20214673390949295,"score_spread":0.19484253930149353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949747","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.0062093553,0.000019718858,0.9772125,0.000041170963,0.0011172419,0.00022040952,0.0001994097,0.0003909039,0.014589279],"genre_scores_gemma":[0.98878866,0.000027363358,0.0061623626,0.00027416844,0.00007720947,0.00033716703,0.0002876683,0.000028703182,0.0040166867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925107,0.000016101985,0.0003400224,0.00008129998,0.00012269273,0.00018882162],"domain_scores_gemma":[0.99952585,0.00017680817,0.000025688765,0.00012783152,0.00009907806,0.000044741708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018025248,0.00015929571,0.000118339296,0.00027837275,0.0002439142,0.00006295171,0.00008455599,0.00009586532,0.00029267193],"category_scores_gemma":[0.0000055928954,0.00016626762,0.00010212446,0.00018635351,0.000045888086,0.0012262588,8.476467e-7,0.0001434669,0.00009370885],"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.0002421257,0.000017898288,0.0000019188149,0.00009138764,0.00009606139,2.0675097e-7,0.00034102268,0.90862197,0.00025624808,0.0091758035,0.0014744676,0.07968088],"study_design_scores_gemma":[0.0022319867,0.0004083437,0.0003300267,0.00040987163,0.00018581148,0.00004884557,0.001032674,0.8497701,0.079091385,0.007292657,0.0581491,0.0010491844],"about_ca_topic_score_codex":4.883035e-7,"about_ca_topic_score_gemma":0.0000019057941,"teacher_disagreement_score":0.9825793,"about_ca_system_score_codex":0.00008079605,"about_ca_system_score_gemma":0.00005129661,"threshold_uncertainty_score":0.6780197},"labels":[],"label_agreement":null},{"id":"W4407462795","doi":"10.1109/tit.2025.3541375","title":"On <i>k</i>-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Image Processing and 3D Reconstruction","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":"National Natural Science Foundation of China","keywords":"Algorithm; Maximum likelihood; TRACE (psycholinguistics); Computer science; Maximum likelihood sequence estimation; Estimation theory; Mathematics; Statistics","score_opus":0.006647195131734337,"score_gpt":0.23484644799200569,"score_spread":0.22819925286027135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407462795","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.0017459457,0.000022264385,0.9936727,0.0007027388,0.0017861372,0.00037715997,0.000020737254,0.00030911562,0.001363143],"genre_scores_gemma":[0.74918514,0.00002191149,0.2486347,0.0015421574,0.0000305426,0.00029988258,0.000013448587,0.00001271932,0.00025948443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998999,0.00006624289,0.0003712822,0.00021327508,0.00015451135,0.0001956598],"domain_scores_gemma":[0.9990558,0.00031252587,0.00015511714,0.00025643528,0.00016537299,0.000054767603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895744,0.00016922955,0.000139679,0.00056689925,0.0005867367,0.0002913715,0.00017171656,0.00012417149,0.000010560355],"category_scores_gemma":[0.00002792862,0.0001648843,0.000080852704,0.000389329,0.000094191106,0.0020106137,0.0000012752682,0.00019585332,0.00002842087],"study_design_candidate":"design_other","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.00009930387,0.00004051216,4.5590096e-7,0.000080001446,0.000016793152,7.124233e-8,0.00022948951,0.010584562,0.000059073052,0.012062296,0.00009330646,0.97673416],"study_design_scores_gemma":[0.001530077,0.0002142838,0.000016853703,0.00019384811,0.00003637082,0.000031133583,0.0001798594,0.77774036,0.054883085,0.16440785,0.00052910583,0.00023717362],"about_ca_topic_score_codex":0.0000028832962,"about_ca_topic_score_gemma":0.0000010774814,"teacher_disagreement_score":0.97649693,"about_ca_system_score_codex":0.00007806185,"about_ca_system_score_gemma":0.0001721558,"threshold_uncertainty_score":0.67237866},"labels":[],"label_agreement":null},{"id":"W4407639540","doi":"10.1109/tit.2025.3541181","title":"Analysis of the Rate of Convergence of an Over-Parametrized Deep Neural Network Estimate Learned by Gradient Descent","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gradient descent; Convergence (economics); Artificial neural network; Computer science; Rate of convergence; Deep neural networks; Stochastic gradient descent; Artificial intelligence; Telecommunications","score_opus":0.00809871770870112,"score_gpt":0.2539479325295855,"score_spread":0.24584921482088434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407639540","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.16544296,0.000019909296,0.8338196,0.00011621189,0.00025050525,0.0002060932,0.000026062628,0.00002710627,0.000091503236],"genre_scores_gemma":[0.9984139,0.00002737767,0.0012637,0.00022797646,0.000002268631,0.00002483227,0.0000058608284,0.0000022526845,0.000031788455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885064,0.00016876041,0.00056399265,0.0001167142,0.00016215202,0.00013774064],"domain_scores_gemma":[0.99860555,0.00027345415,0.00038179057,0.00056743855,0.00013306733,0.000038675746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004412,0.00010189881,0.0002286253,0.00024659207,0.0001429768,0.000025836895,0.0005625877,0.00004476853,0.00002633953],"category_scores_gemma":[0.000009100393,0.00007847592,0.00019517423,0.002785057,0.000121166835,0.00053754105,0.000006776752,0.00012021364,0.0000014975709],"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.00006183809,0.000085779924,0.000048673515,0.00001942667,0.00015585622,2.1095023e-8,0.00025027414,0.93124634,0.00059630926,0.0297534,0.00004028229,0.037741806],"study_design_scores_gemma":[0.00028385836,0.000051505034,0.0019168574,0.000019722427,0.00018825839,2.7290383e-7,0.000037306847,0.962694,0.03139146,0.0032702277,0.00007524547,0.000071299015],"about_ca_topic_score_codex":0.00003784367,"about_ca_topic_score_gemma":0.000013475223,"teacher_disagreement_score":0.832971,"about_ca_system_score_codex":0.00002323772,"about_ca_system_score_gemma":0.000033260258,"threshold_uncertainty_score":0.3200155},"labels":[],"label_agreement":null},{"id":"W4407783209","doi":"10.1109/tit.2025.3544168","title":"Higher-Order Staircase Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":5,"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":"Computer science; Order (exchange); Algorithm; Theoretical computer science; Mathematics","score_opus":0.0068898875733434655,"score_gpt":0.2343245736785783,"score_spread":0.22743468610523485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407783209","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.0005101022,0.000014411688,0.97271234,0.0010236672,0.0005255418,0.0001919417,0.000021359196,0.00040705016,0.024593582],"genre_scores_gemma":[0.9861466,0.000015812322,0.0077465926,0.0020926856,0.000009340398,0.00014151238,0.00001025346,0.0000040649425,0.0038331028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992782,0.00004988597,0.0002624532,0.0001176134,0.00014612393,0.00014571258],"domain_scores_gemma":[0.99913096,0.00014133171,0.000058875983,0.00051786896,0.00010440251,0.000046558827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022925647,0.00010535088,0.00008795954,0.00027383602,0.000315311,0.00017228126,0.00039839864,0.00005960302,0.00015918889],"category_scores_gemma":[0.000003847232,0.000101304504,0.00006240588,0.0007077539,0.000050392344,0.0013277379,0.000003106881,0.00013969906,0.0005975096],"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.000011441509,0.00007153304,6.4016103e-7,0.000019521012,0.000025408677,3.9109952e-7,0.00040427176,0.004189353,0.0001353634,0.80412686,0.0011893109,0.18982594],"study_design_scores_gemma":[0.002526501,0.00015389273,0.00056439784,0.00012571353,0.00009516191,0.000024628996,0.0007391402,0.18311916,0.14025994,0.21364786,0.45777282,0.0009708103],"about_ca_topic_score_codex":0.00000737767,"about_ca_topic_score_gemma":0.0000019972076,"teacher_disagreement_score":0.98563653,"about_ca_system_score_codex":0.00005114415,"about_ca_system_score_gemma":0.0000879777,"threshold_uncertainty_score":0.7679977},"labels":[],"label_agreement":null},{"id":"W4407901096","doi":"10.1109/tit.2025.3544970","title":"Bounding the Graph Capacity With Quantum Mechanics and Finite Automata","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","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":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Quantum finite automata; Automaton; Deterministic finite automaton; Computer science; Nondeterministic finite automaton; Theoretical computer science; Discrete mathematics; Mathematics; Automata theory; Artificial intelligence","score_opus":0.00695810918766361,"score_gpt":0.2052179497389063,"score_spread":0.1982598405512427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407901096","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.0076258793,0.00001202277,0.9900021,0.00091630645,0.0005556213,0.00016296512,0.000008343399,0.0002615688,0.00045516744],"genre_scores_gemma":[0.9919234,0.000015947206,0.0068791416,0.00111002,0.000008603486,0.000020081829,8.535157e-7,0.000003695502,0.000038239334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.000099141485,0.00020400192,0.00012894363,0.0001810446,0.00017175394],"domain_scores_gemma":[0.99902904,0.00039977024,0.000081155275,0.00039502204,0.000055917648,0.000039105085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056628365,0.00013012649,0.00009883225,0.00024970085,0.0007454942,0.00030417772,0.00037765995,0.000048814767,0.0000040795007],"category_scores_gemma":[0.000009869999,0.00008331203,0.000044238237,0.0005434844,0.00006162576,0.00070726254,0.000005901085,0.0002953048,0.000012884564],"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.00003158471,0.000027279008,9.473464e-7,0.000035698227,0.00004811032,5.436808e-7,0.0033778946,0.10098053,0.000012164696,0.76102865,0.00005066392,0.13440594],"study_design_scores_gemma":[0.0003121584,0.0000804024,0.000045319935,0.00006785199,0.000014012938,0.000017909306,0.00017978251,0.88372856,0.00059675437,0.1138603,0.0009817489,0.00011521479],"about_ca_topic_score_codex":0.0000099911485,"about_ca_topic_score_gemma":0.000003863879,"teacher_disagreement_score":0.9842975,"about_ca_system_score_codex":0.00002153468,"about_ca_system_score_gemma":0.00005361324,"threshold_uncertainty_score":0.57338136},"labels":[],"label_agreement":null},{"id":"W4408092492","doi":"10.1109/tit.2025.3546976","title":"Sharp Signal Detection Under Ferromagnetic Ising Models","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":1,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ising model; Ferromagnetism; Detection theory; Statistical physics; Computer science; SIGNAL (programming language); Physics; Condensed matter physics; Telecommunications; Detector","score_opus":0.011037320475722137,"score_gpt":0.22531731304482303,"score_spread":0.21427999256910088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408092492","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.0014107615,0.00001614404,0.98778164,0.0005153255,0.0004111475,0.0002267828,0.000005016205,0.0002936135,0.009339547],"genre_scores_gemma":[0.9956328,0.000017488954,0.0022446977,0.0014321205,0.000014023508,0.00007462121,0.0000018350802,0.000004064214,0.0005782956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991808,0.000055880642,0.00028835115,0.00014484813,0.00015835164,0.00017176928],"domain_scores_gemma":[0.999334,0.00013090677,0.00006953152,0.0003388638,0.00007790557,0.000048839844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019616363,0.00011980947,0.00008767934,0.0002739324,0.00048320295,0.00021443421,0.00032666224,0.00007225427,0.000051860276],"category_scores_gemma":[8.511368e-7,0.00011634447,0.0000789024,0.0006214726,0.00003710029,0.0020446924,0.0000024744338,0.00020393492,0.00013182899],"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.000014655849,0.000029554702,3.898848e-8,0.000008364874,0.000011785648,8.8239744e-8,0.00020935666,0.5381131,0.0003231901,0.22535516,0.00007373018,0.23586093],"study_design_scores_gemma":[0.00025154973,0.000044917157,0.000018863377,0.00002710309,0.000013757654,0.0000054329153,0.000083407984,0.8376985,0.016793873,0.14388214,0.0010477478,0.00013271265],"about_ca_topic_score_codex":0.000010238853,"about_ca_topic_score_gemma":0.0000082875695,"teacher_disagreement_score":0.9942221,"about_ca_system_score_codex":0.00006774382,"about_ca_system_score_gemma":0.00005961947,"threshold_uncertainty_score":0.47443897},"labels":[],"label_agreement":null},{"id":"W4408860469","doi":"10.1109/tit.2025.3555187","title":"Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Computer science; Correlation; Enhanced Data Rates for GSM Evolution; Graph theory; Combinatorics; Mathematics; Artificial intelligence; Geometry","score_opus":0.009118280732590495,"score_gpt":0.22680165236590327,"score_spread":0.21768337163331278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408860469","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.0009142879,0.000012520564,0.99511445,0.00021561164,0.0013285212,0.0006748358,0.000053371543,0.00030553908,0.0013808717],"genre_scores_gemma":[0.963518,0.000005541963,0.034854744,0.00090939057,0.000014439526,0.00031081386,0.000024561376,0.000008950065,0.0003535567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878716,0.00010637888,0.00038224558,0.00020558994,0.000255884,0.00026275197],"domain_scores_gemma":[0.99883026,0.00037269027,0.00014073403,0.00039485993,0.00019369509,0.00006778305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039913,0.00018867345,0.00015841077,0.00049321254,0.0006004918,0.00020852943,0.00038561886,0.00009130117,0.000014384408],"category_scores_gemma":[0.000010228755,0.00016225677,0.00012504937,0.00083129,0.00006857171,0.00093677983,0.0000032581206,0.00018061884,0.000039622857],"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.00015196763,0.00013107444,0.0000013340896,0.0000361406,0.0000908731,4.7203642e-7,0.001493997,0.44984147,0.000037542275,0.38361824,0.000100770296,0.16449612],"study_design_scores_gemma":[0.0025019567,0.00035798812,0.00006975425,0.00014822316,0.00008138167,0.000015944826,0.0007582858,0.9006392,0.018192975,0.07485756,0.0019680855,0.00040866667],"about_ca_topic_score_codex":0.0000025128782,"about_ca_topic_score_gemma":7.8456543e-7,"teacher_disagreement_score":0.9626037,"about_ca_system_score_codex":0.000091069654,"about_ca_system_score_gemma":0.00007553984,"threshold_uncertainty_score":0.6616639},"labels":[],"label_agreement":null},{"id":"W4409762089","doi":"10.1109/tit.2025.3564114","title":"Coded Downlink Massive Random Access and a Finite de Finetti Theorem","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":1,"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":"Telecommunications link; Computer science; Mathematics; Theoretical computer science; Computer network","score_opus":0.005449201634268829,"score_gpt":0.21908863080109597,"score_spread":0.21363942916682716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409762089","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.00818831,0.00005346975,0.9727321,0.00013082018,0.0004990284,0.00028751625,0.000055188346,0.00040567465,0.017647877],"genre_scores_gemma":[0.9985838,0.00017101706,0.0003289196,0.0005214074,0.000022851802,0.000126697,0.000013931596,0.000012897356,0.0002184993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923617,0.00006788489,0.0003058481,0.00008115709,0.00009817541,0.00021078657],"domain_scores_gemma":[0.9991618,0.0004795057,0.00004175643,0.00020666301,0.000050838018,0.000059454833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032490204,0.00016518703,0.00016320693,0.00030767612,0.00016521414,0.00014404794,0.0001698924,0.00013733363,0.00013484803],"category_scores_gemma":[0.00001656857,0.00016027775,0.00006301112,0.00029322295,0.00007485545,0.00095863733,0.0000019960846,0.0003066474,0.000044326986],"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.00021154367,0.000012791072,0.000003852822,0.00009740001,0.00009861169,7.7969713e-7,0.0009856472,0.894708,0.000062556086,0.01006423,0.00067916745,0.09307542],"study_design_scores_gemma":[0.0036144734,0.000033230037,0.0002581598,0.00022046895,0.00010632492,0.000007344458,0.00038753648,0.94829315,0.01978558,0.023903387,0.003008168,0.0003822084],"about_ca_topic_score_codex":0.0000034870543,"about_ca_topic_score_gemma":0.0000057970374,"teacher_disagreement_score":0.9903955,"about_ca_system_score_codex":0.000082153005,"about_ca_system_score_gemma":0.000035781308,"threshold_uncertainty_score":0.65359366},"labels":[],"label_agreement":null},{"id":"W4410770407","doi":"10.1109/tit.2025.3570770","title":"Single-Shot Entanglement Manipulation of States and Channels Revisited","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Laser-Matter Interactions and Applications","field":"Physics and Astronomy","cited_by":2,"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 Calgary","funders":"Division of Mathematical Sciences; Shenzhen Science and Technology Innovation Program; Natural Sciences and Engineering Research Council of Canada; Danish e-Infrastructure Cooperation; Shenzhen Fundamental Research Program; National Natural Science Foundation of China; Israel Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Quantum entanglement; Shot (pellet); Computer science; Physics; Statistical physics; Quantum mechanics; Quantum; Materials science","score_opus":0.012114423051199641,"score_gpt":0.25518932289971663,"score_spread":0.243074899848517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410770407","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.053327173,0.0000045303705,0.9350311,0.00020683944,0.00017267224,0.00026983576,0.0001619148,0.00003152577,0.010794388],"genre_scores_gemma":[0.9988852,0.0000059990193,0.00021715672,0.00020441719,0.000013959162,0.00008100115,0.000087515844,0.0000038964185,0.00050083693],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940604,0.000029181347,0.00032829965,0.000075716256,0.000076008284,0.00008472497],"domain_scores_gemma":[0.9995292,0.000084601736,0.00011854463,0.0001541372,0.00008771942,0.000025802827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109559245,0.00009056979,0.00009832171,0.00020375705,0.0001437058,0.00004953215,0.00005553968,0.000022048962,0.00068174145],"category_scores_gemma":[7.437558e-7,0.00008640838,0.00005149016,0.00019562957,0.000033534692,0.0005054315,0.0000014397069,0.00007775677,0.000035038927],"study_design_candidate":"bench_or_experimental","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.00031619237,0.0012508719,0.00050860806,0.00029421155,0.0005955133,1.2849856e-7,0.0046843165,0.040001478,0.010485915,0.4449712,0.0027046464,0.49418694],"study_design_scores_gemma":[0.0024534175,0.0002590751,0.0010085508,0.00049574533,0.00031783016,0.0000025799918,0.009132205,0.017270269,0.83293635,0.08662832,0.048890438,0.00060522347],"about_ca_topic_score_codex":0.000033383883,"about_ca_topic_score_gemma":0.0000010384574,"teacher_disagreement_score":0.9455581,"about_ca_system_score_codex":0.00002692811,"about_ca_system_score_gemma":0.000012608533,"threshold_uncertainty_score":0.74645907},"labels":[],"label_agreement":null},{"id":"W4411725828","doi":"10.1109/tit.2025.3583936","title":"Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum and electron transport phenomena","field":"Physics and Astronomy","cited_by":1,"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 Waterloo","funders":"Canada First Research Excellence Fund","keywords":"Quantum; Simple (philosophy); Quantum channel; Statistical physics; Additive function; Quantum capacity; Amplitude damping channel; Computer science; Quantum network; Physics; Quantum information; Quantum mechanics; Mathematics","score_opus":0.005983109724940201,"score_gpt":0.21791618749731878,"score_spread":0.21193307777237858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411725828","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.21913338,0.000010473281,0.7682734,0.000045045897,0.0003556322,0.00023976057,0.00028684232,0.000035103552,0.011620343],"genre_scores_gemma":[0.9993176,0.000008948595,0.00002319402,0.00008866173,0.000016911405,0.000105705774,0.00006240218,0.000008130961,0.00036847018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988771,0.00006140176,0.0005118597,0.00011498903,0.0001464396,0.00028822772],"domain_scores_gemma":[0.9993646,0.00016266132,0.00013005997,0.00022870435,0.00007090727,0.000043042786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003625261,0.0001779439,0.00026265573,0.0004374643,0.00014927737,0.000026681662,0.0001432573,0.00006310879,0.0006998555],"category_scores_gemma":[0.0000016561474,0.0001755698,0.00013396383,0.00043325697,0.00012165806,0.00083706493,8.333876e-7,0.000286407,0.000051268493],"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.0005716288,0.0006526306,0.00024030732,0.00028118893,0.00026612807,4.4306043e-7,0.007478473,0.028969247,0.0009247376,0.92842954,0.0009645713,0.031221118],"study_design_scores_gemma":[0.00387568,0.00043781006,0.001519463,0.00033555532,0.00014610728,9.731807e-7,0.021617148,0.04941008,0.25433537,0.6621051,0.005320291,0.0008964559],"about_ca_topic_score_codex":0.00036378548,"about_ca_topic_score_gemma":0.000011284136,"teacher_disagreement_score":0.7801842,"about_ca_system_score_codex":0.000046982164,"about_ca_system_score_gemma":0.00012479743,"threshold_uncertainty_score":0.76629275},"labels":[],"label_agreement":null},{"id":"W4411950007","doi":"10.1109/tit.2025.3584013","title":"Next-Token Prediction Capacity: General Upper Bounds and a Lower Bound for Transformers","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Upper and lower bounds; Computer science; Security token; Capacity planning; Mathematics; Algorithm; Computer network","score_opus":0.010348358903678358,"score_gpt":0.2351723872306748,"score_spread":0.22482402832699644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411950007","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.009367785,0.000012783666,0.98418254,0.0010004,0.0007054251,0.00050372165,0.0001164473,0.00015801513,0.003952903],"genre_scores_gemma":[0.98569685,0.000033210406,0.011182808,0.0019723729,0.00004067002,0.00041797716,0.000029203695,0.0000073746646,0.00061952474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914914,0.00003233786,0.0003149974,0.00017007101,0.00016302198,0.00017039989],"domain_scores_gemma":[0.99930596,0.00019967581,0.00006464527,0.00021754747,0.00014795785,0.00006423362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028261714,0.00013715589,0.000112988724,0.0002927347,0.0005313227,0.00036228276,0.0001908074,0.00007188198,0.000015537771],"category_scores_gemma":[0.0000036555723,0.0001392384,0.000107294916,0.0003809114,0.0000777806,0.0020917023,0.00000212268,0.00013529326,0.00002263649],"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.00007100939,0.00007812124,0.000002016534,0.000043495045,0.00006686702,3.8319246e-8,0.0012077151,0.008506979,0.00025020697,0.71906793,0.0006532041,0.2700524],"study_design_scores_gemma":[0.0015535124,0.00019408751,0.0004867044,0.00004523393,0.00006702889,0.000009380824,0.00019888676,0.5260065,0.0043069804,0.39121822,0.075574815,0.0003386439],"about_ca_topic_score_codex":0.00001060561,"about_ca_topic_score_gemma":0.0000033668214,"teacher_disagreement_score":0.9763291,"about_ca_system_score_codex":0.00007216226,"about_ca_system_score_gemma":0.00011073099,"threshold_uncertainty_score":0.5677977},"labels":[],"label_agreement":null},{"id":"W4412623673","doi":"10.1109/tit.2025.3592490","title":"Improved Constructions of Skew-Tolerant Gray Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","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":"McMaster University","funders":"","keywords":"Skew; Computer science; Gray code; Gray (unit); Mathematics; Algorithm; Telecommunications","score_opus":0.004925184053069241,"score_gpt":0.21465684968382953,"score_spread":0.2097316656307603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623673","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.0035990034,0.000014158551,0.98578763,0.00013700852,0.0013037224,0.00017804079,0.00003119026,0.00020580173,0.008743426],"genre_scores_gemma":[0.99112433,0.000014615819,0.008329082,0.00033638242,0.000006551124,0.00004227989,0.0000019979382,0.0000027286178,0.00014204087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910206,0.00010751279,0.00039960063,0.00011484621,0.00012868669,0.00014728044],"domain_scores_gemma":[0.9989765,0.0002674994,0.00012601216,0.00044473747,0.00014297356,0.000042247208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004450413,0.00012261915,0.00015024301,0.00059668336,0.00029075274,0.00007803546,0.00040497846,0.000072888426,0.00007138009],"category_scores_gemma":[0.000009531423,0.00011515899,0.00015802124,0.00078020646,0.00016675048,0.0011165232,0.0000031666536,0.00017556161,0.000025558427],"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.00006452586,0.000058604823,0.0000032702733,0.000040966443,0.00006198697,6.599452e-8,0.0009933389,0.0011785572,0.00054102094,0.86038774,0.00006880647,0.13660109],"study_design_scores_gemma":[0.0021307343,0.00034932385,0.00022853726,0.0002739942,0.00011514411,0.000026125397,0.0014218322,0.049742967,0.22702117,0.71048963,0.0076269316,0.0005736098],"about_ca_topic_score_codex":0.000006804127,"about_ca_topic_score_gemma":0.0000025227187,"teacher_disagreement_score":0.98752534,"about_ca_system_score_codex":0.000024198564,"about_ca_system_score_gemma":0.00008565378,"threshold_uncertainty_score":0.46960473},"labels":[],"label_agreement":null},{"id":"W4412748092","doi":"10.1109/tit.2025.3594183","title":"Capacity Bounds for Broadcast Channels With Bidirectional Conferencing Decoders","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","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":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; Computer network; Decoding methods; Channel capacity; Telecommunications; Channel (broadcasting)","score_opus":0.026686109752182153,"score_gpt":0.25748268746460945,"score_spread":0.2307965777124273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412748092","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.0013257064,0.000018873927,0.98949564,0.00070317887,0.0007075888,0.0003019641,0.000010885394,0.00020181392,0.007234356],"genre_scores_gemma":[0.98872507,0.000057896665,0.009001154,0.001299722,0.000013627191,0.00019225314,0.000005723748,0.0000040356026,0.00070051616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925256,0.00008675231,0.00024739662,0.0001236216,0.00013010552,0.00015956866],"domain_scores_gemma":[0.99892193,0.00031022693,0.000079941055,0.00034451546,0.000298147,0.000045216348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043210236,0.00012268519,0.00011227063,0.00032100218,0.0006894716,0.0002521681,0.00035139013,0.00005382498,0.00003312417],"category_scores_gemma":[0.000013005909,0.0001104086,0.000063355816,0.00047476962,0.00006841644,0.0013543277,0.0000033022375,0.00016902348,0.000024710596],"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.00014248007,0.000072883115,0.0000050208355,0.000035875724,0.000102347396,7.329534e-8,0.0032992545,0.045370866,0.00011003559,0.48893285,0.00059276016,0.46133554],"study_design_scores_gemma":[0.0036232313,0.00042714502,0.00022973976,0.00036991455,0.00006284289,0.000024564544,0.0009840454,0.8156387,0.060070314,0.025895108,0.09187543,0.0007989417],"about_ca_topic_score_codex":0.0000035565556,"about_ca_topic_score_gemma":0.00001801176,"teacher_disagreement_score":0.98739934,"about_ca_system_score_codex":0.00010699338,"about_ca_system_score_gemma":0.0001590946,"threshold_uncertainty_score":0.53029275},"labels":[],"label_agreement":null},{"id":"W4413157759","doi":"10.1109/tit.2025.3598722","title":"An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Neural Networks and Applications","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Langevin dynamics; Generalization; Computer science; Stochastic process; Statistical physics; Dynamics (music); Information theory; Stochastic dynamics; Applied mathematics; Mathematics; Statistics; Physics; Mathematical analysis","score_opus":0.006928188622609437,"score_gpt":0.2539832216293135,"score_spread":0.2470550330067041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413157759","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.0002833491,0.0000037656746,0.9964394,0.00068023644,0.00035441032,0.0014362402,0.00033979604,0.00019392556,0.00026887283],"genre_scores_gemma":[0.924735,0.000008093608,0.07153758,0.0011950304,0.000030849413,0.0019986497,0.00044113392,0.0000080274785,0.000045624758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989694,0.000044511733,0.00045799848,0.00014869253,0.00018838521,0.00019104006],"domain_scores_gemma":[0.9985384,0.00023062956,0.00019374637,0.00057844265,0.0003656663,0.00009314709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026502117,0.0001545721,0.00014314298,0.00028487502,0.0003517867,0.00016142167,0.00045578688,0.00009160419,0.0000073668907],"category_scores_gemma":[0.000012933619,0.00014107286,0.000062771505,0.00087769545,0.000059836413,0.0015948196,0.0000035778612,0.00012848648,0.00003657187],"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.00004456555,0.000051151,5.509691e-7,0.00003218404,0.000013876452,7.611943e-9,0.00045683622,0.23352404,0.0000061376913,0.7111756,0.00011164761,0.054583356],"study_design_scores_gemma":[0.00066651177,0.00042355843,0.000059565828,0.00015002488,0.000082427025,0.0000025983395,0.00062395755,0.78251076,0.002383922,0.205006,0.007694484,0.00039617327],"about_ca_topic_score_codex":0.000003738541,"about_ca_topic_score_gemma":0.000010734681,"teacher_disagreement_score":0.92490184,"about_ca_system_score_codex":0.00013397602,"about_ca_system_score_gemma":0.000092571165,"threshold_uncertainty_score":0.57527846},"labels":[],"label_agreement":null},{"id":"W4413755039","doi":"10.1109/tit.2025.3603494","title":"Multivariate Analytic Combinatorics for Cost Constrained Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","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","funders":"H2020 European Research Council; National Science Foundation","keywords":"Multivariate statistics; Mathematics; Combinatorics; Computer science; Discrete mathematics; Statistics","score_opus":0.011770013073238618,"score_gpt":0.2595444928571003,"score_spread":0.2477744797838617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755039","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.00054517126,0.00001705346,0.9875812,0.00012381648,0.0006932393,0.000726891,0.000104879204,0.0009338853,0.009273881],"genre_scores_gemma":[0.9975133,0.00005418606,0.0014276676,0.00024718553,0.000006042958,0.0005028419,0.000029601657,0.000012589919,0.00020659805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.000040809267,0.0003739031,0.00006486668,0.00009350762,0.00015868485],"domain_scores_gemma":[0.99903595,0.0003708324,0.00005096984,0.00035478908,0.00014622374,0.00004122216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035421268,0.00014040458,0.00015530038,0.00043292707,0.00017488257,0.000070232476,0.0002243144,0.000120278935,0.000043459328],"category_scores_gemma":[0.000019013476,0.0001562382,0.00009162978,0.00035981307,0.00005930444,0.0005823715,0.0000012108602,0.00021209985,0.000039139068],"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.0001362271,0.00013453541,0.0000011291673,0.00037540417,0.000282673,1.6539259e-7,0.0023552394,0.23094535,0.00054565066,0.628705,0.002090676,0.13442792],"study_design_scores_gemma":[0.002316968,0.00007906363,0.000020390029,0.00019526042,0.00010093118,0.0000030183328,0.0008747847,0.7517165,0.13476883,0.07346572,0.035963275,0.00049528957],"about_ca_topic_score_codex":0.000003347096,"about_ca_topic_score_gemma":0.0000014478228,"teacher_disagreement_score":0.9969681,"about_ca_system_score_codex":0.00014319611,"about_ca_system_score_gemma":0.00003448562,"threshold_uncertainty_score":0.63712084},"labels":[],"label_agreement":null},{"id":"W4414166011","doi":"10.1109/tit.2025.3607695","title":"Jensen-Generalized Discrete Fisher Information, Its Generating Function, and Applications to Image Processing and Contaminated Models","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Statistical Methods and Models","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Fisher information; Measure (data warehouse); Fisher kernel; Information theory; Image processing; Property (philosophy); Pattern recognition (psychology); Similarity measure; Similarity (geometry)","score_opus":0.029963482254563918,"score_gpt":0.33429182469786867,"score_spread":0.30432834244330476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414166011","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.0013513266,0.000030001938,0.993944,0.00023607908,0.000099932906,0.00089786126,0.00013978891,0.00016695083,0.003134097],"genre_scores_gemma":[0.533115,0.00006800649,0.46095836,0.003377664,0.00003371,0.0012309207,0.000045591023,0.000026560043,0.001144179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876684,0.00010386149,0.0006156096,0.00015064546,0.00016350769,0.0001995451],"domain_scores_gemma":[0.9987623,0.0003969467,0.00015269761,0.00019177167,0.00038070764,0.000115587834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000499449,0.00020028595,0.00022421172,0.0003038568,0.0005643459,0.0002142238,0.00007470206,0.00009917107,0.000031506203],"category_scores_gemma":[0.00010175044,0.00018428221,0.000035572237,0.00032702403,0.00007306585,0.0027479217,0.0000050818994,0.00018506694,0.0000130857],"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.0002015746,0.00003279046,4.539683e-7,0.00038082842,0.00004929739,9.671326e-8,0.0018952275,0.0122899655,0.00065091974,0.6148467,0.00023581464,0.36941633],"study_design_scores_gemma":[0.0013850993,0.000083631705,0.00001771905,0.00014442754,0.00015364769,0.0000059843237,0.0014449687,0.24765868,0.0034447417,0.7418791,0.003405854,0.00037610604],"about_ca_topic_score_codex":0.0000036489987,"about_ca_topic_score_gemma":0.00000352051,"teacher_disagreement_score":0.5329856,"about_ca_system_score_codex":0.00004971185,"about_ca_system_score_gemma":0.00005136209,"threshold_uncertainty_score":0.751481},"labels":[],"label_agreement":null},{"id":"W4415368361","doi":"10.1109/tit.2025.3623202","title":"A Combinatorial Perspective on Random Access Efficiency for DNA Storage","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Technion-Israel Institute of Technology; Università degli Studi di Trento; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Technische Universität München; Technische Universiteit Eindhoven; The Research Council; University College Dublin; Nanyang Technological University; European Commission; California Institute of Technology; University of Toronto; Division of Mathematical Sciences; Villum Fonden; National Science Foundation","keywords":"Generator matrix; Intersection (aeronautics); Random access; Generator (circuit theory); Matrix (chemical analysis); Construct (python library); Perspective (graphical); Code (set theory); Decoding methods","score_opus":0.008284200055821738,"score_gpt":0.2803560336089018,"score_spread":0.27207183355308007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368361","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.0770505,0.000020057785,0.9077438,0.00012497918,0.0012726531,0.00045339836,0.000042640557,0.000038446447,0.013253536],"genre_scores_gemma":[0.998619,0.000011921808,0.00004751802,0.0009157856,0.00006147842,0.000075339616,0.000022751181,0.0000038489443,0.00024234672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993792,0.00007126666,0.0001935187,0.00013901744,0.00007559198,0.00014141518],"domain_scores_gemma":[0.999486,0.00012725279,0.000063841944,0.00015507496,0.00013795849,0.000029841998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032463195,0.00011362316,0.000105668674,0.0001058629,0.00025199592,0.00006031547,0.00018594183,0.00012441303,0.000017754504],"category_scores_gemma":[0.00006581227,0.00009182805,0.00012967136,0.0001278082,0.00005545737,0.000020141677,0.0000030274155,0.000102365884,0.000012706329],"study_design_candidate":"bench_or_experimental","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.034732886,0.0019054202,0.0000160346,0.00025775563,0.0007386239,0.0000011683076,0.0021850776,0.08892106,0.05419199,0.6173951,0.004838563,0.19481629],"study_design_scores_gemma":[0.015737565,0.0031757925,0.0001590862,0.00013423189,0.00012243648,0.0000036301828,0.002292805,0.005534505,0.88482827,0.050155353,0.037097394,0.00075893104],"about_ca_topic_score_codex":0.0000022739562,"about_ca_topic_score_gemma":7.7567046e-7,"teacher_disagreement_score":0.9215685,"about_ca_system_score_codex":0.00004635668,"about_ca_system_score_gemma":0.000056831268,"threshold_uncertainty_score":0.37446392},"labels":[],"label_agreement":null},{"id":"W7117242493","doi":"10.1109/tit.2025.3648620","title":"On Minimax Empirical Bayes Predictive Densities","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Bayesian Methods and Mixture Models","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":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimax; Bayes' theorem; Bayesian probability; Probability density function; Density estimation; Simple (philosophy); Point estimation","score_opus":0.012692391255983067,"score_gpt":0.28108394665545344,"score_spread":0.26839155539947035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117242493","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.000623807,0.00008088699,0.9495108,0.0015239223,0.004623234,0.00061344734,0.00013827629,0.0002672209,0.04261841],"genre_scores_gemma":[0.9430382,0.00016711983,0.03770652,0.012892614,0.000079049394,0.00016232113,0.000006644678,0.00002047206,0.0059270374],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660456,0.00083950325,0.0009897748,0.0004549215,0.00058048544,0.00053072924],"domain_scores_gemma":[0.9967232,0.0015037088,0.00026164987,0.00095528824,0.00036110406,0.00019509258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014308046,0.0004976333,0.00045301244,0.0011182092,0.00087042875,0.0005307237,0.00073262095,0.00042516334,0.00028763502],"category_scores_gemma":[0.00006394758,0.00046982066,0.0003734863,0.0010220775,0.00033183736,0.0027155706,0.000008881575,0.0009185994,0.00048105107],"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.0008816746,0.0002699605,6.705343e-7,0.00011853969,0.00022457521,0.000003967252,0.010987744,0.009420991,0.0000126361465,0.34560007,0.0041762185,0.62830293],"study_design_scores_gemma":[0.0021107704,0.0014067902,0.00011135487,0.00084801664,0.00028208594,0.00004200175,0.0012973452,0.46378908,0.018465953,0.5042753,0.0064449217,0.00092637754],"about_ca_topic_score_codex":0.000006249867,"about_ca_topic_score_gemma":0.000002330127,"teacher_disagreement_score":0.9424144,"about_ca_system_score_codex":0.00028179938,"about_ca_system_score_gemma":0.0005412409,"threshold_uncertainty_score":0.99977535},"labels":[],"label_agreement":null}]}