{"meta":{"query_hash":"7aea874970ff","filters":{"venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"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/7aea874970ff","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEICE+Transactions+on+Fundamentals+of+Electronics+Communications+and+Computer+Sciences"},"results":[{"id":"W1967737635","doi":"10.1587/transfun.e95.a.567","title":"Oblivious Transfer Based on the McEliece Assumptions","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"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":"Universidade Federal de Ouro Preto; University of California, San Diego; Université de Montréal; Universiteit van Amsterdam; Universidade de Brasília","keywords":"McEliece cryptosystem; Generalization; Cryptosystem; Decoding methods; Oblivious transfer; Binary number; Reduction (mathematics); Mathematics; Matrix (chemical analysis); Transfer (computing); Computer science; Arithmetic; Theoretical computer science; Discrete mathematics; Algorithm; Cryptography; Parallel computing","score_opus":0.03781384633451661,"score_gpt":0.2701927737982126,"score_spread":0.23237892746369598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967737635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035949823,0.00020607722,0.9243263,0.0017786456,0.00020005736,0.000551753,0.0002464322,0.0014739401,0.035266977],"genre_scores_gemma":[0.7937859,0.00033250215,0.17294505,0.0006582275,0.00017134004,0.0012160394,0.00029341815,0.00058041915,0.030016977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932181,0.0015373251,0.0003671276,0.0007375157,0.0028814322,0.0012585032],"domain_scores_gemma":[0.9867006,0.004539162,0.0010905869,0.0064329044,0.0008296234,0.0004071574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033334612,0.0010485622,0.0014313686,0.0012044527,0.002223592,0.003830354,0.004094806,0.0027738607,0.010829818],"category_scores_gemma":[0.014481676,0.0006826255,0.001409065,0.0014138194,0.0053178547,0.011027973,0.010603424,0.008409056,0.0031546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027470238,0.00011625775,0.00020158025,0.000100027275,0.000035321613,0.00015737339,0.0004683155,0.012680063,0.0072751897,0.9566935,0.0021116417,0.019886043],"study_design_scores_gemma":[0.00013278407,0.00016564866,0.00014262916,0.00006474904,0.000053234144,0.00031175662,0.00014122798,0.09633911,0.06683216,0.81917554,0.016531307,0.00010996372],"about_ca_topic_score_codex":0.00055916706,"about_ca_topic_score_gemma":0.00038506952,"teacher_disagreement_score":0.010829818,"about_ca_system_score_codex":0.002267812,"about_ca_system_score_gemma":0.0026640478,"threshold_uncertainty_score":0.036229312},"labels":[],"label_agreement":null},{"id":"W1975679266","doi":"10.1093/ietfec/e89-a.11.3148","title":"MAP Detectors for Differential Pulse-Position Modulation over Indoor Optical Wireless Communications","year":2006,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Optical Wireless Communication 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 Victoria","funders":"","keywords":"Detector; Intersymbol interference; Pulse-position modulation; Interference (communication); Modulation (music); Channel (broadcasting); Optical wireless; Differential (mechanical device); Optics; Physics; Wireless; Position (finance); Pulse shaping; Computer science; Pulse (music); Electronic engineering; Telecommunications; Pulse-amplitude modulation; Engineering; Acoustics; Laser","score_opus":0.016355848812003866,"score_gpt":0.25387939025544304,"score_spread":0.23752354144343918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975679266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114033215,0.002038375,0.87787527,0.00031088726,0.00012898698,0.00005622592,0.00006124221,0.00069338264,0.0048024543],"genre_scores_gemma":[0.8622626,0.0006295501,0.13403565,0.00015657513,0.000070257585,0.000051554962,0.00004242988,0.000027884744,0.0027234058],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955565,0.00013284864,0.0000126039895,0.0000331416,0.00022357305,0.000042196323],"domain_scores_gemma":[0.99914765,0.0004618271,0.0001418636,0.00008117203,0.00014062933,0.00002680801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058881583,0.00037836205,0.00037153027,0.00034959504,0.00032553298,0.0005575694,0.0005165009,0.00053175644,0.0012946343],"category_scores_gemma":[0.0016535785,0.00023161352,0.00013787848,0.00035789594,0.0003774576,0.000644113,0.0006158914,0.0007358263,0.0005037407],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014357789,0.00018016767,0.0064137615,0.00081539806,0.00016326075,0.0011609044,0.00026224594,0.038172685,0.5618805,0.059941698,0.0034991011,0.32607448],"study_design_scores_gemma":[0.000058703787,0.0008169194,0.001912848,0.00006748129,0.00008944253,0.0019344181,0.00006928662,0.3815138,0.5875931,0.006770995,0.019110385,0.00006263102],"about_ca_topic_score_codex":0.00015500853,"about_ca_topic_score_gemma":0.00030948457,"teacher_disagreement_score":0.0012946343,"about_ca_system_score_codex":0.00030089993,"about_ca_system_score_gemma":0.00027846498,"threshold_uncertainty_score":0.0043309927},"labels":[],"label_agreement":null},{"id":"W2033210979","doi":"10.1093/ietfec/e91-a.12.3793","title":"DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Quantum Computing Algorithms and Architecture","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 Victoria","funders":"","keywords":"Computer science; Quantum; Influence diagram; Electronic circuit; Quantum gate; Theoretical computer science; Quantum computer; Computer engineering; Algorithm; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.061115290802334195,"score_gpt":0.31983708388124715,"score_spread":0.25872179307891296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033210979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030173233,0.0000686588,0.9952095,0.00011780301,0.000027343212,0.00006690676,0.000085841755,0.0005037462,0.00090274605],"genre_scores_gemma":[0.26818284,0.00028669919,0.72836167,0.00022301149,0.000077266915,0.00051549653,0.0003689816,0.00014955644,0.001834495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974999,0.0009840697,0.0002050464,0.0003921937,0.00074134633,0.00017755733],"domain_scores_gemma":[0.99700814,0.0017538532,0.00022403967,0.0005965248,0.00034617752,0.00007119833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00258697,0.0006458582,0.00066564395,0.00085780304,0.0006511497,0.0014793756,0.0013803014,0.0011161466,0.0056867804],"category_scores_gemma":[0.0071351635,0.000517544,0.0010955454,0.00054413546,0.0013269122,0.0032713232,0.0015581079,0.0017885393,0.0008462197],"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.0003854,0.00010537736,0.0003733256,0.00047604524,0.00006310928,0.00022725311,0.00030844586,0.06856458,0.028726902,0.75386995,0.0031054693,0.14379412],"study_design_scores_gemma":[0.00014227556,0.00022817479,0.00012297972,0.00008964902,0.0000521638,0.0002493064,0.000032039257,0.50427485,0.034629107,0.43986693,0.020247592,0.00006492781],"about_ca_topic_score_codex":0.0008512468,"about_ca_topic_score_gemma":0.0007904462,"teacher_disagreement_score":0.0056867804,"about_ca_system_score_codex":0.0010768961,"about_ca_system_score_gemma":0.0017554564,"threshold_uncertainty_score":0.019024193},"labels":[],"label_agreement":null},{"id":"W2053193457","doi":"10.1587/transfun.e93.a.914","title":"Cramer-Rao Bound on Passive Source Localization for General Gaussian Noise","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Speech and Audio Processing","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 Saskatchewan","funders":"","keywords":"Gaussian noise; Noise (video); Gaussian; Representation (politics); SIGNAL (programming language); Noise measurement; Cramér–Rao bound; Mathematics; Computer science; Upper and lower bounds; Algorithm; Speech recognition; Estimation theory; Mathematical analysis; Physics; Noise reduction; Artificial intelligence","score_opus":0.01792164438114018,"score_gpt":0.282680729930886,"score_spread":0.2647590855497458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053193457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013932103,0.0015101255,0.9941043,0.00018317971,0.000040694194,0.000011112418,0.000046947942,0.00010363294,0.0026068192],"genre_scores_gemma":[0.41337958,0.016846638,0.5552899,0.00084860664,0.0007335976,0.0005746033,0.00062810373,0.0004053626,0.011293571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961592,0.0012211016,0.00016625268,0.0006158775,0.0015720603,0.00026550287],"domain_scores_gemma":[0.99064153,0.0060741864,0.000536665,0.00078876223,0.0018443296,0.00011452822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003582394,0.0017909254,0.0013454484,0.0016078462,0.0006513756,0.0023837674,0.0014832083,0.0017811898,0.002234592],"category_scores_gemma":[0.019349808,0.0005400736,0.0006921824,0.0019059839,0.0027645165,0.003084073,0.0021235573,0.0026280645,0.0015847529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001369296,0.00004277573,0.00046390368,0.0005775662,0.00009598085,0.00025804705,0.00026823193,0.41582358,0.010352828,0.4590541,0.006344081,0.10658209],"study_design_scores_gemma":[0.000016172677,0.00011430697,0.00048422944,0.00019385337,0.00004582448,0.00037623852,0.000063705265,0.8626214,0.0062720715,0.117940664,0.011799291,0.00007230603],"about_ca_topic_score_codex":0.0028067038,"about_ca_topic_score_gemma":0.002279426,"teacher_disagreement_score":0.003582394,"about_ca_system_score_codex":0.001440523,"about_ca_system_score_gemma":0.001852883,"threshold_uncertainty_score":0.018945694},"labels":[],"label_agreement":null},{"id":"W2055286490","doi":"10.1587/transfun.e94.a.2092","title":"Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources","year":2011,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","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":"Simon Fraser University","funders":"","keywords":"Huffman coding; Universal code; Prefix code; Monotone polygon; Redundancy (engineering); Canonical Huffman code; Constant-weight code; Mathematics; Shannon–Fano coding; Source code; Code (set theory); Polynomial code; Code word; Systematic code; Algorithm; Coding (social sciences); Discrete mathematics; Computer science; Statistics; Code rate; Linear code; Decoding methods","score_opus":0.05801735668246414,"score_gpt":0.29141032603841394,"score_spread":0.2333929693559498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055286490","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.53683805,0.0013743503,0.45087904,0.0009074757,0.000044257995,0.00006031274,0.0002391994,0.00033142962,0.009325874],"genre_scores_gemma":[0.91770977,0.00037864497,0.08046267,0.00015334981,0.000051289782,0.000065591,0.00024601517,0.000066841436,0.00086594536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827325,0.00066289457,0.00007341398,0.00018171141,0.0006364728,0.00017230822],"domain_scores_gemma":[0.98891836,0.0077300915,0.0011786566,0.0006728435,0.0012856544,0.00021430926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024249684,0.00046922755,0.0009832414,0.0013173348,0.0005891737,0.0007661588,0.0008105259,0.0011637105,0.0008556014],"category_scores_gemma":[0.02188296,0.0003464324,0.0004006863,0.0007843755,0.0012789895,0.0014643805,0.0011033756,0.0007107838,0.00020040367],"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.0009882945,0.000094703384,0.0041195676,0.00034270127,0.00012017258,0.0005723119,0.00029472893,0.69139427,0.029971207,0.20437938,0.0026339407,0.06508865],"study_design_scores_gemma":[0.000057437883,0.00018437128,0.0011158463,0.000040563227,0.000014455735,0.0004678295,0.000056611338,0.9167676,0.008233336,0.07229965,0.000731717,0.000030570267],"about_ca_topic_score_codex":0.00088696874,"about_ca_topic_score_gemma":0.00060447137,"teacher_disagreement_score":0.0024249684,"about_ca_system_score_codex":0.0008446175,"about_ca_system_score_gemma":0.0012610116,"threshold_uncertainty_score":0.012824595},"labels":[],"label_agreement":null},{"id":"W2066855748","doi":"10.1587/transfun.e95.a.1018","title":"Long-Range Asynchronous On-Chip Link Based on Multiple-Valued Single-Track Signaling","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Interconnection Networks and Systems","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":"McGill University","funders":"","keywords":"Asynchronous communication; Computer science; Latency (audio); Dissipation; CMOS; Interconnection; Chip; Electronic engineering; Computer hardware; Computer network; Engineering; Telecommunications; Physics","score_opus":0.04264054113096736,"score_gpt":0.27778298967924525,"score_spread":0.2351424485482779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066855748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41530606,0.0010672275,0.56581765,0.00038009044,0.00031731784,0.00015551431,0.00014549875,0.0017539137,0.015056705],"genre_scores_gemma":[0.88304615,0.0003086179,0.112354375,0.00010051595,0.0000526269,0.000070572096,0.00011346799,0.000035430083,0.0039182627],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969673,0.000043832148,0.000015839867,0.00004243288,0.00016135444,0.000039809118],"domain_scores_gemma":[0.9996226,0.000070365495,0.00007529379,0.00006021447,0.00013404034,0.0000373929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024704201,0.00025012737,0.0002495252,0.00033721083,0.00032574407,0.0006485166,0.0008783763,0.00046891815,0.001841722],"category_scores_gemma":[0.00044386578,0.00012298567,0.00017040792,0.00037723078,0.0002106156,0.00081155926,0.00043729504,0.00045143667,0.00052334275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021652579,0.0002862194,0.0017063394,0.00043669684,0.000056129236,0.00052520144,0.00015781593,0.051130414,0.78421885,0.03390691,0.0026922065,0.12466678],"study_design_scores_gemma":[0.00008683757,0.0016144409,0.0012944901,0.000037776914,0.00006810104,0.0006957478,0.000045706183,0.50489146,0.46554813,0.0032841328,0.022352627,0.00008053565],"about_ca_topic_score_codex":0.00043246162,"about_ca_topic_score_gemma":0.0009287826,"teacher_disagreement_score":0.001841722,"about_ca_system_score_codex":0.0003634296,"about_ca_system_score_gemma":0.00043485654,"threshold_uncertainty_score":0.0061611533},"labels":[],"label_agreement":null},{"id":"W2067020701","doi":"10.1093/ietfec/e89-a.10.2640","title":"Multiple L-Shift Complementary Sequences","year":2006,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"PAPR reduction in OFDM","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 Alberta","funders":"","keywords":"Mathematics; Computer science","score_opus":0.02325880718798054,"score_gpt":0.26029640532194154,"score_spread":0.237037598133961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067020701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096979074,0.0010349791,0.8813124,0.000702081,0.00069256476,0.00013787337,0.00020063977,0.00036315233,0.018577171],"genre_scores_gemma":[0.45055965,0.0011527569,0.53181547,0.00096197944,0.0006043613,0.00024300946,0.00026114707,0.0000961293,0.014305604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.0000889946,0.000031561936,0.0001257246,0.00016915934,0.00006870723],"domain_scores_gemma":[0.9988343,0.00029945324,0.0001769447,0.00018918133,0.0003703226,0.00012981688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038174674,0.00052194565,0.00043985154,0.0007278263,0.00050271704,0.00060741097,0.00052627915,0.0007013274,0.0032175223],"category_scores_gemma":[0.0018905101,0.00020110155,0.00032189715,0.00058759225,0.00074654387,0.0011595467,0.0009447082,0.0009925409,0.0009907122],"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.0004289428,0.00017983571,0.0016653376,0.00038082205,0.00003849379,0.0025320107,0.00065543305,0.025055572,0.24593988,0.44949332,0.0041665216,0.26946387],"study_design_scores_gemma":[0.00019487119,0.0019748688,0.0024002919,0.00030202855,0.000069665395,0.0115921255,0.00031960412,0.2476568,0.23164967,0.2461176,0.25745863,0.00026387576],"about_ca_topic_score_codex":0.00027562998,"about_ca_topic_score_gemma":0.00037328195,"teacher_disagreement_score":0.0032175223,"about_ca_system_score_codex":0.00041709226,"about_ca_system_score_gemma":0.0007442924,"threshold_uncertainty_score":0.010763645},"labels":[],"label_agreement":null},{"id":"W2079174894","doi":"10.1587/transfun.e97.a.1231","title":"Sparse Binary-to-Ternary Encoding for Holographic Storage","year":2014,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Phase-change materials and chalcogenides","field":"Materials 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 Alberta","funders":"","keywords":"Scrambling; Computer science; Holographic data storage; Binary data; Fourier transform; Algorithm; Binary number; Pixel; Holography; Ternary operation; Optics; Mathematics; Artificial intelligence; Physics","score_opus":0.05009516714382558,"score_gpt":0.3002343591426478,"score_spread":0.25013919199882223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079174894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06762794,0.0013153554,0.9191095,0.0002894127,0.00010583808,0.000079815305,0.00017343998,0.0005304688,0.010768164],"genre_scores_gemma":[0.7109693,0.0011408528,0.28341737,0.00017821747,0.000102809376,0.000092889386,0.00020376379,0.000079204736,0.0038155701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997811,0.000043642718,0.0000118867565,0.000015808122,0.00012434265,0.000023230341],"domain_scores_gemma":[0.99936336,0.00030239837,0.000085320426,0.00011888552,0.000110783585,0.000019280898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002512383,0.00019069258,0.00019774251,0.0003250932,0.00022946537,0.00043281526,0.00035162963,0.0003042038,0.0019955235],"category_scores_gemma":[0.001703761,0.00009180268,0.00015385728,0.00054272526,0.00039419832,0.0005318677,0.00032058422,0.00045095952,0.00039529472],"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.000311537,0.000082384315,0.0009679287,0.00038220175,0.00002053575,0.00026553054,0.00015397613,0.08466689,0.12704314,0.5634951,0.0038652471,0.21874548],"study_design_scores_gemma":[0.000024433417,0.000109807916,0.00048638275,0.000057266698,0.000017692395,0.00046498727,0.000022754995,0.8337273,0.06931654,0.086299114,0.009449529,0.0000242164],"about_ca_topic_score_codex":0.0006196417,"about_ca_topic_score_gemma":0.0009668994,"teacher_disagreement_score":0.0019955235,"about_ca_system_score_codex":0.00040657521,"about_ca_system_score_gemma":0.00055812794,"threshold_uncertainty_score":0.00667572},"labels":[],"label_agreement":null},{"id":"W2084572802","doi":"10.1093/ietfec/e91-a.3.782","title":"Experimental Evaluation of the Super Sweep Spectrum Analyzer","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Sensor Technology and Measurement Systems","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":"Microsemi (Canada)","funders":"","keywords":"Sweep frequency response analysis; Spectrum analyzer; Bandwidth (computing); Signal analyzer; Computer science; Optics; Acoustics; Physics; Telecommunications","score_opus":0.07648959602892834,"score_gpt":0.301514885301017,"score_spread":0.22502528927208865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084572802","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.6710238,0.00052471965,0.31747362,0.00029242897,0.00018311026,0.0005120093,0.0004216555,0.0024008497,0.0071678185],"genre_scores_gemma":[0.83195317,0.0005434602,0.16163816,0.00016569268,0.00007309292,0.00033222945,0.00043378808,0.00030457182,0.0045559057],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812645,0.00030781946,0.00009480888,0.00038350094,0.00093709014,0.00015024286],"domain_scores_gemma":[0.99746335,0.00064862944,0.0001381756,0.00050741126,0.0011120944,0.00013024903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012776101,0.0006174922,0.00048096158,0.00074909796,0.0005353084,0.0005249613,0.0011266146,0.0007967933,0.0046956325],"category_scores_gemma":[0.0018898553,0.00030798846,0.00019960842,0.0007777335,0.00044750012,0.0012488985,0.00074965536,0.00059047004,0.0008433223],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004526104,0.00021437685,0.0014421613,0.00019548667,0.000025261535,0.00018667456,0.00018240816,0.001489777,0.9548546,0.0020464137,0.0006023455,0.038307846],"study_design_scores_gemma":[0.00004918738,0.002069394,0.004545865,0.000017807082,0.000056264784,0.00044911602,0.00016845498,0.02135172,0.962664,0.00051105954,0.008067192,0.000049974595],"about_ca_topic_score_codex":0.00033554778,"about_ca_topic_score_gemma":0.00028485205,"teacher_disagreement_score":0.0046956325,"about_ca_system_score_codex":0.0003167013,"about_ca_system_score_gemma":0.00036227133,"threshold_uncertainty_score":0.015708447},"labels":[],"label_agreement":null},{"id":"W2088257228","doi":"10.1587/transfun.e95.a.909","title":"On the Codeword Length Distribution of T-Codes","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","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 Victoria","funders":"","keywords":"Code word; Mathematics; Code (set theory); Equivalence (formal languages); Limit (mathematics); Discrete mathematics; Combinatorics; Distribution (mathematics); Algorithm; Computer science; Decoding methods; Mathematical analysis","score_opus":0.02969416751035482,"score_gpt":0.27120473244634813,"score_spread":0.24151056493599332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088257228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4594589,0.002627831,0.5256147,0.00065946055,0.00008920301,0.00006207468,0.00046364206,0.00029776475,0.01072644],"genre_scores_gemma":[0.95080817,0.0024347,0.04165676,0.00016372152,0.00023189612,0.00015244857,0.0006453792,0.00021670017,0.0036901424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.00033682422,0.00008253745,0.00034152175,0.0005061645,0.00019919459],"domain_scores_gemma":[0.98540187,0.009834593,0.0013436328,0.0010619947,0.0019666408,0.0003912942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018396054,0.0005186924,0.00068452815,0.0023799886,0.0006785923,0.0014633748,0.0013168713,0.0007874528,0.001899464],"category_scores_gemma":[0.01899472,0.00039895266,0.0004183442,0.0019389625,0.0018982774,0.0031848336,0.001255534,0.001396923,0.00046281086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038508838,0.000077435776,0.0072084563,0.00031762506,0.00007019832,0.00040218674,0.00076538295,0.15383849,0.032118514,0.7532755,0.0017538479,0.04978721],"study_design_scores_gemma":[0.000030301067,0.0001765696,0.003372406,0.000107036474,0.000027518932,0.0006643793,0.00016852537,0.6232105,0.010680843,0.35791913,0.0035371946,0.00010560088],"about_ca_topic_score_codex":0.00083672634,"about_ca_topic_score_gemma":0.00049370405,"teacher_disagreement_score":0.0023799886,"about_ca_system_score_codex":0.0014241523,"about_ca_system_score_gemma":0.0007676833,"threshold_uncertainty_score":0.010332942},"labels":[],"label_agreement":null},{"id":"W2139506438","doi":"10.1587/transfun.e93.a.2266","title":"Binary Sequence Pairs with Two-Level Correlation and Cyclic Difference Pairs","year":2010,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","keywords":"Mathematics; Ideal (ethics); Sequence (biology); Conjecture; Combinatorics; Pseudorandom binary sequence; Circulant matrix; Hadamard matrix; Binary number; Hadamard transform; Discrete mathematics; Mathematical analysis; Arithmetic","score_opus":0.026683947954508073,"score_gpt":0.24666497423585781,"score_spread":0.21998102628134975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139506438","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.67702764,0.00045882488,0.28991064,0.00050132157,0.00012988909,0.00014767275,0.00027264,0.00017918968,0.03137224],"genre_scores_gemma":[0.9316708,0.00014581086,0.06412321,0.00013214636,0.00007448085,0.00012975663,0.00017433308,0.000028886949,0.0035206245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991899,0.00022682245,0.0000503464,0.00015842688,0.00021117854,0.0001632744],"domain_scores_gemma":[0.9981357,0.0007301411,0.00052082347,0.00021342287,0.00023438754,0.00016553828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075515045,0.0004312153,0.00036186905,0.001083371,0.00091835373,0.0010067065,0.00047357616,0.0007350144,0.004357441],"category_scores_gemma":[0.0035675364,0.00023387186,0.00033838116,0.00090581324,0.0013940086,0.0018784719,0.00090327166,0.0007395134,0.0004834473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025781762,0.000049343696,0.001656727,0.000090089576,0.000013493689,0.0005987166,0.0002505715,0.009160063,0.020037368,0.9537781,0.00072160835,0.013386097],"study_design_scores_gemma":[0.00006634889,0.0005563824,0.0013963701,0.000064003405,0.00002739169,0.001761607,0.00027854997,0.089865714,0.040620398,0.85254884,0.012725698,0.00008875525],"about_ca_topic_score_codex":0.00019244831,"about_ca_topic_score_gemma":0.00016086701,"teacher_disagreement_score":0.004357441,"about_ca_system_score_codex":0.00060009357,"about_ca_system_score_gemma":0.0004986668,"threshold_uncertainty_score":0.014577031},"labels":[],"label_agreement":null},{"id":"W2160237814","doi":"10.1093/ietfec/e91-a.11.3393","title":"High-Rate Space-Time Block Coding Schemes","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","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 Saskatchewan","funders":"","keywords":"Space–time block code; Block code; Transmit diversity; Code rate; Computer science; Code (set theory); Space time; Block (permutation group theory); Quaternion; Algorithm; Electronic engineering; Set (abstract data type); Fading; Mathematics; Decoding methods; Engineering","score_opus":0.02024493491488433,"score_gpt":0.24927162454042484,"score_spread":0.2290266896255405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160237814","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.026565703,0.0032252197,0.9447221,0.00045155777,0.00029426414,0.00017952616,0.00040399475,0.00085819495,0.023299456],"genre_scores_gemma":[0.56728077,0.0030397766,0.40685347,0.00032782953,0.0002972338,0.0003365724,0.0006519377,0.0000685214,0.021143924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884784,0.00027690968,0.000057048695,0.00008905726,0.0005481466,0.0001809946],"domain_scores_gemma":[0.998071,0.00053691823,0.00017982913,0.0004317688,0.00072171807,0.00005876405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010680528,0.0007307993,0.00066939514,0.00091613864,0.00057068217,0.000967303,0.001057628,0.0007127132,0.005557109],"category_scores_gemma":[0.002139067,0.00019724162,0.0003368579,0.0016008515,0.000522417,0.0010146758,0.0010605206,0.0010508281,0.0024890609],"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.00046590556,0.00015386715,0.00092395203,0.00046003825,0.00011521111,0.000313157,0.00024943397,0.19501932,0.047391098,0.33895227,0.011249678,0.40470615],"study_design_scores_gemma":[0.00014427878,0.0003025951,0.0007424388,0.000113190305,0.000063961495,0.000863332,0.000060417806,0.82891464,0.041512143,0.083681956,0.04345225,0.00014873223],"about_ca_topic_score_codex":0.0015563938,"about_ca_topic_score_gemma":0.0023211045,"teacher_disagreement_score":0.005557109,"about_ca_system_score_codex":0.0006560367,"about_ca_system_score_gemma":0.0008572437,"threshold_uncertainty_score":0.01859039},"labels":[],"label_agreement":null},{"id":"W222195051","doi":"","title":"Multiple Access Systems with QPSK Modulation","year":2004,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Wireless Communication Networks Research","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 Saskatchewan","funders":"","keywords":"Phase-shift keying; Spectral efficiency; Computer science; Modulation (music); Constellation; Bandwidth (computing); Electronic engineering; Interference (communication); Code division multiple access; Telecommunications; Computer network; Bit error rate; Channel (broadcasting); Engineering; Physics","score_opus":0.04808164298385981,"score_gpt":0.31262502393551717,"score_spread":0.26454338095165736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W222195051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10185317,0.008561931,0.8615282,0.00091274705,0.00040392004,0.0001807178,0.00015898602,0.00025038337,0.026149858],"genre_scores_gemma":[0.93389934,0.005263049,0.0513181,0.00027464272,0.0009244879,0.00015327743,0.00007822586,0.000019811781,0.0080690775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985324,0.00042844415,0.000054602355,0.00017486788,0.00057047943,0.00023913689],"domain_scores_gemma":[0.99907494,0.0003937123,0.00014031942,0.00013093723,0.0002257474,0.000034453682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074518594,0.0010174477,0.001071618,0.0004988506,0.0010457211,0.0020885118,0.0008974308,0.0014285103,0.0016553088],"category_scores_gemma":[0.0025541028,0.0003648145,0.00039997097,0.0011634994,0.0010528258,0.0020450465,0.0012265285,0.001131454,0.00072116614],"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.00046280597,0.00025741497,0.0028025678,0.0007453381,0.0002489155,0.0022458911,0.0005144111,0.4261055,0.04320611,0.39382514,0.0033493468,0.12623656],"study_design_scores_gemma":[0.00008860814,0.00033665457,0.0007872645,0.00007471943,0.00017946152,0.0014300575,0.00009506393,0.89397365,0.007330977,0.07826821,0.017372876,0.00006243572],"about_ca_topic_score_codex":0.0015421286,"about_ca_topic_score_gemma":0.0011848898,"teacher_disagreement_score":0.0020885118,"about_ca_system_score_codex":0.00061816524,"about_ca_system_score_gemma":0.0007233515,"threshold_uncertainty_score":0.0055375695},"labels":[],"label_agreement":null},{"id":"W2565874772","doi":"10.1587/transfun.e100.a.194","title":"Design, Fabrication, and Measurement of Constant Gain UWB Planar Antenna Using FSS-Based Reflectors","year":2016,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Antenna Design and Analysis","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Planar; Bandwidth (computing); Coplanar waveguide; High-gain antenna; Antenna gain; Fabrication; Antenna (radio); Slot antenna; Materials science; Optics; Directional antenna; Optoelectronics; Electronic engineering; Computer science; Antenna measurement; Physics; Engineering; Antenna factor; Telecommunications","score_opus":0.061846395805982377,"score_gpt":0.27186890751460047,"score_spread":0.21002251170861808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565874772","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.69967616,0.00088115706,0.29141474,0.000343718,0.00019004734,0.0002688132,0.00039247502,0.0017885104,0.0050443574],"genre_scores_gemma":[0.752616,0.0005193237,0.24418493,0.000060853785,0.00002916571,0.00013623797,0.00029304152,0.00007417196,0.0020863034],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925345,0.00009983674,0.000047371483,0.00012641917,0.00039882935,0.00007406314],"domain_scores_gemma":[0.99903345,0.00011040461,0.000263879,0.00029736813,0.00025988882,0.000034999633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737908,0.00059786224,0.0004761152,0.0003752797,0.00018866068,0.000516103,0.00096950255,0.0008318377,0.00048407767],"category_scores_gemma":[0.0010134706,0.00036409302,0.00043231898,0.0005009555,0.0005832974,0.0005849495,0.00038502895,0.00051092054,0.00059981935],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007906939,0.000028025943,0.0006359002,0.0000898886,0.0000139537815,0.00010057517,0.00007220038,0.0013755449,0.98609483,0.0005002504,0.0001825396,0.010827168],"study_design_scores_gemma":[0.0000218054,0.00046403534,0.0025244916,0.000006225767,0.000025069536,0.00033095054,0.000056065262,0.005332644,0.9875165,0.00007592041,0.003624668,0.000021717322],"about_ca_topic_score_codex":0.00039530566,"about_ca_topic_score_gemma":0.0003556893,"teacher_disagreement_score":0.00096950255,"about_ca_system_score_codex":0.00044686836,"about_ca_system_score_gemma":0.00038362626,"threshold_uncertainty_score":0.0039024353},"labels":[],"label_agreement":null},{"id":"W2583389971","doi":"10.1587/transfun.e100.a.491","title":"Driver Behavior Assessment in Case of Critical Driving Situations","year":2017,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Autonomous Vehicle Technology and Safety","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; CarSim; Sensor fusion; Inference; Fuzzy logic; Data mining; Simulation; Machine learning; Artificial intelligence","score_opus":0.025154724315853475,"score_gpt":0.32708063921844144,"score_spread":0.30192591490258797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583389971","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.5690358,0.00071585923,0.42036742,0.00042872308,0.00014427205,0.0002703096,0.00076790014,0.0017167084,0.00655306],"genre_scores_gemma":[0.986591,0.0001398561,0.012186855,0.00002321059,0.000014244819,0.000026508591,0.0002171824,0.000020781925,0.00078039174],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99940157,0.00012958204,0.00005189773,0.00010036325,0.00025173515,0.00006477207],"domain_scores_gemma":[0.99857914,0.00037787083,0.00031670494,0.00009887634,0.0005313809,0.000096114396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672178,0.0008919839,0.00039495138,0.0015122988,0.00029326935,0.0007329146,0.00058769196,0.0006387335,0.0013067115],"category_scores_gemma":[0.0028217004,0.00017079248,0.00045556552,0.00028362148,0.00019878756,0.00085863227,0.00074954925,0.00043935978,0.00039565098],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015077771,0.0005751048,0.31649676,0.00067767064,0.00038776096,0.003135169,0.0017684066,0.19410181,0.055799905,0.00629469,0.005491714,0.41376325],"study_design_scores_gemma":[0.000029441951,0.0010582872,0.12479153,0.00010553589,0.0002306257,0.001788221,0.001975925,0.82256764,0.030872013,0.0104303975,0.005974666,0.00017569555],"about_ca_topic_score_codex":0.0027949587,"about_ca_topic_score_gemma":0.003795054,"teacher_disagreement_score":0.0027949587,"about_ca_system_score_codex":0.0003235145,"about_ca_system_score_gemma":0.00046983716,"threshold_uncertainty_score":0.005557418},"labels":[],"label_agreement":null},{"id":"W3031217404","doi":"10.1587/transfun.2019eap1063","title":"Compression by Substring Enumeration Using Sorted Contingency Tables","year":2020,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"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":"","keywords":"Substring; Lexicographical order; Upper and lower bounds; Enumeration; Algorithm; Mathematics; Encoding (memory); Computer science; Combinatorics; Data structure; Artificial intelligence","score_opus":0.047777007840325604,"score_gpt":0.28627400514538504,"score_spread":0.23849699730505944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031217404","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.06922777,0.001041871,0.9247512,0.00021867939,0.000088313776,0.00013205226,0.00040284827,0.001610006,0.0025272972],"genre_scores_gemma":[0.2804182,0.0006086591,0.7144292,0.00017598979,0.00007730465,0.00013037233,0.0013850606,0.00017113828,0.002604114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992459,0.00010995026,0.00009380601,0.00013549843,0.00034877568,0.00006617687],"domain_scores_gemma":[0.9979063,0.0010944245,0.0001541004,0.00042338533,0.00037664713,0.00004522001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058684224,0.00051466364,0.000690403,0.0019678476,0.00036368854,0.0007461033,0.0008423991,0.00038961723,0.0017902768],"category_scores_gemma":[0.0037185347,0.00024471694,0.00034370212,0.002191175,0.00046102758,0.0017994489,0.00066484546,0.0007202022,0.0004617117],"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.00056203717,0.000119511904,0.0022145906,0.00021726792,0.00004339859,0.00029258855,0.00016706272,0.05726891,0.048379093,0.028911404,0.0032535538,0.85857064],"study_design_scores_gemma":[0.00010853772,0.0003489322,0.0023923134,0.00007527515,0.000058544785,0.0010523684,0.0001525054,0.82678086,0.124524474,0.028697066,0.01573288,0.000076196244],"about_ca_topic_score_codex":0.0019228844,"about_ca_topic_score_gemma":0.0027659396,"teacher_disagreement_score":0.0019678476,"about_ca_system_score_codex":0.0005128554,"about_ca_system_score_gemma":0.00093527226,"threshold_uncertainty_score":0.0059890747},"labels":[],"label_agreement":null},{"id":"W4386058569","doi":"10.1587/transfun.2023eal2068","title":"DNN Aided Joint Source-Channel Decoding Scheme for Polar Codes","year":2023,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","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":"Université Laval","funders":"","keywords":"Decoding methods; Computer science; Joint (building); Channel (broadcasting); Belief propagation; Algorithm; Factor graph; Polar code; Source code; Polar; Telecommunications; Engineering; Physics","score_opus":0.06829875709549948,"score_gpt":0.31812941284437074,"score_spread":0.24983065574887126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386058569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016742539,0.00029460742,0.97816795,0.00022146474,0.00008684478,0.000046526613,0.000115481875,0.0006156393,0.0037090327],"genre_scores_gemma":[0.5255388,0.00048881484,0.46414587,0.00033871728,0.000069844216,0.00010527061,0.00045321163,0.00008274628,0.008776793],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994168,0.00013436929,0.000032351698,0.000091703056,0.00024721227,0.000077483],"domain_scores_gemma":[0.99927634,0.000185233,0.00006399498,0.00013864369,0.0002974838,0.00003842997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051674637,0.0008289397,0.00051321264,0.00051188644,0.00054043665,0.0005446803,0.00067156676,0.0007944892,0.0018836709],"category_scores_gemma":[0.0016185682,0.00020877797,0.00032575926,0.00054271444,0.0006944355,0.0011432953,0.0012736614,0.0011199004,0.000725202],"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.00085349317,0.00009821042,0.0015012751,0.00028438622,0.00010130612,0.0004768186,0.00031563456,0.37114987,0.07633604,0.096744016,0.0065502934,0.44558868],"study_design_scores_gemma":[0.000025347808,0.00009066178,0.00012787616,0.000019488794,0.000022946226,0.00016948355,0.000025792884,0.95465523,0.028245237,0.012444544,0.004142674,0.00003072914],"about_ca_topic_score_codex":0.004020683,"about_ca_topic_score_gemma":0.0066805533,"teacher_disagreement_score":0.004020683,"about_ca_system_score_codex":0.0006794565,"about_ca_system_score_gemma":0.001857501,"threshold_uncertainty_score":0.007994592},"labels":[],"label_agreement":null},{"id":"W4405046226","doi":"10.1587/transfun.2024eap1089","title":"Analysis of Series-Connected Double-Layer Coils for MHz Inductive Power Transfer","year":2024,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Wireless Power Transfer 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":"Artificial Intelligence in Medicine (Canada)","funders":"Japan Society for the Promotion of Science","keywords":"Series (stratigraphy); Maximum power transfer theorem; Electrical engineering; Transfer (computing); Power (physics); Layer (electronics); Telecommunications; Computer science; Materials science; Physics; Engineering","score_opus":0.032155531813995886,"score_gpt":0.2808548639521948,"score_spread":0.2486993321381989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405046226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12313681,0.0016252355,0.848912,0.00023662139,0.00009459672,0.00013958666,0.00009477867,0.00050292455,0.025257362],"genre_scores_gemma":[0.9627889,0.00061241863,0.030267568,0.00005597887,0.000040441337,0.00007078458,0.00006681972,0.00006503399,0.00603215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998312,0.000039692248,0.000005250639,0.00002920962,0.00007644943,0.000018232671],"domain_scores_gemma":[0.99969625,0.00014043118,0.0000562373,0.000029643877,0.000064339954,0.000013137893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026838432,0.00043552177,0.000306171,0.00030490445,0.000176245,0.00049824844,0.00046008613,0.0005349322,0.0022355833],"category_scores_gemma":[0.00079878815,0.0002539091,0.0003969992,0.00025346188,0.0004277146,0.00059799844,0.00024052132,0.00025621348,0.0005867025],"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.00036562418,0.00008446585,0.0020048209,0.00087249663,0.00010374033,0.00079732656,0.00047834642,0.5039447,0.36264253,0.06359606,0.0032704696,0.06183945],"study_design_scores_gemma":[0.000010007173,0.00016002395,0.0006762784,0.000028837963,0.00002540758,0.00024694513,0.0000472029,0.9567577,0.031954307,0.0036579524,0.006422203,0.000013183631],"about_ca_topic_score_codex":0.00036094312,"about_ca_topic_score_gemma":0.0004587266,"teacher_disagreement_score":0.0022355833,"about_ca_system_score_codex":0.00056741387,"about_ca_system_score_gemma":0.00023261984,"threshold_uncertainty_score":0.0074787736},"labels":[],"label_agreement":null},{"id":"W4414079220","doi":"10.1587/transfun.2025eap1069","title":"Key-Recovery Attack on 5-Round AES with Multiple-of-8 Property","year":2025,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Physical Unclonable Functions (PUFs) and Hardware Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Continental (Canada)","funders":"","keywords":"Property (philosophy); Slide attack; Correlation attack; Cryptanalysis; Block cipher; Cryptography","score_opus":0.02984746150633862,"score_gpt":0.27896158891549144,"score_spread":0.2491141274091528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414079220","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.53398526,0.000704064,0.45127055,0.000888002,0.0001960511,0.00025003275,0.00022644893,0.0011935541,0.011286137],"genre_scores_gemma":[0.9712777,0.00012820397,0.026999753,0.000109394416,0.00002968241,0.00006022396,0.000080164216,0.000029412238,0.0012855856],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996702,0.0007924034,0.00029593604,0.0004097689,0.0011721465,0.00062766933],"domain_scores_gemma":[0.99718493,0.00089952705,0.00054365705,0.0010379859,0.0002497506,0.00008415929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001604957,0.00069119426,0.0008220189,0.0006391722,0.0007815265,0.00054605916,0.000767023,0.0009781544,0.0018108902],"category_scores_gemma":[0.004107797,0.00033853023,0.0011974719,0.0004158651,0.0010253154,0.0024070505,0.0022163938,0.001232321,0.000520389],"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.004718928,0.00036592828,0.007276541,0.0006060856,0.00064462586,0.0036092482,0.00089912955,0.17166299,0.39491516,0.20944905,0.006346464,0.19950579],"study_design_scores_gemma":[0.00028892996,0.0017783288,0.0031671722,0.00009277184,0.00020237431,0.004274288,0.00018080162,0.596352,0.32424986,0.05569287,0.013562489,0.00015820184],"about_ca_topic_score_codex":0.00029486857,"about_ca_topic_score_gemma":0.00030777094,"teacher_disagreement_score":0.0018108902,"about_ca_system_score_codex":0.000574157,"about_ca_system_score_gemma":0.000759991,"threshold_uncertainty_score":0.00848794},"labels":[],"label_agreement":null},{"id":"W7083190957","doi":"10.1587/transfun.2025eap1066","title":"Further Designs of Low-Hit-Zone Frequency-Hopping Sequence Set with Strictly Optimal Partial Hamming Correlation","year":2025,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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":"Artificial Intelligence in Medicine (Canada)","funders":"Yibin University","keywords":"Hamming distance; Sequence (biology); Hamming code; Hamming weight; Set (abstract data type); Autocorrelation; Hamming graph; Complementary sequences","score_opus":0.03486510300478918,"score_gpt":0.3009557263160226,"score_spread":0.2660906233112334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083190957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22420327,0.0010423417,0.76154304,0.00032261026,0.00023253507,0.00020289612,0.0002620298,0.000548676,0.011642687],"genre_scores_gemma":[0.77261,0.000504857,0.22272284,0.00015786331,0.000073524105,0.0001929252,0.00037576782,0.000035470148,0.0033267683],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.00015714645,0.00006731524,0.00013360639,0.00025502476,0.00007711843],"domain_scores_gemma":[0.99926656,0.00019236708,0.0001470361,0.000108207525,0.00022970975,0.000056250614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003842247,0.0005991268,0.00038838512,0.0007682834,0.00042612563,0.00047412966,0.0006763803,0.00038912316,0.0014795089],"category_scores_gemma":[0.0013819891,0.00024013977,0.0004347594,0.00069864606,0.0003592594,0.0007942183,0.00055946666,0.00053513004,0.0003965608],"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.00073307124,0.00032930195,0.0043425765,0.0008075805,0.00015506247,0.0006062711,0.0006995802,0.076950654,0.4155002,0.13404243,0.004508463,0.3613249],"study_design_scores_gemma":[0.00019817597,0.0026440176,0.0036756997,0.00013514452,0.00017797429,0.0019525478,0.00024209441,0.5294553,0.38562486,0.03465152,0.041024677,0.0002179915],"about_ca_topic_score_codex":0.0005245783,"about_ca_topic_score_gemma":0.0006513865,"teacher_disagreement_score":0.0014795089,"about_ca_system_score_codex":0.00055011536,"about_ca_system_score_gemma":0.00053341594,"threshold_uncertainty_score":0.0049494505},"labels":[],"label_agreement":null},{"id":"W7106531849","doi":"10.1587/transfun.2025smp0002","title":"A Proposed for Lossless Compression of Images for Hardware Implementation","year":2025,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsemi (Canada)","funders":"","keywords":"Lossless compression; Lossy compression; Data compression; Data compression ratio; Image compression; Lossless JPEG; Compression (physics)","score_opus":0.029904428147059438,"score_gpt":0.372366292713548,"score_spread":0.3424618645664885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106531849","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.017006908,0.0016964354,0.9675272,0.00046088963,0.0004906376,0.00021819574,0.00017514639,0.0027712595,0.009653358],"genre_scores_gemma":[0.24767806,0.0020370618,0.71765065,0.00074497244,0.0003235471,0.00038154703,0.00063127297,0.0002209381,0.030331893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997117,0.000023103288,0.000017868337,0.000045180062,0.00018270899,0.000019436355],"domain_scores_gemma":[0.9997279,0.000038181006,0.00002355332,0.00005924343,0.00013576756,0.000015277552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019688181,0.00061191915,0.00025869982,0.00079404115,0.00039005652,0.0007693798,0.0009065251,0.00055888353,0.0053524454],"category_scores_gemma":[0.0005801559,0.00023677136,0.00028577095,0.0005165093,0.00028704395,0.0010326151,0.0003795278,0.0007006033,0.0018822245],"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.00037591407,0.0001369688,0.0005837989,0.00047990054,0.00006591695,0.0003724654,0.000117003,0.0074140807,0.34861514,0.022898395,0.013751145,0.60518926],"study_design_scores_gemma":[0.0001928025,0.0007178192,0.0016811169,0.00010948928,0.00012126434,0.0032241142,0.000060714417,0.29372722,0.54315335,0.0056593874,0.15125899,0.00009370565],"about_ca_topic_score_codex":0.00053291634,"about_ca_topic_score_gemma":0.0006733737,"teacher_disagreement_score":0.0053524454,"about_ca_system_score_codex":0.00035087115,"about_ca_system_score_gemma":0.000504007,"threshold_uncertainty_score":0.017905712},"labels":[],"label_agreement":null}]}