{"meta":{"query_hash":"8cf6794991a0","filters":{"venue":"Journal of Circuits and Systems"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8cf6794991a0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Circuits+and+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.043628415008749116,"score_gpt":0.23974007785590648,"score_spread":0.19611166284715736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350013284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17682457,0.0003337302,0.8217126,0.00042972423,0.0003087222,0.00015340876,0.0000017222611,0.000041355466,0.0001941744],"genre_scores_gemma":[0.99484247,0.00003744924,0.0048253317,0.00018220594,0.00007362338,0.0000058500345,5.728392e-7,0.000005372988,0.000027125321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983836,0.000041940122,0.0006439629,0.00012031504,0.0005102131,0.00030001308],"domain_scores_gemma":[0.9989506,0.00011439214,0.0002616874,0.00026691522,0.0002822216,0.0001241715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009837226,0.00012168317,0.0003059434,0.00049602345,0.00009325007,0.00017505413,0.0006550064,0.00012077165,2.5320264e-7],"category_scores_gemma":[0.00010005803,0.000100301826,0.000052045,0.0005789714,0.00003675135,0.0009728937,0.000099315526,0.00033554155,0.0000025417312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048693,0.00003923517,0.0061821537,0.000022921837,0.000010219147,0.000027497808,0.00087164517,0.9740709,0.00025784143,0.0012470777,0.0012251945,0.016037265],"study_design_scores_gemma":[0.0007810324,0.00012073491,0.0063777347,0.00014408374,0.0000018084112,0.00035475905,0.00007483299,0.99118745,0.00003709055,0.000037941205,0.0007657517,0.00011675315],"about_ca_topic_score_codex":0.0000583205,"about_ca_topic_score_gemma":0.000013600054,"teacher_disagreement_score":0.8180179,"about_ca_system_score_codex":0.00009567056,"about_ca_system_score_gemma":0.0001765004,"threshold_uncertainty_score":0.40901896},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02422511218098618,"score_gpt":0.22630608209173605,"score_spread":0.20208096991074986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353462733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15704574,0.009028766,0.8325131,0.000014137353,0.00049908983,0.0005427057,0.0000064410965,0.000076116885,0.00027389338],"genre_scores_gemma":[0.9966261,0.00033201298,0.0021381981,0.000010198087,0.00037635354,0.00002216689,0.0000054782813,0.00004782351,0.00044169242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990081,0.00002903333,0.0004544965,0.00010480198,0.00022145339,0.00018210102],"domain_scores_gemma":[0.99916583,0.000049817543,0.0002891227,0.00011984885,0.00027651063,0.00009884261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022665407,0.00014271903,0.00032911805,0.0001130386,0.000108136344,0.00006940831,0.00010004867,0.00008684658,5.1731683e-7],"category_scores_gemma":[0.00000730017,0.000113249946,0.000035248522,0.00014586859,0.000018194582,0.00032339306,0.000005581475,0.00011580862,7.7939086e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001952783,0.000021470805,0.0020705096,0.0006867075,0.000098915574,0.0000143258485,0.00064761844,0.99462557,0.00091701257,0.00032772083,0.00031286333,0.00025776777],"study_design_scores_gemma":[0.0017406818,0.00016815998,0.001000749,0.0008187398,0.00004123267,0.0012500782,0.0006962595,0.9764889,0.00007894581,0.0000025189897,0.017492611,0.00022113681],"about_ca_topic_score_codex":0.00001174858,"about_ca_topic_score_gemma":0.00000580111,"teacher_disagreement_score":0.83958036,"about_ca_system_score_codex":0.00006812953,"about_ca_system_score_gemma":0.000026690303,"threshold_uncertainty_score":0.4618199},"labels":[],"label_agreement":null}]}