{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"8cf6794991a0","filters":{"venue":"Journal of Circuits and Systems"}},"results":[{"id":"W2353462733","doi":"","title":"A feasible resource allocation scheme for multi-user OFDM systems with various services","year":2008,"lang":"en","type":"article","venue":"Journal of Circuits and Systems","topic":"Advanced Wireless Network Optimization","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":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Resource allocation; Orthogonal frequency-division multiplexing; Telecommunications link; Throughput; Fading; Quality of service; Resource management (computing); Transmission (telecommunications); Channel (broadcasting); Scheme (mathematics); Computer network; Distributed computing; Mathematical optimization; Algorithm; Wireless; Telecommunications; Mathematics","authors":[{"name":"Guangxin Yue","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02422511218098618,"gpt":0.2263060820917361,"spread":0.2020809699107499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266541,0.000142719,0.000329118,0.0001130386,0.0001081363,0.00006940831,0.0001000487,0.00008684658,5.173168e-7],"category_scores_gemma":[0.00000730017,0.0001132499,0.00003524852,0.0001458686,0.00001819458,0.0003233931,0.000005581475,0.0001158086,7.793909e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006812953,"about_ca_system_score_gemma":0.0000266903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001174858,"about_ca_topic_score_gemma":0.00000580111,"domain_scores_codex":[0.9990081,0.00002903333,0.0004544965,0.000104802,0.0002214534,0.000182101],"domain_scores_gemma":[0.9991658,0.00004981754,0.0002891227,0.0001198489,0.0002765106,0.00009884261],"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.00001952783,0.00002147081,0.00207051,0.0006867075,0.00009891557,0.00001432585,0.0006476184,0.9946256,0.0009170126,0.0003277208,0.0003128633,0.0002577678],"study_design_scores_gemma":[0.001740682,0.00016816,0.001000749,0.0008187398,0.00004123267,0.001250078,0.0006962595,0.9764889,0.00007894581,0.00000251899,0.01749261,0.0002211368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1570457,0.009028766,0.8325131,0.00001413735,0.0004990898,0.0005427057,0.000006441097,0.00007611688,0.0002738934],"genre_scores_gemma":[0.9966261,0.000332013,0.002138198,0.00001019809,0.0003763535,0.00002216689,0.000005478281,0.00004782351,0.0004416924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8395804,"threshold_uncertainty_score":0.4618199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2350013284","doi":"","title":"A novel DHT-based multiple keywords information search model in P2P networks","year":2008,"lang":"en","type":"article","venue":"Journal of Circuits and Systems","topic":"Peer-to-Peer Network Technologies","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":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Node (physics); Matching (statistics); Resource (disambiguation); Routing (electronic design automation); Search engine; Search algorithm; Peer-to-peer; Search problem; Information retrieval; Theoretical computer science; Distributed computing; Computer network; Algorithm; Mathematics","authors":[{"name":"Jinsheng Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04362841500874912,"gpt":0.2397400778559065,"spread":0.1961116628471574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009837226,0.0001216832,0.0003059434,0.0004960235,0.00009325007,0.0001750541,0.0006550064,0.0001207716,2.532026e-7],"category_scores_gemma":[0.000100058,0.0001003018,0.000052045,0.0005789714,0.00003675135,0.0009728937,0.00009931553,0.0003355416,0.000002541731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009567056,"about_ca_system_score_gemma":0.0001765004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000583205,"about_ca_topic_score_gemma":0.00001360005,"domain_scores_codex":[0.9983836,0.00004194012,0.0006439629,0.000120315,0.0005102131,0.0003000131],"domain_scores_gemma":[0.9989506,0.0001143921,0.0002616874,0.0002669152,0.0002822216,0.0001241715],"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.000008048693,0.00003923517,0.006182154,0.00002292184,0.00001021915,0.00002749781,0.0008716452,0.9740709,0.0002578414,0.001247078,0.001225195,0.01603726],"study_design_scores_gemma":[0.0007810324,0.0001207349,0.006377735,0.0001440837,0.000001808411,0.000354759,0.00007483299,0.9911875,0.00003709055,0.0000379412,0.0007657517,0.0001167532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1768246,0.0003337302,0.8217126,0.0004297242,0.0003087222,0.0001534088,0.000001722261,0.00004135547,0.0001941744],"genre_scores_gemma":[0.9948425,0.00003744924,0.004825332,0.0001822059,0.00007362338,0.000005850035,5.728392e-7,0.000005372988,0.00002712532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8180179,"threshold_uncertainty_score":0.409019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}