{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"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":"d6ecac86fe6d","filters":{"venue":"Journal of Chinese Computer Systems"}},"results":[{"id":"W2385055279","doi":"","title":"New Multilingual Information Retrieval Model Based on Latent Interlingua Semantics","year":2010,"lang":"en","type":"article","venue":"Journal of Chinese Computer Systems","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Natural language processing; Artificial intelligence; Cross-language information retrieval; Exploit; Semantics (computer science); Parallel corpora; Information retrieval; Space (punctuation); Machine translation; Programming language","authors":[{"name":"Meihua Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008407938687764304,"gpt":0.2667925029411465,"spread":0.2583845642533822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170446,0.0009104555,0.001384234,0.003355717,0.000797976,0.002159819,0.001531134,0.0009779787,0.003213604],"category_scores_gemma":[0.003028578,0.0004205255,0.001416666,0.003448596,0.0007221323,0.007252642,0.001505207,0.001280399,0.001910475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277709,"about_ca_system_score_gemma":0.001653525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00616193,"about_ca_topic_score_gemma":0.006771999,"domain_scores_codex":[0.9985451,0.0004276173,0.0001306884,0.0004440894,0.0003515967,0.0001009188],"domain_scores_gemma":[0.9991443,0.0003146119,0.0000805831,0.0001225885,0.0002970159,0.0000407402],"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.0008518875,0.0006783087,0.003773161,0.001205942,0.000679314,0.0006339637,0.001334757,0.08530878,0.02220574,0.1532193,0.03192591,0.6981831],"study_design_scores_gemma":[0.0001295331,0.0001912188,0.000921529,0.00005554958,0.0002221498,0.0004199728,0.0001796927,0.9041,0.005088883,0.07137462,0.01721997,0.00009686347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01408999,0.001646898,0.9770364,0.0008358122,0.0001556857,0.0001533039,0.0006598512,0.001865405,0.003556709],"genre_scores_gemma":[0.3909609,0.002232019,0.5874884,0.0008145704,0.0004513717,0.0008146411,0.003929218,0.0005016695,0.01280723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00616193,"threshold_uncertainty_score":0.01225215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2394122558","doi":"","title":"Tree-Based Load Balancing Method in DHT Networks","year":2006,"lang":"en","type":"article","venue":"Journal of Chinese Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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; Load balancing (electrical power); Scalability; Distributed computing; Tree (set theory); Metric (unit); Tree network; Network Load Balancing Services; Computer network; Algorithm; Server; Time complexity; Database","authors":[{"name":"Jinsheng Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006557398697715129,"gpt":0.2459289632969998,"spread":0.2393715645992847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000751904,0.0003663883,0.0005809463,0.00105703,0.001451126,0.001136423,0.001506721,0.0006550758,0.002989131],"category_scores_gemma":[0.001585294,0.000225194,0.0003812803,0.001532221,0.0004608916,0.001905746,0.001011938,0.0005841809,0.0008364923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008545573,"about_ca_system_score_gemma":0.0008968692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003364084,"about_ca_topic_score_gemma":0.002784409,"domain_scores_codex":[0.9990063,0.0001898011,0.00005228274,0.0001851755,0.0004826363,0.00008379382],"domain_scores_gemma":[0.9993021,0.0001516363,0.00004802093,0.0001393727,0.000305174,0.0000536362],"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.0005079978,0.0001999003,0.001970736,0.0004029639,0.0001559076,0.0002900995,0.0006619396,0.1270851,0.04423395,0.08079409,0.02141014,0.7222871],"study_design_scores_gemma":[0.0001548307,0.0001336773,0.000938114,0.00002788769,0.00005533423,0.0003347651,0.0001759124,0.914139,0.01838351,0.03197909,0.03360823,0.00006966815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01464432,0.0005768088,0.9773685,0.0002694157,0.0002090091,0.0001515541,0.0001407235,0.001352664,0.005287101],"genre_scores_gemma":[0.5045865,0.001208627,0.479622,0.0002641354,0.0004405162,0.0004812778,0.000661117,0.0002716261,0.0124642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003364084,"threshold_uncertainty_score":0.009999692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2387154953","doi":"","title":"Optimization Method in Content Addressable Network","year":2006,"lang":"en","type":"article","venue":"Journal of Chinese Computer 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; Distributed hash table; Overlay network; Network delay; Distributed computing; Simple (philosophy); Computer network; Table (database); Hash table; Hash function; Peer-to-peer; Data mining; The Internet","authors":[{"name":"Peilin Hong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01927942133485802,"gpt":0.2585344130301303,"spread":0.2392549916952722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009371784,0.0008171619,0.0007278437,0.0008451391,0.0005018706,0.0009548204,0.0008694524,0.0008375407,0.004262412],"category_scores_gemma":[0.002447737,0.000319657,0.0004626267,0.000870064,0.0005729581,0.001264237,0.0008577838,0.0007004765,0.0003891499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001069029,"about_ca_system_score_gemma":0.00100515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003134298,"about_ca_topic_score_gemma":0.001715592,"domain_scores_codex":[0.9994956,0.00019906,0.00001981007,0.00009128237,0.0001338708,0.00006026932],"domain_scores_gemma":[0.9994597,0.0003200372,0.00004727194,0.000025448,0.0001250654,0.00002247018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006460671,0.00004991111,0.0007344403,0.000210244,0.00005483017,0.0001273627,0.00008736295,0.8397842,0.001610096,0.1026062,0.004902864,0.0497679],"study_design_scores_gemma":[0.0000108404,0.00001764739,0.00008597844,0.00001018161,0.00000905193,0.00001995324,0.00001523478,0.9799656,0.0002785274,0.01759937,0.001982671,0.000005010252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006580754,0.0006657446,0.9822704,0.0004002515,0.00007174486,0.00006417493,0.00006856187,0.0001195014,0.00975878],"genre_scores_gemma":[0.5772805,0.001888891,0.4006187,0.0004130682,0.0002325972,0.0007475238,0.0003878664,0.000242257,0.01818861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004262412,"threshold_uncertainty_score":0.01425922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}