{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02833394,0.0012062471,0.9621323,0.006207138,0.00015727335,0.00024708628,0.00001025682,0.00009832148,0.0016074687],"genre_scores_gemma":[0.97761315,0.0005678865,0.02045964,0.001265008,0.0000134190395,0.000059854934,0.000001383065,0.0000062950667,0.000013339799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843353,0.0003195821,0.00026572007,0.00026698137,0.00032564419,0.00038855994],"domain_scores_gemma":[0.99738264,0.0011017611,0.000066666136,0.0013025887,0.000050568902,0.00009576624],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001072337,0.00017184387,0.00015037303,0.00026639656,0.001488746,0.00020814668,0.0021008758,0.000046708352,0.000031769214],"category_scores_gemma":[0.000002883922,0.00012891839,0.00013737979,0.0009547875,0.0006245453,0.00047298934,0.00004221055,0.00031288093,0.000010479797],"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.000011756796,0.0011114032,0.00019259172,0.0000073271494,0.000044176708,7.902471e-8,0.0007922369,0.0017568034,0.00039964222,0.9050095,0.0000564462,0.09061801],"study_design_scores_gemma":[0.0012823587,0.0054085054,0.0042256843,0.0002732933,0.00014187196,0.00004498481,0.00056635006,0.9223138,0.012341228,0.022877393,0.029353954,0.0011705601],"about_ca_topic_score_codex":0.000013215461,"about_ca_topic_score_gemma":0.000023736711,"teacher_disagreement_score":0.94927925,"about_ca_system_score_codex":0.00003463574,"about_ca_system_score_gemma":0.000081789454,"threshold_uncertainty_score":0.9998112},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30159578,0.0020062833,0.6935951,0.0013766406,0.00011303629,0.0005400805,0.00005917657,0.00036539792,0.0003484966],"genre_scores_gemma":[0.939488,0.001935216,0.05824395,0.000027920953,0.0000136254,0.00020288653,0.00005649246,0.000021759422,0.000010139242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986529,0.00007411562,0.00049498753,0.00024451222,0.00021857771,0.00031495965],"domain_scores_gemma":[0.9977096,0.0005982746,0.00010950281,0.001436616,0.00009648776,0.000049522136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002116247,0.00021101526,0.00025201013,0.0002813315,0.00080228155,0.00015629677,0.0014994872,0.0001312353,0.000013267895],"category_scores_gemma":[0.0000025175461,0.00021887402,0.000108000975,0.00038728354,0.00093561946,0.0003281296,0.00008713948,0.00032709268,0.0000034065038],"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.000052515275,0.0016119102,0.00033974022,0.00014259387,0.00022132951,1.332992e-7,0.00023149741,0.022551188,0.046120856,0.36307225,0.0001246288,0.5655314],"study_design_scores_gemma":[0.0005395203,0.00046958053,0.0016874035,0.000064748754,0.00004408269,0.0000039784377,0.000081492246,0.9686966,0.022471093,0.004693158,0.0009486197,0.00029970624],"about_ca_topic_score_codex":0.00004336745,"about_ca_topic_score_gemma":0.00023283076,"teacher_disagreement_score":0.9461454,"about_ca_system_score_codex":0.00013565688,"about_ca_system_score_gemma":0.00003996115,"threshold_uncertainty_score":0.89254236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17791863,0.0004525035,0.82044226,0.0005973865,0.00013556369,0.00037638276,0.000015352152,0.00005509822,0.0000068395634],"genre_scores_gemma":[0.66034615,0.0005234714,0.33903822,0.000052326912,0.000010401217,0.000018191753,0.0000040315585,0.000006071942,0.0000011258189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981147,0.00024085483,0.00046976772,0.00048187491,0.00039540193,0.0002974133],"domain_scores_gemma":[0.9972999,0.0010800003,0.00030269343,0.0010281696,0.0001930109,0.000096215335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937161,0.00018371586,0.0002492693,0.0003114617,0.0011364765,0.000105458195,0.0011965574,0.00008494646,0.0000018532126],"category_scores_gemma":[0.0000131420475,0.0001647652,0.00009179643,0.00085967506,0.0005002436,0.00035032225,0.00005214247,0.0002531661,4.5893157e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005443016,0.0015827784,0.000029046441,0.000026754431,0.00006533526,5.391851e-7,0.0015265467,0.54532784,0.004660364,0.14538977,0.00002819601,0.30130842],"study_design_scores_gemma":[0.00037944314,0.002281482,0.0007700729,0.000043620963,0.000018283918,0.00005757508,0.000060863647,0.9862065,0.003318436,0.006585723,0.000108655564,0.0001693853],"about_ca_topic_score_codex":0.00003110826,"about_ca_topic_score_gemma":0.00001250449,"teacher_disagreement_score":0.48242754,"about_ca_system_score_codex":0.000056083372,"about_ca_system_score_gemma":0.0003225105,"threshold_uncertainty_score":0.87409735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048537828,0.00029902626,0.9467718,0.0034822554,0.00020481965,0.00028012542,0.0000094481775,0.00008011744,0.0003345751],"genre_scores_gemma":[0.78709257,0.00029702112,0.21159549,0.00083549914,0.000030726307,0.00005852103,0.0000054917937,0.000009283496,0.00007536412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855274,0.00006491753,0.00031574478,0.00043312236,0.00027625624,0.00035723933],"domain_scores_gemma":[0.9983678,0.00030886751,0.00020317957,0.00089668523,0.00011993286,0.000103564445],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033782027,0.00018278352,0.00019131522,0.00024341894,0.0015291214,0.00048488757,0.0016091547,0.00007274566,0.0000073484275],"category_scores_gemma":[0.000006063723,0.00016818542,0.0000904283,0.00059248507,0.00053416385,0.000554835,0.000052766034,0.0003019362,0.0000034005325],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026481943,0.0008632302,0.000100248886,0.000031112697,0.000061658175,2.718647e-7,0.0009863777,0.006583732,0.015300191,0.07902584,0.00015297609,0.8968679],"study_design_scores_gemma":[0.00086859445,0.002261433,0.00023310955,0.000093852956,0.000034694654,0.000028541961,0.00015478337,0.84157056,0.12291842,0.010077264,0.02126851,0.00049025676],"about_ca_topic_score_codex":0.000029009274,"about_ca_topic_score_gemma":0.00012947228,"teacher_disagreement_score":0.8963776,"about_ca_system_score_codex":0.000040086485,"about_ca_system_score_gemma":0.0002015049,"threshold_uncertainty_score":0.99977076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07615018,0.0014018338,0.920642,0.0008162177,0.0001152336,0.0004064137,0.000069365095,0.000037267604,0.00036146134],"genre_scores_gemma":[0.77751815,0.00082272757,0.22142345,0.0001531561,0.0000050814106,0.000037665464,0.000002948623,0.000005286617,0.000031536518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985925,0.00013107047,0.00040690487,0.00034504556,0.00025573076,0.0002687641],"domain_scores_gemma":[0.9978619,0.00026482504,0.00028666158,0.0014191207,0.0001063615,0.00006113802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095561,0.00015099655,0.00021443827,0.00008169996,0.0009618742,0.00012486678,0.0026515487,0.000050827945,0.00001054779],"category_scores_gemma":[0.0000032645244,0.00011412752,0.00012533866,0.00043245914,0.0008250573,0.0004914166,0.00020388565,0.00017124595,7.7079716e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020870326,0.006258046,0.0019148152,0.00022517158,0.00057707605,7.1512034e-7,0.019598918,0.010034394,0.005772056,0.32696164,0.00052853907,0.6279199],"study_design_scores_gemma":[0.00071728055,0.0017467969,0.0027600245,0.00014108191,0.000053897682,0.000017335075,0.00012842439,0.95321006,0.01915731,0.008133351,0.0135932965,0.00034115967],"about_ca_topic_score_codex":0.00020751149,"about_ca_topic_score_gemma":0.00012664446,"teacher_disagreement_score":0.9431757,"about_ca_system_score_codex":0.000027027723,"about_ca_system_score_gemma":0.00015982352,"threshold_uncertainty_score":0.7398056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055221267,0.0011558528,0.93978167,0.0016866158,0.0005582648,0.00038864216,0.000009619068,0.00013560923,0.0010624735],"genre_scores_gemma":[0.96770775,0.00014409216,0.031102337,0.00087129854,0.00008332689,0.00005144239,0.000004037267,0.000013751307,0.000021961883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763864,0.00036475676,0.00050777243,0.00045548767,0.00046795668,0.00056536583],"domain_scores_gemma":[0.99687403,0.0013180024,0.00025166053,0.0012889262,0.000106028434,0.0001613661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010069394,0.00027087826,0.0003001744,0.0003696198,0.0011640855,0.00033496384,0.0016840033,0.00009959124,0.000017992405],"category_scores_gemma":[0.000008674678,0.00024542157,0.00016392548,0.0007106653,0.00034475615,0.0005942809,0.00004886765,0.00042552358,0.000018167384],"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.00021559489,0.009975486,0.004546087,0.00013985322,0.00037812052,0.0000030638944,0.0046530324,0.27041677,0.0039880783,0.17440987,0.00020566265,0.5310684],"study_design_scores_gemma":[0.0006807125,0.003207226,0.00081747404,0.00023976718,0.000022836019,0.000020197549,0.00009135311,0.9890634,0.0038591272,0.00020250845,0.0014154576,0.00037998077],"about_ca_topic_score_codex":0.00004689649,"about_ca_topic_score_gemma":0.000083808554,"teacher_disagreement_score":0.9124865,"about_ca_system_score_codex":0.0001573818,"about_ca_system_score_gemma":0.000108130625,"threshold_uncertainty_score":0.9999998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5347845,0.008904192,0.4473412,0.002088214,0.0004982946,0.00052394747,0.00011599034,0.00045096985,0.0052927174],"genre_scores_gemma":[0.9726786,0.001260699,0.02592106,0.00005267816,0.000018647857,0.000031546853,0.000012113436,0.000009230694,0.000015404552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990338,0.000051013318,0.00030772618,0.00018009999,0.00018726732,0.00024006313],"domain_scores_gemma":[0.9992368,0.00019555188,0.00005780122,0.0004437385,0.000025963423,0.000040129802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018769926,0.00013656291,0.00014842158,0.00017911877,0.0005237946,0.00007946672,0.0006233569,0.000032834814,0.000034655342],"category_scores_gemma":[4.7419962e-7,0.00013899391,0.00005481132,0.00038069265,0.00054480275,0.0002583606,0.000018297842,0.00017103607,0.0000052940372],"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.000039249597,0.0019821746,0.005098988,0.00018469479,0.00047596707,0.0000014872502,0.0017117632,0.5701048,0.025238372,0.109539166,0.0018082873,0.2838151],"study_design_scores_gemma":[0.0013864575,0.0014015972,0.0055966503,0.00015380284,0.000093711875,0.000060797454,0.00085415936,0.89385754,0.040703174,0.011706263,0.043232735,0.0009531049],"about_ca_topic_score_codex":0.00023587294,"about_ca_topic_score_gemma":0.0005303721,"teacher_disagreement_score":0.43789414,"about_ca_system_score_codex":0.00006883534,"about_ca_system_score_gemma":0.000036593003,"threshold_uncertainty_score":0.5668007},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7480883,0.0006683871,0.24935262,0.0010591738,0.00021845543,0.00032593997,0.00006043034,0.000055498465,0.00017120581],"genre_scores_gemma":[0.9628575,0.00059750024,0.035988055,0.00038549062,0.00002965855,0.000108560125,0.0000052375344,0.000010384011,0.000017652153],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987008,0.0001366118,0.0003049177,0.000344355,0.00018044432,0.0003328557],"domain_scores_gemma":[0.99876654,0.00033327306,0.00013651396,0.0006024994,0.000066134286,0.000095050375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008439719,0.00015665233,0.00023132894,0.00024333899,0.0008554783,0.00016336562,0.0009395043,0.000046287718,0.000036694906],"category_scores_gemma":[0.000004573089,0.00014343481,0.000079775265,0.00032275857,0.00042374915,0.00022656795,0.00005557014,0.00008380838,0.000007801895],"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.000086518936,0.00071796554,0.000076079035,0.000058259364,0.00003639858,3.3644838e-7,0.00087596517,0.003615219,0.94015163,0.017108671,0.00008765325,0.037185274],"study_design_scores_gemma":[0.0027074504,0.01785555,0.0012259027,0.00053583464,0.00022426639,0.00008136151,0.0009991458,0.25032303,0.6856369,0.010402978,0.02839392,0.0016136566],"about_ca_topic_score_codex":0.00004678059,"about_ca_topic_score_gemma":0.000107474865,"teacher_disagreement_score":0.25451475,"about_ca_system_score_codex":0.000029970655,"about_ca_system_score_gemma":0.000043773343,"threshold_uncertainty_score":0.65797335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78082526,0.0046314774,0.21056785,0.0023538824,0.00024652935,0.00047735235,0.0000041503513,0.00006151301,0.00083198294],"genre_scores_gemma":[0.9924928,0.00029957242,0.007058173,0.0000920378,0.0000055014452,0.000030138406,5.137273e-7,0.0000035760445,0.000017678229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829495,0.0002766632,0.0003572114,0.0002670091,0.00060462236,0.00019951852],"domain_scores_gemma":[0.9983619,0.000112583264,0.00019286021,0.0011848974,0.00011550073,0.0000322829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089000975,0.00011888817,0.00016859474,0.00018636948,0.00085165905,0.00003209048,0.0018247238,0.00005261608,0.000012006853],"category_scores_gemma":[0.0000037507152,0.00009185658,0.00009582097,0.00075671426,0.00086413464,0.00030601956,0.00004097943,0.0001731405,0.0000018299935],"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.00006631832,0.00796435,0.0097863935,0.00007042464,0.00092186325,0.0000012839923,0.014521627,0.025089208,0.28647578,0.46476984,0.0004035298,0.18992938],"study_design_scores_gemma":[0.0010856478,0.0012796456,0.006629403,0.000091327776,0.00007603051,0.000112561676,0.0004894144,0.34184858,0.64500654,0.00223795,0.0008226607,0.00032024985],"about_ca_topic_score_codex":0.00008142076,"about_ca_topic_score_gemma":0.000068574416,"teacher_disagreement_score":0.4625319,"about_ca_system_score_codex":0.00007655078,"about_ca_system_score_gemma":0.0001924992,"threshold_uncertainty_score":0.6550359},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16840723,0.0014667959,0.8269905,0.002214088,0.00010885923,0.00016440229,0.000018791157,0.00004187608,0.0005874953],"genre_scores_gemma":[0.9899467,0.0008544413,0.008972088,0.00018770403,0.000006978421,0.000020436719,0.0000025989293,0.0000030854483,0.0000059317113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883205,0.00022911943,0.000255912,0.00017938454,0.0002448282,0.00025869327],"domain_scores_gemma":[0.99777484,0.001021555,0.00015450703,0.00094022066,0.000055960627,0.000052937816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096158386,0.00011903581,0.00014713506,0.00011716593,0.00077558024,0.00008255242,0.0016209037,0.000034275537,0.000008577883],"category_scores_gemma":[0.0000049197347,0.00008747608,0.00009346976,0.0007412317,0.0006755723,0.00037899485,0.00006400302,0.00019974106,0.0000022312995],"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.000007830358,0.00041790438,0.00008502334,0.0000047247113,0.000030649804,1.3821823e-8,0.0004209685,0.00022943858,0.00023741066,0.94308716,0.00002963235,0.055449244],"study_design_scores_gemma":[0.0022673754,0.014901566,0.012594716,0.00084444316,0.0002939758,0.00009305184,0.002205603,0.5106616,0.10770515,0.31755006,0.028829776,0.0020527027],"about_ca_topic_score_codex":0.000016742739,"about_ca_topic_score_gemma":0.000014744457,"teacher_disagreement_score":0.8215395,"about_ca_system_score_codex":0.00002514661,"about_ca_system_score_gemma":0.000048957012,"threshold_uncertainty_score":0.59652144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86382693,0.00081902073,0.134338,0.00018991856,0.000111741734,0.00018354155,0.000017926403,0.00009130974,0.00042159384],"genre_scores_gemma":[0.98821425,0.0008274254,0.010860621,0.000030016716,0.000006011215,0.000032582255,0.000004051166,0.0000086602495,0.000016376838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920696,0.00006408275,0.00020359059,0.00019038675,0.00014192588,0.00019303599],"domain_scores_gemma":[0.99916583,0.000225496,0.000059811944,0.00045256497,0.00003263791,0.00006366361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027317108,0.0001404875,0.00014624425,0.00014413962,0.00052695815,0.000084610285,0.00041555136,0.00004538518,0.000007737691],"category_scores_gemma":[8.9778933e-7,0.00012106793,0.000028929606,0.00034935013,0.0006652377,0.00023679656,0.000014470495,0.00031780615,0.0000012906527],"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.00009343016,0.0009936027,0.009593721,0.00023670205,0.00038566763,0.000002248505,0.005204774,0.0747528,0.16052763,0.21739785,0.000025686428,0.53078586],"study_design_scores_gemma":[0.0008198009,0.0015711746,0.010393233,0.00020209934,0.00006777862,0.0001233242,0.0007838984,0.9759326,0.005346474,0.00363285,0.0005843362,0.0005424589],"about_ca_topic_score_codex":0.000044519773,"about_ca_topic_score_gemma":0.00044743408,"teacher_disagreement_score":0.9011798,"about_ca_system_score_codex":0.000017357701,"about_ca_system_score_gemma":0.000035198493,"threshold_uncertainty_score":0.49370068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3288603,0.0054299855,0.6623494,0.0010444649,0.00008805561,0.00037982283,0.00002906101,0.0007273134,0.0010915708],"genre_scores_gemma":[0.8734117,0.018677657,0.107748665,0.000057450612,0.0000064768533,0.000040230312,0.0000048624497,0.000015563277,0.0000373716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898285,0.00008289581,0.0003212344,0.00019621346,0.00016329058,0.00025353883],"domain_scores_gemma":[0.99856555,0.00030267707,0.000088619636,0.00092044857,0.00006198584,0.000060718954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023184365,0.00017406578,0.0002275496,0.00022654507,0.0008194507,0.000047339996,0.0009857051,0.000056001667,0.000017414066],"category_scores_gemma":[0.0000019896877,0.00018246753,0.000059719983,0.0005100492,0.00069636217,0.00034236253,0.000045333243,0.00028936678,0.0000087082135],"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.00006278277,0.002037068,0.00027900757,0.00019979177,0.0007092483,0.0000031561976,0.0030342976,0.31796557,0.19217056,0.18948002,0.00095588766,0.2931026],"study_design_scores_gemma":[0.0006551614,0.00097153534,0.00029029176,0.00019934107,0.00004409709,0.0000721191,0.00014771463,0.758773,0.22376741,0.0024061343,0.011944296,0.0007288865],"about_ca_topic_score_codex":0.000018939447,"about_ca_topic_score_gemma":0.000016609982,"teacher_disagreement_score":0.5546008,"about_ca_system_score_codex":0.000074572345,"about_ca_system_score_gemma":0.00004990451,"threshold_uncertainty_score":0.74408096},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032053396,0.0018483454,0.9625676,0.0025377912,0.000067877976,0.00043340735,0.0000057208604,0.00011478695,0.00037102625],"genre_scores_gemma":[0.908997,0.0021840113,0.08859229,0.000097479,0.000008741633,0.00009291804,0.00000461002,0.000009317822,0.000013651552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810857,0.00020599182,0.00037944596,0.00042179824,0.00051809003,0.0003661008],"domain_scores_gemma":[0.9971483,0.00045451365,0.00020840835,0.0018885176,0.00019357714,0.00010671379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056174543,0.00018377033,0.00022513284,0.0003461551,0.0011022242,0.00068341976,0.004095062,0.000059572023,0.0000025227978],"category_scores_gemma":[0.000002939852,0.00015953452,0.00005298461,0.001365243,0.0006550146,0.0013636518,0.00021604798,0.00033873727,0.0000039766783],"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.000028170556,0.00094245543,0.00046499196,0.000033956912,0.00010344105,6.9272187e-7,0.000702388,0.64748114,0.00046849865,0.20455942,0.000014698941,0.14520013],"study_design_scores_gemma":[0.00083872065,0.0010737033,0.0011995614,0.00014416003,0.000010780245,0.000033348766,0.000094509545,0.9925002,0.001195729,0.0018695265,0.0007763172,0.00026346458],"about_ca_topic_score_codex":0.000299843,"about_ca_topic_score_gemma":0.00035545888,"teacher_disagreement_score":0.8769436,"about_ca_system_score_codex":0.00013780512,"about_ca_system_score_gemma":0.00030959508,"threshold_uncertainty_score":0.8477529},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0202819,0.0031568615,0.9760224,0.00030427327,0.000023548444,0.00013325438,0.000013058869,0.000035856552,0.000028847575],"genre_scores_gemma":[0.95862937,0.0027401412,0.03857485,0.00003271668,0.0000030207002,0.0000088709585,7.952081e-7,0.0000073814817,0.0000028394254],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990127,0.00009726151,0.00031567368,0.0001689665,0.00022529118,0.00018009653],"domain_scores_gemma":[0.9991315,0.0002177133,0.00009925504,0.0003707592,0.00012873975,0.000052031333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978457,0.00012475184,0.0001988164,0.00023786108,0.00027256814,0.000032433436,0.0003345333,0.00003396595,0.000007640228],"category_scores_gemma":[0.0000031675454,0.000096714204,0.00004776983,0.0004077706,0.0005217256,0.00014197573,0.000007397667,0.00007409303,4.4038336e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039119015,0.0003507348,0.0004284237,0.000065933695,0.000296365,2.891827e-7,0.00035540023,0.008119452,0.928108,0.0030001565,0.000016344391,0.05921978],"study_design_scores_gemma":[0.0004324051,0.00052154687,0.00015602456,0.00023761732,0.000084526386,0.0000052620035,0.00015190523,0.9640634,0.033602133,0.00044728944,0.00009442101,0.0002034706],"about_ca_topic_score_codex":0.00003035831,"about_ca_topic_score_gemma":0.00004193309,"teacher_disagreement_score":0.95594394,"about_ca_system_score_codex":0.00008038513,"about_ca_system_score_gemma":0.00009310356,"threshold_uncertainty_score":0.3943891},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8495773,0.0003970401,0.14828418,0.00084871415,0.00005939795,0.00014909921,0.000012723264,0.000047162284,0.00062437536],"genre_scores_gemma":[0.9760657,0.0006911165,0.023189506,0.000008947246,0.0000020761122,0.000033652796,9.169871e-7,0.000004718366,0.0000033678693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934953,0.00003431957,0.00025358496,0.0001268425,0.00007758735,0.0001581091],"domain_scores_gemma":[0.9990137,0.00019731701,0.00006340317,0.0006652453,0.000032090815,0.000028207118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025010356,0.00008369468,0.00014550364,0.00015604895,0.0007352814,0.00004471368,0.00059106894,0.000056642286,0.000011642489],"category_scores_gemma":[0.0000028793736,0.00008854609,0.00003756984,0.00012167972,0.00095733645,0.0002638333,0.00003464735,0.00026514396,5.7324695e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007955297,0.0027275165,0.019005464,0.00010334038,0.0001371475,0.000025132671,0.0020332972,0.023159254,0.0079862,0.21829236,0.000011434447,0.7265109],"study_design_scores_gemma":[0.00067779096,0.0008692886,0.059229016,0.00014053138,0.00009860102,0.00020948864,0.0009227001,0.9270222,0.0066246474,0.003691846,0.00014037975,0.0003734712],"about_ca_topic_score_codex":0.00007189132,"about_ca_topic_score_gemma":0.001022839,"teacher_disagreement_score":0.903863,"about_ca_system_score_codex":0.000050915263,"about_ca_system_score_gemma":0.000055913104,"threshold_uncertainty_score":0.5655264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029814828,0.003524005,0.96492887,0.0012525506,0.000076830365,0.00019450265,0.000035229958,0.00008275765,0.0000904434],"genre_scores_gemma":[0.8485987,0.0014748612,0.14958411,0.0002901115,0.000013245453,0.000009738463,0.000017202838,0.0000065555832,0.000005449713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984739,0.00013716267,0.00038599607,0.00042116165,0.00031138843,0.00027038404],"domain_scores_gemma":[0.9987699,0.00018086088,0.00021874456,0.0006344739,0.000080359154,0.00011570196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566896,0.00016934828,0.00021756097,0.00010812878,0.00106552,0.00029446866,0.0015661333,0.000052756826,0.000011604065],"category_scores_gemma":[0.0000029306404,0.0001584389,0.00005770815,0.0006476236,0.00024893694,0.0009831177,0.00014733462,0.00022781774,0.0000019430727],"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.00005061394,0.001380053,0.0006832033,0.000086156564,0.0001730208,0.0000013731802,0.0028474582,0.018512266,0.17916307,0.043498512,0.00055880815,0.7530455],"study_design_scores_gemma":[0.00032777173,0.00049293303,0.00004496006,0.00006389535,0.000015047141,0.0000063222324,0.000082633785,0.9796969,0.015046943,0.00027688898,0.003753308,0.00019235854],"about_ca_topic_score_codex":0.0000940892,"about_ca_topic_score_gemma":0.000013692353,"teacher_disagreement_score":0.9611847,"about_ca_system_score_codex":0.000034259632,"about_ca_system_score_gemma":0.00009973909,"threshold_uncertainty_score":0.81952256},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030060248,0.0007518959,0.96512324,0.002780214,0.00015257942,0.00040675214,0.000017089737,0.00057436706,0.00013358823],"genre_scores_gemma":[0.71089435,0.0010923789,0.28762242,0.00020899986,0.000011173851,0.00010507742,0.0000055202204,0.000012047788,0.000048010435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982086,0.00012186157,0.0004308539,0.00047809246,0.00029423853,0.00046638589],"domain_scores_gemma":[0.9976266,0.0008408186,0.00020992894,0.0011023656,0.00013316933,0.000087125474],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011789246,0.00019989797,0.0002702606,0.00053550577,0.0013659872,0.00027631826,0.0020812107,0.00006956233,0.0000023645878],"category_scores_gemma":[0.000015585956,0.00020128998,0.00013999318,0.0012727807,0.00037256375,0.0005389103,0.00016501614,0.0002549376,0.000005521194],"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.000051056522,0.0015188633,0.00049150176,0.00021737206,0.00038855104,0.0000015297625,0.007986752,0.012672822,0.03238732,0.23871309,0.0017818995,0.70378923],"study_design_scores_gemma":[0.00029700465,0.0011073117,0.00009601748,0.0001165521,0.000016851509,0.000019820864,0.00030173562,0.96879697,0.018220326,0.0084954705,0.0022377963,0.00029412837],"about_ca_topic_score_codex":0.00008713784,"about_ca_topic_score_gemma":0.00014963064,"teacher_disagreement_score":0.9561242,"about_ca_system_score_codex":0.00008866706,"about_ca_system_score_gemma":0.0001595615,"threshold_uncertainty_score":0.9999341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25878996,0.004055754,0.7355841,0.00028316214,0.00021393869,0.00037997618,0.00016241358,0.00012913466,0.00040155527],"genre_scores_gemma":[0.99361366,0.0012491074,0.004964826,0.000015360156,0.0000065366157,0.0001038683,0.000014640459,0.000018329545,0.0000136630515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987753,0.000059547245,0.0004481694,0.000268205,0.00019822721,0.00025056564],"domain_scores_gemma":[0.9989807,0.0003178845,0.000025625748,0.00053177075,0.000092055954,0.00005198194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036273626,0.00018137271,0.00036908616,0.0006302482,0.00022320233,0.00010584567,0.00058563595,0.00007445204,0.000022809487],"category_scores_gemma":[4.6196385e-7,0.00017370473,0.00020906565,0.0017186054,0.00036520543,0.0003883934,0.0000075051607,0.00019657552,9.089045e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037479942,0.002054171,0.00033254828,0.0014682269,0.022678217,0.0000013019899,0.033258807,0.26521066,0.14019299,0.3597735,0.00012488106,0.17452991],"study_design_scores_gemma":[0.0013985262,0.0028205109,0.0006210843,0.00040636983,0.0019397517,0.000014169223,0.0013779073,0.8809528,0.10042763,0.00076241617,0.00844763,0.0008312024],"about_ca_topic_score_codex":0.000060960283,"about_ca_topic_score_gemma":0.00048348043,"teacher_disagreement_score":0.7348237,"about_ca_system_score_codex":0.00006400734,"about_ca_system_score_gemma":0.00008274764,"threshold_uncertainty_score":0.7083473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077362075,0.0010812827,0.9138156,0.0031528505,0.00018049848,0.00043762065,0.000024979767,0.00009917009,0.003845936],"genre_scores_gemma":[0.9610986,0.0008324278,0.037509646,0.00031172886,0.000007738248,0.000046926354,0.000003400969,0.000005613379,0.00018392375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983977,0.00014401122,0.00037465512,0.00045295543,0.00032843024,0.0003022446],"domain_scores_gemma":[0.99771667,0.000659325,0.00017276245,0.0012244197,0.00016189094,0.00006495621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032993802,0.00020354903,0.0003009247,0.00034073598,0.000850136,0.00018815238,0.0017494231,0.000053511016,0.000005980824],"category_scores_gemma":[0.0000054067323,0.00014388177,0.00010564847,0.0012791668,0.0007090197,0.0006189707,0.00010178348,0.00029604492,0.0000036482204],"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.00027947957,0.005539852,0.00060985744,0.0001529922,0.00048530052,0.0000012480988,0.0012186458,0.020649211,0.0017458738,0.44045117,0.00040553042,0.5284608],"study_design_scores_gemma":[0.003620703,0.018715331,0.0037391232,0.0013289589,0.00021299315,0.000041533553,0.00061575137,0.8638004,0.032157004,0.019692376,0.0546617,0.0014141185],"about_ca_topic_score_codex":0.0001511501,"about_ca_topic_score_gemma":0.00033846634,"teacher_disagreement_score":0.88373655,"about_ca_system_score_codex":0.00007798367,"about_ca_system_score_gemma":0.00032658965,"threshold_uncertainty_score":0.65386444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24018422,0.0013689373,0.7574269,0.0005157371,0.00004592627,0.0001770123,0.000013301229,0.000009687056,0.00025828317],"genre_scores_gemma":[0.9759703,0.0012237612,0.02257372,0.0001173298,0.000006852868,0.000033163786,0.000017719858,0.0000050172957,0.000052134765],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990915,0.00009602369,0.000259439,0.00025792915,0.00014140182,0.00015369304],"domain_scores_gemma":[0.999153,0.000053032403,0.00016528451,0.0004954667,0.00010027693,0.00003292291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002200084,0.000109800014,0.00012482173,0.00014211072,0.00031750594,0.00003788327,0.0004288339,0.000060409166,0.0000073377428],"category_scores_gemma":[0.0000023398907,0.000099558514,0.000043373595,0.00042594183,0.0004082138,0.000026001167,0.000025610996,0.000111352274,3.6477155e-7],"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.00016951046,0.00051868806,0.0011598098,0.0000684199,0.00017948644,1.7129676e-7,0.0006676517,0.041217517,0.87238187,0.008918405,0.00005579828,0.07466269],"study_design_scores_gemma":[0.0020521653,0.0044948882,0.0015449125,0.00069100416,0.00014686058,0.000019948864,0.0024114375,0.16790661,0.81552595,0.00046627576,0.004108348,0.00063160824],"about_ca_topic_score_codex":0.00003290832,"about_ca_topic_score_gemma":0.00006423158,"teacher_disagreement_score":0.7357861,"about_ca_system_score_codex":0.000025009189,"about_ca_system_score_gemma":0.0002619933,"threshold_uncertainty_score":0.40598783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017843739,0.0010736102,0.9942646,0.0014400667,0.00008008861,0.0010660274,0.00014503575,0.00007593145,0.000070238486],"genre_scores_gemma":[0.48807332,0.00060167635,0.5109879,0.00010359803,0.0000029624164,0.00019005917,0.00001626359,0.0000042622337,0.000019971674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986973,0.00008189661,0.00045640933,0.0003601891,0.00017687683,0.0002273315],"domain_scores_gemma":[0.99786294,0.00066319,0.00027442127,0.00092354213,0.00024097408,0.000034930355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042224815,0.0001432219,0.00024836414,0.00031135167,0.0006699914,0.00010269163,0.0018225862,0.000043298973,0.0000023661858],"category_scores_gemma":[0.000004717222,0.00013107811,0.0000970267,0.0005127146,0.00036688076,0.0005650011,0.00012275529,0.00009893257,1.1168792e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055500284,0.0005811389,0.00006708937,0.0001686823,0.00007141633,3.1627707e-8,0.00026269062,0.00058205833,0.022658572,0.2396463,0.000556683,0.73534983],"study_design_scores_gemma":[0.0017506345,0.0024943638,0.00023993404,0.00042621835,0.00005832261,0.000003167953,0.00033760103,0.2616259,0.6778951,0.041674707,0.013166408,0.00032759662],"about_ca_topic_score_codex":0.000022222108,"about_ca_topic_score_gemma":0.000024255165,"teacher_disagreement_score":0.73502225,"about_ca_system_score_codex":0.000045136683,"about_ca_system_score_gemma":0.00018403606,"threshold_uncertainty_score":0.534521},"labels":[],"label_agreement":null}]}