{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14208739,0.0005584906,0.83769965,0.0003466077,0.00030342545,0.00012719491,0.00020248129,0.00031072056,0.018363958],"genre_scores_gemma":[0.67086804,0.00066846627,0.31820023,0.00023273853,0.00011705802,0.00020215052,0.00040140198,0.00007327686,0.009236592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955875,0.00006521618,0.00003362985,0.00006166523,0.00021629476,0.000064464315],"domain_scores_gemma":[0.9992405,0.00015430216,0.00014093576,0.00016306948,0.00019225039,0.00010899805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033652052,0.00027207678,0.00036814436,0.00072244037,0.0004414439,0.00066264404,0.0004606417,0.00042719874,0.00095233874],"category_scores_gemma":[0.0011633087,0.00021091424,0.00039795748,0.00048735697,0.0008633902,0.0006999156,0.0010620503,0.000893126,0.0002775558],"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.00006299392,0.00004914944,0.0005244182,0.00008807779,0.000017402826,0.00019519082,0.00018941381,0.036591467,0.025735151,0.8851129,0.0015725008,0.049861316],"study_design_scores_gemma":[0.0001074981,0.00037940903,0.0005677505,0.00007113339,0.000039646897,0.0010293716,0.0001269548,0.4416833,0.08155795,0.4262997,0.048014313,0.00012296317],"about_ca_topic_score_codex":0.0003379572,"about_ca_topic_score_gemma":0.00030470596,"teacher_disagreement_score":0.00095233874,"about_ca_system_score_codex":0.00047419345,"about_ca_system_score_gemma":0.00083291996,"threshold_uncertainty_score":0.003440559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03448241,0.00038618298,0.96093917,0.0003958602,0.000020029032,0.00003516368,0.00016361312,0.00011943544,0.0034581337],"genre_scores_gemma":[0.89784724,0.0006304472,0.09680197,0.00018541582,0.00007427657,0.00016410097,0.0002656757,0.000082553255,0.003948446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832207,0.0006272122,0.00007532582,0.00024459156,0.0005951172,0.0001356078],"domain_scores_gemma":[0.9961331,0.0028731874,0.00036036677,0.00036601655,0.00020176895,0.00006556541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018300017,0.0008743673,0.0011559178,0.00046803177,0.0002508505,0.0012507096,0.001438301,0.0008836068,0.001044801],"category_scores_gemma":[0.0071912273,0.00034618084,0.00045385948,0.00093124463,0.0015541051,0.00227329,0.0020450612,0.0016081799,0.00027606206],"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.00019675006,0.000038278242,0.00024655124,0.00016058778,0.00003807109,0.0002620835,0.00014164999,0.68936676,0.007054511,0.28214276,0.00075161044,0.019600304],"study_design_scores_gemma":[0.000040511204,0.000052833395,0.00012933774,0.000027127759,0.0000132091545,0.00008353651,0.000017058253,0.8658685,0.004368825,0.12859593,0.00078450196,0.000018613084],"about_ca_topic_score_codex":0.0008342893,"about_ca_topic_score_gemma":0.0004569148,"teacher_disagreement_score":0.0018300017,"about_ca_system_score_codex":0.0011682871,"about_ca_system_score_gemma":0.0007740134,"threshold_uncertainty_score":0.009678066},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076371476,0.0015694713,0.8936607,0.0028886078,0.00012442109,0.0001008933,0.0001774076,0.0005243511,0.024582757],"genre_scores_gemma":[0.8931467,0.0014213985,0.10097082,0.00045496484,0.0002582789,0.00023625672,0.00013391461,0.00023739958,0.0031402844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911889,0.0038282324,0.00026854954,0.0010158642,0.00249302,0.0012053744],"domain_scores_gemma":[0.90514314,0.071370214,0.004398148,0.015058112,0.0031113434,0.00091895723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010809088,0.0016162982,0.0016777848,0.0021231822,0.0015957139,0.0034007195,0.0033012345,0.002277905,0.003353549],"category_scores_gemma":[0.09798345,0.0010266727,0.0009186306,0.0021274094,0.0057353564,0.010360453,0.0058329445,0.0049513956,0.00068437745],"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.00033189956,0.00014070341,0.0023375503,0.00023986283,0.00008411244,0.00028097306,0.0004279491,0.17008226,0.009274965,0.7692624,0.0020436675,0.045493707],"study_design_scores_gemma":[0.00004400803,0.0002154026,0.0006614,0.00012498902,0.000050913684,0.0008434028,0.00016188176,0.5181885,0.01306953,0.46429694,0.002280428,0.00006267025],"about_ca_topic_score_codex":0.00070574577,"about_ca_topic_score_gemma":0.00060676644,"teacher_disagreement_score":0.010809088,"about_ca_system_score_codex":0.0036863275,"about_ca_system_score_gemma":0.0018731743,"threshold_uncertainty_score":0.05716461},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5630868,0.0028783884,0.42323625,0.0012268048,0.00015393237,0.00013487307,0.00029709167,0.00052264007,0.008463241],"genre_scores_gemma":[0.97892725,0.00073531433,0.01807074,0.00008538289,0.000107944674,0.000082223814,0.00009290171,0.000054469598,0.0018436611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927515,0.00025630108,0.000020363628,0.00006993676,0.00020633431,0.00017197953],"domain_scores_gemma":[0.9939448,0.004237307,0.0007116312,0.00031027122,0.0005904896,0.00020547515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013215082,0.0006461839,0.0006049578,0.000790419,0.0007223523,0.0008228755,0.0007519166,0.0011873172,0.001635641],"category_scores_gemma":[0.0076925415,0.00028811433,0.00038191164,0.00072482816,0.0011915609,0.0016055737,0.0010087976,0.0012725445,0.00018315305],"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.00031929134,0.00012255112,0.0012039982,0.00027634593,0.000039728136,0.0003050949,0.00039615203,0.6856282,0.02107612,0.2725831,0.0017685724,0.016280964],"study_design_scores_gemma":[0.000015534728,0.00004419511,0.00017477371,0.000010425625,0.000005606809,0.00004519426,0.000022277312,0.9736534,0.0012447628,0.024437329,0.00033662692,0.000009977445],"about_ca_topic_score_codex":0.0023441936,"about_ca_topic_score_gemma":0.0012649226,"teacher_disagreement_score":0.0023441936,"about_ca_system_score_codex":0.0013394272,"about_ca_system_score_gemma":0.00080441736,"threshold_uncertainty_score":0.009718239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06701194,0.0007203,0.91349757,0.0013149941,0.00010997298,0.00005097701,0.0002039946,0.00019248782,0.016897721],"genre_scores_gemma":[0.8393968,0.0014460168,0.14780292,0.0010268268,0.00043850753,0.00031996818,0.00034967222,0.00020831768,0.0090110125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758506,0.0008391831,0.00015215184,0.0004985509,0.0006259395,0.00029919168],"domain_scores_gemma":[0.982192,0.013438453,0.0013470569,0.0009922585,0.0014416598,0.0005885195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032698293,0.0005743149,0.0008942624,0.0017840721,0.0012532318,0.0021386722,0.00097521103,0.0012470523,0.0041879313],"category_scores_gemma":[0.01592191,0.00042060085,0.0011748854,0.0016239724,0.004340125,0.00750788,0.0026327707,0.0026359027,0.0007646763],"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.00001758323,0.0000066269404,0.00014204267,0.000025626134,0.000005742976,0.00007636379,0.00011699744,0.0048393956,0.0007221913,0.99063104,0.00031167705,0.003104649],"study_design_scores_gemma":[0.000011745017,0.00003854835,0.00012587226,0.000023886689,0.000006697523,0.00016034111,0.00006828868,0.050304193,0.0012402189,0.94542027,0.0025756648,0.000024262039],"about_ca_topic_score_codex":0.00078097306,"about_ca_topic_score_gemma":0.0004723483,"teacher_disagreement_score":0.0041879313,"about_ca_system_score_codex":0.0014249309,"about_ca_system_score_gemma":0.0009459583,"threshold_uncertainty_score":0.017292738},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7904018,0.0018465503,0.12973988,0.001871923,0.00018509376,0.00006894203,0.00060223765,0.00022298822,0.07506056],"genre_scores_gemma":[0.977409,0.000490098,0.012911379,0.00010800981,0.0003494975,0.000048199272,0.00020099376,0.000054477623,0.008428338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954957,0.00010020442,0.00002051931,0.00007564519,0.00014131007,0.00011272273],"domain_scores_gemma":[0.99622834,0.0020105229,0.0006657187,0.00024349133,0.00050152844,0.00035038582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140443,0.00050590216,0.00037873068,0.0017800252,0.00073015015,0.001253833,0.0006051934,0.000569512,0.0054902844],"category_scores_gemma":[0.0050173257,0.00021904467,0.00026494774,0.0009799616,0.0020401457,0.0023190703,0.0010039045,0.0011820833,0.0009183423],"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.0001301258,0.00004843425,0.0029182823,0.00008767667,0.000010990529,0.00019348202,0.00051037595,0.004737598,0.007760896,0.95662254,0.0034869334,0.023492556],"study_design_scores_gemma":[0.000034563443,0.00021794037,0.0032684463,0.00007012136,0.000029383731,0.0010230995,0.00029608276,0.07789438,0.010235357,0.8977209,0.009131383,0.000078375],"about_ca_topic_score_codex":0.00039649828,"about_ca_topic_score_gemma":0.0004602811,"teacher_disagreement_score":0.0054902844,"about_ca_system_score_codex":0.000884161,"about_ca_system_score_gemma":0.00042811292,"threshold_uncertainty_score":0.018366814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011213014,0.0005541691,0.9747362,0.00047904122,0.00011802948,0.00006202557,0.00016481764,0.00015797163,0.0125147905],"genre_scores_gemma":[0.65061015,0.0031581693,0.33389133,0.0013854427,0.00072142034,0.00079163985,0.00068416435,0.00027723733,0.00848043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755317,0.00067625416,0.00011464684,0.00025628187,0.0011800461,0.00021967808],"domain_scores_gemma":[0.98326945,0.011882761,0.0011625728,0.0015170502,0.001843223,0.00032497916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048568756,0.0015418828,0.0007562826,0.0024167039,0.0008966659,0.002563609,0.0017781494,0.001420627,0.003779027],"category_scores_gemma":[0.021505969,0.00060851773,0.0011180755,0.0010263289,0.00388587,0.0046539125,0.0027050069,0.004110575,0.0010385925],"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.000035417834,0.00002522908,0.00018630481,0.00010240342,0.000018729968,0.00009343093,0.000112946465,0.039797872,0.0026675244,0.9439985,0.0015700443,0.01139166],"study_design_scores_gemma":[0.000021229103,0.000073146766,0.0001512751,0.0000692125,0.000014324466,0.00025968518,0.00003854718,0.3113366,0.005355535,0.6800211,0.0026076545,0.000051616666],"about_ca_topic_score_codex":0.00043505456,"about_ca_topic_score_gemma":0.00046989857,"teacher_disagreement_score":0.0048568756,"about_ca_system_score_codex":0.0021172643,"about_ca_system_score_gemma":0.0017826231,"threshold_uncertainty_score":0.025685906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07732542,0.0006165877,0.87385976,0.00037173915,0.00018477497,0.00012408529,0.00019214253,0.00047743932,0.04684804],"genre_scores_gemma":[0.78563803,0.00079105666,0.19225465,0.00038069795,0.00013126491,0.0002270727,0.0002824777,0.00019601361,0.020098595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944013,0.00014635341,0.000031285745,0.00006500788,0.00024270495,0.00007445958],"domain_scores_gemma":[0.99902284,0.00030731005,0.00009690619,0.00020829959,0.0003070508,0.000057590503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052414375,0.00039584376,0.0005028867,0.0007341516,0.00094468385,0.0009300613,0.00081914914,0.0011148168,0.00482996],"category_scores_gemma":[0.0019297741,0.00027297944,0.00061225926,0.0006432848,0.001418895,0.0013122795,0.0008352857,0.000748274,0.0011694813],"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.000035136974,0.000021782804,0.00028488395,0.00005898562,0.000012145272,0.00011250387,0.00008361478,0.07463139,0.0031146237,0.9108036,0.0012323153,0.0096090445],"study_design_scores_gemma":[0.000026884052,0.00007826044,0.00023799545,0.0000410412,0.000017281338,0.00036667706,0.00004189651,0.7039805,0.0070163556,0.27707517,0.011072088,0.000045795336],"about_ca_topic_score_codex":0.0011771506,"about_ca_topic_score_gemma":0.000907752,"teacher_disagreement_score":0.00482996,"about_ca_system_score_codex":0.0008947389,"about_ca_system_score_gemma":0.0010591636,"threshold_uncertainty_score":0.016157866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11408917,0.0020766917,0.83932394,0.002546081,0.00019614235,0.00019145552,0.00035598312,0.00071588083,0.04050457],"genre_scores_gemma":[0.93132883,0.0015568754,0.055135384,0.00062095595,0.00029876217,0.0003765272,0.00030125762,0.0003596485,0.010021707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994795,0.001491259,0.00017995002,0.0008607192,0.0017132699,0.0009598812],"domain_scores_gemma":[0.9522119,0.03770897,0.0017917466,0.004878324,0.0020645428,0.0013443797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007514944,0.0017638543,0.0016704814,0.0023560098,0.0017100965,0.0029364927,0.0032069965,0.0019565187,0.005944255],"category_scores_gemma":[0.04253705,0.0010000397,0.0014465593,0.0016579058,0.008878041,0.012008957,0.00768199,0.0065805386,0.0009642555],"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.00029812116,0.00007965944,0.00042917978,0.00018253365,0.000046756453,0.000121858546,0.00025919298,0.074773625,0.0054342453,0.9070401,0.0012637788,0.010070992],"study_design_scores_gemma":[0.00003937122,0.000121129844,0.00053744507,0.00006228151,0.00003657433,0.00008910685,0.000066613,0.35744113,0.0053283563,0.63493574,0.0012789038,0.00006338248],"about_ca_topic_score_codex":0.0010045312,"about_ca_topic_score_gemma":0.0007160048,"teacher_disagreement_score":0.007514944,"about_ca_system_score_codex":0.004898609,"about_ca_system_score_gemma":0.0023131268,"threshold_uncertainty_score":0.039743245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009779149,0.000099157485,0.997677,0.000045572153,0.00001015693,0.000009090056,0.000014573752,0.000034086228,0.001132415],"genre_scores_gemma":[0.17228398,0.0012338593,0.8209911,0.00020140222,0.0001389843,0.00014713865,0.0001149003,0.000088186884,0.0048005334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919087,0.00033002283,0.00003632393,0.000089026114,0.00028953957,0.00006417155],"domain_scores_gemma":[0.9991085,0.00046573157,0.0000660272,0.00013098521,0.00019656814,0.000032222266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012649298,0.0008478719,0.00081964344,0.00063791004,0.00039984955,0.0013408886,0.0009738096,0.0012122806,0.0024021924],"category_scores_gemma":[0.0032718747,0.00032740165,0.0005652121,0.0009856528,0.0010518709,0.0016708784,0.0009927267,0.0013590435,0.0008617144],"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.00007533263,0.0000388481,0.00031227755,0.0001204176,0.000029906612,0.00013514908,0.00013521792,0.39258987,0.0059473957,0.5216677,0.0017577116,0.07719012],"study_design_scores_gemma":[0.000012032972,0.00006040028,0.000039292274,0.000018867746,0.000007934256,0.000082400475,0.000017261886,0.90661037,0.0020728887,0.08804725,0.0030170653,0.000014174941],"about_ca_topic_score_codex":0.0015482154,"about_ca_topic_score_gemma":0.001988904,"teacher_disagreement_score":0.0024021924,"about_ca_system_score_codex":0.00082417653,"about_ca_system_score_gemma":0.0016181306,"threshold_uncertainty_score":0.008036137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4449348,0.0012225916,0.53222114,0.00076638325,0.000087741886,0.00007073972,0.000083964966,0.00033167232,0.020281043],"genre_scores_gemma":[0.9920203,0.00021308362,0.0069499197,0.000051636605,0.000033631935,0.00002877806,0.000016078957,0.000015498621,0.00067114225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986553,0.0004761033,0.000037940474,0.00012018197,0.00039765923,0.00031272104],"domain_scores_gemma":[0.98769695,0.010187771,0.00071548927,0.00040606747,0.00076423655,0.00022937803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031304192,0.00065597106,0.0006608328,0.00069167034,0.0006142298,0.0010682325,0.0008057779,0.00055413437,0.0010781095],"category_scores_gemma":[0.020267611,0.0004314094,0.00038559904,0.0006889277,0.0015565687,0.0019705137,0.0013832116,0.000748259,0.00013243099],"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.00021127958,0.00009495492,0.0017884398,0.00009815634,0.00004839303,0.00021666483,0.00020612602,0.8809813,0.004999316,0.09553681,0.0006568485,0.015161691],"study_design_scores_gemma":[0.000015827703,0.000085942236,0.0004896388,0.000009941973,0.000016280586,0.00009164379,0.0000960252,0.955666,0.0010424352,0.042275414,0.00020049112,0.0000103782],"about_ca_topic_score_codex":0.0024302446,"about_ca_topic_score_gemma":0.0018633194,"teacher_disagreement_score":0.0031304192,"about_ca_system_score_codex":0.0014195186,"about_ca_system_score_gemma":0.0013799518,"threshold_uncertainty_score":0.016555429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14577435,0.0007758637,0.7565082,0.003440198,0.00026843286,0.0004619493,0.00043299136,0.0015999171,0.09073821],"genre_scores_gemma":[0.8885738,0.0005935974,0.08232694,0.0013720818,0.00039451415,0.000995021,0.00039985718,0.0005485179,0.024795655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926448,0.0018394206,0.0003020438,0.0017094272,0.0021629834,0.0013412881],"domain_scores_gemma":[0.9724873,0.019987408,0.0018181406,0.0034371112,0.0012025671,0.0010675909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005693841,0.0017869729,0.0023817068,0.0021938977,0.0025119316,0.004342553,0.0040592547,0.003146126,0.008106756],"category_scores_gemma":[0.026914116,0.0010514836,0.00396635,0.0014477182,0.0048475508,0.008724728,0.0074014827,0.0068137115,0.0018077131],"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.00019023952,0.00016221151,0.0005476252,0.000113129296,0.000062606494,0.00025176455,0.00035869214,0.022276742,0.0026871809,0.95823264,0.0032264504,0.011890708],"study_design_scores_gemma":[0.000062239254,0.00006633396,0.00015696163,0.000025371659,0.000030398847,0.00016689845,0.00004140382,0.1382262,0.0015989305,0.85770684,0.0018764414,0.00004194748],"about_ca_topic_score_codex":0.0015738372,"about_ca_topic_score_gemma":0.0014614112,"teacher_disagreement_score":0.008106756,"about_ca_system_score_codex":0.0041670077,"about_ca_system_score_gemma":0.0030317975,"threshold_uncertainty_score":0.03023386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069820695,0.00041646574,0.9222835,0.00095464516,0.000041909716,0.00006263704,0.00020593028,0.000095898715,0.006118356],"genre_scores_gemma":[0.9107176,0.0010021776,0.0837957,0.00015860233,0.00011157694,0.00016530359,0.00028064166,0.00007267578,0.003695673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981926,0.0008715523,0.0000762274,0.00028074728,0.00033565273,0.00024316655],"domain_scores_gemma":[0.9862302,0.011639907,0.000915117,0.0005241368,0.0004658192,0.00022478419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027245525,0.0008579109,0.00102039,0.00078613707,0.00056293147,0.0012124284,0.0011808522,0.0012478788,0.0024872452],"category_scores_gemma":[0.012894331,0.00052797515,0.0005539799,0.0011865739,0.0024000576,0.003105515,0.0020259088,0.0016813193,0.00023371051],"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.00014499866,0.000054198477,0.00035632218,0.00010789534,0.000027148606,0.00012714065,0.00013644753,0.44545764,0.0019346353,0.5360687,0.00073714036,0.01484775],"study_design_scores_gemma":[0.00003371364,0.000047136626,0.00014388155,0.000025968437,0.000012414507,0.00004261369,0.000033914675,0.7325662,0.001201571,0.2654591,0.00041180066,0.000021753425],"about_ca_topic_score_codex":0.0016809136,"about_ca_topic_score_gemma":0.0016716794,"teacher_disagreement_score":0.0027245525,"about_ca_system_score_codex":0.0021643105,"about_ca_system_score_gemma":0.0023085987,"threshold_uncertainty_score":0.015703201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20470352,0.0005810928,0.77853984,0.0004925983,0.00004253103,0.00008505342,0.00040834208,0.0006399224,0.014507128],"genre_scores_gemma":[0.8587467,0.00036591155,0.13573526,0.000105424035,0.000026348822,0.00005015324,0.00018374587,0.00006726418,0.004719232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962246,0.000056614826,0.000029426168,0.000065933535,0.00014676845,0.00007876241],"domain_scores_gemma":[0.99899834,0.00043537552,0.0001375606,0.00020472107,0.00016847302,0.00005551731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049367064,0.0003576509,0.00033361636,0.00034850492,0.0004603458,0.0006427461,0.0008889942,0.0005750478,0.0014323716],"category_scores_gemma":[0.0038390374,0.00024930382,0.00025030103,0.00040342694,0.0010925214,0.0015833488,0.00080618885,0.000835575,0.00027582634],"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.00018373657,0.000039807772,0.0005155703,0.000118776974,0.000011119021,0.00012955436,0.00013697325,0.056124303,0.019912891,0.8879932,0.0013672437,0.03346688],"study_design_scores_gemma":[0.000083620485,0.0001225678,0.0005185337,0.000045688383,0.00003282655,0.0002658978,0.000042338183,0.44870013,0.0509369,0.49288553,0.00630261,0.00006344529],"about_ca_topic_score_codex":0.0022367886,"about_ca_topic_score_gemma":0.0038211786,"teacher_disagreement_score":0.0022367886,"about_ca_system_score_codex":0.0011964462,"about_ca_system_score_gemma":0.0012454916,"threshold_uncertainty_score":0.00868082},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30285677,0.0008279088,0.69081855,0.00037843167,0.00007297283,0.00007615289,0.00012051178,0.00013974572,0.004709034],"genre_scores_gemma":[0.9801595,0.0003202071,0.01704144,0.00004373872,0.000063270505,0.00006639532,0.00003807784,0.000011571275,0.0022558202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.00034399758,0.000028393226,0.00017442809,0.00015983662,0.00012708746],"domain_scores_gemma":[0.9979038,0.0011871909,0.00042003635,0.00018582249,0.00020758942,0.000095507385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008238782,0.00050330535,0.000899228,0.00035673077,0.0005295375,0.000676252,0.001089055,0.0008114255,0.0007886242],"category_scores_gemma":[0.0028045573,0.00041178058,0.00034255593,0.0005534975,0.0010005364,0.0014982297,0.0008811963,0.00069814554,0.00016972944],"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.0003427935,0.0000712532,0.0020455546,0.00013794101,0.000065209315,0.0005503629,0.00018911638,0.90078086,0.010206691,0.070437185,0.0007972339,0.014375865],"study_design_scores_gemma":[0.000026558033,0.00007029689,0.00032431073,0.000004058495,0.000012641252,0.0000739281,0.000037354446,0.9882492,0.00046142208,0.010263343,0.00046777548,0.00000911576],"about_ca_topic_score_codex":0.0015286475,"about_ca_topic_score_gemma":0.0012513824,"teacher_disagreement_score":0.0015286475,"about_ca_system_score_codex":0.0006588924,"about_ca_system_score_gemma":0.00050919293,"threshold_uncertainty_score":0.00478065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33141306,0.0026190542,0.50169235,0.017001612,0.00090354105,0.0006717582,0.0021463938,0.0018158666,0.14173633],"genre_scores_gemma":[0.896241,0.0010651263,0.08562898,0.0011549867,0.00053278584,0.00088032987,0.0009184633,0.00036107487,0.013217215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643826,0.0012318111,0.00018188005,0.0005736826,0.0009222839,0.00065217295],"domain_scores_gemma":[0.97063464,0.020967424,0.0020658907,0.0034445717,0.0021339392,0.0007535538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043543084,0.000679966,0.00071056816,0.0013092657,0.0013668181,0.0024696435,0.0016352128,0.0012991311,0.0068024527],"category_scores_gemma":[0.030079754,0.00043403142,0.00061688543,0.0011484546,0.002728564,0.007444623,0.003552352,0.0023952788,0.0010018913],"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.00068716845,0.00012716922,0.0019656506,0.00023335702,0.000042167954,0.00024021183,0.00062310306,0.053051747,0.009821376,0.863338,0.011764372,0.05810558],"study_design_scores_gemma":[0.00021039374,0.00020870926,0.0005790904,0.0001954927,0.000045476852,0.0004677756,0.0003071465,0.14745067,0.01507634,0.8206603,0.014743038,0.000055602348],"about_ca_topic_score_codex":0.0014030922,"about_ca_topic_score_gemma":0.0012890097,"teacher_disagreement_score":0.0068024527,"about_ca_system_score_codex":0.0030356233,"about_ca_system_score_gemma":0.0022605322,"threshold_uncertainty_score":0.023028076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021794276,0.00037974343,0.943897,0.002193222,0.0001755801,0.00015521645,0.0008414943,0.0005381941,0.030025207],"genre_scores_gemma":[0.8386235,0.0018289787,0.09326006,0.0011446973,0.0006280906,0.0009646928,0.0012645114,0.00037414976,0.06191124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996029,0.0013663364,0.00019270553,0.00072460395,0.001040272,0.0006471611],"domain_scores_gemma":[0.990369,0.0053550913,0.0011133896,0.0015433859,0.0010321636,0.0005868228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002406383,0.0016100914,0.0011386658,0.0013186435,0.0012850607,0.0033889797,0.0032233817,0.0038249814,0.011724604],"category_scores_gemma":[0.009867679,0.0007241854,0.0013190698,0.0015042064,0.0038259171,0.0075875316,0.0037032482,0.00528583,0.0028607436],"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.000096445016,0.000042353306,0.0002055058,0.000066842986,0.000023280207,0.00026773117,0.00021059401,0.082122244,0.0011871649,0.9074328,0.004182863,0.004162118],"study_design_scores_gemma":[0.000051480292,0.00008113598,0.00009082415,0.000033395292,0.00002267708,0.00022213446,0.000069931506,0.5264471,0.0006999764,0.46299893,0.009246247,0.000036205096],"about_ca_topic_score_codex":0.0027302345,"about_ca_topic_score_gemma":0.0014993093,"teacher_disagreement_score":0.011724604,"about_ca_system_score_codex":0.002118623,"about_ca_system_score_gemma":0.0014747482,"threshold_uncertainty_score":0.039222658},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020646006,0.00631819,0.016757842,0.89682955,0.04208645,0.00011608579,0.001087377,0.0002777142,0.034462117],"genre_scores_gemma":[0.06387378,0.007284019,0.009659227,0.7997253,0.06717283,0.00032738346,0.0004631386,0.0003523065,0.05114206],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939653,0.0016927123,0.00054457085,0.00062472344,0.0026597262,0.00051293994],"domain_scores_gemma":[0.98303163,0.010457507,0.0008847359,0.00046706593,0.004900959,0.00025801972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061370707,0.0013679165,0.00088588387,0.0008533432,0.003060325,0.0022110245,0.0043108673,0.012177987,0.016443146],"category_scores_gemma":[0.023156395,0.00073795236,0.0011688097,0.0014393843,0.0040961034,0.0043952004,0.0016335517,0.015082435,0.0063574165],"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.00007054423,0.000015778736,0.00016085226,0.00017636604,0.000013686256,0.00031824945,0.00043131234,0.0008645577,0.00053066673,0.08866938,0.90100116,0.007747377],"study_design_scores_gemma":[0.000047812093,0.00007873565,0.0010390237,0.00033890517,0.000024328025,0.00029454,0.0003267471,0.0020286178,0.0018141706,0.08999746,0.9038908,0.00011891347],"about_ca_topic_score_codex":0.011991612,"about_ca_topic_score_gemma":0.008507534,"teacher_disagreement_score":0.016443146,"about_ca_system_score_codex":0.003566909,"about_ca_system_score_gemma":0.002546133,"threshold_uncertainty_score":0.055007756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4881057,0.0011531934,0.3818992,0.0048254235,0.00020549455,0.00021730294,0.0011588943,0.001409214,0.12102555],"genre_scores_gemma":[0.7964118,0.0008490712,0.18977931,0.0006654532,0.000107095744,0.00029316335,0.0010272395,0.0002382008,0.010628716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00020555251,0.000037702383,0.00013082557,0.00012001635,0.00016371517],"domain_scores_gemma":[0.9976706,0.0018016391,0.00014052847,0.00020319816,0.00011400144,0.00006997912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010428716,0.0010215202,0.00068967725,0.0019647288,0.0017837987,0.0015616518,0.00084872794,0.0014766263,0.013260978],"category_scores_gemma":[0.006579071,0.00049375015,0.0014306873,0.0013776296,0.0023522335,0.003281375,0.0022570223,0.002288018,0.0017993675],"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.00052616966,0.00014460631,0.0013451945,0.0004340991,0.000058419373,0.0006867519,0.00038987558,0.031620353,0.0074210917,0.8692203,0.009307202,0.07884578],"study_design_scores_gemma":[0.00017607064,0.0001902645,0.0008841133,0.00015622175,0.00009856804,0.0012600842,0.00031015248,0.07799722,0.014469551,0.88454145,0.01981248,0.00010388347],"about_ca_topic_score_codex":0.00063449785,"about_ca_topic_score_gemma":0.00066609925,"teacher_disagreement_score":0.013260978,"about_ca_system_score_codex":0.0013986776,"about_ca_system_score_gemma":0.0010203948,"threshold_uncertainty_score":0.044362426},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030737796,0.006352661,0.068782784,0.07734572,0.7715093,0.00039240706,0.0074000945,0.008946207,0.056197073],"genre_scores_gemma":[0.096239604,0.01648285,0.100599155,0.11913755,0.13773972,0.0013099941,0.019676477,0.010670323,0.49814427],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937318,0.0011984285,0.0007524268,0.0007888336,0.0031073843,0.00042105324],"domain_scores_gemma":[0.9837801,0.0030733831,0.0010542794,0.0017658467,0.009869342,0.00045702438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029316593,0.0022394795,0.0019444366,0.00448327,0.0035573656,0.0028005661,0.004680534,0.0046100426,0.0521393],"category_scores_gemma":[0.029001595,0.0014104156,0.0026342322,0.00327767,0.0026225196,0.003786434,0.0026725065,0.009545387,0.02362019],"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.00010065647,0.000029543206,0.000117837575,0.00019148609,0.000034121713,0.00023071896,0.000057077057,0.00041843238,0.0008675232,0.010528608,0.975921,0.011502969],"study_design_scores_gemma":[0.00006521549,0.000100286496,0.0019048812,0.00034491016,0.00007575771,0.0005490106,0.00010129017,0.0050007533,0.005757237,0.030923624,0.95495963,0.0002173999],"about_ca_topic_score_codex":0.013164371,"about_ca_topic_score_gemma":0.016024973,"teacher_disagreement_score":0.0521393,"about_ca_system_score_codex":0.0049100816,"about_ca_system_score_gemma":0.0031460375,"threshold_uncertainty_score":0.17442334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086766355,0.0031150123,0.8656986,0.00086390995,0.000058246973,0.00009919196,0.00027950603,0.0005230054,0.042596187],"genre_scores_gemma":[0.94843537,0.0026552253,0.044901643,0.0003750533,0.000118308744,0.00024038732,0.00016815352,0.00007934749,0.0030265744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982293,0.00069182017,0.00006234546,0.00019768519,0.00041933733,0.00039942455],"domain_scores_gemma":[0.98891383,0.007980311,0.0010369336,0.00055214483,0.0012456323,0.00027113434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029343702,0.0015606364,0.0012699177,0.001272622,0.0009656961,0.0021701325,0.0015471375,0.001050637,0.002120976],"category_scores_gemma":[0.01263855,0.0005384037,0.0009086338,0.0014469492,0.003677721,0.002851909,0.0028305466,0.0018883961,0.00083070976],"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.0003185487,0.00007306078,0.00061274343,0.00034258788,0.00010359065,0.0007182659,0.00043830802,0.37653688,0.008999594,0.5959899,0.0025338603,0.013332585],"study_design_scores_gemma":[0.000048901926,0.00011053322,0.00031712258,0.00008368324,0.00005433286,0.0005001944,0.00010670004,0.8118985,0.0041729207,0.18066305,0.0019780677,0.00006596005],"about_ca_topic_score_codex":0.0025907229,"about_ca_topic_score_gemma":0.0010606176,"teacher_disagreement_score":0.0029343702,"about_ca_system_score_codex":0.0021298768,"about_ca_system_score_gemma":0.0018091687,"threshold_uncertainty_score":0.015518606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015225893,0.0003363145,0.9768886,0.00014829294,0.00012377666,0.00012257087,0.0003809998,0.0003543656,0.0064191436],"genre_scores_gemma":[0.2605169,0.00072959636,0.7257374,0.00019725328,0.0001268738,0.0005949391,0.0014948297,0.00021637624,0.010385882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883,0.00027196071,0.000105100495,0.00020919177,0.0004580359,0.00012566987],"domain_scores_gemma":[0.997024,0.0010103559,0.00026220098,0.0005841951,0.0008715653,0.00024765503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078460947,0.0006152821,0.0007428151,0.0012739659,0.00096962537,0.001099341,0.0013105802,0.0007524875,0.0032943771],"category_scores_gemma":[0.007488817,0.0006691273,0.0005160194,0.0016346922,0.00094945,0.0013817074,0.0018441317,0.0013372507,0.0016027206],"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.00040832075,0.00008410251,0.0012038177,0.00032685837,0.000037013135,0.0004812498,0.0006416939,0.062175892,0.055942137,0.6607355,0.009675765,0.2082876],"study_design_scores_gemma":[0.00010190408,0.0003374476,0.0010263582,0.00015169567,0.000031301184,0.0010607131,0.00019104393,0.642184,0.033051644,0.2826691,0.0390581,0.00013661785],"about_ca_topic_score_codex":0.0019140133,"about_ca_topic_score_gemma":0.001557252,"teacher_disagreement_score":0.0032943771,"about_ca_system_score_codex":0.0008594725,"about_ca_system_score_gemma":0.0015140113,"threshold_uncertainty_score":0.01102078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064117566,0.00084353966,0.9267552,0.000961625,0.00010963502,0.00006693423,0.00040019763,0.00020421352,0.0065411762],"genre_scores_gemma":[0.9514997,0.0007034637,0.04393427,0.00016703748,0.00014209056,0.0001571234,0.0001377667,0.000024900251,0.0032335715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997408,0.0010091163,0.00015800762,0.00052584644,0.00057708606,0.00032187995],"domain_scores_gemma":[0.9897508,0.0063077467,0.0014886148,0.0013582084,0.00094579713,0.00014884367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025022703,0.001425875,0.001782423,0.00076707604,0.0009468019,0.0020902646,0.0020262694,0.0018710634,0.0017591353],"category_scores_gemma":[0.013350336,0.00065697334,0.0006021931,0.0013348853,0.002248475,0.003581444,0.0018243296,0.002066926,0.00047833647],"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.00077340635,0.00007266489,0.0010486486,0.0004592413,0.00010030997,0.0012538795,0.000498793,0.42643106,0.00775636,0.5340924,0.0019794907,0.025533807],"study_design_scores_gemma":[0.000048471502,0.000092171365,0.00020398702,0.000040965282,0.000049884067,0.00025990157,0.000066225024,0.9055446,0.0046891943,0.087783955,0.0011748532,0.000045952853],"about_ca_topic_score_codex":0.0017059264,"about_ca_topic_score_gemma":0.0011056077,"teacher_disagreement_score":0.0025022703,"about_ca_system_score_codex":0.0012427001,"about_ca_system_score_gemma":0.0015275831,"threshold_uncertainty_score":0.013233483},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606513,0.00033917476,0.9799969,0.00032352988,0.00009676995,0.00006624315,0.00017020738,0.0010807723,0.007319862],"genre_scores_gemma":[0.39473522,0.00046960876,0.59263915,0.0005535502,0.00013666159,0.00020246432,0.0005821807,0.00027643732,0.010404721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977763,0.00056674203,0.00013273791,0.00040333008,0.00084084616,0.00028005295],"domain_scores_gemma":[0.9982577,0.00047154928,0.00012664634,0.0007044989,0.00036434823,0.00007526969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015334119,0.00057898724,0.0012137186,0.001215579,0.0009951058,0.0016597711,0.0021025934,0.0016281783,0.0044159456],"category_scores_gemma":[0.0059393914,0.00063419616,0.00071413314,0.0013424859,0.0014224153,0.0016322869,0.0021720727,0.0015682859,0.0023433364],"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.00038262544,0.000119456374,0.0012355307,0.00019292568,0.000096024705,0.00019599804,0.0002721106,0.2611546,0.019002367,0.51401275,0.0071584205,0.19617724],"study_design_scores_gemma":[0.000026059279,0.00002801961,0.0001352783,0.000017120303,0.000014211664,0.000112680544,0.000008365817,0.8735359,0.011273811,0.10993702,0.004882117,0.00002938775],"about_ca_topic_score_codex":0.0021241968,"about_ca_topic_score_gemma":0.0023537143,"teacher_disagreement_score":0.0044159456,"about_ca_system_score_codex":0.0015259912,"about_ca_system_score_gemma":0.0019671977,"threshold_uncertainty_score":0.014772832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046771865,0.0011507139,0.9439037,0.0005976077,0.00006778005,0.000040375082,0.00012948002,0.00008049102,0.007257978],"genre_scores_gemma":[0.9346917,0.0020359089,0.0567107,0.00013966099,0.0001070134,0.000107077714,0.0002205628,0.000056617293,0.005930757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931836,0.0002398367,0.000032339132,0.00009954716,0.00017543047,0.000134548],"domain_scores_gemma":[0.99685514,0.0024672998,0.00025193204,0.00010394597,0.00025641953,0.000065166256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013248464,0.0007852812,0.0007967664,0.00056861463,0.0004051566,0.001100603,0.0007748075,0.000757263,0.0018996486],"category_scores_gemma":[0.004981476,0.00043405063,0.0004133636,0.0008859978,0.0018586541,0.001681386,0.0014692597,0.0013156502,0.00018942801],"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.00014033464,0.000024645746,0.00023190712,0.00007689675,0.00001314797,0.00009465157,0.00009633687,0.6635063,0.002419366,0.31618285,0.0007736122,0.01643996],"study_design_scores_gemma":[0.000013022505,0.000025950856,0.000045040575,0.000015196666,0.0000032086725,0.000015408048,0.00001312513,0.91719425,0.00072187843,0.08161592,0.00032650694,0.0000105185045],"about_ca_topic_score_codex":0.0052504595,"about_ca_topic_score_gemma":0.002779792,"teacher_disagreement_score":0.0052504595,"about_ca_system_score_codex":0.001865267,"about_ca_system_score_gemma":0.0017155152,"threshold_uncertainty_score":0.013533533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044358857,0.00028720696,0.9460773,0.00049693626,0.00005356169,0.00014290311,0.00020303851,0.0013299902,0.0070502036],"genre_scores_gemma":[0.75695837,0.00031340087,0.2355302,0.00030773628,0.000075896045,0.000286094,0.00032056274,0.00029390582,0.0059138294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983821,0.00045188938,0.00010593275,0.00029884392,0.00056781125,0.00019338123],"domain_scores_gemma":[0.99618524,0.0019288184,0.0002346114,0.0011166988,0.00034375643,0.00019072554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016815644,0.00070670794,0.0011052034,0.00047083403,0.0007215171,0.0010105208,0.002026549,0.0010216847,0.004992049],"category_scores_gemma":[0.0077176862,0.00047561078,0.00049635925,0.00086999923,0.002600066,0.0042491686,0.004423919,0.0016377439,0.00082987343],"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.0008216967,0.00016888049,0.00069983536,0.00037021586,0.00006620516,0.00032100957,0.00030703435,0.20859678,0.05444587,0.6322942,0.0041077705,0.09780057],"study_design_scores_gemma":[0.000092161026,0.00012723633,0.00012854135,0.000030169012,0.000017560178,0.00014541797,0.000024403367,0.7538872,0.038857028,0.20334676,0.0033002233,0.000043382603],"about_ca_topic_score_codex":0.00059396564,"about_ca_topic_score_gemma":0.0005836202,"teacher_disagreement_score":0.004992049,"about_ca_system_score_codex":0.0014345222,"about_ca_system_score_gemma":0.0012434633,"threshold_uncertainty_score":0.01670003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13286856,0.0014062552,0.7871713,0.00412951,0.00017894681,0.00035776498,0.00047642394,0.0012648796,0.07214634],"genre_scores_gemma":[0.9109825,0.0008793883,0.08065775,0.00038699343,0.00019156668,0.00040549037,0.00034914297,0.000544959,0.005602279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97735846,0.0071845567,0.0012020445,0.0026471666,0.008145724,0.0034620946],"domain_scores_gemma":[0.8967885,0.07745833,0.0029675395,0.019173224,0.0026085835,0.0010037275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016068099,0.0015857952,0.0021628127,0.0025526346,0.0021573624,0.006165958,0.004515092,0.0030567383,0.009422803],"category_scores_gemma":[0.06011749,0.0009012943,0.0022467,0.0026434262,0.009125353,0.014207252,0.0066123134,0.0059140115,0.0017969572],"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.00070586626,0.0002715138,0.0012423773,0.0002467975,0.00011540601,0.00011743689,0.00022919248,0.13101682,0.0072925324,0.82364416,0.0016344016,0.033483498],"study_design_scores_gemma":[0.00007813857,0.00012456204,0.0005167734,0.00008552104,0.0000847836,0.00011838483,0.00006910827,0.47109127,0.01847038,0.5065723,0.0027285882,0.00006016979],"about_ca_topic_score_codex":0.00086289184,"about_ca_topic_score_gemma":0.00069055625,"teacher_disagreement_score":0.016068099,"about_ca_system_score_codex":0.006340234,"about_ca_system_score_gemma":0.0043010316,"threshold_uncertainty_score":0.08497727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07092773,0.008340939,0.87421805,0.0023594026,0.00023407109,0.0002832185,0.0004961624,0.0003284994,0.04281196],"genre_scores_gemma":[0.85687035,0.008240173,0.12622434,0.0005859863,0.00033929295,0.00040183435,0.00029800314,0.00011688851,0.0069230944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717593,0.0012412781,0.00012264137,0.00039006284,0.0007508554,0.00031922315],"domain_scores_gemma":[0.99478936,0.0036076205,0.00042743405,0.00057652796,0.0004660249,0.0001330482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030785862,0.0024916017,0.0016800553,0.0015781327,0.0009135193,0.0016940121,0.0013708416,0.0014615608,0.0026159598],"category_scores_gemma":[0.014280578,0.00079620816,0.00062209973,0.0017028231,0.0038010187,0.0035778093,0.002628498,0.0028498215,0.0006696491],"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.0006584324,0.00007742533,0.00038280996,0.0003074061,0.00007495294,0.000277302,0.00035651572,0.27453795,0.0068118605,0.66174525,0.003637133,0.051133096],"study_design_scores_gemma":[0.00012115271,0.0002567294,0.00035927596,0.00021859168,0.00006958781,0.00040061367,0.00012836892,0.6980817,0.008422479,0.28638223,0.005433863,0.0001254064],"about_ca_topic_score_codex":0.0017463762,"about_ca_topic_score_gemma":0.0015748987,"teacher_disagreement_score":0.0030785862,"about_ca_system_score_codex":0.0024741031,"about_ca_system_score_gemma":0.002051746,"threshold_uncertainty_score":0.017950952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74945176,0.0005659783,0.20156658,0.0013261866,0.000059507816,0.00010349989,0.00052415667,0.0007294497,0.045672983],"genre_scores_gemma":[0.92465794,0.00029294234,0.07195029,0.00015261146,0.000020443173,0.000097039614,0.00023778595,0.000054738983,0.0025362554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952686,0.00014143765,0.000025201281,0.00007531358,0.00009723324,0.0001338677],"domain_scores_gemma":[0.9978264,0.0016463561,0.00018591247,0.00017831725,0.00008732976,0.00007569677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009819729,0.00071380415,0.0006222412,0.0013268966,0.0013098551,0.0011889272,0.0007385348,0.0013335821,0.0066099367],"category_scores_gemma":[0.0054683257,0.0003990219,0.0009432799,0.001060101,0.0018011112,0.001886787,0.0016819927,0.0016776784,0.00071030675],"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.0009027552,0.00014415033,0.001449713,0.0004113422,0.000053617237,0.00092579005,0.00059796614,0.06279209,0.015965672,0.8583142,0.0035275128,0.05491518],"study_design_scores_gemma":[0.00027351207,0.0003884166,0.0012437514,0.00019629914,0.00011600431,0.0023056476,0.00035179532,0.16595767,0.036781248,0.77750415,0.014744924,0.00013653208],"about_ca_topic_score_codex":0.00028721587,"about_ca_topic_score_gemma":0.00027586555,"teacher_disagreement_score":0.0066099367,"about_ca_system_score_codex":0.00078640593,"about_ca_system_score_gemma":0.00054636446,"threshold_uncertainty_score":0.022112489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18424079,0.004255033,0.79081714,0.0020921866,0.00021754243,0.00007650306,0.00045695904,0.00033445357,0.017509418],"genre_scores_gemma":[0.9148812,0.0041351523,0.07236279,0.0009382289,0.0007112491,0.00024572655,0.0006933935,0.00032733852,0.00570491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978052,0.0007145416,0.00009668161,0.00048386288,0.00057629717,0.0003233875],"domain_scores_gemma":[0.978683,0.016797861,0.0015302154,0.0011981179,0.0013709764,0.0004197923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042403187,0.0012778273,0.0010512263,0.0015259716,0.00087493146,0.0016378546,0.0019074116,0.0011487539,0.005200016],"category_scores_gemma":[0.030457947,0.00072619336,0.0006572602,0.0012934315,0.0027513183,0.0057640765,0.0017018198,0.002022934,0.0010700888],"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.0012912048,0.0001993599,0.006648129,0.0007148864,0.00012806639,0.00090594584,0.00097378576,0.14487697,0.038063332,0.7031823,0.005897037,0.09711908],"study_design_scores_gemma":[0.00008846137,0.0003012144,0.004370161,0.00023154818,0.00004111043,0.0013653548,0.00036594027,0.4961032,0.016173791,0.47399494,0.0068137366,0.00015050425],"about_ca_topic_score_codex":0.00053783745,"about_ca_topic_score_gemma":0.00025540765,"teacher_disagreement_score":0.005200016,"about_ca_system_score_codex":0.0010791328,"about_ca_system_score_gemma":0.00080960314,"threshold_uncertainty_score":0.022425234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31216556,0.0029088934,0.6640074,0.0022592056,0.0002325056,0.0001062853,0.0002994687,0.00033151926,0.017689204],"genre_scores_gemma":[0.97547805,0.0011575936,0.019184833,0.00016618063,0.0001210836,0.00009735271,0.000109300236,0.000083775114,0.003601831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983424,0.00048037147,0.00008379237,0.00018943074,0.0005597712,0.00034424628],"domain_scores_gemma":[0.96042025,0.03399714,0.0023322369,0.0012293394,0.0017109064,0.00031018473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004573847,0.0012972511,0.0010951223,0.0012279475,0.00068473455,0.0016873024,0.0013425888,0.0013292903,0.0024756007],"category_scores_gemma":[0.035187416,0.0005239999,0.0005151623,0.00094950746,0.0026900545,0.0037080843,0.002354609,0.0021637115,0.00030600815],"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.00030710912,0.000072549636,0.0023174617,0.0002213839,0.00007254742,0.0004787368,0.0005025951,0.70047534,0.0056635593,0.27647257,0.0012256659,0.012190516],"study_design_scores_gemma":[0.000011861923,0.00003748102,0.00037190638,0.000039599552,0.000018978106,0.00009092167,0.000054661556,0.95273393,0.0017205216,0.04460933,0.00028190608,0.000028907982],"about_ca_topic_score_codex":0.0027946199,"about_ca_topic_score_gemma":0.0019279334,"teacher_disagreement_score":0.004573847,"about_ca_system_score_codex":0.002683843,"about_ca_system_score_gemma":0.0016896381,"threshold_uncertainty_score":0.024189115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011815001,0.0011108734,0.979543,0.00052499067,0.00013156548,0.00004400726,0.00014678841,0.00014077718,0.00654299],"genre_scores_gemma":[0.67255336,0.0045995708,0.2945954,0.0010314282,0.0014195238,0.00053490046,0.0006887024,0.00032876854,0.024248324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974414,0.0011379916,0.000096194504,0.0005548053,0.00052683486,0.00024268225],"domain_scores_gemma":[0.994719,0.0029941238,0.00073060684,0.0006394842,0.0005371382,0.0003795652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005344105,0.0011549911,0.0015561885,0.0030168032,0.0009468704,0.00283774,0.0030419827,0.0019480935,0.0070509715],"category_scores_gemma":[0.014887295,0.0005982022,0.002638745,0.0019095097,0.0027073284,0.004323177,0.0025174026,0.0039155562,0.0011842145],"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.000014606171,0.000013897966,0.00033069073,0.00005412534,0.000038304737,0.000090361085,0.00009958155,0.050621722,0.0005343355,0.94255865,0.0008480652,0.0047956766],"study_design_scores_gemma":[0.000011338219,0.000027964661,0.00022683684,0.000022503325,0.000019859874,0.00007542326,0.000051391395,0.40799457,0.00015758509,0.58757806,0.003811825,0.000022619472],"about_ca_topic_score_codex":0.0042640353,"about_ca_topic_score_gemma":0.0020301861,"teacher_disagreement_score":0.0070509715,"about_ca_system_score_codex":0.0024898814,"about_ca_system_score_gemma":0.0016767461,"threshold_uncertainty_score":0.028262675},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010702077,0.00036548765,0.98304224,0.00012092085,0.00010678445,0.00013457752,0.00008607442,0.0017810899,0.0036606758],"genre_scores_gemma":[0.0959867,0.00044157446,0.89626056,0.00015429912,0.00016562469,0.00038880223,0.00060631265,0.00038571618,0.00561038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975829,0.00038114697,0.00025683906,0.00033186545,0.0011700128,0.00027711186],"domain_scores_gemma":[0.9964797,0.0008467507,0.00030548155,0.001214966,0.0010416314,0.000111436835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773114,0.0014698915,0.0011078137,0.0026230884,0.0009814388,0.0021093737,0.0021522576,0.00076004025,0.006708456],"category_scores_gemma":[0.0058971765,0.0004463707,0.0013640326,0.0030929614,0.0010651138,0.003858632,0.0024536068,0.0018840948,0.0043375525],"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.000538508,0.00022916248,0.00078133,0.00022853196,0.00005712793,0.00012682981,0.0003198654,0.03137229,0.025878673,0.10931788,0.010266948,0.8208829],"study_design_scores_gemma":[0.00025412423,0.0005250057,0.0006614077,0.00011071383,0.00012216244,0.00075300474,0.00021760765,0.6787943,0.08873454,0.19315524,0.03657375,0.00009810264],"about_ca_topic_score_codex":0.0010112503,"about_ca_topic_score_gemma":0.0016875756,"teacher_disagreement_score":0.006708456,"about_ca_system_score_codex":0.0014786384,"about_ca_system_score_gemma":0.002332803,"threshold_uncertainty_score":0.022441983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6781539,0.001849826,0.24195741,0.0045136153,0.0003401668,0.00018512456,0.0014046703,0.0012141014,0.07038126],"genre_scores_gemma":[0.9523506,0.0010854702,0.026898758,0.0007670233,0.00048546508,0.00030055633,0.0013874713,0.00041124082,0.016313428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962463,0.0012961437,0.00015006973,0.00068686716,0.0007798047,0.00084080995],"domain_scores_gemma":[0.9538053,0.034567524,0.0028497516,0.0024244601,0.0031190699,0.0032339236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002810582,0.0012505386,0.0016831518,0.002896767,0.0027243567,0.0040990086,0.0019067308,0.0020213558,0.007745349],"category_scores_gemma":[0.045639705,0.0009809182,0.0011015707,0.0015606395,0.0056538144,0.0045291027,0.0054389373,0.003816658,0.0020264825],"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.00058671663,0.00012098799,0.0036772,0.00024343823,0.000052306754,0.000259088,0.0010968599,0.03021819,0.003100388,0.9300532,0.010349057,0.020242667],"study_design_scores_gemma":[0.00012497617,0.00016273142,0.0012700172,0.000115862735,0.00002634849,0.00036014253,0.00034100746,0.1099339,0.0016636655,0.8811684,0.004745493,0.00008739909],"about_ca_topic_score_codex":0.0030936867,"about_ca_topic_score_gemma":0.0021155565,"teacher_disagreement_score":0.007745349,"about_ca_system_score_codex":0.0030591383,"about_ca_system_score_gemma":0.0022447628,"threshold_uncertainty_score":0.025910795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33159623,0.0043158154,0.6077833,0.0057027326,0.00042221078,0.0002997554,0.0008382342,0.003276241,0.045765497],"genre_scores_gemma":[0.8781894,0.00145322,0.11536391,0.00055528997,0.0002004452,0.00026611512,0.00040244774,0.0005746645,0.0029944838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992307,0.0026217746,0.00023411251,0.0005913443,0.0031577444,0.0010880874],"domain_scores_gemma":[0.8697352,0.115476765,0.004058989,0.0062001897,0.0037984296,0.0007304153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049367016,0.0019796714,0.0017779346,0.0020921412,0.0012978715,0.0016334647,0.0014312521,0.0017669407,0.004442509],"category_scores_gemma":[0.06854615,0.00069064024,0.0008793502,0.00177136,0.0033879266,0.0031510377,0.0023745187,0.0033688678,0.0010375412],"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.0027724032,0.00052042305,0.00489823,0.00046386104,0.00016554577,0.0011788737,0.00046451646,0.76416713,0.029098488,0.09361032,0.0075495094,0.0951107],"study_design_scores_gemma":[0.00013944332,0.00035853713,0.0020627608,0.000089127956,0.00007897783,0.0007377863,0.00020764711,0.9333292,0.025697606,0.03557166,0.0016253055,0.00010192924],"about_ca_topic_score_codex":0.0029154464,"about_ca_topic_score_gemma":0.0028442808,"teacher_disagreement_score":0.0049367016,"about_ca_system_score_codex":0.0018352187,"about_ca_system_score_gemma":0.0025749183,"threshold_uncertainty_score":0.026108027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016947675,0.0018864269,0.920464,0.0010761231,0.00028853526,0.0000548975,0.00009298336,0.0002921233,0.058897242],"genre_scores_gemma":[0.7396244,0.0067724837,0.21675007,0.0016197279,0.0020887663,0.00045103946,0.00037908647,0.0010138898,0.031300597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871826,0.0007052872,0.000045048044,0.000120297795,0.0003102028,0.000100870166],"domain_scores_gemma":[0.9968425,0.0020901267,0.00019260283,0.00032684076,0.0004198312,0.0001280447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002303529,0.0017846243,0.00076074235,0.0024253123,0.0010562873,0.001936196,0.001245994,0.0012931671,0.0048262253],"category_scores_gemma":[0.01047037,0.00047975342,0.0011043657,0.0015124276,0.0026272782,0.0039137863,0.0027160211,0.003652709,0.002041615],"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.000011766548,0.000021777167,0.00014661654,0.000043858003,0.00000987313,0.00012773983,0.00013914032,0.022023251,0.0011935373,0.9663649,0.0015373674,0.008380212],"study_design_scores_gemma":[0.000005945756,0.000026565885,0.00016006862,0.000055222143,0.0000067932588,0.00017376046,0.000041204356,0.3411492,0.0015649647,0.65082186,0.005957395,0.00003696118],"about_ca_topic_score_codex":0.0010629295,"about_ca_topic_score_gemma":0.0006258302,"teacher_disagreement_score":0.0048262253,"about_ca_system_score_codex":0.001104616,"about_ca_system_score_gemma":0.0006362679,"threshold_uncertainty_score":0.016145289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038410425,0.00046130532,0.9588595,0.00009956658,0.000011197426,0.00001997877,0.00003671908,0.000052461342,0.0020488983],"genre_scores_gemma":[0.7903307,0.0007435448,0.20660073,0.000075235715,0.000047227863,0.000097311946,0.00011619046,0.000035490608,0.0019536624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00020395864,0.000020164483,0.000057905563,0.00021007186,0.000053598444],"domain_scores_gemma":[0.9988708,0.0006434624,0.00016066735,0.000058211284,0.00023467698,0.00003222443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065090647,0.00046117374,0.00043317376,0.0003457153,0.00020402196,0.00053788687,0.00026177143,0.0004289976,0.00067080744],"category_scores_gemma":[0.0024192743,0.00038831422,0.00026180464,0.00032797523,0.0004467112,0.0004974,0.00047078176,0.00041020222,0.00027399635],"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.00011216641,0.000020487441,0.001007761,0.00008388683,0.000046627534,0.0000637923,0.00010046941,0.91197014,0.022731254,0.029760083,0.00035718756,0.03374619],"study_design_scores_gemma":[0.0000070003534,0.00006354475,0.00023870896,0.000009737546,0.0000081129965,0.000031307292,0.000012264836,0.9890048,0.0050690016,0.004915971,0.0006305042,0.000009086229],"about_ca_topic_score_codex":0.0011913787,"about_ca_topic_score_gemma":0.0013103867,"teacher_disagreement_score":0.0011913787,"about_ca_system_score_codex":0.00064566283,"about_ca_system_score_gemma":0.0010034416,"threshold_uncertainty_score":0.0046846867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029674195,0.00021244993,0.95786107,0.0012805323,0.0001634944,0.0003589985,0.00021692997,0.0015974338,0.008634827],"genre_scores_gemma":[0.8297632,0.0002064761,0.16004206,0.00067157403,0.00013371704,0.0005683595,0.0003703961,0.00008308027,0.008161131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676126,0.00095344783,0.00023133676,0.0004376732,0.001138978,0.00047735104],"domain_scores_gemma":[0.9965113,0.0010310881,0.00042541794,0.0012660376,0.00062062446,0.00014557704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026147645,0.00042306568,0.00075002306,0.00076228776,0.0014485747,0.001435325,0.00149688,0.0016661232,0.0026761452],"category_scores_gemma":[0.005257509,0.00033766526,0.0005234855,0.0010301498,0.0014661086,0.0027366898,0.004724879,0.0019310144,0.0013184381],"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.00072383566,0.00025563242,0.0014457839,0.00029448036,0.00006348331,0.0010846301,0.00068889227,0.053472817,0.06801749,0.7059453,0.013736941,0.15427072],"study_design_scores_gemma":[0.00024324925,0.00030726343,0.0007183782,0.000052164214,0.000051731615,0.00097581506,0.00015343967,0.73690015,0.039058853,0.19612764,0.02527928,0.00013206265],"about_ca_topic_score_codex":0.00085775973,"about_ca_topic_score_gemma":0.0006454118,"teacher_disagreement_score":0.0026761452,"about_ca_system_score_codex":0.0013594357,"about_ca_system_score_gemma":0.0023674807,"threshold_uncertainty_score":0.013828397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25621673,0.0067269374,0.6983202,0.0014205836,0.00011246602,0.00007811511,0.00015447762,0.00015735414,0.03681311],"genre_scores_gemma":[0.9774506,0.0021791281,0.018975597,0.00014515658,0.00012406633,0.000045317418,0.000030310395,0.00003472109,0.0010151637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789786,0.001071706,0.000044481512,0.00018817448,0.00042652333,0.00037131066],"domain_scores_gemma":[0.99447733,0.004475348,0.00032092808,0.00023411136,0.0003574828,0.00013492332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030810444,0.0014963242,0.0010190697,0.0009252469,0.00086248573,0.002281588,0.00080731895,0.0011730733,0.0015052045],"category_scores_gemma":[0.011531639,0.00057614036,0.00033576376,0.0012101682,0.0021862076,0.0027629605,0.001651541,0.0009906617,0.00030366165],"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.0005653026,0.0000710004,0.001130362,0.00026670197,0.00006782476,0.000501877,0.00035279308,0.65413207,0.014995243,0.29603812,0.0012592506,0.030619456],"study_design_scores_gemma":[0.000037771915,0.00017213842,0.0005060684,0.00007297688,0.000034564608,0.00041959906,0.00012095752,0.90221757,0.0043467167,0.09100204,0.0010043713,0.00006513306],"about_ca_topic_score_codex":0.0013093406,"about_ca_topic_score_gemma":0.0011005102,"teacher_disagreement_score":0.0030810444,"about_ca_system_score_codex":0.0018842688,"about_ca_system_score_gemma":0.00085172907,"threshold_uncertainty_score":0.0162943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18260652,0.00020503518,0.7965443,0.00013710934,0.000030900053,0.000075810516,0.0002239142,0.00023125278,0.019945232],"genre_scores_gemma":[0.8142621,0.00015178925,0.17918071,0.000065736815,0.000023440256,0.00007324239,0.0003124847,0.00005915368,0.0058714147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991472,0.0001687398,0.000041999177,0.00012653996,0.00038166743,0.00013384415],"domain_scores_gemma":[0.99823123,0.0006130736,0.00021180531,0.00037348742,0.00041480103,0.00015557575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046631612,0.0002100657,0.0003594963,0.00039315296,0.00060633774,0.00095860637,0.0009687781,0.00049468904,0.0020216096],"category_scores_gemma":[0.004033648,0.0001980176,0.00026234184,0.00079527625,0.0009388931,0.0009933463,0.0011342133,0.0005960808,0.0004522555],"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.00022839477,0.00004737003,0.0015496695,0.00007306029,0.000016084367,0.00046049425,0.00033347437,0.25329605,0.017928775,0.65177804,0.0016878744,0.07260071],"study_design_scores_gemma":[0.000022579157,0.00005180793,0.0005158432,0.000011982807,0.0000062925897,0.00047772052,0.00012456032,0.8238732,0.009141718,0.15807638,0.0076709967,0.000026923211],"about_ca_topic_score_codex":0.0028989716,"about_ca_topic_score_gemma":0.0035822373,"teacher_disagreement_score":0.0028989716,"about_ca_system_score_codex":0.0006102412,"about_ca_system_score_gemma":0.0006669876,"threshold_uncertainty_score":0.0067629814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43251207,0.003217649,0.5080892,0.0012147165,0.00021814171,0.000088141256,0.00079495326,0.0025549957,0.05131018],"genre_scores_gemma":[0.9533714,0.0008008153,0.027801951,0.00020075195,0.0000260964,0.00005086106,0.00041158247,0.00023242793,0.01710411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930775,0.000107864245,0.00003564313,0.000123748,0.00031135418,0.000113596776],"domain_scores_gemma":[0.9992931,0.00038296563,0.00003772348,0.00013520973,0.00012979527,0.000021078553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034918552,0.0004988154,0.00053209614,0.00046106032,0.0004374658,0.0012488521,0.0010483464,0.0008226654,0.0059180525],"category_scores_gemma":[0.0027718882,0.0003301842,0.00041861366,0.0010196156,0.0003742891,0.0015596264,0.0005146941,0.0003699663,0.001258287],"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.0007757994,0.00008606087,0.0024031897,0.0002776091,0.000105363666,0.000417388,0.00014198487,0.6426077,0.10321294,0.088446796,0.0049029225,0.15662226],"study_design_scores_gemma":[0.000031563763,0.0002361859,0.0015278189,0.000027000493,0.00006434735,0.00045414452,0.00007342617,0.9052806,0.05998189,0.021904513,0.010384849,0.000033599965],"about_ca_topic_score_codex":0.0015939736,"about_ca_topic_score_gemma":0.0019946755,"teacher_disagreement_score":0.0059180525,"about_ca_system_score_codex":0.0015764004,"about_ca_system_score_gemma":0.00089955184,"threshold_uncertainty_score":0.019797862},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5746375,0.0025300903,0.3746979,0.002473279,0.00021563651,0.000104078594,0.000523003,0.0013836036,0.043434914],"genre_scores_gemma":[0.9709288,0.00056666613,0.024699943,0.00021879295,0.0000863878,0.00008712333,0.00019737588,0.0000995009,0.0031154915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997498,0.000596453,0.00013875603,0.00045008518,0.0007655155,0.00055111886],"domain_scores_gemma":[0.9838666,0.009847348,0.0015813304,0.0029370876,0.0012001651,0.00056741113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019062028,0.00079798664,0.0008187129,0.0011434697,0.0013583344,0.0021896544,0.0011922392,0.0022319644,0.0022853208],"category_scores_gemma":[0.021662699,0.0006326537,0.00080597383,0.0014103868,0.0033027628,0.0041446215,0.0032454082,0.0021813938,0.0008055903],"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.0005900221,0.0000696677,0.0025463214,0.00018831785,0.00007462495,0.00026814133,0.00052202767,0.16728808,0.01294442,0.7799379,0.0022902177,0.033280287],"study_design_scores_gemma":[0.00006211052,0.00019844098,0.0011827159,0.00008722842,0.0000693115,0.0003405621,0.000074977266,0.40666184,0.020702265,0.5641363,0.006370865,0.00011332723],"about_ca_topic_score_codex":0.0021445693,"about_ca_topic_score_gemma":0.0023292492,"teacher_disagreement_score":0.0022853208,"about_ca_system_score_codex":0.0020729098,"about_ca_system_score_gemma":0.0017418467,"threshold_uncertainty_score":0.0150401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038865067,0.0013061592,0.98519266,0.00030061248,0.00010596803,0.00009141255,0.00011709585,0.00022597458,0.008773605],"genre_scores_gemma":[0.47239125,0.004612639,0.503718,0.00052107195,0.00033224243,0.00047205458,0.00028535954,0.00013909569,0.017528348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884903,0.00034993776,0.00006120754,0.00032452238,0.0002550387,0.00016025711],"domain_scores_gemma":[0.9992667,0.00022405862,0.00007023654,0.00014209145,0.00023109428,0.00006577373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013237963,0.0017494997,0.0012867367,0.0008661815,0.0013777557,0.0022121747,0.0026999947,0.001828466,0.0036671145],"category_scores_gemma":[0.0014567544,0.00051065034,0.0009409021,0.00091465464,0.0016550338,0.003161101,0.0025384766,0.0018875065,0.0016854039],"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.00022589692,0.0000798749,0.00037036248,0.00037052535,0.000098521225,0.00097579753,0.00047355876,0.27774987,0.015232045,0.6151465,0.008780209,0.08049677],"study_design_scores_gemma":[0.000092185306,0.00048365167,0.00017412356,0.000117400195,0.00017989686,0.0013201826,0.00023484038,0.8010361,0.0075638425,0.14455076,0.044087686,0.0001592883],"about_ca_topic_score_codex":0.004366661,"about_ca_topic_score_gemma":0.005557517,"teacher_disagreement_score":0.004366661,"about_ca_system_score_codex":0.0015917586,"about_ca_system_score_gemma":0.00216208,"threshold_uncertainty_score":0.012267709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040892597,0.0029316952,0.9350569,0.0014266943,0.0001510933,0.000091704285,0.00010404625,0.00013316784,0.019212192],"genre_scores_gemma":[0.940489,0.003525715,0.046579357,0.0003242668,0.00029282438,0.00021649145,0.00008840317,0.00008941087,0.008394477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984434,0.0007840171,0.000049615857,0.0001782649,0.00036618646,0.0001784636],"domain_scores_gemma":[0.99023813,0.0082952455,0.00051062484,0.00030455145,0.0005314268,0.000119979675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002499954,0.0012310857,0.0014581999,0.0009732618,0.00086383166,0.0019161197,0.0013205506,0.0016461172,0.003775921],"category_scores_gemma":[0.010812857,0.00044150138,0.0007063114,0.0014082977,0.0021711043,0.0030086767,0.0018615944,0.0016592607,0.00044846305],"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.000057743015,0.00005688407,0.0005587565,0.00012115079,0.00003118447,0.00022653404,0.00013346199,0.8770743,0.0011905557,0.10807732,0.00091611897,0.011555973],"study_design_scores_gemma":[0.0000037433745,0.00001690232,0.00006504519,0.0000071056143,0.0000033178062,0.000020169635,0.000016180935,0.9819202,0.00012754033,0.01757529,0.00023928574,0.000005153461],"about_ca_topic_score_codex":0.003329177,"about_ca_topic_score_gemma":0.0022351863,"teacher_disagreement_score":0.003775921,"about_ca_system_score_codex":0.0015659372,"about_ca_system_score_gemma":0.0008747906,"threshold_uncertainty_score":0.013221145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11202709,0.0008255693,0.8516284,0.0026338447,0.00009660009,0.00023668614,0.0007265502,0.00028701994,0.031538263],"genre_scores_gemma":[0.95743185,0.0007014998,0.03259413,0.00018984647,0.0001354743,0.00039564254,0.00015385135,0.00009629331,0.008301399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958269,0.0021080244,0.00014772234,0.0005911757,0.0006935929,0.0006325512],"domain_scores_gemma":[0.97477925,0.01902661,0.0020919673,0.0021384566,0.0013648609,0.0005987469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049540843,0.0019149256,0.0018523169,0.0013244641,0.0013082232,0.0037256589,0.003936097,0.0027919195,0.0066126795],"category_scores_gemma":[0.022016253,0.0008891103,0.0010877226,0.0017039087,0.0048383493,0.0077475677,0.0036864849,0.004104977,0.001309683],"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.00023074647,0.00009278004,0.00032939605,0.00018161052,0.000050378538,0.00048801556,0.00069785403,0.26114255,0.0042164344,0.7263968,0.0016236939,0.0045497185],"study_design_scores_gemma":[0.000058347123,0.00005338376,0.000091761576,0.00003365713,0.000024314002,0.00013287604,0.00008961019,0.7799873,0.0014340515,0.21714571,0.00090399315,0.000045002536],"about_ca_topic_score_codex":0.0017328522,"about_ca_topic_score_gemma":0.00080274115,"teacher_disagreement_score":0.0066126795,"about_ca_system_score_codex":0.0034093119,"about_ca_system_score_gemma":0.0015773162,"threshold_uncertainty_score":0.026199996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107989475,0.0025466077,0.8720079,0.000652561,0.000105107094,0.000053826945,0.00017177197,0.00022928028,0.016243545],"genre_scores_gemma":[0.8693399,0.0024398228,0.11830359,0.00022408755,0.00021019783,0.00016214367,0.0003012496,0.00024312762,0.0087759225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.0004744356,0.00008621319,0.00020473727,0.00039639615,0.00013326346],"domain_scores_gemma":[0.98486507,0.011973038,0.0011027807,0.0005896585,0.0010694619,0.00039997097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00440316,0.0007410644,0.0007627488,0.0017080877,0.0005724767,0.0014629659,0.0014467192,0.0011245431,0.0028018195],"category_scores_gemma":[0.030358713,0.00034314377,0.0007257277,0.0011529706,0.00265131,0.0051607955,0.001753368,0.0018021805,0.00046755638],"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.000055959543,0.000015265929,0.0006494997,0.0000942203,0.000019763062,0.00011633389,0.00025238836,0.09602386,0.0022202616,0.8905716,0.00030054295,0.009680272],"study_design_scores_gemma":[0.000008817995,0.000025733405,0.00055435265,0.00003766116,0.000010343453,0.00019379954,0.00005685781,0.49493194,0.0021859766,0.50070304,0.001242532,0.000048950315],"about_ca_topic_score_codex":0.0011881742,"about_ca_topic_score_gemma":0.00060174643,"teacher_disagreement_score":0.00440316,"about_ca_system_score_codex":0.0021779456,"about_ca_system_score_gemma":0.00074474013,"threshold_uncertainty_score":0.023286402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061626425,0.00009198643,0.990956,0.000065650514,0.00002000239,0.000112479596,0.00008467312,0.00080134,0.0017052167],"genre_scores_gemma":[0.06771601,0.00011232823,0.92877537,0.00005637627,0.000014783378,0.00033536946,0.00039243326,0.00015642209,0.00244086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.00012855967,0.00005191893,0.00012654868,0.00028142345,0.00008594365],"domain_scores_gemma":[0.99884206,0.00053959043,0.00008461504,0.00015555299,0.00034095184,0.000037276117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059593254,0.0010696016,0.0008843649,0.0021558776,0.0010929159,0.0009883948,0.0014320627,0.000901668,0.004907652],"category_scores_gemma":[0.0035660486,0.0005065604,0.0006906741,0.0013525094,0.0007268812,0.0012541369,0.0016451504,0.0010516995,0.0018347673],"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.00031179056,0.00014656442,0.0015674033,0.0004057851,0.00009011197,0.00037304452,0.00049481634,0.26375455,0.025944628,0.07592497,0.007182109,0.6238043],"study_design_scores_gemma":[0.000113696275,0.00007261255,0.00023244639,0.00003960966,0.000028777009,0.00026500324,0.00007077331,0.93442273,0.010987327,0.047379497,0.0063475715,0.000039877857],"about_ca_topic_score_codex":0.0028735623,"about_ca_topic_score_gemma":0.0037148178,"teacher_disagreement_score":0.004907652,"about_ca_system_score_codex":0.0009759659,"about_ca_system_score_gemma":0.0021671546,"threshold_uncertainty_score":0.016417682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013745996,0.0009849956,0.98118144,0.00037478033,0.000053378673,0.000023139486,0.00008054375,0.00015436266,0.0034012438],"genre_scores_gemma":[0.79110444,0.0023693778,0.19986814,0.0002815457,0.00024782075,0.00013929218,0.00025654573,0.00014037944,0.0055924095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782324,0.0009859254,0.0000963599,0.00027874025,0.0006512257,0.00016455133],"domain_scores_gemma":[0.99739754,0.0017906977,0.00028820522,0.00026895362,0.00022159333,0.000032954977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019126001,0.0005877513,0.00082599354,0.0004909898,0.00031400326,0.001111906,0.0011378061,0.00089828,0.0013205884],"category_scores_gemma":[0.007945561,0.00035227602,0.00046144263,0.0011922466,0.0015349822,0.0026794155,0.00088948023,0.0012284325,0.00038469856],"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.00012491125,0.0000223627,0.00017432864,0.00009891561,0.000029510855,0.00009552276,0.000056992587,0.37594226,0.0052177617,0.59142894,0.000724923,0.026083577],"study_design_scores_gemma":[0.00002279164,0.000039877283,0.00007398845,0.000023295888,0.00001043541,0.00006825358,0.000010469262,0.8815253,0.0029841226,0.11372952,0.0014918877,0.000020030418],"about_ca_topic_score_codex":0.0016495152,"about_ca_topic_score_gemma":0.0010573348,"teacher_disagreement_score":0.0019126001,"about_ca_system_score_codex":0.00139578,"about_ca_system_score_gemma":0.0009935299,"threshold_uncertainty_score":0.010127127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08121276,0.0003509199,0.9113389,0.00012431933,0.000031408938,0.00007950339,0.00008801784,0.00060544827,0.0061687413],"genre_scores_gemma":[0.8155865,0.00035776212,0.18022591,0.00006271532,0.00002383272,0.00007411629,0.00018222201,0.000030702668,0.00345627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938023,0.00012778035,0.000031098312,0.000097808566,0.00026416173,0.00009889604],"domain_scores_gemma":[0.999298,0.0003040053,0.0000696184,0.00016477882,0.00012239728,0.000041332198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048022857,0.0005022728,0.00052940275,0.0005492174,0.00035938426,0.00073087384,0.0009303183,0.0006258126,0.0010610239],"category_scores_gemma":[0.0014447469,0.00019146544,0.0003601115,0.00061619614,0.0007047179,0.0010898878,0.0010239166,0.00077370374,0.00035277006],"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.0008058941,0.00016953956,0.0030585781,0.00031751796,0.000095233765,0.0009829397,0.00053593196,0.34886244,0.099273406,0.35338843,0.0015619632,0.19094811],"study_design_scores_gemma":[0.000025839874,0.00007110558,0.00023449311,0.00001702816,0.000023813029,0.00021331973,0.00001893992,0.95001566,0.02801409,0.019544084,0.0017957574,0.00002585104],"about_ca_topic_score_codex":0.0013774742,"about_ca_topic_score_gemma":0.0015048311,"teacher_disagreement_score":0.0013774742,"about_ca_system_score_codex":0.0008004157,"about_ca_system_score_gemma":0.0011353332,"threshold_uncertainty_score":0.0058074594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012886944,0.037948627,0.870931,0.0046303207,0.0021611394,0.000087442626,0.00024131118,0.00030748383,0.070805825],"genre_scores_gemma":[0.39230433,0.056842215,0.49977967,0.0021438708,0.005473182,0.000645262,0.00034845513,0.00034803068,0.042114943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995209,0.00014386729,0.000043339405,0.00007500729,0.0001873878,0.000029444484],"domain_scores_gemma":[0.9994992,0.00027335793,0.000061515544,0.00008016478,0.00006975299,0.000016076132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093397475,0.0008008242,0.00044041016,0.001669003,0.00060697435,0.0018482633,0.00051202555,0.0011447596,0.002614839],"category_scores_gemma":[0.0018223989,0.00034910496,0.00073075126,0.0009964762,0.0036731702,0.0029824276,0.001062241,0.0024803318,0.0010205398],"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.0000076182587,0.000015797734,0.0000674516,0.00011728381,0.0000065844324,0.000063224026,0.00019062147,0.0026739787,0.0026496802,0.97448564,0.0021402808,0.017581906],"study_design_scores_gemma":[0.000009153082,0.000055406366,0.0002634391,0.00014438246,0.000009677589,0.00033460394,0.000052790274,0.034343395,0.0026872775,0.9131945,0.048871182,0.00003420118],"about_ca_topic_score_codex":0.0006238801,"about_ca_topic_score_gemma":0.00025576318,"teacher_disagreement_score":0.002614839,"about_ca_system_score_codex":0.0009868043,"about_ca_system_score_gemma":0.00064831146,"threshold_uncertainty_score":0.008747458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005217487,0.0035410472,0.9773147,0.00044218093,0.00013761291,0.000018873105,0.000053397078,0.00011954466,0.013155207],"genre_scores_gemma":[0.5476347,0.022706684,0.4079632,0.0009481211,0.0015996837,0.00045952474,0.0004420302,0.0005295997,0.017716495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884737,0.0004467025,0.00006587398,0.00015060222,0.00036221606,0.0001272955],"domain_scores_gemma":[0.9951202,0.003369454,0.00037274268,0.00033414888,0.0007019525,0.000101456695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029674526,0.0017954081,0.0010056117,0.0024016201,0.0007031648,0.002354701,0.0010419481,0.0013901924,0.0028740007],"category_scores_gemma":[0.011203844,0.0004585043,0.001027473,0.0019835795,0.002705694,0.0039747856,0.00154845,0.0040533906,0.0013273036],"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.000020155818,0.000019013023,0.00016120233,0.00017897786,0.000018071174,0.000146371,0.00022590125,0.047788646,0.0021520092,0.92269206,0.0024286949,0.02416888],"study_design_scores_gemma":[0.0000056969907,0.000033632656,0.00017097691,0.00011533438,0.00001602297,0.00028886728,0.000109652734,0.37897703,0.0018334058,0.606313,0.012097006,0.000039373695],"about_ca_topic_score_codex":0.0009888437,"about_ca_topic_score_gemma":0.00050922495,"teacher_disagreement_score":0.0029674526,"about_ca_system_score_codex":0.001850951,"about_ca_system_score_gemma":0.0007887592,"threshold_uncertainty_score":0.015693545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07007014,0.0011588804,0.8998226,0.00053310144,0.00029833324,0.00016831735,0.00018678016,0.0011040574,0.026657782],"genre_scores_gemma":[0.53492904,0.00067169644,0.45035273,0.00055267493,0.00014249433,0.00023858531,0.0003680749,0.00016248335,0.012582258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989392,0.00025622442,0.00007987588,0.000274238,0.00029239483,0.00015810583],"domain_scores_gemma":[0.9989249,0.00030153437,0.00016184023,0.00023952952,0.00029819884,0.00007394691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570563,0.00066399976,0.00048314992,0.0008462149,0.0008161756,0.00084120914,0.0011611948,0.00095849816,0.0053596473],"category_scores_gemma":[0.0015758526,0.00030495037,0.00037757566,0.00070511556,0.0006923295,0.0014074248,0.0010311366,0.00094925606,0.002092693],"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.0009421856,0.00022064337,0.0013019376,0.0005085432,0.000062500905,0.0004068297,0.0002715309,0.030680623,0.1993137,0.30927086,0.005469347,0.45155138],"study_design_scores_gemma":[0.0003148155,0.0016925551,0.0009963567,0.00016064379,0.00013443506,0.002379494,0.00019286893,0.23946352,0.40431347,0.24020365,0.11000623,0.00014193433],"about_ca_topic_score_codex":0.00020756303,"about_ca_topic_score_gemma":0.000361349,"teacher_disagreement_score":0.0053596473,"about_ca_system_score_codex":0.0006568935,"about_ca_system_score_gemma":0.00072409154,"threshold_uncertainty_score":0.017929792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052267443,0.00031290634,0.9281102,0.00070644234,0.00007458142,0.000038188275,0.00009358337,0.0006608773,0.017735714],"genre_scores_gemma":[0.78538626,0.00046065153,0.20509136,0.00058155006,0.00018407067,0.00012087696,0.00016211851,0.00018501098,0.007828142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806124,0.0006179692,0.00006934986,0.00019185401,0.0007809215,0.00027856114],"domain_scores_gemma":[0.9979966,0.0010558243,0.00017047032,0.00041181903,0.0002980186,0.00006717339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579162,0.0007639643,0.00086906797,0.000389905,0.0005666545,0.0011671615,0.00049325085,0.0008652598,0.0014214964],"category_scores_gemma":[0.0041755466,0.00031950136,0.0005221606,0.00044468697,0.002247336,0.0011328813,0.0017053946,0.0014850292,0.0013800478],"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.0005002747,0.00019557036,0.001034538,0.00027701905,0.00005651934,0.0005006515,0.00045279486,0.2547756,0.10530481,0.49805382,0.005476509,0.13337186],"study_design_scores_gemma":[0.0000699909,0.00022806333,0.00029008513,0.00003467574,0.00001922583,0.00053957035,0.00006492005,0.6593109,0.07178238,0.2628258,0.004780226,0.000054244178],"about_ca_topic_score_codex":0.00040655,"about_ca_topic_score_gemma":0.00048099912,"teacher_disagreement_score":0.0014214964,"about_ca_system_score_codex":0.0005398927,"about_ca_system_score_gemma":0.0008983681,"threshold_uncertainty_score":0.0047554374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4238331,0.00879983,0.45341572,0.0036326635,0.00045829313,0.00011950753,0.0015809891,0.00042592568,0.10773395],"genre_scores_gemma":[0.9880784,0.0028431616,0.006087008,0.00013004564,0.00018725662,0.000102097656,0.00020793527,0.000047612677,0.002316406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.0006549624,0.0000348083,0.00016855559,0.0004505962,0.0004717603],"domain_scores_gemma":[0.9831451,0.014159907,0.00067952025,0.00058128545,0.0011447511,0.00028942875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021797328,0.0007759694,0.0010120026,0.0014764379,0.0007522302,0.0024243663,0.0014522418,0.0009258523,0.00496476],"category_scores_gemma":[0.013855253,0.0004601265,0.0003084295,0.0017536602,0.0037048054,0.003083978,0.0016441483,0.0016333285,0.0005129004],"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.0006254445,0.00007595684,0.0005579539,0.00030267864,0.000043571737,0.0003533135,0.00029934468,0.49538523,0.0051751384,0.47578105,0.0047521065,0.016648239],"study_design_scores_gemma":[0.00005551487,0.00006543877,0.00042620744,0.00013149339,0.000017023238,0.00015385395,0.00016647816,0.7938418,0.0018545734,0.20132886,0.001904781,0.00005394476],"about_ca_topic_score_codex":0.00453827,"about_ca_topic_score_gemma":0.0016398295,"teacher_disagreement_score":0.00496476,"about_ca_system_score_codex":0.0029721034,"about_ca_system_score_gemma":0.0016946847,"threshold_uncertainty_score":0.021564186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8413232,0.0016794694,0.07412651,0.00093311904,0.00027833477,0.0000545299,0.0006897457,0.00034169303,0.08057341],"genre_scores_gemma":[0.98134494,0.00083134836,0.0095931515,0.000082010374,0.000118690186,0.000035000132,0.00032711244,0.000091834474,0.007575883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949515,0.00007011625,0.000027938106,0.00008527913,0.00020769137,0.00011384107],"domain_scores_gemma":[0.99897015,0.00050798495,0.00022629276,0.00010511874,0.00010976886,0.00008063685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575909,0.000567979,0.00041010347,0.0022726064,0.00057737395,0.0016612839,0.0005209121,0.00029341312,0.0055222316],"category_scores_gemma":[0.005247011,0.0002155487,0.0003141003,0.001745851,0.0016473118,0.0028423974,0.0011617319,0.0011179455,0.0013308611],"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.00030059504,0.000089498164,0.00385968,0.00020116068,0.00002463393,0.00060909084,0.00048605117,0.015835293,0.010266076,0.9076905,0.004440944,0.056196418],"study_design_scores_gemma":[0.000036365975,0.000055319862,0.0030280382,0.00012785195,0.000025251382,0.0008954685,0.00022389552,0.035340495,0.022546915,0.92650604,0.011132702,0.00008158159],"about_ca_topic_score_codex":0.0006744511,"about_ca_topic_score_gemma":0.00078469544,"teacher_disagreement_score":0.0055222316,"about_ca_system_score_codex":0.0010371647,"about_ca_system_score_gemma":0.0008050262,"threshold_uncertainty_score":0.018473685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069861695,0.009561208,0.83781135,0.0019129766,0.00016485913,0.000065141794,0.0005129338,0.00035753546,0.079752214],"genre_scores_gemma":[0.9475246,0.006634248,0.038136996,0.0005692921,0.00061014417,0.0003168576,0.00033455182,0.00017743903,0.0056957835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977585,0.0007227658,0.000052494997,0.00026233357,0.00065067847,0.0005531753],"domain_scores_gemma":[0.9841949,0.012358909,0.00096724066,0.00071848446,0.0013871515,0.00037333329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030266333,0.0014734651,0.001069079,0.0020916795,0.0009509017,0.0027968984,0.0015733952,0.0008943123,0.0037748774],"category_scores_gemma":[0.016611123,0.00045650842,0.00076343236,0.001705819,0.0043004556,0.0033763812,0.0025534555,0.0024622725,0.0007896154],"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.00014931512,0.000040689465,0.0003587781,0.00026863933,0.00004652044,0.00026989376,0.00042469587,0.17484117,0.0035594534,0.8032281,0.0033723086,0.013440432],"study_design_scores_gemma":[0.00002176536,0.00005349238,0.00047492405,0.00021088017,0.000040423056,0.00024850765,0.00016029475,0.52544475,0.0028914672,0.4650869,0.005304053,0.00006256016],"about_ca_topic_score_codex":0.003899743,"about_ca_topic_score_gemma":0.0013206525,"teacher_disagreement_score":0.003899743,"about_ca_system_score_codex":0.0025444855,"about_ca_system_score_gemma":0.0014705132,"threshold_uncertainty_score":0.018461645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019097494,0.00031769404,0.97704816,0.00022409728,0.000022435035,0.000036631507,0.000065005894,0.00011193943,0.0030766076],"genre_scores_gemma":[0.71511936,0.00038907188,0.2765678,0.00018386291,0.000033998185,0.00016428028,0.00018265599,0.00009100417,0.0072681005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992963,0.00023682625,0.000025961786,0.00014404116,0.00021707106,0.00007982994],"domain_scores_gemma":[0.9989029,0.0006549587,0.00014239726,0.000060524548,0.00020142992,0.000037655558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575894,0.00083271717,0.00093612,0.00034580153,0.00024727153,0.0011091152,0.0008107866,0.0007617144,0.0030672404],"category_scores_gemma":[0.0030535692,0.0004993677,0.0003017569,0.0005503658,0.00087215396,0.0014269943,0.0007234066,0.0008148611,0.00044334502],"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.00017325945,0.000028241779,0.0002495764,0.000120646415,0.000023227376,0.000053744363,0.000037464444,0.9166462,0.0052010245,0.046492707,0.0009989466,0.02997502],"study_design_scores_gemma":[0.00002070846,0.00003109645,0.00003192996,0.0000053271137,0.0000030348522,0.000010008238,0.0000048424977,0.99378926,0.00077622157,0.004945933,0.00037714423,0.0000044999247],"about_ca_topic_score_codex":0.0017458999,"about_ca_topic_score_gemma":0.0014420769,"teacher_disagreement_score":0.0030672404,"about_ca_system_score_codex":0.0015009579,"about_ca_system_score_gemma":0.001240002,"threshold_uncertainty_score":0.010890305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012506215,0.00015561127,0.98509175,0.00005396909,0.00002097495,0.00002887226,0.00002560855,0.00006190018,0.0020550983],"genre_scores_gemma":[0.40139797,0.0003356213,0.5957888,0.00009936466,0.000045967772,0.00017842808,0.0001129761,0.000045981054,0.0019949123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00032852794,0.000045050478,0.00016197174,0.00032270903,0.000093152805],"domain_scores_gemma":[0.99913764,0.00027633752,0.00017274564,0.0001751111,0.00019552444,0.00004255646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000784244,0.0008339058,0.0006179944,0.00048143166,0.0004146757,0.00070789224,0.00062508835,0.0006148823,0.0013621994],"category_scores_gemma":[0.002410832,0.0003060239,0.00050286105,0.0006925731,0.0008782466,0.001169107,0.0010860985,0.00078573223,0.00046599665],"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.0002776168,0.000059083683,0.00059299974,0.00015424567,0.00004992694,0.00017204264,0.0003308862,0.32719985,0.061278515,0.42233226,0.0014370185,0.18611562],"study_design_scores_gemma":[0.00004679674,0.00038701887,0.00020367239,0.000047547735,0.000019965179,0.0002893231,0.000060467715,0.89577293,0.02977216,0.065926895,0.007414646,0.00005850278],"about_ca_topic_score_codex":0.00050363963,"about_ca_topic_score_gemma":0.0005263072,"teacher_disagreement_score":0.0013621994,"about_ca_system_score_codex":0.0005097951,"about_ca_system_score_gemma":0.0007773364,"threshold_uncertainty_score":0.0045570135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011354933,0.0006052615,0.97486556,0.00043782694,0.00008450671,0.00003629995,0.00013978757,0.00010067744,0.012375202],"genre_scores_gemma":[0.7714173,0.0024649063,0.20828275,0.0005650304,0.0003936357,0.00038294867,0.00072391646,0.00016744873,0.015601964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831414,0.00049843534,0.000072012495,0.00022677434,0.0006067731,0.00028183253],"domain_scores_gemma":[0.9925014,0.0052701794,0.00047486692,0.0005150089,0.0010384825,0.00020001293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695343,0.0015684046,0.0014901934,0.0011968326,0.00060409936,0.002644241,0.0019341836,0.0015409323,0.006459825],"category_scores_gemma":[0.0127858,0.0004200161,0.0006326869,0.0015413294,0.0018481305,0.0028375715,0.0037409144,0.0025910076,0.0015446013],"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.00022029583,0.0000526494,0.00043178332,0.00032645417,0.00003979089,0.00028021165,0.00014266228,0.20394686,0.0069257114,0.74186355,0.0040132552,0.04175682],"study_design_scores_gemma":[0.000030466437,0.00007902385,0.0001414988,0.00008420553,0.000020353229,0.00025998225,0.00004672721,0.80983394,0.005876768,0.18095592,0.002632269,0.00003888954],"about_ca_topic_score_codex":0.00066533574,"about_ca_topic_score_gemma":0.0005713688,"teacher_disagreement_score":0.006459825,"about_ca_system_score_codex":0.0010451892,"about_ca_system_score_gemma":0.0011474179,"threshold_uncertainty_score":0.02161032},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11330356,0.0002754475,0.87347376,0.0022947972,0.000106939515,0.00025142907,0.0006976585,0.00060861715,0.008987769],"genre_scores_gemma":[0.8725841,0.00036185866,0.12116999,0.00054506806,0.00025534965,0.00031445888,0.0011310143,0.0002709373,0.0033672242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921686,0.0031339317,0.0003042383,0.0017426239,0.0017703506,0.00088026625],"domain_scores_gemma":[0.92819536,0.049550623,0.0047106883,0.011578642,0.004098314,0.0018663845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004701847,0.0009030797,0.0015894807,0.0013404582,0.0020602255,0.0029527743,0.0026342385,0.0019304244,0.0062596193],"category_scores_gemma":[0.049738616,0.001114194,0.0016363895,0.0015380058,0.005407323,0.0096899,0.005334824,0.0050462545,0.0010209326],"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.0010777537,0.00032159692,0.0052763447,0.00031495767,0.00013808093,0.00086476316,0.0010250432,0.1571856,0.010131093,0.76023406,0.008376829,0.055053808],"study_design_scores_gemma":[0.000114789684,0.000091804075,0.0008059583,0.000036632802,0.000022480848,0.00025398395,0.00016375621,0.39000255,0.0036437288,0.60256284,0.002246017,0.000055515127],"about_ca_topic_score_codex":0.0027561844,"about_ca_topic_score_gemma":0.0022614272,"teacher_disagreement_score":0.0062596193,"about_ca_system_score_codex":0.001243513,"about_ca_system_score_gemma":0.0022101705,"threshold_uncertainty_score":0.024866045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023921554,0.00012742123,0.99648213,0.0000885534,0.000019937585,0.000030901585,0.00003279668,0.00014853527,0.00067756145],"genre_scores_gemma":[0.11812557,0.0007124204,0.8777672,0.00018258854,0.00015047567,0.00037270194,0.0003065789,0.00022258701,0.002159861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828714,0.00070708815,0.00010268111,0.00032585062,0.00043663263,0.00014057054],"domain_scores_gemma":[0.98960507,0.008242859,0.00052432984,0.00062674045,0.00086166133,0.00013929537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024144172,0.001489833,0.0013250079,0.0014666888,0.0007236669,0.0013192791,0.0021134475,0.0015264112,0.0031267146],"category_scores_gemma":[0.014982061,0.0009297334,0.0011661857,0.0016203801,0.0016156737,0.0039272234,0.002701248,0.003074709,0.0010931138],"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.0002969264,0.00011509759,0.0006871143,0.00034898086,0.00009523743,0.00014595172,0.00030717495,0.5501659,0.009481467,0.22105622,0.002782968,0.21451688],"study_design_scores_gemma":[0.000016252474,0.000043427182,0.00006512463,0.000016747525,0.000007381814,0.000041733812,0.000015583635,0.9547666,0.0019388649,0.04199309,0.0010805387,0.000014685098],"about_ca_topic_score_codex":0.0022882551,"about_ca_topic_score_gemma":0.002053514,"teacher_disagreement_score":0.0031267146,"about_ca_system_score_codex":0.0010822363,"about_ca_system_score_gemma":0.0018091567,"threshold_uncertainty_score":0.012768805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036392286,0.002787866,0.8858837,0.0007469658,0.0005299049,0.00035010852,0.0005780246,0.005593731,0.06713752],"genre_scores_gemma":[0.6447849,0.002161541,0.29261714,0.0009792492,0.00040626744,0.00034533307,0.0009911443,0.00036958136,0.05734484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.000096971366,0.00004601014,0.00016580189,0.00023198705,0.00009439056],"domain_scores_gemma":[0.99945897,0.00012717124,0.000072114955,0.0001752919,0.0001438422,0.000022710703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031787282,0.00053895585,0.0003815699,0.00060189125,0.0005329542,0.0010854764,0.0007109275,0.0005449067,0.013381337],"category_scores_gemma":[0.0013142651,0.0002592062,0.00051243056,0.0007874952,0.00078294287,0.0019233824,0.0010857577,0.0009994064,0.005762615],"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.0005574672,0.00011995582,0.00049685943,0.0005744577,0.000040700663,0.00035911187,0.00029134468,0.010800006,0.093109526,0.41759202,0.01006211,0.46599644],"study_design_scores_gemma":[0.0002357979,0.0010332969,0.00074570946,0.00018257003,0.00012228113,0.0019774642,0.00014893801,0.07427359,0.26046455,0.37725043,0.28343028,0.00013500465],"about_ca_topic_score_codex":0.00025004012,"about_ca_topic_score_gemma":0.00036615613,"teacher_disagreement_score":0.013381337,"about_ca_system_score_codex":0.00053157477,"about_ca_system_score_gemma":0.00057115156,"threshold_uncertainty_score":0.044764996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0483336,0.0005714174,0.9427486,0.00017986416,0.00004318761,0.000020738446,0.00006821361,0.00013169224,0.007902685],"genre_scores_gemma":[0.9150748,0.0007293938,0.08266639,0.00006332954,0.00004307322,0.00006385315,0.000048388407,0.000018007584,0.0012927582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939454,0.00021670932,0.000019721776,0.000075329684,0.00016559094,0.00012800514],"domain_scores_gemma":[0.9973099,0.0016317443,0.0003640813,0.00031745984,0.00026969382,0.00010721543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009255008,0.0008148472,0.0006337306,0.00034569026,0.00042116962,0.0009887867,0.0009342226,0.00062607066,0.000937295],"category_scores_gemma":[0.0041537066,0.0003538312,0.0003618328,0.0007815976,0.0010200212,0.0017274176,0.0014392396,0.0009637497,0.0002333807],"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.00012773891,0.000036279424,0.0007112667,0.00009207218,0.00004349522,0.00027512695,0.00013250632,0.88509005,0.011735044,0.07921293,0.0006065922,0.02193697],"study_design_scores_gemma":[0.000008648697,0.0000561395,0.00014069362,0.000011043911,0.0000112103635,0.00009436297,0.000026307636,0.97413,0.0016953946,0.023155326,0.00065424247,0.00001668451],"about_ca_topic_score_codex":0.0009873944,"about_ca_topic_score_gemma":0.0009053723,"teacher_disagreement_score":0.0009887867,"about_ca_system_score_codex":0.00074641866,"about_ca_system_score_gemma":0.0004169885,"threshold_uncertainty_score":0.0054156184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026412427,0.0024588767,0.95479596,0.00049792445,0.00028580116,0.000055491066,0.00012488468,0.00025921513,0.015109449],"genre_scores_gemma":[0.48598525,0.002311157,0.49773183,0.0005242858,0.00033281537,0.00023893437,0.0003300262,0.00009752338,0.012448119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948007,0.0001551634,0.000026479816,0.000048923142,0.00024296988,0.00004649751],"domain_scores_gemma":[0.99933547,0.000198901,0.00007838331,0.00019574956,0.00016933185,0.000022226126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004176672,0.0003803507,0.00023882686,0.00034250302,0.00032625065,0.00049856986,0.0003484099,0.000528789,0.0029817983],"category_scores_gemma":[0.0016842072,0.00014133964,0.00027079965,0.00051428826,0.00046759692,0.00069253176,0.000448409,0.0006616902,0.0010743262],"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.00022226282,0.000046286365,0.0005182525,0.00026677657,0.000045265744,0.00014576776,0.000202956,0.07677529,0.061930392,0.6341711,0.0044136005,0.22126204],"study_design_scores_gemma":[0.00009451472,0.00044173477,0.00089133874,0.00017455367,0.000049631035,0.0012855086,0.00004654887,0.5753822,0.05820682,0.24694604,0.11638241,0.00009879595],"about_ca_topic_score_codex":0.00038815083,"about_ca_topic_score_gemma":0.00067754317,"teacher_disagreement_score":0.0029817983,"about_ca_system_score_codex":0.00041672602,"about_ca_system_score_gemma":0.00065527746,"threshold_uncertainty_score":0.009975135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068936825,0.00051916856,0.91358435,0.00031630142,0.00011723395,0.00013882486,0.00017392589,0.0012407746,0.014972667],"genre_scores_gemma":[0.41241965,0.0005398778,0.57826865,0.00018715308,0.00008624003,0.0001521377,0.00043219005,0.00025296494,0.00766111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916077,0.00020860489,0.000042809497,0.0000842378,0.00039279315,0.00011077348],"domain_scores_gemma":[0.99872714,0.0005396971,0.00008230172,0.00038975268,0.00021277848,0.000048391543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008458372,0.00093556364,0.0005907011,0.00068534276,0.0006082269,0.0006764044,0.0008570048,0.00041973492,0.004474969],"category_scores_gemma":[0.0033824216,0.00023101959,0.0006298372,0.00076300465,0.000695031,0.0011858704,0.001586221,0.0015077781,0.001651111],"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.0011247076,0.00020172475,0.0017190706,0.00045579753,0.00006081678,0.00089699106,0.00040371565,0.08506229,0.11191632,0.33092034,0.0059245583,0.4613136],"study_design_scores_gemma":[0.000085089705,0.00046741933,0.00084973144,0.0001138878,0.00007040662,0.0010539155,0.00012775938,0.6506918,0.18302734,0.14109989,0.022307975,0.000104741404],"about_ca_topic_score_codex":0.0008480578,"about_ca_topic_score_gemma":0.0016748275,"teacher_disagreement_score":0.004474969,"about_ca_system_score_codex":0.0005365052,"about_ca_system_score_gemma":0.0015759298,"threshold_uncertainty_score":0.014970243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054547407,0.006533415,0.8773095,0.0022414045,0.0002054369,0.000082589075,0.00044292517,0.00022348634,0.05841382],"genre_scores_gemma":[0.8960351,0.010868862,0.077388175,0.00073870947,0.00082129013,0.00029207402,0.00059583544,0.0006073521,0.01265256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960025,0.0019858335,0.00016130337,0.0004502053,0.0009482667,0.0004518195],"domain_scores_gemma":[0.96258336,0.030679587,0.0017149734,0.0019181875,0.0026470963,0.00045676893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058208345,0.0019490562,0.0016615363,0.0022755188,0.001055387,0.003971951,0.0016272655,0.0010905152,0.0028536506],"category_scores_gemma":[0.029973745,0.0007948834,0.0013281779,0.0021646875,0.006067498,0.0045697237,0.0026717593,0.0036958174,0.0009620361],"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.00008767512,0.00002151688,0.0008118616,0.00016261422,0.000047397418,0.0002979321,0.0002976538,0.1967427,0.0018619596,0.784742,0.002247265,0.01267945],"study_design_scores_gemma":[0.000013870131,0.000049198654,0.00091287174,0.00011144757,0.000023704853,0.00019383858,0.000095146694,0.48745942,0.0021616495,0.5048435,0.00409173,0.000043727483],"about_ca_topic_score_codex":0.0030258335,"about_ca_topic_score_gemma":0.0013074552,"teacher_disagreement_score":0.0058208345,"about_ca_system_score_codex":0.0033122322,"about_ca_system_score_gemma":0.0011399965,"threshold_uncertainty_score":0.030783892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04924965,0.0009906538,0.9398489,0.0006031978,0.000043874697,0.00004011784,0.000113625974,0.00011649339,0.0089934645],"genre_scores_gemma":[0.85647243,0.0016517761,0.13772725,0.00022894717,0.00010969145,0.00011875006,0.00025333467,0.00012469431,0.003313106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764496,0.0011074713,0.00008980897,0.00025045458,0.0006017056,0.00030563495],"domain_scores_gemma":[0.9924631,0.0060995356,0.0003959148,0.00042967766,0.00044591312,0.00016587847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031890932,0.0011609868,0.0012452091,0.00084677787,0.0006810303,0.0016214418,0.0010253472,0.0012261611,0.0017644521],"category_scores_gemma":[0.014964718,0.0006270604,0.0004929136,0.0011651337,0.00311841,0.0035325193,0.0026557469,0.0020933861,0.00040543577],"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.00019522138,0.000039276045,0.00050650747,0.00010095934,0.000031541942,0.000052424995,0.00010164606,0.81625235,0.0014747295,0.16605176,0.0009394732,0.014254139],"study_design_scores_gemma":[0.000014822859,0.000036774327,0.00014167839,0.000020694992,0.000008013662,0.000041080202,0.000027352506,0.89245003,0.001346509,0.10534053,0.00056163204,0.000010941508],"about_ca_topic_score_codex":0.0017515945,"about_ca_topic_score_gemma":0.0013308414,"teacher_disagreement_score":0.0031890932,"about_ca_system_score_codex":0.0026168025,"about_ca_system_score_gemma":0.0017129822,"threshold_uncertainty_score":0.018986344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028308762,0.0043760915,0.87543464,0.0017139398,0.0004208185,0.0000795725,0.000236913,0.00019395948,0.08923541],"genre_scores_gemma":[0.80664694,0.004907678,0.1525598,0.00057106675,0.00041413392,0.00023238151,0.00032988723,0.000083540705,0.034254555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999561,0.00017614623,0.0000132814575,0.000064409585,0.00011627043,0.00006889886],"domain_scores_gemma":[0.99917346,0.00053366926,0.00003882591,0.000075419826,0.00013412892,0.000044458717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383799,0.00036167435,0.00054649235,0.00066716375,0.00061517744,0.0010976733,0.0008688242,0.0009223766,0.0073488383],"category_scores_gemma":[0.0019176414,0.00023667971,0.00032710368,0.0006798111,0.0009824436,0.0012550182,0.0013956552,0.0012940044,0.0007507978],"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.00006564629,0.000020950103,0.0001280159,0.00012364918,0.000011066334,0.000103104976,0.0001376187,0.05396998,0.0013600995,0.9176779,0.0051084375,0.021293597],"study_design_scores_gemma":[0.0000457481,0.000054248932,0.00009579364,0.000044506734,0.000009702424,0.00016714357,0.000120079756,0.44570076,0.0010281933,0.53490674,0.017800855,0.000026286412],"about_ca_topic_score_codex":0.0014978538,"about_ca_topic_score_gemma":0.0014226272,"teacher_disagreement_score":0.0073488383,"about_ca_system_score_codex":0.0011387694,"about_ca_system_score_gemma":0.0007997802,"threshold_uncertainty_score":0.024584293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1347973,0.00013485888,0.8630987,0.00028906277,0.000021666769,0.000030204596,0.00007409176,0.00013088273,0.0014232926],"genre_scores_gemma":[0.95433384,0.00018717226,0.043492842,0.00005902029,0.000020376801,0.000039768358,0.0000805799,0.000025077068,0.0017612705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00012944372,0.000013270606,0.00014371058,0.00009975257,0.000059544822],"domain_scores_gemma":[0.9979519,0.001401236,0.00026413662,0.00015520182,0.0001623699,0.00006523229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009894586,0.0004324511,0.0005154384,0.00058100134,0.00032974285,0.0006469955,0.0011476732,0.0008359171,0.00055421307],"category_scores_gemma":[0.006077113,0.0002959904,0.00041169755,0.000530459,0.0009803846,0.0014584534,0.00057715253,0.00075519114,0.0001374499],"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.000058277776,0.00002575141,0.0013239052,0.000034691002,0.000023328581,0.0001274647,0.00007723821,0.9139671,0.0055928403,0.06578118,0.00030092,0.012687402],"study_design_scores_gemma":[0.0000020892892,0.000006758647,0.00012856413,0.0000014717828,0.0000022997617,0.000014787774,0.0000041226617,0.994412,0.00038684564,0.0049418826,0.000095839634,0.0000033297365],"about_ca_topic_score_codex":0.0054247407,"about_ca_topic_score_gemma":0.0036683502,"teacher_disagreement_score":0.0054247407,"about_ca_system_score_codex":0.0013068719,"about_ca_system_score_gemma":0.00067581004,"threshold_uncertainty_score":0.010786355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003980193,0.0018870436,0.9869767,0.0005774879,0.00008721075,0.00004869328,0.00013132248,0.00011979899,0.006191592],"genre_scores_gemma":[0.49724102,0.013634875,0.46650958,0.0007799716,0.0014751173,0.00058707927,0.0012415935,0.00037809502,0.018152712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651045,0.0013204977,0.00016973664,0.00045617452,0.0013068005,0.00023623428],"domain_scores_gemma":[0.9908319,0.0062093013,0.00059566245,0.00089241046,0.0013490876,0.00012159286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004928641,0.0013678402,0.0013388691,0.0028141313,0.0005301784,0.003307246,0.002441305,0.0016609567,0.0036041474],"category_scores_gemma":[0.019447662,0.00048441114,0.0010622304,0.0037120413,0.0020121855,0.005249632,0.0016174767,0.0029885622,0.0010733292],"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.0000978462,0.000033763696,0.00033633914,0.00014346583,0.000030965675,0.000063564774,0.00007414655,0.103348956,0.00094574905,0.8355147,0.0025194986,0.05689102],"study_design_scores_gemma":[0.0000114004915,0.000061690276,0.00017217144,0.000047269004,0.000018104989,0.0001430603,0.000022063577,0.7367802,0.0012374775,0.2580068,0.0034720895,0.000027653978],"about_ca_topic_score_codex":0.003692372,"about_ca_topic_score_gemma":0.0013906652,"teacher_disagreement_score":0.004928641,"about_ca_system_score_codex":0.003842237,"about_ca_system_score_gemma":0.0021876425,"threshold_uncertainty_score":0.02787751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4354411,0.009475715,0.5045261,0.011648137,0.00063040643,0.0001163341,0.0010674995,0.00096884137,0.036125798],"genre_scores_gemma":[0.9178588,0.0023042515,0.075526275,0.0010002737,0.0002796225,0.00007349335,0.0003959651,0.0002422369,0.0023189646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923929,0.002878143,0.00036356464,0.00091915607,0.002878106,0.0005681269],"domain_scores_gemma":[0.977969,0.013099518,0.0019260304,0.002470987,0.0039817174,0.00055264385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065739867,0.0005337862,0.0015484449,0.0017701371,0.0013816409,0.0031826952,0.0009962906,0.0027054674,0.0014957628],"category_scores_gemma":[0.046415612,0.00039452314,0.00044963852,0.0019087555,0.003903405,0.003941809,0.0011115205,0.00085117295,0.000800031],"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.0011565961,0.00013345057,0.030070992,0.0006565818,0.00058783527,0.00059318356,0.0009432595,0.32696232,0.01833387,0.39963236,0.015134126,0.20579532],"study_design_scores_gemma":[0.00008665723,0.0004096512,0.007950795,0.00028769646,0.00013951326,0.0023657726,0.0010691952,0.51562107,0.020190319,0.43962875,0.011978915,0.00027171845],"about_ca_topic_score_codex":0.0038725464,"about_ca_topic_score_gemma":0.0039057843,"teacher_disagreement_score":0.0065739867,"about_ca_system_score_codex":0.0022838481,"about_ca_system_score_gemma":0.0035096619,"threshold_uncertainty_score":0.034766972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20871787,0.0023470952,0.771473,0.00082220696,0.00009987782,0.0000422014,0.0006997846,0.0003815549,0.015416444],"genre_scores_gemma":[0.99144274,0.0010667442,0.005582343,0.000059823436,0.00011167091,0.000038823116,0.00014207028,0.000033070988,0.0015227279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803513,0.0005197484,0.00007511911,0.00031384488,0.00065769494,0.00039852262],"domain_scores_gemma":[0.9907476,0.0066941525,0.0009505738,0.00062638393,0.0008223229,0.00015901492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017231462,0.000709405,0.0011351602,0.00082878093,0.0004936417,0.0014100295,0.0006805611,0.0007512036,0.0013066069],"category_scores_gemma":[0.010262871,0.00035578324,0.00046194345,0.0012945808,0.0017223704,0.0022093966,0.0012303459,0.0010650236,0.0002083657],"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.000101011196,0.00001301853,0.0016456258,0.00010187618,0.00003181773,0.00034781615,0.00009624071,0.9226052,0.002187781,0.064655825,0.00078967103,0.0074242004],"study_design_scores_gemma":[0.0000042806423,0.000027066055,0.001220317,0.000016523023,0.000013520804,0.00013611815,0.00004001221,0.96667796,0.0007087507,0.030712513,0.00042297874,0.000020053796],"about_ca_topic_score_codex":0.0026613038,"about_ca_topic_score_gemma":0.0012145147,"teacher_disagreement_score":0.0026613038,"about_ca_system_score_codex":0.0015509747,"about_ca_system_score_gemma":0.0008732616,"threshold_uncertainty_score":0.0112531185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46329746,0.0007494296,0.4769918,0.0013841507,0.00013562801,0.0000750253,0.0003250258,0.00047783492,0.056563456],"genre_scores_gemma":[0.96960145,0.00020622446,0.026657706,0.00015817418,0.000072412586,0.00007376105,0.000067204666,0.000057083853,0.0031059615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985092,0.00047116168,0.0000580718,0.00026562842,0.00042543304,0.00027049572],"domain_scores_gemma":[0.9962787,0.0021777125,0.00032836912,0.00059399265,0.00031250328,0.0003087656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017053158,0.0006364238,0.0006157327,0.0013980649,0.0011310332,0.0024632027,0.0010999511,0.0010058369,0.0038876957],"category_scores_gemma":[0.0045128874,0.0004709696,0.00065002276,0.0009783645,0.0050142673,0.0057311654,0.0026926193,0.0025169034,0.00032789801],"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.000038291317,0.00001885927,0.00013071342,0.000020821211,0.0000060252387,0.00003581138,0.00006702715,0.010570253,0.0015199181,0.9850814,0.00033605477,0.0021747896],"study_design_scores_gemma":[0.000020180496,0.00003282936,0.00022722901,0.000014392395,0.000009766908,0.00007450478,0.000047434052,0.10713735,0.0023824652,0.8888376,0.0011863847,0.000029897],"about_ca_topic_score_codex":0.00056223274,"about_ca_topic_score_gemma":0.0005033612,"teacher_disagreement_score":0.0038876957,"about_ca_system_score_codex":0.0017807294,"about_ca_system_score_gemma":0.00095957826,"threshold_uncertainty_score":0.013005614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010329071,0.00039616565,0.9847718,0.00017945153,0.000024212766,0.000020052425,0.00005687692,0.000029903396,0.00419249],"genre_scores_gemma":[0.77056676,0.0025988922,0.22189716,0.00025912203,0.00021647791,0.00028431832,0.00022287815,0.0000479435,0.0039064237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.00048447412,0.00002804995,0.00010369207,0.0002532139,0.00011245465],"domain_scores_gemma":[0.9988066,0.00067504134,0.00014240674,0.00013120852,0.00018125605,0.00006355463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010044723,0.0011113145,0.0005609732,0.00048538615,0.00027251735,0.001014513,0.0005158657,0.00065843883,0.0012488985],"category_scores_gemma":[0.002634513,0.00040426422,0.00050793664,0.00078464614,0.0011039176,0.0012309467,0.0009079865,0.000972935,0.0003630001],"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.000076854616,0.000042069256,0.00065346574,0.000106894564,0.000028268272,0.00008000201,0.00009711776,0.6788635,0.008151848,0.26910797,0.0014010716,0.04139084],"study_design_scores_gemma":[0.000009103802,0.00007090451,0.00021243125,0.000023837581,0.0000064705655,0.000047499645,0.00003315842,0.9168879,0.0012680979,0.080072746,0.0013534004,0.000014537795],"about_ca_topic_score_codex":0.0009001413,"about_ca_topic_score_gemma":0.0008202216,"teacher_disagreement_score":0.0012488985,"about_ca_system_score_codex":0.0008059569,"about_ca_system_score_gemma":0.0006073913,"threshold_uncertainty_score":0.0058476925},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04034106,0.00028604266,0.95660937,0.00019296173,0.000017865874,0.00006111518,0.00004233995,0.00020670149,0.002242519],"genre_scores_gemma":[0.62836,0.00083406945,0.36773857,0.00016786365,0.00004865072,0.00022485282,0.00013631738,0.00011671225,0.0023730306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988255,0.0005138799,0.00005052492,0.0001274611,0.0003841342,0.000098522105],"domain_scores_gemma":[0.99679947,0.0021249764,0.00026301964,0.0004700428,0.00027176063,0.00007078444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280945,0.0006516998,0.000635517,0.0005023621,0.00062775705,0.0006276808,0.00064521004,0.00070440094,0.0010348418],"category_scores_gemma":[0.009426466,0.000415069,0.00031553497,0.0005280551,0.001504551,0.0015251988,0.0010779373,0.00091709103,0.000327873],"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.00016414093,0.00003769593,0.0007828784,0.00018230603,0.000031281554,0.000073969364,0.00034078877,0.6814886,0.013730546,0.24508761,0.00076085917,0.057319343],"study_design_scores_gemma":[0.000028920418,0.00005884391,0.00011362045,0.000023776312,0.000010657639,0.00005044354,0.000021727445,0.93176246,0.006979093,0.05894469,0.001989213,0.000016549338],"about_ca_topic_score_codex":0.0013639027,"about_ca_topic_score_gemma":0.0017039859,"teacher_disagreement_score":0.0017280945,"about_ca_system_score_codex":0.0010643105,"about_ca_system_score_gemma":0.0010443472,"threshold_uncertainty_score":0.009139121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51200324,0.0014917488,0.420444,0.00053537684,0.00030985233,0.00010928328,0.00025034393,0.0004326046,0.06442358],"genre_scores_gemma":[0.90818864,0.00061000953,0.07438147,0.000171042,0.00017641172,0.000081071914,0.00024685825,0.00008705805,0.01605747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930465,0.00016138842,0.000037788148,0.00010737281,0.0002558102,0.0001330847],"domain_scores_gemma":[0.9981963,0.00059972616,0.0003390782,0.0002686028,0.00044578852,0.00015054454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045218586,0.00042220994,0.00029150146,0.0015246086,0.0008352435,0.0010482321,0.0003690536,0.00077854324,0.0024826569],"category_scores_gemma":[0.0026977372,0.00026199291,0.0003406152,0.00096805295,0.0012922013,0.0012467336,0.0009961354,0.0010087932,0.00059960556],"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.00018545355,0.000046383644,0.00080082484,0.000100352765,0.000016945984,0.0003710311,0.0002967077,0.011481859,0.017074814,0.9361217,0.0014759506,0.032027934],"study_design_scores_gemma":[0.00004539503,0.00018091722,0.00093209284,0.00007300312,0.00001883384,0.0015616094,0.00015532762,0.097215295,0.046156336,0.836184,0.017377472,0.00009973662],"about_ca_topic_score_codex":0.0005772851,"about_ca_topic_score_gemma":0.00061135745,"teacher_disagreement_score":0.0024826569,"about_ca_system_score_codex":0.00063575845,"about_ca_system_score_gemma":0.00046929513,"threshold_uncertainty_score":0.008305311},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018745298,0.0025759835,0.0023278862,0.04699819,0.9333293,0.000049196686,0.000632311,0.00032222632,0.013577379],"genre_scores_gemma":[0.01361364,0.015052352,0.009764956,0.12548353,0.3992605,0.000265015,0.004337732,0.0018759422,0.43034634],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969668,0.0005840635,0.0004614708,0.00044496986,0.0013042266,0.0002385091],"domain_scores_gemma":[0.99287647,0.0015235932,0.00043682597,0.0005293482,0.004281085,0.00035260394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024628735,0.0024428032,0.0016548566,0.0033456436,0.0038763573,0.0030331411,0.0032588681,0.0049259663,0.042098485],"category_scores_gemma":[0.019266699,0.00094789045,0.0014592739,0.0024476247,0.002088786,0.0033193189,0.0016077781,0.00719731,0.02814621],"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.00004377326,0.0000052928913,0.000021982616,0.00005186616,0.00000701888,0.000090182286,0.0000110606825,0.000042347026,0.00008812724,0.0014075531,0.99523664,0.0029941823],"study_design_scores_gemma":[0.000031875174,0.000046371824,0.00056015333,0.00022223458,0.000030247615,0.00023669474,0.00003704298,0.00053615845,0.00050798635,0.0035009852,0.99424356,0.000046708075],"about_ca_topic_score_codex":0.012255612,"about_ca_topic_score_gemma":0.020865507,"teacher_disagreement_score":0.042098485,"about_ca_system_score_codex":0.00382446,"about_ca_system_score_gemma":0.0026583956,"threshold_uncertainty_score":0.1408335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07909833,0.00023976756,0.90626174,0.00019539532,0.00002568015,0.00007310503,0.00021565348,0.00055456517,0.01333573],"genre_scores_gemma":[0.56916404,0.00021587189,0.4234905,0.00017169029,0.000016786022,0.000116379044,0.0002441582,0.00008922861,0.006491452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963367,0.00007375236,0.000015194774,0.000064263084,0.00016791331,0.000045141183],"domain_scores_gemma":[0.99945337,0.00015451235,0.00006345015,0.00015376648,0.00014139085,0.000033429853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003056402,0.0002256389,0.00014653115,0.00029775428,0.0002969268,0.00037145393,0.00051512325,0.00036951038,0.0015922299],"category_scores_gemma":[0.0009967757,0.00016588687,0.00020447903,0.00042500166,0.00053760246,0.00038999124,0.00043996584,0.00051604916,0.00039001246],"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.00016782452,0.00005708466,0.0019568817,0.00022905314,0.000020272084,0.00031648364,0.000301667,0.370564,0.20946468,0.31633744,0.0027069005,0.097877726],"study_design_scores_gemma":[0.00003731072,0.00015834352,0.0016062225,0.000027874492,0.000019138994,0.00034722453,0.00005756499,0.8280448,0.084465854,0.06800054,0.017194824,0.00004028976],"about_ca_topic_score_codex":0.001935881,"about_ca_topic_score_gemma":0.0037572428,"teacher_disagreement_score":0.001935881,"about_ca_system_score_codex":0.0008234713,"about_ca_system_score_gemma":0.0008094168,"threshold_uncertainty_score":0.00597471},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060074706,0.0020063093,0.91837025,0.00040629547,0.00020926468,0.0001045491,0.0004631909,0.0011464314,0.017218992],"genre_scores_gemma":[0.344537,0.0013968848,0.638388,0.00031689604,0.00024041906,0.00016596337,0.0007969756,0.00034866927,0.013809214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914753,0.00012590527,0.000076780336,0.00021847352,0.00033587197,0.00009539142],"domain_scores_gemma":[0.9975231,0.0010744375,0.00037753623,0.0004687225,0.00046098672,0.00009508722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667087,0.00062058226,0.0005886562,0.0016740167,0.0010063867,0.0017193322,0.0005291437,0.0007850163,0.0055516856],"category_scores_gemma":[0.0057974122,0.00026610898,0.000474597,0.0021444112,0.0015114408,0.0022593162,0.0007419169,0.001090622,0.0029469752],"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.00035844397,0.00006429759,0.0022538141,0.0004522604,0.00003223603,0.00072477246,0.00053378765,0.01782326,0.081003025,0.51157224,0.005694531,0.37948734],"study_design_scores_gemma":[0.00007118573,0.00040635114,0.004294169,0.00022545157,0.00007783451,0.00416129,0.00034203223,0.15410972,0.15232575,0.56835526,0.11544962,0.00018134211],"about_ca_topic_score_codex":0.00029165187,"about_ca_topic_score_gemma":0.00031995645,"teacher_disagreement_score":0.0055516856,"about_ca_system_score_codex":0.00044472973,"about_ca_system_score_gemma":0.0005256211,"threshold_uncertainty_score":0.01857227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1463407,0.0015011634,0.8328603,0.00021740391,0.0000397273,0.00003453431,0.00015649345,0.00026583823,0.01858383],"genre_scores_gemma":[0.9702332,0.00074151193,0.027639236,0.00009157536,0.000034187153,0.00005511618,0.00008740583,0.000041748703,0.0010760338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871004,0.0003651422,0.000053456268,0.00018892199,0.00043994474,0.00024249527],"domain_scores_gemma":[0.9940287,0.004306663,0.0004132159,0.00066017354,0.00041839108,0.00017290824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020276979,0.0011251239,0.0009776792,0.0009012595,0.00072783534,0.0014721776,0.00092351134,0.00077805005,0.0014308105],"category_scores_gemma":[0.007503184,0.0003316215,0.00042784552,0.00093334855,0.0026646939,0.0022668573,0.0019796046,0.0010972578,0.00039562062],"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.00017762702,0.000061425606,0.0005800115,0.00018747881,0.000048561313,0.00025648676,0.00027665615,0.56678563,0.016703485,0.38951784,0.000886529,0.024518218],"study_design_scores_gemma":[0.000011058769,0.00012076641,0.00051314535,0.00003835334,0.000019597752,0.00019116998,0.00008341942,0.8699202,0.013275574,0.11447009,0.0013059265,0.00005071315],"about_ca_topic_score_codex":0.0010179238,"about_ca_topic_score_gemma":0.0013635299,"teacher_disagreement_score":0.0020276979,"about_ca_system_score_codex":0.0016256549,"about_ca_system_score_gemma":0.0010756175,"threshold_uncertainty_score":0.011795044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057622623,0.0045007155,0.8515163,0.0038244152,0.00081472326,0.000068224785,0.00048098646,0.0002695529,0.08090244],"genre_scores_gemma":[0.89056826,0.00589241,0.08480192,0.0039965417,0.0028670912,0.00020614668,0.0005395496,0.00031111046,0.010817081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946121,0.0014822112,0.0002990974,0.0009248474,0.002262375,0.0004193095],"domain_scores_gemma":[0.9843433,0.009390599,0.0016865857,0.0021213829,0.0020275502,0.0004306258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004314911,0.00089756685,0.0011386534,0.0022777196,0.00164174,0.0031065207,0.0012781054,0.002098919,0.004230163],"category_scores_gemma":[0.01754102,0.00054064894,0.0009935995,0.0019026914,0.0065361895,0.011383465,0.0048212265,0.0038682313,0.00080923253],"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.000016656008,0.0000050125577,0.0001398545,0.000036104597,0.000007289272,0.00006932661,0.00008029843,0.0020846648,0.00044478785,0.99206233,0.0005331766,0.0045206873],"study_design_scores_gemma":[0.000005511181,0.000018001596,0.000094707946,0.000030020765,0.000006757723,0.000115853385,0.000020664142,0.00831293,0.00050200487,0.9881223,0.0027548303,0.000016430768],"about_ca_topic_score_codex":0.00058362103,"about_ca_topic_score_gemma":0.00032561054,"teacher_disagreement_score":0.004314911,"about_ca_system_score_codex":0.0013946526,"about_ca_system_score_gemma":0.00095311983,"threshold_uncertainty_score":0.022819698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033848066,0.002584126,0.9478439,0.0026247804,0.00049692835,0.0000964495,0.00019506183,0.0011319894,0.011178676],"genre_scores_gemma":[0.84618753,0.004096518,0.12745652,0.002298734,0.0009442793,0.0007745131,0.00057577464,0.0012749595,0.016391221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886026,0.0026648848,0.00058240915,0.0029955092,0.0036503125,0.0015043352],"domain_scores_gemma":[0.89004564,0.07828783,0.008824379,0.008463814,0.01028348,0.0040948517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014132003,0.0026700012,0.0023058073,0.0030015563,0.0018394347,0.00431257,0.004617304,0.0028809893,0.006051286],"category_scores_gemma":[0.09558368,0.0012911046,0.0027090749,0.001629588,0.0057732956,0.01096542,0.005355442,0.008405487,0.0013956805],"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.0007128798,0.0002513557,0.0052812104,0.000598862,0.00024328542,0.0011716945,0.00061539793,0.22974356,0.016785553,0.7005579,0.0077213636,0.036316905],"study_design_scores_gemma":[0.000047117133,0.00022932014,0.0009957476,0.00013892319,0.00008021494,0.00064127136,0.00011497887,0.7721292,0.0089437,0.21402697,0.0025291739,0.00012336057],"about_ca_topic_score_codex":0.0017345183,"about_ca_topic_score_gemma":0.0010802118,"teacher_disagreement_score":0.014132003,"about_ca_system_score_codex":0.004536209,"about_ca_system_score_gemma":0.0038357617,"threshold_uncertainty_score":0.074738085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005738975,0.00089144293,0.9914118,0.00007038398,0.00005603757,0.000013676594,0.000028017115,0.00012524838,0.0016643256],"genre_scores_gemma":[0.25278747,0.0018038263,0.7391105,0.00016605435,0.0001140399,0.00007994006,0.00019651558,0.00009021273,0.0056514638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993229,0.00018135719,0.00005552995,0.000112800066,0.00028494428,0.000042464853],"domain_scores_gemma":[0.999062,0.0004118651,0.00011610792,0.00016253609,0.00022055444,0.000026911752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085103995,0.0005124447,0.0004960806,0.00050433114,0.00024699303,0.00094840256,0.00082672626,0.0006784484,0.0020863712],"category_scores_gemma":[0.003741796,0.00024671978,0.00026767032,0.00079008733,0.0010075344,0.0011569517,0.00087468437,0.0012178672,0.0006139266],"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.000318227,0.000032991004,0.00060845556,0.0003112572,0.00003133446,0.00024375005,0.00023642665,0.13271241,0.04585979,0.45497426,0.002792859,0.36187828],"study_design_scores_gemma":[0.000014844317,0.0001320152,0.00037594538,0.00008735604,0.000014580821,0.00034811,0.00005169715,0.8314122,0.039711323,0.11484649,0.012965683,0.000039766164],"about_ca_topic_score_codex":0.0011142403,"about_ca_topic_score_gemma":0.0012978412,"teacher_disagreement_score":0.0020863712,"about_ca_system_score_codex":0.00060051435,"about_ca_system_score_gemma":0.0004900617,"threshold_uncertainty_score":0.0069795847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038762238,0.00036209336,0.95658875,0.00035807182,0.000043217187,0.000031619158,0.0000958669,0.0001513792,0.0036067327],"genre_scores_gemma":[0.90542454,0.0007212696,0.08780936,0.00022840736,0.00014063639,0.000095670366,0.00019048109,0.000051322084,0.0053383834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982181,0.00062526995,0.000068524314,0.00027551115,0.00058388547,0.00022861641],"domain_scores_gemma":[0.9962805,0.0024696465,0.0003932744,0.00043063718,0.0003470783,0.00007890491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002270813,0.0005845939,0.0012278231,0.00042461554,0.00057607173,0.0013903526,0.0008687365,0.0013806722,0.0016769983],"category_scores_gemma":[0.006581499,0.00044894856,0.00043933172,0.0010488869,0.0015011702,0.0020082672,0.0021853414,0.0012749673,0.0004487162],"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.0007440052,0.000059186874,0.00094102835,0.00032065436,0.00010602807,0.0005354705,0.0003819492,0.52765554,0.017958758,0.38300842,0.0027300506,0.06555887],"study_design_scores_gemma":[0.00006286538,0.00008623537,0.0003034177,0.000021188142,0.00003482749,0.00026419273,0.0000869278,0.91281337,0.006128648,0.078437924,0.0017314545,0.000028992037],"about_ca_topic_score_codex":0.00081904145,"about_ca_topic_score_gemma":0.0007444052,"teacher_disagreement_score":0.002270813,"about_ca_system_score_codex":0.0011836985,"about_ca_system_score_gemma":0.00073701266,"threshold_uncertainty_score":0.012009382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01786072,0.0020532073,0.92612106,0.006010342,0.00051654334,0.000066218694,0.00018807438,0.00022428494,0.046959568],"genre_scores_gemma":[0.74148566,0.0067628087,0.23169178,0.0016600309,0.0022319003,0.00040852904,0.00040465881,0.00026278192,0.015091888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998454,0.0006311222,0.000047113354,0.00021900253,0.0004713311,0.00017744534],"domain_scores_gemma":[0.9963845,0.001965619,0.00037588843,0.0006387855,0.00048491472,0.00015014551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064851,0.0011243144,0.0007459006,0.002550551,0.0015305752,0.0028332057,0.0020956066,0.0017798558,0.005721318],"category_scores_gemma":[0.0079660565,0.0004968648,0.00091266714,0.0024377876,0.0069544697,0.007918972,0.004038221,0.0040671006,0.00094792014],"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.0000050043363,0.0000034160373,0.000029153827,0.00000983306,0.0000014166449,0.000015054321,0.000032570562,0.0037872738,0.00011430732,0.9935684,0.00047407066,0.001959487],"study_design_scores_gemma":[0.000004415718,0.000015996906,0.000034497178,0.000013036572,0.0000023843493,0.000049400365,0.00005022082,0.019299686,0.00028325222,0.97534513,0.004892398,0.000009468989],"about_ca_topic_score_codex":0.0009063221,"about_ca_topic_score_gemma":0.0005975899,"teacher_disagreement_score":0.005721318,"about_ca_system_score_codex":0.0020252727,"about_ca_system_score_gemma":0.0009669671,"threshold_uncertainty_score":0.019139767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033090055,0.009430734,0.87395483,0.0018747787,0.00034685046,0.0000974529,0.0010249102,0.00091132015,0.07926905],"genre_scores_gemma":[0.9060059,0.010378585,0.06812173,0.00095072493,0.0010842296,0.0005150446,0.0012477692,0.00032004467,0.011375954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758506,0.0005126205,0.000086526816,0.00026168735,0.00096574466,0.00058829255],"domain_scores_gemma":[0.987653,0.007512302,0.0009079862,0.00121712,0.0023864533,0.0003231469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026274857,0.0016004546,0.0011414308,0.001985133,0.0009770385,0.0031311603,0.0016267016,0.00093396765,0.008903166],"category_scores_gemma":[0.012398642,0.00048233639,0.0008172149,0.0020524315,0.0021891242,0.0038383373,0.0030389475,0.0024802834,0.001648862],"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.00030547538,0.000077525554,0.0006115282,0.0005764106,0.00010404314,0.00028828144,0.00046497126,0.38822088,0.006935594,0.5253878,0.019822078,0.057205416],"study_design_scores_gemma":[0.000018682365,0.000064814536,0.0006168742,0.00018409683,0.000054408854,0.00036406636,0.0001433939,0.73143387,0.005556625,0.2509314,0.010533515,0.00009821082],"about_ca_topic_score_codex":0.005097008,"about_ca_topic_score_gemma":0.0027668667,"teacher_disagreement_score":0.008903166,"about_ca_system_score_codex":0.003384129,"about_ca_system_score_gemma":0.0018456297,"threshold_uncertainty_score":0.029784083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030155694,0.0006889895,0.9657736,0.00031826893,0.000067382636,0.000056031142,0.00016512896,0.00047990627,0.002295031],"genre_scores_gemma":[0.5684643,0.0013075998,0.4237118,0.00048784865,0.00019040737,0.00026750247,0.0006104665,0.00033655151,0.0046235076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930036,0.00012378322,0.00003821935,0.00012260413,0.00034685121,0.00006808788],"domain_scores_gemma":[0.9983901,0.00076836394,0.0001429522,0.0003498899,0.0002845738,0.00006423194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005275,0.0003763147,0.0005349954,0.0008728415,0.00041766063,0.00075783505,0.0009364831,0.0010101988,0.0009893912],"category_scores_gemma":[0.0043973774,0.00021032784,0.00036122397,0.0011329293,0.0013822516,0.0013956943,0.0013365503,0.0010871446,0.00032347965],"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.0002119918,0.00006931799,0.00073524757,0.00033883934,0.000040836,0.0006335202,0.00039359636,0.21741381,0.040060658,0.5287042,0.0042178626,0.20718007],"study_design_scores_gemma":[0.000027594464,0.000079378166,0.00019567732,0.00005578734,0.000023700439,0.0005418935,0.000030975236,0.83375937,0.018246539,0.1408184,0.0061892048,0.00003151444],"about_ca_topic_score_codex":0.0012864647,"about_ca_topic_score_gemma":0.0011275241,"teacher_disagreement_score":0.0012864647,"about_ca_system_score_codex":0.0007316735,"about_ca_system_score_gemma":0.0011739095,"threshold_uncertainty_score":0.0053086877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778684,0.0020590762,0.30595216,0.00043918684,0.000036484824,0.000032206925,0.00047311012,0.00043370103,0.012705653],"genre_scores_gemma":[0.9930321,0.00039963602,0.005971141,0.000014903044,0.000017776663,0.000031439453,0.000105094434,0.0000152862,0.00041257255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993231,0.00022372193,0.000022311608,0.000052496747,0.00026858412,0.000109727036],"domain_scores_gemma":[0.99836725,0.0011917207,0.000099002915,0.00010086954,0.00020943311,0.000031637137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012856184,0.00026113106,0.00038011727,0.0009410981,0.0004114235,0.00058548804,0.00058255513,0.00036824177,0.00095867855],"category_scores_gemma":[0.004208564,0.00022799787,0.0002159204,0.0005536273,0.00048120526,0.0011837668,0.0004550894,0.00025182992,0.0001313002],"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.00035524546,0.000047849957,0.0025015627,0.00022456155,0.000043549564,0.00021179546,0.0001368006,0.84342736,0.040036302,0.07006856,0.0008895781,0.042056825],"study_design_scores_gemma":[0.000007306119,0.000063851796,0.0010375354,0.00002643676,0.000027178814,0.00012558789,0.000033612316,0.9634304,0.01628016,0.017914701,0.0010387532,0.000014492339],"about_ca_topic_score_codex":0.00059274695,"about_ca_topic_score_gemma":0.00035771792,"teacher_disagreement_score":0.0012856184,"about_ca_system_score_codex":0.0007891155,"about_ca_system_score_gemma":0.00037786498,"threshold_uncertainty_score":0.006799042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09457744,0.0014498617,0.8893876,0.000572663,0.00012645712,0.00009608146,0.000294255,0.00019816445,0.013297403],"genre_scores_gemma":[0.94632256,0.0013871014,0.048545398,0.00011229211,0.00011162382,0.00007185153,0.00009989314,0.000027264115,0.00332208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.00016170242,0.000018435787,0.00006706839,0.00010572661,0.00012495977],"domain_scores_gemma":[0.9983668,0.0010827435,0.00015869725,0.00013725931,0.00017318634,0.00008141517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009095183,0.0007714425,0.0005256279,0.00033044873,0.000582775,0.00074990833,0.0007186641,0.0006895879,0.0016304316],"category_scores_gemma":[0.0038720956,0.00028793968,0.000327663,0.0007362917,0.0010990436,0.0014082856,0.00083058304,0.00064591883,0.00020416304],"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.00020099113,0.000029997995,0.0008361647,0.00017268435,0.00002947586,0.00047303265,0.00010609311,0.7774763,0.00708973,0.19131331,0.0013560175,0.020916192],"study_design_scores_gemma":[0.000016781853,0.00006224705,0.00012886908,0.00000848517,0.000008904109,0.00016694386,0.000018797742,0.96588945,0.0014378607,0.031436276,0.000814454,0.0000108431595],"about_ca_topic_score_codex":0.0027930802,"about_ca_topic_score_gemma":0.0016528026,"teacher_disagreement_score":0.0027930802,"about_ca_system_score_codex":0.0011965043,"about_ca_system_score_gemma":0.0008636679,"threshold_uncertainty_score":0.008681297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14750126,0.0004888923,0.8420652,0.0007694239,0.00008883155,0.00011323899,0.00027084845,0.00024548985,0.0084568625],"genre_scores_gemma":[0.9371981,0.0005587894,0.05809347,0.00010383267,0.00011503461,0.00012173134,0.00014067262,0.000031212607,0.003637097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733067,0.0009305904,0.00012978322,0.0005340089,0.0005377268,0.0005371471],"domain_scores_gemma":[0.9880701,0.00848828,0.0011104688,0.0014227318,0.0006161025,0.00029227367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003193837,0.0006942476,0.0011141973,0.00054015394,0.0010547729,0.0016542822,0.0012961574,0.0011510196,0.0024582013],"category_scores_gemma":[0.008973501,0.0002939297,0.00053220114,0.00097556744,0.0021533698,0.0049954564,0.002135529,0.001516519,0.0004228171],"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.0005548082,0.00008962035,0.0006453084,0.00025309954,0.000039013918,0.00033419224,0.00030581997,0.43664733,0.007881584,0.53120244,0.0013936588,0.020653099],"study_design_scores_gemma":[0.00003640886,0.00007816326,0.00011229564,0.000020137451,0.0000123000145,0.00009828424,0.00008970098,0.81763,0.0068236943,0.17399955,0.0010676257,0.000031942596],"about_ca_topic_score_codex":0.0016960882,"about_ca_topic_score_gemma":0.0012682569,"teacher_disagreement_score":0.003193837,"about_ca_system_score_codex":0.0011933214,"about_ca_system_score_gemma":0.0012193234,"threshold_uncertainty_score":0.016890824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19158289,0.0009103953,0.80097383,0.0002701011,0.00004676549,0.000059134658,0.00013020988,0.00036216495,0.005664375],"genre_scores_gemma":[0.97342354,0.0003832492,0.024882557,0.000033930333,0.00001556595,0.00005365812,0.000042169035,0.0000112651305,0.0011540544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993604,0.00023330233,0.000030447185,0.00005705489,0.0001882552,0.00013051553],"domain_scores_gemma":[0.9982974,0.0009945793,0.00023387888,0.00018920265,0.00020722517,0.0000777795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009396905,0.0005914386,0.00068730104,0.00070095056,0.0003944265,0.00088400766,0.00062684325,0.0005936159,0.0008000527],"category_scores_gemma":[0.002906648,0.0002637996,0.00033139487,0.0010704017,0.0006933358,0.0012171326,0.0012599623,0.00048242602,0.00013917095],"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.0000872648,0.000017588956,0.00032599567,0.00004515114,0.000015237092,0.00010438255,0.00006856538,0.9568403,0.0027924937,0.021150582,0.00022689966,0.018325571],"study_design_scores_gemma":[0.000004640437,0.000022787595,0.00007482097,0.000004985651,0.000004564157,0.00001628657,0.00001120976,0.9928926,0.00057944824,0.006203723,0.0001791228,0.000005789339],"about_ca_topic_score_codex":0.0046604155,"about_ca_topic_score_gemma":0.003827775,"teacher_disagreement_score":0.0046604155,"about_ca_system_score_codex":0.0011424897,"about_ca_system_score_gemma":0.0007123689,"threshold_uncertainty_score":0.009266615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24925233,0.0014807545,0.7028505,0.00068533473,0.00030615536,0.00012939854,0.00033174932,0.00060802244,0.044355813],"genre_scores_gemma":[0.84975976,0.0013698876,0.13556495,0.00047088228,0.0004948742,0.00031362573,0.0004248417,0.0003771647,0.011224109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997943,0.000513208,0.00011186324,0.00039160645,0.00076682394,0.00027352854],"domain_scores_gemma":[0.9935061,0.0036768839,0.00081879005,0.0009208652,0.0007086584,0.00036874923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018174585,0.00065449387,0.00076873857,0.0019163341,0.0018177051,0.001961768,0.0007523969,0.0011575255,0.0048928945],"category_scores_gemma":[0.011018818,0.00073734147,0.0007752122,0.0015331528,0.0017830373,0.004713602,0.0020589982,0.0023309938,0.0010180857],"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.0001616914,0.000046035173,0.0010162569,0.00013292748,0.000017046812,0.000412008,0.00048327498,0.006522471,0.015094117,0.9359561,0.0018306314,0.03832724],"study_design_scores_gemma":[0.000062787025,0.00028402195,0.0013783079,0.00012599601,0.000048786518,0.0025646319,0.00029360468,0.082132705,0.0379004,0.8464324,0.028605158,0.00017113393],"about_ca_topic_score_codex":0.00022264976,"about_ca_topic_score_gemma":0.00023894667,"teacher_disagreement_score":0.0048928945,"about_ca_system_score_codex":0.0012073324,"about_ca_system_score_gemma":0.0007946706,"threshold_uncertainty_score":0.01636833},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069310036,0.00039702325,0.98782164,0.00018179754,0.000076471944,0.000026898428,0.00008354304,0.000173396,0.004308338],"genre_scores_gemma":[0.44357482,0.0031810126,0.5350942,0.00066298305,0.0006174309,0.00029414968,0.00064659416,0.00035740383,0.0155714145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992362,0.00019281711,0.000037083923,0.00010138968,0.00034574541,0.000086711705],"domain_scores_gemma":[0.99849105,0.0005761702,0.00023947525,0.000222798,0.0003749381,0.000095552736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015493577,0.00083025394,0.00073815905,0.0017466273,0.0004435729,0.0021266788,0.0012269422,0.0012969663,0.0029427386],"category_scores_gemma":[0.0055248616,0.00033170715,0.0011081869,0.002097058,0.0010309736,0.0025595946,0.0011660669,0.001755119,0.0010782456],"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.000030831983,0.00004166506,0.0004868652,0.000091650676,0.000026397407,0.00021991724,0.00014207175,0.051752176,0.002999278,0.8959355,0.0039217337,0.044351954],"study_design_scores_gemma":[0.000009881707,0.000018345747,0.00031410786,0.00002500512,0.000014814111,0.00044775524,0.000042691605,0.72271836,0.00084259117,0.2702666,0.0052659665,0.000033890894],"about_ca_topic_score_codex":0.0012819984,"about_ca_topic_score_gemma":0.0014659676,"teacher_disagreement_score":0.0029427386,"about_ca_system_score_codex":0.001116998,"about_ca_system_score_gemma":0.001310368,"threshold_uncertainty_score":0.009844422},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18474835,0.0025414214,0.7712181,0.0026908848,0.00026698233,0.00007931466,0.00088918605,0.0008697083,0.03669604],"genre_scores_gemma":[0.97046006,0.0011760822,0.02387692,0.00023426622,0.00018040957,0.00018417215,0.00028501076,0.0001705414,0.0034325873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976299,0.0006393933,0.00009462354,0.00029577457,0.00067651196,0.00066384696],"domain_scores_gemma":[0.962811,0.030724496,0.0014986476,0.0023972476,0.0019258079,0.0006428531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030418292,0.0013143878,0.0013443622,0.0017938031,0.001038873,0.0032055608,0.0022835927,0.0016124677,0.0045424704],"category_scores_gemma":[0.02931154,0.00064305315,0.0007663676,0.001460815,0.005630503,0.0056877295,0.0028057538,0.0029728042,0.00058789167],"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.00018684859,0.000060517843,0.0004691705,0.0002050835,0.000041743715,0.000159663,0.00017584517,0.60369366,0.005376458,0.38100776,0.0016770705,0.0069461684],"study_design_scores_gemma":[0.000014615452,0.000021268055,0.00011184943,0.000053335367,0.000013515124,0.0000468797,0.000034059096,0.86581033,0.0029968577,0.13030724,0.00056115707,0.00002879794],"about_ca_topic_score_codex":0.0024227202,"about_ca_topic_score_gemma":0.0010781623,"teacher_disagreement_score":0.0045424704,"about_ca_system_score_codex":0.0030762062,"about_ca_system_score_gemma":0.0017964562,"threshold_uncertainty_score":0.022319555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007219699,0.00022530093,0.9900181,0.00022776613,0.000020859645,0.000038687074,0.000028335937,0.000087259694,0.00213397],"genre_scores_gemma":[0.70430917,0.0014948602,0.28257814,0.0004252066,0.00018293055,0.00038053785,0.00026923508,0.0002716139,0.010088261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977932,0.000715935,0.000070442926,0.00023287295,0.0010025502,0.00018496654],"domain_scores_gemma":[0.98494995,0.011963255,0.0008336833,0.0006604922,0.0013784758,0.00021419376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004006758,0.0009185646,0.00089274877,0.0011022672,0.00052604894,0.0011870001,0.0019182127,0.001348535,0.0023243984],"category_scores_gemma":[0.025845245,0.00051254703,0.0006453592,0.0009480001,0.0026165298,0.0034052508,0.0019114463,0.0021238371,0.0004061644],"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.000100617406,0.000028810933,0.0010076342,0.00019442421,0.000044680353,0.000110165245,0.00029281602,0.5678377,0.0041876826,0.3992578,0.00093948527,0.025998147],"study_design_scores_gemma":[0.0000030482277,0.000013382229,0.00007925038,0.000012872509,0.00000419572,0.000023684093,0.000012159931,0.9714148,0.0009019099,0.027172051,0.00035562838,0.000007061953],"about_ca_topic_score_codex":0.0030045672,"about_ca_topic_score_gemma":0.0015958156,"teacher_disagreement_score":0.004006758,"about_ca_system_score_codex":0.0021629825,"about_ca_system_score_gemma":0.0019528545,"threshold_uncertainty_score":0.021189988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036653128,0.00040794475,0.9605007,0.0001512175,0.000012835492,0.000028675506,0.000037315618,0.00016073027,0.002047432],"genre_scores_gemma":[0.8434051,0.0006218146,0.15456337,0.00009642326,0.000054193213,0.00010167004,0.00006699784,0.00008740683,0.0010030044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830854,0.00063598197,0.00007908853,0.0002822075,0.00054102123,0.00015313417],"domain_scores_gemma":[0.9912072,0.0065411334,0.0008512282,0.0007479109,0.0005304122,0.00012214678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002751114,0.001028371,0.0010901236,0.0005832251,0.00034483694,0.0010749317,0.00095410243,0.0011101131,0.00097125076],"category_scores_gemma":[0.015399039,0.00035564657,0.00043918748,0.00081806927,0.0020464591,0.0022016,0.0017333686,0.001099042,0.00035131685],"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.00029782116,0.000061735256,0.0005895779,0.00025183,0.00007335677,0.00014326825,0.00018143097,0.7834165,0.03639294,0.120306306,0.0005536702,0.057731587],"study_design_scores_gemma":[0.000018812838,0.00009318019,0.0001386552,0.000022703698,0.000014538558,0.00012036846,0.000024604096,0.96374536,0.013037284,0.02232785,0.00043457857,0.000022115102],"about_ca_topic_score_codex":0.0005389631,"about_ca_topic_score_gemma":0.00038102065,"teacher_disagreement_score":0.002751114,"about_ca_system_score_codex":0.0010989571,"about_ca_system_score_gemma":0.00081135234,"threshold_uncertainty_score":0.014549434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006355675,0.00014882704,0.99043614,0.00015765238,0.000023017248,0.00003529703,0.000075498014,0.00013058876,0.0026372964],"genre_scores_gemma":[0.7651293,0.0010025741,0.2242288,0.00028271106,0.000087293534,0.0004532309,0.00045329746,0.00017017957,0.008192617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.00078448426,0.00008705866,0.0002374686,0.00049593486,0.00013870468],"domain_scores_gemma":[0.98933524,0.008244451,0.00082836085,0.00072556356,0.00073978334,0.00012653715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021045932,0.0013062218,0.0012624898,0.00077223126,0.0004120297,0.0014058,0.0011531322,0.001690899,0.0030507979],"category_scores_gemma":[0.01546303,0.00075177837,0.0007532825,0.0009516979,0.0020184885,0.0019251818,0.0016657615,0.0017604588,0.00076558435],"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.00013893934,0.000018728713,0.00023512417,0.000078719786,0.00002915417,0.00009926612,0.00005668281,0.7018458,0.0038894624,0.28257126,0.00050252903,0.010534314],"study_design_scores_gemma":[0.000014271878,0.000023325045,0.000040629744,0.000014850203,0.000005763523,0.0000449317,0.0000050422836,0.9580213,0.002236972,0.039166547,0.00041102892,0.00001527299],"about_ca_topic_score_codex":0.0014664459,"about_ca_topic_score_gemma":0.00091723923,"teacher_disagreement_score":0.0030507979,"about_ca_system_score_codex":0.0015314886,"about_ca_system_score_gemma":0.0013444588,"threshold_uncertainty_score":0.011130273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26743624,0.0024905526,0.68249416,0.0019383895,0.00013618251,0.000095106174,0.00080939993,0.00045172285,0.0441483],"genre_scores_gemma":[0.9855854,0.0010366328,0.009953921,0.00011208433,0.00014569769,0.000109833425,0.00022055069,0.000039478582,0.0027964222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826777,0.0006549537,0.000043815813,0.00017935551,0.0004563451,0.00039774796],"domain_scores_gemma":[0.9861013,0.01067728,0.0009810069,0.0006231736,0.0012903126,0.00032702973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017998077,0.00073997764,0.0006660799,0.0014148625,0.000600018,0.0015398661,0.00091716443,0.0007842186,0.0038675885],"category_scores_gemma":[0.010551007,0.00036492632,0.0004674127,0.0013845705,0.0025545743,0.0030828814,0.0014046109,0.0013767973,0.00035280097],"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.00018328962,0.000038214737,0.0005097439,0.0001491051,0.000031456657,0.00019080019,0.00021024473,0.36094576,0.0036359753,0.62397456,0.0022577208,0.007873144],"study_design_scores_gemma":[0.0000100273055,0.0000322342,0.00022859007,0.000028793018,0.000008499439,0.00006908983,0.00007247032,0.79986954,0.001212425,0.1976732,0.00076675246,0.000028383709],"about_ca_topic_score_codex":0.0025448462,"about_ca_topic_score_gemma":0.0010984228,"teacher_disagreement_score":0.0038675885,"about_ca_system_score_codex":0.002274471,"about_ca_system_score_gemma":0.0014889147,"threshold_uncertainty_score":0.0165025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42869055,0.0023969293,0.54600894,0.0008289541,0.00007583221,0.000055800687,0.0007449713,0.0005195547,0.020678472],"genre_scores_gemma":[0.99430805,0.00096545625,0.0035199926,0.00006389749,0.00006696853,0.00004073345,0.00016029534,0.000049471037,0.00082525925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867463,0.00048297024,0.00004122598,0.00016752521,0.0003578707,0.00027582227],"domain_scores_gemma":[0.9865187,0.009801025,0.0012054022,0.0010339143,0.0011899112,0.00025104528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023250852,0.00093005947,0.0010602105,0.0013428977,0.00051637535,0.0011737652,0.0010047355,0.0007345284,0.0018228341],"category_scores_gemma":[0.010763289,0.000568893,0.0005605916,0.0014042972,0.0033445642,0.0029968424,0.0013134173,0.001235109,0.00031735384],"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.00015122372,0.000045607263,0.0018303491,0.00013435307,0.0000419871,0.0005547424,0.00023496733,0.8261577,0.0062204003,0.15760864,0.0011190353,0.0059010843],"study_design_scores_gemma":[0.000009829074,0.000032102773,0.0011812778,0.00003260088,0.000013402938,0.00020864635,0.00007417129,0.9525764,0.0019017813,0.043538213,0.0003909941,0.000040530842],"about_ca_topic_score_codex":0.0018887267,"about_ca_topic_score_gemma":0.00081402063,"teacher_disagreement_score":0.0023250852,"about_ca_system_score_codex":0.0016269045,"about_ca_system_score_gemma":0.0006734825,"threshold_uncertainty_score":0.012296379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029018622,0.0053964774,0.92269474,0.001071073,0.001638626,0.00016671773,0.00032786757,0.0007630317,0.038922805],"genre_scores_gemma":[0.5073515,0.0062476336,0.4439849,0.001285764,0.0015504698,0.00039211902,0.00096781435,0.0002774009,0.037942424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925727,0.00018914831,0.00004466474,0.00011193667,0.0003234707,0.0000735557],"domain_scores_gemma":[0.9988979,0.00029234568,0.0001295854,0.00020565107,0.00041766308,0.00005689463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005678508,0.00042870367,0.00026990083,0.00076274545,0.00074831746,0.0012572088,0.00050155446,0.0009309896,0.0042830436],"category_scores_gemma":[0.0028477965,0.00018262936,0.00029634082,0.0014315596,0.0008086074,0.0009325373,0.00076679647,0.0010925615,0.0018190814],"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.00030785624,0.00008597023,0.0006077079,0.0003343539,0.000019592184,0.0003387903,0.00038186568,0.038439274,0.039596535,0.6526041,0.016538661,0.25074533],"study_design_scores_gemma":[0.00009121106,0.00052852865,0.0010234569,0.00034627196,0.00005439822,0.0015395597,0.00013470984,0.42540124,0.057742722,0.23400761,0.27896014,0.00017009069],"about_ca_topic_score_codex":0.001593127,"about_ca_topic_score_gemma":0.0019616932,"teacher_disagreement_score":0.0042830436,"about_ca_system_score_codex":0.0009287547,"about_ca_system_score_gemma":0.0010704166,"threshold_uncertainty_score":0.014328182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40568247,0.000657439,0.5715491,0.0010491153,0.00007379751,0.00012445975,0.0002402955,0.00018559348,0.020437723],"genre_scores_gemma":[0.9768262,0.00040829554,0.017665092,0.00006876776,0.00007482145,0.000071108654,0.00006232636,0.000026043364,0.0047973176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983203,0.000588308,0.00003956003,0.0001945366,0.00046937203,0.0003880238],"domain_scores_gemma":[0.99259573,0.0054666186,0.00081675046,0.0005008949,0.00042432547,0.00019566822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015496749,0.0007801772,0.001035586,0.00052344706,0.00095752376,0.001097481,0.0014533001,0.0011822061,0.002089655],"category_scores_gemma":[0.0066957967,0.00045348995,0.0005254922,0.001250254,0.0019264293,0.0025288428,0.001615875,0.0014231259,0.00024743285],"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.00043187692,0.0001142917,0.00068095827,0.000114763316,0.000055732777,0.0006179078,0.00031354412,0.8039617,0.0096271485,0.17304106,0.0009859953,0.010054989],"study_design_scores_gemma":[0.0000365951,0.000041611638,0.00013523495,0.0000032690846,0.00001169044,0.00007704037,0.00004378135,0.96597034,0.0011889321,0.032129668,0.00035141731,0.000010423726],"about_ca_topic_score_codex":0.002791771,"about_ca_topic_score_gemma":0.0018467017,"teacher_disagreement_score":0.002791771,"about_ca_system_score_codex":0.001726228,"about_ca_system_score_gemma":0.0009345462,"threshold_uncertainty_score":0.012524724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27983508,0.00059951574,0.6498947,0.0004552058,0.00021914666,0.00018072351,0.00029681562,0.0005706033,0.06794822],"genre_scores_gemma":[0.6786042,0.0007568069,0.2907777,0.0002569259,0.000102055295,0.0001447414,0.00049796724,0.00027487683,0.028584635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994313,0.00016394662,0.000036513822,0.00008331611,0.00016973274,0.000115116774],"domain_scores_gemma":[0.99939036,0.00019333226,0.000063463216,0.00013538651,0.00016374882,0.00005368996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122137,0.00060502184,0.00046819908,0.00086081127,0.00093794713,0.0014532808,0.00061002985,0.00049572944,0.0041370275],"category_scores_gemma":[0.0013796778,0.0003776118,0.0006770965,0.00115003,0.00093579415,0.0015392964,0.00101663,0.001408091,0.0014147796],"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.00029745797,0.00010394018,0.0009521378,0.00028456355,0.000027394084,0.00047613998,0.0011713546,0.010541437,0.04390226,0.81281656,0.002995239,0.12643151],"study_design_scores_gemma":[0.00007254416,0.00062766083,0.0017025742,0.0001499762,0.00006714762,0.0031059482,0.000745247,0.085036986,0.08304962,0.73411274,0.09116835,0.00016120171],"about_ca_topic_score_codex":0.0003281973,"about_ca_topic_score_gemma":0.000586497,"teacher_disagreement_score":0.0041370275,"about_ca_system_score_codex":0.0005828722,"about_ca_system_score_gemma":0.00043781433,"threshold_uncertainty_score":0.013839781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043788236,0.0009486972,0.9314057,0.00032230612,0.00019914412,0.00011333674,0.00046620134,0.00057418883,0.022182107],"genre_scores_gemma":[0.54119116,0.0016385566,0.43813005,0.0002624233,0.0001996002,0.00026392343,0.0011629943,0.00009312621,0.01705816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935657,0.00014639982,0.000039748236,0.000080580845,0.0002998445,0.00007681405],"domain_scores_gemma":[0.9989485,0.00020071006,0.00019278035,0.00016659818,0.0004272669,0.00006414155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029256396,0.0003681096,0.0003163247,0.00058327295,0.00033312946,0.00075222226,0.0004369544,0.00032003058,0.00242036],"category_scores_gemma":[0.0014185065,0.00017176894,0.00025656793,0.0008902844,0.0006420981,0.0007100946,0.00065110094,0.00069373735,0.0012333221],"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.00030744827,0.000085024694,0.0012927193,0.0001802278,0.00004420751,0.00025922045,0.00018505793,0.102040224,0.037132528,0.6722482,0.005890574,0.18033448],"study_design_scores_gemma":[0.000110042805,0.00035694797,0.00087857316,0.00006180518,0.00004729539,0.0008669061,0.000064076026,0.755934,0.046877675,0.116355,0.078365825,0.0000818723],"about_ca_topic_score_codex":0.0013020985,"about_ca_topic_score_gemma":0.001595635,"teacher_disagreement_score":0.00242036,"about_ca_system_score_codex":0.00044222083,"about_ca_system_score_gemma":0.0007193599,"threshold_uncertainty_score":0.008096933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10072845,0.0008992315,0.82162684,0.0015301738,0.00019155715,0.00012357684,0.0004068284,0.00024078903,0.07425248],"genre_scores_gemma":[0.8537337,0.0013549506,0.12782562,0.0007740698,0.00028957677,0.00035736465,0.0005211472,0.00009340042,0.01505032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991721,0.00022306354,0.00002998459,0.000103766135,0.00034331882,0.00012782455],"domain_scores_gemma":[0.99775773,0.0012357582,0.00019906349,0.00036818848,0.00032937134,0.000109833745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075794704,0.00041234444,0.0002853824,0.0005867117,0.0006226974,0.0013421407,0.0004590155,0.0007007118,0.003418772],"category_scores_gemma":[0.0033032685,0.0002449462,0.000386385,0.0005607356,0.0019990876,0.0019444375,0.0018898273,0.0017475944,0.000739177],"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.000026686219,0.000007739936,0.00006391631,0.000021329926,0.0000019383565,0.000021264446,0.00007489448,0.007136919,0.0011501515,0.98495317,0.00052616006,0.006015795],"study_design_scores_gemma":[0.000016510774,0.00001810903,0.00011087659,0.00002126935,0.0000048243865,0.000051037117,0.00003800994,0.053740807,0.0036107257,0.9372977,0.0050748894,0.000015260419],"about_ca_topic_score_codex":0.00054988416,"about_ca_topic_score_gemma":0.00038061355,"teacher_disagreement_score":0.003418772,"about_ca_system_score_codex":0.00087780115,"about_ca_system_score_gemma":0.00084749673,"threshold_uncertainty_score":0.011436939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4261713,0.0012590276,0.5014516,0.013947726,0.00027159086,0.00025442356,0.002624951,0.0012918134,0.05272755],"genre_scores_gemma":[0.94350314,0.00076426,0.044658005,0.0008627832,0.00026523575,0.00018230689,0.001524204,0.00035304832,0.007887075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948304,0.0013949607,0.0002584632,0.000957445,0.0019224425,0.00063638936],"domain_scores_gemma":[0.98145217,0.01527707,0.00059794553,0.0014825766,0.00089665916,0.00029359173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016850518,0.0006117171,0.0019228077,0.00058271893,0.001290783,0.0037291627,0.0016069814,0.0030605257,0.005379868],"category_scores_gemma":[0.019351888,0.0005148884,0.0010017983,0.0008603172,0.0033574956,0.005550038,0.0023815369,0.0038720402,0.0011017544],"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.00091011677,0.00025826742,0.00236575,0.0006923094,0.00010652704,0.00049228064,0.0008241846,0.34899336,0.012946369,0.5648472,0.01580813,0.051755477],"study_design_scores_gemma":[0.000105529245,0.000058513633,0.0005259301,0.000047278078,0.00001730861,0.00016524161,0.00016685811,0.39508122,0.006411031,0.59437937,0.003001164,0.000040531017],"about_ca_topic_score_codex":0.002472575,"about_ca_topic_score_gemma":0.001370621,"teacher_disagreement_score":0.005379868,"about_ca_system_score_codex":0.0022620803,"about_ca_system_score_gemma":0.002513262,"threshold_uncertainty_score":0.017997384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009598136,0.0001485575,0.984959,0.00019654243,0.000050215942,0.00007224099,0.00007690688,0.0018563881,0.0030419615],"genre_scores_gemma":[0.109694004,0.00017715344,0.8837689,0.00011501086,0.00010931775,0.00021590035,0.00051051605,0.00048510404,0.004924058],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997451,0.00058205123,0.00014834276,0.00039913997,0.001028175,0.00039120883],"domain_scores_gemma":[0.9959478,0.0019344287,0.0002857003,0.0010740305,0.00061695976,0.00014126087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018513051,0.0015030539,0.0013144942,0.0017834225,0.0010565781,0.001857486,0.0022472858,0.0010351801,0.012198051],"category_scores_gemma":[0.00831968,0.00069983624,0.0018686756,0.0024786864,0.0010342653,0.0045108907,0.0036891794,0.0035157339,0.0041929516],"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.00068620464,0.0002846091,0.001141978,0.00031308047,0.000101014804,0.00015919724,0.0004186063,0.13450818,0.0119726,0.21705359,0.009669601,0.6236913],"study_design_scores_gemma":[0.00013926609,0.000113998954,0.0002356432,0.00003884679,0.000031628304,0.00016046499,0.0001349157,0.82148135,0.009960681,0.15911885,0.008537509,0.000046696103],"about_ca_topic_score_codex":0.0027516806,"about_ca_topic_score_gemma":0.004844653,"teacher_disagreement_score":0.012198051,"about_ca_system_score_codex":0.0017043053,"about_ca_system_score_gemma":0.0030957812,"threshold_uncertainty_score":0.04080659},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019091202,0.0006044728,0.9928867,0.00035328057,0.000093250994,0.000023565002,0.000085563435,0.00006562729,0.0039783767],"genre_scores_gemma":[0.20920953,0.0031110956,0.772531,0.00078690826,0.0007588466,0.00029290924,0.00068165304,0.00037718267,0.012250912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986376,0.00050202507,0.00009442852,0.00018211054,0.0005016981,0.00008213172],"domain_scores_gemma":[0.9984952,0.00059934304,0.00019223308,0.00018290465,0.00045612638,0.00007422082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001682933,0.001399759,0.0009521845,0.0012132152,0.00053545175,0.0018580819,0.0013773273,0.0019638417,0.0027024958],"category_scores_gemma":[0.0073099406,0.00034436237,0.00067259,0.0018129004,0.0014141559,0.0035102272,0.0012790711,0.0019801285,0.001328255],"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.000023996135,0.000013737058,0.00017840996,0.00015294261,0.000019283385,0.0001585705,0.00009926818,0.06393215,0.005266021,0.900351,0.003104075,0.026700579],"study_design_scores_gemma":[0.0000094716,0.00005045812,0.00013435265,0.000052313102,0.000015206859,0.00054110406,0.000028298933,0.5982989,0.0026310063,0.38591647,0.012280026,0.0000423895],"about_ca_topic_score_codex":0.0005849403,"about_ca_topic_score_gemma":0.0006466075,"teacher_disagreement_score":0.0027024958,"about_ca_system_score_codex":0.0014306804,"about_ca_system_score_gemma":0.0009292605,"threshold_uncertainty_score":0.010380328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0714709,0.001019933,0.9089924,0.0006167866,0.000093552066,0.000043299577,0.00025705175,0.00013936439,0.017366758],"genre_scores_gemma":[0.9735121,0.001419614,0.020768315,0.00010055071,0.0001071049,0.00006064461,0.00007283789,0.000015272719,0.0039435336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865687,0.00045356614,0.000041752264,0.00018058863,0.00039134428,0.00027580527],"domain_scores_gemma":[0.99573,0.00287234,0.000511962,0.0003683728,0.00040232713,0.000115069524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299172,0.0012016194,0.0010912083,0.00047519043,0.00084182055,0.0019000527,0.00073606055,0.00103937,0.0013625104],"category_scores_gemma":[0.003620235,0.000558776,0.0006347737,0.0011150255,0.0024593347,0.0017684798,0.001653765,0.0013817088,0.00040171802],"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.00036452786,0.000056027606,0.0012219216,0.00025498372,0.000091347196,0.0018898584,0.00027715278,0.593563,0.022273012,0.3674953,0.0015818784,0.010931004],"study_design_scores_gemma":[0.000031875883,0.00013614203,0.00047661882,0.000031985754,0.00006124248,0.0006495295,0.00010135865,0.93244374,0.00723387,0.057233494,0.0015403136,0.00005980571],"about_ca_topic_score_codex":0.0018730718,"about_ca_topic_score_gemma":0.0013817857,"teacher_disagreement_score":0.0019000527,"about_ca_system_score_codex":0.0011255115,"about_ca_system_score_gemma":0.0009975776,"threshold_uncertainty_score":0.008166194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10477389,0.0011226252,0.8480242,0.0007692605,0.00018393484,0.00016388079,0.00037997557,0.00021171213,0.0443704],"genre_scores_gemma":[0.48632163,0.0014404963,0.5000837,0.0004891847,0.00017020994,0.00064260303,0.0006531535,0.00016952025,0.0100295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989619,0.00033761773,0.00007975317,0.00014473406,0.00034524067,0.00013065698],"domain_scores_gemma":[0.9980679,0.00097432337,0.00031934815,0.00025760435,0.0002512576,0.00012950836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289803,0.00078381214,0.0006949652,0.0017689125,0.0008792718,0.001966594,0.0008220381,0.00081479584,0.003122274],"category_scores_gemma":[0.0035221078,0.00075814384,0.00084926793,0.0018176334,0.0014384141,0.0016218919,0.0017611871,0.0014333377,0.0006033105],"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.00006785923,0.00006893714,0.0003676877,0.00016912931,0.000022488357,0.00013405374,0.00014376012,0.05607608,0.0053799776,0.8982512,0.0029306693,0.03638812],"study_design_scores_gemma":[0.00009293189,0.00014841864,0.0004196687,0.00009614354,0.000035707064,0.0004198811,0.00012735007,0.24818017,0.006951809,0.7266356,0.016805908,0.000086517925],"about_ca_topic_score_codex":0.00038178728,"about_ca_topic_score_gemma":0.0005886789,"teacher_disagreement_score":0.003122274,"about_ca_system_score_codex":0.001231681,"about_ca_system_score_gemma":0.0008412432,"threshold_uncertainty_score":0.010445058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52758867,0.0006605687,0.46242628,0.0005581325,0.00008754382,0.00019378916,0.00022635129,0.00047783513,0.00778083],"genre_scores_gemma":[0.96940887,0.00026027643,0.027983919,0.00015513312,0.00007019229,0.00008749062,0.00008792356,0.00003712898,0.0019090846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996332,0.0008869493,0.0002284793,0.0006706468,0.0012452877,0.0006366394],"domain_scores_gemma":[0.9947365,0.0018123643,0.0009920264,0.0017501917,0.0005028467,0.00020599132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018026883,0.0008458646,0.0010358548,0.0009205574,0.00096029387,0.0016170108,0.0010323559,0.0012110058,0.0012053174],"category_scores_gemma":[0.0057621147,0.00042659504,0.0011099438,0.0013616574,0.002789003,0.0041845124,0.002857803,0.0016700313,0.00029004138],"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.00183801,0.00011669423,0.004542427,0.00025513401,0.00029031583,0.0017519349,0.0011487141,0.13384466,0.08194042,0.7079971,0.0026066229,0.06366795],"study_design_scores_gemma":[0.00014852296,0.0004305311,0.0014963611,0.00003704624,0.00008222055,0.00176322,0.00016314359,0.48509672,0.04326156,0.45897514,0.008445943,0.00009953024],"about_ca_topic_score_codex":0.00053507905,"about_ca_topic_score_gemma":0.000303858,"teacher_disagreement_score":0.0018026883,"about_ca_system_score_codex":0.0012377424,"about_ca_system_score_gemma":0.0006456594,"threshold_uncertainty_score":0.009533584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062981986,0.0016471894,0.9305983,0.00016295057,0.000101058926,0.00007883104,0.00010195339,0.0008485233,0.0034792058],"genre_scores_gemma":[0.52861357,0.0010622955,0.46692663,0.00025323368,0.0000814569,0.00015429701,0.00027221473,0.00009671641,0.0025395695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970824,0.000039212202,0.0000166938,0.000041056897,0.00017489224,0.00001989157],"domain_scores_gemma":[0.99959177,0.00012553816,0.000055542136,0.00012284379,0.00008803975,0.000016312128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016516147,0.00030870634,0.00028974452,0.00045859127,0.00022365018,0.00037420244,0.00061590935,0.00047959818,0.0013587071],"category_scores_gemma":[0.0015679103,0.00013008565,0.00021526855,0.00072449463,0.0002601388,0.000722677,0.0005853617,0.00060539646,0.00044380824],"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.0002635836,0.000058596906,0.0007360859,0.000299748,0.000036090245,0.00035750732,0.00013794267,0.060971033,0.23352984,0.041039463,0.0028015322,0.65976846],"study_design_scores_gemma":[0.000026965214,0.00027395305,0.0010816696,0.000067045185,0.000030496232,0.0009676467,0.000037453923,0.79253227,0.17270589,0.017593235,0.014646316,0.000037051297],"about_ca_topic_score_codex":0.0006187756,"about_ca_topic_score_gemma":0.0008500111,"teacher_disagreement_score":0.0013587071,"about_ca_system_score_codex":0.00030639058,"about_ca_system_score_gemma":0.00032971048,"threshold_uncertainty_score":0.0045453906},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63258404,0.0010139216,0.3340241,0.000804358,0.00012360282,0.00011196795,0.0006278643,0.00071885076,0.029991336],"genre_scores_gemma":[0.95584863,0.0003879313,0.041729577,0.00010934031,0.0000602615,0.000073909876,0.00019161915,0.00006176791,0.0015368756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962507,0.00081575016,0.00041838243,0.0008349326,0.0011175991,0.0005626661],"domain_scores_gemma":[0.9347452,0.044618025,0.0064370786,0.0050864527,0.0068724407,0.0022407111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025298053,0.0008483964,0.00049483386,0.0037548894,0.001173574,0.0036373828,0.0009788059,0.0015009372,0.002585831],"category_scores_gemma":[0.03118714,0.0005807536,0.0004920911,0.0018082476,0.0042997533,0.006716185,0.0029467987,0.0021913552,0.00042182195],"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.00028939126,0.00009507158,0.0077784797,0.00019010335,0.000065509135,0.00062522164,0.0007076863,0.02315891,0.016184563,0.91524374,0.00050085183,0.035160597],"study_design_scores_gemma":[0.000031797535,0.00016639804,0.0037830903,0.0000892159,0.0000706345,0.0015971187,0.00040590874,0.07888911,0.030110432,0.8798408,0.0048511564,0.000164485],"about_ca_topic_score_codex":0.00035307877,"about_ca_topic_score_gemma":0.00032841138,"teacher_disagreement_score":0.0037548894,"about_ca_system_score_codex":0.0011178193,"about_ca_system_score_gemma":0.0009874357,"threshold_uncertainty_score":0.013379037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15398137,0.0006454674,0.7881715,0.00071134727,0.00022249029,0.000074965516,0.0003580326,0.0003311819,0.055503596],"genre_scores_gemma":[0.9384579,0.0006955915,0.051866427,0.0003028766,0.00032380573,0.0000917712,0.00034060542,0.00015354222,0.0077674324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00014535748,0.000026943877,0.00010204535,0.0002656748,0.00008653442],"domain_scores_gemma":[0.99867344,0.00043567535,0.00022887037,0.00034086712,0.0002574103,0.000063855245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046923137,0.00026569524,0.0003496002,0.00069135736,0.00040767918,0.000977559,0.0003129549,0.00041795854,0.0026940447],"category_scores_gemma":[0.0034188465,0.00018208183,0.00046161315,0.0008270079,0.0013422896,0.0010092364,0.0008419148,0.0012269586,0.00083883863],"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.00006099102,0.000019864758,0.00042880536,0.000038713388,0.00001554628,0.0002874531,0.00023149946,0.027236992,0.0126358075,0.93336797,0.0012089902,0.024467384],"study_design_scores_gemma":[0.000036553207,0.00012879987,0.0010160939,0.000026364873,0.000015378888,0.00054703414,0.000049568964,0.18055522,0.010866994,0.79461735,0.012103577,0.00003695944],"about_ca_topic_score_codex":0.0004301413,"about_ca_topic_score_gemma":0.00017073043,"teacher_disagreement_score":0.0026940447,"about_ca_system_score_codex":0.00046840106,"about_ca_system_score_gemma":0.00033251615,"threshold_uncertainty_score":0.009012461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11887575,0.0019396377,0.86642677,0.0004952418,0.00008050116,0.000043689364,0.00009026311,0.00023018275,0.011817951],"genre_scores_gemma":[0.9484585,0.0012168642,0.04750274,0.000094996096,0.00006756885,0.00008786993,0.000082461025,0.000085067266,0.0024038735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990238,0.000260379,0.00006261945,0.00010541753,0.0004294586,0.00011832107],"domain_scores_gemma":[0.98702383,0.0103468895,0.0007777771,0.00075754046,0.0009146065,0.00017935113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029830544,0.0011510525,0.0006969141,0.0010665577,0.0003334186,0.0013335509,0.000864878,0.0007524162,0.0020559516],"category_scores_gemma":[0.020926204,0.0003431539,0.00046563678,0.00083252555,0.0018651986,0.0030756944,0.0016529354,0.001606274,0.0004062248],"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.00016764856,0.000032618456,0.0011663937,0.00015911458,0.00003795499,0.00023829615,0.00034514657,0.63377196,0.007822822,0.3381229,0.00069573335,0.017439459],"study_design_scores_gemma":[0.000004414281,0.000025598347,0.0002094009,0.000024984745,0.0000064688757,0.00006242818,0.000027280996,0.964116,0.0026665917,0.032565523,0.00027757758,0.000013802044],"about_ca_topic_score_codex":0.0012003251,"about_ca_topic_score_gemma":0.0010673449,"teacher_disagreement_score":0.0029830544,"about_ca_system_score_codex":0.0019466913,"about_ca_system_score_gemma":0.0007802827,"threshold_uncertainty_score":0.015776038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09888582,0.0041579097,0.86228204,0.0014799646,0.00014847222,0.00011171619,0.0004083335,0.0006256965,0.03190011],"genre_scores_gemma":[0.95757556,0.0038790368,0.025978716,0.00029120367,0.00025881373,0.00024807506,0.00034476494,0.00015270435,0.011271293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987206,0.00044515746,0.00003676758,0.000167115,0.00040137427,0.00022894208],"domain_scores_gemma":[0.99012893,0.0068037314,0.0010473233,0.00042096627,0.0012816738,0.0003173913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028586264,0.0015009957,0.0015238624,0.0015888218,0.00087896234,0.0016213955,0.0016076152,0.0016625165,0.00435011],"category_scores_gemma":[0.016564453,0.0009148956,0.00082883507,0.001119076,0.0026851173,0.0036001496,0.0022955134,0.0018400766,0.00084639183],"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.00017288407,0.00005622164,0.0014446734,0.000299968,0.00008513959,0.0008430757,0.00031118363,0.77328956,0.00544212,0.20600466,0.003551506,0.008499008],"study_design_scores_gemma":[0.000011915969,0.00004421758,0.0003853393,0.000028305429,0.000024827079,0.00018656641,0.00008324642,0.96973354,0.000409431,0.028437871,0.0006340279,0.000020679663],"about_ca_topic_score_codex":0.0052584726,"about_ca_topic_score_gemma":0.0032796378,"teacher_disagreement_score":0.0052584726,"about_ca_system_score_codex":0.002743807,"about_ca_system_score_gemma":0.0015051845,"threshold_uncertainty_score":0.019907832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05100636,0.006545853,0.9103506,0.0018097194,0.00023038797,0.00013929006,0.0002723336,0.00093653833,0.028708842],"genre_scores_gemma":[0.9284487,0.007807044,0.05180557,0.00062550674,0.0007088116,0.0007674749,0.00023793297,0.00037299402,0.009226049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998395,0.00051423284,0.00006391854,0.00018790553,0.0005089701,0.0003299676],"domain_scores_gemma":[0.98359656,0.012469074,0.0013636928,0.0009027546,0.0013835294,0.00028448686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964023,0.0013160645,0.001299711,0.0016403478,0.001020284,0.0022400697,0.0014431869,0.001304677,0.0039384835],"category_scores_gemma":[0.023282874,0.0007034078,0.0006925453,0.0015650108,0.0025070678,0.0035789078,0.0012431708,0.0022589657,0.0010183206],"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.00007846013,0.000056857167,0.00089546834,0.0003036409,0.00005298448,0.0004001888,0.00056951813,0.4224775,0.0038146935,0.5474946,0.005582375,0.01827368],"study_design_scores_gemma":[0.000012554788,0.000030513911,0.00046133235,0.000053629632,0.00001761342,0.00014516227,0.00006023529,0.8558256,0.00049468304,0.14085029,0.0020237402,0.000024772904],"about_ca_topic_score_codex":0.0026846346,"about_ca_topic_score_gemma":0.0010617296,"teacher_disagreement_score":0.0039384835,"about_ca_system_score_codex":0.0025584435,"about_ca_system_score_gemma":0.0009807363,"threshold_uncertainty_score":0.018562853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22595924,0.00038323365,0.75721854,0.00017050384,0.000062775485,0.00007930398,0.00015842375,0.00034305025,0.015624908],"genre_scores_gemma":[0.70541745,0.00043598004,0.2854942,0.000105645115,0.000053181215,0.00020872879,0.0003772641,0.00012253576,0.0077850483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999302,0.00024281656,0.000050912797,0.000102690356,0.00022016691,0.00008148149],"domain_scores_gemma":[0.9980951,0.0007726292,0.00023479458,0.00046743755,0.00028755263,0.00014252588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007292836,0.00044256425,0.00040030282,0.0012401874,0.00089560536,0.0007692124,0.00067519135,0.0004013574,0.0019378841],"category_scores_gemma":[0.0027641116,0.00039399075,0.000434133,0.0006866254,0.0011485553,0.0013836141,0.0012317442,0.0009252632,0.0004924614],"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.00022102254,0.000068122434,0.0011917565,0.00013285472,0.00002137207,0.00035874423,0.00039894466,0.02257085,0.04496732,0.84813076,0.0010746194,0.080863595],"study_design_scores_gemma":[0.00007653603,0.00045655968,0.0012948989,0.0001301836,0.0000749499,0.0015961865,0.00024673404,0.23791139,0.12095923,0.6039707,0.033167966,0.000114653165],"about_ca_topic_score_codex":0.00017449958,"about_ca_topic_score_gemma":0.00026012244,"teacher_disagreement_score":0.0019378841,"about_ca_system_score_codex":0.0004672425,"about_ca_system_score_gemma":0.00047469794,"threshold_uncertainty_score":0.006482899},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007560187,0.00043321977,0.99028546,0.00020313231,0.000023037966,0.000015637837,0.000040245577,0.00014904582,0.0012901333],"genre_scores_gemma":[0.73398155,0.0032366253,0.2541797,0.00048943155,0.00057678286,0.00053080474,0.0007074903,0.00055896724,0.00573873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961318,0.0019993512,0.00015565062,0.00042772686,0.0010932434,0.00019229874],"domain_scores_gemma":[0.9707826,0.022877377,0.0024626304,0.0015055868,0.002104827,0.00026702054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00960423,0.0011520517,0.0013887481,0.0012531738,0.0004612463,0.0011664813,0.0013494536,0.0010970661,0.0018124906],"category_scores_gemma":[0.044495676,0.00066573056,0.0010097581,0.0010033685,0.0025433213,0.0018309732,0.0019691368,0.0021868455,0.00042533118],"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.00013267889,0.000051538766,0.001950485,0.00030865512,0.00018665062,0.00030847325,0.00019277033,0.7316207,0.0047296053,0.21919236,0.0020600096,0.039266065],"study_design_scores_gemma":[0.00000695553,0.00003061061,0.00045238467,0.000019808565,0.0000138502,0.000051510648,0.000017176333,0.9513873,0.0005863856,0.046860687,0.0005571289,0.000016240652],"about_ca_topic_score_codex":0.0012207533,"about_ca_topic_score_gemma":0.0006828438,"teacher_disagreement_score":0.00960423,"about_ca_system_score_codex":0.0009210631,"about_ca_system_score_gemma":0.001226195,"threshold_uncertainty_score":0.050792634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055534262,0.0032211125,0.90942657,0.00031815137,0.0003232719,0.00013162325,0.00062562077,0.0008545642,0.029564794],"genre_scores_gemma":[0.65145993,0.0033481151,0.29330492,0.0006361949,0.00030790234,0.00046766954,0.0016443876,0.00034360032,0.048487213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.000116468225,0.000039733408,0.00014037767,0.00036655643,0.00013012612],"domain_scores_gemma":[0.9986191,0.00031072387,0.0001559848,0.00033098063,0.00048568528,0.000097563105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037843996,0.0005161968,0.0006591791,0.00091063464,0.0004738297,0.0012778778,0.0008408353,0.00065584696,0.0040692757],"category_scores_gemma":[0.002336106,0.000231472,0.0002549741,0.00094633957,0.00091368996,0.0015865738,0.00112106,0.0013635565,0.0018059363],"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.00036678696,0.00005096037,0.0010639225,0.00022807729,0.000035073685,0.00044507557,0.0002479262,0.04366266,0.0507011,0.71823245,0.006210735,0.17875528],"study_design_scores_gemma":[0.00012063025,0.00032038533,0.0010548157,0.00017542863,0.000043135275,0.0015349579,0.00006995894,0.45038214,0.055595517,0.38377494,0.10677999,0.00014814586],"about_ca_topic_score_codex":0.001084993,"about_ca_topic_score_gemma":0.0013613072,"teacher_disagreement_score":0.0040692757,"about_ca_system_score_codex":0.00065739953,"about_ca_system_score_gemma":0.0012536736,"threshold_uncertainty_score":0.013613045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26787853,0.00049278815,0.7250578,0.000118422526,0.000070749746,0.00006726977,0.00007850239,0.0010016604,0.0052342564],"genre_scores_gemma":[0.9052041,0.00016105839,0.090957254,0.00007141745,0.000027576321,0.00003526964,0.00009981202,0.000104425875,0.0033389858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867487,0.00031671507,0.00013226832,0.00021651051,0.00039025786,0.00026940208],"domain_scores_gemma":[0.99484754,0.0020768142,0.00060643675,0.0013344464,0.0009450648,0.00018958487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012296049,0.00061606406,0.000527625,0.00066166185,0.0006894942,0.00074907875,0.00082976633,0.0005206259,0.0011068438],"category_scores_gemma":[0.0058258115,0.0003649018,0.0005306395,0.0008896981,0.0015906942,0.0017155308,0.0017103066,0.00076095335,0.00041695093],"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.002396048,0.00018990785,0.0067869476,0.00043262352,0.00014194084,0.0016253139,0.00093042525,0.35386622,0.14802872,0.13344772,0.0021074305,0.35004675],"study_design_scores_gemma":[0.0000783085,0.000670815,0.0008666602,0.000064767715,0.00007791652,0.0009781952,0.00009978636,0.70296663,0.22571447,0.06486806,0.0035306863,0.0000836041],"about_ca_topic_score_codex":0.0008861468,"about_ca_topic_score_gemma":0.0012051223,"teacher_disagreement_score":0.0012296049,"about_ca_system_score_codex":0.00058767345,"about_ca_system_score_gemma":0.0009252513,"threshold_uncertainty_score":0.006502807},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057021193,0.0019508444,0.92534286,0.0011082598,0.000063633604,0.000048216974,0.00016618389,0.00029401216,0.014004789],"genre_scores_gemma":[0.90002054,0.0032581287,0.08887064,0.00035630018,0.00018236462,0.00012649495,0.00026718882,0.0002849602,0.006633367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980124,0.00088934216,0.00006513113,0.00022270628,0.000574177,0.00023621766],"domain_scores_gemma":[0.9805429,0.0144284675,0.0015724588,0.001095933,0.0021194522,0.00024091863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046678646,0.0012416064,0.00096502516,0.0010099645,0.00046700475,0.0017943333,0.0009410384,0.00076623034,0.0015817515],"category_scores_gemma":[0.025615271,0.0005959527,0.0006786253,0.0009917652,0.0029442082,0.0019097632,0.0014990068,0.002144769,0.0005018409],"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.00020242222,0.00003584924,0.0020113247,0.00016916203,0.000047291585,0.00046186254,0.0003479371,0.647788,0.00713663,0.31525818,0.002356121,0.024185218],"study_design_scores_gemma":[0.00000516185,0.000023837943,0.00041262285,0.000028475539,0.000007761916,0.00014920242,0.000037893788,0.9521068,0.0023388765,0.04419855,0.000669031,0.000021822087],"about_ca_topic_score_codex":0.0023149434,"about_ca_topic_score_gemma":0.001035397,"teacher_disagreement_score":0.0046678646,"about_ca_system_score_codex":0.002098878,"about_ca_system_score_gemma":0.0010874346,"threshold_uncertainty_score":0.024686337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33617392,0.0059562656,0.5753061,0.002219764,0.00021287084,0.000105533385,0.0010772672,0.00038914013,0.078559086],"genre_scores_gemma":[0.97452354,0.003261441,0.015524114,0.00017150115,0.00031073362,0.00016288194,0.00036235238,0.00017418942,0.005509206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806553,0.0006776341,0.00005494123,0.00018278933,0.000571545,0.0004475425],"domain_scores_gemma":[0.9817831,0.014509659,0.0007381948,0.0011407008,0.0015026579,0.000325807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003318904,0.0011841271,0.001168699,0.001917971,0.0008134204,0.0022625702,0.0016187755,0.00078152464,0.0041219634],"category_scores_gemma":[0.012940161,0.0005861991,0.00056660024,0.0017425797,0.0038475064,0.0043807123,0.0018444695,0.0019757617,0.0004817018],"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.00012563163,0.000047952075,0.0004083274,0.0001361247,0.000024824241,0.000179607,0.000113819995,0.40536836,0.0035151613,0.5815426,0.0015225847,0.0070149526],"study_design_scores_gemma":[0.000007345822,0.000018968725,0.00026381633,0.00004832603,0.000007027785,0.00006417508,0.000029558949,0.85518867,0.0012562673,0.14230935,0.0007804367,0.00002612858],"about_ca_topic_score_codex":0.0034143345,"about_ca_topic_score_gemma":0.0018377625,"teacher_disagreement_score":0.0041219634,"about_ca_system_score_codex":0.00339301,"about_ca_system_score_gemma":0.0017604697,"threshold_uncertainty_score":0.024618149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063064503,0.00018273098,0.9896058,0.00008743798,0.00005109018,0.0001607062,0.00021555932,0.0007616754,0.0026286473],"genre_scores_gemma":[0.04903811,0.00029823364,0.94597924,0.00009088893,0.000048239363,0.000513182,0.0006455171,0.00020707927,0.0031795122],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998522,0.00032005057,0.00016460172,0.00017277442,0.0006466877,0.00017388655],"domain_scores_gemma":[0.9954424,0.0023969677,0.0003637865,0.0006456709,0.0010403596,0.00011080693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012538771,0.0011650476,0.00090140855,0.0026082117,0.0011463134,0.001759389,0.0014265615,0.0010571687,0.0072214114],"category_scores_gemma":[0.009582352,0.0005116657,0.0006285662,0.0023297977,0.0009195704,0.00344039,0.0020764195,0.0014783808,0.0027245628],"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.00031647182,0.00014472137,0.0014987957,0.0003985039,0.000059783597,0.00015176623,0.0003058231,0.09166501,0.016279979,0.2856273,0.01043937,0.5931124],"study_design_scores_gemma":[0.000105824576,0.00013367011,0.00035001317,0.00010010702,0.00003136482,0.00042991672,0.00013693307,0.6921481,0.021138608,0.26787212,0.017467937,0.00008538478],"about_ca_topic_score_codex":0.0015712049,"about_ca_topic_score_gemma":0.0026820938,"teacher_disagreement_score":0.0072214114,"about_ca_system_score_codex":0.0010264296,"about_ca_system_score_gemma":0.0022559466,"threshold_uncertainty_score":0.024158001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08756595,0.0056120786,0.6641608,0.009407498,0.0008914386,0.00015774724,0.0011495794,0.00026062873,0.23079425],"genre_scores_gemma":[0.9077651,0.0035189763,0.055150773,0.0019092442,0.0027246948,0.00046636068,0.00077203225,0.00029800308,0.027394822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591833,0.0011265601,0.00019817722,0.00061991543,0.0015399265,0.00059715554],"domain_scores_gemma":[0.9884497,0.008779848,0.00048202157,0.0008694201,0.0010399311,0.0003789902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036708552,0.00091889064,0.0010618299,0.0016230907,0.0013673089,0.0032078307,0.0015668574,0.0015567177,0.010484079],"category_scores_gemma":[0.018537775,0.0004656106,0.0011022814,0.0012616807,0.0054202196,0.008016937,0.003877306,0.004293346,0.0013866831],"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.000028885135,0.000009329532,0.00018576397,0.000061317834,0.000010254962,0.00009311608,0.000098790406,0.004838098,0.0009426004,0.9854521,0.0017254693,0.006554291],"study_design_scores_gemma":[0.000007256779,0.000009960246,0.00017727776,0.000014737059,0.0000029525995,0.000035753605,0.000012466786,0.030432751,0.00032747415,0.9673899,0.0015787543,0.00001071364],"about_ca_topic_score_codex":0.0019097488,"about_ca_topic_score_gemma":0.0008008841,"teacher_disagreement_score":0.010484079,"about_ca_system_score_codex":0.0027353365,"about_ca_system_score_gemma":0.0012199925,"threshold_uncertainty_score":0.035072684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014124629,0.000567857,0.9656208,0.0010395612,0.0003681096,0.00007860621,0.00061831076,0.00048746867,0.0170946],"genre_scores_gemma":[0.48621702,0.0024945557,0.4701533,0.0008067036,0.00048344344,0.00028866928,0.0013585065,0.00016772909,0.038030054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.00010176273,0.000022360702,0.0000542152,0.00020942098,0.000057701105],"domain_scores_gemma":[0.9993129,0.00028636644,0.00004888679,0.00013099838,0.00019822636,0.000022718039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043259622,0.0006246861,0.00030724,0.0004280954,0.00028359014,0.00076175365,0.0004770349,0.00085809367,0.006493257],"category_scores_gemma":[0.0026634347,0.00019808444,0.00035797444,0.00085263286,0.00047974035,0.0006512043,0.00063389493,0.0009391928,0.002081436],"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.00040264727,0.00007345728,0.00069472357,0.0003974272,0.000079935315,0.00093136576,0.00028520424,0.3416246,0.029222922,0.39565122,0.024051223,0.20658533],"study_design_scores_gemma":[0.000041560197,0.00006349883,0.00040658424,0.000064715496,0.000020663574,0.00056109135,0.000037644964,0.9133036,0.007052188,0.06823167,0.010181362,0.00003539481],"about_ca_topic_score_codex":0.0041101575,"about_ca_topic_score_gemma":0.0068920883,"teacher_disagreement_score":0.006493257,"about_ca_system_score_codex":0.00063948665,"about_ca_system_score_gemma":0.0016454324,"threshold_uncertainty_score":0.021722138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044350114,0.020654202,0.65500647,0.020281343,0.0010464811,0.00016099644,0.0032904565,0.00015515603,0.25505474],"genre_scores_gemma":[0.8108175,0.012208575,0.13812871,0.00459565,0.0025780983,0.0006996655,0.0013223019,0.00014240252,0.029507121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610585,0.0013604512,0.00021319654,0.0006643254,0.0011196606,0.0005365133],"domain_scores_gemma":[0.9925764,0.005364711,0.00035192282,0.0005147324,0.0009943048,0.000197975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038637838,0.0007823868,0.0008394948,0.0015397487,0.0014363793,0.0034870328,0.0011173504,0.0012609876,0.0070866277],"category_scores_gemma":[0.013588087,0.00036877944,0.0009960206,0.0019224271,0.005212517,0.0052713784,0.0027130663,0.0043146447,0.00083302514],"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.0000071176664,0.0000022942006,0.000067053275,0.000025425685,0.0000052902024,0.0000099782965,0.00007267521,0.0010845633,0.00012075139,0.9925383,0.0013447526,0.004721933],"study_design_scores_gemma":[0.0000047680714,0.000008593495,0.00016262746,0.000022757224,0.000003355327,0.000015225894,0.000024707278,0.006782499,0.00011237213,0.9859304,0.0069255163,0.000007109632],"about_ca_topic_score_codex":0.0051772883,"about_ca_topic_score_gemma":0.0018940053,"teacher_disagreement_score":0.0070866277,"about_ca_system_score_codex":0.0046952227,"about_ca_system_score_gemma":0.0016196303,"threshold_uncertainty_score":0.03406638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020566218,0.00021270815,0.9760666,0.00011534308,0.00002006772,0.000011206029,0.000053878113,0.00016859607,0.0027853781],"genre_scores_gemma":[0.8294364,0.0012449716,0.16243367,0.00020105875,0.00009842005,0.00008929138,0.0002040056,0.0001438099,0.0061484533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995197,0.00013429894,0.000015603431,0.000056470537,0.00020984231,0.000064061365],"domain_scores_gemma":[0.99861014,0.0007577455,0.00012517064,0.000149353,0.00032391518,0.000033740373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008974248,0.000460157,0.00049449387,0.0006636518,0.0002892138,0.0005793726,0.0005775853,0.00068148825,0.00101588],"category_scores_gemma":[0.0042750044,0.00024123324,0.0005589075,0.0008086983,0.0010304403,0.001128618,0.0005846714,0.00069781125,0.0005105535],"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.000056231424,0.000014132365,0.0009117822,0.000039743492,0.000029888215,0.00015636712,0.000087755085,0.78413975,0.004528395,0.19295125,0.0008062957,0.016278375],"study_design_scores_gemma":[0.0000018580133,0.00001019614,0.00011163715,0.0000029315772,0.0000032975104,0.000030212954,0.0000051926813,0.97680366,0.0010230269,0.021673083,0.00032991508,0.0000051054335],"about_ca_topic_score_codex":0.004154304,"about_ca_topic_score_gemma":0.002766284,"teacher_disagreement_score":0.004154304,"about_ca_system_score_codex":0.00088370155,"about_ca_system_score_gemma":0.0013293688,"threshold_uncertainty_score":0.00826025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39097476,0.0014357347,0.5904437,0.001077554,0.00008615073,0.000066510955,0.00023734228,0.00020541172,0.015472935],"genre_scores_gemma":[0.98225635,0.0005795151,0.015058726,0.0000699356,0.00004852931,0.000034509645,0.000069258276,0.000026246744,0.001856956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991524,0.00019171934,0.000053030777,0.000112816,0.0003232527,0.00016681635],"domain_scores_gemma":[0.9860476,0.011009915,0.0011244665,0.00062497123,0.00090626685,0.00028671446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021794215,0.0008234156,0.0007479281,0.0007376545,0.0004079883,0.0012958982,0.00075313787,0.00073050056,0.0022387635],"category_scores_gemma":[0.013597696,0.0003103867,0.00034288247,0.0006942936,0.0016974121,0.0020600117,0.001476717,0.001461,0.00023665557],"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.0002967256,0.00005492773,0.0015214382,0.00019600026,0.000047358746,0.0005592987,0.00035961354,0.69766325,0.008896579,0.27449405,0.0009534251,0.014957294],"study_design_scores_gemma":[0.000017091921,0.000055669534,0.00035838762,0.000025897183,0.000016673665,0.00015443304,0.000054375232,0.95897174,0.0034019558,0.036596682,0.00032240004,0.000024733828],"about_ca_topic_score_codex":0.0015621225,"about_ca_topic_score_gemma":0.0010317212,"teacher_disagreement_score":0.0022387635,"about_ca_system_score_codex":0.001754739,"about_ca_system_score_gemma":0.0009487012,"threshold_uncertainty_score":0.012731612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07210323,0.003793584,0.8702205,0.0026496218,0.0004898209,0.0002830279,0.0013734158,0.0011628611,0.04792398],"genre_scores_gemma":[0.7379865,0.005025709,0.23371308,0.0013695084,0.0015094752,0.0012564057,0.0018789036,0.0009449892,0.016315365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902264,0.002325664,0.0005311525,0.0012963085,0.0037813191,0.0018391227],"domain_scores_gemma":[0.9378693,0.043460753,0.0035688425,0.0061624916,0.007143872,0.0017946886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00789462,0.0026779773,0.0022829063,0.0057989983,0.0026276594,0.004282993,0.0030096106,0.0032240087,0.017059984],"category_scores_gemma":[0.067085795,0.001612457,0.0028728761,0.0037530882,0.0059149032,0.01404195,0.0063952403,0.009223382,0.0034763454],"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.00072062307,0.00018605399,0.0013647897,0.0006261485,0.0001099312,0.00042792578,0.000803477,0.067142524,0.011761111,0.85819054,0.009218909,0.04944788],"study_design_scores_gemma":[0.0000783546,0.00022418899,0.00089471776,0.0003356803,0.00014695468,0.00052216946,0.0002583646,0.25830266,0.014706123,0.7141294,0.010180375,0.00022104882],"about_ca_topic_score_codex":0.0022718452,"about_ca_topic_score_gemma":0.0017967519,"teacher_disagreement_score":0.017059984,"about_ca_system_score_codex":0.006469056,"about_ca_system_score_gemma":0.002892414,"threshold_uncertainty_score":0.05707133},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565079,0.0036998368,0.86513895,0.0014607352,0.00019073092,0.00018116119,0.00035606528,0.0003807845,0.022941006],"genre_scores_gemma":[0.87170416,0.0033935823,0.116423234,0.00032506092,0.0003957872,0.0003563286,0.00016916369,0.00015283628,0.007079861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977077,0.0010865569,0.00008410702,0.0003952173,0.00031443025,0.00041187654],"domain_scores_gemma":[0.9890842,0.008756496,0.00074437837,0.00032243252,0.0006433297,0.0004492189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028935075,0.0018162221,0.002221529,0.0014085424,0.0012569256,0.0023385778,0.0020067932,0.001566606,0.0031295817],"category_scores_gemma":[0.01681799,0.0013471716,0.00046267387,0.0014155209,0.0024931496,0.0031815264,0.0018390198,0.0013623306,0.0008291565],"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.0015681756,0.00019201223,0.0012870173,0.00058928976,0.00013521219,0.00024297263,0.0003682218,0.77387995,0.015001602,0.13598734,0.0068115396,0.063936606],"study_design_scores_gemma":[0.00014708156,0.00014929223,0.000292936,0.00006287551,0.000045026383,0.000104966304,0.000113153794,0.94769955,0.0022490276,0.047573026,0.0015321064,0.00003090887],"about_ca_topic_score_codex":0.0019261102,"about_ca_topic_score_gemma":0.00250635,"teacher_disagreement_score":0.0031295817,"about_ca_system_score_codex":0.0019670387,"about_ca_system_score_gemma":0.0019426155,"threshold_uncertainty_score":0.015302539},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45842275,0.0021313694,0.44859284,0.0009132265,0.000522202,0.00009681319,0.00030044932,0.00030384425,0.08871649],"genre_scores_gemma":[0.9219827,0.0010593556,0.057424337,0.0003328883,0.00035352743,0.000074236916,0.00025913655,0.000114277354,0.01839952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999275,0.00018322529,0.00002676922,0.00010960599,0.00026173922,0.0001436159],"domain_scores_gemma":[0.9988809,0.00032767098,0.00017433071,0.00021463993,0.00028521483,0.00011728547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059890305,0.00029616174,0.00027406143,0.0009640198,0.0009262423,0.00072720647,0.0004196285,0.0004685357,0.0036735563],"category_scores_gemma":[0.001563039,0.0002012809,0.00046148885,0.00069344783,0.0017443947,0.0012950617,0.0012020442,0.0008342862,0.00059270655],"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.00003234324,0.0000129181435,0.00043954517,0.000052330914,0.0000048604634,0.00011562628,0.00020270723,0.0041998816,0.0026732741,0.9820286,0.0007460736,0.009491953],"study_design_scores_gemma":[0.000027012393,0.00014922605,0.00080148,0.000058032892,0.000015476715,0.0008241151,0.00017352027,0.057241578,0.009939755,0.90670973,0.024000619,0.000059469192],"about_ca_topic_score_codex":0.0009342195,"about_ca_topic_score_gemma":0.0005638161,"teacher_disagreement_score":0.0036735563,"about_ca_system_score_codex":0.00067978166,"about_ca_system_score_gemma":0.00063848397,"threshold_uncertainty_score":0.012289286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912944,0.0001903292,0.93364966,0.00017028782,0.00001829281,0.000054630116,0.00006405427,0.00011014916,0.006613013],"genre_scores_gemma":[0.6771205,0.00069238234,0.31778958,0.00014552935,0.00007086949,0.000262509,0.00024789077,0.0001512028,0.0035195076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913824,0.00017427189,0.000044640856,0.00006289009,0.00048970984,0.00009010909],"domain_scores_gemma":[0.9949739,0.0029386443,0.00042543883,0.00047972094,0.001079434,0.000102848695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301257,0.0005183645,0.0003238975,0.0010327863,0.0005685837,0.0009099733,0.000620268,0.0005828408,0.0014197606],"category_scores_gemma":[0.010424619,0.00039062134,0.00038902412,0.0010927785,0.001207215,0.0016277954,0.0008084371,0.00090895896,0.00032321637],"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.00007168308,0.000046051064,0.0010139295,0.0000822201,0.000014508004,0.00011123828,0.00017594788,0.1504728,0.011649275,0.7855651,0.00072553457,0.05007168],"study_design_scores_gemma":[0.000009160068,0.000060679293,0.00033350612,0.000030182006,0.000011600457,0.0001343806,0.00002571863,0.75676095,0.007749596,0.2333363,0.0015300413,0.00001789581],"about_ca_topic_score_codex":0.0012171356,"about_ca_topic_score_gemma":0.0017549845,"teacher_disagreement_score":0.0014197606,"about_ca_system_score_codex":0.0010756719,"about_ca_system_score_gemma":0.0016807609,"threshold_uncertainty_score":0.0078045726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024699965,0.0011409124,0.96786356,0.0002911311,0.000071291084,0.00005216632,0.000081887614,0.00016625779,0.0056327595],"genre_scores_gemma":[0.87474537,0.0020410765,0.11637686,0.00017989853,0.0003622552,0.0001854589,0.00014762937,0.000055222547,0.0059061637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863154,0.00076298934,0.00002354547,0.000118982476,0.0002961995,0.00016673477],"domain_scores_gemma":[0.9973557,0.0021849268,0.00010106703,0.000109377324,0.00019268545,0.000056180645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011327043,0.0007180414,0.0010843715,0.0005184621,0.0006968274,0.0010276439,0.000603678,0.0006670744,0.0025161288],"category_scores_gemma":[0.0051155705,0.00036366703,0.0003291119,0.0010640667,0.00088540494,0.0008495354,0.0007488232,0.0005992431,0.00055273226],"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.00077092985,0.00007917082,0.0017271558,0.00030282795,0.00008927293,0.00048826015,0.0002871003,0.75140095,0.007658399,0.12120803,0.007214452,0.10877344],"study_design_scores_gemma":[0.00003205037,0.000054218846,0.00020954193,0.0000123813625,0.000019751915,0.00010129172,0.000027296664,0.98463744,0.0011099016,0.012255716,0.0015271864,0.000013246829],"about_ca_topic_score_codex":0.0028112305,"about_ca_topic_score_gemma":0.0030855718,"teacher_disagreement_score":0.0028112305,"about_ca_system_score_codex":0.0007587857,"about_ca_system_score_gemma":0.0009474759,"threshold_uncertainty_score":0.008417249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41572568,0.0015575258,0.5481444,0.0006401551,0.00012183238,0.00007849528,0.0002871033,0.00031361723,0.03313125],"genre_scores_gemma":[0.91499585,0.0007885161,0.07823672,0.00020390484,0.00013941404,0.00011977279,0.00022801047,0.00007782512,0.0052099996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889475,0.00029030358,0.00006713504,0.00023603719,0.00033732856,0.00017445219],"domain_scores_gemma":[0.99680954,0.0016616167,0.0006104369,0.0004860927,0.0002641908,0.00016819192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009635184,0.00051375,0.00045346678,0.0013368452,0.0011960929,0.00097354146,0.0004363554,0.0007723239,0.0027084101],"category_scores_gemma":[0.0057688826,0.00038851454,0.00046084615,0.0011331431,0.0016081884,0.0028915727,0.0011489656,0.0011970572,0.00060045085],"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.00016442091,0.000030074001,0.0011476281,0.00011148068,0.000014984213,0.00046724876,0.00034608942,0.01097165,0.015734466,0.92743725,0.001035778,0.042538922],"study_design_scores_gemma":[0.000030396901,0.00038904915,0.0019130905,0.00010934993,0.00003464265,0.0024317591,0.00025602776,0.07679713,0.051691655,0.8437943,0.022443864,0.000108760854],"about_ca_topic_score_codex":0.0002069753,"about_ca_topic_score_gemma":0.00019416187,"teacher_disagreement_score":0.0027084101,"about_ca_system_score_codex":0.00068253314,"about_ca_system_score_gemma":0.00046867906,"threshold_uncertainty_score":0.009060502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010577935,0.0001956128,0.98775136,0.0002553584,0.000024314251,0.00005904581,0.00022930623,0.0003041948,0.00060283614],"genre_scores_gemma":[0.5008949,0.0007313923,0.49167866,0.00031199178,0.00018601965,0.0006058502,0.002849767,0.00026147428,0.0024799723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942199,0.0023457624,0.00029131613,0.001988668,0.00084410363,0.00031023636],"domain_scores_gemma":[0.92480916,0.06317145,0.0039211493,0.0049727866,0.0023731317,0.00075233023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00689585,0.0010730042,0.0019175628,0.004077739,0.0013813212,0.0022332221,0.0041198344,0.0025041623,0.0032393946],"category_scores_gemma":[0.063988365,0.0014957451,0.0019866044,0.0031943938,0.002835048,0.0049722544,0.0036091667,0.004551261,0.0009531016],"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.00027797665,0.00012190523,0.009944507,0.00036020292,0.00025374253,0.00040425075,0.00038287367,0.76148254,0.0015555684,0.15263447,0.0029093027,0.06967268],"study_design_scores_gemma":[0.000013483274,0.000010810583,0.00049226684,0.000025090167,0.000016615026,0.000059439728,0.000029694804,0.8800674,0.00058476813,0.117956705,0.000732495,0.000011201269],"about_ca_topic_score_codex":0.0068115145,"about_ca_topic_score_gemma":0.009067578,"teacher_disagreement_score":0.00689585,"about_ca_system_score_codex":0.0019688134,"about_ca_system_score_gemma":0.002021828,"threshold_uncertainty_score":0.03646922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027165055,0.00036965864,0.9570019,0.0017225243,0.00012771325,0.0002083845,0.00037313713,0.00023039593,0.0128011955],"genre_scores_gemma":[0.88043916,0.00095084053,0.106553786,0.00075501413,0.00038412542,0.001326976,0.00070737704,0.00016719001,0.008715449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895112,0.0031095173,0.00076020753,0.002219585,0.0030324073,0.0013671122],"domain_scores_gemma":[0.9714983,0.020422662,0.0021131916,0.0040297215,0.001496929,0.00043907925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983493,0.0012075474,0.0018268392,0.0013223492,0.002130414,0.0045672064,0.0022326973,0.0038639691,0.0069521684],"category_scores_gemma":[0.03166406,0.0010466145,0.0025177894,0.0016265397,0.010815097,0.015364981,0.0048580626,0.006874766,0.001936256],"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.000111211244,0.000019486664,0.00014654845,0.000054323038,0.000014611619,0.00013261804,0.0001809606,0.008191499,0.0011057229,0.9871159,0.0005694016,0.0023576429],"study_design_scores_gemma":[0.00006822654,0.000042566317,0.000052339994,0.000025660509,0.000011422608,0.00014464771,0.00003203327,0.062757514,0.003023368,0.93194276,0.0018794542,0.000019941815],"about_ca_topic_score_codex":0.000621399,"about_ca_topic_score_gemma":0.0003039426,"teacher_disagreement_score":0.00983493,"about_ca_system_score_codex":0.002721956,"about_ca_system_score_gemma":0.0027746626,"threshold_uncertainty_score":0.052012682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7798539,0.0011726775,0.18440017,0.0024892532,0.00022626088,0.000056375222,0.00021785502,0.00024592123,0.031337548],"genre_scores_gemma":[0.9795115,0.00041995122,0.016817322,0.00018593851,0.00010314787,0.000017128372,0.00011115206,0.00001968863,0.0028141716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994924,0.00009523098,0.000021178781,0.00007857196,0.00019596897,0.000116527306],"domain_scores_gemma":[0.998041,0.00087621243,0.00033925474,0.0002493048,0.00033612223,0.00015818179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008206849,0.00028804457,0.0003539329,0.0009667529,0.0009167779,0.00075289566,0.00046181513,0.00069966784,0.0014670019],"category_scores_gemma":[0.0043067224,0.00015743748,0.00023919692,0.00069012376,0.002150188,0.001235069,0.0007714498,0.00075444666,0.00023298185],"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.00016232708,0.000022352877,0.0016487747,0.00005600669,0.000004742909,0.0007015945,0.00031476872,0.011136216,0.007464565,0.96677923,0.000800026,0.010909294],"study_design_scores_gemma":[0.000032532887,0.00014957965,0.0009329303,0.000054545344,0.000010537797,0.0015137208,0.00021805636,0.09949637,0.015839584,0.87345546,0.008227981,0.00006855136],"about_ca_topic_score_codex":0.0013438163,"about_ca_topic_score_gemma":0.0008564207,"teacher_disagreement_score":0.0014670019,"about_ca_system_score_codex":0.0008693467,"about_ca_system_score_gemma":0.0009141994,"threshold_uncertainty_score":0.006307602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027063988,0.025058394,0.8760565,0.0063691773,0.0009636564,0.00007971002,0.00006254721,0.0001609723,0.064185046],"genre_scores_gemma":[0.9015001,0.021350194,0.05893704,0.0010460998,0.002352145,0.00016991969,0.000047001395,0.00004065925,0.014556904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894756,0.00044289653,0.000030821713,0.00018833471,0.0003111808,0.000079184225],"domain_scores_gemma":[0.9989505,0.0005773029,0.00013554315,0.00015743819,0.00013815824,0.000041065552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008360202,0.0004595071,0.0006566156,0.00053900084,0.0005723772,0.001432596,0.000785764,0.0018270201,0.0017920902],"category_scores_gemma":[0.0024982495,0.00030924304,0.00034110603,0.0012448783,0.0018771089,0.0025215633,0.0010518107,0.0015947737,0.00036255896],"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.000041484316,0.00003281952,0.00036184612,0.0003080931,0.00003611721,0.00044448976,0.00015342826,0.09316101,0.0022689623,0.86332476,0.0035513416,0.036315724],"study_design_scores_gemma":[0.000034295503,0.00014392643,0.0007350584,0.00012870268,0.000034582885,0.0010130209,0.00016337707,0.34022632,0.00094443694,0.61677665,0.039762933,0.000036640195],"about_ca_topic_score_codex":0.0009632664,"about_ca_topic_score_gemma":0.0010148928,"teacher_disagreement_score":0.0018270201,"about_ca_system_score_codex":0.0013609722,"about_ca_system_score_gemma":0.000669323,"threshold_uncertainty_score":0.009874582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35422158,0.0020776999,0.6239325,0.0008936588,0.000078630226,0.00007990887,0.00043272332,0.00022476788,0.018058565],"genre_scores_gemma":[0.98030955,0.00066670316,0.01726784,0.000053760028,0.000026145857,0.00006690371,0.0000722185,0.000029369508,0.00150738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878687,0.00041954152,0.000036975944,0.0001377851,0.0002997273,0.00031912138],"domain_scores_gemma":[0.98809135,0.010029735,0.00058681314,0.0004433616,0.0006629913,0.00018563354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017286778,0.00079757004,0.00066581875,0.000707728,0.00046140436,0.0016465135,0.0011148825,0.0009923493,0.0021224692],"category_scores_gemma":[0.013313592,0.00025783133,0.00038799178,0.0011572333,0.0022394336,0.002519083,0.0010875448,0.0010677945,0.00023535003],"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.00018931286,0.000043769567,0.000740893,0.00016672265,0.000027215061,0.00013968577,0.00009326836,0.7270194,0.0043790047,0.2542052,0.0005965351,0.012398937],"study_design_scores_gemma":[0.00000927112,0.00003191268,0.00027342176,0.000023934681,0.000013550128,0.00006488635,0.000038951475,0.9560171,0.0024153492,0.040746033,0.00034765806,0.000017978758],"about_ca_topic_score_codex":0.0023962648,"about_ca_topic_score_gemma":0.0013874368,"teacher_disagreement_score":0.0024900686,"about_ca_system_score_codex":0.0024900686,"about_ca_system_score_gemma":0.0011815712,"threshold_uncertainty_score":0.018066823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058195837,0.0038037193,0.89952385,0.0011513672,0.00026016744,0.0000511103,0.0003056842,0.00028851238,0.036419753],"genre_scores_gemma":[0.82396907,0.0039836913,0.1541997,0.00056567264,0.0008414972,0.0001844182,0.0006483267,0.00020802871,0.015399709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823606,0.0006989272,0.00008619869,0.00020837209,0.00061128783,0.00015916328],"domain_scores_gemma":[0.9962321,0.0022168793,0.00031916716,0.0006817144,0.00046733636,0.000082938044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017308523,0.000955741,0.0006733211,0.001059377,0.00054507656,0.0009434574,0.0011612595,0.0010362176,0.0030735692],"category_scores_gemma":[0.009417063,0.00036868735,0.00050448906,0.0011758326,0.0014139189,0.0019143806,0.0015839889,0.0014944631,0.00087060337],"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.0004312238,0.000023698089,0.0006198759,0.0002501415,0.000046940168,0.0006579944,0.00034410667,0.07854705,0.011426027,0.83809936,0.005701466,0.06385216],"study_design_scores_gemma":[0.000037084665,0.00010707875,0.000481876,0.00016561872,0.000043579807,0.0007441427,0.00006127701,0.54122597,0.0073604644,0.44099134,0.008719259,0.000062242696],"about_ca_topic_score_codex":0.0013242554,"about_ca_topic_score_gemma":0.00091014104,"teacher_disagreement_score":0.0030735692,"about_ca_system_score_codex":0.0009905654,"about_ca_system_score_gemma":0.00078728626,"threshold_uncertainty_score":0.010282099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32364616,0.0012402927,0.5396895,0.0009444049,0.00061723543,0.00016827002,0.00072809967,0.0012419582,0.13172409],"genre_scores_gemma":[0.803003,0.00086215755,0.14924368,0.00048613982,0.0003842812,0.00035756998,0.0012641167,0.00061472115,0.04378435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00015374637,0.000035393918,0.00009882566,0.00012406525,0.00008234011],"domain_scores_gemma":[0.9991736,0.000251641,0.000120203746,0.00012860229,0.00017141926,0.0001545715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686772,0.0006255821,0.0005815967,0.0018775477,0.0010771444,0.0011131051,0.000779927,0.000619771,0.007736058],"category_scores_gemma":[0.0022280696,0.0005361392,0.00077801594,0.0008167345,0.0010476401,0.001665993,0.0019195636,0.0015136631,0.0024685864],"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.00016936865,0.00006113277,0.00087024225,0.00015583847,0.000017256583,0.0004359454,0.0005057193,0.0034374793,0.014197897,0.9200199,0.0057754433,0.054353863],"study_design_scores_gemma":[0.00009359805,0.0003004091,0.0016767912,0.0001244357,0.00003623904,0.0014703339,0.00029479808,0.054715812,0.017326577,0.87508893,0.048787374,0.0000845871],"about_ca_topic_score_codex":0.00029458618,"about_ca_topic_score_gemma":0.00042557594,"teacher_disagreement_score":0.007736058,"about_ca_system_score_codex":0.0009403882,"about_ca_system_score_gemma":0.00056955003,"threshold_uncertainty_score":0.025879681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13589844,0.00054271054,0.86074394,0.0001591834,0.000040063132,0.000024693385,0.00004656704,0.00020894592,0.0023354895],"genre_scores_gemma":[0.9728166,0.00011433689,0.026241282,0.000036380243,0.000058490095,0.000027289645,0.00002134049,0.000027992966,0.0006563947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780875,0.00075699406,0.000060159,0.00023724351,0.0005419101,0.0005948975],"domain_scores_gemma":[0.9925332,0.0049976157,0.00071561604,0.0006423912,0.00080407335,0.00030704704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003342956,0.0007264363,0.0013096181,0.00055742246,0.0012129921,0.0013561855,0.001186982,0.00084805087,0.0006858756],"category_scores_gemma":[0.008402053,0.00034051292,0.00029433463,0.0009114094,0.0014187666,0.0015352827,0.0011586683,0.0007658073,0.00022947958],"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.0009838226,0.00018471082,0.0021449996,0.00013445113,0.00009678391,0.00044988506,0.00036230215,0.82908195,0.030196553,0.09239203,0.00091958645,0.04305287],"study_design_scores_gemma":[0.00004138838,0.00012701021,0.00036818188,0.0000060485154,0.000021754866,0.00010002085,0.00003448946,0.9636239,0.0057581826,0.029438874,0.0004631867,0.000016981285],"about_ca_topic_score_codex":0.0018362445,"about_ca_topic_score_gemma":0.0021467654,"teacher_disagreement_score":0.003342956,"about_ca_system_score_codex":0.0015777758,"about_ca_system_score_gemma":0.0015695436,"threshold_uncertainty_score":0.017679453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21916255,0.0014615292,0.764412,0.00042681623,0.000116542324,0.00018115097,0.0004666239,0.0008033855,0.012969429],"genre_scores_gemma":[0.89300734,0.00044776883,0.10411237,0.000105685875,0.0000969339,0.00017037774,0.0004530035,0.0001403154,0.0014661065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972377,0.00086876267,0.00024349453,0.0003147122,0.001151606,0.0001837902],"domain_scores_gemma":[0.9857519,0.0074670864,0.0017822477,0.001681513,0.0030228437,0.000294336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002814803,0.0010586274,0.0006713226,0.0020124374,0.0006543267,0.0014139129,0.0006855345,0.0010838634,0.00132379],"category_scores_gemma":[0.021245053,0.00015802584,0.00029844148,0.0015618228,0.0018813835,0.002452245,0.0014953221,0.0008285875,0.0006146058],"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.001099852,0.00022231843,0.016445229,0.00063080934,0.00015915574,0.0002860296,0.0005663583,0.3009527,0.1711189,0.19830514,0.0032498515,0.30696365],"study_design_scores_gemma":[0.000026111009,0.0014686366,0.010039449,0.00011911445,0.000059912105,0.0013824274,0.00030903984,0.7718913,0.14553028,0.060510326,0.0084810555,0.00018240881],"about_ca_topic_score_codex":0.00065872347,"about_ca_topic_score_gemma":0.00057816337,"teacher_disagreement_score":0.002814803,"about_ca_system_score_codex":0.001479337,"about_ca_system_score_gemma":0.0008068444,"threshold_uncertainty_score":0.01488626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06450352,0.0034136635,0.9063062,0.00088917284,0.00034635622,0.000048608734,0.0005753521,0.00029154954,0.023625558],"genre_scores_gemma":[0.90959096,0.011352528,0.051929027,0.0007072547,0.0011909993,0.00016718674,0.00089524215,0.00016453856,0.024002284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.0002655666,0.000020360505,0.000114893825,0.00024103562,0.00011828878],"domain_scores_gemma":[0.9984144,0.00093007024,0.00014000709,0.00011708343,0.0003620002,0.000036427165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594122,0.0012190517,0.0008658156,0.0006449162,0.00041491768,0.000966495,0.0006190546,0.0007784698,0.003508708],"category_scores_gemma":[0.0030729964,0.00048091385,0.0006162599,0.0012949457,0.0010418955,0.001343822,0.00090972835,0.0012228901,0.0013398577],"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.00014206795,0.00003231796,0.0011956374,0.0003046633,0.000106532105,0.00092954235,0.00029841304,0.82162434,0.009803418,0.13311794,0.00647705,0.025968075],"study_design_scores_gemma":[0.000009636797,0.000037694124,0.00090939004,0.000034893263,0.00002410292,0.00022471801,0.000056042776,0.96589404,0.0010522557,0.029897423,0.0018165674,0.00004333315],"about_ca_topic_score_codex":0.005353847,"about_ca_topic_score_gemma":0.005872235,"teacher_disagreement_score":0.005353847,"about_ca_system_score_codex":0.00079083414,"about_ca_system_score_gemma":0.0007620197,"threshold_uncertainty_score":0.0117378235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37523866,0.0010363332,0.615796,0.00052585185,0.000064245134,0.000082376355,0.00011922326,0.00018076823,0.0069565536],"genre_scores_gemma":[0.9863853,0.00034093513,0.012165,0.00003793656,0.000025305806,0.000043296535,0.000037156176,0.000024382538,0.0009407347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988128,0.0003753738,0.0000891415,0.00013632685,0.00040461402,0.00018173196],"domain_scores_gemma":[0.9826804,0.013542983,0.0016523814,0.0008143827,0.001113428,0.0001964799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025096687,0.0008439087,0.00075201475,0.0008550986,0.00046594336,0.0012020476,0.00070899515,0.000800257,0.0011234436],"category_scores_gemma":[0.019731594,0.00032953825,0.00031734022,0.0006887981,0.0014933911,0.002101476,0.0014541245,0.0015130448,0.00020117269],"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.00021076787,0.000052613832,0.002208939,0.00014926065,0.000035641813,0.0005706939,0.00053470494,0.78530586,0.010350177,0.1874341,0.0006290488,0.012518227],"study_design_scores_gemma":[0.000008707392,0.000029427445,0.00024824825,0.000015248088,0.00000819898,0.00009507897,0.000038377693,0.9727544,0.0021449795,0.024479125,0.00016359195,0.000014600646],"about_ca_topic_score_codex":0.00073260703,"about_ca_topic_score_gemma":0.00043985806,"teacher_disagreement_score":0.0025096687,"about_ca_system_score_codex":0.0012467531,"about_ca_system_score_gemma":0.0006148583,"threshold_uncertainty_score":0.0132725835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073810294,0.0004600843,0.92161924,0.0007803459,0.00004542634,0.000046035686,0.00019650033,0.00016564433,0.0028763597],"genre_scores_gemma":[0.8302518,0.0010343859,0.16208708,0.0002636738,0.00016474185,0.00016889807,0.001003124,0.00013708118,0.004889088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.00029749106,0.000055854234,0.00019122132,0.00036626455,0.00010570774],"domain_scores_gemma":[0.9938539,0.004381109,0.0007002568,0.00042488033,0.00050441,0.00013542408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020253535,0.001537423,0.0011474846,0.0006921643,0.00032707874,0.00097409583,0.0010962737,0.0016666251,0.0019040004],"category_scores_gemma":[0.016368655,0.0005745394,0.0007354523,0.0006272299,0.0017859897,0.002579552,0.0021106498,0.001407451,0.00054175773],"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.0010938898,0.000176847,0.0020302495,0.00074458704,0.0001792334,0.00058523956,0.00032595656,0.7203965,0.06273185,0.13203488,0.002467127,0.077233694],"study_design_scores_gemma":[0.00001954232,0.00008352745,0.00023771416,0.000026096106,0.0000119763245,0.000072411305,0.000025995309,0.9770362,0.008940342,0.013041672,0.00048610207,0.00001837532],"about_ca_topic_score_codex":0.0014018568,"about_ca_topic_score_gemma":0.00093697663,"teacher_disagreement_score":0.0020253535,"about_ca_system_score_codex":0.0004732905,"about_ca_system_score_gemma":0.000813422,"threshold_uncertainty_score":0.010711193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6634348,0.00068696437,0.31026068,0.0010657527,0.00023465775,0.00011935505,0.0004853639,0.00089013943,0.022822324],"genre_scores_gemma":[0.95041907,0.0004215076,0.041580725,0.00045863085,0.0002674249,0.00026231195,0.000658955,0.00019207616,0.005739256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974485,0.00062252115,0.00020906806,0.00049765164,0.0008487986,0.0003734801],"domain_scores_gemma":[0.9714145,0.014940944,0.0035021713,0.0053936155,0.0031800475,0.0015686835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018335065,0.00065681775,0.0010781834,0.001841821,0.0016385254,0.0019126729,0.00089018425,0.0021146033,0.003598908],"category_scores_gemma":[0.022041114,0.00074543775,0.0007711841,0.0016808033,0.0026092005,0.003953501,0.0023200733,0.001683009,0.001065156],"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.0016030503,0.0002379574,0.012347612,0.00042772983,0.00016577651,0.0014952734,0.0011304572,0.033166513,0.0348661,0.8201042,0.005109881,0.089345396],"study_design_scores_gemma":[0.00023291241,0.0007355884,0.0052632163,0.00015673519,0.0001055573,0.004521501,0.00059093,0.14456488,0.055181894,0.7735801,0.014891831,0.00017479106],"about_ca_topic_score_codex":0.00017703947,"about_ca_topic_score_gemma":0.00013553126,"teacher_disagreement_score":0.003598908,"about_ca_system_score_codex":0.00037221255,"about_ca_system_score_gemma":0.0006831305,"threshold_uncertainty_score":0.012039542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37831315,0.006046731,0.6005962,0.0015645492,0.00030687838,0.00007843917,0.00036181463,0.00030588376,0.012426277],"genre_scores_gemma":[0.9824034,0.0016019393,0.013542555,0.00008202973,0.00013855836,0.00005579412,0.000105968546,0.00006321469,0.0020065878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793774,0.0006339693,0.0001048468,0.00019953925,0.00071984285,0.0004040422],"domain_scores_gemma":[0.9607247,0.032727476,0.0027190147,0.0010673761,0.002334955,0.00042648197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036079735,0.0011836676,0.0009991907,0.0014276692,0.00063228904,0.0015499805,0.0010737056,0.0010032171,0.0016774717],"category_scores_gemma":[0.029062727,0.0004138395,0.00032109473,0.0011390022,0.002170936,0.0028811686,0.0016484265,0.0015425377,0.00024472977],"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.00051713426,0.000058735248,0.002909091,0.00027984087,0.000056998073,0.00051711797,0.00043327452,0.575638,0.0072245803,0.3817372,0.0014721075,0.029155895],"study_design_scores_gemma":[0.000018867173,0.00007881305,0.0004942021,0.00007042874,0.000015637124,0.00014684824,0.000045744226,0.8834401,0.002322048,0.11290401,0.00042426653,0.000039117076],"about_ca_topic_score_codex":0.0016575828,"about_ca_topic_score_gemma":0.0008990553,"teacher_disagreement_score":0.0036079735,"about_ca_system_score_codex":0.0017094795,"about_ca_system_score_gemma":0.0013725647,"threshold_uncertainty_score":0.019080997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300741,0.001734313,0.4351495,0.0021057557,0.00021453387,0.00015132826,0.00061499566,0.0008307635,0.029124709],"genre_scores_gemma":[0.98318845,0.00048223688,0.0131391855,0.00014015804,0.0000750199,0.00007973514,0.00012880577,0.00011019811,0.0026562607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985328,0.0004920765,0.000047081412,0.00016693943,0.00039064014,0.0003703473],"domain_scores_gemma":[0.958919,0.030183665,0.004022105,0.00431701,0.0018593054,0.00069897046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037929327,0.0007577113,0.0009366053,0.0009132292,0.00064044574,0.001411551,0.001008774,0.00069884385,0.0046970723],"category_scores_gemma":[0.04172522,0.00044997555,0.00038330202,0.0010045962,0.0020573167,0.0022998794,0.0018592161,0.0020651664,0.0005566539],"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.0005920121,0.00010515603,0.004404941,0.00017986688,0.00005155824,0.0003949187,0.00041611487,0.80929005,0.027347328,0.104408406,0.0018398373,0.05096976],"study_design_scores_gemma":[0.00004362808,0.00019090631,0.0036652263,0.00006231206,0.00002881251,0.000559719,0.00018521406,0.9243671,0.021477433,0.048084866,0.0012640292,0.00007080165],"about_ca_topic_score_codex":0.0012202174,"about_ca_topic_score_gemma":0.0006733384,"teacher_disagreement_score":0.0046970723,"about_ca_system_score_codex":0.001406927,"about_ca_system_score_gemma":0.0011630252,"threshold_uncertainty_score":0.020059168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11612239,0.00045273546,0.8804743,0.00016410938,0.000037558762,0.000023886238,0.00004176825,0.00017629117,0.0025069977],"genre_scores_gemma":[0.8673156,0.0005896288,0.12831977,0.000081943195,0.000044730597,0.000047051984,0.00011812724,0.00008697572,0.0033960706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819523,0.00050922635,0.000097990625,0.00030927433,0.000756993,0.00013125293],"domain_scores_gemma":[0.9931157,0.004516909,0.00067676714,0.00095258385,0.00064640923,0.00009164107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025908058,0.00063643564,0.0006269182,0.0006090219,0.00034017322,0.0008125327,0.00077702274,0.0012922204,0.00075714604],"category_scores_gemma":[0.018051479,0.00029005186,0.0004742617,0.000662418,0.0016525147,0.0019041001,0.0013331007,0.0009822156,0.0002776654],"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.00077362463,0.000061083614,0.003017128,0.00035502278,0.00007963721,0.0005626704,0.00042071674,0.6704151,0.055794097,0.1863813,0.0004902523,0.08164932],"study_design_scores_gemma":[0.000014280117,0.000089828245,0.0008396274,0.00002481788,0.000014525207,0.0002138661,0.00003295589,0.9349172,0.04142881,0.021658732,0.0007416483,0.000023723862],"about_ca_topic_score_codex":0.0007079725,"about_ca_topic_score_gemma":0.00040555038,"teacher_disagreement_score":0.0025908058,"about_ca_system_score_codex":0.00060448895,"about_ca_system_score_gemma":0.00045954547,"threshold_uncertainty_score":0.013701677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059802473,0.00023409762,0.92909694,0.00013328777,0.0000583419,0.000053951364,0.0003006094,0.0006085322,0.009711802],"genre_scores_gemma":[0.5968741,0.00044369954,0.39466462,0.00011687551,0.00014366505,0.00017273164,0.0009119578,0.0002891155,0.006383208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993911,0.00018045618,0.00003336099,0.000071467395,0.00027371445,0.000050017003],"domain_scores_gemma":[0.9987539,0.00065117696,0.0001211021,0.00023143763,0.00019667087,0.000045680117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053204084,0.0004631454,0.0003115566,0.0015061937,0.00041731217,0.0013251922,0.0005899871,0.0004967369,0.0030460285],"category_scores_gemma":[0.0045383843,0.00020790233,0.00030799082,0.001130396,0.00071366475,0.0017540575,0.0008220757,0.0007234187,0.001033367],"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.0002445788,0.000044171276,0.0014004161,0.00011035076,0.00002457135,0.00021356647,0.00021921145,0.23630013,0.016364148,0.5837893,0.0038184933,0.15747109],"study_design_scores_gemma":[0.000010826083,0.000043827447,0.0004640534,0.000030181342,0.0000072112093,0.00021709334,0.000046357505,0.7252001,0.013420229,0.2545802,0.005946563,0.000033331893],"about_ca_topic_score_codex":0.0005640488,"about_ca_topic_score_gemma":0.00059284584,"teacher_disagreement_score":0.0030460285,"about_ca_system_score_codex":0.00061255373,"about_ca_system_score_gemma":0.00040718765,"threshold_uncertainty_score":0.01019001},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015787178,0.00035635362,0.99301517,0.00072382996,0.00043506673,0.000073811076,0.00007723467,0.00025944135,0.003480373],"genre_scores_gemma":[0.19642305,0.0017764067,0.7866218,0.0020553214,0.00088826806,0.0006407695,0.0002767319,0.001064664,0.010252967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99268204,0.002630385,0.00032505262,0.000714567,0.0030788442,0.00056901696],"domain_scores_gemma":[0.9732091,0.018014895,0.0007993791,0.001886629,0.0058237235,0.00026622944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00939895,0.0023222023,0.0016261665,0.0019396279,0.0011845022,0.0020453706,0.001999061,0.0020767862,0.0072595603],"category_scores_gemma":[0.058259707,0.00063343503,0.0017148507,0.0013472884,0.0036355478,0.0037112033,0.0034533872,0.00565902,0.0024310295],"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.000561456,0.00008147434,0.0010213944,0.0009391086,0.00016820423,0.0008717544,0.0010139786,0.19009948,0.009221464,0.61000293,0.033313483,0.15270533],"study_design_scores_gemma":[0.000075290925,0.0001174123,0.00024794,0.00026732002,0.000049835024,0.0006275312,0.00013116752,0.6947195,0.014696077,0.26713318,0.021827621,0.00010715386],"about_ca_topic_score_codex":0.0026085642,"about_ca_topic_score_gemma":0.0019300955,"teacher_disagreement_score":0.00939895,"about_ca_system_score_codex":0.0019846323,"about_ca_system_score_gemma":0.0043253903,"threshold_uncertainty_score":0.049706995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020477112,0.0002851722,0.9751625,0.00030594334,0.000026019645,0.000037042297,0.000061700455,0.00026406432,0.0033804986],"genre_scores_gemma":[0.7739143,0.0008452895,0.21488735,0.0003174788,0.0001250336,0.00021617863,0.00025559036,0.0001637314,0.009275171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810505,0.00065414974,0.000068206165,0.00032098874,0.00053473434,0.00031695972],"domain_scores_gemma":[0.9935049,0.0044762488,0.0004834485,0.0008476544,0.0005119758,0.00017569403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029430925,0.0013327968,0.0014030534,0.00078585866,0.000877822,0.001944246,0.0024326826,0.0020790445,0.0023395626],"category_scores_gemma":[0.007574129,0.00058830256,0.0007623738,0.0010820414,0.0028398428,0.003939628,0.0029126601,0.0029477782,0.00084956374],"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.00078505435,0.00015401983,0.00048297306,0.00015309533,0.00007178459,0.00029523353,0.00031494384,0.7269384,0.007569361,0.19949266,0.0016776297,0.062064853],"study_design_scores_gemma":[0.000023976163,0.000062894964,0.000041219213,0.000013424893,0.000012790652,0.000071455266,0.000021484673,0.9447068,0.002883008,0.051700246,0.00044339328,0.000019302646],"about_ca_topic_score_codex":0.0024891603,"about_ca_topic_score_gemma":0.0026144772,"teacher_disagreement_score":0.0029430925,"about_ca_system_score_codex":0.0020018981,"about_ca_system_score_gemma":0.0023267604,"threshold_uncertainty_score":0.015564799},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5309478,0.0010663698,0.37433338,0.0010468,0.0003923124,0.00008175302,0.0005538282,0.0003102647,0.091267474],"genre_scores_gemma":[0.92650485,0.000657443,0.045589246,0.0003071287,0.000288521,0.00008392365,0.00043450354,0.00017424827,0.025960106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.00014028096,0.000024346997,0.00009610002,0.0001641498,0.00009933502],"domain_scores_gemma":[0.99914646,0.0002406736,0.00017850581,0.00009315892,0.00024400713,0.00009705545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751431,0.0004510502,0.00037397598,0.0017138346,0.0009890368,0.0012678619,0.00052621594,0.0005408085,0.009608494],"category_scores_gemma":[0.0022988282,0.00018687198,0.00034308783,0.0012634986,0.0014135324,0.0023306345,0.00076827605,0.00087311055,0.0018395256],"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.000056675384,0.00001770589,0.00053834065,0.000043564647,0.000004327279,0.000090733425,0.0001767258,0.0033434397,0.0014681234,0.96880543,0.0020696523,0.023385305],"study_design_scores_gemma":[0.000011025668,0.00006298521,0.0008958998,0.000031732387,0.000004999463,0.00049902126,0.00017950825,0.031432852,0.0020428773,0.9499181,0.014880566,0.000040425177],"about_ca_topic_score_codex":0.0007023354,"about_ca_topic_score_gemma":0.00053266756,"teacher_disagreement_score":0.009608494,"about_ca_system_score_codex":0.00076951477,"about_ca_system_score_gemma":0.00039272048,"threshold_uncertainty_score":0.032143652},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7730035,0.0007241408,0.20166226,0.00037209492,0.0000342015,0.0000473678,0.00013750605,0.00032419336,0.02369479],"genre_scores_gemma":[0.9881919,0.0002668021,0.009489564,0.000019178213,0.000008519228,0.000028220997,0.00005365158,0.00003166914,0.001910542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989295,0.000028227649,0.0000035674498,0.000010157951,0.0000456756,0.00001947471],"domain_scores_gemma":[0.9993113,0.0004314252,0.00009529802,0.000042256754,0.000089572204,0.000030076038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019098044,0.00024106381,0.0001752202,0.0009814271,0.00039689438,0.0004989982,0.00030695807,0.00033710914,0.0013443065],"category_scores_gemma":[0.0021432533,0.00015656887,0.00014830622,0.0005094512,0.001012411,0.0008623042,0.00036472618,0.0003189341,0.00016101095],"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.00009283014,0.00003800774,0.0015829084,0.00011285081,0.000010868277,0.00037414988,0.0004215574,0.5115521,0.024033146,0.44423577,0.0007957242,0.016749999],"study_design_scores_gemma":[0.0000059694294,0.000034066103,0.00071381143,0.000014672973,0.0000027425913,0.00017094157,0.000062413885,0.9230715,0.0037906715,0.07140503,0.00071124284,0.000016964437],"about_ca_topic_score_codex":0.00080910267,"about_ca_topic_score_gemma":0.0006612013,"teacher_disagreement_score":0.0013443065,"about_ca_system_score_codex":0.00039212735,"about_ca_system_score_gemma":0.00025708217,"threshold_uncertainty_score":0.004497111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065022305,0.0038032557,0.8312726,0.0031927729,0.00030583428,0.000092306494,0.0010516514,0.00038418607,0.09487507],"genre_scores_gemma":[0.91271466,0.0038561942,0.06770862,0.000774917,0.00077919295,0.00031965756,0.0005599709,0.0003002747,0.012986635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950204,0.0012454358,0.00016292182,0.0006856341,0.001884828,0.001000805],"domain_scores_gemma":[0.98748976,0.008528986,0.0005089561,0.0014587214,0.0015880229,0.00042553883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027465012,0.0011657036,0.0012229378,0.0017645386,0.0013371088,0.00402845,0.0023966932,0.0015413786,0.009628576],"category_scores_gemma":[0.011424154,0.0005516504,0.0010185781,0.0016630018,0.0047617326,0.007987723,0.0036723784,0.003560761,0.0015438094],"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.000051701052,0.000019499097,0.00011477034,0.00010764476,0.000021154245,0.000060247487,0.00009319619,0.034306087,0.0025706305,0.9517138,0.0020515798,0.008889726],"study_design_scores_gemma":[0.000011741085,0.00004292229,0.00024353199,0.00009520974,0.000027363325,0.00017702466,0.000055019103,0.18759403,0.0044353497,0.8001509,0.0071096565,0.00005728239],"about_ca_topic_score_codex":0.0012557231,"about_ca_topic_score_gemma":0.00064775744,"teacher_disagreement_score":0.009628576,"about_ca_system_score_codex":0.0023343894,"about_ca_system_score_gemma":0.00163086,"threshold_uncertainty_score":0.032210767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1253633,0.0004912256,0.8511146,0.0002012008,0.00006434003,0.00009260856,0.00012167746,0.00019847063,0.022352712],"genre_scores_gemma":[0.81093293,0.00083998725,0.17745939,0.00014409063,0.00007625823,0.00008622313,0.0001618765,0.000098806384,0.01020045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974054,0.000058460893,0.000011359433,0.000035664863,0.00011078809,0.00004315539],"domain_scores_gemma":[0.99952877,0.00015897788,0.00009765104,0.00009133634,0.00009744257,0.000025821311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418018,0.0003438367,0.00019552195,0.00037100716,0.00021897577,0.00040804388,0.0003431462,0.00036777847,0.0024536594],"category_scores_gemma":[0.001678288,0.00013506398,0.00027969957,0.000494107,0.00061387924,0.0005755981,0.00041544248,0.0004983088,0.00083740475],"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.00010514669,0.000041106985,0.0004692504,0.00016077483,0.000011290791,0.000625427,0.00032735252,0.054893717,0.07285456,0.7756642,0.0024191942,0.09242788],"study_design_scores_gemma":[0.0000416426,0.00017937002,0.0008717126,0.00006184696,0.000015713827,0.0016699979,0.00013569031,0.66705835,0.038466237,0.27483898,0.016590731,0.00006976923],"about_ca_topic_score_codex":0.0006046094,"about_ca_topic_score_gemma":0.0007699868,"teacher_disagreement_score":0.0024536594,"about_ca_system_score_codex":0.00029962833,"about_ca_system_score_gemma":0.00041630017,"threshold_uncertainty_score":0.008208275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04027532,0.0067502423,0.91336715,0.0017835288,0.00023290877,0.00007465669,0.0007178825,0.00053795124,0.036260314],"genre_scores_gemma":[0.9213974,0.0077527775,0.05998469,0.00067925284,0.00081712543,0.0005707369,0.0007900381,0.00028055251,0.0077274665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971551,0.0006516476,0.000112067595,0.00026034762,0.0010934353,0.000727342],"domain_scores_gemma":[0.9816467,0.013919052,0.0009398402,0.0009217992,0.0022592517,0.00031339677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003267221,0.0019282079,0.0012590141,0.0024763637,0.0009687781,0.0033253706,0.0018313393,0.0012106495,0.006240508],"category_scores_gemma":[0.020962512,0.0005661241,0.00072451466,0.0026448523,0.002725694,0.004429583,0.0030538598,0.0027228442,0.0010868111],"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.0002307823,0.00007489025,0.00058707834,0.00040788035,0.000053801323,0.00022311155,0.00028231228,0.59219354,0.007595449,0.35546464,0.005534266,0.03735222],"study_design_scores_gemma":[0.000011840731,0.000040153132,0.00032103108,0.00011913865,0.000019463489,0.000116980016,0.00006968123,0.8442607,0.003687009,0.14859709,0.0027150179,0.000041919546],"about_ca_topic_score_codex":0.0023403352,"about_ca_topic_score_gemma":0.0017867193,"teacher_disagreement_score":0.006240508,"about_ca_system_score_codex":0.003503437,"about_ca_system_score_gemma":0.0014087196,"threshold_uncertainty_score":0.025419354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028088393,0.0022586312,0.93036747,0.000663821,0.000277923,0.000119691875,0.00078913436,0.00045055142,0.036984365],"genre_scores_gemma":[0.53919125,0.0032202534,0.43521294,0.00051456504,0.0006373813,0.0006894068,0.0017458394,0.0012406223,0.017547749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690384,0.0009892083,0.0001886609,0.0003371041,0.0011283181,0.00045282525],"domain_scores_gemma":[0.98673624,0.009281164,0.0004892477,0.0014312052,0.0016347433,0.0004273971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003595319,0.0025565883,0.0018409936,0.004250216,0.00089633185,0.0038636278,0.003000629,0.0014892381,0.015644927],"category_scores_gemma":[0.02090256,0.0009150447,0.0018621827,0.0035982444,0.0028764887,0.006547501,0.0036804476,0.004463063,0.0029653555],"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.00015882235,0.00008418958,0.0006237449,0.00044141395,0.0000713811,0.00014869297,0.00021151015,0.51835173,0.004026173,0.40265748,0.009353703,0.063871205],"study_design_scores_gemma":[0.000014515537,0.00003753897,0.00024432447,0.0000987808,0.000015372809,0.00005720741,0.00004264637,0.8086211,0.0035014076,0.18329965,0.004017719,0.00004978084],"about_ca_topic_score_codex":0.0036217163,"about_ca_topic_score_gemma":0.0045559667,"teacher_disagreement_score":0.015644927,"about_ca_system_score_codex":0.0030693172,"about_ca_system_score_gemma":0.0014981355,"threshold_uncertainty_score":0.052337527},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13088754,0.0061707767,0.83694303,0.0011794375,0.00020702428,0.000061220955,0.0005437531,0.00053019496,0.02347703],"genre_scores_gemma":[0.8704684,0.0028780568,0.11579217,0.00039312177,0.00016790464,0.0001737716,0.00070084207,0.00023827695,0.009187534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985851,0.00021285476,0.00009018383,0.00027771425,0.000619567,0.00021452809],"domain_scores_gemma":[0.9877537,0.008221245,0.0009834819,0.001271684,0.0013489703,0.0004209705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542194,0.0010329093,0.0007229852,0.00149758,0.0007748754,0.0015598179,0.0017883477,0.001346919,0.0028803428],"category_scores_gemma":[0.013360162,0.0004430945,0.0005480285,0.0012519099,0.0016715092,0.0029257804,0.0025215717,0.002836677,0.0006329245],"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.0007785171,0.00010563792,0.0021863764,0.00067015924,0.000100707395,0.00045167832,0.000667833,0.29399452,0.05012478,0.5346419,0.0039288406,0.11234911],"study_design_scores_gemma":[0.000033959586,0.00019896346,0.0013836985,0.00012272532,0.000051355106,0.0004995072,0.00011938007,0.64343023,0.03370454,0.3141179,0.0062253396,0.000112417474],"about_ca_topic_score_codex":0.0010868809,"about_ca_topic_score_gemma":0.0011600091,"teacher_disagreement_score":0.0028803428,"about_ca_system_score_codex":0.002165725,"about_ca_system_score_gemma":0.0011470579,"threshold_uncertainty_score":0.015713453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1232034,0.0037870787,0.8425219,0.0016345994,0.00032701122,0.00008983192,0.00013831732,0.00019956901,0.028098311],"genre_scores_gemma":[0.93476737,0.0065480075,0.049970705,0.00038179877,0.0007969623,0.00011012484,0.00019191302,0.00009120437,0.0071418122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850804,0.00058701856,0.00006985962,0.00018803115,0.0004804897,0.00016644534],"domain_scores_gemma":[0.9913379,0.0067150616,0.0009810369,0.0003728742,0.0004530404,0.00014004923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015235229,0.000988976,0.0007494132,0.0010284877,0.00046289669,0.0012649165,0.0005666961,0.0013281216,0.0024110842],"category_scores_gemma":[0.010819662,0.00044610334,0.0003894691,0.0011333212,0.003490156,0.004355071,0.0015300486,0.0010941311,0.0005451085],"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.00089668145,0.00012486006,0.0013195721,0.0008664159,0.00011732919,0.00317679,0.00048464455,0.18153548,0.03289422,0.7069479,0.0044115083,0.067224525],"study_design_scores_gemma":[0.00006462438,0.00038630643,0.0012010738,0.00011498687,0.00007256538,0.0014584587,0.00020428741,0.74015677,0.017883552,0.2337876,0.004586665,0.00008320503],"about_ca_topic_score_codex":0.0003801517,"about_ca_topic_score_gemma":0.00034322296,"teacher_disagreement_score":0.0024110842,"about_ca_system_score_codex":0.0006566776,"about_ca_system_score_gemma":0.00047653995,"threshold_uncertainty_score":0.008065939},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02247616,0.0028417562,0.8975022,0.0071178246,0.000863561,0.00007501134,0.00020866093,0.00031227554,0.06860269],"genre_scores_gemma":[0.60394335,0.0061598597,0.3388615,0.007559431,0.0034092641,0.00050631026,0.00041072405,0.0005008704,0.03864861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572563,0.0014202808,0.00016156054,0.0008785709,0.0014136283,0.00040041533],"domain_scores_gemma":[0.99265105,0.0042126067,0.00045966555,0.0010899617,0.0013409646,0.0002456811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073782266,0.00094695063,0.0012560944,0.0022767836,0.0016684129,0.0029314975,0.0016442076,0.0022221876,0.0044892756],"category_scores_gemma":[0.016489388,0.00068118895,0.0013490514,0.002079953,0.0070037288,0.009117785,0.004210985,0.0057417005,0.0015180099],"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.000009584017,0.000006522351,0.000098484794,0.00001512409,0.0000041031303,0.000025990019,0.00003638926,0.0010095201,0.00018501718,0.9937981,0.001243052,0.0035681964],"study_design_scores_gemma":[0.000019017521,0.000033018154,0.00011348287,0.000032606727,0.000008244759,0.00013301508,0.000025022819,0.018805798,0.0008668041,0.9674693,0.012472443,0.000021219827],"about_ca_topic_score_codex":0.0011661062,"about_ca_topic_score_gemma":0.00044338833,"teacher_disagreement_score":0.0073782266,"about_ca_system_score_codex":0.0027061726,"about_ca_system_score_gemma":0.002510133,"threshold_uncertainty_score":0.03902024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11171251,0.0003877965,0.88189054,0.00019528178,0.00002450477,0.00006781364,0.000025019272,0.00019909217,0.0054974575],"genre_scores_gemma":[0.9347785,0.00019947662,0.063524924,0.00004121846,0.000029733481,0.0000732976,0.000025346098,0.000031048236,0.0012964145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814224,0.0009095184,0.000045593795,0.0001474967,0.0005091279,0.00024605266],"domain_scores_gemma":[0.9963242,0.0026611711,0.0003820291,0.00014474629,0.00040877963,0.00007898772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016010413,0.00087234675,0.00053351,0.00049150304,0.00032374376,0.00069361704,0.0007811379,0.00059407693,0.00077303307],"category_scores_gemma":[0.00812979,0.00048055162,0.00026358743,0.0006149916,0.0012653411,0.00078299915,0.0007831055,0.00050728465,0.00025012664],"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.00022421007,0.00006403084,0.0007879779,0.000062379935,0.000052871736,0.00013414178,0.00013978848,0.9088338,0.009727713,0.037420515,0.00045016943,0.042102367],"study_design_scores_gemma":[0.000012811502,0.000047550464,0.00012862007,0.0000044142394,0.000009645521,0.000033089244,0.000012062019,0.9924263,0.0019691873,0.00520625,0.0001416422,0.000008439797],"about_ca_topic_score_codex":0.0023020306,"about_ca_topic_score_gemma":0.003104954,"teacher_disagreement_score":0.0023020306,"about_ca_system_score_codex":0.0013158132,"about_ca_system_score_gemma":0.0012918094,"threshold_uncertainty_score":0.009546995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778673,0.00084348273,0.20781939,0.00046489984,0.000059917413,0.000046911726,0.00021711546,0.00025521315,0.012425773],"genre_scores_gemma":[0.97990626,0.0007675511,0.017827088,0.00006268396,0.000041923155,0.000041503627,0.00012744176,0.00005237082,0.0011731245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995684,0.00010054902,0.00001528858,0.00007287752,0.0001502646,0.00009270768],"domain_scores_gemma":[0.99648994,0.0023784162,0.00033192543,0.00043403308,0.00020603037,0.0001596796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049944955,0.00040523388,0.00035182128,0.0009688063,0.00045001347,0.0005531779,0.0004893811,0.0004532166,0.0013470935],"category_scores_gemma":[0.0048019188,0.00027339044,0.00031610072,0.0006710469,0.0013539142,0.0010431961,0.0010493321,0.001045007,0.00024334606],"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.00048271762,0.00008001968,0.0069497447,0.0003825507,0.00007703281,0.00055909995,0.0008413575,0.56506693,0.08080284,0.29216015,0.0014421334,0.05115539],"study_design_scores_gemma":[0.000037337402,0.00028447728,0.0046771653,0.000101629186,0.000045498604,0.00062803295,0.00017601141,0.6525343,0.028999854,0.3086627,0.0037816889,0.00007128255],"about_ca_topic_score_codex":0.00065864186,"about_ca_topic_score_gemma":0.0007598512,"teacher_disagreement_score":0.0013470935,"about_ca_system_score_codex":0.0007543963,"about_ca_system_score_gemma":0.0005587797,"threshold_uncertainty_score":0.0054736137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39400494,0.0009717208,0.59317267,0.0008680803,0.000112247595,0.000054671054,0.00020426439,0.00052311335,0.010088232],"genre_scores_gemma":[0.97406965,0.00041970127,0.022952957,0.00010284319,0.0000719229,0.000057166773,0.00010619849,0.0001369428,0.0020825968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893206,0.00032226884,0.00006272332,0.0001935553,0.00029901083,0.00019036344],"domain_scores_gemma":[0.99015725,0.006588249,0.0011626566,0.00070635934,0.0007254663,0.0006600597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00365714,0.00066942576,0.000925948,0.0019372054,0.00090561004,0.0017763621,0.0014389504,0.0013649429,0.0026924042],"category_scores_gemma":[0.019660765,0.0006224956,0.0011686516,0.0006068864,0.003649538,0.0046252287,0.0016935839,0.0021284372,0.00026234885],"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.000071870316,0.000023643292,0.0014212164,0.00006226891,0.000033305932,0.00040106656,0.00039851587,0.09018686,0.0031926134,0.9002206,0.0005081152,0.0034800137],"study_design_scores_gemma":[0.0000117043155,0.000016417816,0.00057283184,0.000025439254,0.00000925666,0.000122014484,0.00003714771,0.6047355,0.00089624955,0.3931778,0.000362712,0.000032982465],"about_ca_topic_score_codex":0.0017343896,"about_ca_topic_score_gemma":0.0009333262,"teacher_disagreement_score":0.00365714,"about_ca_system_score_codex":0.0018510127,"about_ca_system_score_gemma":0.0007718237,"threshold_uncertainty_score":0.019341052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05596842,0.0007493456,0.9284162,0.00024038232,0.00011793983,0.00006795754,0.00018658879,0.00020703369,0.014046185],"genre_scores_gemma":[0.782477,0.0011058685,0.20892116,0.0001331368,0.00017508249,0.00014859058,0.0003543448,0.000038621434,0.006646193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932253,0.00023762837,0.0000630198,0.00009318529,0.00020213587,0.00008145783],"domain_scores_gemma":[0.99816185,0.00064043904,0.0003963843,0.00029403708,0.00042280005,0.00008453895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060002407,0.0005051341,0.00055181736,0.000507043,0.00042926372,0.001377894,0.00048700825,0.00049619534,0.004418565],"category_scores_gemma":[0.0031640504,0.0001781138,0.00036556544,0.0011018981,0.0006988811,0.0019067554,0.000900083,0.00072629785,0.00083238556],"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.0005419007,0.000039973904,0.0008678866,0.00022707118,0.000046446716,0.000350487,0.00023765865,0.15122126,0.025053801,0.70367813,0.0021187558,0.11561669],"study_design_scores_gemma":[0.000089249756,0.00065096095,0.00045013407,0.000087594315,0.000042587955,0.0012234501,0.00013881041,0.6341214,0.017296782,0.31534553,0.030478518,0.00007507724],"about_ca_topic_score_codex":0.0002333805,"about_ca_topic_score_gemma":0.00023089054,"teacher_disagreement_score":0.004418565,"about_ca_system_score_codex":0.00041053572,"about_ca_system_score_gemma":0.00041810877,"threshold_uncertainty_score":0.014781535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021126773,0.0011602202,0.9706063,0.00056951813,0.00008095746,0.000031724085,0.00007429401,0.00011174634,0.006238458],"genre_scores_gemma":[0.8753088,0.003890012,0.10811934,0.00028813365,0.0006762116,0.00021310903,0.000336665,0.00007153468,0.011096028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894077,0.00025551597,0.000051285737,0.0002987267,0.0003834721,0.00007023125],"domain_scores_gemma":[0.9988187,0.00069215073,0.00019445579,0.00010836428,0.00015627002,0.00003006603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013116417,0.0009545712,0.0008382509,0.00091789354,0.00049258105,0.0017446148,0.00069638365,0.0013020862,0.00140234],"category_scores_gemma":[0.0034691293,0.0002660585,0.0007945415,0.00068878167,0.0014648318,0.0024379941,0.0013003728,0.0011454462,0.00027374044],"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.000055215725,0.00005278871,0.0010841156,0.00028035993,0.000099459314,0.0002471748,0.00019891665,0.5954051,0.0033900784,0.34023017,0.0014438197,0.05751282],"study_design_scores_gemma":[0.0000036956565,0.000022429092,0.00031232013,0.000015505746,0.000009465003,0.00006423626,0.000024731346,0.9388828,0.00035489775,0.057866186,0.0024329922,0.0000106424795],"about_ca_topic_score_codex":0.002983917,"about_ca_topic_score_gemma":0.0011897337,"teacher_disagreement_score":0.002983917,"about_ca_system_score_codex":0.0009385962,"about_ca_system_score_gemma":0.0005709357,"threshold_uncertainty_score":0.006936729},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003459861,0.0006748422,0.9901653,0.00019435548,0.000112090565,0.000049089234,0.000029995057,0.00010097752,0.0052135754],"genre_scores_gemma":[0.21066874,0.002722247,0.77318144,0.00020009445,0.00021578207,0.00053954445,0.00011724149,0.00019179647,0.012163078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960405,0.00015107983,0.000023997585,0.000028299697,0.00017417263,0.000018442646],"domain_scores_gemma":[0.99915016,0.00049004855,0.00006688428,0.00012411,0.00015099192,0.00001775898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012350108,0.0005147922,0.00048333372,0.0007820753,0.00050540525,0.0009887283,0.00075015024,0.0010622406,0.0030825722],"category_scores_gemma":[0.0036652128,0.0002519815,0.00044441127,0.000724419,0.0012592773,0.0015139133,0.00086118,0.0012039114,0.0008775757],"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.00004921209,0.00007064476,0.00054140866,0.0003531063,0.00003575595,0.00013286139,0.00023388822,0.5134246,0.011637593,0.3745003,0.0021126776,0.09690806],"study_design_scores_gemma":[0.0000068555214,0.0000107776605,0.000083532155,0.000029072444,0.0000028391685,0.00003619515,0.000014580796,0.9627863,0.0010463176,0.033112176,0.0028606984,0.000010689882],"about_ca_topic_score_codex":0.001907339,"about_ca_topic_score_gemma":0.0010839413,"teacher_disagreement_score":0.0030825722,"about_ca_system_score_codex":0.00059031026,"about_ca_system_score_gemma":0.00079734926,"threshold_uncertainty_score":0.010312259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009017318,0.00034147713,0.98334736,0.0006159598,0.00010381086,0.00016042485,0.00019023364,0.00010788559,0.006115552],"genre_scores_gemma":[0.37985426,0.0011373153,0.6062221,0.0007499337,0.00022814369,0.00084338296,0.0005986826,0.00014780651,0.010218408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709094,0.0011344498,0.00020042225,0.0004099951,0.0008344121,0.00032974943],"domain_scores_gemma":[0.99346876,0.0032518106,0.0006305269,0.0016801243,0.0007224182,0.00024629934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00404123,0.0010425781,0.0010535351,0.0010188164,0.0011356063,0.0019193004,0.0041557564,0.0020007542,0.004911792],"category_scores_gemma":[0.012708251,0.00054945325,0.0009924978,0.0017601915,0.002303127,0.0063695223,0.005417326,0.003701289,0.0010798831],"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.00012966437,0.000058414047,0.00017805064,0.00015185548,0.000023216478,0.00010524633,0.00024670307,0.052888155,0.0024525782,0.8786016,0.00406668,0.06109781],"study_design_scores_gemma":[0.000116897994,0.00009807225,0.00010656633,0.00009969602,0.000028873501,0.00028793237,0.00009418798,0.5354508,0.003792841,0.4501268,0.009708325,0.00008892282],"about_ca_topic_score_codex":0.0011878122,"about_ca_topic_score_gemma":0.0013892938,"teacher_disagreement_score":0.004911792,"about_ca_system_score_codex":0.0018961565,"about_ca_system_score_gemma":0.0028133458,"threshold_uncertainty_score":0.021372318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012191643,0.00046879347,0.9848579,0.00070623367,0.000033771707,0.000042079504,0.0001341888,0.00023514891,0.0013301363],"genre_scores_gemma":[0.5664553,0.0014327955,0.42540765,0.0009739088,0.00025920745,0.00065884995,0.00089151744,0.00039784674,0.0035229544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596125,0.0016176384,0.00023614889,0.0007769157,0.0010619775,0.00034602865],"domain_scores_gemma":[0.9794881,0.015795331,0.0018842682,0.0009654805,0.0013092923,0.00055769394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008289787,0.0016784327,0.0024401487,0.0011390949,0.0006598149,0.0020492168,0.002282837,0.0026602168,0.002927066],"category_scores_gemma":[0.043438613,0.0010518563,0.0011214985,0.0011749297,0.003873799,0.004397609,0.004306234,0.004105456,0.0006585838],"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.0007218246,0.00016841119,0.0018343198,0.0008353046,0.00017073128,0.0005485772,0.0005198818,0.6609396,0.015235453,0.24497549,0.006453958,0.0675965],"study_design_scores_gemma":[0.000027697983,0.00007559649,0.00036091506,0.000050565915,0.000011284815,0.00006030039,0.000035443158,0.9337121,0.001795932,0.06325095,0.0005934231,0.000025817088],"about_ca_topic_score_codex":0.002034457,"about_ca_topic_score_gemma":0.0013540122,"teacher_disagreement_score":0.008289787,"about_ca_system_score_codex":0.0013835666,"about_ca_system_score_gemma":0.002228765,"threshold_uncertainty_score":0.043841064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013714467,0.00029935513,0.9839092,0.00019331931,0.000024641113,0.000020631996,0.00007209493,0.0001606496,0.0016056268],"genre_scores_gemma":[0.7701138,0.0011203795,0.22182705,0.00020259975,0.00013757017,0.00017195141,0.0003326439,0.000069561494,0.006024411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00009273995,0.000022300444,0.00006083212,0.00020470371,0.000037770733],"domain_scores_gemma":[0.99799937,0.0012298624,0.00018825465,0.00023718091,0.00030459167,0.00004081875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090629235,0.0004445149,0.00045428387,0.0003994476,0.0002323844,0.0006348112,0.00081762613,0.00053924724,0.0011013304],"category_scores_gemma":[0.0048145643,0.00021206969,0.00021328904,0.00055457477,0.00063674833,0.001457934,0.0009762676,0.0011544032,0.00029034904],"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.0002253701,0.000037559068,0.00046514158,0.00017643372,0.00001963679,0.0002896178,0.00014419449,0.5144362,0.018106109,0.3763787,0.0025304423,0.08719065],"study_design_scores_gemma":[0.000012086217,0.0000237648,0.000074716714,0.000011778306,0.0000039787983,0.00006013036,0.0000094358,0.934598,0.002738695,0.061433487,0.0010276111,0.000006341594],"about_ca_topic_score_codex":0.0008485929,"about_ca_topic_score_gemma":0.0007641055,"teacher_disagreement_score":0.0011013304,"about_ca_system_score_codex":0.0008069644,"about_ca_system_score_gemma":0.0006726464,"threshold_uncertainty_score":0.0058549047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009786433,0.006016463,0.96295375,0.0013920484,0.00032682816,0.00008513058,0.00024162288,0.00018920179,0.019008417],"genre_scores_gemma":[0.56588167,0.01846983,0.3891892,0.0013809258,0.0021814909,0.00088762736,0.0012579422,0.00077763654,0.01997358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925672,0.0036170133,0.00042267414,0.00085933064,0.0020809523,0.00045289288],"domain_scores_gemma":[0.97734535,0.015093452,0.0017842711,0.0021471495,0.0029658594,0.0006639868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068773,0.0029488448,0.0015859961,0.0046102,0.0014930932,0.0036719805,0.0022973663,0.0030598366,0.0031079694],"category_scores_gemma":[0.031704936,0.00054157857,0.0011071686,0.0045293393,0.006356724,0.009380047,0.005299162,0.00505221,0.001062365],"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.000027520999,0.000009567743,0.00015949052,0.00008111118,0.000015877566,0.00003743605,0.000103468796,0.039610766,0.00052858033,0.94319284,0.0013133754,0.014919948],"study_design_scores_gemma":[0.000006602794,0.00006875081,0.00013649213,0.00008401911,0.000011152957,0.00007852248,0.00004071968,0.1355433,0.0007846802,0.856435,0.0067749578,0.0000358593],"about_ca_topic_score_codex":0.002303312,"about_ca_topic_score_gemma":0.0008786698,"teacher_disagreement_score":0.0068773,"about_ca_system_score_codex":0.004517328,"about_ca_system_score_gemma":0.0016163836,"threshold_uncertainty_score":0.036371112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053223226,0.0014520582,0.93034726,0.00073855434,0.00039069747,0.00018488386,0.0003880441,0.0006096404,0.01266562],"genre_scores_gemma":[0.59368485,0.0011801095,0.3934727,0.00032439583,0.0003776374,0.0004358056,0.00066833885,0.0001993027,0.009656786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808085,0.000655364,0.00014619465,0.00034725582,0.0005057884,0.00026450903],"domain_scores_gemma":[0.99448794,0.003588921,0.00034954562,0.00066685013,0.00068060204,0.00022622297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017846462,0.0013238764,0.0009969919,0.0014291396,0.00060622854,0.0012871106,0.0011026296,0.0016436802,0.005116338],"category_scores_gemma":[0.01539103,0.0006538735,0.0004915689,0.0013300406,0.0010274681,0.0026512735,0.0015141807,0.0017022274,0.0014759115],"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.0012398106,0.00023747254,0.0011899967,0.00047275476,0.00010643989,0.00034158074,0.0003768732,0.582265,0.01587321,0.15134618,0.006667569,0.239883],"study_design_scores_gemma":[0.00013507358,0.00017824715,0.0003703641,0.00010839048,0.00004329853,0.0002853286,0.000077058816,0.9217916,0.004505952,0.066853076,0.0055870144,0.00006457888],"about_ca_topic_score_codex":0.0013264549,"about_ca_topic_score_gemma":0.0019965398,"teacher_disagreement_score":0.005116338,"about_ca_system_score_codex":0.0010857343,"about_ca_system_score_gemma":0.002002381,"threshold_uncertainty_score":0.017115891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020266922,0.00019760475,0.9784078,0.00008273955,0.000008463719,0.000010932442,0.000042847943,0.0001864143,0.0007962872],"genre_scores_gemma":[0.725987,0.00084760785,0.26854616,0.00007200357,0.00004074958,0.000075380114,0.0002673747,0.00008191218,0.004081757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996113,0.0001589516,0.000021090415,0.00005248045,0.00010601837,0.00005011092],"domain_scores_gemma":[0.99831593,0.0012605652,0.00014446277,0.00011881993,0.00013663172,0.00002360522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085189956,0.00075037335,0.00083076477,0.00036765492,0.0002813393,0.0006749903,0.0006537657,0.0008192273,0.0008060472],"category_scores_gemma":[0.0036092761,0.00037245423,0.00046034032,0.0005453367,0.0006548857,0.0011621403,0.0007643758,0.00077916816,0.0002970341],"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.00014923421,0.000020196867,0.00033116917,0.00006949447,0.000027797481,0.00009168127,0.00008250036,0.92465234,0.005336406,0.034521095,0.00045413704,0.034263946],"study_design_scores_gemma":[0.0000048132183,0.00001095646,0.00003168905,0.0000035461687,0.0000027332878,0.000020769885,0.00000428277,0.9926684,0.0018975494,0.005218045,0.00013311509,0.0000039683555],"about_ca_topic_score_codex":0.0030228756,"about_ca_topic_score_gemma":0.0031710607,"teacher_disagreement_score":0.0030228756,"about_ca_system_score_codex":0.0006637391,"about_ca_system_score_gemma":0.0009469431,"threshold_uncertainty_score":0.006010592},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011455381,0.0004440444,0.98662287,0.00011722246,0.000029407745,0.000051847077,0.000049092036,0.0004448514,0.0007853],"genre_scores_gemma":[0.20165028,0.0005173312,0.795517,0.00015832002,0.000059619655,0.00020662334,0.00024542768,0.000096819334,0.0015485112],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995431,0.00010451351,0.000033138815,0.00010804842,0.00016660772,0.000044662094],"domain_scores_gemma":[0.9992993,0.00036533186,0.0000661368,0.00015337607,0.000089753,0.00002618106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068594,0.00078086293,0.00075276435,0.0009214964,0.00041772713,0.00071659154,0.0013019701,0.000888231,0.0010237357],"category_scores_gemma":[0.0027801648,0.0003190463,0.0006072923,0.0015014546,0.0009607244,0.0016541745,0.0016002518,0.0012324507,0.0005362043],"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.0002191813,0.00010945867,0.000743768,0.00018170074,0.000059611903,0.00021652738,0.0003066789,0.19795135,0.032250367,0.14226204,0.0042352644,0.621464],"study_design_scores_gemma":[0.000022130647,0.000059127167,0.00012107349,0.000013733711,0.000012559077,0.00021288796,0.000028985758,0.9460542,0.013241894,0.038113803,0.0021055848,0.0000140235625],"about_ca_topic_score_codex":0.0010353206,"about_ca_topic_score_gemma":0.0012464479,"teacher_disagreement_score":0.0013019701,"about_ca_system_score_codex":0.00070565776,"about_ca_system_score_gemma":0.0008620404,"threshold_uncertainty_score":0.00511992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015648142,0.0044625807,0.9437749,0.004840867,0.00034754662,0.00007904114,0.00015024026,0.00054520345,0.030151593],"genre_scores_gemma":[0.68592936,0.0075981,0.2961969,0.0026240798,0.0007917493,0.00032339647,0.00034211754,0.00027424743,0.005919992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98871416,0.0055334955,0.00047827524,0.00061687286,0.0041792584,0.00047791458],"domain_scores_gemma":[0.96277636,0.028470436,0.0009611565,0.004508961,0.0030118998,0.00027125794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095858695,0.0009015648,0.0015952345,0.0010284063,0.0013839568,0.0030522456,0.001785088,0.00240306,0.002896544],"category_scores_gemma":[0.0495675,0.0006912434,0.000598292,0.0014357291,0.0039639133,0.0072355513,0.0038497837,0.0033026186,0.0019251406],"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.00038018098,0.00006664323,0.0014130921,0.0004683965,0.00006420873,0.00023896674,0.00038949394,0.14828238,0.0045929244,0.6910847,0.0064168796,0.14660206],"study_design_scores_gemma":[0.00007961501,0.00010066623,0.00015240093,0.00015218946,0.000019741745,0.00069376087,0.000107606276,0.5264436,0.0039109797,0.4605074,0.0077319406,0.000100030884],"about_ca_topic_score_codex":0.0019280262,"about_ca_topic_score_gemma":0.0015946332,"teacher_disagreement_score":0.0095858695,"about_ca_system_score_codex":0.0013239647,"about_ca_system_score_gemma":0.0023734674,"threshold_uncertainty_score":0.05069554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03431387,0.0012695818,0.9595512,0.0012323869,0.00005350116,0.000042873195,0.0001978106,0.00009935734,0.0032394023],"genre_scores_gemma":[0.8311442,0.0018224535,0.16070065,0.00035953548,0.0001732927,0.00019130929,0.00053526636,0.000090742054,0.0049825646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989158,0.00036312253,0.00005419746,0.00012409377,0.00039976824,0.00014310141],"domain_scores_gemma":[0.9962759,0.0027640131,0.00027726975,0.00024720735,0.0003525851,0.000082933555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029443116,0.0006342932,0.0010909801,0.0006960001,0.00040239698,0.0015744976,0.0015758016,0.0013994497,0.0014901954],"category_scores_gemma":[0.007775193,0.00043053986,0.00062839186,0.0012311783,0.0013662545,0.0029056643,0.0021284653,0.0013391384,0.00030442458],"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.00027284704,0.000035557277,0.00030403765,0.00030183076,0.000055012984,0.0005001216,0.00021088551,0.45974818,0.0038386816,0.4772215,0.002704809,0.05480656],"study_design_scores_gemma":[0.000038940994,0.000029742396,0.0000627516,0.000021655145,0.000010851706,0.00008467407,0.000021903077,0.86329323,0.0015499232,0.13401975,0.00084561866,0.000020982063],"about_ca_topic_score_codex":0.0029327534,"about_ca_topic_score_gemma":0.0013690817,"teacher_disagreement_score":0.0029443116,"about_ca_system_score_codex":0.0016924903,"about_ca_system_score_gemma":0.0011433776,"threshold_uncertainty_score":0.015571177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06542389,0.0005402721,0.9293234,0.00019495517,0.00009264649,0.000053232245,0.00009068488,0.0002097138,0.00407123],"genre_scores_gemma":[0.83216125,0.00068187795,0.16259971,0.00016582802,0.000089908586,0.00017975553,0.00016065568,0.00005008387,0.0039109783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994893,0.00009126926,0.00003629066,0.00007170778,0.00024217517,0.000069072325],"domain_scores_gemma":[0.9984004,0.00048093987,0.00034195615,0.00030827385,0.0003620985,0.000106371015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060117064,0.00034302895,0.000375573,0.00047909716,0.0004961097,0.0006754256,0.00056074606,0.00043976912,0.0008340418],"category_scores_gemma":[0.0029548751,0.00016175759,0.0003325846,0.0006980285,0.0010185004,0.00083871314,0.0009600958,0.0009598104,0.0002524167],"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.00025207756,0.000038946906,0.0006339931,0.00012237091,0.000022259612,0.00016874177,0.00031863994,0.24112815,0.026980134,0.65516436,0.0015411037,0.073629126],"study_design_scores_gemma":[0.000059313512,0.00026658125,0.00016658603,0.000038719838,0.000019025367,0.00034662738,0.000051774194,0.7328155,0.013449531,0.24123244,0.011514344,0.0000395752],"about_ca_topic_score_codex":0.00082829385,"about_ca_topic_score_gemma":0.0009436175,"teacher_disagreement_score":0.0008340418,"about_ca_system_score_codex":0.00081763475,"about_ca_system_score_gemma":0.0012848935,"threshold_uncertainty_score":0.0059324503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010159265,0.0033474073,0.97358894,0.0008649592,0.00018457469,0.00014837572,0.0002667815,0.00031408624,0.011125506],"genre_scores_gemma":[0.41520485,0.0052363756,0.5658221,0.0013385613,0.0009260438,0.0012344619,0.0015692551,0.00070468173,0.00796369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9839101,0.008060025,0.00074740464,0.0017146688,0.0040963753,0.0014714365],"domain_scores_gemma":[0.89814115,0.08703475,0.0028520126,0.005759554,0.0052837064,0.00092875265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020144256,0.0034027533,0.003668146,0.0061652767,0.0027651463,0.005436637,0.0040267366,0.0030644522,0.005906448],"category_scores_gemma":[0.106333576,0.0011064105,0.0020029596,0.004767381,0.005816763,0.01057615,0.0064421324,0.0061031072,0.0016475337],"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.00039224164,0.00008969762,0.001225578,0.00033661365,0.00013452115,0.00019201601,0.00025232375,0.44592452,0.0014044561,0.46969858,0.007991868,0.07235759],"study_design_scores_gemma":[0.000037608082,0.00009463782,0.00034847995,0.000097808785,0.00003105564,0.00017657994,0.000038217815,0.7002343,0.0016832664,0.2946546,0.0025359096,0.0000675642],"about_ca_topic_score_codex":0.003497833,"about_ca_topic_score_gemma":0.0032273768,"teacher_disagreement_score":0.020144256,"about_ca_system_score_codex":0.0056953016,"about_ca_system_score_gemma":0.0037475547,"threshold_uncertainty_score":0.10653424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24335958,0.004190881,0.6072409,0.0024676772,0.0009995571,0.000053792446,0.00014524473,0.00028572374,0.14125663],"genre_scores_gemma":[0.9483447,0.0028855072,0.025462097,0.000744701,0.0015743987,0.000064503445,0.00008718514,0.00020421763,0.020632636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928963,0.00024686745,0.000023837829,0.00015329124,0.00020308913,0.00008321933],"domain_scores_gemma":[0.99859184,0.00077294186,0.00012383107,0.00020408136,0.00021536795,0.000091989314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029621,0.0006313893,0.0006005321,0.0009066495,0.0004645853,0.0010855664,0.0006169942,0.00084376277,0.0023442316],"category_scores_gemma":[0.0050480072,0.00018969337,0.00046725117,0.00048452037,0.0031971298,0.0029390263,0.0011450355,0.0014668467,0.0005990892],"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.000017621416,0.000006815894,0.00006521395,0.000017304763,0.0000023092125,0.00011146375,0.00011603236,0.0033557552,0.0020701946,0.9910097,0.0005129,0.0027145685],"study_design_scores_gemma":[0.0000061457313,0.00002426001,0.00021553044,0.000020548774,0.0000040022396,0.00009408727,0.00003802481,0.04667876,0.0007400544,0.94885385,0.003311801,0.000013016395],"about_ca_topic_score_codex":0.0006239016,"about_ca_topic_score_gemma":0.00028582243,"teacher_disagreement_score":0.0023442316,"about_ca_system_score_codex":0.00057838135,"about_ca_system_score_gemma":0.00027948472,"threshold_uncertainty_score":0.007842183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057827592,0.00063747476,0.93243253,0.00028971827,0.00003350478,0.00005799512,0.00012215154,0.00017785525,0.008421138],"genre_scores_gemma":[0.9240475,0.00039605948,0.07147131,0.00009200393,0.000056323486,0.00014133347,0.00010489818,0.000053786953,0.003636797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792373,0.0008751266,0.00006889209,0.0003513525,0.00043190294,0.0003489339],"domain_scores_gemma":[0.9964988,0.0025912526,0.00028494388,0.00023331329,0.0002553899,0.00013622262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024940358,0.00065434136,0.0013000037,0.0005226115,0.0007445194,0.0018125967,0.00094904215,0.0008434055,0.0023783974],"category_scores_gemma":[0.005131644,0.00038707576,0.0005830036,0.000981206,0.0016696736,0.0016285892,0.0014278059,0.0012925066,0.0004484184],"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.00022257138,0.000035459223,0.00067038793,0.000098347664,0.000034361474,0.00026947338,0.0001952973,0.73191816,0.0041578184,0.24531125,0.0009015685,0.016185224],"study_design_scores_gemma":[0.000013027416,0.000027852819,0.00012527383,0.000007916364,0.0000036950878,0.000043241977,0.000030034478,0.9301593,0.0009953616,0.06804723,0.0005356533,0.000011364655],"about_ca_topic_score_codex":0.002226554,"about_ca_topic_score_gemma":0.00094742136,"teacher_disagreement_score":0.0024940358,"about_ca_system_score_codex":0.0017979625,"about_ca_system_score_gemma":0.0012589163,"threshold_uncertainty_score":0.013189912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44516197,0.01466063,0.32932314,0.021947106,0.003967537,0.00020498665,0.0010251054,0.0020893398,0.1816202],"genre_scores_gemma":[0.8073849,0.0043739337,0.12160437,0.0066849515,0.0013310477,0.00025518463,0.0012944769,0.00087294896,0.056198206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981268,0.00036737852,0.000109930974,0.0005416831,0.00045253322,0.0004016298],"domain_scores_gemma":[0.9967296,0.0010386986,0.00040953336,0.0006658511,0.0007629326,0.00039330986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014962956,0.0010022603,0.0011647542,0.0017394214,0.0036475773,0.0035884052,0.0014519996,0.0032738037,0.025443176],"category_scores_gemma":[0.010096214,0.00075092947,0.001027517,0.0016822648,0.0034877488,0.011008077,0.003140154,0.0033210418,0.006297414],"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.00028148014,0.00009878395,0.0014960243,0.0002470672,0.000032449727,0.00042366178,0.0011742822,0.0015238666,0.0047966465,0.89402664,0.0063584796,0.08954061],"study_design_scores_gemma":[0.000049610924,0.000091103946,0.00052445306,0.00011425905,0.000021778767,0.000565773,0.0006180218,0.0033232402,0.0039852764,0.92110115,0.06954903,0.000056264602],"about_ca_topic_score_codex":0.0014686568,"about_ca_topic_score_gemma":0.0017724338,"teacher_disagreement_score":0.025443176,"about_ca_system_score_codex":0.0019405632,"about_ca_system_score_gemma":0.0010453305,"threshold_uncertainty_score":0.08511585},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5444265,0.0015247032,0.40706247,0.0009292411,0.0006283834,0.00016707767,0.0008703905,0.00090237387,0.043488856],"genre_scores_gemma":[0.7526487,0.00050981296,0.22537744,0.00024029873,0.00012609769,0.00014485104,0.00094820274,0.00012892488,0.019875644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.00006890923,0.000039804887,0.00006414685,0.00016568122,0.00007863799],"domain_scores_gemma":[0.99913555,0.00022443422,0.00016663337,0.00014092485,0.00025085823,0.00008159527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035188248,0.00042846386,0.00039613727,0.0008976759,0.0003793314,0.0008758078,0.00035507302,0.00059105025,0.004688524],"category_scores_gemma":[0.002258379,0.00024278359,0.00023372586,0.00073980767,0.00042053012,0.0011145236,0.00059674296,0.0004947138,0.0011502665],"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.0014760608,0.00019374375,0.0025920824,0.0004488125,0.000055422926,0.0008269743,0.00032504014,0.038367637,0.27660188,0.32028237,0.0064485893,0.35238138],"study_design_scores_gemma":[0.00036748132,0.0009046875,0.003841345,0.00018844799,0.00013906101,0.002775063,0.000257002,0.36008635,0.4087806,0.1417663,0.080676384,0.00021721322],"about_ca_topic_score_codex":0.0002927523,"about_ca_topic_score_gemma":0.0006165495,"teacher_disagreement_score":0.004688524,"about_ca_system_score_codex":0.0007762186,"about_ca_system_score_gemma":0.00060894183,"threshold_uncertainty_score":0.015684724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034021765,0.0014375296,0.9387586,0.0003418935,0.00029265965,0.000119543445,0.0005009966,0.0004852442,0.024041682],"genre_scores_gemma":[0.6309312,0.0028667925,0.3365643,0.00043875602,0.00041269808,0.00033000152,0.0015524471,0.0000849119,0.02681886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.000105308456,0.00003488132,0.00007208131,0.0002636303,0.00006912992],"domain_scores_gemma":[0.9992181,0.00015676428,0.000121411,0.00015582748,0.00031432658,0.000033542077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027928414,0.00035362566,0.000333926,0.00061958586,0.00034623133,0.0007200049,0.000403435,0.00031760053,0.0036130543],"category_scores_gemma":[0.0013008937,0.00012112502,0.00020844162,0.0008818818,0.00037647402,0.0005958499,0.0005405106,0.00047895173,0.00155482],"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.00034493188,0.00006831778,0.00081498997,0.00028116218,0.000055079676,0.00025027263,0.0001665888,0.089521386,0.042494062,0.46656272,0.008464685,0.39097586],"study_design_scores_gemma":[0.000085360574,0.00026534553,0.0010115907,0.00008018371,0.00003592884,0.0010899552,0.00006230794,0.73633516,0.046223357,0.121517055,0.093211874,0.00008187709],"about_ca_topic_score_codex":0.0012116249,"about_ca_topic_score_gemma":0.0014016718,"teacher_disagreement_score":0.0036130543,"about_ca_system_score_codex":0.00033296086,"about_ca_system_score_gemma":0.00078085694,"threshold_uncertainty_score":0.012086868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0814813,0.0009770237,0.9068821,0.00062275876,0.00006792646,0.00004543849,0.00019244628,0.0001636735,0.009567372],"genre_scores_gemma":[0.9763932,0.0010425482,0.020488027,0.00015213106,0.00015036442,0.00009589773,0.00008607883,0.000060593597,0.0015311383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998346,0.00058698654,0.000060783466,0.00017129834,0.0005588382,0.0002760928],"domain_scores_gemma":[0.99014974,0.0068773995,0.0010832523,0.00081959914,0.0008043248,0.00026576506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028016423,0.00114503,0.00092229404,0.0014852824,0.00047527227,0.0015221287,0.0010613813,0.0008883021,0.0022029267],"category_scores_gemma":[0.012804002,0.0005211671,0.0005188074,0.0016250745,0.0038501604,0.0044140993,0.001960745,0.0014871575,0.0002977378],"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.00007760375,0.00006480574,0.0012556609,0.00016354132,0.00003522836,0.00038547016,0.00020509411,0.41449344,0.0063471487,0.5650335,0.0016248188,0.010313705],"study_design_scores_gemma":[0.0000072330918,0.00004580641,0.0005862261,0.00003107135,0.0000127461,0.000232843,0.000072964605,0.81272566,0.0015469604,0.18409406,0.0006060643,0.00003835874],"about_ca_topic_score_codex":0.0010402342,"about_ca_topic_score_gemma":0.00066773244,"teacher_disagreement_score":0.0028016423,"about_ca_system_score_codex":0.0016794804,"about_ca_system_score_gemma":0.0009340695,"threshold_uncertainty_score":0.014816701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044591766,0.0018629244,0.9425585,0.0004352806,0.000044354376,0.00008425358,0.000089661386,0.00025867374,0.010074457],"genre_scores_gemma":[0.9249241,0.0015150497,0.07074409,0.00018781572,0.0000851927,0.00018093904,0.00012504103,0.000058349797,0.002179534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715817,0.001303106,0.00009341569,0.00025590617,0.0008819065,0.00030747626],"domain_scores_gemma":[0.994839,0.002962182,0.00047724126,0.00031948223,0.0012617742,0.00014036194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024752484,0.001589461,0.0010611457,0.0010378555,0.0006896667,0.002091574,0.0010682711,0.0013522762,0.0021174457],"category_scores_gemma":[0.01343733,0.00062355114,0.00040651963,0.0014131045,0.0013919789,0.0011738099,0.0015876157,0.0010560674,0.00075944513],"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.00040851417,0.000059165497,0.00182758,0.00035460794,0.000088391294,0.00023279985,0.0003536537,0.8247529,0.017043276,0.0974586,0.0017489021,0.055671588],"study_design_scores_gemma":[0.000025904144,0.00023076226,0.000337789,0.000047908143,0.000030120545,0.00020540183,0.000062748,0.97659487,0.0049621332,0.01628713,0.0011729876,0.00004236294],"about_ca_topic_score_codex":0.0029021504,"about_ca_topic_score_gemma":0.0019098788,"teacher_disagreement_score":0.0029021504,"about_ca_system_score_codex":0.0020215039,"about_ca_system_score_gemma":0.0017677231,"threshold_uncertainty_score":0.014667153},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076456723,0.0009579341,0.9940585,0.00025690664,0.00012497522,0.000028792778,0.00003888061,0.00007843105,0.0036910172],"genre_scores_gemma":[0.38762927,0.010057284,0.57389563,0.0008462054,0.0020873516,0.0012320508,0.00032134328,0.00023021502,0.023700686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998831,0.0004322022,0.000060558694,0.00023244295,0.00035212416,0.00009172301],"domain_scores_gemma":[0.9994797,0.00023150886,0.000046407957,0.0000872391,0.00012222918,0.000032901047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00157732,0.0015829576,0.00113276,0.00068833644,0.00063924043,0.0018924015,0.002592212,0.0014700784,0.0035448943],"category_scores_gemma":[0.0021450366,0.00041567028,0.0009526441,0.0015095681,0.0016242919,0.0020632166,0.0017323474,0.0025011494,0.0010457096],"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.000025936328,0.000026056443,0.00010599388,0.00013321605,0.000036894748,0.00017616327,0.000105988016,0.29148877,0.001249985,0.667227,0.004394787,0.035029083],"study_design_scores_gemma":[0.000028376213,0.00004766009,0.00007353508,0.000030554398,0.000017135018,0.000093206145,0.000025247715,0.71654314,0.00019736313,0.26237416,0.020553088,0.000016536284],"about_ca_topic_score_codex":0.0032191866,"about_ca_topic_score_gemma":0.0030170656,"teacher_disagreement_score":0.0035448943,"about_ca_system_score_codex":0.0012235122,"about_ca_system_score_gemma":0.0012299353,"threshold_uncertainty_score":0.0118588805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12844212,0.012214411,0.6659974,0.016841907,0.00102496,0.0009814643,0.0101560885,0.012354849,0.1519868],"genre_scores_gemma":[0.56898314,0.009987773,0.33256534,0.006557404,0.0025987052,0.0025888258,0.014228318,0.007784233,0.05470628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982509,0.0032533973,0.0009359554,0.00353222,0.005238968,0.004530463],"domain_scores_gemma":[0.88614494,0.09101685,0.0035485073,0.012492325,0.003840007,0.002957325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009264397,0.004569496,0.0043446445,0.0031277821,0.0052805897,0.008270612,0.008327426,0.0045086904,0.047611747],"category_scores_gemma":[0.05628968,0.0022203857,0.0044417307,0.0057991417,0.0049186745,0.03752693,0.012210909,0.009773497,0.017318498],"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.004204891,0.0013686003,0.007955834,0.0032847002,0.00048619317,0.0011554847,0.002169057,0.11032418,0.028377738,0.4847441,0.11972317,0.23620611],"study_design_scores_gemma":[0.00032247292,0.00039172612,0.0016036879,0.00049754017,0.0004168408,0.0015125003,0.00047210988,0.25430116,0.027269844,0.66481805,0.048130948,0.00026300128],"about_ca_topic_score_codex":0.0037576142,"about_ca_topic_score_gemma":0.0053978534,"teacher_disagreement_score":0.047611747,"about_ca_system_score_codex":0.007991056,"about_ca_system_score_gemma":0.005921086,"threshold_uncertainty_score":0.15927714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013753279,0.00030011515,0.9946397,0.00018741563,0.00004641951,0.00003241241,0.00005070804,0.0003384231,0.0030294708],"genre_scores_gemma":[0.09721451,0.0014544204,0.8899047,0.0003530001,0.0002129934,0.00026433996,0.0005011199,0.00038135497,0.009713559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997072,0.0010544186,0.00016889193,0.00060724607,0.0008649807,0.00023246373],"domain_scores_gemma":[0.99563354,0.0022962196,0.0002382324,0.00083496154,0.00088538555,0.00011163705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030438993,0.0012958741,0.0014588465,0.0016786068,0.0010954504,0.0031831523,0.0020402817,0.0018277897,0.0073822895],"category_scores_gemma":[0.013949307,0.0007057065,0.00097416964,0.0029602337,0.0024730477,0.0056335633,0.0023680483,0.0023131708,0.0038030394],"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.00011787158,0.00003598303,0.0003748299,0.0001483916,0.00006952719,0.000071921364,0.00012270904,0.17886476,0.00095975125,0.54796886,0.007687894,0.26357746],"study_design_scores_gemma":[0.000029623396,0.00003263456,0.000079960504,0.000027846389,0.000022898586,0.00008280014,0.000024352485,0.43005735,0.0014118743,0.555389,0.012814963,0.00002676807],"about_ca_topic_score_codex":0.003172921,"about_ca_topic_score_gemma":0.0022294787,"teacher_disagreement_score":0.0073822895,"about_ca_system_score_codex":0.001256058,"about_ca_system_score_gemma":0.0021592837,"threshold_uncertainty_score":0.02469629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123811625,0.000537727,0.98404837,0.000103125494,0.00003649335,0.000049965583,0.00006428753,0.00014040763,0.002638427],"genre_scores_gemma":[0.72794914,0.0010639232,0.26815632,0.00023402114,0.00018466963,0.00023948925,0.00034520394,0.00020472474,0.0016224517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960522,0.0016194225,0.0002467828,0.00036263952,0.0015845062,0.00013456227],"domain_scores_gemma":[0.97116673,0.021484962,0.002862706,0.0018070881,0.0024608106,0.00021762509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071547357,0.00075335574,0.00055770547,0.0022260076,0.00034379683,0.0015672073,0.0006811941,0.0007891862,0.0022415677],"category_scores_gemma":[0.03850456,0.00021101703,0.00042627612,0.0015931914,0.0019621816,0.0033565846,0.0009500228,0.0012251023,0.00037707886],"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.00060674804,0.00010801552,0.0046515088,0.0004943866,0.000108971246,0.00014720038,0.00031798947,0.33403265,0.009860243,0.43886846,0.002948942,0.20785478],"study_design_scores_gemma":[0.000054110948,0.000424666,0.0046196543,0.00014507021,0.00006048741,0.0005950385,0.00014032179,0.6904021,0.012605703,0.28255537,0.008272874,0.0001245184],"about_ca_topic_score_codex":0.00033349427,"about_ca_topic_score_gemma":0.0002799493,"teacher_disagreement_score":0.0071547357,"about_ca_system_score_codex":0.0009923223,"about_ca_system_score_gemma":0.00040649401,"threshold_uncertainty_score":0.03783828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08097411,0.0007988451,0.83189726,0.0017791189,0.00025459522,0.00008482271,0.00024566232,0.00050235813,0.08346332],"genre_scores_gemma":[0.82781184,0.0012973535,0.14379431,0.0009817601,0.00035097965,0.00015023493,0.00040140285,0.0002751909,0.024936924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990375,0.0002518336,0.000046391717,0.0002235211,0.00028025027,0.00016051864],"domain_scores_gemma":[0.998382,0.00062280643,0.00017774943,0.00038688394,0.00032375994,0.00010686932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000760945,0.00037571535,0.00035707053,0.0010441213,0.00118638,0.0018523311,0.00079172396,0.0006964742,0.0056004366],"category_scores_gemma":[0.0029946861,0.00022769546,0.00062292116,0.001021857,0.0040634456,0.005532992,0.0014745418,0.0016390815,0.0007810512],"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.000004006339,0.0000041156327,0.00003954756,0.0000071751765,0.0000010309208,0.000017069418,0.000071585106,0.0004969225,0.00021747677,0.99504256,0.00029891025,0.0037994601],"study_design_scores_gemma":[0.0000033892243,0.0000069499533,0.00003232317,0.000005086013,0.0000022685097,0.00005495976,0.000056558165,0.0030499964,0.0005679762,0.9896231,0.006591876,0.0000054940238],"about_ca_topic_score_codex":0.0016920358,"about_ca_topic_score_gemma":0.0013086636,"teacher_disagreement_score":0.0056004366,"about_ca_system_score_codex":0.0012384104,"about_ca_system_score_gemma":0.000891069,"threshold_uncertainty_score":0.01873529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4071547,0.0009550975,0.5573865,0.0014792064,0.00026076398,0.00018595075,0.00051734084,0.0017151806,0.03034526],"genre_scores_gemma":[0.8783686,0.00036083613,0.113985434,0.00022038777,0.000078538746,0.00016173025,0.00040596136,0.00010550116,0.0063130385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869174,0.00025429184,0.000062991436,0.00019440196,0.0006134109,0.00018326368],"domain_scores_gemma":[0.9967198,0.00123121,0.00037770733,0.00085127575,0.0006669217,0.0001530667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010658539,0.00055989076,0.0004611698,0.0010828947,0.0010228256,0.0009815589,0.0010501286,0.000786858,0.002552472],"category_scores_gemma":[0.0048009166,0.0002675767,0.00055425084,0.00081406673,0.0015778937,0.0014919143,0.0015070201,0.0015147417,0.0007381626],"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.0005144758,0.00017413318,0.002691073,0.00028005437,0.00007916581,0.00025178696,0.00040192986,0.14059946,0.04867257,0.699404,0.0064834114,0.10044788],"study_design_scores_gemma":[0.00010974997,0.0002217892,0.00092976517,0.000094493786,0.00005988426,0.0003226754,0.00006336255,0.70069516,0.09769843,0.18671793,0.0129824625,0.00010430612],"about_ca_topic_score_codex":0.0012621972,"about_ca_topic_score_gemma":0.0014507172,"teacher_disagreement_score":0.002552472,"about_ca_system_score_codex":0.0011122952,"about_ca_system_score_gemma":0.0014390773,"threshold_uncertainty_score":0.008538902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19828817,0.00086448656,0.5866561,0.001268729,0.00045973022,0.00033992846,0.00058432954,0.00057333265,0.21096525],"genre_scores_gemma":[0.8663696,0.0008608764,0.10589208,0.0008438086,0.00026217266,0.00049132906,0.0006018504,0.00032640036,0.024351967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996709,0.0007084044,0.0002554557,0.0007884961,0.00092622906,0.0006124903],"domain_scores_gemma":[0.9973948,0.0007080355,0.00028787585,0.00094348745,0.00046155404,0.00020427692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014620278,0.00036434722,0.00039449136,0.0009390765,0.0012624941,0.002058767,0.0008954544,0.0012400429,0.008365294],"category_scores_gemma":[0.0049286433,0.00038820098,0.0007366054,0.00082987465,0.0037853478,0.005915459,0.0039092214,0.0028815658,0.0011072793],"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.000022428983,0.00001394879,0.000049691924,0.000011134922,0.000002224136,0.0000130992275,0.00008644056,0.0004843864,0.0010971077,0.99120116,0.00034490763,0.006673427],"study_design_scores_gemma":[0.000026361124,0.000046923433,0.00013176276,0.000017276707,0.000004205838,0.000068790025,0.000059405826,0.006623481,0.00240112,0.9828576,0.007748177,0.000014929746],"about_ca_topic_score_codex":0.0007696174,"about_ca_topic_score_gemma":0.00034947606,"teacher_disagreement_score":0.008365294,"about_ca_system_score_codex":0.0010709235,"about_ca_system_score_gemma":0.0007301693,"threshold_uncertainty_score":0.027984738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06994848,0.00052318623,0.927492,0.000058367455,0.00002391378,0.000032133263,0.000026770367,0.00017597782,0.0017191113],"genre_scores_gemma":[0.45511943,0.0005181258,0.5429946,0.0000537693,0.00003698126,0.0000622062,0.00010658949,0.000054069398,0.0010542272],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953127,0.00012972188,0.00003058595,0.000064180924,0.00019935706,0.00004488814],"domain_scores_gemma":[0.99830437,0.0008061959,0.00024878365,0.00039389858,0.00020342518,0.000043407283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161677,0.00033636417,0.00035876982,0.00051911233,0.00039524722,0.00033396546,0.0004732156,0.00034610232,0.00044337628],"category_scores_gemma":[0.0034196086,0.0001935901,0.00020926303,0.0005907715,0.0005302527,0.0007287494,0.00062572764,0.00061610044,0.0002332895],"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.0005296836,0.0001004482,0.002901595,0.00036673792,0.000088674475,0.0006147025,0.0003890447,0.24578355,0.18620649,0.090456836,0.0010452151,0.471517],"study_design_scores_gemma":[0.000034856337,0.0003601426,0.0009988465,0.00007147712,0.000081549835,0.0009509647,0.000030772728,0.8070122,0.14592963,0.03671411,0.0077773035,0.000038109065],"about_ca_topic_score_codex":0.0003076615,"about_ca_topic_score_gemma":0.0008801851,"teacher_disagreement_score":0.0006161677,"about_ca_system_score_codex":0.00024301218,"about_ca_system_score_gemma":0.0005922743,"threshold_uncertainty_score":0.0032586455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014722747,0.008220453,0.9314009,0.0035175711,0.00087924855,0.00008226664,0.00038587634,0.0003460857,0.04044484],"genre_scores_gemma":[0.64516747,0.017678278,0.28216535,0.0018685743,0.0025026472,0.0008462778,0.0013424949,0.00044714907,0.04798176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983529,0.00079238554,0.00007577616,0.00017528354,0.00044245072,0.00016114033],"domain_scores_gemma":[0.9979328,0.0012319714,0.00015618654,0.00036921343,0.00026260424,0.000047248453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612515,0.00087396876,0.00073817844,0.0014712814,0.0005391835,0.0017454661,0.00094372674,0.0012841448,0.0044935266],"category_scores_gemma":[0.007049445,0.00034664237,0.00073204737,0.0017144507,0.0020936301,0.0030944601,0.0018572896,0.0024421946,0.001187225],"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.00001651269,0.0000038038197,0.00005409436,0.00004852882,0.0000060412117,0.000046183653,0.00006071665,0.014198603,0.00039560447,0.97253954,0.0025350458,0.010095349],"study_design_scores_gemma":[0.00000910302,0.00001681552,0.00008477479,0.00005365169,0.0000059262225,0.00007531574,0.000028746093,0.10839588,0.00055991096,0.8794436,0.011310315,0.000016052125],"about_ca_topic_score_codex":0.0018270733,"about_ca_topic_score_gemma":0.00193304,"teacher_disagreement_score":0.0044935266,"about_ca_system_score_codex":0.0015635556,"about_ca_system_score_gemma":0.0010591263,"threshold_uncertainty_score":0.015032351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026881838,0.001999532,0.96549535,0.0003630864,0.00005369261,0.000029834662,0.000062316365,0.00012535804,0.004988957],"genre_scores_gemma":[0.7148412,0.0033378494,0.27486062,0.00018067817,0.0001690212,0.00017902747,0.00018746033,0.000045413108,0.0061988863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994431,0.0002034594,0.000023543196,0.000053760534,0.0002301532,0.00004587038],"domain_scores_gemma":[0.9986224,0.00076148525,0.0001325518,0.00019974091,0.00025122555,0.000032726715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070780487,0.00054456195,0.00045850978,0.0004129845,0.00031029765,0.0005944839,0.0004291385,0.00052190956,0.00091093447],"category_scores_gemma":[0.003435331,0.0002838057,0.00021625108,0.00073678896,0.00080811634,0.00062601245,0.0005986194,0.0006873927,0.00039769086],"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.0001477272,0.00003823683,0.00035451248,0.00029524937,0.000036123372,0.00013826932,0.0002489141,0.39937517,0.024353068,0.46941596,0.0031928252,0.102403946],"study_design_scores_gemma":[0.000022396409,0.000051836472,0.0001253219,0.000026916809,0.000011779285,0.00007207695,0.000019333149,0.907748,0.005592171,0.082645476,0.0036664545,0.000018176559],"about_ca_topic_score_codex":0.0013337281,"about_ca_topic_score_gemma":0.0020191052,"teacher_disagreement_score":0.0013337281,"about_ca_system_score_codex":0.00094393885,"about_ca_system_score_gemma":0.0012297543,"threshold_uncertainty_score":0.006848812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4339829,0.011740863,0.46859878,0.0028736992,0.0003381806,0.00009545839,0.0011878368,0.00045049205,0.08073178],"genre_scores_gemma":[0.9904614,0.0022973756,0.004447766,0.00008982921,0.00014264518,0.00006984014,0.00016177079,0.000047739977,0.0022816581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998351,0.00055988866,0.00003445151,0.00015186751,0.00040235705,0.0005005278],"domain_scores_gemma":[0.9823057,0.014562046,0.0008732587,0.0006253168,0.0013537424,0.00027992515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020555123,0.0008440462,0.0010463992,0.0013235846,0.00058838946,0.0020226007,0.0012929474,0.00095424836,0.004419144],"category_scores_gemma":[0.013982114,0.00042982286,0.0004225401,0.001532636,0.002750285,0.0026968163,0.0014310682,0.0012405738,0.00041875098],"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.00024286917,0.00004547684,0.00053413364,0.00023069071,0.0000549717,0.0003828404,0.00019184813,0.75139284,0.0039838464,0.22791903,0.0026549313,0.012366487],"study_design_scores_gemma":[0.000016413052,0.000027370075,0.00034045902,0.000062210915,0.000015055661,0.00011312246,0.00005896447,0.9367136,0.000997237,0.06087631,0.0007509782,0.000028186834],"about_ca_topic_score_codex":0.0054913913,"about_ca_topic_score_gemma":0.0019321807,"teacher_disagreement_score":0.0054913913,"about_ca_system_score_codex":0.0026099365,"about_ca_system_score_gemma":0.0013569943,"threshold_uncertainty_score":0.018936515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014306104,0.00028907612,0.98424625,0.00021949952,0.0000508131,0.00001467953,0.000019990794,0.000071713876,0.00078192627],"genre_scores_gemma":[0.81457925,0.0013782962,0.17569955,0.00023191172,0.00023012322,0.00012925458,0.0001626551,0.00007745315,0.0075114532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980792,0.0007174732,0.000109090244,0.000411549,0.0005072653,0.00017546392],"domain_scores_gemma":[0.99445194,0.0037763224,0.00068598555,0.00037571846,0.00050812017,0.00020184419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036167195,0.0011016567,0.0012565192,0.0007159737,0.0005725106,0.0016405705,0.0011308877,0.0017301191,0.0013397206],"category_scores_gemma":[0.012897723,0.0006079374,0.001400481,0.00080951327,0.0021312626,0.0019593718,0.0013304885,0.0019400342,0.00025303764],"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.00010323698,0.000039566155,0.0008501512,0.000098497025,0.000084184954,0.00022376775,0.00023679504,0.73552823,0.0033427165,0.23809145,0.00058253465,0.020818867],"study_design_scores_gemma":[0.0000054084676,0.00002591629,0.00014596326,0.000006626549,0.000013603383,0.000022222368,0.000009572389,0.9431327,0.0006777011,0.055502493,0.0004443264,0.00001352712],"about_ca_topic_score_codex":0.0052653984,"about_ca_topic_score_gemma":0.0022574328,"teacher_disagreement_score":0.0052653984,"about_ca_system_score_codex":0.0015259221,"about_ca_system_score_gemma":0.0010227779,"threshold_uncertainty_score":0.01912725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10968499,0.0012292321,0.879757,0.00035381375,0.00005068329,0.000065210224,0.00008957543,0.00018611651,0.008583396],"genre_scores_gemma":[0.97140247,0.000678012,0.025906038,0.00008727588,0.000041595264,0.000039564933,0.000036322162,0.000018420715,0.0017903477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989166,0.00039732087,0.000034914236,0.00012604483,0.0002360311,0.0002891213],"domain_scores_gemma":[0.99661785,0.0023209134,0.00031177423,0.00023035996,0.00040667062,0.000112444744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001512242,0.0012973703,0.0009377898,0.00060730765,0.0007012572,0.0011374138,0.0014053509,0.00093848835,0.0012645965],"category_scores_gemma":[0.005077353,0.00031724252,0.0007032784,0.00067976455,0.0021687762,0.0016896704,0.0012424511,0.0010469331,0.00026341205],"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.0002451922,0.000044952598,0.00045475474,0.00017459595,0.000055024364,0.00054068037,0.00038598533,0.84005433,0.007925311,0.13336842,0.00077882037,0.015971923],"study_design_scores_gemma":[0.000013293252,0.00009476266,0.00009815136,0.000009536969,0.000026564747,0.00014330598,0.00004525172,0.97960985,0.001110563,0.018345056,0.00048464953,0.00001904007],"about_ca_topic_score_codex":0.0048575466,"about_ca_topic_score_gemma":0.0033775931,"teacher_disagreement_score":0.0048575466,"about_ca_system_score_codex":0.0017287403,"about_ca_system_score_gemma":0.0009139678,"threshold_uncertainty_score":0.012542963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037004568,0.0009136637,0.85971403,0.024788044,0.0011089311,0.00017662269,0.00134823,0.0034841814,0.07146174],"genre_scores_gemma":[0.5727649,0.0022064578,0.3521242,0.008514035,0.002900453,0.0005710933,0.0040798886,0.002623997,0.054214995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949588,0.0011066784,0.00031263471,0.002013301,0.0009698193,0.0006387219],"domain_scores_gemma":[0.9864096,0.00786018,0.000748567,0.0029246102,0.0017163473,0.00034065594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002931843,0.0008500674,0.0017885299,0.0009924273,0.0019761021,0.005706554,0.0019891472,0.0026132404,0.01998136],"category_scores_gemma":[0.026007704,0.00081521296,0.001688154,0.0020038167,0.0029270689,0.008836265,0.0025433637,0.0043431385,0.007706907],"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.00028955808,0.00015330051,0.0022481675,0.00043789358,0.00020688535,0.00027829857,0.0005709611,0.010879289,0.0022829047,0.7264369,0.046992186,0.20922367],"study_design_scores_gemma":[0.000023219065,0.000024712937,0.00029090632,0.00002987102,0.000044096683,0.00025719468,0.00016088877,0.042103536,0.0014238502,0.94252455,0.013093195,0.000023967888],"about_ca_topic_score_codex":0.0036116745,"about_ca_topic_score_gemma":0.003227894,"teacher_disagreement_score":0.01998136,"about_ca_system_score_codex":0.001291297,"about_ca_system_score_gemma":0.0031563353,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08452472,0.0037565061,0.7857874,0.0026515806,0.0005774895,0.00006290399,0.00037232813,0.0003453282,0.12192172],"genre_scores_gemma":[0.77515376,0.0052781547,0.17447694,0.0016243409,0.0012707342,0.00018162311,0.0005669874,0.0004450214,0.04100246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00032366905,0.00003796236,0.00017768801,0.00022692596,0.00016828778],"domain_scores_gemma":[0.99827814,0.0008152429,0.00020783232,0.00022934996,0.00035021323,0.00011924134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013985172,0.0009488667,0.0005897403,0.0025792979,0.0014408646,0.0019524186,0.0007331864,0.0014503062,0.0058451346],"category_scores_gemma":[0.0043105828,0.00041548724,0.0010625989,0.0020831195,0.004476688,0.0049663056,0.0017234061,0.0024639913,0.0014219703],"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.0000055271676,0.0000041448557,0.00004323061,0.000008577438,0.0000015581114,0.000027074499,0.00006450643,0.0011628178,0.00019438224,0.9949203,0.00038399073,0.0031838291],"study_design_scores_gemma":[0.0000017356014,0.0000050753906,0.00003687209,0.000007733263,0.000001224794,0.00003870712,0.000020790238,0.003754787,0.000114861636,0.9933066,0.0027059694,0.0000057075476],"about_ca_topic_score_codex":0.0023605814,"about_ca_topic_score_gemma":0.0011090507,"teacher_disagreement_score":0.0058451346,"about_ca_system_score_codex":0.0014984688,"about_ca_system_score_gemma":0.00057713984,"threshold_uncertainty_score":0.0195539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10463452,0.0014401174,0.8846711,0.00030261066,0.00015853222,0.00017912957,0.0001997898,0.0009777433,0.0074364943],"genre_scores_gemma":[0.5475333,0.00087038364,0.4440228,0.00031977816,0.0002769379,0.00056655955,0.00057011185,0.000114948016,0.005725141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931943,0.00017831483,0.00007660278,0.00011807851,0.00021794773,0.00008957805],"domain_scores_gemma":[0.9987192,0.0004032693,0.0002654948,0.0002235492,0.00032165524,0.00006684167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074017263,0.0006999669,0.0004532702,0.00071670354,0.0006640314,0.00053847046,0.00078881707,0.00047279266,0.0028477288],"category_scores_gemma":[0.0021268043,0.00029314889,0.00035173172,0.00080889714,0.0004952533,0.0012700375,0.00071121915,0.0006534592,0.0008709224],"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.0019213533,0.00022573417,0.002061558,0.000685561,0.00012599748,0.0009414532,0.0005813222,0.037588656,0.21241249,0.14423735,0.0068123764,0.5924061],"study_design_scores_gemma":[0.0006858656,0.0042792163,0.0031584299,0.00045333098,0.00031735067,0.005955861,0.0003133649,0.34910378,0.3913013,0.13418716,0.11001098,0.00023338727],"about_ca_topic_score_codex":0.00028879143,"about_ca_topic_score_gemma":0.0005532609,"teacher_disagreement_score":0.0028477288,"about_ca_system_score_codex":0.00067484623,"about_ca_system_score_gemma":0.0004236868,"threshold_uncertainty_score":0.00952661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044898428,0.0072417236,0.8379041,0.0038165424,0.0008588335,0.00014362742,0.00028911364,0.00046042065,0.10438729],"genre_scores_gemma":[0.7642855,0.005286107,0.21034573,0.0009905827,0.001298647,0.00020726549,0.00027899558,0.00020900945,0.017098239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958864,0.0010716121,0.00025172083,0.00071798847,0.0016399896,0.00043238577],"domain_scores_gemma":[0.99470514,0.0019929837,0.00048259375,0.0016962904,0.0009125293,0.00021035182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832391,0.00093137904,0.00070897985,0.0021705849,0.0010176135,0.003570336,0.0012487265,0.0013373857,0.0049209087],"category_scores_gemma":[0.0082337065,0.000631393,0.0012960519,0.0013222754,0.0033285727,0.006625334,0.0034594678,0.004286138,0.0025067148],"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.00012725497,0.00003280644,0.00038280926,0.00009161096,0.000023163031,0.00013349824,0.00010275137,0.0050693057,0.0046184403,0.9576022,0.0021201794,0.029696012],"study_design_scores_gemma":[0.00003665025,0.00008617776,0.00024791906,0.000075045675,0.00003719554,0.0014436237,0.000059632595,0.070320636,0.008488052,0.8792057,0.039943326,0.00005596538],"about_ca_topic_score_codex":0.00030776593,"about_ca_topic_score_gemma":0.0001238065,"teacher_disagreement_score":0.0049209087,"about_ca_system_score_codex":0.0013009346,"about_ca_system_score_gemma":0.00088969246,"threshold_uncertainty_score":0.016462028},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092948586,0.002339801,0.8775239,0.0017570028,0.0002726887,0.00015000961,0.00034120659,0.00028248632,0.024384338],"genre_scores_gemma":[0.67158514,0.0021083816,0.31294227,0.0006727526,0.00070904335,0.0006329215,0.00048565507,0.00044199746,0.010421964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98984843,0.0030916245,0.00081199955,0.0018780804,0.0032977436,0.0010722607],"domain_scores_gemma":[0.97456384,0.016211707,0.0023903789,0.003474518,0.0020280282,0.0013315625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008293476,0.0022376955,0.0018090077,0.00542951,0.0018985856,0.006522252,0.002872841,0.0025304987,0.005535771],"category_scores_gemma":[0.045141645,0.0010688107,0.001560239,0.0028330472,0.0074208034,0.017176492,0.005435642,0.004263197,0.0011672681],"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.00013961237,0.000047138525,0.0012449212,0.00015736521,0.00002654143,0.0000965141,0.00028495648,0.015889565,0.0038619672,0.9512625,0.0010551221,0.025933882],"study_design_scores_gemma":[0.000030265444,0.00022335451,0.0006966916,0.000099123165,0.000026981923,0.00046288423,0.00023704057,0.057477344,0.0040782657,0.9269976,0.009603766,0.00006668328],"about_ca_topic_score_codex":0.0005776318,"about_ca_topic_score_gemma":0.00041429538,"teacher_disagreement_score":0.008293476,"about_ca_system_score_codex":0.0038339894,"about_ca_system_score_gemma":0.0017612206,"threshold_uncertainty_score":0.043860614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21609259,0.0010514584,0.7600806,0.0008232714,0.00003781687,0.00007527959,0.00030271563,0.00018203167,0.02135424],"genre_scores_gemma":[0.9132985,0.0009037977,0.079290904,0.00017183383,0.00006950154,0.00012662199,0.00026919958,0.00008413169,0.0057856566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953055,0.0001175626,0.00003095007,0.00008366615,0.00019319773,0.000044114662],"domain_scores_gemma":[0.99799734,0.0010722002,0.0003358656,0.00015262899,0.00036145354,0.0000805273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974044,0.00030355077,0.0006556076,0.0008291791,0.00040563644,0.0010027011,0.0005442138,0.0006802356,0.0029164099],"category_scores_gemma":[0.005092616,0.00036700058,0.00031234176,0.00062620343,0.0018055256,0.0016603724,0.0010920812,0.00093473995,0.00027024923],"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.0000679005,0.000020088777,0.0003847574,0.000076560806,0.000013045079,0.0000771958,0.00014531944,0.11843735,0.005535542,0.8549379,0.0007795578,0.01952484],"study_design_scores_gemma":[0.000020139407,0.00005880466,0.00036296525,0.00002179463,0.000008361873,0.0000833093,0.000044291213,0.5749431,0.0029424157,0.41990072,0.0015903348,0.000023747543],"about_ca_topic_score_codex":0.0006084426,"about_ca_topic_score_gemma":0.00047724822,"teacher_disagreement_score":0.0029164099,"about_ca_system_score_codex":0.0009386458,"about_ca_system_score_gemma":0.0005290451,"threshold_uncertainty_score":0.009756327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093902856,0.00032291052,0.90214133,0.00025932663,0.000049351198,0.00007188053,0.00006934102,0.0004788013,0.0027041235],"genre_scores_gemma":[0.81518674,0.00021012362,0.1816523,0.00013403379,0.000049597667,0.00008197159,0.00010774017,0.0000730073,0.0025045958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980338,0.00043309788,0.00018484959,0.00039426755,0.0007799481,0.00017396637],"domain_scores_gemma":[0.995038,0.0021240637,0.0011450287,0.001110828,0.00045976086,0.00012237516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024881163,0.0006689675,0.0006443003,0.0006520831,0.0005599204,0.0011388507,0.0013937624,0.00070049113,0.0018050754],"category_scores_gemma":[0.008006683,0.00029860542,0.00034377817,0.00073578104,0.000941913,0.0023005535,0.0014349512,0.0010253271,0.00037983185],"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.0010836585,0.00019707129,0.0017238285,0.00038931577,0.0000727209,0.00031905674,0.00031987645,0.42187133,0.11664493,0.16113225,0.0015769629,0.29466894],"study_design_scores_gemma":[0.00004727958,0.0005767016,0.00039778044,0.000039773175,0.000033994696,0.00023934833,0.000058604615,0.8744498,0.08109353,0.039768595,0.0032519628,0.00004271427],"about_ca_topic_score_codex":0.00042006094,"about_ca_topic_score_gemma":0.00039000594,"teacher_disagreement_score":0.0024881163,"about_ca_system_score_codex":0.0009818494,"about_ca_system_score_gemma":0.00077602704,"threshold_uncertainty_score":0.013158619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62404567,0.0007013727,0.33270907,0.0008448019,0.00007454416,0.00008735973,0.00026981722,0.00011658672,0.041150752],"genre_scores_gemma":[0.9792252,0.0004011548,0.017119603,0.00005672067,0.000055171728,0.0000495105,0.0001541757,0.000024274623,0.0029141596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871993,0.00045360991,0.000041859043,0.000087957014,0.0005088298,0.00018772842],"domain_scores_gemma":[0.9939813,0.0036289713,0.0009586827,0.0003639332,0.00089396216,0.00017305028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010969893,0.00055174035,0.00043123256,0.00074491824,0.00063844625,0.0011621852,0.00042151904,0.0005447473,0.0023307002],"category_scores_gemma":[0.0067564426,0.00025014835,0.00038287,0.0010043461,0.0017402844,0.0016232252,0.00092295144,0.00091260544,0.00034363367],"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.0004345738,0.00004342492,0.0013581408,0.00011719306,0.00002606043,0.0004711764,0.00034699804,0.22670467,0.015872838,0.74012774,0.00079654576,0.013700624],"study_design_scores_gemma":[0.00009919346,0.0002570212,0.0014098577,0.000044779892,0.00002016968,0.0007414649,0.00013855142,0.73329544,0.011366066,0.24903983,0.0035195258,0.00006809845],"about_ca_topic_score_codex":0.0014556104,"about_ca_topic_score_gemma":0.00089395785,"teacher_disagreement_score":0.0023307002,"about_ca_system_score_codex":0.0010211597,"about_ca_system_score_gemma":0.00075622887,"threshold_uncertainty_score":0.007796943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029767647,0.00031483494,0.96640265,0.00013368991,0.00003544035,0.000050789055,0.00006123281,0.00019753037,0.0030360492],"genre_scores_gemma":[0.56192386,0.0007343241,0.43496504,0.000081899576,0.000028020953,0.00013735796,0.000115139715,0.000049055536,0.0019654024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996705,0.000098886456,0.000016743808,0.00003202411,0.00015440346,0.000027401233],"domain_scores_gemma":[0.9994697,0.00021553959,0.00006270108,0.00011505238,0.0001175957,0.000019462492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047649295,0.00036073066,0.00031008356,0.00040029633,0.00030126792,0.0004991457,0.00039936937,0.00044255017,0.0009910582],"category_scores_gemma":[0.0021009143,0.00015887675,0.00023405813,0.0004330509,0.00052882277,0.0006675231,0.00061080506,0.0005988277,0.00035794286],"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.00019265823,0.000060660335,0.00061992527,0.00023303746,0.000025148873,0.00018563833,0.00019873898,0.29114556,0.05757544,0.54570085,0.0013468825,0.10271547],"study_design_scores_gemma":[0.000018164994,0.000079086545,0.00010716156,0.000022456585,0.000011569343,0.00012082373,0.000015665566,0.9306507,0.021508275,0.043229386,0.0042154053,0.00002127246],"about_ca_topic_score_codex":0.0006864079,"about_ca_topic_score_gemma":0.0006931346,"teacher_disagreement_score":0.0009910582,"about_ca_system_score_codex":0.00055389677,"about_ca_system_score_gemma":0.00070241274,"threshold_uncertainty_score":0.0040187836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49709746,0.0010175376,0.4749022,0.00095973816,0.00013240716,0.000119123564,0.0006937329,0.00032055756,0.024757287],"genre_scores_gemma":[0.99412125,0.0002528304,0.00438407,0.00005498064,0.000050300965,0.00005887445,0.00007459126,0.00001662971,0.000986564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990013,0.00029817809,0.000036681584,0.00012137656,0.00027316238,0.0002692931],"domain_scores_gemma":[0.99434704,0.003999908,0.0004849335,0.00041786782,0.0005309754,0.00021930535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012071064,0.00045062692,0.000670356,0.0006672808,0.0004819921,0.0012584978,0.00084530097,0.0006913695,0.0025736208],"category_scores_gemma":[0.005994346,0.00018583713,0.0004811883,0.0005217054,0.0016143695,0.0018957098,0.0009726765,0.00080490764,0.00020546952],"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.00020543308,0.000071511124,0.00090161036,0.00014739273,0.0000457638,0.00034659184,0.00018258828,0.23865193,0.008216705,0.73788327,0.0015114548,0.011835756],"study_design_scores_gemma":[0.000022139671,0.000040493454,0.00033328473,0.000017612374,0.000010458699,0.000146688,0.000033477383,0.74660367,0.0021643923,0.24990503,0.0007000867,0.000022706885],"about_ca_topic_score_codex":0.0013599338,"about_ca_topic_score_gemma":0.00047580875,"teacher_disagreement_score":0.0025736208,"about_ca_system_score_codex":0.0012342534,"about_ca_system_score_gemma":0.0012829882,"threshold_uncertainty_score":0.008955121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16593347,0.0014668669,0.8194303,0.0014666808,0.00012539474,0.00012660646,0.0004964593,0.00056261383,0.010391566],"genre_scores_gemma":[0.9157158,0.001773184,0.066634364,0.00059735513,0.0004517195,0.00033846425,0.0011109612,0.0003793701,0.012998805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903536,0.00030437703,0.00003605878,0.00021730889,0.00024571683,0.00016114318],"domain_scores_gemma":[0.99497896,0.0023578205,0.0008867549,0.0004140612,0.0009657356,0.00039670256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031381247,0.00094711035,0.0010712955,0.0028174182,0.00076176703,0.0018376056,0.0016259226,0.0014654903,0.0037856663],"category_scores_gemma":[0.009694453,0.0005218136,0.0014238043,0.0010976348,0.002714775,0.003176733,0.0012978739,0.0019554186,0.00057962054],"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.00002428801,0.000026150386,0.001337042,0.00005705498,0.000028940483,0.00014012205,0.00012406742,0.031087868,0.0016578448,0.9579164,0.0015890921,0.0060112113],"study_design_scores_gemma":[0.000014822472,0.000022987224,0.001349238,0.000025947302,0.00001339956,0.00021699132,0.00004722163,0.5414478,0.000436726,0.45422435,0.002151785,0.000048661164],"about_ca_topic_score_codex":0.0037314636,"about_ca_topic_score_gemma":0.002383772,"teacher_disagreement_score":0.0037856663,"about_ca_system_score_codex":0.00193454,"about_ca_system_score_gemma":0.0012826571,"threshold_uncertainty_score":0.016596198},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53513235,0.0020294765,0.40508634,0.0013902392,0.00011479409,0.00019099361,0.0017726496,0.0006385346,0.053644754],"genre_scores_gemma":[0.9909251,0.0006176458,0.006118454,0.00008065741,0.000078348705,0.00011531405,0.0002277062,0.000033620447,0.0018032286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.00041591315,0.000052573367,0.00024888775,0.00048218115,0.00047436124],"domain_scores_gemma":[0.99424344,0.004041765,0.0005248288,0.00048579712,0.00049204996,0.00021211209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015560974,0.00076547207,0.0009551435,0.0015220925,0.0009057809,0.0028812413,0.0013263386,0.0009344572,0.0039258897],"category_scores_gemma":[0.0069955927,0.00027642187,0.00056237157,0.0012776727,0.0023649253,0.0026173599,0.0015540444,0.0011337785,0.00053763215],"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.0003540509,0.00006229655,0.0008608275,0.00016664556,0.00005169395,0.0003113848,0.00035238045,0.19449621,0.0059985085,0.7757963,0.0033496115,0.018200038],"study_design_scores_gemma":[0.000058952588,0.00007172118,0.0004622692,0.000056662582,0.00003126273,0.00033856902,0.000103286766,0.6219763,0.004009386,0.36875638,0.004082769,0.000052355666],"about_ca_topic_score_codex":0.0012905949,"about_ca_topic_score_gemma":0.00046734698,"teacher_disagreement_score":0.0039258897,"about_ca_system_score_codex":0.0019163259,"about_ca_system_score_gemma":0.0010841582,"threshold_uncertainty_score":0.013903916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13771945,0.0005883063,0.8325463,0.002014754,0.00028737527,0.00029558773,0.0022466425,0.0014473383,0.022854336],"genre_scores_gemma":[0.784961,0.00072080706,0.1952884,0.00093372056,0.00030139388,0.0009642692,0.0027361675,0.0003443192,0.013749895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99553645,0.0005650326,0.0003664548,0.0013054193,0.0011862983,0.001040317],"domain_scores_gemma":[0.9753238,0.013226449,0.0022000785,0.0027270315,0.005024224,0.001498267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027672523,0.0014951114,0.001953544,0.0024629028,0.0023799988,0.0026198593,0.002107701,0.002743897,0.008104042],"category_scores_gemma":[0.026281305,0.0012575944,0.0014702191,0.0022184935,0.0039870464,0.004109744,0.0038453648,0.0034092485,0.0036639052],"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.0008066755,0.00012482035,0.00184045,0.0004306251,0.000091368434,0.00063765346,0.00044378478,0.045690462,0.020967152,0.89272165,0.007074027,0.029171368],"study_design_scores_gemma":[0.00042497978,0.00056850875,0.0010436437,0.0002063617,0.0000774625,0.0014040158,0.0002769285,0.2581803,0.02718613,0.6963915,0.013959587,0.00028058043],"about_ca_topic_score_codex":0.0024129406,"about_ca_topic_score_gemma":0.002076808,"teacher_disagreement_score":0.008104042,"about_ca_system_score_codex":0.0019012223,"about_ca_system_score_gemma":0.0054899435,"threshold_uncertainty_score":0.027110755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043553974,0.0007855787,0.9459191,0.00031495976,0.0000226874,0.00006292002,0.00015783722,0.00012371605,0.009059167],"genre_scores_gemma":[0.87479883,0.0015844902,0.1153055,0.0002735552,0.00008482438,0.00026174638,0.0003616981,0.00021055773,0.0071188253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989084,0.00031831666,0.00006849119,0.00015949254,0.00042416994,0.00012114694],"domain_scores_gemma":[0.995673,0.002944589,0.00042253427,0.00035467377,0.0005113989,0.00009366941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022374294,0.00060127693,0.0010171541,0.0006878027,0.00044100208,0.001633009,0.00089134794,0.0006940891,0.0051150005],"category_scores_gemma":[0.010945104,0.0004698992,0.00049404014,0.0009878488,0.0018074429,0.0031619815,0.0016577013,0.0012743007,0.0006029196],"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.00025282346,0.00004622366,0.000870539,0.00023137986,0.000038789894,0.00024883,0.00039700003,0.26286218,0.019250583,0.6576422,0.0018956643,0.05626373],"study_design_scores_gemma":[0.000027170563,0.00010493088,0.00027303438,0.00004475522,0.0000131798615,0.00020344892,0.00010096474,0.84602535,0.007975818,0.14333993,0.0018572279,0.000034259527],"about_ca_topic_score_codex":0.0013037247,"about_ca_topic_score_gemma":0.0006553918,"teacher_disagreement_score":0.0051150005,"about_ca_system_score_codex":0.0012209336,"about_ca_system_score_gemma":0.0006987822,"threshold_uncertainty_score":0.017111361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023381436,0.000751466,0.9672875,0.0008508338,0.000065916975,0.00007285483,0.00010639775,0.000170534,0.007313092],"genre_scores_gemma":[0.6624388,0.0008801933,0.33155116,0.0004792246,0.00023418928,0.0006453978,0.00025819335,0.000346283,0.0031664742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939242,0.0029906374,0.000276301,0.00094891555,0.0015682864,0.0002916762],"domain_scores_gemma":[0.95372355,0.039153986,0.0013782326,0.0036552232,0.0016013704,0.0004877443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010839758,0.0009645141,0.0012181521,0.0028680642,0.0010342776,0.0034574925,0.0019854354,0.002065193,0.003970255],"category_scores_gemma":[0.088894784,0.0009034412,0.00085037237,0.001874017,0.005304604,0.009216029,0.0036765994,0.0024898825,0.00046216763],"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.0001438668,0.00005954302,0.0016442542,0.00016492915,0.00007022435,0.00015288827,0.0002711906,0.09524222,0.0026485529,0.8380401,0.0010932984,0.06046902],"study_design_scores_gemma":[0.00002979894,0.00005126609,0.00074725086,0.00006330734,0.000033632543,0.0002164852,0.00006411838,0.20905767,0.0033406331,0.78428495,0.0020605552,0.00005042289],"about_ca_topic_score_codex":0.0007298169,"about_ca_topic_score_gemma":0.000740451,"teacher_disagreement_score":0.010839758,"about_ca_system_score_codex":0.0020277046,"about_ca_system_score_gemma":0.0011233349,"threshold_uncertainty_score":0.057326794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018475212,0.020578634,0.93576235,0.0070241257,0.00043567288,0.00018216555,0.0019717475,0.0009252642,0.014644876],"genre_scores_gemma":[0.598096,0.044417117,0.32186508,0.004094795,0.0057827593,0.002099537,0.010147012,0.0013020412,0.012195653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98732924,0.004722626,0.00062091474,0.0021262816,0.004170786,0.0010301787],"domain_scores_gemma":[0.8242681,0.14606541,0.0075273053,0.013566088,0.0068687955,0.0017042287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021682769,0.0039160713,0.0035543817,0.0069484953,0.0027256163,0.0050785937,0.0058780587,0.0053094192,0.012575815],"category_scores_gemma":[0.15760489,0.0020130235,0.0028997834,0.009966679,0.009375037,0.015338088,0.0069620414,0.009475951,0.0026430453],"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.00069752935,0.00044521512,0.010895151,0.0022114206,0.00058319734,0.000516763,0.00068859896,0.32334492,0.0019602417,0.48432872,0.035045978,0.1392824],"study_design_scores_gemma":[0.00010079844,0.0001478688,0.0027817385,0.00040980414,0.00010084382,0.00046694904,0.00021998049,0.512844,0.0012515311,0.47202325,0.009542309,0.00011082173],"about_ca_topic_score_codex":0.00356344,"about_ca_topic_score_gemma":0.0021790692,"teacher_disagreement_score":0.021682769,"about_ca_system_score_codex":0.004693077,"about_ca_system_score_gemma":0.002995468,"threshold_uncertainty_score":0.11467081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111794636,0.029548582,0.72761554,0.0014541987,0.0010582542,0.00012212849,0.00016233149,0.00030140244,0.12794286],"genre_scores_gemma":[0.837348,0.019237436,0.10970461,0.00048756367,0.00075592793,0.0001405787,0.0001593365,0.00009794098,0.0320687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998492,0.000030181496,0.000007805348,0.000021699312,0.000073776144,0.000017363074],"domain_scores_gemma":[0.99990964,0.000043254666,0.000012722391,0.000018208104,0.000012414315,0.0000037460413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021075139,0.00034920912,0.00031756266,0.00032386786,0.0002736447,0.0007719131,0.00027239212,0.0006115267,0.00197829],"category_scores_gemma":[0.00048423916,0.00013067121,0.00022403369,0.0004666574,0.00094993133,0.0008341586,0.00044116584,0.000598174,0.0006213007],"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.00016085834,0.000071947914,0.00040689693,0.0005295404,0.000026402386,0.0003634948,0.0003227997,0.021468956,0.2054425,0.60966164,0.0040519447,0.15749305],"study_design_scores_gemma":[0.0000402595,0.00045380316,0.0024394605,0.0002578657,0.000041000963,0.0029139854,0.00016483568,0.49881122,0.13652812,0.264258,0.09397736,0.00011406537],"about_ca_topic_score_codex":0.00028150325,"about_ca_topic_score_gemma":0.00018222876,"teacher_disagreement_score":0.00197829,"about_ca_system_score_codex":0.00035145553,"about_ca_system_score_gemma":0.00015465863,"threshold_uncertainty_score":0.006618023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058491137,0.0047726757,0.80195785,0.008142101,0.0002592029,0.000105959414,0.00012440667,0.00024733788,0.12589942],"genre_scores_gemma":[0.89706767,0.002638911,0.090116,0.0011409449,0.000565911,0.00026813586,0.000056068402,0.00013932081,0.00800707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950582,0.0024718184,0.00013736136,0.00033694995,0.0015974501,0.0003982909],"domain_scores_gemma":[0.9918401,0.006401156,0.00033571306,0.00088706426,0.000333856,0.00020203357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005535611,0.0008684935,0.00073804933,0.0010987436,0.0015323317,0.003832487,0.0012783367,0.0023863488,0.004594568],"category_scores_gemma":[0.011161041,0.0005286474,0.00070924486,0.0011350396,0.007865178,0.010338056,0.0034472162,0.0024129339,0.00056964345],"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.000016017,0.000007497659,0.00003603616,0.000025736153,0.0000042206398,0.000025762674,0.00004927598,0.006142047,0.0003415323,0.99053776,0.00031680672,0.0024973508],"study_design_scores_gemma":[0.000011594629,0.000019792731,0.000040930376,0.000019797393,0.000005427161,0.00004884939,0.000027945065,0.05437982,0.00082353834,0.94226784,0.0023361552,0.000018328674],"about_ca_topic_score_codex":0.0008686583,"about_ca_topic_score_gemma":0.0006355492,"teacher_disagreement_score":0.005535611,"about_ca_system_score_codex":0.0030759925,"about_ca_system_score_gemma":0.0014938881,"threshold_uncertainty_score":0.029275477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5852212,0.0014518659,0.37609375,0.00043431952,0.0001542586,0.00009773653,0.00063245447,0.0009279184,0.03498644],"genre_scores_gemma":[0.8318835,0.00075578457,0.15131669,0.00021015469,0.0000794624,0.00016009957,0.0010404489,0.00014100471,0.014412872],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.000062964726,0.000023321494,0.00009013511,0.000090885376,0.000052306183],"domain_scores_gemma":[0.9993193,0.00018112062,0.00010869087,0.00012953627,0.00017125586,0.000090085734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245242,0.00025759815,0.0003370815,0.00061716273,0.0006619425,0.0004273743,0.00030183143,0.00031077312,0.0019821273],"category_scores_gemma":[0.0010806894,0.0001925208,0.00038460433,0.00061834964,0.0004225137,0.0007212372,0.000524129,0.0004267331,0.00041499085],"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.00077926804,0.00015634262,0.0072437436,0.00046589988,0.000064665655,0.001927417,0.0008673104,0.027578197,0.3686444,0.3081181,0.009147711,0.27500695],"study_design_scores_gemma":[0.00014021847,0.0010308992,0.011149858,0.00018007669,0.00012492728,0.0096185235,0.0003769041,0.39245766,0.30795416,0.12676069,0.14998792,0.0002181654],"about_ca_topic_score_codex":0.0004349948,"about_ca_topic_score_gemma":0.0003664758,"teacher_disagreement_score":0.0019821273,"about_ca_system_score_codex":0.00047455495,"about_ca_system_score_gemma":0.0005324777,"threshold_uncertainty_score":0.006630838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25718725,0.0020867416,0.7206249,0.0025931436,0.00010221583,0.00012582933,0.00034278087,0.00022634405,0.016710795],"genre_scores_gemma":[0.89400107,0.0010436471,0.09865383,0.00053695403,0.00013284141,0.00020997495,0.0003052255,0.000102328246,0.0050140135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980988,0.00049747695,0.00016420997,0.00034108985,0.0006190834,0.00027939747],"domain_scores_gemma":[0.9859656,0.0090187695,0.0021230471,0.0012164549,0.0012070581,0.00046902054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466598,0.00050627,0.001604898,0.0007031967,0.00082253176,0.0015258517,0.0012104079,0.0014922717,0.003612797],"category_scores_gemma":[0.025389776,0.00083474343,0.00054861075,0.00083918445,0.0040583275,0.007676212,0.0018786569,0.0013259863,0.00054587855],"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.00036409855,0.00010770916,0.0015665375,0.00019185714,0.00004854425,0.00012343713,0.00021740157,0.09872957,0.004043424,0.8447566,0.001777326,0.048073366],"study_design_scores_gemma":[0.00009472723,0.00017440827,0.00074480684,0.000066673725,0.000023239203,0.0001665846,0.000117062686,0.34124956,0.0055875937,0.6484725,0.0032599748,0.00004289944],"about_ca_topic_score_codex":0.00086813816,"about_ca_topic_score_gemma":0.00072970946,"teacher_disagreement_score":0.003612797,"about_ca_system_score_codex":0.0013884928,"about_ca_system_score_gemma":0.0009719728,"threshold_uncertainty_score":0.013044834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2711621,0.0011087679,0.66382414,0.0014474865,0.00031322023,0.00014772466,0.0010680768,0.0018487688,0.05907978],"genre_scores_gemma":[0.8526892,0.00088503433,0.11718382,0.0009727015,0.0005485938,0.0004058354,0.0016261073,0.0007275613,0.024961213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760723,0.0006925343,0.00013756136,0.000567,0.00068939937,0.00030625067],"domain_scores_gemma":[0.99032146,0.004871544,0.0012093543,0.0014196944,0.0015159453,0.0006620114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017280006,0.0007231103,0.000719339,0.0024242292,0.0017301588,0.0018108021,0.00072036695,0.0010149514,0.005985951],"category_scores_gemma":[0.013273488,0.00081611105,0.0012539498,0.001538467,0.0016111417,0.0022002168,0.001818279,0.0020516708,0.0031270462],"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.00043432953,0.0000914856,0.0022313136,0.0002452357,0.000045567485,0.0014536117,0.000996084,0.011046853,0.01800102,0.9005197,0.008078078,0.056856707],"study_design_scores_gemma":[0.00010382858,0.00030270914,0.0026100175,0.00020102161,0.00009065793,0.0040715756,0.00034013737,0.114534825,0.02744243,0.808197,0.041927077,0.00017865088],"about_ca_topic_score_codex":0.000733533,"about_ca_topic_score_gemma":0.0006133424,"teacher_disagreement_score":0.005985951,"about_ca_system_score_codex":0.0016886991,"about_ca_system_score_gemma":0.0013632223,"threshold_uncertainty_score":0.020024955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021319387,0.001310529,0.9707272,0.000117503245,0.000094222574,0.000024484301,0.000040425537,0.00008579218,0.0062805377],"genre_scores_gemma":[0.5330832,0.005671935,0.4535157,0.00033087493,0.00040887558,0.00011782541,0.00016128448,0.00013238197,0.0065778783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987852,0.00033020577,0.00007487263,0.00019252967,0.0005655718,0.000051613482],"domain_scores_gemma":[0.9966968,0.00197422,0.00033744288,0.00042545132,0.0004977793,0.00006821947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012275588,0.0008852198,0.00048183592,0.0012019211,0.0003923968,0.00091991125,0.0005918894,0.00051808095,0.0016962949],"category_scores_gemma":[0.0049200444,0.00023817105,0.0004949114,0.0011382012,0.002137071,0.0018944236,0.0012675263,0.0016917596,0.0004709088],"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.00012651851,0.000052898275,0.00074813084,0.00037849086,0.000042822237,0.00037312036,0.00029322156,0.10371928,0.04218179,0.7584104,0.00088294304,0.09279036],"study_design_scores_gemma":[0.000009852745,0.0001779742,0.0007841578,0.0000932902,0.000029412759,0.0006612436,0.000067319095,0.73041177,0.03749857,0.22344282,0.006751516,0.00007209457],"about_ca_topic_score_codex":0.0004875061,"about_ca_topic_score_gemma":0.0004011224,"teacher_disagreement_score":0.0016962949,"about_ca_system_score_codex":0.00057648536,"about_ca_system_score_gemma":0.00028658728,"threshold_uncertainty_score":0.0064920187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67242455,0.0003840217,0.3108873,0.00024039486,0.000032327647,0.00010826852,0.00052698195,0.00025764853,0.015138452],"genre_scores_gemma":[0.96185213,0.0002778713,0.032892153,0.00010527419,0.00005067917,0.00010998006,0.00059605786,0.000091377755,0.0040244344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960035,0.00006610369,0.000023805524,0.00011634578,0.00011541724,0.00007796075],"domain_scores_gemma":[0.9976376,0.0012121279,0.00044563206,0.00022234384,0.00026879835,0.00021349508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032191494,0.00031635427,0.00039417786,0.0013687036,0.00079807866,0.00093235297,0.0006504516,0.00050424534,0.0030356988],"category_scores_gemma":[0.0027883267,0.00031239178,0.0005432343,0.00077371224,0.0013472718,0.0014965379,0.0008997362,0.0009001619,0.00026822087],"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.00016024723,0.00010646118,0.008101442,0.00022003234,0.000037203798,0.0005739607,0.0010402929,0.05642751,0.026800647,0.8776255,0.0016088341,0.027297804],"study_design_scores_gemma":[0.000038809296,0.000186898,0.0056003453,0.00008355081,0.00004101026,0.0011087352,0.00042745937,0.35339454,0.014741874,0.6169753,0.0073347352,0.000066630935],"about_ca_topic_score_codex":0.0007893115,"about_ca_topic_score_gemma":0.0006191036,"teacher_disagreement_score":0.0030356988,"about_ca_system_score_codex":0.00064751273,"about_ca_system_score_gemma":0.00039154894,"threshold_uncertainty_score":0.01015538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027488212,0.00010407922,0.99490947,0.000052324933,0.000024525561,0.000033177705,0.000016885082,0.00019596242,0.0019147508],"genre_scores_gemma":[0.123468205,0.00033607398,0.86856097,0.000143737,0.00008670248,0.00019296602,0.00008268042,0.00007840241,0.007050186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993243,0.00018788055,0.000038422728,0.00010253763,0.00029314627,0.000053646392],"domain_scores_gemma":[0.99939287,0.0002611425,0.000057711368,0.00013731132,0.00013179722,0.000019291805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006146632,0.0010539618,0.00057170243,0.0006773482,0.00041661915,0.0005927625,0.000758892,0.00078600965,0.0029232914],"category_scores_gemma":[0.0016887368,0.00032201657,0.00053143874,0.00049476966,0.00091243326,0.00082975096,0.0008740966,0.0010536746,0.0017437597],"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.00021983118,0.00021343294,0.00035129863,0.0003353669,0.00007484331,0.0002736043,0.0003545151,0.1315695,0.13120629,0.27997088,0.0041562533,0.45127416],"study_design_scores_gemma":[0.000058838566,0.000277341,0.00018565095,0.000039685594,0.000030729152,0.000852419,0.000019245736,0.85921746,0.09739939,0.030872868,0.010961521,0.000084849635],"about_ca_topic_score_codex":0.00058377796,"about_ca_topic_score_gemma":0.0009543629,"teacher_disagreement_score":0.0029232914,"about_ca_system_score_codex":0.00048694047,"about_ca_system_score_gemma":0.0009637517,"threshold_uncertainty_score":0.009779334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021675143,0.00044232982,0.9661589,0.00028536416,0.0000868229,0.000026821072,0.000047082143,0.00017309845,0.011104364],"genre_scores_gemma":[0.7189198,0.00087943504,0.2744238,0.00016893138,0.00018896248,0.0001380749,0.00011761392,0.000045898614,0.005117559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994949,0.00020020467,0.000011413897,0.000034866152,0.00020860402,0.000049903938],"domain_scores_gemma":[0.9995888,0.00021511533,0.000035488665,0.000069290865,0.0000719632,0.000019366269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618699,0.000293466,0.00055539125,0.0003279818,0.00032983025,0.0007318928,0.00043475008,0.00044184725,0.0012361788],"category_scores_gemma":[0.0010660975,0.00016054092,0.00031776103,0.0005609617,0.00071673456,0.0006005862,0.00065114436,0.00085455197,0.00039899434],"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.00022902561,0.000085573105,0.00035176703,0.00016484378,0.000042431508,0.00023598847,0.000207355,0.32746384,0.0411778,0.52657866,0.004170187,0.09929259],"study_design_scores_gemma":[0.000026537742,0.00006325961,0.00007549201,0.000010217463,0.0000063248417,0.00010151558,0.000024349129,0.93263066,0.00664394,0.05724565,0.0031498398,0.000022233908],"about_ca_topic_score_codex":0.0004910366,"about_ca_topic_score_gemma":0.00050370896,"teacher_disagreement_score":0.0012361788,"about_ca_system_score_codex":0.0004700475,"about_ca_system_score_gemma":0.00047055207,"threshold_uncertainty_score":0.00413543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020088016,0.0010818104,0.99593425,0.00013961135,0.000043951026,0.000013744603,0.000014898639,0.00015956257,0.0006033578],"genre_scores_gemma":[0.31058565,0.008566757,0.6700179,0.00024166425,0.0006399958,0.00040678785,0.00028761083,0.0003007784,0.00895288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994986,0.00016415605,0.000034956975,0.00007390348,0.00019915006,0.000029296747],"domain_scores_gemma":[0.99690884,0.0024102873,0.00024809586,0.00012693668,0.0002708561,0.00003491691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013426782,0.0009946029,0.0007687184,0.000991148,0.00036693414,0.000791084,0.00076554756,0.0010827499,0.0017221826],"category_scores_gemma":[0.007704296,0.0005127594,0.0005211473,0.0012759779,0.00103993,0.0015070732,0.0008012418,0.001584673,0.0006873384],"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.0000662081,0.00003061284,0.00070756726,0.00022398421,0.00007384201,0.00010020442,0.00018131427,0.7296268,0.0047453973,0.12331223,0.0018128428,0.13911898],"study_design_scores_gemma":[0.000007894754,0.000014172133,0.00008350805,0.000013089143,0.0000051086336,0.00002132403,0.000005704171,0.97746253,0.00064220664,0.020571275,0.0011626792,0.000010446369],"about_ca_topic_score_codex":0.002295838,"about_ca_topic_score_gemma":0.0015461184,"teacher_disagreement_score":0.002295838,"about_ca_system_score_codex":0.00081660034,"about_ca_system_score_gemma":0.00074437965,"threshold_uncertainty_score":0.00710088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039904237,0.0006167412,0.94623566,0.0003735281,0.000057369918,0.000039097336,0.00009951677,0.00014112832,0.012532774],"genre_scores_gemma":[0.7885129,0.0010086064,0.2043561,0.0001775843,0.00011742062,0.00013646879,0.00013309231,0.00006102436,0.0054968004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.00021712334,0.000016377337,0.00005300067,0.00025983233,0.00006644445],"domain_scores_gemma":[0.9991289,0.00037319315,0.00013162801,0.00015958937,0.00015750492,0.00004923484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505582,0.0004482951,0.00041815382,0.0004689852,0.0003311779,0.001360025,0.0007972384,0.00091740786,0.0013854785],"category_scores_gemma":[0.0021418852,0.00024853012,0.0003032514,0.0007014879,0.0020960504,0.0016560622,0.0006588092,0.0009512596,0.000461995],"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.00005180968,0.000017946126,0.00010784511,0.00003006635,0.0000044655512,0.000036801473,0.000045076176,0.20494099,0.0032522362,0.781643,0.00042471048,0.00944504],"study_design_scores_gemma":[0.000016764134,0.000045762306,0.000057909918,0.000014758052,0.0000025575116,0.00006572751,0.000021249773,0.6696715,0.0020812151,0.3258496,0.00215444,0.000018588726],"about_ca_topic_score_codex":0.00075953343,"about_ca_topic_score_gemma":0.0005645345,"teacher_disagreement_score":0.0013854785,"about_ca_system_score_codex":0.00093625695,"about_ca_system_score_gemma":0.0006514697,"threshold_uncertainty_score":0.006793022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05437264,0.0020103904,0.92579937,0.0004635156,0.00004585941,0.00003503564,0.00009181776,0.00033235058,0.016848998],"genre_scores_gemma":[0.962174,0.0019075504,0.032883435,0.00014671902,0.0001393582,0.00009829754,0.00008694348,0.00008979383,0.002473881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986299,0.0005810627,0.000041673728,0.00009586141,0.0005189761,0.00013261488],"domain_scores_gemma":[0.99218917,0.0062445183,0.0004863094,0.0003515556,0.00060912984,0.00011924449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028193626,0.0008560976,0.00078655133,0.00091135374,0.00046596932,0.001264849,0.00087026664,0.00072552275,0.0015388136],"category_scores_gemma":[0.01503027,0.000513365,0.00046592805,0.0009839344,0.0014055911,0.001984332,0.0013068527,0.0013321997,0.0002891854],"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.000042165495,0.000028423708,0.00100606,0.00013181714,0.00003899403,0.00027754062,0.00014405155,0.8231108,0.0030830377,0.15747079,0.00078611757,0.013880142],"study_design_scores_gemma":[0.0000020215484,0.000012473518,0.00024798073,0.000011949274,0.000005576274,0.00007258423,0.000015718579,0.9695383,0.00034243675,0.02949048,0.0002512822,0.00000915271],"about_ca_topic_score_codex":0.0017297,"about_ca_topic_score_gemma":0.0014138637,"teacher_disagreement_score":0.0028193626,"about_ca_system_score_codex":0.0017046924,"about_ca_system_score_gemma":0.00085285265,"threshold_uncertainty_score":0.0149104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08366507,0.014200451,0.8217072,0.0062971204,0.0009184292,0.00014437108,0.00054682,0.0023319041,0.07018869],"genre_scores_gemma":[0.90283555,0.0075901933,0.079740226,0.0017613696,0.0010239929,0.00037750413,0.00031488092,0.00078743056,0.0055688717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935516,0.002068109,0.0001635963,0.0009869009,0.0017068094,0.0015230024],"domain_scores_gemma":[0.9586095,0.034475528,0.0017750815,0.0029429062,0.0015277006,0.00066926633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056725647,0.0024863451,0.0015989572,0.002106488,0.0014668237,0.0032300856,0.002650264,0.0020463208,0.0060444362],"category_scores_gemma":[0.045055974,0.0007452158,0.0012008135,0.0025448932,0.003915657,0.0058859773,0.004159059,0.0050198114,0.0014740475],"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.0012792555,0.00023455756,0.0012793007,0.0009638037,0.00020420465,0.00054136483,0.000569923,0.37551576,0.035070613,0.44278988,0.014243951,0.12730749],"study_design_scores_gemma":[0.000086916574,0.00040598583,0.0009556946,0.0003677245,0.00023753491,0.0007765615,0.00016324128,0.59981287,0.026030147,0.35867637,0.0123796845,0.00010726032],"about_ca_topic_score_codex":0.0012622926,"about_ca_topic_score_gemma":0.0008530542,"teacher_disagreement_score":0.0060444362,"about_ca_system_score_codex":0.0037275478,"about_ca_system_score_gemma":0.0017056233,"threshold_uncertainty_score":0.029999733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58914274,0.000714429,0.35808304,0.00073153793,0.00050323916,0.00013165642,0.0004341392,0.0005478156,0.04971144],"genre_scores_gemma":[0.81484395,0.00037810983,0.1513,0.00045670968,0.0001546253,0.00019851897,0.00064310397,0.0001887006,0.031836253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994665,0.000100869336,0.000031094176,0.00009546983,0.00022420239,0.00008187974],"domain_scores_gemma":[0.9985696,0.0003051455,0.00018773132,0.00027416844,0.00044620497,0.00021713861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044504978,0.0003808667,0.0003771896,0.0013413318,0.00074795855,0.00088625617,0.00052878197,0.00077633886,0.0036518986],"category_scores_gemma":[0.0017627403,0.00030943504,0.00036884236,0.0007595989,0.000803273,0.0009926627,0.0013576044,0.0009874898,0.00083671557],"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.00027941854,0.00016814403,0.0014952639,0.0001699728,0.000033890978,0.00034163418,0.0003024374,0.014264165,0.04790012,0.87283176,0.0047834343,0.057429876],"study_design_scores_gemma":[0.00018136961,0.00038307218,0.0025632414,0.00012217187,0.000058604506,0.0021957837,0.00021478035,0.3235004,0.089530915,0.53873444,0.04234443,0.00017084423],"about_ca_topic_score_codex":0.0002993151,"about_ca_topic_score_gemma":0.0005295845,"teacher_disagreement_score":0.0036518986,"about_ca_system_score_codex":0.00066065806,"about_ca_system_score_gemma":0.00074850675,"threshold_uncertainty_score":0.012216806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40745068,0.0058886353,0.57314837,0.0011230954,0.00017224113,0.00018730917,0.00039578375,0.002317108,0.009316743],"genre_scores_gemma":[0.90689534,0.0010017562,0.08987256,0.00020224848,0.00007112181,0.00010685836,0.00036967266,0.00014478632,0.0013356524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995865,0.0010028178,0.00021053404,0.00041770647,0.0021112375,0.00039276318],"domain_scores_gemma":[0.9842977,0.010050458,0.00088722387,0.001751308,0.0027529984,0.0002604153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00267086,0.00077427167,0.00090006023,0.0019666315,0.0006340913,0.0014234452,0.0011136188,0.0015837958,0.0013916343],"category_scores_gemma":[0.021420212,0.0002643555,0.00039983296,0.0020655056,0.0015128944,0.002408519,0.0016313345,0.0011271756,0.00040731387],"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.0013660697,0.00012974201,0.0040955073,0.00031191952,0.00013554226,0.0003276632,0.0003320645,0.6922123,0.038010802,0.063582055,0.0018351873,0.19766112],"study_design_scores_gemma":[0.000021078515,0.00025853325,0.00044351796,0.000030387295,0.000023620487,0.00021169038,0.000041482017,0.9635593,0.022255333,0.012241848,0.00088273926,0.000030504743],"about_ca_topic_score_codex":0.0029759551,"about_ca_topic_score_gemma":0.0023473173,"teacher_disagreement_score":0.0029759551,"about_ca_system_score_codex":0.0018405548,"about_ca_system_score_gemma":0.0024149443,"threshold_uncertainty_score":0.0141249895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12756976,0.0053631566,0.84941566,0.0009902585,0.00020789028,0.00008439071,0.0004635606,0.0009797139,0.014925545],"genre_scores_gemma":[0.8769532,0.0028395224,0.113175906,0.0003259186,0.00019640596,0.00015415449,0.00083374797,0.00047989612,0.0050411886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958165,0.0012588544,0.00028033176,0.00048973603,0.0017905773,0.00036401674],"domain_scores_gemma":[0.94932824,0.042731743,0.0014339766,0.00304183,0.0032187593,0.00024552643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052647167,0.001153159,0.0013340616,0.00084096025,0.00068287796,0.0015838809,0.001687063,0.0012186905,0.003017199],"category_scores_gemma":[0.051513243,0.0006126676,0.00042644097,0.0013269881,0.0016791287,0.0032096393,0.0017803024,0.0015773462,0.0008452249],"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.0010295565,0.000083136314,0.0030089342,0.00029951133,0.0000993917,0.00015348323,0.00013162641,0.84561914,0.015322218,0.032123722,0.0023484624,0.09978084],"study_design_scores_gemma":[0.000017131346,0.00021586592,0.0014346035,0.000051381518,0.000031234682,0.00042036618,0.00004679947,0.9580639,0.026338037,0.011783105,0.0015599466,0.000037652084],"about_ca_topic_score_codex":0.001966537,"about_ca_topic_score_gemma":0.0014269983,"teacher_disagreement_score":0.0052647167,"about_ca_system_score_codex":0.0027085505,"about_ca_system_score_gemma":0.00082668645,"threshold_uncertainty_score":0.02784282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12400089,0.0007277476,0.8559036,0.0013846515,0.00022970834,0.00013343489,0.00027003762,0.0010094077,0.016340509],"genre_scores_gemma":[0.9543598,0.00066137995,0.038583472,0.00017274728,0.0002021343,0.00013834103,0.00012913348,0.000038226935,0.005714745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.0006633117,0.000064276486,0.00023529552,0.0004883217,0.0002938752],"domain_scores_gemma":[0.9936054,0.0042210566,0.00058187556,0.00089985755,0.00047075682,0.0002210601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809451,0.0004347343,0.000561642,0.0006124361,0.0008490717,0.0013602375,0.000875499,0.00095826125,0.003046188],"category_scores_gemma":[0.0056696045,0.00021570126,0.00031194714,0.0010588488,0.0011341895,0.002763929,0.0012609042,0.0011444902,0.0005192153],"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.00056281267,0.00010890709,0.0005726221,0.00025948163,0.00003091577,0.00045867712,0.00033207485,0.2103698,0.013745907,0.7226115,0.0039976365,0.0469497],"study_design_scores_gemma":[0.00006535882,0.00013584366,0.00018139978,0.000040887087,0.000011545431,0.0002176615,0.000066257264,0.72415626,0.008346695,0.26014787,0.0065814676,0.000048813505],"about_ca_topic_score_codex":0.0011837527,"about_ca_topic_score_gemma":0.0008550688,"teacher_disagreement_score":0.003046188,"about_ca_system_score_codex":0.0010085434,"about_ca_system_score_gemma":0.00090205384,"threshold_uncertainty_score":0.010190487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2333541,0.0014734134,0.746804,0.00090122427,0.000050119677,0.00007562601,0.00023227168,0.00020727584,0.016901946],"genre_scores_gemma":[0.9711051,0.0010352379,0.023702595,0.00010302822,0.00004472357,0.000082134844,0.00015600253,0.0000651119,0.003705993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995939,0.00013310596,0.000011132566,0.000030631683,0.00016948486,0.000061858176],"domain_scores_gemma":[0.9968214,0.0023374332,0.00023556771,0.00012550785,0.00042306056,0.000057094985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096579915,0.000626079,0.00053762906,0.0012951752,0.00050684606,0.00093734276,0.0007493186,0.00087956723,0.0013653934],"category_scores_gemma":[0.0066859755,0.00031114934,0.00048617684,0.00077430526,0.0015310519,0.0011280623,0.00070221897,0.00097228406,0.0002513473],"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.00005889255,0.000017467044,0.00089264166,0.000075816526,0.000021439391,0.00019962977,0.00015095541,0.7547358,0.0042770375,0.23356654,0.00056751847,0.0054362714],"study_design_scores_gemma":[0.0000024317817,0.0000071515014,0.0001568759,0.000009499369,0.0000034303982,0.00003370447,0.000010354669,0.96445537,0.00091275125,0.034205202,0.00019410702,0.000009152128],"about_ca_topic_score_codex":0.0045565916,"about_ca_topic_score_gemma":0.0025682417,"teacher_disagreement_score":0.0045565916,"about_ca_system_score_codex":0.001605391,"about_ca_system_score_gemma":0.0013497479,"threshold_uncertainty_score":0.011647999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33203566,0.00045806574,0.64719975,0.00074596115,0.000048709207,0.000101766265,0.00011862107,0.00037818978,0.018913234],"genre_scores_gemma":[0.92545223,0.0004321377,0.07010528,0.00010595445,0.000094065625,0.00009754403,0.00014190677,0.00006183292,0.0035090726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992643,0.00016137266,0.000046797864,0.00009923959,0.0003065459,0.00012173998],"domain_scores_gemma":[0.99800414,0.0011521602,0.00022870216,0.00034825987,0.00017930029,0.00008754262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783768,0.0004325665,0.00038204127,0.0011314594,0.00064069545,0.001309413,0.00055406673,0.0005843689,0.0019007437],"category_scores_gemma":[0.003748247,0.00025354672,0.00086336385,0.0006509883,0.0024555053,0.0019796574,0.0016166022,0.0015650041,0.000427491],"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.00011072488,0.00006068531,0.0020730298,0.00012086199,0.00002233923,0.00014024808,0.00029676623,0.020935249,0.021865215,0.92124444,0.00069490937,0.032435477],"study_design_scores_gemma":[0.00003283626,0.00026030708,0.002259564,0.00005153149,0.0000762995,0.0012086814,0.00012590292,0.28299674,0.06348609,0.6390426,0.010400354,0.00005900209],"about_ca_topic_score_codex":0.00013109954,"about_ca_topic_score_gemma":0.00010974881,"teacher_disagreement_score":0.0019007437,"about_ca_system_score_codex":0.0008465948,"about_ca_system_score_gemma":0.00035444126,"threshold_uncertainty_score":0.006358564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07910744,0.0011279493,0.9019031,0.0005737071,0.00007618229,0.00005075038,0.0002540301,0.00019844863,0.01670836],"genre_scores_gemma":[0.880141,0.0007564216,0.112971544,0.00025856396,0.000085686945,0.000086973596,0.00023954708,0.0000377744,0.0054224166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.00012586484,0.000030445524,0.000079961384,0.00033036724,0.00009973577],"domain_scores_gemma":[0.9985688,0.0006216118,0.00021164225,0.00015661177,0.00037605021,0.00006528295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004934848,0.00052600104,0.0003484599,0.0005534856,0.00035176307,0.0010639749,0.000434749,0.0007399409,0.0019760148],"category_scores_gemma":[0.0030331193,0.00015443345,0.0001656185,0.0005628657,0.0006704208,0.0010082576,0.0011458669,0.0005195653,0.000486976],"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.00034375276,0.000058256486,0.0016710337,0.00028655518,0.000044746484,0.0004497861,0.0004161595,0.2613824,0.036459282,0.5153798,0.0037928254,0.17971544],"study_design_scores_gemma":[0.00002788974,0.0001571614,0.00082951627,0.000076855125,0.000013861042,0.00046310428,0.00011218919,0.84036255,0.01807421,0.13134044,0.008482755,0.00005946413],"about_ca_topic_score_codex":0.0007789162,"about_ca_topic_score_gemma":0.0013866216,"teacher_disagreement_score":0.0019760148,"about_ca_system_score_codex":0.0007195512,"about_ca_system_score_gemma":0.001157628,"threshold_uncertainty_score":0.0066103935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87709254,0.00041224522,0.11043489,0.00017808637,0.000016013306,0.00002741643,0.00007718347,0.00026948928,0.01149213],"genre_scores_gemma":[0.983108,0.000081670325,0.01589737,0.000015112838,0.00000508711,0.000020296324,0.00006503842,0.000024770814,0.0007827344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967825,0.00010103331,0.000008757101,0.00003687985,0.00013584629,0.000039278504],"domain_scores_gemma":[0.9949785,0.0035899226,0.00046517653,0.00023337448,0.00056039763,0.00017252585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009016667,0.00021340803,0.0002083373,0.0007983236,0.0003463556,0.00052213226,0.00022176161,0.00035119912,0.0016269402],"category_scores_gemma":[0.007538413,0.00014333488,0.00022056093,0.000518236,0.0007297992,0.00080753164,0.0003277561,0.00033691636,0.00020717847],"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.0006924633,0.00010087117,0.021105636,0.0002684892,0.00006278681,0.0009316659,0.0006525107,0.69980526,0.07463584,0.13114674,0.0014105197,0.06918722],"study_design_scores_gemma":[0.000009644131,0.00015560268,0.0028009792,0.000016173446,0.000008883098,0.00041182997,0.00011124983,0.97066057,0.013076165,0.011867254,0.00086037297,0.000021179498],"about_ca_topic_score_codex":0.0004333009,"about_ca_topic_score_gemma":0.00037517404,"teacher_disagreement_score":0.0016269402,"about_ca_system_score_codex":0.00066784513,"about_ca_system_score_gemma":0.00033278062,"threshold_uncertainty_score":0.005442679},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5611381,0.003210253,0.343878,0.0024411897,0.00044876378,0.00014092014,0.0005875967,0.00031390516,0.087841295],"genre_scores_gemma":[0.93675035,0.0011195742,0.055139795,0.00022549223,0.00032443472,0.0001814769,0.00031040862,0.00007965798,0.005868832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993892,0.0002028167,0.000033609944,0.00010725601,0.00017355329,0.000093582836],"domain_scores_gemma":[0.9981944,0.0009305808,0.00030461774,0.00018200507,0.00021236906,0.00017595674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584301,0.00046812385,0.0007964434,0.0016362406,0.001402481,0.0014670052,0.00044008935,0.0008714973,0.0032754927],"category_scores_gemma":[0.0055878577,0.00027749073,0.00047156593,0.001885671,0.0016584694,0.0017383496,0.0014835177,0.0016091081,0.00057980424],"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.00005279989,0.000018316303,0.00046935992,0.000048520433,0.00000650703,0.00008236022,0.00015433179,0.007969973,0.0017826551,0.9765459,0.0013787738,0.011490609],"study_design_scores_gemma":[0.000024296909,0.00005368163,0.00035015104,0.000032567503,0.0000068181007,0.00028404515,0.00012830811,0.035645932,0.0028265743,0.95421195,0.006405316,0.00003036074],"about_ca_topic_score_codex":0.00032114986,"about_ca_topic_score_gemma":0.00031406136,"teacher_disagreement_score":0.0032754927,"about_ca_system_score_codex":0.0008239355,"about_ca_system_score_gemma":0.00047066173,"threshold_uncertainty_score":0.010957599},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056506783,0.00075368385,0.9317638,0.00057082804,0.000057244008,0.000032521293,0.000079733385,0.00025547287,0.009979952],"genre_scores_gemma":[0.9334094,0.0008632537,0.062060717,0.00008086292,0.0000811918,0.000100514,0.00007879817,0.00004348031,0.0032817328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899715,0.00040561485,0.00003467646,0.000118181,0.0002946791,0.0001498234],"domain_scores_gemma":[0.99540675,0.0028039285,0.0006333471,0.0006602042,0.00041501227,0.00008088369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127671,0.0005848006,0.0006254361,0.000758532,0.000427133,0.0009805574,0.00092336186,0.0008822271,0.0005677073],"category_scores_gemma":[0.006399317,0.00028852062,0.0003068899,0.0007648315,0.0017598631,0.001728092,0.001426743,0.0010451777,0.00025492354],"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.000087503584,0.000014425299,0.0001882082,0.000061761115,0.000018278099,0.00020101489,0.00013073056,0.73814833,0.008069612,0.23684153,0.00088862877,0.015349868],"study_design_scores_gemma":[0.0000065422587,0.00002196855,0.00004963946,0.000009806335,0.000005409868,0.000047972884,0.000014148985,0.9393067,0.0016433338,0.058052376,0.0008332424,0.000008882015],"about_ca_topic_score_codex":0.0017743895,"about_ca_topic_score_gemma":0.001137715,"teacher_disagreement_score":0.0017743895,"about_ca_system_score_codex":0.001076047,"about_ca_system_score_gemma":0.00084906036,"threshold_uncertainty_score":0.008529246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068294704,0.002107666,0.9166005,0.0013798731,0.00009708356,0.000030849485,0.00009407624,0.00020037162,0.011194809],"genre_scores_gemma":[0.8813445,0.0030084408,0.103787825,0.00055369164,0.0005710874,0.00023078287,0.00030175148,0.00032314818,0.009878669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981573,0.0006478859,0.000081164,0.0003064447,0.0005859243,0.00022132797],"domain_scores_gemma":[0.9854697,0.0103363665,0.0012784133,0.000995352,0.0013676137,0.0005524855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068148505,0.0015488083,0.0013629807,0.0023818018,0.00086515717,0.0018883401,0.0013851019,0.0016632979,0.0034167268],"category_scores_gemma":[0.02650803,0.0004561059,0.0011770211,0.0010359476,0.004423974,0.0055459393,0.004075424,0.0038575984,0.00050684944],"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.00009272753,0.00004324759,0.0006972429,0.00015566526,0.00005307479,0.0001356868,0.00023820726,0.07460361,0.0035211165,0.90674245,0.0006996485,0.013017346],"study_design_scores_gemma":[0.000008383733,0.00005378276,0.0004517952,0.000051203227,0.000015399999,0.00007562996,0.000051226965,0.3356002,0.0015794291,0.66101474,0.0010735376,0.000024707002],"about_ca_topic_score_codex":0.0006278522,"about_ca_topic_score_gemma":0.00043566673,"teacher_disagreement_score":0.0068148505,"about_ca_system_score_codex":0.0018496404,"about_ca_system_score_gemma":0.001069326,"threshold_uncertainty_score":0.036040843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045508057,0.0087949885,0.9040223,0.0011108062,0.00013471188,0.00010353274,0.00058126054,0.00056400924,0.039180335],"genre_scores_gemma":[0.911864,0.008828791,0.067680545,0.00055450515,0.0003846034,0.00031163605,0.0008785058,0.00029161113,0.009205841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971802,0.000795471,0.00007637177,0.00020770295,0.0011946076,0.0005457815],"domain_scores_gemma":[0.98940444,0.007064651,0.0007612467,0.00068160024,0.0019249929,0.00016313171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026371828,0.0019445627,0.001122121,0.0012409869,0.00082410907,0.0020732097,0.0007800634,0.0008975989,0.0049637123],"category_scores_gemma":[0.013505403,0.0005090779,0.0005139244,0.0020167949,0.0014234633,0.0024466969,0.0016967156,0.001594675,0.001669925],"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.00021507851,0.000047915186,0.0009122248,0.0002732885,0.00007874185,0.00013107063,0.00023495466,0.7518475,0.008969249,0.18776263,0.004026261,0.045501057],"study_design_scores_gemma":[0.00001522626,0.0001114239,0.00067870854,0.00010981984,0.000032291562,0.00019948639,0.000055162935,0.9180599,0.0049046306,0.071309954,0.0044812523,0.000042034],"about_ca_topic_score_codex":0.003587645,"about_ca_topic_score_gemma":0.0030047898,"teacher_disagreement_score":0.0049637123,"about_ca_system_score_codex":0.002844462,"about_ca_system_score_gemma":0.001870221,"threshold_uncertainty_score":0.020638168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050589982,0.00035208726,0.8995603,0.00050892687,0.00020091001,0.00023056248,0.00034353483,0.0009608108,0.047252875],"genre_scores_gemma":[0.59482765,0.00062597875,0.37512285,0.00043213074,0.00026606352,0.0003401911,0.00090157444,0.00034808053,0.027135609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988279,0.00023253889,0.000063507876,0.00021347619,0.00043692326,0.0002257652],"domain_scores_gemma":[0.99873227,0.00027239512,0.00014080941,0.00045063093,0.00029656742,0.00010731275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053559494,0.0005960095,0.00058584445,0.0008499225,0.00079746137,0.0013014928,0.001008826,0.00078122906,0.008022051],"category_scores_gemma":[0.0023599202,0.00027771623,0.00086988905,0.000772295,0.001364026,0.0016959695,0.0024389985,0.0015740388,0.0033181724],"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.00013929314,0.000048888334,0.00044000006,0.00008335655,0.000018676037,0.00025731706,0.00025925887,0.018304829,0.01158365,0.88555074,0.003546255,0.07976775],"study_design_scores_gemma":[0.00012767255,0.00040346564,0.0003841451,0.000070319664,0.000031977186,0.0010483812,0.00015964931,0.14283055,0.034745656,0.77260673,0.047491405,0.00009993972],"about_ca_topic_score_codex":0.00043748663,"about_ca_topic_score_gemma":0.00048710828,"teacher_disagreement_score":0.008022051,"about_ca_system_score_codex":0.0005050941,"about_ca_system_score_gemma":0.000995404,"threshold_uncertainty_score":0.026836395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21054792,0.00080800726,0.7808064,0.00042717773,0.00007976503,0.00009848239,0.00016484645,0.00016392652,0.006903457],"genre_scores_gemma":[0.96308357,0.0006397522,0.029696492,0.000062732,0.000050402774,0.00004785483,0.0000748618,0.000022046152,0.0063222265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911755,0.00034812928,0.00002249085,0.00015434499,0.00016312265,0.00019425462],"domain_scores_gemma":[0.99728,0.0019041662,0.00028486364,0.0001599944,0.00028253038,0.000088316345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012969138,0.0004882856,0.00077353674,0.000333534,0.00054201623,0.00095453893,0.0007734236,0.00088281615,0.0014228881],"category_scores_gemma":[0.0027256864,0.00034859363,0.0004010312,0.00054671144,0.0009876014,0.0013420008,0.0007207254,0.000500812,0.00029088763],"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.0003584611,0.000052803072,0.0006334173,0.00012236474,0.00004367004,0.00043859426,0.00019158919,0.90320486,0.0067659584,0.06992696,0.001142391,0.017118936],"study_design_scores_gemma":[0.000025792797,0.00005575874,0.00017326567,0.000003953986,0.000013727758,0.000086387096,0.000045811983,0.98735875,0.0014559831,0.010288586,0.00047817535,0.00001370352],"about_ca_topic_score_codex":0.004191596,"about_ca_topic_score_gemma":0.0034059032,"teacher_disagreement_score":0.004191596,"about_ca_system_score_codex":0.0013741566,"about_ca_system_score_gemma":0.0014976235,"threshold_uncertainty_score":0.009970248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052454382,0.00077101804,0.87809974,0.004102959,0.0005625363,0.00023945142,0.0011714644,0.004828823,0.057769664],"genre_scores_gemma":[0.87355274,0.0003694488,0.087830745,0.00084472157,0.00035398995,0.00034855705,0.0011235892,0.0008533098,0.034722928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867905,0.0029160064,0.0007223627,0.0024123369,0.003842897,0.0033159517],"domain_scores_gemma":[0.9550464,0.023208002,0.0018702277,0.013115842,0.0053773737,0.0013821035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055014156,0.0020340919,0.0021771395,0.0013526917,0.0041005076,0.00553732,0.004453252,0.0040250025,0.029775368],"category_scores_gemma":[0.03453516,0.0008614944,0.0011983983,0.001931302,0.0032713497,0.0076508424,0.010163799,0.00378576,0.0063452106],"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.0031430768,0.00026811866,0.0046906173,0.0006415812,0.00024369576,0.002547223,0.0011417478,0.38497695,0.006826237,0.4260625,0.052031297,0.11742695],"study_design_scores_gemma":[0.000098620054,0.00011100625,0.00031389834,0.00005855881,0.000052929918,0.00067898614,0.00021519349,0.7072332,0.0045617875,0.27695766,0.0096540535,0.00006407569],"about_ca_topic_score_codex":0.0035888522,"about_ca_topic_score_gemma":0.004176023,"teacher_disagreement_score":0.029775368,"about_ca_system_score_codex":0.0028504462,"about_ca_system_score_gemma":0.0040590465,"threshold_uncertainty_score":0.0996086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15527318,0.00034799823,0.82411104,0.0012652851,0.000089514244,0.000077728175,0.000249587,0.0004653605,0.018120265],"genre_scores_gemma":[0.86509335,0.0003125927,0.12904906,0.00018398295,0.000070643684,0.00010718057,0.00016977242,0.00012560854,0.004887849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863356,0.00042287662,0.0000974559,0.00018488624,0.00040179078,0.0002593929],"domain_scores_gemma":[0.99734324,0.0011771466,0.00039536788,0.0006738544,0.00027332816,0.000137071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013055576,0.0007345473,0.00080136623,0.00071807805,0.0006825861,0.0017043962,0.0010959483,0.0010145932,0.0018432699],"category_scores_gemma":[0.0061509307,0.00044324447,0.0004562163,0.0014519452,0.002260871,0.0038946522,0.0023500612,0.0015028141,0.0004228669],"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.00021219118,0.00005280063,0.00021964897,0.00004974476,0.000010344514,0.00008636701,0.00014053256,0.062322717,0.005240523,0.90574384,0.0015086811,0.024412677],"study_design_scores_gemma":[0.00004730218,0.00007453369,0.00011795669,0.000025572108,0.000014211497,0.00013742417,0.000051211056,0.45800617,0.010093163,0.5289698,0.0024214133,0.000041308955],"about_ca_topic_score_codex":0.00079366216,"about_ca_topic_score_gemma":0.00071108766,"teacher_disagreement_score":0.0018432699,"about_ca_system_score_codex":0.0015543204,"about_ca_system_score_gemma":0.0013793927,"threshold_uncertainty_score":0.011277497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075919656,0.00010777035,0.9888094,0.000046768968,0.000028436507,0.00006470123,0.000032960572,0.00023930657,0.0030787145],"genre_scores_gemma":[0.11699838,0.00017960032,0.8801908,0.000083476676,0.000020938163,0.00021292806,0.00022904489,0.00018546445,0.0018993896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857557,0.00035090803,0.00009039979,0.00018493195,0.00065983896,0.00013843513],"domain_scores_gemma":[0.997056,0.0016153399,0.00013519735,0.00054106896,0.00053848326,0.00011399925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012142123,0.0007843254,0.0011815795,0.0019294645,0.0009433585,0.0012914392,0.0019442156,0.00078828237,0.0049755513],"category_scores_gemma":[0.00805465,0.0006592561,0.0009487157,0.001674141,0.0007287553,0.0017840271,0.0022630084,0.001958066,0.0014396666],"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.00029014784,0.00021630098,0.0012161386,0.00039828027,0.00008208794,0.0002547262,0.00043284253,0.51582193,0.033406764,0.119928695,0.005570055,0.322382],"study_design_scores_gemma":[0.00003375576,0.00011965118,0.0002368524,0.00003225713,0.000011657116,0.00010986178,0.000041741838,0.94060963,0.008773233,0.043002754,0.006995618,0.00003301094],"about_ca_topic_score_codex":0.0026170188,"about_ca_topic_score_gemma":0.003860867,"teacher_disagreement_score":0.0049755513,"about_ca_system_score_codex":0.000996847,"about_ca_system_score_gemma":0.00081806217,"threshold_uncertainty_score":0.016644895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016685987,0.000119377895,0.9976701,0.000030404704,0.000009631117,0.000013219115,0.0000134733355,0.0001310522,0.00034414508],"genre_scores_gemma":[0.18409112,0.00029409,0.8135104,0.00006537961,0.000027937731,0.00010185795,0.00010911601,0.00007934832,0.0017207393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.00021378919,0.000051593943,0.00012026766,0.00032080614,0.000048216487],"domain_scores_gemma":[0.9992418,0.00036982365,0.000060142418,0.00012271275,0.0001883873,0.000017057844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016921213,0.0006899544,0.00094020093,0.00046690748,0.00036537676,0.00090694585,0.00080243184,0.0006971838,0.0026910054],"category_scores_gemma":[0.0032639618,0.00046258484,0.00041202834,0.00063840544,0.00053282647,0.0014895415,0.0010458595,0.0012303196,0.00069146906],"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.00025013674,0.000053604625,0.00035499406,0.00025566656,0.000042031883,0.000093341936,0.00016305894,0.4909599,0.025187012,0.10622743,0.003183192,0.3732296],"study_design_scores_gemma":[0.000018581683,0.00004232833,0.000053706946,0.00001015289,0.000005096695,0.000042298227,0.000010745528,0.97870946,0.009030259,0.010422769,0.0016442101,0.000010431483],"about_ca_topic_score_codex":0.0010990744,"about_ca_topic_score_gemma":0.0017301226,"teacher_disagreement_score":0.0026910054,"about_ca_system_score_codex":0.0007035982,"about_ca_system_score_gemma":0.0010102422,"threshold_uncertainty_score":0.009002268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59519154,0.003719941,0.32219812,0.004056732,0.0004788273,0.0001178087,0.0005409662,0.00081702165,0.07287907],"genre_scores_gemma":[0.88396287,0.0008952636,0.10388251,0.00040253453,0.00017861441,0.00012436375,0.00040627283,0.00014803957,0.009999477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.0002087586,0.00005816981,0.00010699352,0.00025248667,0.00013064402],"domain_scores_gemma":[0.9944938,0.0034223136,0.0005301844,0.0006154148,0.0006583845,0.0002798932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015629051,0.0003867972,0.0005412669,0.001039723,0.0010711735,0.001033527,0.00045567783,0.0012245505,0.0066555864],"category_scores_gemma":[0.011294174,0.0002247517,0.00038163157,0.00088838924,0.0011466236,0.0022563664,0.0008034793,0.0015417088,0.0020692674],"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.0011192078,0.00012230988,0.003527976,0.00038274258,0.0000335677,0.000556338,0.00044266268,0.019756159,0.07666548,0.728747,0.004948664,0.16369791],"study_design_scores_gemma":[0.00015106474,0.00085882354,0.0036905305,0.00034182644,0.00005425939,0.0040467507,0.0002740939,0.12756222,0.08730537,0.7167318,0.058866046,0.00011717301],"about_ca_topic_score_codex":0.00026651676,"about_ca_topic_score_gemma":0.00041331115,"teacher_disagreement_score":0.0066555864,"about_ca_system_score_codex":0.00092141255,"about_ca_system_score_gemma":0.00088840537,"threshold_uncertainty_score":0.022265136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01615017,0.0014157651,0.97527844,0.00029862646,0.000109648245,0.00004177346,0.00011756116,0.00019840745,0.0063895932],"genre_scores_gemma":[0.66348046,0.0035807956,0.32455114,0.0005408617,0.0004535343,0.00043868995,0.00036410653,0.00024183744,0.006348589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461937,0.0019387429,0.00026776668,0.00073089,0.0017991987,0.00064406253],"domain_scores_gemma":[0.96725446,0.026259784,0.0019268087,0.0019383755,0.002312448,0.00030813826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006880522,0.0026685682,0.0012017506,0.0021469072,0.0011152268,0.0018773315,0.0021897336,0.0014782351,0.0043151407],"category_scores_gemma":[0.048673924,0.00054411526,0.0008322281,0.0024687767,0.0039150803,0.0044614,0.0029567443,0.0022234938,0.0010500031],"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.0002889458,0.000060152797,0.00252976,0.00028348604,0.00006861415,0.00025184845,0.00027359513,0.56090456,0.006922577,0.3671416,0.0016712154,0.05960366],"study_design_scores_gemma":[0.000016862967,0.00015777613,0.00078971137,0.00010627295,0.00003174805,0.00024158781,0.000055492063,0.7754333,0.00721073,0.2135658,0.0023438395,0.00004687223],"about_ca_topic_score_codex":0.0012179653,"about_ca_topic_score_gemma":0.0013532134,"teacher_disagreement_score":0.006880522,"about_ca_system_score_codex":0.0026684592,"about_ca_system_score_gemma":0.0015105149,"threshold_uncertainty_score":0.0363881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056969553,0.0010268248,0.92905575,0.001281197,0.00014176623,0.00014392102,0.00021577923,0.00039359383,0.010771623],"genre_scores_gemma":[0.94312996,0.0005552388,0.048987214,0.00027410244,0.00014027928,0.00028443272,0.0001421222,0.000075075484,0.0064114965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959045,0.0021303985,0.00010505712,0.00060770457,0.00058891287,0.00066344475],"domain_scores_gemma":[0.98945284,0.007885013,0.0009720307,0.00068047876,0.0006493805,0.00036032012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037441505,0.0010079176,0.0016674863,0.0007415677,0.0010210974,0.0018968777,0.0019850195,0.0017501776,0.003517873],"category_scores_gemma":[0.013483718,0.00078152545,0.00053253706,0.0011112638,0.002409267,0.0031186887,0.001851364,0.0012527162,0.0005326914],"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.00019379822,0.000051027408,0.0004325068,0.00010526722,0.000042201744,0.0002008247,0.000058917427,0.8763616,0.00080852007,0.11357646,0.0015708804,0.0065979417],"study_design_scores_gemma":[0.00004134474,0.000022079861,0.000081330014,0.000006734825,0.000007013496,0.000026447868,0.000017831348,0.9662842,0.00014015038,0.032802243,0.0005615982,0.000008891351],"about_ca_topic_score_codex":0.0031824412,"about_ca_topic_score_gemma":0.0029334591,"teacher_disagreement_score":0.0037441505,"about_ca_system_score_codex":0.0027537122,"about_ca_system_score_gemma":0.002089309,"threshold_uncertainty_score":0.019979715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042069044,0.0067097554,0.94221836,0.00040378515,0.00016325407,0.000055233064,0.0001861531,0.00026572138,0.007928622],"genre_scores_gemma":[0.85264224,0.0058304784,0.13070881,0.00018557551,0.00027827037,0.00018399776,0.0002877368,0.000041100968,0.0098417755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992873,0.0002979516,0.000034822657,0.00013034912,0.00015920997,0.000090358175],"domain_scores_gemma":[0.9989454,0.00059140153,0.00018573125,0.00011036045,0.0001277305,0.000039326296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062352646,0.0010699879,0.0010815396,0.0006244587,0.00073634856,0.0009937921,0.001456889,0.0011187093,0.0009907306],"category_scores_gemma":[0.0016930543,0.00043723086,0.00035557078,0.0012712514,0.0008373441,0.0018225758,0.0010936507,0.00077283167,0.00048059813],"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.00057524507,0.0001481624,0.0016273232,0.00094253453,0.00016128326,0.002453905,0.0006131943,0.5120664,0.036920067,0.28752598,0.007307509,0.14965837],"study_design_scores_gemma":[0.000035795816,0.00027436405,0.0003633749,0.000037257134,0.000062272025,0.0014023794,0.00011461512,0.9026462,0.005871194,0.0767988,0.012348649,0.000045090288],"about_ca_topic_score_codex":0.0004643332,"about_ca_topic_score_gemma":0.0011750987,"teacher_disagreement_score":0.001456889,"about_ca_system_score_codex":0.00059862423,"about_ca_system_score_gemma":0.00026135173,"threshold_uncertainty_score":0.004343331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015335882,0.0005520598,0.98009163,0.00023407274,0.000074592004,0.00003393397,0.0000920349,0.00012139319,0.0034643824],"genre_scores_gemma":[0.5837374,0.00336988,0.40022394,0.0005520421,0.0009874674,0.0003383992,0.00091633067,0.000366299,0.009508293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972536,0.0008404081,0.00013696944,0.00045931988,0.0010662396,0.0002435293],"domain_scores_gemma":[0.9930957,0.0039436286,0.00057010975,0.00077945576,0.0013154126,0.00029569204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00315535,0.0009724879,0.0011217843,0.0017533922,0.0007698111,0.0013730943,0.0009563627,0.0011923101,0.0039666123],"category_scores_gemma":[0.016406188,0.0004874948,0.00086294935,0.0017712835,0.0027982513,0.0035617559,0.0025668864,0.0020869332,0.000967733],"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.00024930862,0.00003735639,0.00086764357,0.0002240723,0.0000422949,0.0003698136,0.00024426653,0.055241045,0.016539367,0.86802477,0.0024111625,0.055748828],"study_design_scores_gemma":[0.000032005155,0.00015942958,0.00075469457,0.00004793783,0.000026719948,0.0003745172,0.00009646424,0.5256177,0.010838454,0.45508355,0.006916613,0.00005183172],"about_ca_topic_score_codex":0.0013310658,"about_ca_topic_score_gemma":0.00073491625,"teacher_disagreement_score":0.0039666123,"about_ca_system_score_codex":0.0010417809,"about_ca_system_score_gemma":0.0009116595,"threshold_uncertainty_score":0.016687274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08258998,0.0075829676,0.8894694,0.0009851909,0.00012463576,0.00009742792,0.0006455903,0.0006873915,0.017817382],"genre_scores_gemma":[0.96314967,0.0034153583,0.029340763,0.00023053472,0.00020281658,0.00028046643,0.00034629545,0.00014257904,0.002891585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746203,0.00067428115,0.00011582175,0.0003161148,0.0010348649,0.00039683274],"domain_scores_gemma":[0.9767323,0.01624197,0.0025354407,0.0020011896,0.0021666887,0.00032244166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035500405,0.00096047815,0.0013041445,0.0016263531,0.0007957113,0.0017885196,0.002045323,0.0014581708,0.002179573],"category_scores_gemma":[0.030100698,0.0005440107,0.0005676232,0.002655838,0.0030555497,0.003302074,0.0019451615,0.0015772292,0.00057583157],"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.00013425185,0.000049691575,0.0020570506,0.0002941977,0.000056190933,0.00043038177,0.0006206464,0.7256588,0.0064140554,0.24095918,0.0018672678,0.021458313],"study_design_scores_gemma":[0.000016750859,0.00005774697,0.0012179023,0.00012423046,0.000029969164,0.0006977492,0.00011920517,0.88597107,0.0033337995,0.1052846,0.0030793303,0.00006760892],"about_ca_topic_score_codex":0.003377378,"about_ca_topic_score_gemma":0.0013904347,"teacher_disagreement_score":0.0035500405,"about_ca_system_score_codex":0.0028093518,"about_ca_system_score_gemma":0.001522776,"threshold_uncertainty_score":0.020383298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015124421,0.0007959091,0.9806301,0.00016264834,0.000043400632,0.000057688845,0.00005376761,0.00017253071,0.0029595082],"genre_scores_gemma":[0.7064702,0.001885136,0.287476,0.00014809017,0.0001292305,0.00016442471,0.00016086876,0.000042808075,0.003523312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986456,0.00059617485,0.00003779183,0.000088673754,0.0004997155,0.00013203017],"domain_scores_gemma":[0.9988763,0.0005943175,0.00011760784,0.00011061054,0.00025947546,0.000041723422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013451363,0.00091310684,0.000752797,0.0004107894,0.0003086201,0.00088622404,0.00054082985,0.00080582255,0.0015942574],"category_scores_gemma":[0.0020620937,0.00031866148,0.00041454405,0.0006920333,0.00091133296,0.00067295355,0.0006954263,0.00082634616,0.0005380751],"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.00031418746,0.000086327345,0.00060635625,0.00041691368,0.00007886579,0.0003173393,0.00028852877,0.7195443,0.050424065,0.14229517,0.0024464757,0.0831814],"study_design_scores_gemma":[0.0000100926,0.000086553984,0.00010528292,0.000012730969,0.0000082174265,0.00007656114,0.000014350662,0.992623,0.0023978513,0.0040389895,0.00061268744,0.000013676414],"about_ca_topic_score_codex":0.0017731882,"about_ca_topic_score_gemma":0.0017093136,"teacher_disagreement_score":0.0017731882,"about_ca_system_score_codex":0.00070811424,"about_ca_system_score_gemma":0.0008538927,"threshold_uncertainty_score":0.007113874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01726733,0.0010791675,0.9739575,0.00042865792,0.000069606845,0.0000420888,0.000069841706,0.0001470626,0.006938734],"genre_scores_gemma":[0.81881344,0.0031813579,0.17236242,0.00025734594,0.00018268652,0.00025036122,0.0001937655,0.000055657663,0.004702982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937767,0.00022329185,0.00002580702,0.00006901484,0.00023921976,0.000065020315],"domain_scores_gemma":[0.9985195,0.0009789722,0.00010032422,0.00015394326,0.00021056604,0.000036700276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013140811,0.00045674,0.0005106632,0.00064584584,0.00058486284,0.0011587843,0.0006676434,0.0007367132,0.0014119201],"category_scores_gemma":[0.0043186415,0.00023511832,0.00032005223,0.00066423835,0.00081247225,0.0020406262,0.0009840549,0.00076641986,0.00033739253],"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.000077286044,0.000026245121,0.00029286326,0.00017246041,0.000019610177,0.00030805526,0.00026027596,0.20462851,0.0062046917,0.71362746,0.0031264024,0.07125612],"study_design_scores_gemma":[0.000015338115,0.00005639406,0.00007558532,0.000026484251,0.000014290439,0.00018961017,0.000035378856,0.7180647,0.0019133547,0.27325475,0.006335185,0.000018897177],"about_ca_topic_score_codex":0.0008881967,"about_ca_topic_score_gemma":0.0007257972,"teacher_disagreement_score":0.0014119201,"about_ca_system_score_codex":0.0010236221,"about_ca_system_score_gemma":0.00082608877,"threshold_uncertainty_score":0.0074269176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045882173,0.00022457333,0.9503614,0.00015700397,0.000009562683,0.0000326605,0.00011378435,0.00013188345,0.0030871034],"genre_scores_gemma":[0.8978233,0.00067783496,0.09673157,0.000059067173,0.000022159085,0.00009791426,0.00011537493,0.000048347163,0.0044244565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992956,0.0002648959,0.00003556735,0.00012696155,0.00017546427,0.000101454614],"domain_scores_gemma":[0.9986933,0.00094899634,0.00013406792,0.000070249276,0.00012265265,0.000030865096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888557,0.00061688427,0.0007719907,0.00030562968,0.00023902344,0.0010364895,0.0005282827,0.0006776542,0.0008953519],"category_scores_gemma":[0.003995017,0.0004919169,0.00031344994,0.0006469856,0.0011786603,0.0010658711,0.0007195107,0.00057968433,0.00024924154],"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.00006539634,0.000024396913,0.00025560422,0.000061270286,0.000016442713,0.00008100005,0.00006087075,0.93961096,0.0034118365,0.040570676,0.00032704062,0.015514495],"study_design_scores_gemma":[0.000014488207,0.000029203193,0.00016114443,0.0000063520088,0.000008891381,0.000026424988,0.000015190145,0.97765726,0.001936565,0.01991774,0.00021780812,0.00000886439],"about_ca_topic_score_codex":0.0038447403,"about_ca_topic_score_gemma":0.0043821014,"teacher_disagreement_score":0.0038447403,"about_ca_system_score_codex":0.0010131829,"about_ca_system_score_gemma":0.0020814221,"threshold_uncertainty_score":0.008931637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41600654,0.0014061978,0.5786928,0.00035864522,0.000043605094,0.000045268414,0.00012860708,0.0008440337,0.002474324],"genre_scores_gemma":[0.9575151,0.00039257022,0.041022483,0.00010189661,0.00005500208,0.0000483102,0.00015246916,0.00009654979,0.0006155951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975884,0.00060220016,0.00015553283,0.00042361062,0.00089838397,0.00033194703],"domain_scores_gemma":[0.96777225,0.02287841,0.0028387804,0.0035582047,0.002260303,0.0006921056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031183655,0.00062924053,0.0011285519,0.0011036757,0.00073716434,0.0011499467,0.0012445326,0.0010861766,0.00071143406],"category_scores_gemma":[0.0331465,0.00044158197,0.00045044525,0.0011195478,0.0024833772,0.0029820479,0.002139745,0.0011962218,0.00027849816],"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.0008345458,0.000083621366,0.007826495,0.0002834067,0.0001548981,0.00057189097,0.0007690906,0.70682156,0.04369108,0.15552875,0.00094325497,0.08249135],"study_design_scores_gemma":[0.00002200746,0.00021583434,0.00091941847,0.000027073847,0.00004040078,0.00044839483,0.00006224298,0.9135169,0.024197534,0.05952787,0.0009748574,0.000047456393],"about_ca_topic_score_codex":0.00116737,"about_ca_topic_score_gemma":0.0008412111,"teacher_disagreement_score":0.0031183655,"about_ca_system_score_codex":0.0013102357,"about_ca_system_score_gemma":0.0012594309,"threshold_uncertainty_score":0.016491711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037290752,0.0011498892,0.94826853,0.000671368,0.00005029433,0.000052249274,0.00018678504,0.00009347855,0.012236744],"genre_scores_gemma":[0.8348975,0.0029608435,0.15289308,0.00027357432,0.00019982625,0.00020350238,0.00037048894,0.00006846849,0.008132735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984181,0.0006591136,0.000048217844,0.00015177029,0.00051383144,0.0002090078],"domain_scores_gemma":[0.99407744,0.004619757,0.00036397084,0.00038925564,0.00047320683,0.00007638897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020128635,0.0007880917,0.00097345514,0.0007671162,0.000576153,0.0014720403,0.000776888,0.001056787,0.0015242274],"category_scores_gemma":[0.006510808,0.0003383542,0.00045649038,0.0013316155,0.0020815074,0.0022982026,0.0014821098,0.0015623374,0.00043522049],"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.00025480246,0.000032389587,0.00042939666,0.00018969706,0.000030598654,0.00034265502,0.00021977014,0.353515,0.0041670958,0.61187077,0.001961742,0.026986077],"study_design_scores_gemma":[0.000017859844,0.000045779056,0.00013507745,0.000027557966,0.000011987742,0.00015314034,0.000036017445,0.8463831,0.0031928802,0.14799444,0.0019758933,0.000026204372],"about_ca_topic_score_codex":0.003076475,"about_ca_topic_score_gemma":0.0014287416,"teacher_disagreement_score":0.003076475,"about_ca_system_score_codex":0.0017790884,"about_ca_system_score_gemma":0.0015263255,"threshold_uncertainty_score":0.01290828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10511912,0.0018197857,0.8370632,0.0011663589,0.00019267519,0.000060609324,0.00032891042,0.0005420784,0.05370734],"genre_scores_gemma":[0.9189928,0.000875721,0.0726977,0.00041941044,0.00030857685,0.00018160256,0.0001843973,0.00027951522,0.0060602347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635905,0.0007636741,0.00022907961,0.00050097273,0.0014815612,0.0006656267],"domain_scores_gemma":[0.99256516,0.0047394214,0.0005152535,0.0011423138,0.0006427103,0.000395022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031963321,0.0014082668,0.001237585,0.0026816167,0.0010036129,0.00277284,0.0026757673,0.0014297563,0.007122174],"category_scores_gemma":[0.012902095,0.00051731657,0.0011846494,0.001578271,0.0035368204,0.0075339735,0.0046638073,0.0042256364,0.0008679649],"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.00006146098,0.0000369468,0.0002304522,0.000121299156,0.000023277713,0.000090077505,0.00015322803,0.019341307,0.003786433,0.96674293,0.00061173487,0.0088007655],"study_design_scores_gemma":[0.000009787823,0.000044437526,0.0002609622,0.000060702416,0.000027035407,0.00008431184,0.000029483863,0.15564601,0.0067700683,0.8356946,0.0013241213,0.00004844596],"about_ca_topic_score_codex":0.00043393462,"about_ca_topic_score_gemma":0.000492985,"teacher_disagreement_score":0.007122174,"about_ca_system_score_codex":0.0015253454,"about_ca_system_score_gemma":0.0007134822,"threshold_uncertainty_score":0.023826122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029899605,0.001063938,0.95148546,0.00038805715,0.00033266837,0.00010131918,0.00018607124,0.0006511405,0.015891835],"genre_scores_gemma":[0.4078657,0.0016625852,0.5736661,0.00051252637,0.0005145971,0.00044082006,0.0004241404,0.0004502202,0.014463297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853516,0.00036044046,0.00012548824,0.00017108033,0.00062129274,0.0001866461],"domain_scores_gemma":[0.9971107,0.0010219559,0.00043531484,0.00073959,0.00050067034,0.00019172796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088690576,0.00088492373,0.0007614557,0.0012427671,0.001216235,0.0014202021,0.0009395893,0.00094059604,0.0025706089],"category_scores_gemma":[0.0035860671,0.00039832242,0.0007758345,0.0012379881,0.0018399031,0.0022404299,0.003252332,0.0022865804,0.0010814818],"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.00017076582,0.00005636879,0.0005733021,0.0002867026,0.00004369164,0.00029759388,0.0004631668,0.033474248,0.02587229,0.8368178,0.0034285085,0.09851556],"study_design_scores_gemma":[0.0000743685,0.00024961706,0.00046101186,0.00019394975,0.000101222875,0.0015495981,0.00016844348,0.3142325,0.09969226,0.5130647,0.06999817,0.0002141634],"about_ca_topic_score_codex":0.00033181408,"about_ca_topic_score_gemma":0.00046793005,"teacher_disagreement_score":0.0025706089,"about_ca_system_score_codex":0.00078270107,"about_ca_system_score_gemma":0.0011721769,"threshold_uncertainty_score":0.00859952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009029735,0.00020406995,0.97900224,0.00014980538,0.000048091548,0.00006338696,0.0001071009,0.0002058043,0.011189734],"genre_scores_gemma":[0.3297959,0.0013325905,0.65355384,0.00021243528,0.00009285594,0.0002731125,0.00030421358,0.00040120824,0.014033859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972004,0.00007542137,0.0000159415,0.00003584003,0.00012923377,0.000023481502],"domain_scores_gemma":[0.99940133,0.000293677,0.000058998416,0.00016465258,0.00006709207,0.00001430669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005484199,0.00055330497,0.00030654776,0.00033173597,0.00029768585,0.000735467,0.0003937777,0.0004925247,0.0064173155],"category_scores_gemma":[0.002559271,0.00017665248,0.00027986977,0.00045535737,0.00074522145,0.0011883298,0.0008194026,0.00095799967,0.0019442627],"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.00013750157,0.00007103265,0.00037574244,0.00040434118,0.000021742093,0.00039500516,0.000322073,0.17879666,0.04470297,0.5636476,0.004682864,0.20644243],"study_design_scores_gemma":[0.000016836555,0.00011304612,0.00028856247,0.00007144684,0.00001603832,0.00071640033,0.00005820598,0.74554163,0.04931552,0.17873137,0.025089376,0.00004150648],"about_ca_topic_score_codex":0.00086742867,"about_ca_topic_score_gemma":0.0014507815,"teacher_disagreement_score":0.0064173155,"about_ca_system_score_codex":0.00039021883,"about_ca_system_score_gemma":0.0008475549,"threshold_uncertainty_score":0.021468043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041185174,0.0007702857,0.9451877,0.00038046166,0.000038474307,0.000037040347,0.00012077771,0.00013485515,0.012145144],"genre_scores_gemma":[0.86958027,0.0016097707,0.12273424,0.0001280793,0.00009189538,0.00010987995,0.00014181467,0.000060739196,0.005543401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928266,0.00033476416,0.000015983198,0.000091538976,0.00016520616,0.00010989267],"domain_scores_gemma":[0.99848086,0.0011767317,0.00012941276,0.00005087654,0.00012824291,0.000033940116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011368976,0.00066701276,0.0008490381,0.00046125488,0.00036467594,0.0010381393,0.00059759105,0.0010125383,0.0017830738],"category_scores_gemma":[0.0040252376,0.00037227178,0.0003799528,0.00071347604,0.0013189506,0.0014321009,0.0007859066,0.0006648036,0.00048309145],"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.00009263679,0.000020043588,0.00024812462,0.00007985371,0.000026033096,0.00007206797,0.000070297676,0.89046323,0.0023226847,0.09272403,0.00087801815,0.013002965],"study_design_scores_gemma":[0.000017859444,0.000042300904,0.00013105864,0.000016093047,0.000009440029,0.00004108469,0.000023001696,0.969035,0.0008773268,0.029067166,0.00072691066,0.0000127943285],"about_ca_topic_score_codex":0.0019088527,"about_ca_topic_score_gemma":0.001636303,"teacher_disagreement_score":0.0019088527,"about_ca_system_score_codex":0.0008947188,"about_ca_system_score_gemma":0.0011276449,"threshold_uncertainty_score":0.0064917207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033087287,0.0012633589,0.92939824,0.001121475,0.00028782967,0.00007661507,0.00042479197,0.00018772818,0.034152664],"genre_scores_gemma":[0.90136915,0.002811778,0.06756172,0.00039510586,0.00040827293,0.00015519829,0.00042580438,0.000053736112,0.026819251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925405,0.00020288116,0.000026748445,0.00014791779,0.00025457534,0.0001137163],"domain_scores_gemma":[0.9987815,0.00063751446,0.00015366472,0.0001693846,0.00021240847,0.000045496472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041981033,0.0004071128,0.0004112927,0.00027677522,0.00045490765,0.0014502358,0.0005305614,0.0010857277,0.004585318],"category_scores_gemma":[0.0021755043,0.00019611345,0.0003190037,0.00066406274,0.00110415,0.0018560976,0.0011013435,0.0014425713,0.00084505696],"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.00017507061,0.000038807106,0.00038326543,0.00026201457,0.00004311767,0.00058358983,0.00020415777,0.119365774,0.013432902,0.82510346,0.0064343335,0.033973567],"study_design_scores_gemma":[0.000034267447,0.00014641254,0.0003411486,0.000055354536,0.000032410368,0.00069890026,0.00016386576,0.64066696,0.014182371,0.32400972,0.019606762,0.00006185636],"about_ca_topic_score_codex":0.00088576815,"about_ca_topic_score_gemma":0.00050691125,"teacher_disagreement_score":0.004585318,"about_ca_system_score_codex":0.00056940346,"about_ca_system_score_gemma":0.0006614027,"threshold_uncertainty_score":0.015339434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022990938,0.0011022586,0.9487808,0.0029791568,0.0003651873,0.0003609594,0.00017865072,0.00047375646,0.022768276],"genre_scores_gemma":[0.5161148,0.0015702212,0.4507588,0.001374689,0.0011423673,0.0014025491,0.00026443636,0.00040123373,0.026971035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913605,0.0033405186,0.0003783538,0.0013284523,0.0029458527,0.0006463023],"domain_scores_gemma":[0.9767442,0.017403364,0.00096110813,0.003221903,0.0010265401,0.000643049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058595887,0.0013705199,0.0016714567,0.0015925203,0.0018796409,0.0037689481,0.0043858374,0.003727452,0.007850977],"category_scores_gemma":[0.021248532,0.0009714762,0.0016553734,0.0019723019,0.0067765447,0.013687044,0.009138267,0.009091564,0.0009580028],"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.00011488099,0.000110503366,0.00013609111,0.00014238905,0.000030824467,0.00010243641,0.0001649244,0.029915774,0.0021407597,0.9455624,0.0014269152,0.020152137],"study_design_scores_gemma":[0.000076044824,0.00008892083,0.0000758066,0.000028728356,0.000025436919,0.00011171716,0.000029446312,0.31410018,0.003188506,0.6781317,0.0040877988,0.000055644177],"about_ca_topic_score_codex":0.0006872598,"about_ca_topic_score_gemma":0.0006625067,"teacher_disagreement_score":0.007850977,"about_ca_system_score_codex":0.004013159,"about_ca_system_score_gemma":0.0025333273,"threshold_uncertainty_score":0.030988812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49802756,0.0034226154,0.47704008,0.001950259,0.00009127861,0.00006468118,0.00023208032,0.0006550204,0.018516447],"genre_scores_gemma":[0.9668113,0.00081379386,0.028180748,0.00009737028,0.00004887543,0.000058328726,0.000095162235,0.000093424664,0.003801079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910873,0.0002456702,0.000044731754,0.00010435706,0.00032192376,0.00017446329],"domain_scores_gemma":[0.99485993,0.003686657,0.00033149944,0.0006405982,0.00038395097,0.00009751542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011734522,0.0004796304,0.00040118262,0.0007182607,0.0005272442,0.0015636672,0.0008725862,0.000892164,0.0026772246],"category_scores_gemma":[0.007903585,0.0003599919,0.00035428567,0.001136373,0.00083261443,0.0036228506,0.0007323512,0.00079613226,0.00033102385],"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.00047093607,0.00009984279,0.0017061383,0.0001467009,0.00003121403,0.00020375098,0.00018459208,0.5864521,0.031747147,0.31698602,0.0014942402,0.060477354],"study_design_scores_gemma":[0.00001763623,0.00011054815,0.0005861275,0.000013178553,0.000018580999,0.00012160078,0.000050003142,0.86303735,0.008662085,0.12625739,0.0011021924,0.000023359085],"about_ca_topic_score_codex":0.0015588899,"about_ca_topic_score_gemma":0.0025345916,"teacher_disagreement_score":0.0026772246,"about_ca_system_score_codex":0.0020594853,"about_ca_system_score_gemma":0.00095304893,"threshold_uncertainty_score":0.014942706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16979863,0.00027502916,0.8233191,0.00048321052,0.00003468337,0.00007702691,0.00019332474,0.00022342596,0.0055955504],"genre_scores_gemma":[0.9523198,0.00030592916,0.043396894,0.00019154183,0.00009444915,0.00015701694,0.00027526735,0.00009506917,0.0031639007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818736,0.00050926406,0.00011097289,0.0003824365,0.00054197904,0.00026784837],"domain_scores_gemma":[0.9809996,0.011385253,0.0026625975,0.0029318489,0.0013818302,0.0006388427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020475774,0.00055839,0.0008201513,0.0008851578,0.0005836819,0.0008506658,0.0010869907,0.0008239512,0.0028359985],"category_scores_gemma":[0.02021002,0.00062554906,0.00063779304,0.000669531,0.0024658462,0.0028367282,0.0018869407,0.0015884119,0.00058998034],"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.00041914632,0.00013946962,0.005005729,0.00018556292,0.00007846386,0.0007848893,0.0005157021,0.25157475,0.023179939,0.6873345,0.0024553584,0.02832653],"study_design_scores_gemma":[0.000032233947,0.00015849184,0.0010205104,0.000015963553,0.000011407526,0.0003138282,0.00009081305,0.87512493,0.004536941,0.117434025,0.0012353902,0.000025500538],"about_ca_topic_score_codex":0.00073264015,"about_ca_topic_score_gemma":0.00055982993,"teacher_disagreement_score":0.0028359985,"about_ca_system_score_codex":0.0006238584,"about_ca_system_score_gemma":0.00067999156,"threshold_uncertainty_score":0.010828793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06131441,0.0009149937,0.9339,0.000787013,0.00007371526,0.000035670786,0.00012215412,0.00050003815,0.0023520505],"genre_scores_gemma":[0.6607657,0.0013868699,0.33093664,0.00056340336,0.00009279799,0.0001850318,0.00050932367,0.00042177166,0.0051384484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959259,0.0010284319,0.00028571233,0.00067495985,0.0018012709,0.00028369902],"domain_scores_gemma":[0.9682521,0.024527192,0.001856781,0.0025960987,0.0023283644,0.00043938146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00850475,0.0010569566,0.0011698679,0.00070102804,0.0003492363,0.0012229745,0.0014450282,0.0016884988,0.0017369202],"category_scores_gemma":[0.056453723,0.00060343614,0.0005395848,0.00064523285,0.0024053885,0.0035287582,0.0025927026,0.0028498906,0.0006101575],"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.0015883626,0.00017900094,0.005582762,0.0008792722,0.0001574534,0.0004913636,0.0007161848,0.6763823,0.061621405,0.13138446,0.0024802657,0.1185372],"study_design_scores_gemma":[0.000022279906,0.00011228042,0.0010345582,0.000095905445,0.000012959825,0.00013750693,0.00005446043,0.9579249,0.015348808,0.024487263,0.0007373645,0.0000315969],"about_ca_topic_score_codex":0.0013960613,"about_ca_topic_score_gemma":0.0009773653,"teacher_disagreement_score":0.00850475,"about_ca_system_score_codex":0.0012448041,"about_ca_system_score_gemma":0.0010827014,"threshold_uncertainty_score":0.044977963},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7605171,0.0007404795,0.22996129,0.0003480451,0.000022130618,0.00012003457,0.00040889514,0.00038025432,0.007501754],"genre_scores_gemma":[0.84133315,0.00034691105,0.15544051,0.000104668245,0.000010147014,0.00010890887,0.0006641742,0.00006512275,0.0019264732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998448,0.000038293594,0.0000062500535,0.000026510683,0.00005589381,0.000028298064],"domain_scores_gemma":[0.9993487,0.0004195406,0.00007048092,0.00006469592,0.00006904483,0.000027390794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025376873,0.0002816654,0.00040196508,0.00064591144,0.00037117998,0.00033292882,0.00047569265,0.00045924328,0.0011887539],"category_scores_gemma":[0.0021256034,0.00026037602,0.00028619927,0.0004622003,0.00040025896,0.0005008989,0.0004585915,0.0003537794,0.00017714499],"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.00025551167,0.00012886491,0.005415519,0.00033336892,0.00006668002,0.0004181977,0.0002725324,0.80359554,0.04493917,0.048397686,0.002083094,0.09409372],"study_design_scores_gemma":[0.00004636164,0.000064961925,0.00073486025,0.000017294975,0.000012346107,0.000085544234,0.00005043554,0.97287375,0.006230727,0.018692248,0.0011822736,0.000009122473],"about_ca_topic_score_codex":0.0021581962,"about_ca_topic_score_gemma":0.0045073936,"teacher_disagreement_score":0.0021581962,"about_ca_system_score_codex":0.00054657075,"about_ca_system_score_gemma":0.0013056651,"threshold_uncertainty_score":0.004291296},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11147657,0.0011266326,0.8710672,0.0011255972,0.000074370575,0.00011512228,0.0001327074,0.0004049851,0.014476903],"genre_scores_gemma":[0.7483459,0.0009914897,0.2428995,0.0002855195,0.00012291159,0.00023785236,0.0001830623,0.0002487829,0.0066848984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850357,0.0005222885,0.000053314387,0.00030221225,0.00036940383,0.00024923487],"domain_scores_gemma":[0.9961958,0.002769466,0.00046558687,0.00025609182,0.00020463973,0.00010834897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011460967,0.0010399023,0.0007839937,0.00071081356,0.0005729931,0.0014010427,0.00109308,0.0011260444,0.0030829152],"category_scores_gemma":[0.007013529,0.00039453048,0.0006773598,0.0009466796,0.0018455733,0.0026905981,0.0013363945,0.0018973598,0.0004959201],"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.00034817547,0.00012848133,0.00077868544,0.00031078907,0.000053516145,0.00014616702,0.00016454073,0.5490425,0.010069561,0.3810874,0.0019422743,0.055927873],"study_design_scores_gemma":[0.00003879308,0.00013500015,0.00016569078,0.000026025597,0.000012655034,0.00006176362,0.0000333731,0.794012,0.006371376,0.19781443,0.0013112314,0.000017722747],"about_ca_topic_score_codex":0.0011408009,"about_ca_topic_score_gemma":0.0011120954,"teacher_disagreement_score":0.0030829152,"about_ca_system_score_codex":0.0019189854,"about_ca_system_score_gemma":0.0014468657,"threshold_uncertainty_score":0.013923287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17191914,0.0020981466,0.8068429,0.0007593069,0.000058363858,0.00006450939,0.00036691286,0.0005169408,0.017373702],"genre_scores_gemma":[0.980587,0.0011946608,0.015905017,0.0000974239,0.00006825039,0.000045650515,0.0001364423,0.000053724856,0.0019117616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846363,0.00042934145,0.000051106945,0.0001202334,0.00056332594,0.0003724565],"domain_scores_gemma":[0.99369216,0.004451822,0.000537151,0.00039006627,0.0007894557,0.00013938159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024189362,0.0010678062,0.0011003227,0.0009916419,0.0006892501,0.0011353808,0.00088993035,0.0008618433,0.002111002],"category_scores_gemma":[0.007980864,0.0003840218,0.0006230892,0.0014506087,0.0017821616,0.0015772382,0.0012393307,0.0011897195,0.00035342513],"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.00007415442,0.00002020458,0.00083195354,0.00006330937,0.000020656866,0.00020946747,0.0000933147,0.95626324,0.0016708799,0.034329414,0.0005787845,0.005844591],"study_design_scores_gemma":[0.0000028654858,0.000011234238,0.00017608635,0.000006248086,0.0000062995823,0.000054560714,0.000016919601,0.9942194,0.00032754915,0.005033041,0.00013860669,0.000007176896],"about_ca_topic_score_codex":0.008061031,"about_ca_topic_score_gemma":0.0040394585,"teacher_disagreement_score":0.008061031,"about_ca_system_score_codex":0.0026516619,"about_ca_system_score_gemma":0.0011538222,"threshold_uncertainty_score":0.019239247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031164128,0.00398222,0.9372674,0.0014243241,0.00029706376,0.00005393104,0.0003417677,0.00039422864,0.025074894],"genre_scores_gemma":[0.81585896,0.0073596425,0.16353044,0.001130219,0.0012499687,0.0004443989,0.00085621706,0.0006050676,0.008965094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99472976,0.0015198548,0.00025298298,0.00081423216,0.0018787704,0.00080439926],"domain_scores_gemma":[0.95956147,0.03318048,0.0014275466,0.0026990275,0.001944096,0.0011873791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072228857,0.0028869223,0.0020076595,0.004729992,0.0015934956,0.004362436,0.0029389635,0.0020846357,0.00489734],"category_scores_gemma":[0.046371628,0.0012481618,0.0014809564,0.0028019166,0.007668643,0.0092769405,0.009556781,0.008129756,0.0014266669],"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.0002850972,0.00007225138,0.0009201295,0.0002583306,0.00007486984,0.00025034373,0.00032484438,0.15619877,0.006305409,0.8022946,0.0026746565,0.030340755],"study_design_scores_gemma":[0.000014894922,0.00005686961,0.0005090668,0.00013849509,0.000023200806,0.00012365288,0.000046625646,0.55464786,0.0041692792,0.437706,0.0024824846,0.000081527316],"about_ca_topic_score_codex":0.0011253839,"about_ca_topic_score_gemma":0.0010435053,"teacher_disagreement_score":0.0072228857,"about_ca_system_score_codex":0.004085426,"about_ca_system_score_gemma":0.0011851562,"threshold_uncertainty_score":0.03819877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15353142,0.00055620633,0.82981163,0.0006902992,0.000056208657,0.00008817634,0.000349685,0.00060608174,0.014310358],"genre_scores_gemma":[0.88186014,0.00066247385,0.109139085,0.00026669563,0.00010603019,0.0001441705,0.000304941,0.000116027346,0.0074003604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935573,0.00015138522,0.000031664233,0.00007876369,0.00027912625,0.00010330559],"domain_scores_gemma":[0.99750644,0.0010807792,0.00035178752,0.00042479066,0.0004548422,0.0001813837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000639561,0.0006100339,0.00036413973,0.00051572634,0.00035775147,0.0009136883,0.0004632377,0.0006420904,0.0018070706],"category_scores_gemma":[0.005459725,0.00024194294,0.00025621106,0.0006691866,0.0011666719,0.0013676669,0.0010499735,0.0011855932,0.0003489514],"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.0002057142,0.000068198126,0.00086879055,0.00011863095,0.00002537172,0.00023407242,0.00015611779,0.24013731,0.028494187,0.6769789,0.003622383,0.04909039],"study_design_scores_gemma":[0.00002128849,0.0001268795,0.00033554877,0.000032020656,0.00000922808,0.00016241902,0.000031460488,0.760705,0.018473119,0.21726121,0.002809809,0.000032089956],"about_ca_topic_score_codex":0.0013456465,"about_ca_topic_score_gemma":0.0016728211,"teacher_disagreement_score":0.0018070706,"about_ca_system_score_codex":0.00095029845,"about_ca_system_score_gemma":0.0010920812,"threshold_uncertainty_score":0.0068948865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10027222,0.00083656283,0.8908925,0.00067509897,0.000079688274,0.00004151803,0.00018699237,0.00015383464,0.0068616136],"genre_scores_gemma":[0.9597643,0.0007154806,0.035241947,0.00009073676,0.00006125701,0.00006194971,0.00014340322,0.00004076123,0.003880147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991667,0.00019513111,0.0000410811,0.00018649912,0.0002079235,0.00020254677],"domain_scores_gemma":[0.9950477,0.0035665166,0.0006406781,0.0001916101,0.00041810246,0.00013545726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012542808,0.0008103981,0.00080697244,0.0006677859,0.00053219026,0.0013471756,0.001069219,0.000895439,0.0016249152],"category_scores_gemma":[0.0068300203,0.00042020532,0.000502106,0.0008943293,0.0021590395,0.001752049,0.0013421848,0.0014275081,0.00024655493],"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.00023111152,0.00003229217,0.00042005113,0.00010706294,0.000021834872,0.00013847498,0.00015476828,0.72417283,0.0035435515,0.25190648,0.0007581354,0.018513419],"study_design_scores_gemma":[0.000017502352,0.000030909003,0.000077875855,0.000022478458,0.000008848393,0.000025397982,0.000024405768,0.9348795,0.001832881,0.062738076,0.0003238729,0.000018185252],"about_ca_topic_score_codex":0.006754401,"about_ca_topic_score_gemma":0.0036717607,"teacher_disagreement_score":0.006754401,"about_ca_system_score_codex":0.0022987484,"about_ca_system_score_gemma":0.0023998201,"threshold_uncertainty_score":0.016678631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8617394,0.0004648165,0.060801256,0.001196715,0.00019498312,0.000092281996,0.0007619083,0.0003351081,0.07441356],"genre_scores_gemma":[0.96717227,0.0004090231,0.012830527,0.00034054913,0.000104571845,0.000068051515,0.0005785019,0.000062106556,0.018434403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967456,0.000063277635,0.000014918468,0.00007136159,0.00008001689,0.00009601295],"domain_scores_gemma":[0.9992754,0.000193995,0.00017125567,0.000091920505,0.0001457684,0.00012161555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025411908,0.00031388324,0.00026871718,0.0010006331,0.0010248896,0.0010932325,0.0004195751,0.0005079139,0.005095736],"category_scores_gemma":[0.0011209121,0.00030194942,0.00040567954,0.00072652946,0.0010457768,0.00113174,0.0006438436,0.0008610807,0.00085600873],"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.00009748083,0.000040882805,0.0012174789,0.00006774474,0.000017558978,0.00037620522,0.00033030577,0.0050024996,0.0056659216,0.96999365,0.002891038,0.01429916],"study_design_scores_gemma":[0.00004872277,0.00008441235,0.0024777881,0.000031226762,0.000017703529,0.00055369164,0.00038489164,0.026257323,0.0041809846,0.9527529,0.013153781,0.00005669583],"about_ca_topic_score_codex":0.0021914388,"about_ca_topic_score_gemma":0.0024526126,"teacher_disagreement_score":0.005095736,"about_ca_system_score_codex":0.00072668697,"about_ca_system_score_gemma":0.00080797507,"threshold_uncertainty_score":0.017046988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11099433,0.00029435207,0.8808678,0.00023429954,0.000026322476,0.00022318908,0.00034144946,0.00065540697,0.006362897],"genre_scores_gemma":[0.53370005,0.00026417203,0.45918915,0.0001693932,0.000032991367,0.00034334723,0.0015043947,0.00014675329,0.004649754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999574,0.00006653456,0.000038101698,0.000095088,0.00015906396,0.000067113775],"domain_scores_gemma":[0.99912065,0.00041993195,0.00010478824,0.00013542589,0.00017010854,0.000049045204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027619003,0.00045695188,0.0005914408,0.0010066878,0.0005184974,0.000777586,0.00082891044,0.0005126003,0.0022288298],"category_scores_gemma":[0.0021301191,0.00026247295,0.00050167326,0.0007494418,0.0005635343,0.00165552,0.0011064907,0.0008518708,0.00039621204],"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.0005431326,0.00021177145,0.0066192695,0.00058458536,0.00009099225,0.0003902651,0.00080481777,0.3076259,0.059445437,0.23801902,0.007122261,0.3785425],"study_design_scores_gemma":[0.00005134239,0.00011242147,0.0007437436,0.00003513335,0.000021399446,0.00027530143,0.00008666322,0.92336506,0.012771123,0.058071095,0.0044335253,0.000033271393],"about_ca_topic_score_codex":0.0015881654,"about_ca_topic_score_gemma":0.0019368891,"teacher_disagreement_score":0.0022288298,"about_ca_system_score_codex":0.00081528246,"about_ca_system_score_gemma":0.0012871491,"threshold_uncertainty_score":0.0074561834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23424354,0.0013764058,0.63477945,0.002034003,0.00021861107,0.00017898329,0.00050931174,0.0006434455,0.1260162],"genre_scores_gemma":[0.91559607,0.00088475604,0.06617803,0.00042546343,0.00026308084,0.00021473323,0.00049754645,0.00009768111,0.015842658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999288,0.0001799576,0.000027736469,0.000119535005,0.0002436645,0.00014115675],"domain_scores_gemma":[0.99894804,0.0005895052,0.000101046186,0.00016140207,0.00015575268,0.00004424172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866274,0.0004432301,0.00036381284,0.00086405315,0.00063691434,0.0014746898,0.00044153148,0.0005119599,0.0044801277],"category_scores_gemma":[0.0029850632,0.00015778416,0.00036336156,0.0008359911,0.0014605048,0.002537763,0.0011958468,0.0013302141,0.0008626859],"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.0000901246,0.000021176516,0.0003103121,0.00007029281,0.0000063744505,0.0001595173,0.00023318072,0.01990665,0.0030268955,0.9524088,0.0027466472,0.021019947],"study_design_scores_gemma":[0.000034308137,0.00005202609,0.0001528292,0.000042090327,0.000009202192,0.00017603757,0.00009141458,0.14381568,0.0046909233,0.84035367,0.010563288,0.00001849229],"about_ca_topic_score_codex":0.0014480051,"about_ca_topic_score_gemma":0.000937591,"teacher_disagreement_score":0.0044801277,"about_ca_system_score_codex":0.0015544764,"about_ca_system_score_gemma":0.00082347944,"threshold_uncertainty_score":0.014987528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25281155,0.00050370896,0.7331549,0.000513609,0.000064903994,0.00024817258,0.00029140542,0.00052952825,0.011882229],"genre_scores_gemma":[0.90133435,0.00029902547,0.09563488,0.000088825094,0.000044675824,0.00013863009,0.00016016857,0.000040896517,0.0022584428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965624,0.0009099258,0.00025556382,0.00043399096,0.0013117597,0.00052637485],"domain_scores_gemma":[0.993536,0.0022954198,0.0011301718,0.002184535,0.00051067467,0.0003432473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017100396,0.00056942116,0.0009978509,0.0007764121,0.0008104429,0.0014308986,0.0010956028,0.00078773947,0.0011938228],"category_scores_gemma":[0.0067665684,0.00031672907,0.00078953186,0.0010763223,0.0024925617,0.0052389456,0.004036105,0.0018093196,0.0003904408],"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.00033140028,0.00007320217,0.0005335327,0.00016933672,0.000032988515,0.000121955185,0.00046962412,0.04883503,0.028389685,0.89640546,0.0005900028,0.02404785],"study_design_scores_gemma":[0.00016183662,0.0006595391,0.00087873323,0.000097525946,0.00007721908,0.00073355995,0.00016800572,0.29464105,0.089226194,0.5986398,0.014547965,0.00016860988],"about_ca_topic_score_codex":0.0003417139,"about_ca_topic_score_gemma":0.0002440317,"teacher_disagreement_score":0.0017100396,"about_ca_system_score_codex":0.0014472187,"about_ca_system_score_gemma":0.0015178004,"threshold_uncertainty_score":0.010500312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4624317,0.0004835529,0.52769196,0.002710022,0.00008945798,0.000119752636,0.0010168467,0.00092004327,0.0045366883],"genre_scores_gemma":[0.95238715,0.00017812966,0.045432985,0.00033777193,0.00013581963,0.000107354186,0.0009401233,0.000060986018,0.0004197588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9853366,0.007404863,0.00068929844,0.0034483087,0.0023958294,0.00072505226],"domain_scores_gemma":[0.8159388,0.15961532,0.0064831506,0.012939113,0.0031794615,0.0018441663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013912071,0.0009646206,0.0021261363,0.0020721753,0.0009921707,0.003028401,0.003460474,0.0029670815,0.0023877942],"category_scores_gemma":[0.14134842,0.00078747346,0.0012911711,0.0018782216,0.004629542,0.00680808,0.002374277,0.003750632,0.00037962606],"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.0017720222,0.00069589686,0.07649426,0.000492269,0.0010790278,0.0013552427,0.0007597382,0.3376322,0.005603948,0.4681788,0.004607232,0.1013293],"study_design_scores_gemma":[0.000114082344,0.00015316419,0.0043209875,0.00004791149,0.00004870141,0.00025244246,0.00013317037,0.53606266,0.0024716738,0.4556154,0.0007347851,0.00004494674],"about_ca_topic_score_codex":0.0020291256,"about_ca_topic_score_gemma":0.0012327008,"teacher_disagreement_score":0.013912071,"about_ca_system_score_codex":0.0015741715,"about_ca_system_score_gemma":0.0017451172,"threshold_uncertainty_score":0.0735749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20596048,0.014199522,0.64183944,0.004135948,0.00034883272,0.00011482666,0.0013071875,0.00062091695,0.1314729],"genre_scores_gemma":[0.9697472,0.0065292213,0.015583663,0.00046190992,0.00042819942,0.00020599087,0.00043470206,0.00015833591,0.0064507197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980725,0.0006704649,0.000040012328,0.00018240437,0.00038091312,0.0006536769],"domain_scores_gemma":[0.9868282,0.010089509,0.0007096687,0.0005650851,0.0014055843,0.0004019895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024834448,0.001713713,0.0013100217,0.0016731437,0.0011743053,0.0027128342,0.0017790418,0.0010495315,0.0050739986],"category_scores_gemma":[0.013946771,0.0007264927,0.00085233967,0.002198965,0.0048181205,0.0039651846,0.0028064838,0.0026429924,0.0012530329],"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.0004827301,0.00006154488,0.0009169728,0.00037107716,0.00010912124,0.000549703,0.0006123973,0.4545412,0.0055152015,0.5157582,0.007535641,0.013546172],"study_design_scores_gemma":[0.000030295814,0.00007394091,0.0006192629,0.00017209312,0.000052192096,0.00029822637,0.00020025158,0.79871243,0.0024814436,0.19374014,0.003527401,0.00009240217],"about_ca_topic_score_codex":0.009362925,"about_ca_topic_score_gemma":0.0028231777,"teacher_disagreement_score":0.009362925,"about_ca_system_score_codex":0.003418333,"about_ca_system_score_gemma":0.002354339,"threshold_uncertainty_score":0.02480179},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047624274,0.0005494506,0.97347045,0.00050988514,0.00008282648,0.00005448854,0.000084703606,0.000046995712,0.02043878],"genre_scores_gemma":[0.44995943,0.00427306,0.5309391,0.0005282282,0.0005146599,0.0005423687,0.0002081547,0.00006443967,0.012970579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923956,0.00026632764,0.000045687208,0.000106148174,0.0002611423,0.000081107995],"domain_scores_gemma":[0.99891233,0.00057594763,0.00013014063,0.00017149886,0.0001708296,0.00003918846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009546984,0.0005648381,0.00044265456,0.00095569907,0.0007403017,0.0018096329,0.001292168,0.00085536216,0.0036280283],"category_scores_gemma":[0.002845229,0.00033133075,0.0006013672,0.0012100621,0.0021211244,0.0025736303,0.0016414141,0.0020573176,0.0006911512],"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.000008121618,0.00000950075,0.000049549566,0.00004622947,0.0000044677568,0.00003206427,0.00004757334,0.031869225,0.0012036853,0.95834756,0.0005351557,0.007846817],"study_design_scores_gemma":[0.000011876121,0.000050434322,0.00006530783,0.00004067139,0.000008572522,0.00013267668,0.00004433926,0.31258798,0.0013907467,0.6741616,0.01148147,0.000024286366],"about_ca_topic_score_codex":0.0006584825,"about_ca_topic_score_gemma":0.0007251639,"teacher_disagreement_score":0.0036280283,"about_ca_system_score_codex":0.0015540688,"about_ca_system_score_gemma":0.0010682452,"threshold_uncertainty_score":0.012136936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11909142,0.00076853,0.86695373,0.0005459104,0.000054719283,0.00016120545,0.00044218785,0.0006765806,0.011305676],"genre_scores_gemma":[0.5391959,0.0018905166,0.4481387,0.00045417287,0.00014849642,0.0004269938,0.0014776333,0.00046478945,0.0078027667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979808,0.00080191175,0.00010970586,0.00034598444,0.0004835153,0.0002781596],"domain_scores_gemma":[0.99348915,0.0044515086,0.0005857989,0.00074907887,0.0005345503,0.00018985668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014957365,0.0007970568,0.0007981981,0.0027224764,0.0012581701,0.0017027354,0.001088261,0.0010942667,0.0038571807],"category_scores_gemma":[0.009591888,0.00061318284,0.0007311218,0.0036787866,0.002188143,0.003757216,0.0019034514,0.0016359525,0.0008087592],"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.00030442173,0.00013095114,0.0024467718,0.00036955334,0.000034675442,0.00029512434,0.00051482086,0.23442033,0.009193741,0.6402674,0.0035446465,0.10847748],"study_design_scores_gemma":[0.000022954984,0.000049962357,0.00048157075,0.000063451494,0.000011805095,0.00017553756,0.00009908002,0.3036974,0.004062839,0.6879522,0.0033512316,0.000031985906],"about_ca_topic_score_codex":0.0029659914,"about_ca_topic_score_gemma":0.0037722834,"teacher_disagreement_score":0.0038571807,"about_ca_system_score_codex":0.0014940007,"about_ca_system_score_gemma":0.0012299125,"threshold_uncertainty_score":0.012903631},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6357741,0.0009301264,0.35324696,0.00066029665,0.00004383229,0.00008469611,0.00042953456,0.00040668095,0.0084238015],"genre_scores_gemma":[0.98805827,0.0004008824,0.009101832,0.00007561816,0.000029733046,0.000050372604,0.00019606172,0.000081098595,0.0020061417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932337,0.0002449275,0.000015673915,0.00013987794,0.00016939764,0.00010676767],"domain_scores_gemma":[0.9949443,0.0032317713,0.0004822745,0.0005317475,0.0006191252,0.00019077993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014468168,0.00044928287,0.00051112316,0.0014589619,0.0004653244,0.0008246707,0.0008192788,0.000725117,0.0015453574],"category_scores_gemma":[0.009368339,0.00036733787,0.00038866012,0.0008775732,0.0014742475,0.0018855929,0.0006615981,0.0008782797,0.00024002373],"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.00024706224,0.000060454047,0.00651293,0.0001210062,0.000055000168,0.0003174901,0.0003184154,0.55669737,0.0118411435,0.40822914,0.001504326,0.014095618],"study_design_scores_gemma":[0.0000069343664,0.000022394146,0.0010066363,0.00001247541,0.000006263065,0.00008766115,0.000028416562,0.9581459,0.0016788277,0.038550843,0.00043505273,0.000018483623],"about_ca_topic_score_codex":0.0027714414,"about_ca_topic_score_gemma":0.0021168634,"teacher_disagreement_score":0.0027714414,"about_ca_system_score_codex":0.0015657254,"about_ca_system_score_gemma":0.0007614731,"threshold_uncertainty_score":0.011360168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51796514,0.003634666,0.3646256,0.0026465615,0.00027223234,0.00010349322,0.00051053596,0.00071380637,0.10952791],"genre_scores_gemma":[0.94365966,0.00137118,0.045442376,0.00052655244,0.000271062,0.000119215816,0.00036849434,0.00016705155,0.008074304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988537,0.00022816412,0.000113390415,0.00027378753,0.0002500278,0.00028100176],"domain_scores_gemma":[0.99271774,0.0052682245,0.00070037,0.0007627594,0.000286412,0.0002645576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013833031,0.00053293386,0.00067126506,0.0011385016,0.001229964,0.0020519157,0.00071064936,0.0011814755,0.0053472007],"category_scores_gemma":[0.008800372,0.000500708,0.0011117683,0.0011662968,0.0030353463,0.005386731,0.0020041952,0.0028015396,0.0008102449],"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.0002501745,0.000078360754,0.0010638272,0.00020388758,0.000015466776,0.00033864685,0.00056050776,0.007884855,0.012319516,0.9522179,0.0013109605,0.023756083],"study_design_scores_gemma":[0.000048260074,0.00024822916,0.00080289226,0.00009065971,0.00004552075,0.0011258449,0.00036347465,0.036840264,0.03040395,0.920947,0.009021994,0.00006195612],"about_ca_topic_score_codex":0.0001960641,"about_ca_topic_score_gemma":0.00012905449,"teacher_disagreement_score":0.0053472007,"about_ca_system_score_codex":0.00083005574,"about_ca_system_score_gemma":0.0006099543,"threshold_uncertainty_score":0.017888129},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00639841,0.0002397518,0.99167657,0.000058778813,0.000024201097,0.000026443908,0.000016962313,0.0002106181,0.0013482168],"genre_scores_gemma":[0.5471786,0.0003276743,0.44558632,0.0001227981,0.000065985456,0.00019918331,0.00014110649,0.00008804016,0.006290264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943095,0.00018781729,0.000031036012,0.00012320954,0.0001822003,0.00004479537],"domain_scores_gemma":[0.9992975,0.00036537996,0.00008183225,0.00006838326,0.00016437678,0.000022490354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009571603,0.0005051719,0.0012458047,0.0005883367,0.0006054314,0.0006358318,0.00095339544,0.0012367023,0.0017937518],"category_scores_gemma":[0.0025827633,0.0004404005,0.00059099257,0.000610074,0.00047613014,0.0010031549,0.0008816868,0.0010426879,0.0005436805],"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.00007544144,0.0000354316,0.00041112414,0.00006799712,0.00005519003,0.000058583206,0.000062946754,0.86882615,0.0016871174,0.013149432,0.0007513959,0.114819124],"study_design_scores_gemma":[0.0000027485862,0.0000072881808,0.000058358488,0.0000023978535,0.0000019597678,0.000011489693,0.0000026571297,0.9969097,0.00016895482,0.0026680182,0.00016203459,0.000004465252],"about_ca_topic_score_codex":0.0061344923,"about_ca_topic_score_gemma":0.004924125,"teacher_disagreement_score":0.0061344923,"about_ca_system_score_codex":0.0005451717,"about_ca_system_score_gemma":0.00097361195,"threshold_uncertainty_score":0.012197554},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066445544,0.0005688984,0.9267231,0.00033706456,0.000043107877,0.000019157833,0.00009036269,0.00019611728,0.0055766334],"genre_scores_gemma":[0.9282547,0.00077075127,0.06787373,0.00019458191,0.000089868234,0.00007562434,0.00013646045,0.00005858617,0.0025456124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885345,0.00039995305,0.00008737498,0.00016864693,0.000357858,0.00013268163],"domain_scores_gemma":[0.9951858,0.0031284236,0.00061433524,0.0006223186,0.00033161405,0.00011760052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014469747,0.00043853465,0.0006982407,0.0007238728,0.00034843248,0.0011425497,0.0010757897,0.00050911744,0.00078006263],"category_scores_gemma":[0.008319067,0.00029178173,0.0004274179,0.0007515008,0.0014935831,0.0022639278,0.0019070313,0.0012627658,0.00024404006],"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.00014993997,0.000025304542,0.00042078985,0.0001380357,0.000022569258,0.00031324962,0.00022744483,0.18062995,0.014115478,0.7679366,0.0008303986,0.03519031],"study_design_scores_gemma":[0.000011307853,0.000040589515,0.00018284585,0.000032292955,0.000009109168,0.00013196874,0.000035726167,0.6880243,0.0067241346,0.30339482,0.0013928039,0.000020084684],"about_ca_topic_score_codex":0.0003740252,"about_ca_topic_score_gemma":0.00020056096,"teacher_disagreement_score":0.0014469747,"about_ca_system_score_codex":0.0007050696,"about_ca_system_score_gemma":0.00050830934,"threshold_uncertainty_score":0.0076524615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03255214,0.00020011938,0.9632505,0.0011182294,0.0000396294,0.00007071526,0.00013222442,0.00010822536,0.002528216],"genre_scores_gemma":[0.72651356,0.0005128372,0.26820287,0.0005539727,0.00031833205,0.00039928145,0.00031046645,0.00008887831,0.0030998616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916755,0.00508678,0.0002534999,0.0012215836,0.0012411858,0.0005215289],"domain_scores_gemma":[0.93278426,0.061123747,0.0019217164,0.0019155638,0.0014094703,0.0008452803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0113791665,0.0012483608,0.0020811053,0.0016677991,0.00120596,0.0025949122,0.0030149093,0.002482089,0.0031517118],"category_scores_gemma":[0.040528554,0.0006691591,0.0012710692,0.0017969145,0.007762251,0.008185745,0.0049481033,0.0043502976,0.00035505422],"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.0003337482,0.00012165854,0.0012058488,0.00019373425,0.00017043117,0.0004479932,0.00042039235,0.18719883,0.002565529,0.78543127,0.0008569646,0.021053558],"study_design_scores_gemma":[0.000039701314,0.0001375563,0.00017921161,0.00002724858,0.0000285734,0.000104695035,0.000059350805,0.64427656,0.0024059336,0.35214216,0.0005648501,0.000034207736],"about_ca_topic_score_codex":0.0007521427,"about_ca_topic_score_gemma":0.00035478,"teacher_disagreement_score":0.0113791665,"about_ca_system_score_codex":0.0023269178,"about_ca_system_score_gemma":0.002383525,"threshold_uncertainty_score":0.06017953},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001956141,0.00028386974,0.98731065,0.0003390821,0.0000741184,0.00004753604,0.00018510464,0.00007718863,0.009726254],"genre_scores_gemma":[0.57723117,0.0031995825,0.3920929,0.0008298282,0.0004721669,0.001144038,0.0008696438,0.00015813197,0.024002474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980996,0.000837738,0.00007552495,0.0002893086,0.0005026349,0.00019517048],"domain_scores_gemma":[0.9968188,0.0019870962,0.00028591065,0.0005281439,0.0002616455,0.0001184133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386707,0.0012556519,0.0009090711,0.0011939975,0.00074634043,0.0018098708,0.0023402995,0.0016503182,0.004780655],"category_scores_gemma":[0.0056044003,0.0004565498,0.0009865937,0.0015001319,0.0024225807,0.0028348041,0.0030456248,0.0036078705,0.0008045431],"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.000018278308,0.000011679869,0.00008666346,0.000046153647,0.000014667955,0.00007701328,0.000044335862,0.1977088,0.00065315317,0.7907222,0.0019434768,0.008673586],"study_design_scores_gemma":[0.0000064098263,0.000019199235,0.000049333466,0.000031220607,0.000009308782,0.00009120263,0.000018152074,0.63628614,0.0004013903,0.3571722,0.0058979266,0.00001758202],"about_ca_topic_score_codex":0.002008271,"about_ca_topic_score_gemma":0.001838127,"teacher_disagreement_score":0.004780655,"about_ca_system_score_codex":0.002255381,"about_ca_system_score_gemma":0.0013289802,"threshold_uncertainty_score":0.016363978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03440325,0.00271359,0.9305945,0.00033652005,0.00015464098,0.00006674803,0.000076754885,0.0003310517,0.0313229],"genre_scores_gemma":[0.8991926,0.0026485743,0.092970885,0.00017236502,0.00021292845,0.000065002896,0.00008038959,0.00006835491,0.004588996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989759,0.0003787591,0.000040430376,0.00017367153,0.00029403364,0.0001372103],"domain_scores_gemma":[0.9973368,0.0017544422,0.00026956404,0.00038497883,0.00020922016,0.000045025907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883186,0.0015843825,0.001118469,0.00067692,0.00060756644,0.0010170189,0.0011695253,0.00094864116,0.002439457],"category_scores_gemma":[0.0041249967,0.00025857924,0.0006745067,0.0008778249,0.0011313522,0.0017201196,0.0012685203,0.0006607472,0.00072140846],"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.00025126882,0.00010596558,0.00090980757,0.00047719383,0.00017022205,0.00071384205,0.00020653597,0.63828295,0.03990749,0.175916,0.0025429956,0.14051574],"study_design_scores_gemma":[0.000054720957,0.00057954126,0.00043029583,0.00012420124,0.00021529065,0.0015132135,0.000113901835,0.8778392,0.032513134,0.07184162,0.01471557,0.000059247297],"about_ca_topic_score_codex":0.00049343915,"about_ca_topic_score_gemma":0.0005891038,"teacher_disagreement_score":0.002439457,"about_ca_system_score_codex":0.0005223712,"about_ca_system_score_gemma":0.0004910925,"threshold_uncertainty_score":0.00816083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024614742,0.0017644347,0.96276885,0.0036114934,0.00008405558,0.00013815615,0.000613409,0.00036517074,0.0060396804],"genre_scores_gemma":[0.746083,0.003497791,0.2342306,0.0016836238,0.0005714342,0.0005953504,0.0015676557,0.00043555602,0.011335009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9819603,0.010207806,0.0008015232,0.0031715583,0.0026086685,0.0012501176],"domain_scores_gemma":[0.88637143,0.09565412,0.0041110837,0.010370709,0.002740184,0.0007525043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020953469,0.0019633605,0.0036997069,0.0017908461,0.001246724,0.005217417,0.0041797506,0.003927587,0.0048467065],"category_scores_gemma":[0.11666908,0.0015772749,0.0017913075,0.0035686316,0.0037738713,0.011935338,0.00600151,0.004749111,0.0014722288],"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.0009112374,0.00013767103,0.005069965,0.0006865778,0.0003410801,0.0007580624,0.00042055282,0.60210603,0.0032054486,0.29577217,0.0063855113,0.08420571],"study_design_scores_gemma":[0.00006371518,0.00009983612,0.0010861253,0.00009765586,0.00006344331,0.00042564565,0.00010192052,0.7700626,0.0021721967,0.22309811,0.0026801454,0.00004850354],"about_ca_topic_score_codex":0.0034032417,"about_ca_topic_score_gemma":0.0019504181,"teacher_disagreement_score":0.020953469,"about_ca_system_score_codex":0.0041397945,"about_ca_system_score_gemma":0.003245197,"threshold_uncertainty_score":0.1108138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04014843,0.0004925555,0.95051235,0.00032031102,0.00008851091,0.000088073306,0.00034015425,0.0016057296,0.0064038937],"genre_scores_gemma":[0.4060489,0.0009694169,0.57439107,0.0004953943,0.0002145852,0.00033350097,0.0014554338,0.0004893247,0.015602383],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978459,0.0003976929,0.00010795748,0.00046384777,0.00085506646,0.00032949974],"domain_scores_gemma":[0.9934143,0.0036594456,0.00045349365,0.0012461519,0.0011070056,0.00011961031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010530334,0.0010006994,0.0012498326,0.0011408046,0.00063618453,0.001158824,0.00091681065,0.0012359415,0.0029548807],"category_scores_gemma":[0.009770764,0.00049152924,0.0006564551,0.0012727318,0.00090594875,0.0024004984,0.0022215587,0.0021774098,0.001731608],"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.0010778875,0.00013939392,0.0016216987,0.000402902,0.00011467226,0.0007970433,0.00063070736,0.30962512,0.0813033,0.25418055,0.0128471935,0.33725953],"study_design_scores_gemma":[0.0000713189,0.00010174279,0.00043358436,0.000056258104,0.00002474244,0.00037426568,0.000057727993,0.81284255,0.040313154,0.13780473,0.007871339,0.000048549904],"about_ca_topic_score_codex":0.0022855394,"about_ca_topic_score_gemma":0.0026234577,"teacher_disagreement_score":0.0029548807,"about_ca_system_score_codex":0.0010485847,"about_ca_system_score_gemma":0.0013201395,"threshold_uncertainty_score":0.009885013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2661381,0.0040087807,0.62138534,0.004681694,0.00031232624,0.0001977502,0.0017071081,0.00067696616,0.10089189],"genre_scores_gemma":[0.9518627,0.0015867235,0.039966613,0.00032697458,0.0004665764,0.0003089127,0.000492758,0.00022025134,0.0047683627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961015,0.0008054102,0.00016879127,0.0006271668,0.0015325568,0.000764725],"domain_scores_gemma":[0.97811174,0.015937552,0.001401161,0.0023826368,0.0013581372,0.0008087595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021869005,0.0012944438,0.0014285239,0.002777332,0.0016339903,0.004101865,0.0025047828,0.001848068,0.00835389],"category_scores_gemma":[0.015753707,0.00051623245,0.0013703313,0.0026726564,0.0051308684,0.011849709,0.0043164277,0.00578174,0.00070682715],"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.000044396813,0.000038454316,0.00023842115,0.00008671153,0.000014092501,0.00004860928,0.00016664778,0.03395064,0.0018497076,0.95824,0.0010461927,0.004276055],"study_design_scores_gemma":[0.000008429088,0.000018691351,0.00020991647,0.000024583804,0.000010749152,0.000066014545,0.00004906884,0.1277011,0.0014198757,0.868727,0.0017323124,0.000032381373],"about_ca_topic_score_codex":0.0012408113,"about_ca_topic_score_gemma":0.0009655695,"teacher_disagreement_score":0.00835389,"about_ca_system_score_codex":0.003475645,"about_ca_system_score_gemma":0.0013194706,"threshold_uncertainty_score":0.027946532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36100143,0.0019244953,0.59999937,0.004549005,0.00013161915,0.00027095058,0.0041029416,0.00094853126,0.027071731],"genre_scores_gemma":[0.8868568,0.0016809813,0.100046836,0.00073350884,0.0003785995,0.00037818594,0.003453084,0.00024482622,0.006227175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983197,0.00035312414,0.00011445941,0.00047380372,0.0004843802,0.00025446806],"domain_scores_gemma":[0.978696,0.017990636,0.0009340139,0.0013944978,0.00051472057,0.0004700348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823379,0.0010370179,0.0013174396,0.0011377188,0.0015452126,0.0033776572,0.0024700956,0.0017822651,0.004214147],"category_scores_gemma":[0.012386491,0.00075755885,0.0013926432,0.0017410043,0.0025044195,0.006966721,0.0029418685,0.003461331,0.00061199587],"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.0013344268,0.00064855587,0.009261091,0.0021031634,0.00038354803,0.0012086318,0.0019405687,0.46175206,0.02224635,0.39000127,0.023101127,0.08601912],"study_design_scores_gemma":[0.00012313836,0.00012208679,0.0018448777,0.0000858793,0.00008703509,0.0006647509,0.000340521,0.44449532,0.006916721,0.5401268,0.0051326444,0.00006027284],"about_ca_topic_score_codex":0.0013856831,"about_ca_topic_score_gemma":0.0011976555,"teacher_disagreement_score":0.004214147,"about_ca_system_score_codex":0.0013885068,"about_ca_system_score_gemma":0.0010884125,"threshold_uncertainty_score":0.014097691},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476945,0.001125032,0.95371985,0.0002817068,0.00009524744,0.00007490395,0.000312045,0.00037087445,0.009250854],"genre_scores_gemma":[0.5665189,0.0040553045,0.41708127,0.0007664707,0.0003852614,0.00066866755,0.0012395008,0.00082678633,0.008457773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990037,0.00022912999,0.00006821603,0.00025866157,0.00031619123,0.00012404424],"domain_scores_gemma":[0.9926918,0.0048146225,0.0005555036,0.0011276741,0.0005432003,0.00026720492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009656598,0.0015861992,0.0010836372,0.002480525,0.00097466353,0.0013476901,0.001732929,0.0011958885,0.0029519014],"category_scores_gemma":[0.009407314,0.0008135766,0.001419414,0.0017579542,0.0023357638,0.0033676706,0.0037306673,0.0039618863,0.0008891633],"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.00014228551,0.00011956029,0.0017619595,0.0005775179,0.000097641554,0.00048211985,0.00061540754,0.1824327,0.035360683,0.7160683,0.0054449136,0.056896858],"study_design_scores_gemma":[0.000022631579,0.00017989235,0.0010362806,0.00013632055,0.000080629805,0.0006210037,0.00014740933,0.44568607,0.01937321,0.52001363,0.012612329,0.00009056793],"about_ca_topic_score_codex":0.00090783986,"about_ca_topic_score_gemma":0.0013353634,"teacher_disagreement_score":0.0029519014,"about_ca_system_score_codex":0.0011351369,"about_ca_system_score_gemma":0.00068307616,"threshold_uncertainty_score":0.009875059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122666225,0.0005231473,0.87059784,0.0003542336,0.00004753914,0.00007828168,0.00016633952,0.00021594256,0.005350419],"genre_scores_gemma":[0.8820146,0.0006588071,0.112995245,0.00015029978,0.00009272426,0.00012992657,0.00020125284,0.000056379085,0.0037007947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.00026121343,0.000034213066,0.00007045411,0.0002465461,0.00012839246],"domain_scores_gemma":[0.99496007,0.0028659515,0.00069322775,0.00051642535,0.0007609472,0.00020326507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010389512,0.00060671085,0.00038950602,0.00054383575,0.00045642816,0.0007625271,0.0006308411,0.0005565741,0.0016035226],"category_scores_gemma":[0.005974955,0.00023690276,0.00030173908,0.0007034437,0.001104877,0.0015851039,0.0011630446,0.0011173801,0.00026795143],"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.0002573,0.00006418046,0.0007797238,0.000118778815,0.000023438686,0.00020918623,0.0001758921,0.52440953,0.0124714775,0.4169092,0.0017894858,0.042791765],"study_design_scores_gemma":[0.000014144329,0.000081428545,0.00013777342,0.000014416769,0.0000054452576,0.00012221005,0.000031695112,0.91715133,0.0032082212,0.078265354,0.0009488826,0.000019065685],"about_ca_topic_score_codex":0.0013983527,"about_ca_topic_score_gemma":0.0013795977,"teacher_disagreement_score":0.0016035226,"about_ca_system_score_codex":0.00080378406,"about_ca_system_score_gemma":0.001082562,"threshold_uncertainty_score":0.0058318973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14915904,0.0022521026,0.80647945,0.0006839421,0.0000897278,0.00008410766,0.00036215005,0.0007271055,0.04016244],"genre_scores_gemma":[0.95547575,0.0013286083,0.036698222,0.00015384832,0.000111510984,0.00018992463,0.0002511808,0.0002343237,0.005556578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980432,0.000718727,0.00006640706,0.00018345374,0.0006491984,0.00033891932],"domain_scores_gemma":[0.98483026,0.011005335,0.001547383,0.00096753007,0.0013487792,0.0003006954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030743408,0.0014572144,0.0009035664,0.001192756,0.00057892624,0.0018953633,0.0012962531,0.0010644281,0.0039924867],"category_scores_gemma":[0.021339774,0.0005731906,0.0006077144,0.0008275081,0.0029981849,0.0032945746,0.0025971802,0.0020007286,0.0012424694],"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.00037469767,0.00012441423,0.0018080842,0.0004952599,0.0000633608,0.00043373267,0.00053711934,0.48896208,0.016362911,0.46516338,0.001973816,0.023701048],"study_design_scores_gemma":[0.00001775395,0.0000911201,0.00068261725,0.00011096134,0.00002155024,0.0003908224,0.000107046835,0.87475234,0.0105095925,0.1123244,0.0009316028,0.000060280156],"about_ca_topic_score_codex":0.00061576435,"about_ca_topic_score_gemma":0.00041182965,"teacher_disagreement_score":0.0039924867,"about_ca_system_score_codex":0.0012164059,"about_ca_system_score_gemma":0.0007989826,"threshold_uncertainty_score":0.016258895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28985417,0.0016804299,0.67488265,0.005584951,0.00032238354,0.00041410953,0.001350754,0.000622882,0.025287556],"genre_scores_gemma":[0.92003584,0.00090536213,0.0678421,0.00034665535,0.00022990242,0.0005407512,0.00070836284,0.00037038175,0.0090207495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99350935,0.0021995273,0.00034481718,0.0009251202,0.0019439735,0.0010771987],"domain_scores_gemma":[0.9616837,0.030506585,0.0014287962,0.0029534197,0.0020345612,0.001392996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004656659,0.0010022752,0.0016070756,0.00093220687,0.0009546221,0.0028532096,0.0032907375,0.00222308,0.008816279],"category_scores_gemma":[0.037270263,0.0007686005,0.00073767913,0.0015628671,0.0018152741,0.0059430213,0.0025370691,0.0025085588,0.00087424647],"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.0027667717,0.00035794268,0.00269462,0.0008297999,0.00019196696,0.0006757385,0.00041538043,0.6078835,0.012851237,0.29562348,0.007079694,0.06862987],"study_design_scores_gemma":[0.00009828021,0.0002760825,0.0012671908,0.000059831567,0.000060501065,0.0003297969,0.00017478903,0.864462,0.00413233,0.12710303,0.0019851464,0.000050899893],"about_ca_topic_score_codex":0.0012000598,"about_ca_topic_score_gemma":0.0008864876,"teacher_disagreement_score":0.008816279,"about_ca_system_score_codex":0.0039842203,"about_ca_system_score_gemma":0.0025819195,"threshold_uncertainty_score":0.029493392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15718986,0.0006319113,0.82461315,0.0015655421,0.0001057252,0.00008307643,0.00035905722,0.0002793895,0.01517234],"genre_scores_gemma":[0.9622081,0.000609891,0.032846395,0.00022566831,0.00010543083,0.00012794854,0.0001260686,0.000052673982,0.0036978165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996738,0.0014442088,0.00012706814,0.0005075348,0.0007075176,0.00047559637],"domain_scores_gemma":[0.9911204,0.006821345,0.00052756723,0.0009118406,0.00048003398,0.000138793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027516505,0.0008219798,0.0012292648,0.00070835825,0.00093769736,0.0020658632,0.001190436,0.0018338803,0.0027290026],"category_scores_gemma":[0.007880956,0.0004896771,0.0006993555,0.0009772326,0.0029673863,0.0052646813,0.00325926,0.0019206904,0.0005035033],"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.00029419002,0.00003910201,0.00030258775,0.0002585046,0.00006153593,0.00049466523,0.0002615742,0.15250696,0.0062296814,0.8275782,0.0011661547,0.010806862],"study_design_scores_gemma":[0.000048022343,0.000071610484,0.00011308451,0.000045019893,0.000021474381,0.00016882307,0.00007569702,0.5867571,0.005529713,0.40598324,0.0011384251,0.000047722115],"about_ca_topic_score_codex":0.00067569246,"about_ca_topic_score_gemma":0.0003860822,"teacher_disagreement_score":0.0027516505,"about_ca_system_score_codex":0.0012678251,"about_ca_system_score_gemma":0.0010887354,"threshold_uncertainty_score":0.014552295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44339246,0.00046885028,0.5451677,0.00026454875,0.00003491342,0.000060137038,0.0002773666,0.0004914699,0.009842498],"genre_scores_gemma":[0.9658939,0.00032320284,0.030492881,0.00009921364,0.000053317763,0.00010892736,0.000283167,0.00012089468,0.0026244298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998379,0.0005239554,0.00007152859,0.00021876002,0.00049329986,0.0003134815],"domain_scores_gemma":[0.9934076,0.0038484698,0.00066725165,0.0006920573,0.00095658365,0.00042807756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384355,0.0006989084,0.0006127675,0.0023429752,0.000883141,0.001815307,0.0009801184,0.00089922576,0.0030969027],"category_scores_gemma":[0.012006592,0.0005267135,0.0006097962,0.0016895907,0.002041758,0.0037690448,0.0016451284,0.0012560723,0.00053086993],"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.0002886828,0.000084662395,0.004054108,0.00012167944,0.000029979194,0.00051186496,0.00042521892,0.08082452,0.01140888,0.8784008,0.0015405985,0.022308975],"study_design_scores_gemma":[0.00005446953,0.00018424485,0.0016541554,0.0000921034,0.000020524625,0.00076845457,0.00016801829,0.5854511,0.0141764,0.39396963,0.0033786392,0.00008220184],"about_ca_topic_score_codex":0.00075584376,"about_ca_topic_score_gemma":0.0005221957,"teacher_disagreement_score":0.0030969027,"about_ca_system_score_codex":0.0019531688,"about_ca_system_score_gemma":0.0011108546,"threshold_uncertainty_score":0.014171302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14201303,0.0009097466,0.62704825,0.0009023308,0.00049659866,0.00028862953,0.0037644906,0.0018845327,0.22269246],"genre_scores_gemma":[0.58337015,0.0010567366,0.351738,0.0008464057,0.0002469241,0.0005042209,0.0048381016,0.0005203045,0.056879137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992384,0.000108183005,0.000058755068,0.00018687162,0.00025582177,0.0001519396],"domain_scores_gemma":[0.9988925,0.00025229124,0.00012320989,0.0003715482,0.0002704917,0.00008994606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042412,0.00055057934,0.0005115009,0.0010310669,0.0015658514,0.0018869783,0.0008708482,0.0005584682,0.012900942],"category_scores_gemma":[0.0017850703,0.00040680415,0.00096280634,0.001853609,0.0015734499,0.0021459544,0.0020153231,0.0011104192,0.0028324677],"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.00014102078,0.000033544216,0.0013388831,0.00013281351,0.000018780636,0.0003343196,0.00021388264,0.011936112,0.009920173,0.881083,0.015038015,0.07980948],"study_design_scores_gemma":[0.000038161717,0.00016745405,0.001574641,0.000074972406,0.000031827465,0.0018384067,0.00038589854,0.057699576,0.02462175,0.6933617,0.22010723,0.000098386445],"about_ca_topic_score_codex":0.001930622,"about_ca_topic_score_gemma":0.0024509355,"teacher_disagreement_score":0.012900942,"about_ca_system_score_codex":0.0009064444,"about_ca_system_score_gemma":0.0010258699,"threshold_uncertainty_score":0.043157995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1885298,0.00043181868,0.79019684,0.00083685084,0.000045363242,0.00021592776,0.00063394767,0.00032906563,0.01878039],"genre_scores_gemma":[0.89562297,0.0004953692,0.09731001,0.00014202937,0.00006237375,0.00025957506,0.000520983,0.0001914651,0.0053952606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.0001922027,0.000025075835,0.00012586942,0.00022026588,0.00019898586],"domain_scores_gemma":[0.9964223,0.0024299829,0.00038192575,0.00023680861,0.000358227,0.00017076395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010503978,0.0006962373,0.0010131708,0.000612971,0.00066757976,0.0017911232,0.0013263703,0.0013321006,0.004050512],"category_scores_gemma":[0.010109118,0.0005122247,0.00048690313,0.0011498963,0.0011627626,0.0016881204,0.0009912371,0.0008652981,0.00043217538],"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.00016548552,0.000064564105,0.00058384216,0.00012394588,0.000020873982,0.00015365938,0.000117207994,0.91805345,0.0043031555,0.062284734,0.0026215306,0.011507459],"study_design_scores_gemma":[0.000009178341,0.000020696241,0.00012364496,0.0000093094895,0.000004008531,0.000039562594,0.00002572181,0.98226285,0.0007749649,0.016342008,0.00038215768,0.0000059240556],"about_ca_topic_score_codex":0.0050050337,"about_ca_topic_score_gemma":0.0035155637,"teacher_disagreement_score":0.0050050337,"about_ca_system_score_codex":0.0032274965,"about_ca_system_score_gemma":0.002019034,"threshold_uncertainty_score":0.023417294},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5134217,0.0045163915,0.41433308,0.001933986,0.00020273401,0.00008662607,0.0005864261,0.0006836775,0.06423539],"genre_scores_gemma":[0.96857107,0.00076338835,0.026335832,0.00027695225,0.00017375036,0.00010910132,0.00031450848,0.000102443526,0.003353014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976266,0.0006413932,0.0001303766,0.0003104423,0.00089146633,0.0003997476],"domain_scores_gemma":[0.98917764,0.006987289,0.0009908518,0.0013092712,0.00094771176,0.0005872182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017323096,0.0007703831,0.0010939826,0.0017101495,0.0011526461,0.0015712566,0.0014566816,0.0014440956,0.0026567413],"category_scores_gemma":[0.011550602,0.0005488793,0.000688716,0.0007370608,0.002427525,0.0031331645,0.0028217083,0.0024659166,0.0006312197],"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.00022165987,0.00005512538,0.0015873801,0.00028499175,0.000044333116,0.00038835665,0.0003966012,0.053419437,0.010413014,0.91033095,0.0024092488,0.020448914],"study_design_scores_gemma":[0.000024752711,0.00012764159,0.00090072537,0.00006661813,0.000020633792,0.00040149293,0.000060610175,0.33132443,0.004257873,0.6602789,0.0024853728,0.00005078752],"about_ca_topic_score_codex":0.00047309787,"about_ca_topic_score_gemma":0.0003101909,"teacher_disagreement_score":0.0026567413,"about_ca_system_score_codex":0.0011708835,"about_ca_system_score_gemma":0.0006753445,"threshold_uncertainty_score":0.009161413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10313584,0.0009852087,0.89049715,0.0010799824,0.000082076804,0.000059332902,0.00011900653,0.0005179305,0.0035234909],"genre_scores_gemma":[0.8965219,0.0003924368,0.09972532,0.00033119987,0.00015920177,0.00015576753,0.00021871047,0.00011298369,0.0023823627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979634,0.00084318104,0.000104087536,0.00041541966,0.00030668743,0.00036722244],"domain_scores_gemma":[0.98477304,0.012106943,0.00088278,0.0012419294,0.0006548272,0.00034045646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00402592,0.0007020396,0.0018209969,0.0011588356,0.0007913332,0.0015132553,0.0021416172,0.0020244014,0.0021627643],"category_scores_gemma":[0.025724223,0.0005750648,0.00063620304,0.0011409194,0.004209407,0.0036962335,0.003889105,0.002218428,0.00032047878],"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.0002078001,0.000101503894,0.00079786096,0.00015942389,0.000047694757,0.00008767967,0.00015907656,0.66364044,0.0013654851,0.2864675,0.0013067087,0.04565879],"study_design_scores_gemma":[0.000008054316,0.000013182203,0.00006951023,0.000006475325,0.0000032017635,0.000008633721,0.0000071275385,0.8961677,0.00031732486,0.10323924,0.00015275436,0.0000068134027],"about_ca_topic_score_codex":0.001527781,"about_ca_topic_score_gemma":0.0011236501,"teacher_disagreement_score":0.00402592,"about_ca_system_score_codex":0.0023899113,"about_ca_system_score_gemma":0.0013134693,"threshold_uncertainty_score":0.021291375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046302355,0.00017950009,0.99127394,0.00018190475,0.000021184404,0.000021989337,0.000046989702,0.0000731942,0.003571042],"genre_scores_gemma":[0.7279608,0.0014637302,0.25696018,0.00044079652,0.00022238324,0.00060381956,0.00027607064,0.000244192,0.011827931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993604,0.00026262127,0.000019433657,0.00006835887,0.00020621852,0.00008297939],"domain_scores_gemma":[0.99856156,0.0010097224,0.000116043455,0.00007182004,0.00019575398,0.00004514186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015422822,0.00090420985,0.0006200759,0.0007915255,0.0003365234,0.0012353036,0.0010958575,0.00075502164,0.002856067],"category_scores_gemma":[0.0039649624,0.00036000714,0.0007807706,0.00066654506,0.0017631534,0.0016693408,0.0010332636,0.0015032829,0.00050746044],"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.000025357678,0.000026632693,0.00013402717,0.000063383595,0.000022717606,0.000039512324,0.00006785206,0.26281843,0.0019161154,0.7214094,0.0012178252,0.012258805],"study_design_scores_gemma":[0.0000100454,0.000021959193,0.000053200456,0.000011828294,0.0000046132727,0.000018498478,0.000011036481,0.82522273,0.00047750724,0.17328374,0.0008708285,0.00001390912],"about_ca_topic_score_codex":0.0015885185,"about_ca_topic_score_gemma":0.00089209527,"teacher_disagreement_score":0.002856067,"about_ca_system_score_codex":0.0014622513,"about_ca_system_score_gemma":0.0014016083,"threshold_uncertainty_score":0.010609448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066199474,0.0003016152,0.9262267,0.000326111,0.000038895807,0.000066657754,0.00009126845,0.00029730913,0.0064518927],"genre_scores_gemma":[0.9398984,0.00034189655,0.055910144,0.00007069767,0.000040520157,0.0000939822,0.000105143205,0.00003300275,0.003506171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861515,0.00042213828,0.000044021497,0.00015786596,0.00054471695,0.00021609841],"domain_scores_gemma":[0.9968622,0.0017239193,0.0005046845,0.00043203394,0.00037808515,0.00009903899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012245983,0.00081836584,0.0006339364,0.0006753703,0.0005206976,0.0011369516,0.0009342813,0.0009159981,0.0011873352],"category_scores_gemma":[0.0039618975,0.00035930632,0.00048512465,0.0007296511,0.0018546176,0.0020869907,0.0022416958,0.0013671442,0.0004370337],"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.00032780456,0.00004234065,0.00041827958,0.00012832947,0.00004170422,0.00040278604,0.0002996848,0.7406043,0.024258194,0.20229681,0.0011732954,0.030006401],"study_design_scores_gemma":[0.000015552087,0.000074896394,0.00006594045,0.0000216982,0.00000859243,0.00008872774,0.000033746794,0.9616247,0.005945321,0.031499792,0.0005952552,0.000025732355],"about_ca_topic_score_codex":0.0015022634,"about_ca_topic_score_gemma":0.001150352,"teacher_disagreement_score":0.0015022634,"about_ca_system_score_codex":0.0012618924,"about_ca_system_score_gemma":0.0011057137,"threshold_uncertainty_score":0.009155691},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252756,0.00040432785,0.46910864,0.00034372258,0.00004336845,0.000063391446,0.0004531024,0.0007570852,0.00355075],"genre_scores_gemma":[0.87639266,0.00031805906,0.120882556,0.00006762477,0.00006417679,0.000087334134,0.0006421171,0.0001140653,0.001431521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.0002380219,0.000044980487,0.00021393174,0.00020997948,0.00010948511],"domain_scores_gemma":[0.9907611,0.0065293172,0.00102294,0.0008560191,0.00047053286,0.00036011764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011263996,0.0008127689,0.000769069,0.0042226496,0.0007559666,0.0011100951,0.00094937265,0.00086324994,0.0012410725],"category_scores_gemma":[0.016691128,0.0004371827,0.00044997357,0.0026387875,0.0018465451,0.0029749575,0.0012370981,0.0007159451,0.00030382499],"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.0008829296,0.00024236653,0.031365264,0.00018318546,0.00014993313,0.0004233124,0.0005047616,0.6199418,0.01872977,0.16485663,0.002982203,0.15973796],"study_design_scores_gemma":[0.000017473465,0.000043756565,0.0020612774,0.000016133305,0.000009422344,0.00015333414,0.000041061805,0.899226,0.002966929,0.09498166,0.0004598145,0.000023140105],"about_ca_topic_score_codex":0.0029652554,"about_ca_topic_score_gemma":0.0036645841,"teacher_disagreement_score":0.0042226496,"about_ca_system_score_codex":0.0008642927,"about_ca_system_score_gemma":0.0007748381,"threshold_uncertainty_score":0.006270945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030610668,0.0011976019,0.9597941,0.00037661724,0.000113158676,0.00006284069,0.00004437989,0.00013775751,0.0076628393],"genre_scores_gemma":[0.8082683,0.0017371265,0.18351823,0.00027900003,0.00012883243,0.00016883164,0.00009483774,0.00009266663,0.0057121986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991906,0.00028078683,0.000019320856,0.00008277877,0.00037580242,0.000050750117],"domain_scores_gemma":[0.9984659,0.0010365419,0.00011624378,0.00020387121,0.00014350822,0.000033923687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717853,0.0008320735,0.0006730391,0.00033895927,0.0004953192,0.0011046771,0.00070492737,0.0009843042,0.0024986858],"category_scores_gemma":[0.0038388,0.00024096819,0.00028459934,0.00072106713,0.00091633067,0.001144325,0.0012948638,0.0011824798,0.0005127743],"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.0001862022,0.0001021498,0.0007345036,0.00055433094,0.000057760615,0.00038760994,0.0003222443,0.38762614,0.028280683,0.5063201,0.0021627548,0.073265426],"study_design_scores_gemma":[0.000015994077,0.0001301794,0.00019568614,0.000028238079,0.000025262892,0.00020915718,0.000039622963,0.8474824,0.012123148,0.13402766,0.005702316,0.000020238665],"about_ca_topic_score_codex":0.0006007614,"about_ca_topic_score_gemma":0.000639224,"teacher_disagreement_score":0.0024986858,"about_ca_system_score_codex":0.0007214301,"about_ca_system_score_gemma":0.0006211264,"threshold_uncertainty_score":0.008358955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30315632,0.00071514637,0.668018,0.0003670944,0.00004926533,0.00011160159,0.0007682524,0.00035953033,0.026454829],"genre_scores_gemma":[0.9853977,0.00026939745,0.012676083,0.000051706305,0.000027490069,0.00010226812,0.00013993145,0.000034428977,0.0013009424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833775,0.00040661474,0.00006374169,0.00021259492,0.0005005347,0.00047862882],"domain_scores_gemma":[0.9897054,0.006820176,0.0010142107,0.0010800002,0.0011356472,0.00024454546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014648387,0.0005778238,0.00079767575,0.0010661646,0.00058890675,0.0017358656,0.0011088485,0.0006615606,0.002862529],"category_scores_gemma":[0.007860908,0.00034212103,0.0006996025,0.0010097029,0.002338492,0.0024263058,0.0016039464,0.0010667924,0.00046829417],"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.00033139446,0.00006623258,0.0009865139,0.00019381626,0.000049154627,0.00031598672,0.00025339084,0.36775696,0.012748746,0.6043731,0.001213323,0.011711385],"study_design_scores_gemma":[0.000038817325,0.000079436795,0.00050434744,0.000026561649,0.000020053454,0.0002851942,0.00008880664,0.77453965,0.009379892,0.21371308,0.0012634897,0.000060677354],"about_ca_topic_score_codex":0.0018289933,"about_ca_topic_score_gemma":0.0007810758,"teacher_disagreement_score":0.002862529,"about_ca_system_score_codex":0.0014661261,"about_ca_system_score_gemma":0.001328841,"threshold_uncertainty_score":0.010637522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09733235,0.0015143782,0.8863387,0.0010097583,0.00012546945,0.00011252051,0.0007909412,0.00052520056,0.012250688],"genre_scores_gemma":[0.8790786,0.0013032323,0.108124025,0.00046284523,0.00034060358,0.00026160324,0.0007737953,0.00035181048,0.009303506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957722,0.001202192,0.00027025817,0.0009721833,0.0013054986,0.00047761376],"domain_scores_gemma":[0.9835987,0.008294536,0.0019606866,0.0036932959,0.0016728169,0.00077980757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042786454,0.0014261296,0.0015533876,0.0033183189,0.0012888839,0.0040699868,0.0018836681,0.0020345643,0.0042986963],"category_scores_gemma":[0.020632928,0.00088035123,0.0013808768,0.0021264248,0.004781177,0.008273957,0.003073305,0.0030294217,0.00085002976],"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.00010586795,0.000043295742,0.0007830606,0.00014339897,0.00008128192,0.00011983284,0.0002006103,0.05670266,0.0035115134,0.92285633,0.0012083255,0.014243809],"study_design_scores_gemma":[0.000010645268,0.00008803856,0.0009928355,0.000045715555,0.000028333667,0.00012049039,0.000060453855,0.2084835,0.002192508,0.78533477,0.0025787076,0.00006409207],"about_ca_topic_score_codex":0.0009833187,"about_ca_topic_score_gemma":0.0006299167,"teacher_disagreement_score":0.0042986963,"about_ca_system_score_codex":0.0027265237,"about_ca_system_score_gemma":0.0011438401,"threshold_uncertainty_score":0.02262789},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021261894,0.0001591759,0.9930235,0.00018733964,0.000020864307,0.000024068135,0.00003114565,0.00008917037,0.0043385536],"genre_scores_gemma":[0.46270588,0.001174195,0.52575064,0.00045175443,0.00026791487,0.00038781462,0.00016127029,0.00026994338,0.008830615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960679,0.001508969,0.00018638691,0.0005651668,0.0013676665,0.00030391116],"domain_scores_gemma":[0.99299943,0.004545814,0.0004421585,0.0009877314,0.0008335077,0.00019142113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039460068,0.0014653411,0.0012918451,0.0013795149,0.0011029826,0.0027249102,0.0024328423,0.001553872,0.0033371544],"category_scores_gemma":[0.012275605,0.0007426215,0.0012830757,0.0014666085,0.0038110763,0.005519886,0.0036519591,0.0037194744,0.00097387534],"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.000052898456,0.000022390095,0.00009690752,0.0000589042,0.000017631835,0.00007584866,0.00011411539,0.09188347,0.0015900162,0.8927175,0.00065086666,0.012719426],"study_design_scores_gemma":[0.000014370565,0.00005144717,0.000029430968,0.000024925721,0.000014809664,0.00016793996,0.000024663372,0.4813358,0.0028872048,0.51167494,0.0037444162,0.000030173647],"about_ca_topic_score_codex":0.0013093693,"about_ca_topic_score_gemma":0.0011646599,"teacher_disagreement_score":0.0039460068,"about_ca_system_score_codex":0.0023596382,"about_ca_system_score_gemma":0.0019662664,"threshold_uncertainty_score":0.020868719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043066437,0.00019144225,0.99359787,0.00016844283,0.000038842885,0.000027830427,0.00003625811,0.00023847833,0.0013941602],"genre_scores_gemma":[0.5782616,0.00040974372,0.41721222,0.00029354024,0.000087230655,0.00018532024,0.00018085199,0.000073294694,0.0032961941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709105,0.0010544147,0.00010761298,0.00032051463,0.0012648137,0.00016163003],"domain_scores_gemma":[0.99777114,0.0009570073,0.00024348844,0.00038117706,0.0005458844,0.00010133753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019817245,0.0006468136,0.0013777319,0.0007351727,0.00057285797,0.0012415709,0.0021506085,0.0013021365,0.0016987919],"category_scores_gemma":[0.004627732,0.0003805963,0.00068374735,0.001079882,0.0015788999,0.0017935963,0.002381503,0.0019453225,0.0010389849],"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.0003838253,0.00009382429,0.00030689163,0.00017440775,0.00007398995,0.00020622011,0.00013430981,0.6872422,0.02438309,0.18835536,0.0021302977,0.09651552],"study_design_scores_gemma":[0.000032849795,0.000044749275,0.000019539633,0.000007963401,0.0000054182865,0.000052531235,0.000006666195,0.98334193,0.0029073628,0.012737663,0.00082228455,0.000021009719],"about_ca_topic_score_codex":0.0014461722,"about_ca_topic_score_gemma":0.0009667538,"teacher_disagreement_score":0.0021506085,"about_ca_system_score_codex":0.0013051889,"about_ca_system_score_gemma":0.0013309048,"threshold_uncertainty_score":0.0104804635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002626166,0.00006044134,0.9949426,0.000101713704,0.00003581031,0.0000627719,0.000057043377,0.0010887127,0.0010247085],"genre_scores_gemma":[0.14598429,0.00009969564,0.85016483,0.0001261874,0.0000782185,0.00038916303,0.00029724956,0.0003043645,0.002555936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860543,0.0002958891,0.00007333441,0.00033416963,0.0005290764,0.00016217343],"domain_scores_gemma":[0.9964079,0.00211501,0.00017026112,0.000566016,0.0006454171,0.00009531084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012886383,0.0011620384,0.00082114176,0.0012922481,0.0007860317,0.0013062173,0.002370784,0.0014424868,0.006775147],"category_scores_gemma":[0.009159772,0.0005513986,0.0008790306,0.0009821319,0.0012828454,0.001825817,0.0016938637,0.0027469585,0.0017100484],"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.00031288198,0.00019684539,0.00084206514,0.00019943203,0.00009902927,0.00014442779,0.00016214591,0.49918297,0.010273285,0.17026958,0.0069641885,0.31135315],"study_design_scores_gemma":[0.000030059082,0.000017648743,0.00007047954,0.000008693409,0.000005392191,0.000027889091,0.000006082421,0.97201693,0.0025384421,0.024196312,0.0010675113,0.00001463442],"about_ca_topic_score_codex":0.0047125863,"about_ca_topic_score_gemma":0.005278426,"teacher_disagreement_score":0.006775147,"about_ca_system_score_codex":0.0019136673,"about_ca_system_score_gemma":0.0028034972,"threshold_uncertainty_score":0.022665083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10185552,0.0017694004,0.8103248,0.0014589009,0.000171325,0.00009708977,0.0031508051,0.000441643,0.08073053],"genre_scores_gemma":[0.9347873,0.0022980098,0.04891643,0.0003147676,0.00030442694,0.0003072119,0.0013361154,0.00021416802,0.01152158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970797,0.0007996915,0.00016648868,0.0005817613,0.0008455493,0.0005267814],"domain_scores_gemma":[0.99250424,0.004416357,0.0004905365,0.0011745417,0.0011563055,0.00025803913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019229541,0.00087333395,0.0009004908,0.0016091557,0.0007989302,0.0026711368,0.002081752,0.0010618642,0.010457509],"category_scores_gemma":[0.009645753,0.00045734667,0.0007983578,0.0013504281,0.0024424838,0.0052155694,0.002265349,0.0014893833,0.0013349792],"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.000061582476,0.000016899718,0.00035626677,0.00016837133,0.000035525245,0.00008957608,0.000111478286,0.033837162,0.00341346,0.94931716,0.0021723504,0.010420194],"study_design_scores_gemma":[0.00001751285,0.00004021249,0.0006290747,0.00008140944,0.00003108094,0.00038977526,0.000071508024,0.1315472,0.0048131994,0.85325897,0.009060879,0.00005925239],"about_ca_topic_score_codex":0.0007628196,"about_ca_topic_score_gemma":0.00046765534,"teacher_disagreement_score":0.010457509,"about_ca_system_score_codex":0.0017061993,"about_ca_system_score_gemma":0.0013217574,"threshold_uncertainty_score":0.034983873},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29766282,0.00044083205,0.69200647,0.00049216236,0.00007578713,0.000105788604,0.0009583696,0.0016297564,0.006628048],"genre_scores_gemma":[0.6807912,0.00048014478,0.31199005,0.00021638795,0.00013578935,0.00023835684,0.0022663644,0.00031903398,0.0035626537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989667,0.00027240498,0.00006403478,0.00027752377,0.00029150498,0.00012780583],"domain_scores_gemma":[0.9917303,0.0055229054,0.0008867935,0.00080153864,0.00060152705,0.00045695476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012060106,0.0011568883,0.00092690747,0.004563325,0.00084154424,0.001679135,0.0016344034,0.0013027355,0.0034911395],"category_scores_gemma":[0.014683676,0.00057297404,0.00076718745,0.0029189568,0.00205815,0.004758882,0.001628559,0.0011015733,0.0011542635],"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.0011155948,0.00048167937,0.02350141,0.00044844628,0.0002154824,0.00043636747,0.0006193158,0.43672976,0.024809578,0.26367062,0.008874979,0.23909679],"study_design_scores_gemma":[0.000028891653,0.00005742433,0.0013137279,0.000028638995,0.000011393773,0.00011687447,0.000062477186,0.8330448,0.0038477813,0.16060114,0.00085272203,0.000034101045],"about_ca_topic_score_codex":0.0033254577,"about_ca_topic_score_gemma":0.0046532503,"teacher_disagreement_score":0.004563325,"about_ca_system_score_codex":0.0009929021,"about_ca_system_score_gemma":0.0010763971,"threshold_uncertainty_score":0.011678994},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07060618,0.0012504793,0.90719646,0.0022938892,0.00013718661,0.00011953232,0.00026959463,0.000578173,0.017548567],"genre_scores_gemma":[0.89462894,0.0011391721,0.09882237,0.00069534994,0.00024907695,0.00046615142,0.00027334967,0.00020434712,0.003521228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99182785,0.0027444747,0.00034184754,0.001408764,0.0024989296,0.0011781767],"domain_scores_gemma":[0.9633973,0.025389858,0.0022956645,0.0055477573,0.002323956,0.0010454382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067604207,0.0010694574,0.0018386276,0.0012445078,0.0022087512,0.0038488368,0.0028171437,0.0023186323,0.0035200112],"category_scores_gemma":[0.034488726,0.0009541651,0.0011554494,0.0015823367,0.004568234,0.0081853,0.0066136946,0.004360359,0.0008893133],"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.0005215154,0.0001406648,0.00056483876,0.00035393354,0.000059645517,0.00021797935,0.00057292334,0.2150041,0.011194468,0.7326143,0.004383739,0.03437188],"study_design_scores_gemma":[0.000042802345,0.000089570814,0.00019385396,0.000052084655,0.00001974382,0.00019276737,0.00011875488,0.55748975,0.005815223,0.4333153,0.0026212214,0.000048889877],"about_ca_topic_score_codex":0.0009981352,"about_ca_topic_score_gemma":0.0006075543,"teacher_disagreement_score":0.0067604207,"about_ca_system_score_codex":0.00278423,"about_ca_system_score_gemma":0.002241188,"threshold_uncertainty_score":0.035752952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5150932,0.002313522,0.4004045,0.0013078382,0.0004935758,0.000111773035,0.00038264602,0.00060361036,0.07928918],"genre_scores_gemma":[0.90452206,0.0010290629,0.06973554,0.00035120788,0.00025191082,0.00024245559,0.0004542268,0.00014585516,0.023267753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991455,0.00018827217,0.000065189466,0.00019782418,0.00024013185,0.00016309689],"domain_scores_gemma":[0.99761605,0.0010559553,0.000479984,0.00028318327,0.00026721196,0.00029765192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088266644,0.00067588984,0.00036960177,0.0020953813,0.0015215288,0.0016856511,0.00078759843,0.0008788317,0.005886948],"category_scores_gemma":[0.0044951076,0.00053267385,0.0005229623,0.0010169555,0.0021061723,0.0041635544,0.0017057209,0.0012895297,0.0008240376],"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.00007786589,0.000021125457,0.000837023,0.00006177542,0.000008009026,0.0003883864,0.00041377856,0.0023281928,0.005342076,0.9725352,0.0009819446,0.017004767],"study_design_scores_gemma":[0.000035916437,0.00016242352,0.0007491695,0.000105300234,0.000023613862,0.0013473302,0.00032141645,0.020230336,0.014053475,0.9303143,0.03258008,0.00007659739],"about_ca_topic_score_codex":0.00027549049,"about_ca_topic_score_gemma":0.00035140797,"teacher_disagreement_score":0.005886948,"about_ca_system_score_codex":0.001001722,"about_ca_system_score_gemma":0.00050741545,"threshold_uncertainty_score":0.019693792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24573398,0.00024673043,0.7455168,0.00020313017,0.00006980423,0.00011790652,0.00009498907,0.00032868274,0.0076878956],"genre_scores_gemma":[0.8272528,0.00022206536,0.16998512,0.00008414796,0.000022741227,0.0001612832,0.000098183235,0.000052958654,0.0021206862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997675,0.000063442494,0.000011210511,0.000047374113,0.00008934003,0.000021116795],"domain_scores_gemma":[0.9995598,0.00012566974,0.00006342859,0.00010034507,0.00010919031,0.000041570045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604338,0.00029764842,0.00026053892,0.00042856333,0.00040759452,0.00036855874,0.000560116,0.0005142054,0.0008433488],"category_scores_gemma":[0.00080823683,0.00019469393,0.00018807949,0.00043250964,0.0005526045,0.00047770128,0.0007422259,0.00049547927,0.0003113345],"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.00014839118,0.00011192825,0.0011840049,0.00023538711,0.00007361837,0.00036162286,0.00020581995,0.4132111,0.3230145,0.1975249,0.0010339747,0.06289475],"study_design_scores_gemma":[0.000024258807,0.00014861823,0.0003110824,0.000020765612,0.000022756898,0.00018546707,0.000022734404,0.89897895,0.06498041,0.03131951,0.0039564427,0.000029019597],"about_ca_topic_score_codex":0.0003555013,"about_ca_topic_score_gemma":0.0007326988,"teacher_disagreement_score":0.0008433488,"about_ca_system_score_codex":0.00030940934,"about_ca_system_score_gemma":0.0004400755,"threshold_uncertainty_score":0.0028212667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20024614,0.0034496356,0.70396703,0.002911442,0.00022101388,0.00019338857,0.0007928568,0.0012988498,0.08691958],"genre_scores_gemma":[0.87517613,0.0028821817,0.104156844,0.0004763759,0.00025838948,0.0004471439,0.0010134014,0.0004059569,0.015183526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812645,0.00033285157,0.00007994557,0.00024153446,0.00072428316,0.00049496687],"domain_scores_gemma":[0.9913446,0.0069678053,0.00028932633,0.00085294794,0.00043563364,0.000109736735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049709,0.00093908457,0.0006798769,0.00096847775,0.00072043354,0.0028460233,0.001433694,0.0010997264,0.0088827405],"category_scores_gemma":[0.010964489,0.0003880245,0.00080201175,0.0013878999,0.002104312,0.004115564,0.0016147807,0.0020742214,0.0011757895],"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.0005927265,0.00013371401,0.001214279,0.00040367316,0.000058260386,0.00025185652,0.00022899958,0.46180645,0.02089746,0.4166002,0.006132354,0.09168009],"study_design_scores_gemma":[0.000026942003,0.00009422049,0.00055724307,0.000056518144,0.000029308592,0.00020361527,0.000066507826,0.8564978,0.012837362,0.12622115,0.003373516,0.00003573629],"about_ca_topic_score_codex":0.0026547634,"about_ca_topic_score_gemma":0.0037109517,"teacher_disagreement_score":0.0088827405,"about_ca_system_score_codex":0.0025790464,"about_ca_system_score_gemma":0.0018908897,"threshold_uncertainty_score":0.029715717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010744739,0.00023318289,0.9858899,0.00047406857,0.000021317903,0.00007945505,0.00008653981,0.00013662058,0.0023341798],"genre_scores_gemma":[0.5959985,0.00054098107,0.39506176,0.00046879041,0.00024490125,0.0006196552,0.00046751753,0.00018321804,0.0064146635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898774,0.0056660175,0.00031545415,0.0013662083,0.0022131994,0.00056175963],"domain_scores_gemma":[0.9661736,0.027780898,0.0012320261,0.0028122559,0.0014821314,0.0005191176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00834985,0.0019657202,0.0026243676,0.0015473312,0.00087746244,0.0021518245,0.0041967463,0.002042138,0.0037018463],"category_scores_gemma":[0.028198622,0.00088000734,0.0012519475,0.0016307187,0.006615885,0.005963652,0.00505537,0.0041382536,0.0005953324],"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.0005818598,0.00015872323,0.0005041275,0.00037425614,0.00017206353,0.00038479987,0.00030856076,0.32003838,0.0040149833,0.6139224,0.0013393608,0.058200356],"study_design_scores_gemma":[0.000036889833,0.00013045745,0.00014104845,0.000026872653,0.000023310056,0.00007015043,0.000032885022,0.7522887,0.0043003485,0.24230596,0.0006143804,0.00002899075],"about_ca_topic_score_codex":0.00090093585,"about_ca_topic_score_gemma":0.000542702,"teacher_disagreement_score":0.00834985,"about_ca_system_score_codex":0.0028010563,"about_ca_system_score_gemma":0.0027290715,"threshold_uncertainty_score":0.044158757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91516227,0.0004282945,0.08022407,0.00020850486,0.000019633628,0.000021671141,0.00017352753,0.00021050604,0.0035514685],"genre_scores_gemma":[0.99206185,0.00016515584,0.006679317,0.000028060389,0.0000252713,0.000040586892,0.0002171655,0.000049284397,0.0007332644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991295,0.0002228129,0.000058353162,0.00020926168,0.0002572738,0.00012277985],"domain_scores_gemma":[0.99005437,0.005979039,0.0013922744,0.0010226433,0.0008868828,0.00066472485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013781965,0.00041325937,0.0006115888,0.001294717,0.00071530876,0.0010176934,0.0010333842,0.00077936496,0.0010511185],"category_scores_gemma":[0.013921401,0.00047039893,0.0005102149,0.0005926334,0.0019534251,0.0020992674,0.001374974,0.00088891375,0.00014790671],"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.0007106846,0.00024145466,0.056283295,0.0003298475,0.0002192881,0.0014057511,0.00067170407,0.5377399,0.072500885,0.30232993,0.0020042597,0.02556292],"study_design_scores_gemma":[0.000019347573,0.00010778888,0.008974389,0.000034120498,0.000039391136,0.00061231427,0.00010007001,0.9217582,0.010719934,0.057091426,0.00048346393,0.000059604958],"about_ca_topic_score_codex":0.00063616846,"about_ca_topic_score_gemma":0.00084090064,"teacher_disagreement_score":0.0013781965,"about_ca_system_score_codex":0.001168517,"about_ca_system_score_gemma":0.0005414542,"threshold_uncertainty_score":0.008478224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11331028,0.00046438564,0.87120134,0.00020556976,0.000042989857,0.000065208274,0.00020559054,0.0013407771,0.013163762],"genre_scores_gemma":[0.8740987,0.00047840565,0.11550383,0.00010022994,0.000060208582,0.00013528133,0.00034345177,0.00023115575,0.009048724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987721,0.00021199445,0.00007184415,0.00025258123,0.00042611646,0.00026545368],"domain_scores_gemma":[0.99754167,0.00067674153,0.0003941192,0.0007847109,0.00042885664,0.00017404932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007364503,0.00095081195,0.0006579308,0.0009272957,0.0006786777,0.0013390948,0.0011202429,0.00064989796,0.0026008997],"category_scores_gemma":[0.003808045,0.00033134338,0.0005521996,0.0010907504,0.0018468932,0.0020693217,0.0024148042,0.0011931106,0.000905462],"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.00042213747,0.00006630213,0.0007607875,0.00030760336,0.000049439546,0.0004437628,0.000530216,0.35202223,0.032658532,0.5057623,0.0031259556,0.1038507],"study_design_scores_gemma":[0.000044938708,0.0002185859,0.00034274824,0.00007684452,0.000052519183,0.00044161122,0.00017693693,0.72920823,0.046092324,0.21508354,0.008166568,0.00009509523],"about_ca_topic_score_codex":0.0020668455,"about_ca_topic_score_gemma":0.0021449008,"teacher_disagreement_score":0.0026008997,"about_ca_system_score_codex":0.001259128,"about_ca_system_score_gemma":0.0011903096,"threshold_uncertainty_score":0.009135723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14891297,0.0026539164,0.8254073,0.0011535824,0.0001268721,0.00009439004,0.00024223352,0.00049535156,0.02091334],"genre_scores_gemma":[0.9663857,0.0016865591,0.027997343,0.0001743563,0.00010213414,0.00014875659,0.000118983255,0.000113527996,0.003272534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977944,0.00068991876,0.00008675586,0.00023221478,0.00054975174,0.0006470619],"domain_scores_gemma":[0.98219335,0.013714955,0.001512961,0.000993337,0.0012306746,0.00035465183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040981304,0.0016360048,0.001414975,0.0011783363,0.0010475677,0.002311933,0.0017475229,0.0013695112,0.0022172504],"category_scores_gemma":[0.020245466,0.00059012265,0.001069595,0.0013488265,0.0038148018,0.003548083,0.0027496743,0.0022547226,0.0005301388],"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.00043190276,0.00011604972,0.00082163955,0.0003457548,0.000082770035,0.000361505,0.0004734167,0.60101235,0.0071577006,0.3649758,0.0020055524,0.022215534],"study_design_scores_gemma":[0.000019393496,0.00007789513,0.0002655768,0.00006170715,0.000036698366,0.00021869598,0.00014675483,0.8932886,0.0036115188,0.10151453,0.0007108132,0.000047741563],"about_ca_topic_score_codex":0.0019162365,"about_ca_topic_score_gemma":0.0017080967,"teacher_disagreement_score":0.0040981304,"about_ca_system_score_codex":0.0024966565,"about_ca_system_score_gemma":0.0016828304,"threshold_uncertainty_score":0.021673262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013991272,0.00017546995,0.97117627,0.00011444352,0.000098379045,0.00014552867,0.00012206675,0.0013210431,0.012855494],"genre_scores_gemma":[0.20236267,0.0003931058,0.78431785,0.00015381374,0.00006646586,0.00030238647,0.00033675935,0.00045474825,0.011612194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987791,0.0002487947,0.00015458625,0.00032180923,0.00035033116,0.00014548191],"domain_scores_gemma":[0.9987588,0.0004568812,0.000104348765,0.00031394698,0.00031140997,0.000054668613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014118301,0.0006552637,0.0005547154,0.0012537446,0.0011737484,0.0019009718,0.0014546335,0.00080479996,0.0058711637],"category_scores_gemma":[0.0037543254,0.00059131003,0.0010609864,0.000872713,0.0018451255,0.0028983736,0.0014215912,0.0013322269,0.002604342],"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.000079375044,0.000056616955,0.0002703245,0.00019568024,0.000015428315,0.00024560848,0.00043837674,0.014438929,0.010784489,0.8583751,0.0017588831,0.113341294],"study_design_scores_gemma":[0.00006888718,0.00021947279,0.00018213128,0.0001450441,0.000054096367,0.0005621566,0.00017845939,0.11563049,0.065171316,0.7422755,0.075388074,0.00012446905],"about_ca_topic_score_codex":0.0014772156,"about_ca_topic_score_gemma":0.0015915995,"teacher_disagreement_score":0.0058711637,"about_ca_system_score_codex":0.00088183174,"about_ca_system_score_gemma":0.0014173257,"threshold_uncertainty_score":0.019641042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074261494,0.0014538936,0.9077128,0.00052805594,0.000051923023,0.000120084725,0.00011365154,0.00015432453,0.015603842],"genre_scores_gemma":[0.94669366,0.0010766733,0.048042435,0.0001971147,0.00008988279,0.00012072626,0.000087962755,0.00002889202,0.0036626777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937326,0.00017047461,0.000022199258,0.00011165815,0.0002014973,0.00012099878],"domain_scores_gemma":[0.9987764,0.0007615605,0.00013737103,0.000090914626,0.0001823244,0.00005146842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333366,0.001122609,0.0006848524,0.0005349799,0.0004301477,0.0010674177,0.0007398898,0.0007380824,0.0016183408],"category_scores_gemma":[0.0026530987,0.00018691547,0.00039783004,0.00061457825,0.0011162588,0.001341461,0.0009664582,0.0008867727,0.00019796946],"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.00017075431,0.00006949629,0.00046419288,0.00015097785,0.00004563523,0.00043684762,0.00020160571,0.73586637,0.013298449,0.1967755,0.0016010234,0.0509192],"study_design_scores_gemma":[0.000016064509,0.000091085356,0.00015167947,0.000014457292,0.000015853988,0.00016372833,0.00004387993,0.9747434,0.002310531,0.021396767,0.0010366888,0.00001580767],"about_ca_topic_score_codex":0.0029858183,"about_ca_topic_score_gemma":0.0016553917,"teacher_disagreement_score":0.0029858183,"about_ca_system_score_codex":0.0015224026,"about_ca_system_score_gemma":0.00093625777,"threshold_uncertainty_score":0.011045873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44841057,0.0032470971,0.490907,0.0045127184,0.0001734208,0.00021109123,0.0013810531,0.001105777,0.05005132],"genre_scores_gemma":[0.93388677,0.001174635,0.050862342,0.0003769317,0.00013480992,0.00029280205,0.0008360028,0.00023463937,0.012200966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.0003100361,0.00004881687,0.00018983784,0.0004991304,0.0001698472],"domain_scores_gemma":[0.99282116,0.005991058,0.000345304,0.00036464378,0.0003820753,0.00009573048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008797382,0.0007812469,0.0005871827,0.000745965,0.00046805604,0.0016253167,0.0012580976,0.0008925569,0.00831791],"category_scores_gemma":[0.010589787,0.0004749894,0.0005091832,0.0010295582,0.0008405994,0.002576853,0.0008732283,0.0013051752,0.00072367385],"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.0006171369,0.00015988127,0.0031193746,0.0003713372,0.00009253746,0.0003276936,0.00013920922,0.7291299,0.019430699,0.1629987,0.00464023,0.078973204],"study_design_scores_gemma":[0.000040139264,0.000077069984,0.0007222484,0.000022476353,0.000023707566,0.000087567176,0.00002674683,0.93396944,0.0031564813,0.06087707,0.0009839092,0.000013107216],"about_ca_topic_score_codex":0.001932683,"about_ca_topic_score_gemma":0.003636975,"teacher_disagreement_score":0.00831791,"about_ca_system_score_codex":0.0025631348,"about_ca_system_score_gemma":0.0014737992,"threshold_uncertainty_score":0.02782619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040408745,0.0021339513,0.9180748,0.0018457052,0.00038685018,0.00012992878,0.00070760294,0.0010431089,0.035269376],"genre_scores_gemma":[0.6563102,0.004685204,0.3100886,0.0018893278,0.0010245421,0.00054343825,0.0026882612,0.0015511631,0.021219213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673176,0.00083469076,0.00011005501,0.00051698956,0.0012995461,0.0005070251],"domain_scores_gemma":[0.9797791,0.014734155,0.0008014118,0.0021742187,0.0017120736,0.0007991897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00406745,0.0025978656,0.0025781929,0.004143917,0.0022080338,0.003964889,0.0051969085,0.0025601245,0.01655997],"category_scores_gemma":[0.029179197,0.0010275411,0.0024055268,0.0036713977,0.0036216767,0.010789524,0.006853878,0.006151589,0.0035593605],"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.00044691362,0.00021209505,0.001897698,0.0004792452,0.0001423545,0.00026928534,0.00028249164,0.21926822,0.0026587246,0.69320256,0.018112855,0.06302751],"study_design_scores_gemma":[0.00003185855,0.00007601458,0.0002332219,0.00006767798,0.000042326323,0.00012177949,0.000068952366,0.53893787,0.0010875775,0.4556224,0.0036753258,0.000035070218],"about_ca_topic_score_codex":0.0032829987,"about_ca_topic_score_gemma":0.0039892267,"teacher_disagreement_score":0.01655997,"about_ca_system_score_codex":0.0029781035,"about_ca_system_score_gemma":0.0025568777,"threshold_uncertainty_score":0.055398583},"labels":[],"label_agreement":null},{"id":"W2963477777","doi":"10.1109/tit.2016.2554598","title":"ADMM LP Decoding of Non-Binary LDPC Codes in <inline-formula> <tex-math notation=\"LaTeX\">$ \\mathbb {F}_{2^{m}}$ </tex-math> </inline-formula>","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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041499464,0.00010197901,0.99316835,0.00018932445,0.000032491815,0.000018900828,0.000060149658,0.00016282311,0.0021160173],"genre_scores_gemma":[0.13613027,0.00031786048,0.85063684,0.00024644053,0.0000757652,0.00017357622,0.0005223802,0.00023163708,0.011665287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947315,0.00018691552,0.000027308752,0.000098959295,0.00017336554,0.000040359795],"domain_scores_gemma":[0.9985619,0.0009822735,0.00008019507,0.00012934419,0.000218066,0.000028139764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010511691,0.00092931197,0.00085098523,0.00035901612,0.00030253438,0.00095182844,0.0007182436,0.0011149755,0.00343938],"category_scores_gemma":[0.0037690487,0.0004382751,0.00052305375,0.0006459163,0.00078281556,0.0010642695,0.0008885738,0.002127945,0.0010614364],"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.000070195354,0.00004731089,0.00022476894,0.00018358197,0.000027228714,0.000096638825,0.00006493607,0.8416732,0.0034992856,0.069375746,0.003975814,0.080761306],"study_design_scores_gemma":[0.000010410328,0.000012920228,0.000027176304,0.000008659634,0.000002744283,0.000016935674,0.0000054054544,0.9841111,0.001488565,0.013338099,0.0009742453,0.0000038204143],"about_ca_topic_score_codex":0.0026190209,"about_ca_topic_score_gemma":0.0038084558,"teacher_disagreement_score":0.00343938,"about_ca_system_score_codex":0.0009615696,"about_ca_system_score_gemma":0.0019056984,"threshold_uncertainty_score":0.011505842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04039951,0.00063230726,0.95405525,0.0005970424,0.00004793837,0.000036214333,0.00011542163,0.000230102,0.0038862021],"genre_scores_gemma":[0.92823577,0.0010351307,0.06786454,0.000259242,0.0001338256,0.00013475693,0.00024157487,0.00018326314,0.0019120292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478626,0.0021204392,0.00024997068,0.0009161751,0.0015455413,0.00038151577],"domain_scores_gemma":[0.9647495,0.027409319,0.002153915,0.0027490426,0.0025190115,0.00041913096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006687455,0.0014023843,0.0011599294,0.0012870608,0.00059454003,0.0019298273,0.0012867515,0.0013477146,0.0014425548],"category_scores_gemma":[0.048880026,0.00053192704,0.001282068,0.0008102603,0.00473303,0.0031943426,0.0042036287,0.002671265,0.0003689475],"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.0006446972,0.00006656816,0.0020522168,0.0003508178,0.00017865746,0.0003755198,0.00038556004,0.51657575,0.026134493,0.41106606,0.0013381835,0.040831488],"study_design_scores_gemma":[0.000015749763,0.00012236924,0.00039743882,0.000035721037,0.00001711007,0.00010205803,0.0000418678,0.8992302,0.007681428,0.09175407,0.000572805,0.000029091001],"about_ca_topic_score_codex":0.0013062223,"about_ca_topic_score_gemma":0.0003672277,"teacher_disagreement_score":0.006687455,"about_ca_system_score_codex":0.0015426925,"about_ca_system_score_gemma":0.0012188404,"threshold_uncertainty_score":0.035367012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2872679,0.0025515172,0.675319,0.0011173957,0.00017154671,0.0001179823,0.00094837754,0.00057518,0.031931195],"genre_scores_gemma":[0.9768946,0.0007086514,0.019343806,0.00008165513,0.000061372,0.00015756678,0.00015440413,0.000067460925,0.0025304821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821657,0.0005493186,0.00006683039,0.00020505757,0.00048491414,0.00047727447],"domain_scores_gemma":[0.9848542,0.012262974,0.00065993756,0.00082847965,0.0011767498,0.00021764215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018768678,0.0009831506,0.000958542,0.0011434709,0.00090752076,0.0021218462,0.0013536523,0.0010187149,0.0029589268],"category_scores_gemma":[0.014192119,0.00030570547,0.00045377554,0.0012836831,0.0025552073,0.0028116328,0.0016124854,0.0011989658,0.00034192146],"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.00045230403,0.00007343891,0.0005242687,0.00026234254,0.000038320286,0.00029595091,0.00022133476,0.49324316,0.008797425,0.476391,0.0018798497,0.017820576],"study_design_scores_gemma":[0.00001422689,0.00004136163,0.00023201869,0.000045988472,0.000015278778,0.00010085447,0.000051699968,0.8910391,0.0053642183,0.10210375,0.0009539552,0.00003750024],"about_ca_topic_score_codex":0.0024108205,"about_ca_topic_score_gemma":0.001359173,"teacher_disagreement_score":0.0029589268,"about_ca_system_score_codex":0.002666739,"about_ca_system_score_gemma":0.0019834833,"threshold_uncertainty_score":0.019348681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009357139,0.0018131951,0.9735556,0.00042642138,0.0001162209,0.000071263115,0.00025014504,0.0002823356,0.014127725],"genre_scores_gemma":[0.66415054,0.010148423,0.30365926,0.0012821341,0.0014572401,0.0014328454,0.0016806092,0.001530376,0.014658568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906736,0.0033954198,0.00041187264,0.0009830676,0.0032450792,0.0012909467],"domain_scores_gemma":[0.8867367,0.0969451,0.0039643017,0.0050457744,0.0055578128,0.0017502974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009121655,0.0039720866,0.0027659603,0.0039839707,0.0018860507,0.0052759536,0.0035109194,0.0020984316,0.00939681],"category_scores_gemma":[0.05809873,0.0012792917,0.0021314388,0.0033306377,0.0054554804,0.007207263,0.008454616,0.008068427,0.002336385],"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.0009923781,0.0001542879,0.0008661196,0.0009030093,0.00014626714,0.0005092329,0.0010514044,0.34449378,0.013872269,0.5817507,0.0059621613,0.049298372],"study_design_scores_gemma":[0.000048553273,0.00019986012,0.0004669218,0.00044267302,0.00012133881,0.00047612173,0.00026298338,0.56648594,0.01058186,0.41215265,0.008624054,0.00013697465],"about_ca_topic_score_codex":0.0010314668,"about_ca_topic_score_gemma":0.0007965394,"teacher_disagreement_score":0.00939681,"about_ca_system_score_codex":0.002759779,"about_ca_system_score_gemma":0.0019008828,"threshold_uncertainty_score":0.048240483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12868083,0.0018548309,0.856231,0.00034740637,0.00009025118,0.00004778116,0.00007532324,0.00016902211,0.012503488],"genre_scores_gemma":[0.9520603,0.0009297476,0.04503464,0.000113424954,0.00006855404,0.00005505069,0.00002567719,0.000015928419,0.0016966796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995214,0.00015365146,0.000016457916,0.000066419096,0.00013751979,0.00010467053],"domain_scores_gemma":[0.99887496,0.000681626,0.000120412515,0.00009766566,0.00016336543,0.000061946295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010211096,0.00078093103,0.00051666587,0.0005028872,0.00056169846,0.00091590954,0.0006731863,0.0004999335,0.00095317926],"category_scores_gemma":[0.0024308157,0.00028587395,0.0002784018,0.0009380906,0.0014720985,0.0011290739,0.0012696299,0.0005185036,0.00023040871],"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.0004662958,0.00013851986,0.0009855252,0.000380888,0.00005869216,0.0008445693,0.00091956585,0.4910963,0.07684733,0.35247892,0.0022027139,0.07358065],"study_design_scores_gemma":[0.00002759385,0.0002504854,0.00028154397,0.000030362993,0.000026309175,0.00029045396,0.00014848314,0.9163412,0.011180702,0.06865037,0.0027302117,0.000042279127],"about_ca_topic_score_codex":0.0012563929,"about_ca_topic_score_gemma":0.0018418351,"teacher_disagreement_score":0.0012563929,"about_ca_system_score_codex":0.0009809354,"about_ca_system_score_gemma":0.00083742023,"threshold_uncertainty_score":0.007117152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5341305,0.0042989533,0.25487727,0.0019356521,0.00062286505,0.00011693615,0.00018280452,0.00023949503,0.20359556],"genre_scores_gemma":[0.94899315,0.0032678293,0.02484399,0.000319488,0.00089735084,0.00007469417,0.0001953477,0.00011037115,0.021297775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989833,0.00019443758,0.00005349344,0.00014071619,0.0003845054,0.00024348337],"domain_scores_gemma":[0.99794656,0.0012878657,0.00020077452,0.0001762173,0.00023845817,0.00015016622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043547,0.0005839101,0.00047071895,0.0019470452,0.0011503159,0.0019454706,0.00039569396,0.00065353676,0.0034702173],"category_scores_gemma":[0.005258243,0.00039174798,0.0007957383,0.0011146198,0.0033605224,0.0038670795,0.0017695567,0.0029836642,0.0007097725],"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.00003456284,0.000023357501,0.00035414766,0.00003703302,0.0000022706706,0.0002095298,0.00030974828,0.0011666657,0.0017648344,0.98442554,0.00057877484,0.011093606],"study_design_scores_gemma":[0.000017440498,0.000057150573,0.00046147167,0.000037139253,0.000008044591,0.0005805685,0.00015437395,0.0065028863,0.0024293081,0.9795741,0.010152466,0.000025184278],"about_ca_topic_score_codex":0.00071742135,"about_ca_topic_score_gemma":0.00047563532,"teacher_disagreement_score":0.0034702173,"about_ca_system_score_codex":0.0008974903,"about_ca_system_score_gemma":0.00053725485,"threshold_uncertainty_score":0.011609018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06326232,0.0005630765,0.932145,0.00014138992,0.00003368762,0.000073034236,0.000085938416,0.0005306606,0.0031649475],"genre_scores_gemma":[0.7729236,0.00048115943,0.21944278,0.00013226346,0.000069215326,0.0001894827,0.00019520576,0.00013248628,0.006433819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895346,0.00021557274,0.00005713782,0.00025218393,0.0003689424,0.00015273281],"domain_scores_gemma":[0.99740297,0.0007896041,0.0004653045,0.0008107857,0.00043191784,0.00009939388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074539013,0.00062602863,0.0006473409,0.0005376227,0.00049798354,0.0005811459,0.0011708267,0.0006134605,0.0015079416],"category_scores_gemma":[0.003737124,0.0002475907,0.00045373142,0.0008515672,0.0011252289,0.0014723318,0.0011795048,0.0010518929,0.0004218887],"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.0004270353,0.000096274,0.0016852496,0.00037023623,0.000054656164,0.0004778559,0.0005570765,0.6732057,0.03751071,0.14075932,0.0027215846,0.14213443],"study_design_scores_gemma":[0.000034438617,0.00030918326,0.0003772686,0.000034643446,0.000026853993,0.00046342338,0.00010660293,0.9325871,0.016514733,0.04523635,0.00426853,0.000040886072],"about_ca_topic_score_codex":0.002866022,"about_ca_topic_score_gemma":0.0024122417,"teacher_disagreement_score":0.002866022,"about_ca_system_score_codex":0.00072824326,"about_ca_system_score_gemma":0.0012764491,"threshold_uncertainty_score":0.005698681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15767278,0.00014789923,0.8185958,0.00026487868,0.000076740675,0.00013470245,0.00007457507,0.00044247523,0.022590106],"genre_scores_gemma":[0.89342123,0.0001647711,0.10299165,0.00010546587,0.00004328195,0.00010343012,0.000070462214,0.00006244441,0.0030372767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987834,0.00034459878,0.0000474586,0.00015499048,0.00044183477,0.00022762973],"domain_scores_gemma":[0.99842525,0.00064171816,0.00016143765,0.0004449244,0.00022746109,0.00009926573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094566634,0.00055953435,0.00040953484,0.00060382934,0.0007794199,0.0013226181,0.0006469526,0.0005614367,0.0020578033],"category_scores_gemma":[0.0019908492,0.00028543436,0.0004129599,0.00056410127,0.0021515337,0.0015538972,0.0026441377,0.001233116,0.00043328834],"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.00038742097,0.00014155758,0.0010926299,0.00013413244,0.00004179126,0.00025949426,0.000393076,0.14013252,0.08332772,0.7166918,0.0012073533,0.05619048],"study_design_scores_gemma":[0.00008778332,0.00030127657,0.00028071782,0.00004311147,0.00003435986,0.00024346473,0.000067041234,0.64225256,0.18203637,0.16794908,0.0066203936,0.00008376551],"about_ca_topic_score_codex":0.00038082188,"about_ca_topic_score_gemma":0.00041843258,"teacher_disagreement_score":0.0020578033,"about_ca_system_score_codex":0.0006089363,"about_ca_system_score_gemma":0.0008426749,"threshold_uncertainty_score":0.006883979},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7705175,0.0011388416,0.17764309,0.0005823649,0.000121111814,0.00005597059,0.00042686524,0.00016845479,0.049345702],"genre_scores_gemma":[0.97293866,0.0008049195,0.018031353,0.00009019448,0.000116763076,0.00006265393,0.0002245766,0.000100965066,0.0076299706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926764,0.0001313917,0.00004079589,0.00012485878,0.0002733671,0.00016202767],"domain_scores_gemma":[0.99841547,0.00073992985,0.00022580006,0.00020155293,0.00025271054,0.00016454083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061564875,0.00078526506,0.00044915808,0.0019674816,0.0009390259,0.0017355839,0.00065769785,0.00068868685,0.0038688506],"category_scores_gemma":[0.0047127386,0.00041313216,0.0003377744,0.0014506881,0.0018256988,0.0025344363,0.0016790959,0.0012145749,0.0007436742],"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.00015150866,0.000028438302,0.00060819427,0.00006587122,0.000008978231,0.00019117488,0.0002439802,0.013424378,0.008949048,0.95932806,0.0007860968,0.01621413],"study_design_scores_gemma":[0.000019001553,0.00003121443,0.00040645478,0.00004820815,0.0000071067698,0.00024126707,0.00012190934,0.04371166,0.004095839,0.9482729,0.0030183762,0.000026106414],"about_ca_topic_score_codex":0.0005038886,"about_ca_topic_score_gemma":0.00034935967,"teacher_disagreement_score":0.0038688506,"about_ca_system_score_codex":0.0008675556,"about_ca_system_score_gemma":0.00044561733,"threshold_uncertainty_score":0.012942612},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02137734,0.00009696342,0.97740626,0.00013199254,0.000015767238,0.00002436002,0.00004705621,0.000060133138,0.00084005814],"genre_scores_gemma":[0.6205992,0.0005236093,0.37323892,0.00016926114,0.000086776825,0.00018704883,0.00034383655,0.000086953274,0.004764403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883014,0.00047813976,0.00005159927,0.00020991384,0.00033045097,0.000099875375],"domain_scores_gemma":[0.99521446,0.0028910742,0.00056782254,0.0008216926,0.00038324224,0.00012178791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024118125,0.00082284055,0.0007036485,0.0004257005,0.00027567256,0.0007863164,0.001157998,0.0009766951,0.0012683239],"category_scores_gemma":[0.010814346,0.00036366374,0.00043798002,0.00078782055,0.0016721745,0.0018706083,0.0015336155,0.0013491182,0.00033352798],"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.0002117348,0.0000705374,0.00085261045,0.0001979982,0.000049798986,0.00030634567,0.0001145741,0.8491834,0.011729849,0.1075911,0.0011289471,0.028563011],"study_design_scores_gemma":[0.000011481325,0.000031612402,0.00013467786,0.0000065967233,0.0000030476233,0.000046227175,0.00001508819,0.97605705,0.002620471,0.020757172,0.00030809463,0.000008504161],"about_ca_topic_score_codex":0.001304216,"about_ca_topic_score_gemma":0.0012873411,"teacher_disagreement_score":0.0024118125,"about_ca_system_score_codex":0.0005035179,"about_ca_system_score_gemma":0.00068900525,"threshold_uncertainty_score":0.012755036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19297895,0.004131259,0.48545685,0.013487111,0.0009845431,0.00015006063,0.001979185,0.0010353093,0.2997968],"genre_scores_gemma":[0.9332621,0.0020205507,0.024757782,0.001946679,0.0018256992,0.00026007692,0.001111171,0.0004907415,0.034325186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99314356,0.0023147156,0.0003398379,0.0015104476,0.0018862984,0.00080515654],"domain_scores_gemma":[0.97762555,0.015265058,0.0013311137,0.002976867,0.0017834181,0.0010179601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005309666,0.00085912086,0.0012555078,0.0029183796,0.0021825274,0.0054509393,0.0018333818,0.0020890625,0.017084356],"category_scores_gemma":[0.033695083,0.0008214786,0.0014577016,0.001697947,0.0070869974,0.011379301,0.005228663,0.005645251,0.001969862],"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.000020104175,0.000008736025,0.00013708608,0.000036458994,0.000009529526,0.0000544892,0.00011578017,0.0011707502,0.000161851,0.9941718,0.001364812,0.0027485453],"study_design_scores_gemma":[0.0000076290057,0.000009815232,0.00021426879,0.000020527583,0.0000039572947,0.00007804372,0.00003245834,0.012392321,0.0002455505,0.98496336,0.0020210468,0.000010871902],"about_ca_topic_score_codex":0.0011321639,"about_ca_topic_score_gemma":0.0005759902,"teacher_disagreement_score":0.017084356,"about_ca_system_score_codex":0.0028996968,"about_ca_system_score_gemma":0.0015170382,"threshold_uncertainty_score":0.057152867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10305137,0.0014411836,0.7968641,0.003715185,0.00040494496,0.00014779951,0.0004450832,0.00067081273,0.09325955],"genre_scores_gemma":[0.76484644,0.0038039985,0.19349493,0.0017493521,0.0012629421,0.0005678277,0.0011091105,0.00083778845,0.032327574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970004,0.0007579221,0.0001755245,0.000497434,0.0010488452,0.000519809],"domain_scores_gemma":[0.98925155,0.007123384,0.00094702,0.0009260674,0.0010513703,0.0007006946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425009,0.0017421484,0.0011804511,0.0033423842,0.0019202618,0.0048328214,0.0020091552,0.0015001949,0.009405754],"category_scores_gemma":[0.011959029,0.0006963322,0.001970935,0.0034229823,0.0058766236,0.009303462,0.0051414473,0.0056307106,0.002294212],"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.00004207395,0.000046415713,0.00039115467,0.00006128546,0.000008281375,0.00008791916,0.0001872124,0.008994259,0.00093349454,0.97677773,0.0012088943,0.011261345],"study_design_scores_gemma":[0.000010176499,0.000037108683,0.00015533826,0.00003272366,0.000010119362,0.00012256118,0.00007682471,0.026546564,0.0018365016,0.9671692,0.0039758803,0.000026941712],"about_ca_topic_score_codex":0.0024475115,"about_ca_topic_score_gemma":0.00199344,"teacher_disagreement_score":0.009405754,"about_ca_system_score_codex":0.003384996,"about_ca_system_score_gemma":0.0016323001,"threshold_uncertainty_score":0.03146541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071720466,0.0005392423,0.91146195,0.0004953639,0.00006640379,0.00010868178,0.00021389071,0.00019193748,0.015202001],"genre_scores_gemma":[0.91749567,0.0003011429,0.075582355,0.000117676595,0.000039953564,0.00012584862,0.00015020723,0.000091864764,0.006095304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00038520544,0.000032072225,0.00015769228,0.00024496453,0.0001935701],"domain_scores_gemma":[0.99752396,0.0016015637,0.00020805452,0.00020662649,0.00033942645,0.00012041709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669074,0.00079096487,0.0010084746,0.0005159889,0.00045584858,0.0016481784,0.0014207574,0.0009327866,0.0023386087],"category_scores_gemma":[0.0066708177,0.00038564374,0.00033853733,0.0008187087,0.001321184,0.0018732598,0.0013163796,0.001030332,0.00021890875],"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.000053299136,0.00002404168,0.00019464824,0.000043187665,0.0000112954685,0.000050846946,0.000018345672,0.95082814,0.0010536421,0.04020005,0.000712448,0.006809988],"study_design_scores_gemma":[0.000006796474,0.00001448774,0.000077884324,0.000005163182,0.000004162985,0.000012994978,0.000010727991,0.98968375,0.0003550218,0.009432321,0.00039203936,0.0000046223754],"about_ca_topic_score_codex":0.005052641,"about_ca_topic_score_gemma":0.0029425358,"teacher_disagreement_score":0.005052641,"about_ca_system_score_codex":0.002816719,"about_ca_system_score_gemma":0.001670491,"threshold_uncertainty_score":0.020436823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012898479,0.0002509216,0.9840695,0.00016964886,0.000024153056,0.000027127384,0.00006186621,0.00004078704,0.0024576138],"genre_scores_gemma":[0.5977547,0.001145892,0.39150703,0.0001889077,0.00015667616,0.00024278887,0.00037576593,0.00011526583,0.008512955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981571,0.000578,0.00008850469,0.00038534708,0.0006788612,0.00011219861],"domain_scores_gemma":[0.9965843,0.0021654184,0.00039364913,0.00034631844,0.00038837845,0.00012195239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017766646,0.00093846425,0.00080912723,0.0011147647,0.000558304,0.0016263895,0.0015296363,0.0011605428,0.0019287707],"category_scores_gemma":[0.0055637504,0.00030037656,0.0005664793,0.0011918503,0.0020218762,0.0030409012,0.001424022,0.0018491424,0.0005092223],"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.000079244135,0.0000446518,0.0002703635,0.00010007487,0.000022605327,0.00007358642,0.0000768992,0.28860083,0.0041542565,0.6829814,0.0007657968,0.022830311],"study_design_scores_gemma":[0.0000054926527,0.00007566034,0.00012132832,0.000008727511,0.0000047358026,0.00007364017,0.000015282809,0.8434005,0.0012971075,0.15332402,0.0016575211,0.000016049902],"about_ca_topic_score_codex":0.00097217795,"about_ca_topic_score_gemma":0.0006215575,"teacher_disagreement_score":0.002363596,"about_ca_system_score_codex":0.002363596,"about_ca_system_score_gemma":0.0008997593,"threshold_uncertainty_score":0.01714915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107523546,0.010599016,0.7945599,0.0026110255,0.0004239206,0.00011630633,0.0013806088,0.0006999388,0.082085736],"genre_scores_gemma":[0.9501443,0.008831305,0.031386912,0.00056146167,0.0009514013,0.00042527186,0.0009828095,0.00023671369,0.006479794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972677,0.00071092584,0.00008386494,0.00029895082,0.0009522198,0.00068632996],"domain_scores_gemma":[0.9657129,0.028520089,0.0012223445,0.0013318767,0.0027564866,0.00045635577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034668976,0.00169284,0.00123226,0.0030085063,0.0006760226,0.0038279474,0.0014244099,0.0013609438,0.008024472],"category_scores_gemma":[0.028011803,0.0005815252,0.00063901173,0.0024605903,0.004956955,0.005591208,0.003296144,0.0029882793,0.0014211716],"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.0005117938,0.00010888181,0.00088789023,0.00058194064,0.00009720642,0.00045318692,0.00051510223,0.2964341,0.016830498,0.6222138,0.007046014,0.054319542],"study_design_scores_gemma":[0.000029004264,0.00008815445,0.00097324606,0.00030139607,0.000039602182,0.00034522323,0.00016866301,0.600338,0.0060106055,0.38807556,0.0035122146,0.00011840449],"about_ca_topic_score_codex":0.0021488296,"about_ca_topic_score_gemma":0.0012338713,"teacher_disagreement_score":0.008024472,"about_ca_system_score_codex":0.0023344762,"about_ca_system_score_gemma":0.0013009041,"threshold_uncertainty_score":0.026844561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11936063,0.0006033863,0.8665582,0.0006069799,0.000067208726,0.00008533821,0.00031994932,0.00015374433,0.0122446455],"genre_scores_gemma":[0.9612528,0.00053304795,0.03477916,0.0001340813,0.00007090415,0.00005627239,0.00013148983,0.00002017506,0.0030220686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866855,0.00041649732,0.000044340835,0.00022677697,0.000399969,0.00024389994],"domain_scores_gemma":[0.99669814,0.0015947076,0.0005361464,0.00050031615,0.0005221064,0.00014866669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015796633,0.00077400426,0.0009838659,0.00059648056,0.00038346302,0.001231868,0.0014050697,0.0013844715,0.0017927344],"category_scores_gemma":[0.006112648,0.00029932027,0.0004282078,0.0010755473,0.0014503463,0.0017470339,0.0015030976,0.0009927881,0.0005392817],"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.00028728024,0.000054822696,0.0013570036,0.00020524347,0.000058059908,0.0017126728,0.00022714645,0.59713465,0.006771285,0.3618314,0.0016451436,0.028715236],"study_design_scores_gemma":[0.000032466072,0.000047620517,0.00031695297,0.000018106299,0.000014527135,0.0003875505,0.000044212804,0.8999094,0.0016642853,0.096985325,0.000552769,0.000026858781],"about_ca_topic_score_codex":0.0024766806,"about_ca_topic_score_gemma":0.0021727248,"teacher_disagreement_score":0.0024766806,"about_ca_system_score_codex":0.0012429256,"about_ca_system_score_gemma":0.0010970624,"threshold_uncertainty_score":0.009018064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015578762,0.00022327891,0.98093843,0.00008981915,0.000035130004,0.00004019076,0.000030157891,0.00015513586,0.0029090084],"genre_scores_gemma":[0.7586759,0.0006127962,0.23721184,0.00010189692,0.000066427936,0.00014913254,0.00009516052,0.00003385722,0.0030529848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994929,0.00014740822,0.000020572068,0.00006309338,0.00020800506,0.000067969864],"domain_scores_gemma":[0.99930465,0.00032007642,0.00009344516,0.00012396107,0.000121139994,0.000036766458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631228,0.00067478954,0.0006270258,0.00039276562,0.0004360084,0.00059853157,0.00086644647,0.0006048621,0.0013977761],"category_scores_gemma":[0.0015397941,0.00025925215,0.00042933223,0.0009327706,0.0010669393,0.0008955491,0.0010745836,0.0009826884,0.00035825555],"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.0003842726,0.00014164054,0.0009221834,0.00020338364,0.00005816562,0.00048563033,0.00034098525,0.4088352,0.06731639,0.38260552,0.002051097,0.13665561],"study_design_scores_gemma":[0.0000152099665,0.00005365967,0.00009385987,0.000008449249,0.000008767214,0.00009966987,0.000008481639,0.98083204,0.008635997,0.00904773,0.0011806756,0.000015465323],"about_ca_topic_score_codex":0.0012667786,"about_ca_topic_score_gemma":0.0012031323,"teacher_disagreement_score":0.0013977761,"about_ca_system_score_codex":0.00060808606,"about_ca_system_score_gemma":0.0009454691,"threshold_uncertainty_score":0.004676044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016276738,0.00018594442,0.9808579,0.0002164665,0.000020345418,0.000043649292,0.000042773823,0.00010095065,0.00225521],"genre_scores_gemma":[0.8952166,0.000709849,0.098853484,0.00025991173,0.00009617982,0.00024520126,0.00015335524,0.00009840621,0.004366964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988533,0.0003889701,0.000038839833,0.00015182109,0.00041430222,0.00015282752],"domain_scores_gemma":[0.9880385,0.009388432,0.0010815157,0.00050532614,0.0008008535,0.00018547337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029122515,0.0007628956,0.00091042294,0.0008194591,0.0004546916,0.0011550748,0.00097015896,0.0009205952,0.0022212712],"category_scores_gemma":[0.018130165,0.0005278554,0.0005813628,0.00079014717,0.0017980987,0.0026281432,0.0016107577,0.0015000884,0.00035175987],"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.00010850198,0.00006569935,0.0010372362,0.0001406212,0.00004529467,0.00015837145,0.0001591263,0.6537087,0.0043712,0.3249034,0.0007873212,0.014514537],"study_design_scores_gemma":[0.000006240946,0.00002101474,0.000137572,0.0000074466457,0.0000035919215,0.000029528665,0.000011735771,0.9687602,0.00049021945,0.03030328,0.00022067333,0.000008502714],"about_ca_topic_score_codex":0.0013215175,"about_ca_topic_score_gemma":0.00088112825,"teacher_disagreement_score":0.0029122515,"about_ca_system_score_codex":0.0011564691,"about_ca_system_score_gemma":0.00104977,"threshold_uncertainty_score":0.015401661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16905582,0.0010363335,0.82431614,0.0005023572,0.000085499596,0.00011297696,0.00021654672,0.00059602084,0.004078291],"genre_scores_gemma":[0.7666638,0.0008619564,0.22890793,0.00019233121,0.000089854664,0.0001465209,0.00029050052,0.00011229017,0.0027348385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.0001794936,0.000041716736,0.000092898044,0.00023523129,0.00014647633],"domain_scores_gemma":[0.9970095,0.0016788543,0.00034256367,0.00044108284,0.00040586936,0.00012213633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011487921,0.0006325877,0.0006420907,0.00052041456,0.0005032706,0.00056762184,0.0008681166,0.0006445325,0.00090623146],"category_scores_gemma":[0.0046419255,0.000355989,0.00045320494,0.00057077984,0.0009617585,0.0016616241,0.0010251636,0.00092240516,0.00023452034],"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.00060758664,0.00014402348,0.0015883663,0.00029493135,0.000080344435,0.00021597362,0.00025050653,0.6738257,0.035109725,0.20093934,0.002686386,0.08425715],"study_design_scores_gemma":[0.000051036575,0.00015916284,0.00020928147,0.00003536505,0.000019111047,0.00012331555,0.000032054522,0.9372403,0.0142234,0.045655217,0.0022214206,0.000030471636],"about_ca_topic_score_codex":0.0019502502,"about_ca_topic_score_gemma":0.0022168315,"teacher_disagreement_score":0.0019502502,"about_ca_system_score_codex":0.0011572234,"about_ca_system_score_gemma":0.0018179873,"threshold_uncertainty_score":0.008396268},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012868125,0.14470181,0.8181243,0.0024743585,0.0007296243,0.00012285715,0.0005120327,0.0008611238,0.019605804],"genre_scores_gemma":[0.22360682,0.07989604,0.6824314,0.0010708302,0.0016615445,0.00034483863,0.0017266985,0.0003979028,0.008863887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951873,0.0013590544,0.00048204232,0.00087104266,0.0019104595,0.0001900204],"domain_scores_gemma":[0.99486816,0.00352213,0.0004436806,0.00036261504,0.0006740957,0.00012931632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034434833,0.00080190704,0.0020951808,0.005300562,0.00086799054,0.003998686,0.002465859,0.002166261,0.0031298492],"category_scores_gemma":[0.014610595,0.0004200996,0.0008116223,0.010022755,0.0038572098,0.007971514,0.0024773488,0.0020392868,0.001920384],"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.00014465043,0.000063999054,0.0014686481,0.002050488,0.00014020334,0.00035462808,0.00033670454,0.04587206,0.0040068734,0.42726758,0.008299133,0.50999504],"study_design_scores_gemma":[0.000019524898,0.00014468862,0.0014411265,0.0003194208,0.000044320273,0.0011163569,0.00024122234,0.11437964,0.005145313,0.795156,0.08189297,0.00009951864],"about_ca_topic_score_codex":0.0024951193,"about_ca_topic_score_gemma":0.0015319707,"teacher_disagreement_score":0.005300562,"about_ca_system_score_codex":0.0022406848,"about_ca_system_score_gemma":0.0015064534,"threshold_uncertainty_score":0.018211067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46985796,0.0030515727,0.4554904,0.0016219576,0.0002135074,0.0001164583,0.00070538424,0.00031297628,0.06862979],"genre_scores_gemma":[0.9491106,0.0016894256,0.042334817,0.00020804431,0.00040581723,0.000084638195,0.0003698692,0.000076024255,0.0057206517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860567,0.00030500174,0.000103878745,0.0003962683,0.00036330972,0.00022578302],"domain_scores_gemma":[0.9961085,0.0016909109,0.00056841015,0.0006791758,0.0004662012,0.00048682865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364809,0.0009100487,0.0008498791,0.005401585,0.0019256291,0.0028799702,0.0011814676,0.0009197526,0.004346097],"category_scores_gemma":[0.0055633816,0.0005902368,0.0008948756,0.0027518966,0.0061479085,0.0066201827,0.0027022632,0.0022594894,0.00046570756],"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.000032076277,0.000009712306,0.0008816638,0.00004985034,0.000008456791,0.00010015186,0.00016627702,0.002585411,0.0011384861,0.9821889,0.00037298613,0.012466128],"study_design_scores_gemma":[0.000007765519,0.000085107604,0.0017821474,0.00004182558,0.0000183863,0.0004653425,0.00030261822,0.020138454,0.0018573847,0.97011024,0.0051453416,0.000045452314],"about_ca_topic_score_codex":0.0012186911,"about_ca_topic_score_gemma":0.00062015955,"teacher_disagreement_score":0.005401585,"about_ca_system_score_codex":0.0016280295,"about_ca_system_score_gemma":0.00038393267,"threshold_uncertainty_score":0.014539182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017563252,0.00014313628,0.98098844,0.00023219381,0.000016202808,0.00005271187,0.00009645221,0.00018122324,0.00072631746],"genre_scores_gemma":[0.74296093,0.00045596145,0.25294584,0.00029509864,0.00015517657,0.0007852542,0.0009931864,0.00014266704,0.0012657808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9636559,0.02791606,0.0009672351,0.0029759482,0.0037432022,0.00074164436],"domain_scores_gemma":[0.76163006,0.21793377,0.00813163,0.00782056,0.003769601,0.0007143976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02485583,0.0012207649,0.0018421472,0.0023911688,0.00073861895,0.0023578014,0.003070835,0.0027059703,0.0024220552],"category_scores_gemma":[0.16481513,0.0006021747,0.0017493647,0.0025288477,0.0047940407,0.003449289,0.002864737,0.002554268,0.00046779378],"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.0007299922,0.00025214627,0.0130293025,0.00061493495,0.0006277096,0.00091500743,0.00059341727,0.3503421,0.0058974386,0.46149743,0.0018061831,0.16369438],"study_design_scores_gemma":[0.00007057665,0.00030942334,0.0021140086,0.00005037775,0.000054705397,0.00025997308,0.000118326156,0.79428166,0.0029195584,0.1990526,0.00071887666,0.00004988037],"about_ca_topic_score_codex":0.0010605247,"about_ca_topic_score_gemma":0.0006118652,"teacher_disagreement_score":0.02485583,"about_ca_system_score_codex":0.001201121,"about_ca_system_score_gemma":0.0019044925,"threshold_uncertainty_score":0.13145179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031969555,0.000109311186,0.96384966,0.00013454947,0.000028563865,0.00004588559,0.000101988786,0.00021397133,0.0035465264],"genre_scores_gemma":[0.4943042,0.00023396239,0.50259453,0.00010356376,0.000039715975,0.00014474243,0.00024138064,0.00006098625,0.0022769659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888426,0.00040041798,0.000069551104,0.00012476754,0.0004137374,0.0001072549],"domain_scores_gemma":[0.9977736,0.0010972505,0.00026905167,0.0003391286,0.00039877987,0.00012210153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084479415,0.0005186309,0.00045986447,0.00041900753,0.00041936839,0.00078567606,0.0006331025,0.0005527681,0.0010690825],"category_scores_gemma":[0.0038252887,0.00025443497,0.00041796174,0.0005026382,0.0009891099,0.00078491913,0.0013408612,0.0008839677,0.00047079095],"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.0003150484,0.000102240374,0.0014491217,0.00024623956,0.00004240711,0.00029435908,0.0003351163,0.40264714,0.052507892,0.39134577,0.0027742153,0.1479404],"study_design_scores_gemma":[0.000052830754,0.00016751481,0.0001896894,0.000026988377,0.000008762044,0.00025875348,0.000050109385,0.9073311,0.028927222,0.058189347,0.004760966,0.00003671455],"about_ca_topic_score_codex":0.0006127012,"about_ca_topic_score_gemma":0.0006293866,"teacher_disagreement_score":0.0010690825,"about_ca_system_score_codex":0.00062860665,"about_ca_system_score_gemma":0.0012515021,"threshold_uncertainty_score":0.004560888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18502772,0.0006505769,0.80434513,0.0010380531,0.000057719604,0.00033934438,0.00042051118,0.0009445166,0.0071764537],"genre_scores_gemma":[0.48981768,0.0013711485,0.5004532,0.00042660552,0.00012672572,0.0004954918,0.0016020202,0.00026705343,0.005440074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875414,0.00041734456,0.000054430202,0.00033867286,0.00026766123,0.00016772239],"domain_scores_gemma":[0.9920425,0.0059271688,0.0007359616,0.0007802511,0.00030863693,0.00020545599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009489725,0.0008685481,0.00091145793,0.0011167023,0.0010144202,0.0013046657,0.0010213986,0.0011252477,0.00303869],"category_scores_gemma":[0.008750354,0.00063135626,0.00075538474,0.0016511903,0.0020071007,0.003512181,0.0017041496,0.0012895862,0.00093451503],"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.00084718113,0.00058691367,0.006310181,0.0011700848,0.00016315343,0.00065973593,0.00080932083,0.43809178,0.06338632,0.18981239,0.008419032,0.2897439],"study_design_scores_gemma":[0.00017085568,0.00037388914,0.0018269728,0.00008876303,0.00005719135,0.00080455415,0.0002758698,0.7259893,0.017233454,0.24649827,0.0066265324,0.00005437298],"about_ca_topic_score_codex":0.0013928422,"about_ca_topic_score_gemma":0.0018856846,"teacher_disagreement_score":0.00303869,"about_ca_system_score_codex":0.0007257423,"about_ca_system_score_gemma":0.0013322523,"threshold_uncertainty_score":0.010165453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0889751,0.001119739,0.89547926,0.0009023858,0.000090118396,0.00010781245,0.00024496345,0.0010513344,0.012029275],"genre_scores_gemma":[0.82027036,0.0011752653,0.16501455,0.00036313853,0.00018389543,0.0002416133,0.0005066903,0.0004500985,0.011794275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967894,0.00085693976,0.00014188567,0.0004544461,0.0011819212,0.00057536084],"domain_scores_gemma":[0.98622376,0.0069695604,0.0014872763,0.003089861,0.0018930896,0.00033662005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028252488,0.00094837777,0.000911158,0.0012859122,0.0012162072,0.00178638,0.0015511445,0.0009940525,0.0038272496],"category_scores_gemma":[0.017341862,0.00040694186,0.0008478836,0.00153622,0.0034949554,0.005931702,0.0027183625,0.0034747024,0.0013021309],"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.000636942,0.00007652387,0.0009752301,0.00027090564,0.000029536393,0.00023186045,0.0006436479,0.27802882,0.01539961,0.65260136,0.0029486045,0.048157055],"study_design_scores_gemma":[0.00003671214,0.0001796387,0.00025264546,0.000051588082,0.000021690817,0.00020570806,0.00010212288,0.71222806,0.018714206,0.26454052,0.0036055355,0.000061543215],"about_ca_topic_score_codex":0.003207745,"about_ca_topic_score_gemma":0.0014766424,"teacher_disagreement_score":0.0038272496,"about_ca_system_score_codex":0.0027155755,"about_ca_system_score_gemma":0.0017118296,"threshold_uncertainty_score":0.019702971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084045716,0.00056614436,0.89450806,0.0028031953,0.0003424153,0.0001992428,0.0007018459,0.001098257,0.015735181],"genre_scores_gemma":[0.9045512,0.00028415024,0.08069334,0.00038796384,0.00013195325,0.0004243293,0.0005941357,0.00020664938,0.012726154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975197,0.0010080342,0.000092601,0.0005803763,0.0004684065,0.00033086384],"domain_scores_gemma":[0.9830941,0.012525318,0.0011354142,0.0014925508,0.0011286668,0.00062403583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026972124,0.0011915342,0.0020514806,0.0007597013,0.0009490923,0.002289026,0.002435406,0.0029622472,0.005624558],"category_scores_gemma":[0.020067396,0.00076016877,0.001341006,0.0010874236,0.0024778917,0.0027749424,0.0029851228,0.0025316363,0.0008813017],"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.0002537046,0.000052525145,0.00078375475,0.00007419308,0.000042884905,0.00018656568,0.000071049304,0.9322741,0.00051168917,0.06096334,0.0009934301,0.003792785],"study_design_scores_gemma":[0.000052165396,0.000017443932,0.000044180462,0.000005005598,0.0000075107528,0.000017065506,0.000012355464,0.9731794,0.0003005386,0.025869923,0.00048514275,0.000009228556],"about_ca_topic_score_codex":0.0044340515,"about_ca_topic_score_gemma":0.002618478,"teacher_disagreement_score":0.005624558,"about_ca_system_score_codex":0.0014293602,"about_ca_system_score_gemma":0.0018392972,"threshold_uncertainty_score":0.018816054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57099324,0.0034351014,0.38258567,0.0006184595,0.00007591646,0.000043437416,0.00015491332,0.00074941234,0.041343834],"genre_scores_gemma":[0.9870084,0.00044107126,0.011270311,0.000042647982,0.000016315988,0.000026991074,0.0000380231,0.000019670855,0.0011364744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969125,0.00005472842,0.000014594377,0.000044822766,0.00013755195,0.000057184327],"domain_scores_gemma":[0.9983802,0.0010482817,0.00011042926,0.00019279456,0.0002115579,0.00005671318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044252822,0.00023029189,0.00036628966,0.00069392775,0.00039081785,0.0008717771,0.0008659991,0.00053117087,0.0010461615],"category_scores_gemma":[0.0038430914,0.00025440927,0.00016874766,0.0005094947,0.000965743,0.0019390843,0.0010091744,0.0006456289,0.00023558372],"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.0002523793,0.000111629146,0.0016676794,0.0003239008,0.000026893156,0.0005375396,0.00046106943,0.18725896,0.09770807,0.6638169,0.0016014708,0.04623342],"study_design_scores_gemma":[0.000009986436,0.00008587261,0.0010278433,0.00005966265,0.000015705371,0.0004072749,0.00009594566,0.82208234,0.042674575,0.13190772,0.0015938736,0.000039193077],"about_ca_topic_score_codex":0.00042906983,"about_ca_topic_score_gemma":0.00042951727,"teacher_disagreement_score":0.0010461615,"about_ca_system_score_codex":0.0007664871,"about_ca_system_score_gemma":0.00026946116,"threshold_uncertainty_score":0.005561292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37201786,0.00717166,0.5182422,0.0019542917,0.00019533199,0.00012319752,0.001379404,0.00066987047,0.098246194],"genre_scores_gemma":[0.98781836,0.0018571035,0.005602916,0.00013328063,0.00010793641,0.0001130159,0.00020078632,0.000047129244,0.004119497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976544,0.0005839198,0.000054072418,0.00027404414,0.0007750885,0.0006585381],"domain_scores_gemma":[0.99133694,0.0057086563,0.00061201974,0.00040986037,0.0014537699,0.00047865187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015220455,0.0007552303,0.00080319034,0.0019983954,0.00086996367,0.0030065146,0.0013932044,0.0010551332,0.003365667],"category_scores_gemma":[0.010426911,0.00042731094,0.00042987897,0.0016472834,0.0023394935,0.0034045728,0.0016897466,0.001241013,0.00044977464],"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.00018169639,0.000047750644,0.001344828,0.00019591938,0.000059542475,0.00030672018,0.00031219068,0.64402395,0.0049752994,0.33225858,0.0027063987,0.013587094],"study_design_scores_gemma":[0.000009774035,0.000049292,0.000561015,0.000063949265,0.000019139607,0.00021126789,0.00012680166,0.90612096,0.0013506273,0.089129865,0.002320073,0.00003715008],"about_ca_topic_score_codex":0.005396366,"about_ca_topic_score_gemma":0.0017689031,"teacher_disagreement_score":0.005396366,"about_ca_system_score_codex":0.0033716836,"about_ca_system_score_gemma":0.0013090214,"threshold_uncertainty_score":0.024463415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002912538,0.00043749865,0.9926751,0.0003667371,0.00012841831,0.000109432454,0.00020249118,0.0011328311,0.0020349487],"genre_scores_gemma":[0.091585524,0.0007306637,0.9002077,0.0005883199,0.00019044311,0.00048203874,0.0009822493,0.00043752944,0.004795533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984321,0.0002838588,0.000105917046,0.00023505134,0.00082499254,0.000118150776],"domain_scores_gemma":[0.99801105,0.0010088809,0.00016644565,0.00037061158,0.00033160314,0.00011148001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216004,0.0014423851,0.0011982768,0.00086902623,0.00063518883,0.0015558173,0.0019197325,0.0017142759,0.006223427],"category_scores_gemma":[0.010248651,0.0004887016,0.0006337249,0.0013377195,0.0013191723,0.0024083056,0.0031167294,0.0028837372,0.003276173],"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.00097370544,0.00019573909,0.0010763638,0.00085841893,0.00010416952,0.00039884858,0.00053801516,0.13466214,0.045607794,0.14169343,0.026323901,0.6475675],"study_design_scores_gemma":[0.000076963006,0.0001077842,0.0001915051,0.00007853299,0.000017142904,0.00043923748,0.000054939384,0.9355137,0.0158415,0.04030301,0.0073279766,0.000047763675],"about_ca_topic_score_codex":0.002421371,"about_ca_topic_score_gemma":0.0034921765,"teacher_disagreement_score":0.006223427,"about_ca_system_score_codex":0.0008287817,"about_ca_system_score_gemma":0.002448485,"threshold_uncertainty_score":0.020819485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097597696,0.005287124,0.7938882,0.0020345573,0.00015215311,0.00014546463,0.0006707246,0.0006046656,0.09961934],"genre_scores_gemma":[0.94665307,0.003390183,0.042689618,0.00042218095,0.00018481999,0.00027767188,0.00021625003,0.00016162773,0.0060045947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973367,0.0010236644,0.000111647714,0.0004030132,0.00057249144,0.0005524584],"domain_scores_gemma":[0.99255955,0.0048445454,0.0007649947,0.00048606706,0.0010655541,0.00027928408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032883706,0.0010906435,0.0012259065,0.0011150605,0.0010352406,0.0032854134,0.0012862533,0.0010902653,0.0047453325],"category_scores_gemma":[0.012091947,0.0004702321,0.000773738,0.0009281792,0.0033808274,0.00323445,0.0025139935,0.001966639,0.001244864],"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.00030534028,0.000037812428,0.00039189833,0.00029797282,0.000042835694,0.00030569898,0.0004712215,0.059243694,0.007247172,0.9155835,0.0026881364,0.01338469],"study_design_scores_gemma":[0.00006660073,0.00014315796,0.00065580977,0.00029743044,0.00004813803,0.0007760886,0.00030449074,0.42769432,0.010430803,0.55039364,0.009066778,0.0001228658],"about_ca_topic_score_codex":0.0015054395,"about_ca_topic_score_gemma":0.00046338144,"teacher_disagreement_score":0.0047453325,"about_ca_system_score_codex":0.0016917612,"about_ca_system_score_gemma":0.0016727652,"threshold_uncertainty_score":0.017390788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026308628,0.00084572216,0.96665287,0.00013551828,0.00003282675,0.000034330198,0.000035546887,0.0001451195,0.0058095013],"genre_scores_gemma":[0.8064006,0.0017251824,0.18864232,0.00013702089,0.00010067007,0.000108301094,0.00007271283,0.00005216502,0.0027610923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843305,0.00059654133,0.00007060745,0.00014793249,0.00054832984,0.00020358765],"domain_scores_gemma":[0.99766517,0.0014866504,0.000202501,0.00031356522,0.00028473244,0.000047404385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016947871,0.00080972235,0.00056246005,0.00055483595,0.00044536716,0.0007181711,0.0006192113,0.000485034,0.0011606739],"category_scores_gemma":[0.005007898,0.0002599432,0.0005333442,0.00092427596,0.0015218788,0.0012218456,0.00096194627,0.0009923753,0.00030992719],"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.00031755143,0.000055569642,0.0005807149,0.00023487327,0.000058214602,0.00026041205,0.00046273533,0.37140396,0.031968966,0.48039773,0.0011106475,0.11314867],"study_design_scores_gemma":[0.000030617,0.00016405935,0.00018713274,0.000033453667,0.000029994682,0.00038500878,0.00004446144,0.8932447,0.01543119,0.086957216,0.0034520624,0.000040105024],"about_ca_topic_score_codex":0.0013364695,"about_ca_topic_score_gemma":0.0011775094,"teacher_disagreement_score":0.0016947871,"about_ca_system_score_codex":0.00077174284,"about_ca_system_score_gemma":0.0010739419,"threshold_uncertainty_score":0.008962989},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065448727,0.00012718324,0.99275124,0.000054430442,0.000006339168,0.000010567191,0.000022446136,0.00006420836,0.00041877694],"genre_scores_gemma":[0.6234206,0.0011741841,0.3721774,0.00010841314,0.00010524922,0.00017349007,0.00032305636,0.00011694252,0.0024007293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00039699758,0.000045203822,0.00012708278,0.00028494757,0.00007717471],"domain_scores_gemma":[0.99608624,0.0032249885,0.00022396958,0.00018673531,0.00022210905,0.000055978566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021139726,0.0006512685,0.0011712902,0.00096107187,0.0003485268,0.0012690701,0.0008732915,0.0007920687,0.0009313591],"category_scores_gemma":[0.009928986,0.00046107636,0.000756488,0.00075357826,0.0011522576,0.001992155,0.0013112975,0.0011258846,0.00027505742],"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.00010571504,0.000037440066,0.0011050304,0.0001682373,0.00004910218,0.000106957,0.000109122404,0.8485295,0.0064085093,0.08600083,0.0005312521,0.05684828],"study_design_scores_gemma":[0.0000034172874,0.000011933546,0.00018455078,0.000008502834,0.0000028957397,0.000025001278,0.0000053044205,0.97976536,0.0013890043,0.018406706,0.00018739625,0.000009990811],"about_ca_topic_score_codex":0.0017301135,"about_ca_topic_score_gemma":0.0011938672,"teacher_disagreement_score":0.0021139726,"about_ca_system_score_codex":0.0010189265,"about_ca_system_score_gemma":0.0011083939,"threshold_uncertainty_score":0.011179864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04315046,0.0010745322,0.9076364,0.00062573346,0.00018592342,0.00015764886,0.00046659814,0.0005069509,0.046195768],"genre_scores_gemma":[0.5610404,0.002237359,0.40951696,0.0006839297,0.00039011196,0.00044377943,0.001147397,0.00027201837,0.02426815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942625,0.000124174,0.000030398965,0.00005433329,0.00030925733,0.000055636832],"domain_scores_gemma":[0.99930215,0.00022058474,0.00010835306,0.00014015229,0.00017687182,0.000051808307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036262293,0.00052399887,0.0002953156,0.00081990863,0.00037305904,0.0009960196,0.00042745314,0.0006333086,0.00350142],"category_scores_gemma":[0.0020341026,0.00020792591,0.00040492226,0.00078336115,0.00087511,0.0010291375,0.0014453805,0.0016259027,0.0013593917],"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.00005960249,0.000018964798,0.0001332239,0.00012775426,0.00001091011,0.000096300166,0.0001258426,0.044498503,0.012887431,0.88678503,0.0023351116,0.052921426],"study_design_scores_gemma":[0.00004340764,0.0001184515,0.00033415036,0.000096551434,0.000014108346,0.0005852777,0.00005855236,0.20945615,0.03124948,0.71154976,0.046429418,0.0000647573],"about_ca_topic_score_codex":0.00053567305,"about_ca_topic_score_gemma":0.00062667654,"teacher_disagreement_score":0.00350142,"about_ca_system_score_codex":0.00064830494,"about_ca_system_score_gemma":0.0010152076,"threshold_uncertainty_score":0.011713386},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115067065,0.0010417972,0.8723827,0.0010095744,0.00007054805,0.00006121177,0.0003261561,0.00018311897,0.009857768],"genre_scores_gemma":[0.91629624,0.0013172755,0.075604275,0.00020564212,0.00008573592,0.00009988581,0.00036196914,0.00010794383,0.00592094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990951,0.0002729237,0.000049269158,0.00016168822,0.00025890244,0.00016211405],"domain_scores_gemma":[0.9914484,0.006853648,0.00056407216,0.0003320231,0.00063232554,0.00016954815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108648,0.0007016924,0.0007957887,0.00072915375,0.0004190267,0.001517968,0.0010378042,0.00089986983,0.0022064815],"category_scores_gemma":[0.012118913,0.00050152076,0.0004660513,0.0008209492,0.0017456332,0.0022027001,0.0011313758,0.0016272158,0.00037765232],"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.00030584354,0.00004919222,0.0004896188,0.00013134249,0.000022758912,0.00006100053,0.00012381178,0.60457295,0.0034074343,0.36179882,0.0012146813,0.027822535],"study_design_scores_gemma":[0.000019817897,0.000044005134,0.00013341478,0.000035126835,0.0000068473537,0.000027255897,0.000021740289,0.8875501,0.0023957542,0.10933248,0.0004163723,0.00001710976],"about_ca_topic_score_codex":0.0039626393,"about_ca_topic_score_gemma":0.0026918103,"teacher_disagreement_score":0.0039626393,"about_ca_system_score_codex":0.0027294802,"about_ca_system_score_gemma":0.0029769214,"threshold_uncertainty_score":0.019803822},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3618911,0.002883283,0.62527865,0.0007672702,0.00006823913,0.000096889555,0.00034973523,0.00050945947,0.008155325],"genre_scores_gemma":[0.97218376,0.0008658002,0.025301063,0.0000801311,0.000046657846,0.00007192433,0.00010798944,0.0000688096,0.0012739474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976937,0.00061055843,0.00013001187,0.00037656902,0.0005632524,0.0006258551],"domain_scores_gemma":[0.9874334,0.008064812,0.0013560372,0.0015737697,0.0013121115,0.00025991243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002670136,0.0012654575,0.001462238,0.0010636182,0.0007847026,0.0023799764,0.0024602343,0.0013121958,0.0013904851],"category_scores_gemma":[0.021425921,0.0006296863,0.00044532627,0.0021619205,0.0012840091,0.0044169105,0.0013911885,0.0010892438,0.0003096989],"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.00069121126,0.0001151025,0.0022618764,0.00027185207,0.00006995728,0.00037530938,0.00022970399,0.8683937,0.015884722,0.084035575,0.0012079071,0.02646291],"study_design_scores_gemma":[0.00001702118,0.00008086139,0.00041361942,0.000020752272,0.000024768624,0.00014144434,0.00005650809,0.98318416,0.005075745,0.010615922,0.00034072535,0.000028465856],"about_ca_topic_score_codex":0.004054261,"about_ca_topic_score_gemma":0.0030053586,"teacher_disagreement_score":0.004054261,"about_ca_system_score_codex":0.0040118056,"about_ca_system_score_gemma":0.0016671037,"threshold_uncertainty_score":0.029107869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067313634,0.00019333232,0.91956395,0.0013825267,0.00011068428,0.00019752148,0.00010972536,0.0002530635,0.010875557],"genre_scores_gemma":[0.9025448,0.00019763986,0.09087321,0.00031634155,0.00010438476,0.00026246175,0.00008172612,0.000076118224,0.005543389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966487,0.0013586611,0.00014400175,0.0006549093,0.00076931523,0.00042443912],"domain_scores_gemma":[0.98905236,0.0067373887,0.00070866576,0.0025403178,0.0004939225,0.0004673293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034415103,0.00060480536,0.0009816277,0.0005666909,0.0011185671,0.0018099104,0.0028107492,0.0013729956,0.005449495],"category_scores_gemma":[0.012406924,0.0004323361,0.00061041256,0.0006815961,0.0049071913,0.0062357015,0.0048468513,0.0032585491,0.0005235478],"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.00025553544,0.00011498438,0.00020482452,0.00009429204,0.00002769261,0.00018526177,0.00027639195,0.04633389,0.008756879,0.9237248,0.00084695313,0.0191786],"study_design_scores_gemma":[0.000047936694,0.00012120371,0.00013693988,0.000026233296,0.000015900952,0.0000933742,0.00007764171,0.29241464,0.0065201833,0.6984987,0.0020020986,0.000045047305],"about_ca_topic_score_codex":0.0006709411,"about_ca_topic_score_gemma":0.0006287663,"teacher_disagreement_score":0.005449495,"about_ca_system_score_codex":0.0016718403,"about_ca_system_score_gemma":0.0016889361,"threshold_uncertainty_score":0.018230379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0411382,0.00041274913,0.94347817,0.00014299435,0.00014768213,0.00009880909,0.00020351139,0.0003748702,0.014003076],"genre_scores_gemma":[0.28568903,0.00048737446,0.70473284,0.00023673323,0.000105432126,0.00032599346,0.00045085602,0.000111754714,0.007860007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993723,0.00012667027,0.000042962216,0.00012247694,0.0002635643,0.00007204794],"domain_scores_gemma":[0.9993636,0.0001611998,0.00006318186,0.00012888583,0.00022686967,0.000056310826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003527679,0.00046709686,0.0004979624,0.00090844644,0.00063315826,0.0007184251,0.00064143684,0.00053699454,0.0025590786],"category_scores_gemma":[0.0015240707,0.00028477304,0.00047257077,0.0008859775,0.00085023796,0.0008551426,0.0012030681,0.00077096844,0.0007687844],"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.00016495207,0.00007303284,0.0006957908,0.0003343566,0.00004024404,0.0004446627,0.00044873744,0.028995577,0.104004845,0.659122,0.0042089326,0.20146696],"study_design_scores_gemma":[0.00010104563,0.00059333636,0.0009215207,0.00014628851,0.000065064494,0.0018657815,0.00020292828,0.47537974,0.1973424,0.24544336,0.07774967,0.0001888538],"about_ca_topic_score_codex":0.0005880239,"about_ca_topic_score_gemma":0.0007817735,"teacher_disagreement_score":0.0025590786,"about_ca_system_score_codex":0.0005613273,"about_ca_system_score_gemma":0.0011515005,"threshold_uncertainty_score":0.0085609555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064431643,0.00013757148,0.9912334,0.00011517581,0.00006157055,0.00005777766,0.000053639626,0.00023156844,0.0016661221],"genre_scores_gemma":[0.67345303,0.00043630446,0.31954816,0.0002280986,0.00009707826,0.0003958114,0.0002292107,0.00004798075,0.0055642826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986004,0.00036299368,0.000061928025,0.0002102929,0.00055992336,0.00020442791],"domain_scores_gemma":[0.99819934,0.0005767555,0.00017794094,0.0005127004,0.0004512116,0.00008198865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011602709,0.0010735451,0.00095289055,0.0007786534,0.000664364,0.0011041878,0.0019547988,0.000977851,0.0019518881],"category_scores_gemma":[0.0026263564,0.000404797,0.00057593203,0.0012990104,0.0012442583,0.001559383,0.0025993488,0.0015331636,0.00052735],"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.00039605564,0.0001410745,0.00070190255,0.00026900915,0.000093592724,0.0003942293,0.00026939283,0.5055213,0.03478409,0.30816242,0.004680018,0.14458703],"study_design_scores_gemma":[0.000037686237,0.00007297722,0.00007734897,0.000013874865,0.00001867423,0.00013605857,0.00001326737,0.9685392,0.008421203,0.020099763,0.0025365744,0.00003351941],"about_ca_topic_score_codex":0.0011380895,"about_ca_topic_score_gemma":0.0014820639,"teacher_disagreement_score":0.0019547988,"about_ca_system_score_codex":0.00069930585,"about_ca_system_score_gemma":0.0013103274,"threshold_uncertainty_score":0.006529689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017192466,0.00029863924,0.97908235,0.00014667434,0.000026433465,0.00003211069,0.00006359947,0.0000954066,0.0030623132],"genre_scores_gemma":[0.7359409,0.0011893306,0.2556758,0.00026483345,0.000098393764,0.000163779,0.00024829665,0.00010034579,0.006318303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.0004467803,0.00006767733,0.0001800335,0.00043906737,0.00017768303],"domain_scores_gemma":[0.9967713,0.0020714384,0.00033815912,0.00042713492,0.0003111381,0.00008082258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027170454,0.0012591346,0.0009494269,0.00050615205,0.00030995053,0.00087585906,0.0012783227,0.0007722493,0.0021818734],"category_scores_gemma":[0.007094262,0.0003684974,0.00084986695,0.0008257437,0.0018745885,0.0020909412,0.002053392,0.0015584722,0.0005556735],"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.0005956434,0.00005759008,0.0008092538,0.0003508866,0.00011515969,0.0005184474,0.00039537452,0.39999697,0.03773969,0.5039411,0.001441185,0.054038722],"study_design_scores_gemma":[0.00003468845,0.00011355676,0.00013780761,0.00002599366,0.000022880791,0.00017689972,0.000026625312,0.9133598,0.0141684525,0.070839055,0.0010670987,0.000027162778],"about_ca_topic_score_codex":0.0016350921,"about_ca_topic_score_gemma":0.0011586673,"teacher_disagreement_score":0.0027170454,"about_ca_system_score_codex":0.0009084732,"about_ca_system_score_gemma":0.0008328576,"threshold_uncertainty_score":0.014369309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03153399,0.0005422777,0.9438791,0.0003363024,0.00005207909,0.00004500893,0.00017948027,0.000083723266,0.023348082],"genre_scores_gemma":[0.90880686,0.0008934921,0.082381226,0.0002743184,0.000119946926,0.00020144517,0.00023598291,0.00007130286,0.007015434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865,0.0005294685,0.000037296537,0.00018548925,0.00040731524,0.00019055104],"domain_scores_gemma":[0.99747556,0.0016483958,0.00027771248,0.00014672583,0.00033618163,0.00011542459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013507201,0.00071449426,0.00077737786,0.00045729347,0.00048499976,0.001940227,0.0005708389,0.0006182536,0.0021722494],"category_scores_gemma":[0.0036348398,0.00034845556,0.0005674001,0.00069551246,0.0015094739,0.0017146344,0.0017218131,0.0015308005,0.00038831495],"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.00016141962,0.000105490406,0.00065614673,0.00014280707,0.000033322674,0.00032484686,0.0002889719,0.21032245,0.0046323687,0.7546333,0.0025030638,0.026195802],"study_design_scores_gemma":[0.00003883668,0.00012629142,0.00048150224,0.00003364363,0.000024540373,0.00055786665,0.00016725279,0.7421905,0.005334875,0.245105,0.0059103514,0.000029347406],"about_ca_topic_score_codex":0.0010329256,"about_ca_topic_score_gemma":0.0007299195,"teacher_disagreement_score":0.0021722494,"about_ca_system_score_codex":0.0011052997,"about_ca_system_score_gemma":0.0012440776,"threshold_uncertainty_score":0.008019507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25332344,0.00034133787,0.74112314,0.00013939272,0.000019008778,0.00002659106,0.0001375406,0.00035056114,0.004539024],"genre_scores_gemma":[0.96958536,0.00018338513,0.028346783,0.00003157686,0.000007613856,0.000022475511,0.000073892115,0.00004296997,0.0017058525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995486,0.00012101828,0.000015764857,0.000036483503,0.0002109049,0.000067195964],"domain_scores_gemma":[0.9982576,0.0010767442,0.0002009233,0.00013866914,0.00028004378,0.000046154444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058847247,0.00047828633,0.00036623204,0.0004215046,0.0002013358,0.0004785508,0.0004523096,0.0003679149,0.0008990759],"category_scores_gemma":[0.003215075,0.0002271172,0.00024806662,0.00034272854,0.0006984031,0.00069621444,0.0005555779,0.0004802661,0.00019151327],"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.000050773466,0.000011802308,0.0006909318,0.000036882582,0.00001791768,0.00006794363,0.000040038798,0.96597975,0.009256378,0.01926968,0.00013656549,0.004441305],"study_design_scores_gemma":[0.0000012017592,0.000011343374,0.000099426325,0.0000026650755,0.0000026439475,0.000012924578,0.0000050711606,0.99571145,0.001895888,0.0021982724,0.00005586883,0.0000032579592],"about_ca_topic_score_codex":0.002783154,"about_ca_topic_score_gemma":0.0020152684,"teacher_disagreement_score":0.002783154,"about_ca_system_score_codex":0.0009698572,"about_ca_system_score_gemma":0.0008631184,"threshold_uncertainty_score":0.0070368648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010527179,0.000055169017,0.99633515,0.000046479305,0.00002140883,0.00004866541,0.000045929348,0.0008560095,0.0015384078],"genre_scores_gemma":[0.058518622,0.00018937288,0.9369678,0.000083181425,0.000052453765,0.0002819493,0.00024604533,0.00033712198,0.00332342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979596,0.0005163797,0.00015716343,0.000495167,0.0006174801,0.0002542162],"domain_scores_gemma":[0.99781215,0.0004862217,0.00017047246,0.00089401804,0.0005362361,0.0001009029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513002,0.0011103029,0.0013295816,0.001103075,0.0015298321,0.0037124397,0.0040199556,0.0016258917,0.00697046],"category_scores_gemma":[0.005809066,0.00095608755,0.0014221545,0.002201974,0.0017975885,0.0033728017,0.0032261668,0.0021803023,0.002617695],"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.00018564225,0.000095312105,0.0006992344,0.00026112888,0.00004895623,0.00025831885,0.000555627,0.26126802,0.0115344655,0.55138284,0.009371258,0.16433924],"study_design_scores_gemma":[0.000048069585,0.000108655695,0.00013118384,0.000056446494,0.00004447516,0.00016381616,0.00014405652,0.8397217,0.009779564,0.119525716,0.03020744,0.0000688919],"about_ca_topic_score_codex":0.0065154023,"about_ca_topic_score_gemma":0.005348885,"teacher_disagreement_score":0.00697046,"about_ca_system_score_codex":0.0028126235,"about_ca_system_score_gemma":0.0032287685,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08906593,0.0006279318,0.9030675,0.0013423705,0.00020395391,0.00014083447,0.00032318302,0.00073282764,0.004495398],"genre_scores_gemma":[0.9395149,0.0002929848,0.057073604,0.00031840394,0.00014693096,0.00016676936,0.0001751549,0.00009194503,0.0022193068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973635,0.00086018234,0.0001033212,0.00041138357,0.000596497,0.000665161],"domain_scores_gemma":[0.9858683,0.009948368,0.0011431815,0.0010794516,0.0011012222,0.00085961685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037638848,0.0010672696,0.0017609617,0.0007955275,0.0013665622,0.0016053641,0.0021309005,0.0012666574,0.0033815377],"category_scores_gemma":[0.025340201,0.00079569424,0.0004520249,0.0011009644,0.0015237449,0.0031772526,0.0024752226,0.0018568168,0.0006937503],"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.0018491528,0.00018826575,0.001922515,0.00045012968,0.0000811109,0.0008475947,0.00063980446,0.78084433,0.01114764,0.16608784,0.007042143,0.028899472],"study_design_scores_gemma":[0.000076624674,0.00008404635,0.00022910205,0.000020687687,0.000010955465,0.00010867997,0.00006580323,0.93825525,0.0010351157,0.059459407,0.00062716694,0.00002703391],"about_ca_topic_score_codex":0.0031528503,"about_ca_topic_score_gemma":0.0029260628,"teacher_disagreement_score":0.0037638848,"about_ca_system_score_codex":0.0016342184,"about_ca_system_score_gemma":0.0025396128,"threshold_uncertainty_score":0.019905567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027756577,0.00031339593,0.9894404,0.00023578727,0.00005762202,0.000020379928,0.00006373859,0.00007289074,0.007020241],"genre_scores_gemma":[0.41300392,0.001966872,0.5769861,0.0005457214,0.00029457858,0.0002586053,0.00021534119,0.00016033166,0.0065686028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992225,0.00026118665,0.000044189263,0.00012186906,0.0002842445,0.00006597921],"domain_scores_gemma":[0.9986627,0.00085968093,0.00008111004,0.00022464959,0.00012578658,0.000046038578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137919,0.00079718634,0.00069054804,0.00060776854,0.00050133216,0.0016333325,0.0013492847,0.0008486288,0.0029096513],"category_scores_gemma":[0.0039592586,0.00035559246,0.000703506,0.00080309,0.00228732,0.0026133398,0.001528577,0.002988437,0.0005959146],"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.0000377712,0.00002861285,0.00013291315,0.00006924188,0.000011009429,0.00008306823,0.000103753926,0.093794,0.001992139,0.8867219,0.00093550206,0.016089987],"study_design_scores_gemma":[0.00001669616,0.000034797853,0.000051659117,0.00003896643,0.000008330611,0.00008763836,0.000030857427,0.5698764,0.002184028,0.42229813,0.0053502205,0.000022298378],"about_ca_topic_score_codex":0.0017784492,"about_ca_topic_score_gemma":0.0015732568,"teacher_disagreement_score":0.0029096513,"about_ca_system_score_codex":0.0015285915,"about_ca_system_score_gemma":0.0012220639,"threshold_uncertainty_score":0.011090755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47687557,0.0037285998,0.47709885,0.0035307214,0.0003735658,0.00008851,0.0005819685,0.00061421306,0.037108038],"genre_scores_gemma":[0.9806608,0.00071764796,0.0150273135,0.00031645788,0.000085931606,0.00004618026,0.00010233136,0.0001038926,0.0029392908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981515,0.00051962957,0.000079209305,0.00034363175,0.00046326514,0.00044271178],"domain_scores_gemma":[0.97168195,0.020474432,0.002259078,0.0035932453,0.0014711756,0.0005201194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111553,0.00095001014,0.0010373836,0.00094754726,0.0008904825,0.0021725306,0.0014783414,0.0012912287,0.002454146],"category_scores_gemma":[0.039960906,0.00056599674,0.00043810406,0.00073522667,0.0029130452,0.00460571,0.0021555913,0.002887584,0.00044107632],"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.00154916,0.000099331104,0.004981263,0.00055022596,0.00016354393,0.0008146926,0.000509949,0.30009234,0.030000722,0.6019718,0.005567302,0.05369966],"study_design_scores_gemma":[0.00008233445,0.00029961552,0.0019506454,0.00016434297,0.00009712441,0.00081699924,0.00016042976,0.7375714,0.028433502,0.22744294,0.0028663005,0.0001143779],"about_ca_topic_score_codex":0.0011225304,"about_ca_topic_score_gemma":0.0013268592,"teacher_disagreement_score":0.003111553,"about_ca_system_score_codex":0.0018690616,"about_ca_system_score_gemma":0.0016373269,"threshold_uncertainty_score":0.01645565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029749453,0.00088991126,0.964464,0.0012763381,0.00007869982,0.000042546326,0.00006396787,0.0003644117,0.0030707093],"genre_scores_gemma":[0.7775821,0.0015376657,0.21438792,0.0012522165,0.0003963072,0.0002468611,0.00032819042,0.0006105025,0.003658243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99124193,0.003852313,0.00051060604,0.0016074772,0.0022492693,0.0005384169],"domain_scores_gemma":[0.96772546,0.017772485,0.0024798764,0.009264187,0.0021661757,0.00059180375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012927352,0.0014688274,0.0018466804,0.0015605303,0.0012577483,0.002330446,0.0020524042,0.0020844205,0.0019171989],"category_scores_gemma":[0.0702035,0.0008436824,0.0018744112,0.0014893664,0.005421626,0.005568618,0.0055726087,0.006372523,0.0005848185],"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.00038854347,0.00011850307,0.0068203853,0.00033440473,0.00018437215,0.0005463577,0.0008492912,0.29285383,0.0058953846,0.5673572,0.004980668,0.1196711],"study_design_scores_gemma":[0.000011144943,0.00007441829,0.0007319338,0.00008390559,0.000021429974,0.00019324667,0.00006368388,0.5969594,0.0032491793,0.39619026,0.0023917698,0.000029593479],"about_ca_topic_score_codex":0.0012708881,"about_ca_topic_score_gemma":0.0008777793,"teacher_disagreement_score":0.012927352,"about_ca_system_score_codex":0.0016393375,"about_ca_system_score_gemma":0.0009942931,"threshold_uncertainty_score":0.06836718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2200772,0.00049974915,0.7607628,0.0016935779,0.00004682611,0.00021435665,0.00043433576,0.00026609248,0.016005056],"genre_scores_gemma":[0.9411923,0.00042993037,0.04900518,0.00029307327,0.0000510194,0.0002988995,0.00021844047,0.00010916354,0.008401848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975828,0.0010465794,0.0001051501,0.0003792987,0.00041113512,0.0004750442],"domain_scores_gemma":[0.9808806,0.014593217,0.0019955027,0.0006600243,0.0009310502,0.00093955017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003713392,0.0014970647,0.002569037,0.0011369701,0.0012355644,0.0031936807,0.0029845452,0.0026486244,0.007767964],"category_scores_gemma":[0.025356377,0.0008730053,0.0015312721,0.0013577,0.0029444054,0.0054132785,0.0022978112,0.0035807975,0.0008844626],"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.000566228,0.00021417004,0.0011866837,0.00019062526,0.000073261435,0.00041473896,0.00045185324,0.22475716,0.0057962285,0.75494957,0.0015182665,0.009881194],"study_design_scores_gemma":[0.000104933606,0.00007918493,0.00032092383,0.0000428339,0.000018534498,0.0001301382,0.00015284153,0.7294024,0.0011708562,0.26784113,0.0006950265,0.00004120113],"about_ca_topic_score_codex":0.0019619835,"about_ca_topic_score_gemma":0.0013806899,"teacher_disagreement_score":0.007767964,"about_ca_system_score_codex":0.0029287431,"about_ca_system_score_gemma":0.0013713391,"threshold_uncertainty_score":0.025986493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048222438,0.0017631886,0.9218286,0.00079081807,0.00019609134,0.00008720982,0.0005361928,0.00022735627,0.026348155],"genre_scores_gemma":[0.8835818,0.0046354486,0.092169546,0.0005809339,0.0005873673,0.0003121249,0.0007789149,0.00017412241,0.017179854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989517,0.0003126012,0.000038640228,0.0001580665,0.00024827258,0.00029070827],"domain_scores_gemma":[0.9983311,0.0007550793,0.00040976048,0.00015511189,0.00024954788,0.000099344536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008638354,0.001579185,0.0010032554,0.0004766622,0.00095442974,0.00170537,0.0013735075,0.0015607873,0.0061042644],"category_scores_gemma":[0.002277375,0.00041205445,0.000851113,0.0016442029,0.0015961872,0.0017824748,0.0016541902,0.0014398799,0.0023915854],"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.0004899331,0.00013264558,0.002053874,0.00052515627,0.00007201423,0.0012517313,0.0003217495,0.75938696,0.010165886,0.19132659,0.0058970875,0.02837635],"study_design_scores_gemma":[0.00003385945,0.00013401077,0.00063567027,0.000047393485,0.00004107083,0.00062822044,0.00013302674,0.9531451,0.0034970639,0.03830244,0.0033347774,0.00006736865],"about_ca_topic_score_codex":0.0028767323,"about_ca_topic_score_gemma":0.0020131003,"teacher_disagreement_score":0.0061042644,"about_ca_system_score_codex":0.0010540552,"about_ca_system_score_gemma":0.0011996278,"threshold_uncertainty_score":0.02042079},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.18658403,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34321123,0.0022955064,0.4875877,0.0024527945,0.0003453485,0.00007673141,0.00018102121,0.00034517102,0.16350457],"genre_scores_gemma":[0.9618963,0.0009767658,0.026637414,0.0003287249,0.00014701922,0.00011639698,0.00009567855,0.0000786292,0.009723041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993013,0.0002084652,0.000020502379,0.00011907715,0.00022538957,0.00012523362],"domain_scores_gemma":[0.9986047,0.00072117045,0.00020919545,0.0002317971,0.000122487,0.000110713525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008226227,0.00071442727,0.0008396963,0.0006527801,0.000849573,0.00196562,0.0009846048,0.0015733916,0.0038945135],"category_scores_gemma":[0.0029164169,0.000502416,0.0005517485,0.00041730184,0.0035877747,0.00288832,0.0019043067,0.0016300164,0.00069609465],"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.00015812782,0.000043095137,0.00028236577,0.00011382602,0.000015982881,0.00015325689,0.00017107464,0.049144812,0.012356959,0.9299687,0.00076329627,0.006828474],"study_design_scores_gemma":[0.00005892772,0.00020485185,0.00057552045,0.000055883287,0.000016549264,0.00030122933,0.00015221802,0.49297604,0.005690946,0.49449977,0.0053832796,0.00008488376],"about_ca_topic_score_codex":0.0004752367,"about_ca_topic_score_gemma":0.00026792896,"teacher_disagreement_score":0.0038945135,"about_ca_system_score_codex":0.00081173825,"about_ca_system_score_gemma":0.00044333193,"threshold_uncertainty_score":0.013028443},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.18658403,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.81500226,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075886752,0.03450608,0.37589628,0.028927293,0.052169286,0.00078925234,0.03879711,0.0064008934,0.45492515],"genre_scores_gemma":[0.11858974,0.06850063,0.090462565,0.0051360684,0.01373131,0.00089299027,0.056598403,0.0027871744,0.6433012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794954,0.00033785796,0.000169827,0.00021402955,0.0011793278,0.000149413],"domain_scores_gemma":[0.9937953,0.0020618648,0.00021209495,0.0015606398,0.002160756,0.00020940119],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021437379,0.0013837162,0.0021563147,0.0039232336,0.0009921466,0.0045337295,0.0012955151,0.0022782085,0.23127455],"category_scores_gemma":[0.012982578,0.00062062254,0.0008206204,0.0050654747,0.0008102244,0.0045962213,0.0018308015,0.0027652583,0.098597996],"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.0001775029,0.00013199805,0.0006146807,0.000867521,0.00005735344,0.0001520026,0.00004537619,0.0031645668,0.0010952258,0.06849876,0.5728305,0.35236454],"study_design_scores_gemma":[0.00007642604,0.00010941409,0.001258478,0.0008973995,0.00015124984,0.00054662244,0.00010854275,0.034255814,0.0032187246,0.18546115,0.7738345,0.00008166401],"about_ca_topic_score_codex":0.0014729707,"about_ca_topic_score_gemma":0.0012031312,"teacher_disagreement_score":0.76872545,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023775187,"threshold_uncertainty_score":0.77369046},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079091275,0.03755039,0.42466298,0.025495855,0.042800706,0.00075192185,0.03140446,0.005755368,0.4236692],"genre_scores_gemma":[0.13355762,0.07424585,0.10541926,0.0047936672,0.012029835,0.0009198664,0.048963323,0.00227613,0.6177945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803704,0.00033869187,0.00016374774,0.00019873674,0.001125958,0.00013587455],"domain_scores_gemma":[0.9945709,0.0017822967,0.00019389545,0.0014115663,0.0018734253,0.00016799562],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020160223,0.0013117128,0.0020686707,0.0038707089,0.0009730602,0.004412817,0.0011944221,0.0021146517,0.1867627],"category_scores_gemma":[0.01151466,0.0005862424,0.00079467165,0.0051745386,0.0008250657,0.0045223697,0.0017605267,0.0025047946,0.07623412],"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.00017339068,0.0001256474,0.00070909905,0.00087392353,0.00006486732,0.00016038366,0.000052595475,0.0034882312,0.0011181703,0.081756964,0.5115632,0.3999136],"study_design_scores_gemma":[0.0000704554,0.0001089552,0.0013712166,0.000903883,0.00017071984,0.0005743178,0.000120662466,0.037477564,0.003340284,0.21059091,0.7451893,0.00008171901],"about_ca_topic_score_codex":0.0014628328,"about_ca_topic_score_gemma":0.0012368626,"teacher_disagreement_score":0.8132373,"about_ca_system_score_codex":0.0010147836,"about_ca_system_score_gemma":0.0021953448,"threshold_uncertainty_score":0.6247835},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075886752,0.03450608,0.37589628,0.028927293,0.052169286,0.00078925234,0.03879711,0.0064008934,0.45492515],"genre_scores_gemma":[0.11858974,0.06850063,0.090462565,0.0051360684,0.01373131,0.00089299027,0.056598403,0.0027871744,0.6433012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794954,0.00033785796,0.000169827,0.00021402955,0.0011793278,0.000149413],"domain_scores_gemma":[0.9937953,0.0020618648,0.00021209495,0.0015606398,0.002160756,0.00020940119],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021437379,0.0013837162,0.0021563147,0.0039232336,0.0009921466,0.0045337295,0.0012955151,0.0022782085,0.23127455],"category_scores_gemma":[0.012982578,0.00062062254,0.0008206204,0.0050654747,0.0008102244,0.0045962213,0.0018308015,0.0027652583,0.098597996],"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.0001775029,0.00013199805,0.0006146807,0.000867521,0.00005735344,0.0001520026,0.00004537619,0.0031645668,0.0010952258,0.06849876,0.5728305,0.35236454],"study_design_scores_gemma":[0.00007642604,0.00010941409,0.001258478,0.0008973995,0.00015124984,0.00054662244,0.00010854275,0.034255814,0.0032187246,0.18546115,0.7738345,0.00008166401],"about_ca_topic_score_codex":0.0014729707,"about_ca_topic_score_gemma":0.0012031312,"teacher_disagreement_score":0.76872545,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023775187,"threshold_uncertainty_score":0.77369046},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079091275,0.03755039,0.42466298,0.025495855,0.042800706,0.00075192185,0.03140446,0.005755368,0.4236692],"genre_scores_gemma":[0.13355762,0.07424585,0.10541926,0.0047936672,0.012029835,0.0009198664,0.048963323,0.00227613,0.6177945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803704,0.00033869187,0.00016374774,0.00019873674,0.001125958,0.00013587455],"domain_scores_gemma":[0.9945709,0.0017822967,0.00019389545,0.0014115663,0.0018734253,0.00016799562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020160223,0.0013117128,0.0020686707,0.0038707089,0.0009730602,0.004412817,0.0011944221,0.0021146517,0.1867627],"category_scores_gemma":[0.01151466,0.0005862424,0.00079467165,0.0051745386,0.0008250657,0.0045223697,0.0017605267,0.0025047946,0.07623412],"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.00017339068,0.0001256474,0.00070909905,0.00087392353,0.00006486732,0.00016038366,0.000052595475,0.0034882312,0.0011181703,0.081756964,0.5115632,0.3999136],"study_design_scores_gemma":[0.0000704554,0.0001089552,0.0013712166,0.000903883,0.00017071984,0.0005743178,0.000120662466,0.037477564,0.003340284,0.21059091,0.7451893,0.00008171901],"about_ca_topic_score_codex":0.0014628328,"about_ca_topic_score_gemma":0.0012368626,"teacher_disagreement_score":0.1867627,"about_ca_system_score_codex":0.0010147836,"about_ca_system_score_gemma":0.0021953448,"threshold_uncertainty_score":0.6247835},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007630523,0.036449492,0.3967322,0.027924532,0.048095964,0.0007562309,0.03403828,0.00614095,0.44223198],"genre_scores_gemma":[0.12367172,0.0703073,0.09714296,0.005033089,0.013124351,0.0008795162,0.051890098,0.002578398,0.63537264],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979766,0.00033619188,0.0001684629,0.00020831136,0.001166879,0.00014360776],"domain_scores_gemma":[0.9941602,0.0019406211,0.00020380305,0.0014763966,0.0020270508,0.00019189817],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020985992,0.0013364143,0.002099609,0.003911759,0.0009687994,0.0045251613,0.0012487242,0.0022127526,0.20849873],"category_scores_gemma":[0.012298231,0.00060423237,0.00081521715,0.0050242073,0.000823775,0.0045335377,0.0018301125,0.002672678,0.08831038],"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.00016826339,0.00012829731,0.0006506261,0.00086315366,0.000061345636,0.00015395603,0.00004772375,0.0032975161,0.0011016104,0.07365642,0.54315656,0.37671453],"study_design_scores_gemma":[0.00007064382,0.000105349965,0.0012704858,0.0009066583,0.00015354357,0.0005512421,0.00011218779,0.035644572,0.003219291,0.19575356,0.76213276,0.000079672325],"about_ca_topic_score_codex":0.0014660577,"about_ca_topic_score_gemma":0.0012081917,"teacher_disagreement_score":0.7915013,"about_ca_system_score_codex":0.001034928,"about_ca_system_score_gemma":0.0023356415,"threshold_uncertainty_score":0.6974977},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.81500226,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075886752,0.03450608,0.37589628,0.028927293,0.052169286,0.00078925234,0.03879711,0.0064008934,0.45492515],"genre_scores_gemma":[0.11858974,0.06850063,0.090462565,0.0051360684,0.01373131,0.00089299027,0.056598403,0.0027871744,0.6433012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794954,0.00033785796,0.000169827,0.00021402955,0.0011793278,0.000149413],"domain_scores_gemma":[0.9937953,0.0020618648,0.00021209495,0.0015606398,0.002160756,0.00020940119],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021437379,0.0013837162,0.0021563147,0.0039232336,0.0009921466,0.0045337295,0.0012955151,0.0022782085,0.23127455],"category_scores_gemma":[0.012982578,0.00062062254,0.0008206204,0.0050654747,0.0008102244,0.0045962213,0.0018308015,0.0027652583,0.098597996],"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.0001775029,0.00013199805,0.0006146807,0.000867521,0.00005735344,0.0001520026,0.00004537619,0.0031645668,0.0010952258,0.06849876,0.5728305,0.35236454],"study_design_scores_gemma":[0.00007642604,0.00010941409,0.001258478,0.0008973995,0.00015124984,0.00054662244,0.00010854275,0.034255814,0.0032187246,0.18546115,0.7738345,0.00008166401],"about_ca_topic_score_codex":0.0014729707,"about_ca_topic_score_gemma":0.0012031312,"teacher_disagreement_score":0.76872545,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023775187,"threshold_uncertainty_score":0.77369046},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079091275,0.03755039,0.42466298,0.025495855,0.042800706,0.00075192185,0.03140446,0.005755368,0.4236692],"genre_scores_gemma":[0.13355762,0.07424585,0.10541926,0.0047936672,0.012029835,0.0009198664,0.048963323,0.00227613,0.6177945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803704,0.00033869187,0.00016374774,0.00019873674,0.001125958,0.00013587455],"domain_scores_gemma":[0.9945709,0.0017822967,0.00019389545,0.0014115663,0.0018734253,0.00016799562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020160223,0.0013117128,0.0020686707,0.0038707089,0.0009730602,0.004412817,0.0011944221,0.0021146517,0.1867627],"category_scores_gemma":[0.01151466,0.0005862424,0.00079467165,0.0051745386,0.0008250657,0.0045223697,0.0017605267,0.0025047946,0.07623412],"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.00017339068,0.0001256474,0.00070909905,0.00087392353,0.00006486732,0.00016038366,0.000052595475,0.0034882312,0.0011181703,0.081756964,0.5115632,0.3999136],"study_design_scores_gemma":[0.0000704554,0.0001089552,0.0013712166,0.000903883,0.00017071984,0.0005743178,0.000120662466,0.037477564,0.003340284,0.21059091,0.7451893,0.00008171901],"about_ca_topic_score_codex":0.0014628328,"about_ca_topic_score_gemma":0.0012368626,"teacher_disagreement_score":0.1867627,"about_ca_system_score_codex":0.0010147836,"about_ca_system_score_gemma":0.0021953448,"threshold_uncertainty_score":0.6247835},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.81500226,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.81500226,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.81500226,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.18499774,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075886752,0.03450608,0.37589628,0.028927293,0.052169286,0.00078925234,0.03879711,0.0064008934,0.45492515],"genre_scores_gemma":[0.11858974,0.06850063,0.090462565,0.0051360684,0.01373131,0.00089299027,0.056598403,0.0027871744,0.6433012],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794954,0.00033785796,0.000169827,0.00021402955,0.0011793278,0.000149413],"domain_scores_gemma":[0.9937953,0.0020618648,0.00021209495,0.0015606398,0.002160756,0.00020940119],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021437379,0.0013837162,0.0021563147,0.0039232336,0.0009921466,0.0045337295,0.0012955151,0.0022782085,0.23127455],"category_scores_gemma":[0.012982578,0.00062062254,0.0008206204,0.0050654747,0.0008102244,0.0045962213,0.0018308015,0.0027652583,0.098597996],"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.0001775029,0.00013199805,0.0006146807,0.000867521,0.00005735344,0.0001520026,0.00004537619,0.0031645668,0.0010952258,0.06849876,0.5728305,0.35236454],"study_design_scores_gemma":[0.00007642604,0.00010941409,0.001258478,0.0008973995,0.00015124984,0.00054662244,0.00010854275,0.034255814,0.0032187246,0.18546115,0.7738345,0.00008166401],"about_ca_topic_score_codex":0.0014729707,"about_ca_topic_score_gemma":0.0012031312,"teacher_disagreement_score":0.76872545,"about_ca_system_score_codex":0.0010227711,"about_ca_system_score_gemma":0.0023775187,"threshold_uncertainty_score":0.77369046},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685056,0.040465705,0.41808102,0.02506351,0.04612417,0.000768203,0.030053955,0.005549991,0.42620844],"genre_scores_gemma":[0.122801326,0.07575902,0.10311073,0.0047494355,0.012413274,0.0009117524,0.048232794,0.0021712712,0.6298504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980856,0.0003394827,0.00015933822,0.00018997153,0.0010984318,0.00012714314],"domain_scores_gemma":[0.99481934,0.0017338797,0.00018284685,0.0012878221,0.0018059026,0.00017020266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010765,0.0012870186,0.002069679,0.0038233974,0.0009367815,0.0043012095,0.001149016,0.0020608127,0.18499774],"category_scores_gemma":[0.01094879,0.00057128386,0.000768873,0.0049888906,0.0008021027,0.004122502,0.0017218122,0.002442378,0.075375594],"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.00016672397,0.00012354781,0.0006889728,0.00089499366,0.0000646775,0.00014958144,0.00005247238,0.0033523254,0.0011527906,0.077194825,0.51723707,0.398922],"study_design_scores_gemma":[0.00006777776,0.00010850995,0.0013717826,0.00090496,0.00015986768,0.0005224925,0.00011307768,0.035070773,0.0030674974,0.18424289,0.77429456,0.00007579623],"about_ca_topic_score_codex":0.0014958134,"about_ca_topic_score_gemma":0.0012613396,"teacher_disagreement_score":0.18499774,"about_ca_system_score_codex":0.000997073,"about_ca_system_score_gemma":0.0021575359,"threshold_uncertainty_score":0.6188791},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.99619734,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13442749,0.0033599685,0.8560333,0.00040266535,0.00008896057,0.00007381396,0.0001229336,0.00040484953,0.005085938],"genre_scores_gemma":[0.9493424,0.002216971,0.045548744,0.00007464289,0.000073551004,0.00010144145,0.000096188945,0.00003415615,0.0025119216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991279,0.00029551022,0.00004574327,0.00008445736,0.00031805338,0.00012832333],"domain_scores_gemma":[0.99448663,0.0039511262,0.0005792085,0.00033616612,0.00054384256,0.00010306819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012441244,0.0009118471,0.0007471905,0.0008655034,0.0003730557,0.0007539597,0.0008874015,0.0007213576,0.00076995115],"category_scores_gemma":[0.0061986567,0.00037290403,0.00037812695,0.0008595961,0.0009771116,0.0015261765,0.0011167293,0.00097357674,0.00022837229],"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.00029733888,0.00007081402,0.00074366597,0.00038780412,0.000073791285,0.00041660736,0.00041480132,0.77963823,0.020208051,0.13565184,0.0013094308,0.06078764],"study_design_scores_gemma":[0.000017759365,0.00010159095,0.00012216541,0.000021380165,0.000016786735,0.00010899928,0.000030896415,0.97614515,0.004664169,0.017925076,0.00082576985,0.000020141584],"about_ca_topic_score_codex":0.0015638086,"about_ca_topic_score_gemma":0.0011626052,"teacher_disagreement_score":0.0015638086,"about_ca_system_score_codex":0.0010090999,"about_ca_system_score_gemma":0.000684733,"threshold_uncertainty_score":0.007321596},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073632444,0.041065272,0.4078097,0.025557896,0.04692853,0.0007379434,0.02859816,0.005462615,0.43647674],"genre_scores_gemma":[0.12103247,0.07721286,0.099727295,0.0049459753,0.012654195,0.0008991606,0.04606473,0.002194734,0.63526857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980058,0.0003531626,0.00016168886,0.00020072536,0.0011487462,0.00012988472],"domain_scores_gemma":[0.9946779,0.0017836735,0.0001828315,0.0013241188,0.0018538217,0.0001776851],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020620713,0.0012995908,0.0020753695,0.0038026476,0.00096002803,0.004441838,0.0011496176,0.0020986642,0.18658403],"category_scores_gemma":[0.011094833,0.00058022304,0.0007657712,0.005049121,0.00082062976,0.0042192605,0.0017576806,0.0025192474,0.07861321],"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.00016382568,0.00012273522,0.0006897795,0.00085827295,0.00006272511,0.00014853044,0.00005241059,0.0032309913,0.0011106146,0.07595082,0.524427,0.3931823],"study_design_scores_gemma":[0.00006565506,0.00010452829,0.0013115945,0.0008803995,0.00015325854,0.00051396637,0.00011317045,0.033855367,0.0028811428,0.1821534,0.77789456,0.00007305823],"about_ca_topic_score_codex":0.0014865134,"about_ca_topic_score_gemma":0.0012459535,"teacher_disagreement_score":0.813416,"about_ca_system_score_codex":0.001008677,"about_ca_system_score_gemma":0.0021853258,"threshold_uncertainty_score":0.62418574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037324756,0.00023427364,0.95757186,0.00011366284,0.000049346032,0.000028722328,0.00002752294,0.00024973284,0.0044001504],"genre_scores_gemma":[0.94307494,0.00015349554,0.055250205,0.00007281216,0.000032789696,0.00005484908,0.00003228947,0.000015953865,0.0013127023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960786,0.000101823985,0.000015171533,0.000081308,0.00012333422,0.00007060201],"domain_scores_gemma":[0.9996105,0.000119496974,0.000100314755,0.000060596358,0.00007459197,0.000034471494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034532545,0.00069355685,0.00052091683,0.00020163589,0.0002954263,0.0006523762,0.00077042496,0.00048845063,0.001188862],"category_scores_gemma":[0.0010090282,0.00022364824,0.00031933963,0.0002966611,0.0004377703,0.0005847736,0.00074081303,0.0005133587,0.0003784501],"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.00024764152,0.00007656637,0.0012147276,0.00016565011,0.00006330793,0.00035461935,0.00020825582,0.80603504,0.05922987,0.019527307,0.0013638085,0.11151324],"study_design_scores_gemma":[0.000010115323,0.00017432887,0.00020708327,0.000006611943,0.000010997285,0.000080988546,0.000023742607,0.9936515,0.0033846544,0.0015421788,0.000896848,0.000010872646],"about_ca_topic_score_codex":0.0006974576,"about_ca_topic_score_gemma":0.0009890863,"teacher_disagreement_score":0.001188862,"about_ca_system_score_codex":0.0003461998,"about_ca_system_score_gemma":0.00039288113,"threshold_uncertainty_score":0.0039771795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03870889,0.00061415776,0.95182025,0.0009617159,0.000067399975,0.00015862132,0.00041782224,0.0017388536,0.005512425],"genre_scores_gemma":[0.6710649,0.00037576465,0.31902263,0.0010618329,0.00016800931,0.0006348868,0.0015982242,0.00067144027,0.0054022945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99211675,0.0035026788,0.0003512396,0.0015313923,0.0015604799,0.00093749457],"domain_scores_gemma":[0.963648,0.025712762,0.002963494,0.0050493246,0.0015587093,0.0010677412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007405807,0.0024027869,0.0034480237,0.0016877635,0.0012887826,0.004063172,0.0038410327,0.0039642695,0.007495093],"category_scores_gemma":[0.05236611,0.0013304062,0.001574445,0.0016234654,0.0023044024,0.004386012,0.0050614104,0.0036648107,0.0026793173],"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.0020495357,0.0003518431,0.0035887826,0.0005568626,0.00025030252,0.00023382214,0.00023252459,0.73224854,0.007089064,0.09826791,0.011300917,0.14382996],"study_design_scores_gemma":[0.00008282292,0.00014848007,0.0003840519,0.000051896575,0.000029126477,0.00009259562,0.00003366209,0.92767286,0.0025005897,0.06806337,0.00090477173,0.000035782094],"about_ca_topic_score_codex":0.0011938848,"about_ca_topic_score_gemma":0.0013837452,"teacher_disagreement_score":0.007495093,"about_ca_system_score_codex":0.0019685528,"about_ca_system_score_gemma":0.0038182505,"threshold_uncertainty_score":0.039166093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082694024,0.0040736934,0.89327615,0.0015106752,0.0003626324,0.000103425555,0.00068149186,0.0010399084,0.016257979],"genre_scores_gemma":[0.8237045,0.0030344944,0.15828373,0.00076336815,0.0011344652,0.00037898132,0.00093772844,0.0010475158,0.010715278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943369,0.0013283007,0.00025066923,0.00072811777,0.0025187978,0.0008371674],"domain_scores_gemma":[0.9715507,0.01905315,0.0016044341,0.0032236357,0.0037706888,0.00079741055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073783947,0.0024605878,0.0018552787,0.0066152955,0.0010746768,0.0031159443,0.0037645875,0.0018846627,0.005127814],"category_scores_gemma":[0.040447112,0.0008498265,0.0015179841,0.002570598,0.0033274463,0.007659211,0.005101495,0.0056241844,0.0018208442],"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.0005315749,0.00015815828,0.0029686242,0.00034299592,0.00007258602,0.00030582145,0.00058308383,0.13001852,0.023031468,0.78943485,0.0041477303,0.048404593],"study_design_scores_gemma":[0.000033756794,0.00009849393,0.0011336231,0.0001427042,0.000036195004,0.0002831583,0.000060686485,0.6397826,0.01391551,0.34075361,0.0036400384,0.00011954443],"about_ca_topic_score_codex":0.0013142031,"about_ca_topic_score_gemma":0.0010684865,"teacher_disagreement_score":0.0073783947,"about_ca_system_score_codex":0.0048349937,"about_ca_system_score_gemma":0.0012958619,"threshold_uncertainty_score":0.039021194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24011858,0.005875546,0.43688992,0.032505546,0.0011606009,0.00011432053,0.0008840938,0.0010751005,0.28137636],"genre_scores_gemma":[0.9660184,0.001064762,0.023010263,0.0011712271,0.00058587635,0.00006780692,0.0000905982,0.00011554647,0.00787543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950206,0.0001722039,0.000011436118,0.00010895091,0.00013834491,0.00006702651],"domain_scores_gemma":[0.9987546,0.00070217997,0.000079289675,0.00026806857,0.00008722248,0.00010850748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067675975,0.00028514687,0.00037412075,0.00062506634,0.0013532063,0.0019973067,0.0005689863,0.0018017045,0.005726716],"category_scores_gemma":[0.0035169923,0.00023974126,0.00032158213,0.00035759207,0.0066982075,0.0068149087,0.0014596727,0.0035078446,0.00053597515],"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.000017999337,0.0000047168924,0.000068636306,0.000011943193,0.0000029842754,0.00002706165,0.000047488284,0.0016167018,0.0008007762,0.9942252,0.0012170154,0.0019594561],"study_design_scores_gemma":[0.000007492766,0.0000112679,0.0001265005,0.000013226016,0.0000019838617,0.000071214105,0.00003749364,0.013819876,0.00044212805,0.9799116,0.0055459645,0.000011124906],"about_ca_topic_score_codex":0.0007401966,"about_ca_topic_score_gemma":0.00038617456,"teacher_disagreement_score":0.005726716,"about_ca_system_score_codex":0.0008802225,"about_ca_system_score_gemma":0.0005551449,"threshold_uncertainty_score":0.019157827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05823603,0.00030315694,0.9345336,0.00031230267,0.00009214418,0.0000982316,0.000108609354,0.00056491117,0.005751029],"genre_scores_gemma":[0.7965564,0.00024181636,0.19593336,0.00021333383,0.000043628454,0.0002350193,0.00030089053,0.00041454576,0.006061045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00022590172,0.0000333788,0.00012346455,0.00019674825,0.00023357103],"domain_scores_gemma":[0.9981635,0.0011323532,0.0001654695,0.00016310932,0.00022035399,0.00015517669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013744372,0.0010088682,0.00089755916,0.00072864594,0.0005479781,0.0011592921,0.0016879644,0.00084166694,0.002893634],"category_scores_gemma":[0.004877139,0.00044022276,0.0005850959,0.0008428503,0.0012105671,0.0012008253,0.0013411524,0.0013380973,0.00031790798],"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.00015961601,0.000044626177,0.00024408221,0.000055731412,0.000016263466,0.00003199659,0.00004267138,0.96408105,0.0012140196,0.015894545,0.0012485685,0.016966853],"study_design_scores_gemma":[0.000006395646,0.00001777755,0.00004270904,0.0000039913307,0.0000030232857,0.0000056206804,0.000010771795,0.9944728,0.0003659275,0.0047914134,0.00027669113,0.0000029291932],"about_ca_topic_score_codex":0.0051509365,"about_ca_topic_score_gemma":0.0039132936,"teacher_disagreement_score":0.0051509365,"about_ca_system_score_codex":0.0019620266,"about_ca_system_score_gemma":0.0021978114,"threshold_uncertainty_score":0.0142354965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067144533,0.00007476975,0.9987987,0.000051071565,0.000013615376,0.000013918636,0.000023437833,0.00006175311,0.00029133147],"genre_scores_gemma":[0.17021684,0.0009901901,0.8212227,0.00034373224,0.00035488946,0.0006806061,0.00056498696,0.00045420625,0.0051717577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952166,0.002171808,0.00029060847,0.00090164685,0.0011168842,0.00030237762],"domain_scores_gemma":[0.97182006,0.021964923,0.0017144041,0.0022122252,0.0017039614,0.0005844994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01158974,0.0026164874,0.0022168073,0.0030488262,0.0006346884,0.0024448272,0.0033490448,0.0018085324,0.0045892],"category_scores_gemma":[0.04469908,0.0013745342,0.0024459357,0.0018593143,0.0033674834,0.0048885937,0.0046625305,0.0062781107,0.00097478426],"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.000110007386,0.000098178905,0.0010840134,0.00026400678,0.00016341342,0.00014940216,0.00016824125,0.28011593,0.0028351939,0.65906733,0.0014185215,0.054525655],"study_design_scores_gemma":[0.000012043763,0.000060550807,0.00015930756,0.000037077098,0.000017836639,0.000040129762,0.000009950542,0.8263358,0.0015510744,0.17016312,0.001588085,0.000025097957],"about_ca_topic_score_codex":0.0019715014,"about_ca_topic_score_gemma":0.0016437522,"teacher_disagreement_score":0.01158974,"about_ca_system_score_codex":0.0021236492,"about_ca_system_score_gemma":0.0025442203,"threshold_uncertainty_score":0.061293125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11096083,0.0021973592,0.88064873,0.00038151725,0.00008761133,0.000083442246,0.00010974701,0.0001673174,0.0053634453],"genre_scores_gemma":[0.9457612,0.0022943364,0.0487015,0.000082029466,0.00011113392,0.000088606896,0.00008476865,0.000035789602,0.0028405618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999175,0.00031552065,0.00003805708,0.0001475595,0.00019527086,0.00012848663],"domain_scores_gemma":[0.9964604,0.0023277523,0.0004262734,0.00022187189,0.00047120353,0.00009239457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011507581,0.00095251075,0.00079242775,0.0006312227,0.00057172397,0.0009424813,0.0010819162,0.0009204907,0.0012189175],"category_scores_gemma":[0.0046542836,0.0002852426,0.0005849696,0.0008155824,0.0012585309,0.0016472593,0.0008285594,0.00089132757,0.0002930019],"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.00030025566,0.00006152373,0.0008889551,0.00026747357,0.00007237544,0.0006316905,0.00034972635,0.80486035,0.015695708,0.14161293,0.0011949018,0.034064136],"study_design_scores_gemma":[0.000011938419,0.00009784869,0.00013436218,0.0000136015315,0.000023169952,0.00013849529,0.000041550014,0.9825417,0.0017134096,0.014421546,0.0008443463,0.000017990906],"about_ca_topic_score_codex":0.0038819364,"about_ca_topic_score_gemma":0.0022739538,"teacher_disagreement_score":0.0038819364,"about_ca_system_score_codex":0.0014469974,"about_ca_system_score_gemma":0.00071460864,"threshold_uncertainty_score":0.0104987025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58696395,0.0026976003,0.33493218,0.012739468,0.0002871635,0.00018768194,0.0015568257,0.0007888134,0.059846297],"genre_scores_gemma":[0.9467074,0.0015696449,0.03986526,0.0009413868,0.00046324247,0.0002501891,0.0013391345,0.00033890895,0.008524734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996222,0.0012121354,0.00015978656,0.00077285606,0.0010504578,0.0005828207],"domain_scores_gemma":[0.9711331,0.024572728,0.0011471211,0.00145057,0.0008748352,0.0008215652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018729503,0.0009810835,0.0017629126,0.0014626336,0.0021062735,0.003412521,0.0029260877,0.0032312956,0.007775995],"category_scores_gemma":[0.022536883,0.0008004367,0.001506906,0.001805133,0.0042490433,0.009425968,0.004781161,0.0059730695,0.0009810892],"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.00067288167,0.00029703585,0.0023418432,0.00072383584,0.00012011365,0.00033132226,0.0011331572,0.1832342,0.005743714,0.75899076,0.0112854885,0.035125695],"study_design_scores_gemma":[0.00007920771,0.000058969265,0.00048282286,0.000043496882,0.000019838692,0.00012234328,0.00015558423,0.16424425,0.0016700317,0.8306568,0.0024300767,0.000036490954],"about_ca_topic_score_codex":0.0023658269,"about_ca_topic_score_gemma":0.0012166365,"teacher_disagreement_score":0.007775995,"about_ca_system_score_codex":0.0027422535,"about_ca_system_score_gemma":0.0016587196,"threshold_uncertainty_score":0.026013315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035558708,0.00025718776,0.96036273,0.00023995728,0.000058350342,0.000055306777,0.00005695834,0.00014892711,0.003261904],"genre_scores_gemma":[0.9192313,0.00016248907,0.07806593,0.00010953901,0.00003405365,0.000107621825,0.00005728663,0.000015972866,0.0022157822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989796,0.00031842105,0.000058344354,0.00025322664,0.00028796258,0.00010242331],"domain_scores_gemma":[0.9990501,0.00044954586,0.00014824457,0.00012515558,0.00017255334,0.000054327036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016551141,0.0008903205,0.0008159551,0.00034800224,0.0004828907,0.000773267,0.0014019108,0.0010864167,0.0011950225],"category_scores_gemma":[0.0030194877,0.00027208586,0.00045353684,0.00046478794,0.0013786232,0.0010469172,0.0015643135,0.0011448975,0.0002049936],"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.0003119095,0.000055462657,0.0003339583,0.00012723917,0.000049269845,0.00015723286,0.00033459207,0.79269665,0.015014485,0.14670011,0.0010249919,0.043194067],"study_design_scores_gemma":[0.000022328073,0.00006222054,0.00006097101,0.0000118933685,0.000008396361,0.000025087806,0.000008015838,0.9895225,0.0011908943,0.008761893,0.0003067405,0.000019152347],"about_ca_topic_score_codex":0.0031437967,"about_ca_topic_score_gemma":0.0031649333,"teacher_disagreement_score":0.0031437967,"about_ca_system_score_codex":0.001266623,"about_ca_system_score_gemma":0.0012374647,"threshold_uncertainty_score":0.009190083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036251508,0.00019239979,0.95850044,0.00084109255,0.00006976903,0.00018736908,0.00035796885,0.0013901102,0.0022093228],"genre_scores_gemma":[0.36841977,0.00051135395,0.62293416,0.0004739819,0.00015024605,0.00069983175,0.0017396524,0.00080478884,0.0042661913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982333,0.00073197024,0.00010301129,0.00041626857,0.00037512166,0.00014030434],"domain_scores_gemma":[0.98809576,0.008498037,0.00041920095,0.0018139565,0.00073149276,0.0004414976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004085927,0.00095226656,0.0011199628,0.0010239576,0.0009264775,0.0023655838,0.0019519252,0.0012626197,0.0059612608],"category_scores_gemma":[0.026980659,0.0008278957,0.0010078821,0.00091872964,0.0018538126,0.004815357,0.0017133591,0.0021640942,0.0017001316],"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.0008973001,0.0003231636,0.007944674,0.00057209044,0.0002154384,0.00041016407,0.0006470929,0.33075878,0.009783711,0.5016274,0.012667546,0.13415273],"study_design_scores_gemma":[0.000079963094,0.000042645108,0.0004185727,0.000034695797,0.000015330483,0.00008570921,0.00005771567,0.8083967,0.0035653457,0.18552984,0.0017355271,0.00003795938],"about_ca_topic_score_codex":0.004737185,"about_ca_topic_score_gemma":0.0034132202,"teacher_disagreement_score":0.0059612608,"about_ca_system_score_codex":0.0013606462,"about_ca_system_score_gemma":0.001775602,"threshold_uncertainty_score":0.02160871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19860499,0.005360805,0.7267873,0.0018414205,0.00020102826,0.00015418694,0.0006537237,0.00088453374,0.06551204],"genre_scores_gemma":[0.836192,0.004032346,0.14696218,0.0006696591,0.00042194268,0.0006658452,0.00073650497,0.00045587262,0.0098636355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456525,0.0009659132,0.00027583606,0.000758381,0.0020970728,0.0013374347],"domain_scores_gemma":[0.9731767,0.018300554,0.0016643087,0.003755771,0.002140466,0.0009622483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029007187,0.001616609,0.0015864295,0.0024761693,0.002510113,0.003692767,0.0023531287,0.0014778614,0.004724554],"category_scores_gemma":[0.02142588,0.00089792395,0.0011200715,0.003698118,0.0041893017,0.00710227,0.007628849,0.0054263184,0.0012252307],"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.00024088119,0.00007562702,0.0012425632,0.0003128814,0.000037140086,0.00029385535,0.00075337244,0.030674623,0.008018508,0.9273922,0.002443568,0.028514883],"study_design_scores_gemma":[0.000048118833,0.00016121243,0.0006912401,0.00026480533,0.00007875823,0.0008405046,0.00034008958,0.118420765,0.016843865,0.846561,0.015650703,0.00009884781],"about_ca_topic_score_codex":0.0011137414,"about_ca_topic_score_gemma":0.001038636,"teacher_disagreement_score":0.004724554,"about_ca_system_score_codex":0.0029639108,"about_ca_system_score_gemma":0.0019160158,"threshold_uncertainty_score":0.02150482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03145587,0.0006646274,0.9637144,0.0005425752,0.000051806448,0.00006074784,0.00030389274,0.00039113782,0.0028149425],"genre_scores_gemma":[0.8030279,0.0018476334,0.18602301,0.0003646779,0.00019303946,0.0002683827,0.0010903095,0.00016220045,0.0070228544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00018354932,0.000023434452,0.00010503986,0.00020494341,0.00007283611],"domain_scores_gemma":[0.9978981,0.0011950048,0.00024304449,0.00038196615,0.00020577015,0.00007605607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009799798,0.00054183987,0.00067379675,0.00073356205,0.00032355892,0.00068334636,0.0011606318,0.0007026286,0.0017782976],"category_scores_gemma":[0.005153129,0.00024297072,0.00043135142,0.0011825366,0.0008889451,0.0020383485,0.0009070854,0.0010930451,0.00041070307],"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.00017183028,0.000070354225,0.00067621365,0.000112504466,0.00003233711,0.00014533509,0.00010530535,0.70905566,0.0063001853,0.21112259,0.0037151712,0.06849245],"study_design_scores_gemma":[0.0000049823907,0.000017355325,0.000073533454,0.000004753428,0.0000036442634,0.000024034736,0.0000064348665,0.9788118,0.0010162579,0.019451594,0.0005811436,0.000004479751],"about_ca_topic_score_codex":0.0035310893,"about_ca_topic_score_gemma":0.0033018745,"teacher_disagreement_score":0.0035310893,"about_ca_system_score_codex":0.0010060238,"about_ca_system_score_gemma":0.00081675715,"threshold_uncertainty_score":0.0072992444},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018410334,0.00012807756,0.9790668,0.00033385944,0.000032508735,0.00008042867,0.000063033534,0.0002858575,0.0015991041],"genre_scores_gemma":[0.6301324,0.00043073346,0.3616867,0.00046436128,0.00009929552,0.00053349417,0.00047352066,0.00036267124,0.0058168154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976324,0.0007851955,0.00011760923,0.00036745507,0.00084180676,0.00025555267],"domain_scores_gemma":[0.9804569,0.015265043,0.0008833229,0.0015692081,0.0012405516,0.00058492506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006184265,0.0010385667,0.0012885543,0.00072896545,0.0006648958,0.0018946076,0.0030446127,0.0018101265,0.0054628123],"category_scores_gemma":[0.036859047,0.00060517405,0.000944405,0.00073106465,0.0026884507,0.003767074,0.0031468482,0.00369818,0.0006324331],"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.00039982758,0.000091496,0.0022754075,0.0001951788,0.00007166619,0.0002131226,0.00021017573,0.6753014,0.006028784,0.2891962,0.0012100189,0.024806764],"study_design_scores_gemma":[0.000011437164,0.000026317057,0.000088547225,0.000006965124,0.000004602542,0.000022305558,0.000008030705,0.9735694,0.0007794223,0.025312012,0.00016270726,0.000008249216],"about_ca_topic_score_codex":0.0029795081,"about_ca_topic_score_gemma":0.0027022928,"teacher_disagreement_score":0.006184265,"about_ca_system_score_codex":0.0021041988,"about_ca_system_score_gemma":0.0030213457,"threshold_uncertainty_score":0.032705903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015282528,0.00094251795,0.98772883,0.00056692987,0.00013440079,0.00004734327,0.00004856865,0.000057536065,0.008945704],"genre_scores_gemma":[0.26938725,0.0065248827,0.7061998,0.0014808906,0.0006193473,0.0008390557,0.00022254908,0.0001364935,0.014589657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987739,0.00057226,0.000043814995,0.0001689993,0.0003455566,0.00009550217],"domain_scores_gemma":[0.99858296,0.0007564801,0.00011061423,0.00032936627,0.0001806378,0.0000400622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667822,0.0010724063,0.0007465677,0.00193312,0.001000166,0.001758074,0.002070612,0.0020910713,0.0029963353],"category_scores_gemma":[0.004448181,0.00037321044,0.0006774989,0.0022870959,0.0032888409,0.002677273,0.002253445,0.0044330624,0.0012501744],"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.000010584286,0.000008461495,0.000037367885,0.00004586905,0.000006196126,0.000034633948,0.000057019282,0.018250803,0.0009097767,0.96620387,0.0014713596,0.012964151],"study_design_scores_gemma":[0.0000125230745,0.000052891362,0.000058718517,0.000090245456,0.000010048495,0.00016256502,0.000031047537,0.23506801,0.00160279,0.7423489,0.020531261,0.000030945997],"about_ca_topic_score_codex":0.0013835812,"about_ca_topic_score_gemma":0.0010976342,"teacher_disagreement_score":0.0029963353,"about_ca_system_score_codex":0.0016570654,"about_ca_system_score_gemma":0.0010930576,"threshold_uncertainty_score":0.0120229125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18696332,0.003930568,0.76392585,0.001294964,0.00032763154,0.00009113752,0.00059624837,0.00033981714,0.042530492],"genre_scores_gemma":[0.9604118,0.004587812,0.018150344,0.0003386352,0.00073145586,0.000089677946,0.00041264837,0.00007866141,0.015199007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.00024250738,0.000033814827,0.00020831688,0.0003826648,0.00032993083],"domain_scores_gemma":[0.99708444,0.0016266588,0.0004887209,0.00020287745,0.0004487831,0.00014841415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044175,0.0008884248,0.00088024884,0.0012299715,0.001070694,0.0017419495,0.0010432001,0.0011370498,0.0030541338],"category_scores_gemma":[0.004110548,0.00027816196,0.0007715362,0.0018507157,0.0018536891,0.0022765582,0.0009828162,0.0016146455,0.0005700231],"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.00015959835,0.00008174561,0.0021230907,0.00015248048,0.000053831707,0.00066924596,0.00031091514,0.20007853,0.004362099,0.7722916,0.0031439762,0.01657298],"study_design_scores_gemma":[0.000032402757,0.0000641694,0.001099087,0.000040051233,0.000034875786,0.00046174653,0.000110725254,0.7622646,0.0012212835,0.23022763,0.0043969266,0.000046483245],"about_ca_topic_score_codex":0.0061375857,"about_ca_topic_score_gemma":0.0021607103,"teacher_disagreement_score":0.0061375857,"about_ca_system_score_codex":0.0013995223,"about_ca_system_score_gemma":0.001089527,"threshold_uncertainty_score":0.012203693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03054974,0.003889034,0.94892466,0.00295847,0.00032837907,0.00026429066,0.0012411408,0.0024839924,0.009360222],"genre_scores_gemma":[0.62258255,0.0035033142,0.3347022,0.0025661353,0.0011876218,0.0013557435,0.0058867736,0.0018810835,0.026334543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261475,0.002395772,0.0004336079,0.0017265176,0.0014881659,0.0013411881],"domain_scores_gemma":[0.9523594,0.037469752,0.0015964925,0.0039905063,0.002748369,0.0018355533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014177464,0.0062611382,0.0074608694,0.0026188565,0.0017161972,0.006082758,0.007836765,0.0066029797,0.013365772],"category_scores_gemma":[0.05551649,0.0021320253,0.002491168,0.0034277972,0.0036686028,0.012171237,0.0074393996,0.009769408,0.004069444],"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.0017013744,0.00060956803,0.0017150119,0.0011182626,0.0003280783,0.0002313646,0.0002529112,0.808013,0.0012167584,0.06752307,0.01668587,0.10060466],"study_design_scores_gemma":[0.00005495841,0.00011695593,0.00018639148,0.00006481491,0.000036806698,0.0000438814,0.000031338797,0.9354183,0.00054222974,0.06280068,0.00068072364,0.000022820126],"about_ca_topic_score_codex":0.006455374,"about_ca_topic_score_gemma":0.006869033,"teacher_disagreement_score":0.014177464,"about_ca_system_score_codex":0.0065827146,"about_ca_system_score_gemma":0.006869127,"threshold_uncertainty_score":0.07497847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012516032,0.00079562434,0.98138064,0.00079933763,0.00006075275,0.00015264386,0.00017873671,0.00051945477,0.0035967913],"genre_scores_gemma":[0.29786596,0.0017843856,0.6923951,0.0005621781,0.0002661554,0.000976013,0.0012516578,0.00072498975,0.004173564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99084854,0.00406071,0.0004127675,0.0022610028,0.0014835558,0.0009333292],"domain_scores_gemma":[0.92134374,0.06705093,0.0035136286,0.0043005785,0.0026158153,0.0011752779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008496158,0.0027746311,0.0036099707,0.0029069022,0.002125139,0.004961221,0.0042562885,0.0030930792,0.007102334],"category_scores_gemma":[0.07055809,0.0014626718,0.0023646285,0.0040245475,0.004376825,0.009176336,0.005577748,0.006529245,0.0027472132],"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.0008216739,0.00038960503,0.0012862908,0.0006427104,0.00010958473,0.00015990395,0.0005468587,0.6189006,0.002891076,0.25616568,0.00795655,0.110129476],"study_design_scores_gemma":[0.00009291822,0.0001228321,0.00015855653,0.00009121815,0.000024136885,0.000095134325,0.00009482699,0.73144674,0.0014327279,0.26425865,0.0021493922,0.00003286259],"about_ca_topic_score_codex":0.0023884373,"about_ca_topic_score_gemma":0.0016414922,"teacher_disagreement_score":0.008496158,"about_ca_system_score_codex":0.0031676425,"about_ca_system_score_gemma":0.005793432,"threshold_uncertainty_score":0.044932485},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007465111,0.040694565,0.4111116,0.025479345,0.046122044,0.0007379445,0.02862868,0.005439965,0.43432075],"genre_scores_gemma":[0.12235066,0.07658969,0.10002279,0.004883814,0.012572103,0.0008984794,0.046208892,0.0021821207,0.6342914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800307,0.00035269064,0.00016154909,0.0002000584,0.0011526959,0.00012988028],"domain_scores_gemma":[0.99467635,0.0017890986,0.00018396124,0.0013248847,0.0018494271,0.00017639961],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020602734,0.0012924075,0.0020678246,0.003797362,0.0009579358,0.0044236397,0.0011441201,0.002092893,0.1851079],"category_scores_gemma":[0.011168395,0.0005802313,0.000767064,0.0050276644,0.00081973674,0.0042114784,0.0017536718,0.0025113106,0.077406555],"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.00016456856,0.00012274027,0.00069976837,0.0008617737,0.00006320876,0.00014873999,0.000052727944,0.0032664898,0.001126435,0.07650185,0.5205435,0.39644817],"study_design_scores_gemma":[0.0000663768,0.00010562416,0.0013464479,0.0008884408,0.00015490796,0.00051709265,0.00011438701,0.034595083,0.0029237047,0.18493888,0.77427524,0.00007376357],"about_ca_topic_score_codex":0.0015025839,"about_ca_topic_score_gemma":0.0012613864,"teacher_disagreement_score":0.8148921,"about_ca_system_score_codex":0.0010109864,"about_ca_system_score_gemma":0.002182975,"threshold_uncertainty_score":0.6192476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001377775,0.00014763504,0.9967354,0.00014361202,0.000024616542,0.00003930596,0.00002417064,0.000064700085,0.0014429247],"genre_scores_gemma":[0.621215,0.0022218921,0.3693604,0.0003315458,0.00044233495,0.0006930559,0.0002634573,0.00010068274,0.0053715874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972355,0.0007525076,0.00016737635,0.00073721807,0.0008599272,0.00024747383],"domain_scores_gemma":[0.9975495,0.00095110957,0.00036249132,0.00038689736,0.0006218787,0.00012813574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039144573,0.00091136113,0.0010518333,0.0010236757,0.0010663815,0.0021933988,0.0025046496,0.0016220409,0.0018642091],"category_scores_gemma":[0.00844744,0.00044653876,0.0014084291,0.0015951594,0.0020279218,0.0035095566,0.0029289268,0.0024018371,0.00041505616],"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.000046626537,0.000040356827,0.0005068335,0.0001557151,0.000055377197,0.00020978131,0.00028098037,0.32288778,0.0028276893,0.6268678,0.0024308604,0.043690275],"study_design_scores_gemma":[0.000010958528,0.0000524159,0.000084010935,0.000017865003,0.000022414359,0.00009074284,0.000035463734,0.87819827,0.0008627696,0.11783522,0.0027709666,0.000018921965],"about_ca_topic_score_codex":0.0027778642,"about_ca_topic_score_gemma":0.0012448558,"teacher_disagreement_score":0.0039144573,"about_ca_system_score_codex":0.0020137872,"about_ca_system_score_gemma":0.0024785378,"threshold_uncertainty_score":0.020701885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074848854,0.00024661826,0.9847676,0.0008506342,0.000098876124,0.00012210946,0.00087310903,0.00057868555,0.004977592],"genre_scores_gemma":[0.49956325,0.001542747,0.47513252,0.0012781982,0.00062328065,0.0007168982,0.0066177924,0.00076239405,0.013762936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9901334,0.003667356,0.00043697353,0.0033799964,0.0017306719,0.00065164646],"domain_scores_gemma":[0.9713495,0.014053408,0.0028008122,0.008164295,0.0026874156,0.0009445996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004772463,0.0018705468,0.0021018193,0.0029926696,0.0026180123,0.0034216207,0.004917489,0.0030090301,0.008821118],"category_scores_gemma":[0.03131426,0.001012681,0.0016186915,0.0061293016,0.0028508771,0.010992727,0.0067867944,0.005595756,0.0032815652],"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.00030233074,0.00026332965,0.002161146,0.00045621858,0.00021218217,0.0004423049,0.0007026391,0.21648332,0.0024388863,0.6354076,0.016448889,0.12468116],"study_design_scores_gemma":[0.000027957109,0.000037038633,0.0002740172,0.000045762652,0.00003979536,0.0001796507,0.00014989178,0.3297945,0.0018345258,0.6607595,0.006830298,0.000027122473],"about_ca_topic_score_codex":0.0024710968,"about_ca_topic_score_gemma":0.0024895521,"teacher_disagreement_score":0.008821118,"about_ca_system_score_codex":0.0028781046,"about_ca_system_score_gemma":0.0033380918,"threshold_uncertainty_score":0.029509604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2107914,0.002174507,0.75130653,0.0027812207,0.0001406891,0.00013645226,0.0009485907,0.0006886529,0.03103202],"genre_scores_gemma":[0.9633929,0.0010199195,0.031385053,0.00025837895,0.00019777812,0.00027941528,0.0002925732,0.00012287001,0.0030512426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648714,0.001163462,0.00016008459,0.0005365917,0.001020935,0.00063175784],"domain_scores_gemma":[0.97583634,0.019900238,0.0013538514,0.0012443619,0.0011925009,0.00047276617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027615211,0.0007979175,0.0012807662,0.001690499,0.0012480381,0.003824849,0.001701717,0.0019652871,0.0030412164],"category_scores_gemma":[0.021262579,0.0005330233,0.0011876815,0.0020079806,0.00547602,0.006626611,0.002191002,0.0031929216,0.00041246318],"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.00011675081,0.00004854901,0.00039523668,0.0001461855,0.000026778549,0.00009762509,0.00019644768,0.10112826,0.0028752175,0.8872285,0.0010098215,0.006730606],"study_design_scores_gemma":[0.000015805132,0.000031345568,0.00017946295,0.000047080535,0.000011688176,0.00008900402,0.00003825891,0.3250116,0.001911596,0.67179155,0.00083824433,0.00003439339],"about_ca_topic_score_codex":0.0014565443,"about_ca_topic_score_gemma":0.0008276334,"teacher_disagreement_score":0.003824849,"about_ca_system_score_codex":0.0032081476,"about_ca_system_score_gemma":0.0026512633,"threshold_uncertainty_score":0.023276806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018206235,0.00011811504,0.9803547,0.00015875557,0.000017821278,0.000030956766,0.000012716921,0.000088362045,0.0010123472],"genre_scores_gemma":[0.92956877,0.00015058302,0.06865406,0.00010284373,0.0000144055075,0.00010538939,0.00002821578,0.000026604992,0.0013491578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.00020020135,0.000027214312,0.000107698455,0.00013825578,0.00007693846],"domain_scores_gemma":[0.99708945,0.0021640018,0.00026291958,0.00008864481,0.00029409534,0.00010096251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016242989,0.0005320789,0.00068698183,0.0003130405,0.00031980823,0.00068642525,0.0007099914,0.0007941543,0.0013680689],"category_scores_gemma":[0.0064241625,0.0003142318,0.0002818255,0.0002539786,0.0018222939,0.00077441445,0.0009801973,0.0011426095,0.00017492638],"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.000083435705,0.00003638413,0.00028713257,0.00006547021,0.000011449681,0.0000392123,0.00007906725,0.9399334,0.0022871874,0.041321136,0.00027564488,0.015580353],"study_design_scores_gemma":[0.0000111556565,0.000025046285,0.000019357556,0.0000056609433,0.0000016643,0.0000045233637,0.0000034570483,0.9924515,0.00036720335,0.007000877,0.00010644697,0.0000031506393],"about_ca_topic_score_codex":0.0031033356,"about_ca_topic_score_gemma":0.002116222,"teacher_disagreement_score":0.0031033356,"about_ca_system_score_codex":0.0013398941,"about_ca_system_score_gemma":0.0016975462,"threshold_uncertainty_score":0.009721696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14674357,0.003571275,0.8118792,0.00295846,0.00027116915,0.00014730477,0.0010303915,0.0007469344,0.03265172],"genre_scores_gemma":[0.85163337,0.0041925116,0.13622814,0.00036131174,0.00034654222,0.0005621942,0.0008658901,0.00034032142,0.005469883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980635,0.00047701198,0.00008785386,0.00028725274,0.00076160324,0.00032283633],"domain_scores_gemma":[0.97253346,0.021076638,0.0013225122,0.0024779267,0.002016621,0.00057292444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027022657,0.0012743464,0.0011728873,0.0017650619,0.0009064578,0.0016981346,0.0015912578,0.0011821829,0.003225471],"category_scores_gemma":[0.024894271,0.0005387725,0.00052937,0.001289068,0.0022093272,0.005248801,0.0026876274,0.0024698302,0.0007252981],"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.00073788804,0.00014829643,0.002071496,0.00063746993,0.000060575607,0.00032256928,0.0004297992,0.46667022,0.037982102,0.41997263,0.0070978478,0.06386906],"study_design_scores_gemma":[0.00005449875,0.00019028773,0.00078239484,0.00016873374,0.000028955721,0.0004858246,0.00017246617,0.6756876,0.023303663,0.29281723,0.00623341,0.00007492908],"about_ca_topic_score_codex":0.0006230376,"about_ca_topic_score_gemma":0.0006374117,"teacher_disagreement_score":0.003225471,"about_ca_system_score_codex":0.0019520331,"about_ca_system_score_gemma":0.0013065167,"threshold_uncertainty_score":0.014291108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061077245,0.002673767,0.9135185,0.00063549797,0.0006775464,0.00012834174,0.00042858944,0.00041375126,0.02044681],"genre_scores_gemma":[0.5072746,0.002471945,0.46236974,0.0012188809,0.00047404753,0.00028388345,0.0010438653,0.0002175657,0.024645446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909997,0.0001839786,0.00007249436,0.00023971546,0.0002809529,0.00012281474],"domain_scores_gemma":[0.99822754,0.00050543895,0.00019368902,0.0004837631,0.00047131904,0.00011821988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063078006,0.00072050805,0.00053776434,0.0011523378,0.000585828,0.0012147588,0.0011051601,0.0010092028,0.0023294585],"category_scores_gemma":[0.0033066217,0.00030281398,0.0006153815,0.0013577376,0.0011325355,0.0014650975,0.0013556011,0.0017771645,0.0010049653],"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.0002841901,0.00009222422,0.0010042907,0.00025947636,0.000050256956,0.00042191867,0.0003932448,0.04759859,0.036405623,0.7182903,0.004950878,0.190249],"study_design_scores_gemma":[0.00016187021,0.00048101458,0.00095496915,0.00026012986,0.0000948216,0.0022606307,0.0001281426,0.4347937,0.05324316,0.423857,0.08356744,0.00019712823],"about_ca_topic_score_codex":0.0015957649,"about_ca_topic_score_gemma":0.0016883606,"teacher_disagreement_score":0.0023294585,"about_ca_system_score_codex":0.0009944197,"about_ca_system_score_gemma":0.0015255205,"threshold_uncertainty_score":0.0077928305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61107516,0.00030365345,0.34463528,0.00090100063,0.00012619515,0.000073085066,0.00026532132,0.00019814093,0.042422157],"genre_scores_gemma":[0.97253937,0.00011447362,0.024503782,0.00013542734,0.000034276356,0.000073954354,0.00010407348,0.000033917626,0.002460733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.00018022103,0.000032643948,0.00013704703,0.00017813704,0.00017349582],"domain_scores_gemma":[0.99900407,0.00026850682,0.00017487809,0.00031296784,0.00008519009,0.00015454028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866614,0.0003683989,0.0004836169,0.00051091274,0.0010510945,0.0013325379,0.00056710374,0.00073171145,0.0035777688],"category_scores_gemma":[0.0013307356,0.00021994414,0.00056259596,0.00047743812,0.0033683027,0.0021557698,0.0028340118,0.0014753473,0.00045104485],"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.000063597334,0.000032395194,0.00046221688,0.00004540937,0.000011045005,0.00014257147,0.00031880743,0.007263435,0.009330344,0.9763899,0.00042545635,0.0055148243],"study_design_scores_gemma":[0.000032428292,0.00013394843,0.0006854095,0.000021978854,0.00001287163,0.0003756128,0.00033609546,0.11941934,0.018937925,0.85678047,0.0031831095,0.00008084077],"about_ca_topic_score_codex":0.00026618663,"about_ca_topic_score_gemma":0.00021462358,"teacher_disagreement_score":0.0035777688,"about_ca_system_score_codex":0.00045019796,"about_ca_system_score_gemma":0.0004807839,"threshold_uncertainty_score":0.011968851},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14845508,0.0017200873,0.84544206,0.00064567564,0.00009631678,0.000033417266,0.00031795926,0.00029944346,0.002989976],"genre_scores_gemma":[0.83680266,0.0019272298,0.15576608,0.00019785036,0.00017495935,0.00008942239,0.00087254465,0.00014244429,0.004026758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998546,0.00046366444,0.00008941249,0.00032597053,0.00044332497,0.00013165238],"domain_scores_gemma":[0.99056256,0.0069929524,0.00076315453,0.0010127597,0.0005245927,0.00014381978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019074943,0.0006059327,0.0015084422,0.00079158845,0.00047063528,0.0010453172,0.0011748866,0.001522286,0.0011706678],"category_scores_gemma":[0.016268225,0.0006108988,0.0004987614,0.0009609858,0.0018827092,0.0033588316,0.0014792214,0.0013463841,0.000560092],"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.001048417,0.00007778845,0.0025275778,0.00071855856,0.00009858716,0.0005747232,0.00043917733,0.7078966,0.03519225,0.16820343,0.0016024725,0.08162048],"study_design_scores_gemma":[0.000039078703,0.00007227093,0.0004887394,0.000054849057,0.0000188038,0.000275635,0.00008736472,0.90129143,0.01975451,0.07636204,0.0015149649,0.000040191167],"about_ca_topic_score_codex":0.0006575154,"about_ca_topic_score_gemma":0.00044633663,"teacher_disagreement_score":0.0019074943,"about_ca_system_score_codex":0.0006042617,"about_ca_system_score_gemma":0.0005006388,"threshold_uncertainty_score":0.010087907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10299122,0.00072148204,0.87999195,0.0010266211,0.00007758572,0.000056704157,0.00013059974,0.00010658731,0.014897189],"genre_scores_gemma":[0.9450848,0.00048096754,0.049740512,0.00018550239,0.000063135136,0.0001082226,0.00008321037,0.00005600594,0.0041977116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871516,0.0005136384,0.000058884918,0.00019839499,0.00035753695,0.00015632925],"domain_scores_gemma":[0.99703705,0.0020199278,0.0003021168,0.00024820873,0.00026764662,0.00012506108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021469062,0.00069810695,0.001049636,0.0005137809,0.0005720905,0.0017043168,0.0013378845,0.001296234,0.0019412014],"category_scores_gemma":[0.0056281514,0.0004087324,0.00072260184,0.0005541962,0.0033715633,0.0028906022,0.0019943537,0.001507307,0.00025840523],"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.000056811405,0.0000234,0.000120641824,0.00008093603,0.000021947306,0.00010538977,0.00008559585,0.3031354,0.0020776964,0.6915403,0.0002826074,0.0024693005],"study_design_scores_gemma":[0.000013056384,0.00002805297,0.00006826477,0.000014932673,0.0000067066935,0.000032604916,0.000020055417,0.8562208,0.0011780648,0.14206903,0.00032611028,0.000022339684],"about_ca_topic_score_codex":0.0018981122,"about_ca_topic_score_gemma":0.0007145801,"teacher_disagreement_score":0.0029464262,"about_ca_system_score_codex":0.0029464262,"about_ca_system_score_gemma":0.0015319372,"threshold_uncertainty_score":0.021377861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5832748,0.0018003867,0.39775425,0.0009478545,0.00016542443,0.00009062774,0.0006488242,0.0005415633,0.014776326],"genre_scores_gemma":[0.96813804,0.0005999555,0.027547946,0.000088221015,0.00018250015,0.00012755822,0.00051993894,0.00010558502,0.0026903402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827015,0.00031575662,0.00010410771,0.0005104542,0.00059444364,0.0002050373],"domain_scores_gemma":[0.9795759,0.014036473,0.0020705198,0.0018800392,0.001841641,0.0005953707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029882651,0.0005137155,0.00069169054,0.0022615422,0.0005342771,0.0017829438,0.0010024958,0.0011860416,0.002604191],"category_scores_gemma":[0.031071912,0.00021901166,0.00042755483,0.0010703793,0.0026738618,0.0024695552,0.0009627728,0.0010416037,0.0007048136],"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.0011695011,0.00014581929,0.023203354,0.0004907016,0.00013274819,0.00055301597,0.00087332685,0.105050005,0.03874509,0.66203517,0.004556636,0.1630447],"study_design_scores_gemma":[0.00006385552,0.00029472087,0.019714033,0.0001368718,0.00006993775,0.001717286,0.0002678381,0.5474505,0.019188799,0.40572262,0.0051198034,0.00025374856],"about_ca_topic_score_codex":0.00041994682,"about_ca_topic_score_gemma":0.00028506725,"teacher_disagreement_score":0.0029882651,"about_ca_system_score_codex":0.0011495453,"about_ca_system_score_gemma":0.00073896634,"threshold_uncertainty_score":0.015803635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029472172,0.0025353709,0.9588816,0.00092262536,0.00009386102,0.000053435946,0.00013458377,0.00034872635,0.007557628],"genre_scores_gemma":[0.8768027,0.002532844,0.115289174,0.00047466764,0.00018497938,0.00018295618,0.00019151054,0.00036972438,0.0039714295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634117,0.0014005302,0.00016054133,0.0006247582,0.0010643196,0.00040861117],"domain_scores_gemma":[0.9782305,0.01634313,0.0009878961,0.0022278267,0.0017803238,0.0004304082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005311316,0.0023007505,0.0015364995,0.0010930513,0.0005785964,0.0028465525,0.0028624076,0.002507806,0.0029494434],"category_scores_gemma":[0.031619232,0.00069600175,0.00068266876,0.0011765559,0.0023489268,0.009007995,0.0039196312,0.0029280556,0.00084616133],"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.0009168216,0.00016700271,0.001080011,0.000550391,0.00015286845,0.0005728078,0.00045221823,0.37720042,0.028363595,0.5069773,0.0028510157,0.080715545],"study_design_scores_gemma":[0.00003759107,0.00029054793,0.0004997347,0.0000623922,0.000045657343,0.0007882027,0.000078328514,0.84808755,0.010391946,0.13757199,0.0020514834,0.00009448295],"about_ca_topic_score_codex":0.0007449818,"about_ca_topic_score_gemma":0.00040030474,"teacher_disagreement_score":0.005311316,"about_ca_system_score_codex":0.0024351256,"about_ca_system_score_gemma":0.00097265607,"threshold_uncertainty_score":0.028089225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053919684,0.00031293803,0.99285346,0.00015521738,0.000025689405,0.00003664327,0.000031725387,0.00015471815,0.0010376954],"genre_scores_gemma":[0.53461,0.001596013,0.45716307,0.00042788676,0.00027927372,0.00048610373,0.0004343963,0.00018924197,0.004814029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998623,0.00048512433,0.00007020892,0.00023802817,0.00044452725,0.00013914162],"domain_scores_gemma":[0.9911901,0.0066343425,0.00053263264,0.00054074643,0.0009278932,0.00017434555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027945137,0.001162338,0.0015012752,0.00087749545,0.000511518,0.0016608349,0.001768995,0.0010827571,0.0015384634],"category_scores_gemma":[0.015224946,0.0006812201,0.00072320877,0.0015180873,0.0012954589,0.0026167575,0.0021930262,0.001708587,0.00078885764],"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.00010692569,0.00009668069,0.0014661581,0.00015168145,0.000070717455,0.00013690528,0.00018882607,0.7926434,0.0032455674,0.076591805,0.0025630165,0.12273823],"study_design_scores_gemma":[0.000004833067,0.000010503778,0.00009480485,0.0000066438643,0.0000032016599,0.000024007413,0.000009948599,0.98598206,0.0002915359,0.013306517,0.0002589477,0.000007046343],"about_ca_topic_score_codex":0.0034885628,"about_ca_topic_score_gemma":0.0024293072,"teacher_disagreement_score":0.0034885628,"about_ca_system_score_codex":0.0014337834,"about_ca_system_score_gemma":0.0015500926,"threshold_uncertainty_score":0.014779031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06746039,0.0014754002,0.92068505,0.00050732604,0.00012587306,0.000118504875,0.000262795,0.00090756186,0.00845722],"genre_scores_gemma":[0.8466765,0.0007553011,0.14382166,0.00026476875,0.000076692726,0.00018336916,0.0003607516,0.00020901473,0.0076519544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691904,0.00050144555,0.00019906163,0.00066945003,0.0012003671,0.0005105702],"domain_scores_gemma":[0.9891167,0.0046173334,0.0011732804,0.0034188987,0.0013622493,0.00031162915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663004,0.0008851135,0.0010938221,0.0009800032,0.001308217,0.0016880778,0.0021157358,0.0015407718,0.0060552973],"category_scores_gemma":[0.012443364,0.00041414236,0.0007053804,0.0011995953,0.0016334443,0.004488212,0.0034473962,0.0024029477,0.0011003918],"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.000564257,0.00011117153,0.0013475415,0.0006613674,0.00007906998,0.00034229827,0.0008058341,0.35295692,0.02118888,0.45983082,0.0063265576,0.1557853],"study_design_scores_gemma":[0.000030421079,0.00025943454,0.0003726428,0.00010873842,0.000045357756,0.0005394827,0.00042160816,0.7154197,0.019498367,0.25479272,0.008436161,0.000075284566],"about_ca_topic_score_codex":0.0012729386,"about_ca_topic_score_gemma":0.0014722393,"teacher_disagreement_score":0.0060552973,"about_ca_system_score_codex":0.0016653539,"about_ca_system_score_gemma":0.0014994836,"threshold_uncertainty_score":0.020256996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04778184,0.0040482767,0.9314141,0.0015088893,0.00017508639,0.00010361857,0.00032040128,0.00047891683,0.014168824],"genre_scores_gemma":[0.7567473,0.0064981417,0.22827365,0.00042933688,0.000510902,0.0003699598,0.00054607575,0.000121883626,0.006502816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913967,0.00030607096,0.000046356836,0.000085808584,0.000338267,0.00008378838],"domain_scores_gemma":[0.9961423,0.0025162327,0.00043652777,0.00026028694,0.00054556737,0.00009916644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068717106,0.00074492,0.00043945466,0.0009712851,0.00036598893,0.00084151217,0.0004958778,0.000816414,0.0024646618],"category_scores_gemma":[0.0070067975,0.00033216857,0.0003571672,0.0013010467,0.0008740337,0.0013036726,0.0010267969,0.0011641673,0.00084376155],"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.00034685477,0.00009723399,0.0010351955,0.00075110997,0.00003933516,0.001237019,0.00044381848,0.24495366,0.04471519,0.5667863,0.006984536,0.13260978],"study_design_scores_gemma":[0.00004288059,0.00016745673,0.00050680863,0.00014432285,0.000016083994,0.0008655185,0.0001144521,0.7572121,0.017973877,0.2121985,0.010673555,0.00008441028],"about_ca_topic_score_codex":0.00097099313,"about_ca_topic_score_gemma":0.0012640083,"teacher_disagreement_score":0.0024646618,"about_ca_system_score_codex":0.0007454299,"about_ca_system_score_gemma":0.00096241746,"threshold_uncertainty_score":0.0082451105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011832154,0.0036325417,0.9607497,0.0014773756,0.00015048032,0.00008125132,0.00034246664,0.00013874986,0.021595385],"genre_scores_gemma":[0.78275806,0.0073606134,0.18802167,0.00093563,0.0007973949,0.00072542904,0.0006512549,0.00030127738,0.01844874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939756,0.0028744233,0.00031489666,0.0007078914,0.0016620132,0.00046525974],"domain_scores_gemma":[0.98257095,0.012225078,0.0010289445,0.0020683964,0.0018606297,0.000245971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073874835,0.0017012286,0.0014033052,0.002161394,0.0008483196,0.0032972107,0.0025008046,0.0021420463,0.0051957746],"category_scores_gemma":[0.020109346,0.0007234976,0.00114468,0.0020733243,0.0038091182,0.006447458,0.0029421344,0.003464296,0.0011188431],"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.00003921517,0.000011633623,0.000119375996,0.000086664375,0.000021433474,0.000058878322,0.000059762133,0.032413945,0.0006000419,0.9610409,0.00068773463,0.0048602954],"study_design_scores_gemma":[0.000017769808,0.000051862018,0.00013755645,0.000058232512,0.000019774672,0.00018551436,0.000034525583,0.33276048,0.0011184391,0.6622819,0.0032962882,0.000037627076],"about_ca_topic_score_codex":0.0014684973,"about_ca_topic_score_gemma":0.00059179973,"teacher_disagreement_score":0.0073874835,"about_ca_system_score_codex":0.0049537905,"about_ca_system_score_gemma":0.0013314532,"threshold_uncertainty_score":0.039069235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2768455,0.0013417244,0.61945003,0.0008863949,0.00035611083,0.00010583767,0.00021729407,0.00048389938,0.10031321],"genre_scores_gemma":[0.828516,0.0018544978,0.14004165,0.00069460116,0.0002930486,0.00022851049,0.00040077537,0.00032657842,0.027644297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960357,0.00011742071,0.000020796035,0.000082411025,0.000089894536,0.00008594804],"domain_scores_gemma":[0.99966633,0.000115919735,0.000037403985,0.00006756677,0.000070241855,0.00004256355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048601977,0.0008156932,0.00040792525,0.0012189506,0.0009039307,0.0011796835,0.000535076,0.00064594747,0.005066768],"category_scores_gemma":[0.001264027,0.00023943378,0.0008264895,0.0008110107,0.001310134,0.0019315133,0.0011788297,0.0014331221,0.0012473006],"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.000037705307,0.000025671428,0.00019189248,0.00006237108,0.0000061451933,0.00008915527,0.00017452825,0.0021833777,0.004711562,0.9624461,0.00072536274,0.029346038],"study_design_scores_gemma":[0.000021628239,0.00010702666,0.00034960816,0.00004489273,0.0000151835475,0.00032521397,0.00013286153,0.026309557,0.009818533,0.9457736,0.017063012,0.000038813465],"about_ca_topic_score_codex":0.00040595344,"about_ca_topic_score_gemma":0.00034095373,"teacher_disagreement_score":0.005066768,"about_ca_system_score_codex":0.0008437761,"about_ca_system_score_gemma":0.0003403153,"threshold_uncertainty_score":0.01695007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046980206,0.00016603094,0.9517804,0.00012745023,0.000013715251,0.000010984712,0.000042567015,0.000099124016,0.0007795013],"genre_scores_gemma":[0.9241775,0.00054618344,0.072722726,0.000048146518,0.00004493475,0.000062132545,0.00027806123,0.00007065312,0.002049636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999691,0.000109134584,0.00001787274,0.000065623935,0.0000825001,0.000033892604],"domain_scores_gemma":[0.99822515,0.0013178617,0.00013595384,0.00009608482,0.00018525108,0.000039776645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017995336,0.0005070009,0.0006167846,0.0007779266,0.00021044437,0.0006322959,0.0005489369,0.0006087155,0.00077747495],"category_scores_gemma":[0.006290784,0.00025234284,0.00046298938,0.0005371609,0.0008384862,0.0017334033,0.00049788505,0.0010559965,0.00018554305],"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.000037057176,0.000016488748,0.0008027361,0.000054923665,0.000017026196,0.000053541775,0.000058069072,0.921001,0.0028865405,0.051688824,0.00039637467,0.02298745],"study_design_scores_gemma":[6.394767e-7,0.000004503752,0.00008176381,0.000002051963,0.0000010471401,0.0000040112127,0.000003886029,0.9937564,0.00026184187,0.0058139903,0.0000677436,0.0000021468816],"about_ca_topic_score_codex":0.002615017,"about_ca_topic_score_gemma":0.001983908,"teacher_disagreement_score":0.002615017,"about_ca_system_score_codex":0.00056355767,"about_ca_system_score_gemma":0.00070670387,"threshold_uncertainty_score":0.009516954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003403021,0.0004416751,0.9936237,0.0002776616,0.00003837506,0.00004884407,0.00015282132,0.0013102827,0.0007036753],"genre_scores_gemma":[0.06423546,0.00068525784,0.9256587,0.00041004206,0.00018852645,0.00034307476,0.0024953354,0.00087193033,0.005111587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546236,0.0019276156,0.00029766152,0.0012140832,0.0007890936,0.00030912462],"domain_scores_gemma":[0.98417836,0.011545637,0.0008163564,0.001976822,0.001153433,0.00032940463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052929623,0.0030759885,0.0027555188,0.0029283282,0.0015766294,0.0033549038,0.0054839277,0.0043979995,0.006280384],"category_scores_gemma":[0.031560913,0.001826994,0.0024582597,0.0039733886,0.0021203908,0.0057651917,0.0039829924,0.0055931997,0.0056113694],"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.0009985731,0.00028364998,0.002286644,0.00052184693,0.00029416385,0.0003338147,0.0004808949,0.46778783,0.005646314,0.071056135,0.011137827,0.4391723],"study_design_scores_gemma":[0.000042313786,0.000043521704,0.00025507947,0.00004173448,0.000020075819,0.000096805794,0.000043690336,0.9390547,0.0016534352,0.056455355,0.0022485047,0.000044804037],"about_ca_topic_score_codex":0.009163347,"about_ca_topic_score_gemma":0.009340051,"teacher_disagreement_score":0.009163347,"about_ca_system_score_codex":0.0021880039,"about_ca_system_score_gemma":0.0036313944,"threshold_uncertainty_score":0.027992249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08330642,0.0029722564,0.90632373,0.0015575544,0.00015083834,0.00014314044,0.0003427855,0.0012552948,0.0039478783],"genre_scores_gemma":[0.7805066,0.0025636854,0.20230483,0.0006176732,0.0001851716,0.00068685843,0.0016584694,0.002110016,0.009366662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972783,0.0013340259,0.00017143873,0.0004090271,0.0005826807,0.00022461666],"domain_scores_gemma":[0.94099075,0.047794692,0.0029023178,0.0029922393,0.00455335,0.0007666176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0119440295,0.002565296,0.0018571323,0.0012604059,0.0007382576,0.0016643141,0.0027542415,0.0031921372,0.0027856152],"category_scores_gemma":[0.08341106,0.0011073343,0.0011344986,0.0009648744,0.0023588291,0.0034353323,0.0034156085,0.004518321,0.00074480893],"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.0006058013,0.000069454625,0.004120342,0.0004926623,0.00020841706,0.0004085697,0.00023755578,0.92623985,0.004931089,0.030014854,0.0024234452,0.03024792],"study_design_scores_gemma":[0.000009833007,0.000057675017,0.00052812404,0.0000526385,0.00001888729,0.00009284006,0.00002166461,0.9929132,0.00226169,0.003649342,0.00037512512,0.000018959747],"about_ca_topic_score_codex":0.007223125,"about_ca_topic_score_gemma":0.0043633,"teacher_disagreement_score":0.0119440295,"about_ca_system_score_codex":0.0023944175,"about_ca_system_score_gemma":0.002008594,"threshold_uncertainty_score":0.0631668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302713,0.0002743448,0.77113485,0.00020598233,0.00008426984,0.000101285565,0.00034365422,0.000601332,0.02422721],"genre_scores_gemma":[0.83951324,0.00025588166,0.15080345,0.00019234687,0.000032760443,0.00014695294,0.0003739621,0.00008744803,0.008593941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964845,0.00004653365,0.000025972298,0.00007122246,0.00012987683,0.000077882316],"domain_scores_gemma":[0.99902844,0.00020781068,0.00011924212,0.00033508328,0.0002392719,0.00007018953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021307194,0.00029550373,0.00029969434,0.00062994286,0.00038187177,0.0008676366,0.00078018266,0.00046050057,0.0029647958],"category_scores_gemma":[0.0015326542,0.0001486918,0.000341555,0.0008149403,0.00074202125,0.0008943088,0.0007065396,0.000847918,0.0006952122],"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.00018182339,0.00005384761,0.0012207959,0.000114927374,0.000019457686,0.0003465408,0.00023474536,0.075212784,0.048666008,0.80115116,0.0016714977,0.07112626],"study_design_scores_gemma":[0.000050535677,0.00024164643,0.0007382081,0.000038185568,0.000020277186,0.000755501,0.00009449396,0.5868698,0.06965597,0.31517804,0.026290815,0.000066578716],"about_ca_topic_score_codex":0.0012407564,"about_ca_topic_score_gemma":0.0018763677,"teacher_disagreement_score":0.0029647958,"about_ca_system_score_codex":0.0007349447,"about_ca_system_score_gemma":0.00062288914,"threshold_uncertainty_score":0.009918213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.133146,0.0013324242,0.82413703,0.0032247421,0.00019833806,0.000089899055,0.00028120438,0.0006929192,0.036897495],"genre_scores_gemma":[0.9156114,0.00076395227,0.07652853,0.0003633796,0.00022524582,0.00022010208,0.00017974061,0.0002873181,0.0058203763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538535,0.0015256155,0.00019368943,0.0008705653,0.0013613511,0.0006635002],"domain_scores_gemma":[0.97811365,0.017378462,0.00077184883,0.0023157885,0.0008519497,0.000568187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003440938,0.0010507186,0.0011339529,0.0019297457,0.0015713397,0.0042715184,0.0027993002,0.0021602744,0.005471752],"category_scores_gemma":[0.025102908,0.0007099248,0.0015310562,0.0017446928,0.010129982,0.013396668,0.004939874,0.004945847,0.00068379194],"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.000032532043,0.0000215494,0.00017360231,0.000049176157,0.000012710558,0.000031613366,0.00016927399,0.047309007,0.0007212572,0.94688076,0.00067127624,0.0039272755],"study_design_scores_gemma":[0.0000042151046,0.000007240021,0.000038623446,0.000013415569,0.000003982941,0.000011198123,0.000020457022,0.1611396,0.0007270557,0.8374592,0.0005597099,0.000015209532],"about_ca_topic_score_codex":0.0044540255,"about_ca_topic_score_gemma":0.0036206516,"teacher_disagreement_score":0.005471752,"about_ca_system_score_codex":0.00512913,"about_ca_system_score_gemma":0.0025504527,"threshold_uncertainty_score":0.037214637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4502356,0.0010949561,0.5388571,0.0021551617,0.00007605525,0.00012277007,0.00017302246,0.0006134916,0.006671781],"genre_scores_gemma":[0.9820749,0.00023207974,0.016640835,0.00015383748,0.00006018217,0.000038001297,0.0000521763,0.00003174864,0.0007162702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635845,0.001437831,0.00017199051,0.0006366008,0.0009216042,0.00047347712],"domain_scores_gemma":[0.9323579,0.054993283,0.0060703824,0.0028359476,0.00209686,0.0016455774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007028458,0.0013682598,0.0018629559,0.0024639573,0.0010080842,0.0027837444,0.0035418,0.0036288141,0.0013670503],"category_scores_gemma":[0.082261756,0.001093244,0.0008168069,0.00093794754,0.0066434317,0.0078058597,0.0042601177,0.003975397,0.0002455909],"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.0012131355,0.00020042782,0.005446861,0.0005278335,0.00015032511,0.0013028085,0.0010071674,0.3263736,0.0248393,0.62045264,0.0011847361,0.017301166],"study_design_scores_gemma":[0.00007577378,0.00016187673,0.0005956927,0.00004167484,0.00002547051,0.00027222934,0.00008520368,0.76238567,0.0060988483,0.22991192,0.00027299914,0.000072692616],"about_ca_topic_score_codex":0.002134811,"about_ca_topic_score_gemma":0.0010819089,"teacher_disagreement_score":0.007028458,"about_ca_system_score_codex":0.0030144893,"about_ca_system_score_gemma":0.0010285935,"threshold_uncertainty_score":0.03717047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058954605,0.00035031256,0.9859979,0.00030511725,0.000079988466,0.00014964062,0.00050730736,0.0050128596,0.0017015047],"genre_scores_gemma":[0.11333547,0.00051996694,0.87387234,0.00024539154,0.00016804582,0.00043870145,0.0046318457,0.0011988021,0.0055893906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947314,0.001106321,0.0003865367,0.0019803706,0.0011977204,0.0005976344],"domain_scores_gemma":[0.99114555,0.0033080333,0.000893324,0.0032890127,0.0010099796,0.00035403506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024499658,0.0025245873,0.0027794575,0.0033831915,0.0019886722,0.0039332043,0.005529637,0.0025951331,0.01117743],"category_scores_gemma":[0.0150250625,0.0013825465,0.002504079,0.0066819265,0.001405124,0.008886185,0.0064256457,0.0046699718,0.0070985523],"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.0005371292,0.00046179208,0.0018111513,0.0007035229,0.00020301281,0.0002378103,0.00051577605,0.19332634,0.006560741,0.091026545,0.0264811,0.67813504],"study_design_scores_gemma":[0.0001395695,0.0000948977,0.00041209257,0.000043753364,0.000067279325,0.00020170012,0.00024833824,0.7681945,0.005677114,0.2146446,0.010229603,0.00004651795],"about_ca_topic_score_codex":0.004093595,"about_ca_topic_score_gemma":0.005420834,"teacher_disagreement_score":0.01117743,"about_ca_system_score_codex":0.002797364,"about_ca_system_score_gemma":0.004870871,"threshold_uncertainty_score":0.0373922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031644765,0.002512383,0.9018229,0.0029648498,0.00044031965,0.00012513371,0.0007948868,0.000753871,0.058940783],"genre_scores_gemma":[0.86982286,0.003167799,0.09131502,0.0013101086,0.00090274174,0.0005804741,0.00080030056,0.0002653691,0.031835444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732864,0.0009097886,0.00006972481,0.00035662728,0.0008054532,0.0005297643],"domain_scores_gemma":[0.98273546,0.012581891,0.0010678214,0.0014447718,0.0016038935,0.00056618534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038204216,0.0016918499,0.001468668,0.0018963966,0.0015302948,0.003076269,0.0025205633,0.0015517361,0.0067731575],"category_scores_gemma":[0.020026222,0.00068170135,0.0009602531,0.0021027136,0.0033169184,0.0042089294,0.002991951,0.0033462641,0.00165364],"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.00011952565,0.00005256944,0.0006395651,0.00012807891,0.00003139011,0.00033445985,0.00014976498,0.08618561,0.001089472,0.8921564,0.007137127,0.011976001],"study_design_scores_gemma":[0.00006162971,0.00005373409,0.00034425012,0.0000612544,0.000025858282,0.00038149758,0.00005212733,0.60238713,0.00075746473,0.39085403,0.0049687033,0.000052407762],"about_ca_topic_score_codex":0.003834829,"about_ca_topic_score_gemma":0.0027127864,"teacher_disagreement_score":0.0067731575,"about_ca_system_score_codex":0.0035388393,"about_ca_system_score_gemma":0.0023313984,"threshold_uncertainty_score":0.025676131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23353215,0.0013803957,0.737769,0.0011085902,0.00008723745,0.00007831968,0.00009823029,0.00025796358,0.025688047],"genre_scores_gemma":[0.9585393,0.0003607577,0.03694046,0.00014745213,0.00004271809,0.00005635181,0.000032166434,0.00004626095,0.0038344944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999226,0.00021426326,0.000025692703,0.00012921511,0.00030579953,0.00009907588],"domain_scores_gemma":[0.99746966,0.0018715811,0.00018649957,0.00025975457,0.0001233922,0.00008910954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887471,0.00050196267,0.0005921967,0.00043863707,0.00050511555,0.0011380884,0.0010139028,0.00084026216,0.0024572145],"category_scores_gemma":[0.0039880634,0.000317928,0.0004976758,0.000492154,0.0029182893,0.0037018168,0.0021571345,0.0021436347,0.00027354975],"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.00012987266,0.00008086117,0.000562538,0.00012394687,0.000038619866,0.00018016147,0.00016204045,0.13048291,0.031881485,0.82310605,0.00042196503,0.012829573],"study_design_scores_gemma":[0.000013076328,0.0001023857,0.00031738624,0.000020180176,0.000015310903,0.00018323137,0.00004247119,0.7740709,0.022219084,0.20169403,0.001283695,0.000038225477],"about_ca_topic_score_codex":0.0006021567,"about_ca_topic_score_gemma":0.00042701594,"teacher_disagreement_score":0.0024572145,"about_ca_system_score_codex":0.0015166585,"about_ca_system_score_gemma":0.0005386711,"threshold_uncertainty_score":0.01100415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4504169,0.00056314364,0.4962473,0.0013885455,0.00012266492,0.00013281935,0.0002739679,0.00034661134,0.050508033],"genre_scores_gemma":[0.97956765,0.0002864735,0.018205017,0.00012633267,0.00006132736,0.000068692956,0.000049449893,0.000038475748,0.0015964959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581844,0.0010342973,0.00025874184,0.0006036888,0.001625238,0.0006594923],"domain_scores_gemma":[0.97689486,0.015951263,0.0021748662,0.0031713585,0.0009684031,0.0008391235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035239577,0.00080353935,0.0008784625,0.0012711649,0.0014759895,0.0032760452,0.0013086394,0.0012091191,0.002966815],"category_scores_gemma":[0.018101607,0.0006988025,0.0009494192,0.000714561,0.007529176,0.0055612237,0.0034712746,0.0030796358,0.00031192604],"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.00007775972,0.00004175819,0.0003069154,0.00008072625,0.000020189284,0.00014673085,0.000095854375,0.049727626,0.007877479,0.938322,0.00025356372,0.003049391],"study_design_scores_gemma":[0.0000210775,0.000093979375,0.0003805664,0.000027228281,0.00002399947,0.00022160167,0.00005707018,0.16602762,0.011768369,0.81968254,0.0016475023,0.000048402555],"about_ca_topic_score_codex":0.00044088357,"about_ca_topic_score_gemma":0.0004365959,"teacher_disagreement_score":0.0035239577,"about_ca_system_score_codex":0.0018201146,"about_ca_system_score_gemma":0.0011824083,"threshold_uncertainty_score":0.018636703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05017166,0.0048379176,0.9109337,0.004167548,0.00033188472,0.00017516104,0.001728634,0.002509917,0.02514358],"genre_scores_gemma":[0.8647054,0.0046328427,0.112014115,0.0016512303,0.0008218754,0.0007561942,0.0018047141,0.0018496235,0.011763968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563605,0.0008650346,0.00026342162,0.0012058264,0.00088068197,0.0011490076],"domain_scores_gemma":[0.92539537,0.06169772,0.0020330641,0.0063603055,0.0024836727,0.0020298855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071861944,0.0030807587,0.0031668323,0.0025325925,0.002121809,0.004908658,0.0066108913,0.0035387722,0.017072503],"category_scores_gemma":[0.07216535,0.0018182555,0.0028188787,0.0019520527,0.005991324,0.018803231,0.009259554,0.009474492,0.0031176289],"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.0011945432,0.00038307018,0.0039844145,0.0012284225,0.0001992117,0.0006709742,0.000937436,0.32510072,0.013306323,0.54824835,0.014004303,0.09074226],"study_design_scores_gemma":[0.000026557773,0.00010148829,0.00047201396,0.00019859949,0.000077853496,0.00035594314,0.00007586189,0.6215416,0.0063126376,0.36857602,0.0021930588,0.000068388865],"about_ca_topic_score_codex":0.0034099014,"about_ca_topic_score_gemma":0.0029264118,"teacher_disagreement_score":0.017072503,"about_ca_system_score_codex":0.004368857,"about_ca_system_score_gemma":0.0033816565,"threshold_uncertainty_score":0.05711317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1344705,0.0008039254,0.8353713,0.00062181096,0.00028613931,0.0001555398,0.00044221865,0.0016128027,0.026235765],"genre_scores_gemma":[0.6845263,0.00077120104,0.29146746,0.0005397598,0.00014888946,0.0002133681,0.00073765725,0.00039798746,0.021197388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989059,0.00018474787,0.00007956455,0.00015267967,0.0004820179,0.00019511813],"domain_scores_gemma":[0.99792117,0.0004619018,0.00020891274,0.0007226613,0.000513704,0.0001717239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006688295,0.00064642134,0.00066481694,0.0013052908,0.0008109806,0.0010921416,0.0009902588,0.0005354525,0.0036880404],"category_scores_gemma":[0.0032088598,0.00039876046,0.0006324946,0.001091985,0.001125013,0.0015698202,0.002685264,0.0015118683,0.00118757],"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.000413756,0.00009646776,0.00108402,0.00024265503,0.000039912826,0.0004523473,0.0005984284,0.090532444,0.054093774,0.6712684,0.0074582165,0.17371947],"study_design_scores_gemma":[0.00012419224,0.0003936195,0.0007381718,0.00011365827,0.000063005435,0.0011275576,0.00018981454,0.3909012,0.10698574,0.4534703,0.04574161,0.00015119581],"about_ca_topic_score_codex":0.0007455472,"about_ca_topic_score_gemma":0.0007439308,"teacher_disagreement_score":0.0036880404,"about_ca_system_score_codex":0.00097349,"about_ca_system_score_gemma":0.001005572,"threshold_uncertainty_score":0.012337685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06069355,0.004933518,0.8779026,0.0008785063,0.00016602705,0.00008210442,0.0007374105,0.00069168146,0.053914618],"genre_scores_gemma":[0.94465995,0.0031577116,0.043200996,0.00028928317,0.0003026944,0.00041707561,0.00071330706,0.00020081525,0.007058155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684,0.00084872503,0.00010328352,0.00034314196,0.001053295,0.0008115004],"domain_scores_gemma":[0.9816822,0.012700711,0.001147133,0.0012699977,0.0027408665,0.00045916857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027220738,0.0019686327,0.0013801135,0.0016222332,0.0009574243,0.0029475691,0.0019335487,0.0011337455,0.004473739],"category_scores_gemma":[0.01455289,0.0006446492,0.0008870098,0.00164443,0.002665098,0.0028112398,0.0030665712,0.0030930806,0.0010560488],"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.00029033833,0.000058514946,0.00040077235,0.00042641128,0.00007303424,0.00029572286,0.0004758234,0.5091087,0.00810111,0.45460814,0.004936107,0.021225216],"study_design_scores_gemma":[0.000020704147,0.00006659128,0.00027727534,0.00011976148,0.00004277294,0.00016270264,0.000095372234,0.8178786,0.004382232,0.17301811,0.0038743059,0.00006152288],"about_ca_topic_score_codex":0.0036437772,"about_ca_topic_score_gemma":0.001745413,"teacher_disagreement_score":0.004473739,"about_ca_system_score_codex":0.003199527,"about_ca_system_score_gemma":0.0016296105,"threshold_uncertainty_score":0.02321434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012069278,0.0012315401,0.9775213,0.001373879,0.00009930152,0.000041978514,0.00009780302,0.00015997981,0.007404891],"genre_scores_gemma":[0.754908,0.0040202765,0.22848271,0.0013939478,0.00089598517,0.00051229855,0.00038292512,0.0004905255,0.008913356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974698,0.0008741648,0.00013744275,0.00055473647,0.0007153039,0.00024854956],"domain_scores_gemma":[0.9874887,0.008399798,0.0012573355,0.0014161209,0.0009341684,0.00050383696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068096956,0.0016294018,0.0017514935,0.0021476613,0.0015193485,0.0024670558,0.003800524,0.0026975973,0.0035864827],"category_scores_gemma":[0.02372841,0.00078179286,0.0023480533,0.0019782672,0.0051609743,0.008231433,0.006535118,0.006346651,0.0004935991],"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.000030537634,0.000030123518,0.0005382236,0.00011720572,0.000034761517,0.000120328936,0.00016193355,0.19602646,0.0009907295,0.7878928,0.0012816585,0.012775186],"study_design_scores_gemma":[0.0000042523006,0.000022250437,0.00016423374,0.000027796214,0.000009297858,0.000051319035,0.0000176175,0.6658028,0.00040741893,0.3320999,0.0013695757,0.00002347467],"about_ca_topic_score_codex":0.0039805775,"about_ca_topic_score_gemma":0.0024490766,"teacher_disagreement_score":0.0068096956,"about_ca_system_score_codex":0.0046969764,"about_ca_system_score_gemma":0.0018695234,"threshold_uncertainty_score":0.036013544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1595494,0.0007893578,0.814272,0.0015455046,0.00007573334,0.00007224224,0.00043651467,0.00020478504,0.02305443],"genre_scores_gemma":[0.9476782,0.0012008455,0.04263419,0.00038346095,0.00027897724,0.00021947036,0.00034994437,0.00016389406,0.007091012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983907,0.00055023347,0.00007975843,0.00024754557,0.000513591,0.00021826243],"domain_scores_gemma":[0.988076,0.008086234,0.0013116744,0.00094997353,0.001021051,0.00055500027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024269337,0.0008863634,0.00095881417,0.00343666,0.00096029026,0.002955776,0.0012330291,0.0008328703,0.0047630775],"category_scores_gemma":[0.016521791,0.00038579464,0.0010314549,0.0021965443,0.0039943187,0.005873722,0.0020917172,0.0026840626,0.00042674472],"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.000008418376,0.000007719812,0.00021526896,0.000018753643,0.0000060174493,0.000042991756,0.000048604295,0.009011107,0.0003689886,0.9879297,0.00034146867,0.002000892],"study_design_scores_gemma":[0.000005280683,0.000007563147,0.00019561351,0.000011174538,0.0000056656645,0.000064950946,0.000035921865,0.07513895,0.00028028974,0.9232986,0.0009427996,0.000013186452],"about_ca_topic_score_codex":0.0009540166,"about_ca_topic_score_gemma":0.00055183686,"teacher_disagreement_score":0.0047630775,"about_ca_system_score_codex":0.0021336854,"about_ca_system_score_gemma":0.00090540166,"threshold_uncertainty_score":0.01593405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016360413,0.001427035,0.9767457,0.00063989224,0.000059627248,0.00002091515,0.00016096488,0.000104364444,0.0044810777],"genre_scores_gemma":[0.7581085,0.0045169233,0.2300273,0.00060311717,0.00042654885,0.00015682385,0.0006209212,0.00020132336,0.0053384267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987086,0.00045630132,0.00006784668,0.00016323403,0.00050461537,0.00009944696],"domain_scores_gemma":[0.99488693,0.0034295158,0.00058231887,0.0003978845,0.00054462627,0.0001586804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026325802,0.0008477439,0.0008815247,0.0027394786,0.0004905831,0.001582516,0.0011069677,0.0014141802,0.0016496779],"category_scores_gemma":[0.01079548,0.00038786654,0.0009347862,0.0022013674,0.0023332727,0.0032236562,0.0013830562,0.0016905313,0.00027445127],"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.000030068517,0.000023426139,0.0010382847,0.00014425705,0.000043294323,0.0002291065,0.00010149451,0.12008141,0.0027224342,0.85619026,0.0015525676,0.017843267],"study_design_scores_gemma":[0.000004871372,0.000019994808,0.0007213511,0.00002672128,0.0000147429655,0.00019445494,0.000030745887,0.63181365,0.0008512957,0.364861,0.001425922,0.000035237423],"about_ca_topic_score_codex":0.0030094176,"about_ca_topic_score_gemma":0.0018871902,"teacher_disagreement_score":0.0030094176,"about_ca_system_score_codex":0.0013919802,"about_ca_system_score_gemma":0.0011149544,"threshold_uncertainty_score":0.013922572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0728909,0.0052574542,0.8557718,0.008716663,0.00035493184,0.00023223051,0.0009338545,0.0007140196,0.05512816],"genre_scores_gemma":[0.75108194,0.008012196,0.20316306,0.0024116768,0.0019030679,0.0010758243,0.00113191,0.0012907257,0.029929629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991288,0.0041140066,0.00035520986,0.0014201201,0.0016999401,0.001122836],"domain_scores_gemma":[0.943281,0.04590601,0.0025812197,0.0050903074,0.0018896535,0.0012517929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076446873,0.0016333868,0.0023100334,0.002341843,0.0014711987,0.008289195,0.0058415583,0.0032552935,0.016966227],"category_scores_gemma":[0.047616635,0.0011616434,0.001738573,0.0036149449,0.004773699,0.017995594,0.0043286504,0.0046144845,0.0022319474],"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.00022409137,0.00013206687,0.00052210846,0.0003089817,0.000052285857,0.00013540957,0.0001556931,0.0823712,0.0019030517,0.8867414,0.0053459774,0.022107765],"study_design_scores_gemma":[0.000048536393,0.00010572194,0.00023806411,0.00007540763,0.00003233492,0.00021254807,0.00008581758,0.32687184,0.0019099341,0.6641736,0.006202872,0.00004333953],"about_ca_topic_score_codex":0.0011458833,"about_ca_topic_score_gemma":0.000625872,"teacher_disagreement_score":0.016966227,"about_ca_system_score_codex":0.0050932416,"about_ca_system_score_gemma":0.0022079686,"threshold_uncertainty_score":0.05675769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006449021,0.0040799496,0.9729763,0.0025391271,0.00023345115,0.00012373937,0.00046990634,0.00040308322,0.0127254315],"genre_scores_gemma":[0.40641984,0.0141832465,0.52876365,0.0039867824,0.003010136,0.0023067389,0.0038077747,0.0013642247,0.036157586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942312,0.0034563206,0.00023847587,0.0007866429,0.0010139985,0.00027338343],"domain_scores_gemma":[0.95028394,0.04507568,0.0010904884,0.0015955974,0.0015420547,0.00041231466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014113613,0.0023273162,0.0034126362,0.0037372485,0.0014295535,0.0045125294,0.004049404,0.0036632386,0.014245201],"category_scores_gemma":[0.07677895,0.0019032377,0.0020432947,0.0035888506,0.004100587,0.007512842,0.004397465,0.008695348,0.0025122126],"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.00018243342,0.000101450736,0.0013619731,0.0005176053,0.00017161488,0.00018129134,0.0003336513,0.23255405,0.00027775916,0.6824944,0.016804336,0.06501959],"study_design_scores_gemma":[0.00003368775,0.00003553354,0.0002604532,0.00022373759,0.000027626007,0.00006444389,0.00004073867,0.4200707,0.00015943233,0.575579,0.003474699,0.00002993009],"about_ca_topic_score_codex":0.005198684,"about_ca_topic_score_gemma":0.004532324,"teacher_disagreement_score":0.014245201,"about_ca_system_score_codex":0.0033566167,"about_ca_system_score_gemma":0.0029961118,"threshold_uncertainty_score":0.07464087},"labels":[],"label_agreement":null}]}