{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363935,0.0006948811,0.0007022393,0.000576382,0.0006975111,0.0009089369,0.001268043,0.0007545829,0.002168595],"category_scores_gemma":[0.002510452,0.000319647,0.0003965219,0.0006992729,0.0006484987,0.001288049,0.0008885662,0.0008630953,0.0004789835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004561119,"about_ca_system_score_gemma":0.0007321645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007161262,"about_ca_topic_score_gemma":0.0007825997,"domain_scores_codex":[0.9992558,0.0002948614,0.00004422792,0.00008579459,0.0002174773,0.0001017353],"domain_scores_gemma":[0.9992298,0.0003526511,0.0001034744,0.0001120641,0.0001455713,0.000056428],"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.0004414413,0.0002316327,0.0006547484,0.0003132329,0.00008614783,0.0004856538,0.0003103572,0.4809551,0.0379098,0.1466821,0.003299512,0.3286304],"study_design_scores_gemma":[0.0000404282,0.0001165044,0.00009133001,0.00001382102,0.00001539801,0.0001499007,0.00002438122,0.9862698,0.002881967,0.008090936,0.002280607,0.00002499213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008198443,0.0001834246,0.9902693,0.00008372992,0.00003370632,0.00004543876,0.0000102108,0.00009729501,0.001078525],"genre_scores_gemma":[0.5838208,0.000223347,0.4142271,0.0000790675,0.00006882343,0.0002175253,0.00003885995,0.00002637392,0.001298141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002168595,"threshold_uncertainty_score":0.00725466,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001299627,0.0005809211,0.001332183,0.00138508,0.001069025,0.002452358,0.00331125,0.001863672,0.002191195],"category_scores_gemma":[0.004595875,0.0005176619,0.0008117962,0.003244629,0.0009885371,0.008044162,0.001440326,0.001192048,0.0008378405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0017141,"about_ca_system_score_gemma":0.001563852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007564,"about_ca_topic_score_gemma":0.00448334,"domain_scores_codex":[0.9984905,0.0003634733,0.0001198079,0.0002861963,0.0006228851,0.0001171416],"domain_scores_gemma":[0.9983574,0.0007809021,0.0001286747,0.0002147102,0.000417283,0.0001011556],"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.000512997,0.0002237589,0.001844933,0.0005558581,0.0001335183,0.0009298673,0.0007011255,0.5381434,0.0130818,0.2642872,0.01460023,0.1649853],"study_design_scores_gemma":[0.00004479782,0.00007790721,0.000105565,0.00001020307,0.00002587315,0.0002139134,0.00005617507,0.9614425,0.001273881,0.03221162,0.004510203,0.0000274114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01913899,0.001340535,0.9698784,0.001244439,0.0001939861,0.000243482,0.0005316131,0.0007419455,0.006686638],"genre_scores_gemma":[0.7374724,0.00279249,0.2426257,0.0004503322,0.0003936999,0.0005435065,0.0009487974,0.0001649346,0.01460818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007564,"threshold_uncertainty_score":0.01503998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}