{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"5a0287ba8628","filters":{"venue":"Journal of Electronics (China)"}},"results":[{"id":"W2027348201","doi":"10.1007/s11767-010-0315-9","title":"Joint iterative decoding for simple-encoding systematic irregular-LDPC-based coded cooperation in non-ideal relay channel","year":2010,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Low-density parity-check code; Relay; Decoding methods; Relay channel; Computer science; Ideal (ethics); Joint (building); Encoding (memory); Theoretical computer science; Channel (broadcasting); Algorithm; Code (set theory); Simple (philosophy); Tanner graph; Topology (electrical circuits); Mathematics; Telecommunications; Error floor; Artificial intelligence; Combinatorics","authors":[{"name":"Jingwen Chen","is_ca":false},{"name":"Fengfan Yang","is_ca":false},{"name":"Lin Luo","is_ca":false},{"name":"Tho Le‐Ngoc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02070989556513358,"gpt":0.2797964660922415,"spread":0.2590865705271079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291764,0.0007702454,0.0008243938,0.0005537141,0.0006884785,0.0009376697,0.0007277473,0.0009285489,0.0009433558],"category_scores_gemma":[0.003069498,0.0003248655,0.0005400921,0.0008122892,0.001020233,0.0007426052,0.00130856,0.0005291432,0.0002876754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007328459,"about_ca_system_score_gemma":0.002733812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003122198,"about_ca_topic_score_gemma":0.00596991,"domain_scores_codex":[0.999114,0.0003232927,0.00005873184,0.0001057967,0.0002416208,0.0001565663],"domain_scores_gemma":[0.99813,0.000971024,0.0001597016,0.0002962628,0.0003814173,0.00006151047],"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.000799436,0.0001078498,0.0033273,0.0003791174,0.0002020545,0.0006691728,0.0009885632,0.7657329,0.0446297,0.1237829,0.001539669,0.05784141],"study_design_scores_gemma":[0.00002748891,0.00006695632,0.0003915536,0.00002275534,0.00003944645,0.000158773,0.00004006416,0.9746523,0.009624009,0.01447972,0.0004697341,0.00002732998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913459,0.0003747184,0.7989174,0.0002913348,0.00004969605,0.0001110916,0.0002595972,0.0003306551,0.008319622],"genre_scores_gemma":[0.8918551,0.000201336,0.1049397,0.00005580841,0.00001504121,0.00008753943,0.000174884,0.0000335368,0.002637118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003122198,"threshold_uncertainty_score":0.006831586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007409848","doi":"10.1007/bf02687975","title":"A matched filter bank based DOA estimation for asynchronous multipath CDMA channels","year":2005,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multipath propagation; Computer science; Code division multiple access; Asynchronous communication; Algorithm; Direction of arrival; Telecommunications link; Matched filter; Antenna array; Antenna (radio); Filter (signal processing); Base station; Electronic engineering; Real-time computing; Telecommunications; Engineering; Channel (broadcasting)","authors":[{"name":"Wei Yang","is_ca":false},{"name":"Junshi Chen","is_ca":false},{"name":"Zhenhui Tan","is_ca":false},{"name":"Takis Mathiopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01116012219285591,"gpt":0.271751095949009,"spread":0.2605909737561531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820315,0.0005660165,0.0006393261,0.0007852094,0.0004440818,0.0006821065,0.0006111853,0.000880352,0.002104608],"category_scores_gemma":[0.001937169,0.0004818717,0.0004379842,0.0006902684,0.0002289489,0.0006670748,0.0005358913,0.0005165822,0.001324481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002590471,"about_ca_system_score_gemma":0.0008251282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002431917,"about_ca_topic_score_gemma":0.004365026,"domain_scores_codex":[0.9995925,0.00009144065,0.00002755717,0.000081146,0.0001671278,0.00004020495],"domain_scores_gemma":[0.9994449,0.0002383486,0.00004713287,0.00005929267,0.0001853694,0.00002490326],"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.0009785688,0.0001705118,0.002365245,0.0001980164,0.0002017608,0.0002112398,0.00009171196,0.07115228,0.1687794,0.005928345,0.002618349,0.7473046],"study_design_scores_gemma":[0.000116085,0.0002241863,0.002619816,0.00002774057,0.0001540143,0.0003047599,0.0000262577,0.9337494,0.05617587,0.001507809,0.005040539,0.0000534082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01318222,0.000271496,0.9850317,0.00006131992,0.00009139544,0.00002273429,0.00006058795,0.0004752495,0.0008032815],"genre_scores_gemma":[0.2447795,0.0005921978,0.748483,0.0001493414,0.000194306,0.0001269209,0.0003552101,0.00006284755,0.005256641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002431917,"threshold_uncertainty_score":0.00704062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974992414","doi":"10.1007/s11767-004-0013-6","title":"An improved DOA estimation algorithm for asynchronous multipath CDMA system","year":2006,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Multipath propagation; Computer science; Code division multiple access; Asynchronous communication; Algorithm; Matched filter; Decorrelation; Multiuser detection; Interference (communication); Key (lock); SIGNAL (programming language); Filter (signal processing); Real-time computing; Telecommunications","authors":[{"name":"Wei Yang","is_ca":false},{"name":"Junshi Chen","is_ca":false},{"name":"Zhenhui Tan","is_ca":false},{"name":"Takis Mathiopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008034165639084493,"gpt":0.2743162391622406,"spread":0.2662820735231561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539343,0.0008797295,0.0008113732,0.0006582515,0.0005904602,0.0007480718,0.0009052908,0.0008362856,0.002113682],"category_scores_gemma":[0.001844652,0.0004438675,0.0004745484,0.000880087,0.000242983,0.0008645069,0.0006720818,0.0009380195,0.001021056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003318014,"about_ca_system_score_gemma":0.0009314256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003550979,"about_ca_topic_score_gemma":0.004396071,"domain_scores_codex":[0.9994698,0.0001083208,0.00003770173,0.0001168258,0.00021846,0.00004885],"domain_scores_gemma":[0.9993646,0.0002025494,0.00004233278,0.00007779881,0.0002885209,0.00002428298],"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.0004651406,0.00008379755,0.001430562,0.0001686285,0.0001338194,0.0001249859,0.0001572991,0.14525,0.05465903,0.007941257,0.002782348,0.7868031],"study_design_scores_gemma":[0.00008822958,0.000114901,0.0009381234,0.00001615774,0.00007017598,0.0002503248,0.00002194284,0.9811477,0.010368,0.002069746,0.004875652,0.00003890227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006089641,0.0002221811,0.992645,0.00004600037,0.00007270965,0.00001919216,0.00002661823,0.0002656924,0.0006128407],"genre_scores_gemma":[0.119035,0.0003814143,0.8762396,0.00009451521,0.0001548414,0.0001161949,0.0002086077,0.00006401211,0.003705857],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003550979,"threshold_uncertainty_score":0.007070959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080262227","doi":"10.1007/s11767-005-0200-0","title":"Relay assisted transmission with Bit-Interleaved Coded Modulation","year":2006,"lang":"en","type":"article","venue":"Journal of Electronics (China)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Computer science; Transmission (telecommunications); Spectral efficiency; Bit error rate; Link adaptation; Node (physics); Modulation (music); Electronic engineering; Computer network; Channel (broadcasting); Telecommunications; Fading; Power (physics); Physics","authors":[{"name":"Qingmin Meng","is_ca":false},{"name":"Xiaohu You","is_ca":false},{"name":"John Boyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01185069061669808,"gpt":0.2412738992750493,"spread":0.2294232086583513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008643809,0.0009395119,0.0009351595,0.0005458198,0.0005400013,0.0008683524,0.0007302301,0.001211611,0.002900119],"category_scores_gemma":[0.001859373,0.0002882358,0.0003866974,0.000933997,0.0004332268,0.0009703282,0.001136676,0.00072961,0.0007828336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000422131,"about_ca_system_score_gemma":0.0006380241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006069228,"about_ca_topic_score_gemma":0.0014584,"domain_scores_codex":[0.9995291,0.0001488808,0.00003687699,0.00006098529,0.0001502247,0.00007394938],"domain_scores_gemma":[0.9988616,0.0004619309,0.000127092,0.0002505076,0.0002670113,0.00003206314],"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.002330169,0.0002960311,0.002256136,0.0008681517,0.0002954135,0.00215144,0.001060997,0.1447998,0.4131216,0.1152812,0.005657372,0.3118818],"study_design_scores_gemma":[0.0001422737,0.0008126103,0.001133635,0.0001132833,0.0002582815,0.001998295,0.00009491574,0.8157808,0.1482175,0.02247231,0.008818425,0.0001577601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.156737,0.001656055,0.8162735,0.0006846896,0.0003409394,0.0002002184,0.0004875132,0.001310432,0.0223096],"genre_scores_gemma":[0.8583728,0.0007100043,0.130042,0.0002077188,0.00009610504,0.0001273413,0.0002328466,0.00004262232,0.01016856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002900119,"threshold_uncertainty_score":0.009701908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}