{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7aea874970ff","filters":{"venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shigeru Yamashita","is_ca":false},{"name":"Shin-ich Minato","is_ca":false},{"name":"David M. Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06111529080233419,"gpt":0.3198370838812472,"spread":0.258721793078913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937161,0.0001837159,0.0002492693,0.0003114617,0.001136477,0.0001054582,0.001196557,0.00008494646,0.000001853213],"category_scores_gemma":[0.00001314205,0.0001647652,0.00009179643,0.0008596751,0.0005002436,0.0003503223,0.00005214247,0.0002531661,4.589316e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005608337,"about_ca_system_score_gemma":0.0003225105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003110826,"about_ca_topic_score_gemma":0.00001250449,"domain_scores_codex":[0.9981147,0.0002408548,0.0004697677,0.0004818749,0.0003954019,0.0002974133],"domain_scores_gemma":[0.9972999,0.00108,0.0003026934,0.00102817,0.0001930109,0.00009621534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005443016,0.001582778,0.00002904644,0.00002675443,0.00006533526,5.391851e-7,0.001526547,0.5453278,0.004660364,0.1453898,0.00002819601,0.3013084],"study_design_scores_gemma":[0.0003794431,0.002281482,0.0007700729,0.00004362096,0.00001828392,0.00005757508,0.00006086365,0.9862065,0.003318436,0.006585723,0.0001086556,0.0001693853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1779186,0.0004525035,0.8204423,0.0005973865,0.0001355637,0.0003763828,0.00001535215,0.00005509822,0.000006839563],"genre_scores_gemma":[0.6603462,0.0005234714,0.3390382,0.00005232691,0.00001040122,0.00001819175,0.000004031559,0.000006071942,0.000001125819],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4824275,"threshold_uncertainty_score":0.8740973,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Seok-Yong Jin","is_ca":false},{"name":"Hong‐Yeop Song","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02668394795450807,"gpt":0.2466649742358578,"spread":0.2199810262813497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731711,0.0001404875,0.0001462442,0.0001441396,0.0005269581,0.00008461028,0.0004155514,0.00004538518,0.000007737691],"category_scores_gemma":[8.977893e-7,0.0001210679,0.00002892961,0.0003493501,0.0006652377,0.0002367966,0.0000144705,0.0003178061,0.000001290653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000173577,"about_ca_system_score_gemma":0.00003519849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004451977,"about_ca_topic_score_gemma":0.0004474341,"domain_scores_codex":[0.999207,0.00006408275,0.0002035906,0.0001903868,0.0001419259,0.000193036],"domain_scores_gemma":[0.9991658,0.000225496,0.00005981194,0.000452565,0.00003263791,0.00006366361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009343016,0.0009936027,0.009593721,0.000236702,0.0003856676,0.000002248505,0.005204774,0.0747528,0.1605276,0.2173979,0.00002568643,0.5307859],"study_design_scores_gemma":[0.0008198009,0.001571175,0.01039323,0.0002020993,0.00006777862,0.0001233242,0.0007838984,0.9759326,0.005346474,0.00363285,0.0005843362,0.0005424589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8638269,0.0008190207,0.134338,0.0001899186,0.0001117417,0.0001835415,0.0000179264,0.00009130974,0.0004215938],"genre_scores_gemma":[0.9882143,0.0008274254,0.01086062,0.00003001672,0.000006011215,0.00003258225,0.000004051166,0.000008660249,0.00001637684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9011798,"threshold_uncertainty_score":0.4937007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Rafael Dowsley","is_ca":false},{"name":"Jeroen van de Graaf","is_ca":false},{"name":"Jörn Müller‐Quade","is_ca":false},{"name":"Anderson C. A. Nascimento","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03781384633451661,"gpt":0.2701927737982126,"spread":0.232378927463696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001072337,0.0001718439,0.000150373,0.0002663966,0.001488746,0.0002081467,0.002100876,0.00004670835,0.00003176921],"category_scores_gemma":[0.000002883922,0.0001289184,0.0001373798,0.0009547875,0.0006245453,0.0004729893,0.00004221055,0.0003128809,0.0000104798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003463574,"about_ca_system_score_gemma":0.00008178945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001321546,"about_ca_topic_score_gemma":0.00002373671,"domain_scores_codex":[0.9984335,0.0003195821,0.0002657201,0.0002669814,0.0003256442,0.0003885599],"domain_scores_gemma":[0.9973826,0.001101761,0.00006666614,0.001302589,0.0000505689,0.00009576624],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000117568,0.001111403,0.0001925917,0.000007327149,0.00004417671,7.902471e-8,0.0007922369,0.001756803,0.0003996422,0.9050095,0.0000564462,0.09061801],"study_design_scores_gemma":[0.001282359,0.005408505,0.004225684,0.0002732933,0.000141872,0.00004498481,0.0005663501,0.9223138,0.01234123,0.02287739,0.02935395,0.00117056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02833394,0.001206247,0.9621323,0.006207138,0.0001572733,0.0002470863,0.00001025682,0.00009832148,0.001607469],"genre_scores_gemma":[0.9776132,0.0005678865,0.02045964,0.001265008,0.00001341904,0.00005985493,0.000001383065,0.000006295067,0.0000133398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9492792,"threshold_uncertainty_score":0.9998112,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Oussama Derbel","is_ca":true},{"name":"René Landry","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02515472431585348,"gpt":0.3270806392184414,"spread":0.301925914902588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002501036,0.00008369468,0.0001455036,0.0001560489,0.0007352814,0.00004471368,0.0005910689,0.00005664229,0.00001164249],"category_scores_gemma":[0.000002879374,0.00008854609,0.00003756984,0.0001216797,0.0009573365,0.0002638333,0.00003464735,0.000265144,5.73247e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005091526,"about_ca_system_score_gemma":0.0000559131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007189132,"about_ca_topic_score_gemma":0.001022839,"domain_scores_codex":[0.9993495,0.00003431957,0.000253585,0.0001268425,0.00007758735,0.0001581091],"domain_scores_gemma":[0.9990137,0.000197317,0.00006340317,0.0006652453,0.00003209081,0.00002820712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007955297,0.002727516,0.01900546,0.0001033404,0.0001371475,0.00002513267,0.002033297,0.02315925,0.0079862,0.2182924,0.00001143445,0.7265109],"study_design_scores_gemma":[0.000677791,0.0008692886,0.05922902,0.0001405314,0.00009860102,0.0002094886,0.0009227001,0.9270222,0.006624647,0.003691846,0.0001403798,0.0003734712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8495773,0.0003970401,0.1482842,0.0008487141,0.00005939795,0.0001490992,0.00001272326,0.00004716228,0.0006243754],"genre_scores_gemma":[0.9760657,0.0006911165,0.02318951,0.000008947246,0.000002076112,0.0000336528,9.169871e-7,0.000004718366,0.000003367869],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.903863,"threshold_uncertainty_score":0.5655264,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hamed Narimani","is_ca":false},{"name":"Mohammadali Khosravifard","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05801735668246414,"gpt":0.2914103260384139,"spread":0.2333929693559498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005095561,0.0001509966,0.0002144383,0.00008169996,0.0009618742,0.0001248668,0.002651549,0.00005082794,0.00001054779],"category_scores_gemma":[0.000003264524,0.0001141275,0.0001253387,0.0004324591,0.0008250573,0.0004914166,0.0002038856,0.0001712459,7.707972e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002702772,"about_ca_system_score_gemma":0.0001598235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002075115,"about_ca_topic_score_gemma":0.0001266445,"domain_scores_codex":[0.9985925,0.0001310705,0.0004069049,0.0003450456,0.0002557308,0.0002687641],"domain_scores_gemma":[0.9978619,0.000264825,0.0002866616,0.001419121,0.0001063615,0.00006113802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002087033,0.006258046,0.001914815,0.0002251716,0.000577076,7.151203e-7,0.01959892,0.01003439,0.005772056,0.3269616,0.0005285391,0.6279199],"study_design_scores_gemma":[0.0007172805,0.001746797,0.002760025,0.0001410819,0.00005389768,0.00001733507,0.0001284244,0.9532101,0.01915731,0.008133351,0.0135933,0.0003411597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07615018,0.001401834,0.920642,0.0008162177,0.0001152336,0.0004064137,0.00006936509,0.0000372676,0.0003614613],"genre_scores_gemma":[0.7775182,0.0008227276,0.2214234,0.0001531561,0.000005081411,0.00003766546,0.000002948623,0.000005286617,0.00003153652],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9431757,"threshold_uncertainty_score":0.7398056,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Duy H. N. Nguyen","is_ca":true},{"name":"Ha H. Nguyen","is_ca":true},{"name":"T. D. HOANG","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02024493491488433,"gpt":0.2492716245404248,"spread":0.2290266896255405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002318436,0.0001740658,0.0002275496,0.0002265451,0.0008194507,0.00004734,0.0009857051,0.00005600167,0.00001741407],"category_scores_gemma":[0.000001989688,0.0001824675,0.00005971998,0.0005100492,0.0006963622,0.0003423625,0.00004533324,0.0002893668,0.000008708213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007457234,"about_ca_system_score_gemma":0.00004990451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001893945,"about_ca_topic_score_gemma":0.00001660998,"domain_scores_codex":[0.9989828,0.00008289581,0.0003212344,0.0001962135,0.0001632906,0.0002535388],"domain_scores_gemma":[0.9985656,0.0003026771,0.00008861964,0.0009204486,0.00006198584,0.00006071895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006278277,0.002037068,0.0002790076,0.0001997918,0.0007092483,0.000003156198,0.003034298,0.3179656,0.1921706,0.18948,0.0009558877,0.2931026],"study_design_scores_gemma":[0.0006551614,0.0009715353,0.0002902918,0.0001993411,0.00004409709,0.0000721191,0.0001477146,0.758773,0.2237674,0.002406134,0.0119443,0.0007288865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3288603,0.005429985,0.6623494,0.001044465,0.00008805561,0.0003798228,0.00002906101,0.0007273134,0.001091571],"genre_scores_gemma":[0.8734117,0.01867766,0.1077487,0.00005745061,0.000006476853,0.00004023031,0.00000486245,0.00001556328,0.0000373716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5546008,"threshold_uncertainty_score":0.744081,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ubolthip Sethakaset","is_ca":true},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01635584881200387,"gpt":0.253879390255443,"spread":0.2375235414434392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002116247,0.0002110153,0.0002520101,0.0002813315,0.0008022815,0.0001562968,0.001499487,0.0001312353,0.0000132679],"category_scores_gemma":[0.000002517546,0.000218874,0.000108001,0.0003872835,0.0009356195,0.0003281296,0.00008713948,0.0003270927,0.000003406504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001356569,"about_ca_system_score_gemma":0.00003996115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004336745,"about_ca_topic_score_gemma":0.0002328308,"domain_scores_codex":[0.9986529,0.00007411562,0.0004949875,0.0002445122,0.0002185777,0.0003149596],"domain_scores_gemma":[0.9977096,0.0005982746,0.0001095028,0.001436616,0.00009648776,0.00004952214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005251528,0.00161191,0.0003397402,0.0001425939,0.0002213295,1.332992e-7,0.0002314974,0.02255119,0.04612086,0.3630722,0.0001246288,0.5655314],"study_design_scores_gemma":[0.0005395203,0.0004695805,0.001687404,0.00006474875,0.00004408269,0.000003978438,0.00008149225,0.9686966,0.02247109,0.004693158,0.0009486197,0.0002997062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3015958,0.002006283,0.6935951,0.001376641,0.0001130363,0.0005400805,0.00005917657,0.0003653979,0.0003484966],"genre_scores_gemma":[0.939488,0.001935216,0.05824395,0.00002792095,0.0000136254,0.0002028865,0.00005649246,0.00002175942,0.00001013924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9461454,"threshold_uncertainty_score":0.8925424,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Takahiro OTA","is_ca":false},{"name":"Hiroyoshi Morita","is_ca":false},{"name":"Akiko Manada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0477770078403256,"gpt":0.286274005145385,"spread":0.2384969973050594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002566896,0.0001693483,0.000217561,0.0001081288,0.00106552,0.0002944687,0.001566133,0.00005275683,0.00001160406],"category_scores_gemma":[0.00000293064,0.0001584389,0.00005770815,0.0006476236,0.0002489369,0.0009831177,0.0001473346,0.0002278177,0.000001943073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425963,"about_ca_system_score_gemma":0.00009973909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000940892,"about_ca_topic_score_gemma":0.00001369235,"domain_scores_codex":[0.9984739,0.0001371627,0.0003859961,0.0004211616,0.0003113884,0.000270384],"domain_scores_gemma":[0.9987699,0.0001808609,0.0002187446,0.0006344739,0.00008035915,0.000115702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005061394,0.001380053,0.0006832033,0.00008615656,0.0001730208,0.00000137318,0.002847458,0.01851227,0.1791631,0.04349851,0.0005588082,0.7530455],"study_design_scores_gemma":[0.0003277717,0.000492933,0.00004496006,0.00006389535,0.00001504714,0.000006322232,0.00008263379,0.9796969,0.01504694,0.000276889,0.003753308,0.0001923585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02981483,0.003524005,0.9649289,0.001252551,0.00007683037,0.0001945026,0.00003522996,0.00008275765,0.0000904434],"genre_scores_gemma":[0.8485987,0.001474861,0.1495841,0.0002901115,0.00001324545,0.000009738463,0.00001720284,0.000006555583,0.000005449713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9611847,"threshold_uncertainty_score":0.8195226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Naoya Onizawa","is_ca":true},{"name":"Atsushi Matsumoto","is_ca":false},{"name":"Takahiro Hanyu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04264054113096736,"gpt":0.2777829896792453,"spread":0.2351424485482779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001006939,0.0002708783,0.0003001744,0.0003696198,0.001164085,0.0003349638,0.001684003,0.00009959124,0.0000179924],"category_scores_gemma":[0.000008674678,0.0002454216,0.0001639255,0.0007106653,0.0003447561,0.0005942809,0.00004886765,0.0004255236,0.00001816738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001573818,"about_ca_system_score_gemma":0.0001081306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004689649,"about_ca_topic_score_gemma":0.00008380855,"domain_scores_codex":[0.9976386,0.0003647568,0.0005077724,0.0004554877,0.0004679567,0.0005653658],"domain_scores_gemma":[0.996874,0.001318002,0.0002516605,0.001288926,0.0001060284,0.0001613661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002155949,0.009975486,0.004546087,0.0001398532,0.0003781205,0.000003063894,0.004653032,0.2704168,0.003988078,0.1744099,0.0002056627,0.5310684],"study_design_scores_gemma":[0.0006807125,0.003207226,0.000817474,0.0002397672,0.00002283602,0.00002019755,0.00009135311,0.9890634,0.003859127,0.0002025085,0.001415458,0.0003799808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05522127,0.001155853,0.9397817,0.001686616,0.0005582648,0.0003886422,0.000009619068,0.0001356092,0.001062474],"genre_scores_gemma":[0.9677078,0.0001440922,0.03110234,0.0008712985,0.00008332689,0.00005144239,0.000004037267,0.00001375131,0.00002196188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9124865,"threshold_uncertainty_score":0.9999998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Computer science","authors":[{"name":"Y. Xin","is_ca":true},{"name":"I.J. Fair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02325880718798054,"gpt":0.2602964053219415,"spread":0.237037598133961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876993,0.0001365629,0.0001484216,0.0001791188,0.0005237946,0.00007946672,0.0006233569,0.00003283481,0.00003465534],"category_scores_gemma":[4.741996e-7,0.0001389939,0.00005481132,0.0003806927,0.0005448028,0.0002583606,0.00001829784,0.0001710361,0.000005294037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006883534,"about_ca_system_score_gemma":0.000036593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002358729,"about_ca_topic_score_gemma":0.0005303721,"domain_scores_codex":[0.9990338,0.00005101332,0.0003077262,0.0001801,0.0001872673,0.0002400631],"domain_scores_gemma":[0.9992368,0.0001955519,0.00005780122,0.0004437385,0.00002596342,0.0000401298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000392496,0.001982175,0.005098988,0.0001846948,0.0004759671,0.00000148725,0.001711763,0.5701048,0.02523837,0.1095392,0.001808287,0.2838151],"study_design_scores_gemma":[0.001386457,0.001401597,0.00559665,0.0001538028,0.00009371187,0.00006079745,0.0008541594,0.8938575,0.04070317,0.01170626,0.04323274,0.0009531049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5347845,0.008904192,0.4473412,0.002088214,0.0004982946,0.0005239475,0.0001159903,0.0004509698,0.005292717],"genre_scores_gemma":[0.9726786,0.001260699,0.02592106,0.00005267816,0.00001864786,0.00003154685,0.00001211344,0.000009230694,0.00001540455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4378941,"threshold_uncertainty_score":0.5668007,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sha Li","is_ca":true},{"name":"Brian L. F. Daku","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01792164438114018,"gpt":0.282680729930886,"spread":0.2647590855497458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003378203,0.0001827835,0.0001913152,0.0002434189,0.001529121,0.0004848876,0.001609155,0.00007274566,0.000007348428],"category_scores_gemma":[0.000006063723,0.0001681854,0.0000904283,0.0005924851,0.0005341638,0.000554835,0.00005276603,0.0003019362,0.000003400532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008648,"about_ca_system_score_gemma":0.0002015049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002900927,"about_ca_topic_score_gemma":0.0001294723,"domain_scores_codex":[0.9985527,0.00006491753,0.0003157448,0.0004331224,0.0002762562,0.0003572393],"domain_scores_gemma":[0.9983678,0.0003088675,0.0002031796,0.0008966852,0.0001199329,0.0001035644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002648194,0.0008632302,0.0001002489,0.0000311127,0.00006165817,2.718647e-7,0.0009863777,0.006583732,0.01530019,0.07902584,0.0001529761,0.8968679],"study_design_scores_gemma":[0.0008685944,0.002261433,0.0002331095,0.00009385296,0.00003469465,0.00002854196,0.0001547834,0.8415706,0.1229184,0.01007726,0.02126851,0.0004902568],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04853783,0.0002990263,0.9467718,0.003482255,0.0002048196,0.0002801254,0.000009448177,0.00008011744,0.0003345751],"genre_scores_gemma":[0.7870926,0.0002970211,0.2115955,0.0008354991,0.00003072631,0.00005852103,0.000005491794,0.000009283496,0.00007536412],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8963776,"threshold_uncertainty_score":0.9997708,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Makoto Nagano","is_ca":true},{"name":"T Onodera","is_ca":false},{"name":"Michael Ekonde Sone","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07648959602892834,"gpt":0.301514885301017,"spread":0.2250252892720886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008900097,0.0001188882,0.0001685947,0.0001863695,0.000851659,0.00003209048,0.001824724,0.00005261608,0.00001200685],"category_scores_gemma":[0.000003750715,0.00009185658,0.00009582097,0.0007567143,0.0008641346,0.0003060196,0.00004097943,0.0001731405,0.000001829993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007655078,"about_ca_system_score_gemma":0.0001924992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008142076,"about_ca_topic_score_gemma":0.00006857442,"domain_scores_codex":[0.9982949,0.0002766632,0.0003572114,0.0002670091,0.0006046224,0.0001995185],"domain_scores_gemma":[0.9983619,0.0001125833,0.0001928602,0.001184897,0.0001155007,0.0000322829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006631832,0.00796435,0.009786393,0.00007042464,0.0009218632,0.000001283992,0.01452163,0.02508921,0.2864758,0.4647698,0.0004035298,0.1899294],"study_design_scores_gemma":[0.001085648,0.001279646,0.006629403,0.00009132778,0.00007603051,0.0001125617,0.0004894144,0.3418486,0.6450065,0.00223795,0.0008226607,0.0003202498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7808253,0.004631477,0.2105678,0.002353882,0.0002465294,0.0004773524,0.000004150351,0.00006151301,0.0008319829],"genre_scores_gemma":[0.9924928,0.0002995724,0.007058173,0.0000920378,0.000005501445,0.00003013841,5.137273e-7,0.000003576044,0.00001767823],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4625319,"threshold_uncertainty_score":0.6550359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ha H. Nguyen","is_ca":true},{"name":"Huy Vû","is_ca":false},{"name":"D.E. Dodds","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04808164298385981,"gpt":0.3126250239355172,"spread":0.2645433809516574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617454,0.0001837703,0.0002251328,0.0003461551,0.001102224,0.0006834198,0.004095062,0.00005957202,0.000002522798],"category_scores_gemma":[0.000002939852,0.0001595345,0.00005298461,0.001365243,0.0006550146,0.001363652,0.000216048,0.0003387373,0.000003976678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378051,"about_ca_system_score_gemma":0.0003095951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000299843,"about_ca_topic_score_gemma":0.0003554589,"domain_scores_codex":[0.9981086,0.0002059918,0.000379446,0.0004217982,0.00051809,0.0003661008],"domain_scores_gemma":[0.9971483,0.0004545136,0.0002084084,0.001888518,0.0001935771,0.0001067138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002817056,0.0009424554,0.000464992,0.00003395691,0.0001034411,6.927219e-7,0.000702388,0.6474811,0.0004684986,0.2045594,0.00001469894,0.1452001],"study_design_scores_gemma":[0.0008387206,0.001073703,0.001199561,0.00014416,0.00001078025,0.00003334877,0.00009450955,0.9925002,0.001195729,0.001869526,0.0007763172,0.0002634646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0320534,0.001848345,0.9625676,0.002537791,0.00006787798,0.0004334073,0.00000572086,0.0001147869,0.0003710263],"genre_scores_gemma":[0.908997,0.002184011,0.08859229,0.000097479,0.000008741633,0.00009291804,0.00000461002,0.000009317822,0.00001365155],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8769436,"threshold_uncertainty_score":0.8477529,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Qingping Yu","is_ca":false},{"name":"You ZHANG","is_ca":false},{"name":"Zhiping Shi","is_ca":false},{"name":"Xingwang Li","is_ca":false},{"name":"Longye WANG","is_ca":false},{"name":"Ming Zeng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06829875709549948,"gpt":0.3181294128443707,"spread":0.2498306557488713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001178925,0.000199898,0.0002702606,0.0005355058,0.001365987,0.0002763183,0.002081211,0.00006956233,0.000002364588],"category_scores_gemma":[0.00001558596,0.00020129,0.0001399932,0.001272781,0.0003725638,0.0005389103,0.0001650161,0.0002549376,0.000005521194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008866706,"about_ca_system_score_gemma":0.0001595615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008713784,"about_ca_topic_score_gemma":0.0001496306,"domain_scores_codex":[0.9982086,0.0001218616,0.0004308539,0.0004780925,0.0002942385,0.0004663859],"domain_scores_gemma":[0.9976266,0.0008408186,0.0002099289,0.001102366,0.0001331693,0.00008712547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005105652,0.001518863,0.0004915018,0.0002173721,0.000388551,0.000001529762,0.007986752,0.01267282,0.03238732,0.2387131,0.001781899,0.7037892],"study_design_scores_gemma":[0.0002970046,0.001107312,0.00009601748,0.0001165521,0.00001685151,0.00001982086,0.0003017356,0.968797,0.01822033,0.008495471,0.002237796,0.0002941284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03006025,0.0007518959,0.9651232,0.002780214,0.0001525794,0.0004067521,0.00001708974,0.0005743671,0.0001335882],"genre_scores_gemma":[0.7108943,0.001092379,0.2876224,0.0002089999,0.00001117385,0.0001050774,0.00000552022,0.00001204779,0.00004801044],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9561242,"threshold_uncertainty_score":0.9999341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Quang‐Thang Duong","is_ca":false},{"name":"Kohei MATSUKAWA","is_ca":true},{"name":"Quoc-Trinh Vo","is_ca":true},{"name":"Minoru Okada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03215553181399589,"gpt":0.2808548639521948,"spread":0.2486993321381989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003627363,0.0001813727,0.0003690862,0.0006302482,0.0002232023,0.0001058457,0.0005856359,0.00007445204,0.00002280949],"category_scores_gemma":[4.619639e-7,0.0001737047,0.0002090656,0.001718605,0.0003652054,0.0003883934,0.000007505161,0.0001965755,9.089045e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006400734,"about_ca_system_score_gemma":0.00008274764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006096028,"about_ca_topic_score_gemma":0.0004834804,"domain_scores_codex":[0.9987753,0.00005954724,0.0004481694,0.000268205,0.0001982272,0.0002505656],"domain_scores_gemma":[0.9989807,0.0003178845,0.00002562575,0.0005317708,0.00009205595,0.00005198194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003747994,0.002054171,0.0003325483,0.001468227,0.02267822,0.00000130199,0.03325881,0.2652107,0.140193,0.3597735,0.0001248811,0.1745299],"study_design_scores_gemma":[0.001398526,0.002820511,0.0006210843,0.0004063698,0.001939752,0.00001416922,0.001377907,0.8809528,0.1004276,0.0007624162,0.00844763,0.0008312024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.25879,0.004055754,0.7355841,0.0002831621,0.0002139387,0.0003799762,0.0001624136,0.0001291347,0.0004015553],"genre_scores_gemma":[0.9936137,0.001249107,0.004964826,0.00001536016,0.000006536616,0.0001038683,0.00001464046,0.00001832955,0.00001366305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7348237,"threshold_uncertainty_score":0.7083473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Microsemi (Canada)","funders":"","keywords":"Lossless compression; Lossy compression; Data compression; Data compression ratio; Image compression; Lossless JPEG; Compression (physics)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02990442814705944,"gpt":0.372366292713548,"spread":0.3424618645664885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004222482,0.0001432219,0.0002483641,0.0003113517,0.0006699914,0.0001026916,0.001822586,0.00004329897,0.000002366186],"category_scores_gemma":[0.000004717222,0.0001310781,0.0000970267,0.0005127146,0.0003668808,0.0005650011,0.0001227553,0.00009893257,1.116879e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004513668,"about_ca_system_score_gemma":0.0001840361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002222211,"about_ca_topic_score_gemma":0.00002425517,"domain_scores_codex":[0.9986973,0.00008189661,0.0004564093,0.0003601891,0.0001768768,0.0002273315],"domain_scores_gemma":[0.9978629,0.00066319,0.0002744213,0.0009235421,0.0002409741,0.00003493036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005550028,0.0005811389,0.00006708937,0.0001686823,0.00007141633,3.162771e-8,0.0002626906,0.0005820583,0.02265857,0.2396463,0.000556683,0.7353498],"study_design_scores_gemma":[0.001750635,0.002494364,0.000239934,0.0004262184,0.00005832261,0.000003167953,0.000337601,0.2616259,0.6778951,0.04167471,0.01316641,0.0003275966],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001784374,0.00107361,0.9942646,0.001440067,0.00008008861,0.001066027,0.0001450358,0.00007593145,0.00007023849],"genre_scores_gemma":[0.4880733,0.0006016764,0.5109879,0.000103598,0.000002962416,0.0001900592,0.00001626359,0.000004262234,0.00001997167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7350222,"threshold_uncertainty_score":0.534521,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.03486510300478918,"gpt":0.3009557263160226,"spread":0.2660906233112334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002200084,0.0001098,0.0001248217,0.0001421107,0.0003175059,0.00003788327,0.0004288339,0.00006040917,0.000007337743],"category_scores_gemma":[0.000002339891,0.00009955851,0.00004337359,0.0004259418,0.0004082138,0.00002600117,0.000025611,0.0001113523,3.647716e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002500919,"about_ca_system_score_gemma":0.0002619933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003290832,"about_ca_topic_score_gemma":0.00006423158,"domain_scores_codex":[0.9990915,0.00009602369,0.000259439,0.0002579291,0.0001414018,0.000153693],"domain_scores_gemma":[0.999153,0.0000530324,0.0001652845,0.0004954667,0.0001002769,0.00003292291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001695105,0.0005186881,0.00115981,0.0000684199,0.0001794864,1.712968e-7,0.0006676517,0.04121752,0.8723819,0.008918405,0.00005579828,0.07466269],"study_design_scores_gemma":[0.002052165,0.004494888,0.001544912,0.0006910042,0.0001468606,0.00001994886,0.002411437,0.1679066,0.8155259,0.0004662758,0.004108348,0.0006316082],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2401842,0.001368937,0.7574269,0.0005157371,0.00004592627,0.0001770123,0.00001330123,0.000009687056,0.0002582832],"genre_scores_gemma":[0.9759703,0.001223761,0.02257372,0.0001173298,0.000006852868,0.00003316379,0.00001771986,0.000005017296,0.00005213476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7357861,"threshold_uncertainty_score":0.4059878,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Continental (Canada)","funders":"","keywords":"Property (philosophy); Slide attack; Correlation attack; Cryptanalysis; Block cipher; Cryptography","authors":[{"name":"Hanbeom Shin","is_ca":false},{"name":"Sunyeop Kim","is_ca":false},{"name":"Byoungjin Seok","is_ca":false},{"name":"Dongjae Lee","is_ca":false},{"name":"Deukjo Hong","is_ca":false},{"name":"Jaechul Sung","is_ca":false},{"name":"Seokhie Hong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02984746150633862,"gpt":0.2789615889154914,"spread":0.2491141274091528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000329938,0.000203549,0.0003009247,0.000340736,0.000850136,0.0001881524,0.001749423,0.00005351102,0.000005980824],"category_scores_gemma":[0.000005406732,0.0001438818,0.0001056485,0.001279167,0.0007090197,0.0006189707,0.0001017835,0.0002960449,0.00000364822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007798367,"about_ca_system_score_gemma":0.0003265897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001511501,"about_ca_topic_score_gemma":0.0003384663,"domain_scores_codex":[0.9983977,0.0001440112,0.0003746551,0.0004529554,0.0003284302,0.0003022446],"domain_scores_gemma":[0.9977167,0.000659325,0.0001727624,0.00122442,0.0001618909,0.00006495621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002794796,0.005539852,0.0006098574,0.0001529922,0.0004853005,0.000001248099,0.001218646,0.02064921,0.001745874,0.4404512,0.0004055304,0.5284608],"study_design_scores_gemma":[0.003620703,0.01871533,0.003739123,0.001328959,0.0002129932,0.00004153355,0.0006157514,0.8638004,0.032157,0.01969238,0.0546617,0.001414118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07736208,0.001081283,0.9138156,0.003152851,0.0001804985,0.0004376206,0.00002497977,0.00009917009,0.003845936],"genre_scores_gemma":[0.9610986,0.0008324278,0.03750965,0.0003117289,0.000007738248,0.00004692635,0.000003400969,0.000005613379,0.0001839238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8837366,"threshold_uncertainty_score":0.6538644,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ulrich Speidel","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02969416751035482,"gpt":0.2712047324463481,"spread":0.2415105649359933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009615839,0.0001190358,0.0001471351,0.0001171659,0.0007755802,0.00008255242,0.001620904,0.00003427554,0.000008577883],"category_scores_gemma":[0.000004919735,0.00008747608,0.00009346976,0.0007412317,0.0006755723,0.0003789949,0.00006400302,0.0001997411,0.0000022313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002514661,"about_ca_system_score_gemma":0.00004895701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001674274,"about_ca_topic_score_gemma":0.00001474446,"domain_scores_codex":[0.998832,0.0002291194,0.000255912,0.0001793845,0.0002448282,0.0002586933],"domain_scores_gemma":[0.9977748,0.001021555,0.000154507,0.0009402207,0.00005596063,0.00005293782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007830358,0.0004179044,0.00008502334,0.000004724711,0.0000306498,1.382182e-8,0.0004209685,0.0002294386,0.0002374107,0.9430872,0.00002963235,0.05544924],"study_design_scores_gemma":[0.002267375,0.01490157,0.01259472,0.0008444432,0.0002939758,0.00009305184,0.002205603,0.5106616,0.1077052,0.3175501,0.02882978,0.002052703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1684072,0.001466796,0.8269905,0.002214088,0.0001088592,0.0001644023,0.00001879116,0.00004187608,0.0005874953],"genre_scores_gemma":[0.9899467,0.0008544413,0.008972088,0.000187704,0.000006978421,0.00002043672,0.000002598929,0.000003085448,0.000005931711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8215395,"threshold_uncertainty_score":0.5965214,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Rabia Yahya","is_ca":false},{"name":"Akira Nakamura","is_ca":false},{"name":"Makoto Itami","is_ca":false},{"name":"Tayeb A. Denidni","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06184639580598238,"gpt":0.2718689075146005,"spread":0.2100225117086181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978457,0.0001247518,0.0001988164,0.0002378611,0.0002725681,0.00003243344,0.0003345333,0.00003396595,0.000007640228],"category_scores_gemma":[0.000003167545,0.0000967142,0.00004776983,0.0004077706,0.0005217256,0.0001419757,0.000007397667,0.00007409303,4.403834e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008038513,"about_ca_system_score_gemma":0.00009310356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003035831,"about_ca_topic_score_gemma":0.00004193309,"domain_scores_codex":[0.9990127,0.00009726151,0.0003156737,0.0001689665,0.0002252912,0.0001800965],"domain_scores_gemma":[0.9991315,0.0002177133,0.00009925504,0.0003707592,0.0001287397,0.00005203133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003911902,0.0003507348,0.0004284237,0.00006593369,0.000296365,2.891827e-7,0.0003554002,0.008119452,0.928108,0.003000156,0.00001634439,0.05921978],"study_design_scores_gemma":[0.0004324051,0.0005215469,0.0001560246,0.0002376173,0.00008452639,0.000005262003,0.0001519052,0.9640634,0.03360213,0.0004472894,0.00009442101,0.0002034706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0202819,0.003156862,0.9760224,0.0003042733,0.00002354844,0.0001332544,0.00001305887,0.00003585655,0.00002884757],"genre_scores_gemma":[0.9586294,0.002740141,0.03857485,0.00003271668,0.0000030207,0.000008870958,7.952081e-7,0.000007381482,0.000002839425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9559439,"threshold_uncertainty_score":0.3943891,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Seth William Phillips","is_ca":true},{"name":"I.J. Fair","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05009516714382558,"gpt":0.3002343591426478,"spread":0.2501391919988222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008439719,0.0001566523,0.0002313289,0.000243339,0.0008554783,0.0001633656,0.0009395043,0.00004628772,0.00003669491],"category_scores_gemma":[0.000004573089,0.0001434348,0.00007977527,0.0003227586,0.0004237492,0.000226568,0.00005557014,0.00008380838,0.000007801895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002997066,"about_ca_system_score_gemma":0.00004377334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004678059,"about_ca_topic_score_gemma":0.0001074749,"domain_scores_codex":[0.9987008,0.0001366118,0.0003049177,0.000344355,0.0001804443,0.0003328557],"domain_scores_gemma":[0.9987665,0.0003332731,0.000136514,0.0006024994,0.00006613429,0.00009505037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008651894,0.0007179655,0.00007607904,0.00005825936,0.00003639858,3.364484e-7,0.0008759652,0.003615219,0.9401516,0.01710867,0.00008765325,0.03718527],"study_design_scores_gemma":[0.00270745,0.01785555,0.001225903,0.0005358346,0.0002242664,0.00008136151,0.0009991458,0.250323,0.6856369,0.01040298,0.02839392,0.001613657],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7480883,0.0006683871,0.2493526,0.001059174,0.0002184554,0.00032594,0.00006043034,0.00005549847,0.0001712058],"genre_scores_gemma":[0.9628575,0.0005975002,0.03598806,0.0003854906,0.00002965855,0.0001085601,0.000005237534,0.00001038401,0.00001765215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2545148,"threshold_uncertainty_score":0.6579733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}