{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008383705,0.0002315488,0.0003701125,0.000474027,0.00006898534,0.0006460185,0.001378158,0.0001536256,0.000001269032],"category_scores_gemma":[0.0001805223,0.0001562756,0.0001646167,0.0003510987,0.00001689918,0.001382427,0.0001735524,0.0008284528,0.000007137247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005633324,"about_ca_system_score_gemma":0.0003162851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001168788,"about_ca_topic_score_gemma":0.000002095179,"domain_scores_codex":[0.997993,0.00005484838,0.0008485,0.0001577035,0.0007353412,0.0002105882],"domain_scores_gemma":[0.9976917,0.0001218686,0.0008477927,0.0004771868,0.0006700719,0.0001914066],"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.0009376063,0.0007390126,0.006526031,0.001166564,0.0002821006,0.0006986071,0.0194941,0.592757,0.02129927,0.02606715,0.01946416,0.3105683],"study_design_scores_gemma":[0.0006033263,0.0002308015,0.00010231,0.0002253936,0.000005765234,0.0002826889,0.000002029938,0.9953401,0.00138698,0.001370742,0.0002759121,0.0001739364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06825562,0.0001141143,0.9253638,0.0003897331,0.005541299,0.0001345951,0.000001204084,0.0001678744,0.00003174413],"genre_scores_gemma":[0.5714281,9.930749e-7,0.4274642,0.0002227338,0.0008586152,2.775051e-7,0.000001000033,0.000007419969,0.00001663951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5031725,"threshold_uncertainty_score":0.6372734,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00236948,0.0003341299,0.0008328033,0.0007016946,0.0000648684,0.0004576153,0.002264972,0.000178807,9.096991e-7],"category_scores_gemma":[0.00006709609,0.0002512655,0.0002140585,0.001712064,0.00002400175,0.0005621482,0.0003729986,0.0005554077,0.000008320091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003052689,"about_ca_system_score_gemma":0.0001930817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001612505,"about_ca_topic_score_gemma":0.0001257283,"domain_scores_codex":[0.9966829,0.0003273585,0.001250391,0.0003858868,0.0008191871,0.0005342714],"domain_scores_gemma":[0.9975313,0.0004712575,0.0006961517,0.0007252372,0.0004358144,0.0001402167],"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.00002102544,0.00009916836,0.03152865,0.00003205636,0.0000268558,0.000632611,0.0001113967,0.9272135,0.0001450188,0.000864113,0.01493041,0.02439517],"study_design_scores_gemma":[0.0009312514,0.0001993597,0.03200753,0.0003242763,0.000005172363,0.0005192627,0.000004207443,0.9617224,0.00003544548,0.0007609264,0.00321642,0.0002737807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04448154,0.001348528,0.9472123,0.001308516,0.004923329,0.0002101362,6.025411e-7,0.0001971484,0.00031793],"genre_scores_gemma":[0.707546,0.000002898742,0.2902168,0.0002331323,0.00193522,0.000006249411,5.575446e-7,0.00001775971,0.00004144687],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6630644,"threshold_uncertainty_score":0.999994,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618157,0.0002323184,0.0006353153,0.00046185,0.00006086958,0.0003690679,0.001629473,0.0001205658,0.000001373048],"category_scores_gemma":[0.00004560832,0.0001732014,0.0001274317,0.001390956,0.00001703174,0.0006603188,0.0004097837,0.0003091907,0.000006827219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001462247,"about_ca_system_score_gemma":0.00006467002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001047398,"about_ca_topic_score_gemma":0.00002637679,"domain_scores_codex":[0.9974198,0.0002652781,0.001086865,0.0002819344,0.0005376811,0.0004084602],"domain_scores_gemma":[0.9981087,0.0002383271,0.0006377524,0.0005190083,0.0003990526,0.00009712155],"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.00001070081,0.00005403601,0.008775698,0.00001505901,0.00002074605,0.0001081434,0.000071926,0.9629448,0.00002816292,0.003750916,0.02176252,0.002457319],"study_design_scores_gemma":[0.0006552811,0.0001779829,0.009004368,0.0002406743,0.000004282262,0.0004860263,0.000005292841,0.9828129,0.00001502913,0.001592417,0.00479971,0.0002060661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009146622,0.001122957,0.9829777,0.001131602,0.004856075,0.0002545361,7.174302e-7,0.0001354829,0.000374314],"genre_scores_gemma":[0.2487487,0.00001046692,0.7485004,0.0001726416,0.002396588,0.000009182366,0.000001163266,0.00001636099,0.0001444297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2396021,"threshold_uncertainty_score":0.7062949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}