{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01913899,0.0013405345,0.9698784,0.0012444387,0.00019398608,0.00024348203,0.0005316131,0.00074194546,0.006686638],"genre_scores_gemma":[0.73747236,0.0027924897,0.24262574,0.00045033224,0.00039369994,0.0005435065,0.00094879745,0.00016493462,0.014608184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849045,0.0003634733,0.00011980786,0.00028619627,0.00062288507,0.00011714161],"domain_scores_gemma":[0.99835736,0.0007809021,0.00012867467,0.0002147102,0.000417283,0.00010115561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012996274,0.00058092107,0.001332183,0.0013850802,0.001069025,0.0024523584,0.00331125,0.0018636723,0.0021911948],"category_scores_gemma":[0.004595875,0.00051766186,0.0008117962,0.0032446291,0.0009885371,0.008044162,0.0014403262,0.0011920484,0.00083784055],"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.000512997,0.00022375889,0.0018449329,0.00055585813,0.00013351832,0.0009298673,0.00070112554,0.5381434,0.0130818,0.26428717,0.014600231,0.16498534],"study_design_scores_gemma":[0.000044797824,0.00007790721,0.000105564985,0.000010203065,0.000025873145,0.00021391339,0.00005617507,0.96144253,0.0012738808,0.03221162,0.004510203,0.0000274114],"about_ca_topic_score_codex":0.007564,"about_ca_topic_score_gemma":0.0044833403,"teacher_disagreement_score":0.007564,"about_ca_system_score_codex":0.0017141005,"about_ca_system_score_gemma":0.001563852,"threshold_uncertainty_score":0.01503998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008198443,0.00018342462,0.9902693,0.00008372992,0.000033706317,0.000045438763,0.000010210797,0.00009729501,0.0010785254],"genre_scores_gemma":[0.58382076,0.00022334697,0.41422707,0.000079067504,0.00006882343,0.00021752535,0.00003885995,0.000026373924,0.001298141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.0002948614,0.000044227923,0.00008579459,0.0002174773,0.00010173533],"domain_scores_gemma":[0.9992298,0.0003526511,0.00010347438,0.00011206411,0.00014557128,0.000056427998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363935,0.0006948811,0.0007022393,0.00057638204,0.0006975111,0.0009089369,0.0012680431,0.00075458287,0.0021685946],"category_scores_gemma":[0.002510452,0.000319647,0.00039652188,0.0006992729,0.0006484987,0.0012880494,0.0008885662,0.0008630953,0.00047898348],"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.0004414413,0.00023163269,0.0006547484,0.0003132329,0.00008614783,0.00048565379,0.00031035722,0.4809551,0.037909802,0.14668208,0.0032995115,0.32863036],"study_design_scores_gemma":[0.000040428196,0.00011650435,0.00009133001,0.000013821024,0.000015398013,0.00014990075,0.00002438122,0.9862698,0.002881967,0.008090936,0.0022806074,0.000024992129],"about_ca_topic_score_codex":0.00071612623,"about_ca_topic_score_gemma":0.0007825997,"teacher_disagreement_score":0.0021685946,"about_ca_system_score_codex":0.0004561119,"about_ca_system_score_gemma":0.00073216454,"threshold_uncertainty_score":0.00725466},"labels":[],"label_agreement":null}]}