{"meta":{"query_hash":"d6ecac86fe6d","filters":{"venue":"Journal of Chinese Computer Systems"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/d6ecac86fe6d","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008407938687764304,"score_gpt":0.2667925029411465,"score_spread":0.2583845642533822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2385055279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06825562,0.0001141143,0.92536384,0.0003897331,0.0055412985,0.00013459513,0.0000012040844,0.00016787436,0.00003174413],"genre_scores_gemma":[0.5714281,9.930749e-7,0.4274642,0.0002227338,0.0008586152,2.775051e-7,0.000001000033,0.0000074199693,0.000016639513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997993,0.00005484838,0.0008485,0.00015770346,0.00073534116,0.00021058824],"domain_scores_gemma":[0.9976917,0.0001218686,0.0008477927,0.00047718684,0.00067007187,0.00019140658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083837047,0.00023154881,0.00037011248,0.00047402695,0.00006898534,0.00064601854,0.0013781585,0.00015362565,0.000001269032],"category_scores_gemma":[0.0001805223,0.00015627561,0.00016461668,0.00035109872,0.000016899177,0.0013824272,0.00017355238,0.0008284528,0.000007137247],"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.00093760627,0.00073901255,0.0065260306,0.0011665642,0.00028210058,0.0006986071,0.019494098,0.59275705,0.021299275,0.026067154,0.019464158,0.31056833],"study_design_scores_gemma":[0.0006033263,0.00023080148,0.00010231005,0.00022539357,0.0000057652337,0.00028268885,0.0000020299378,0.9953401,0.00138698,0.0013707425,0.00027591214,0.00017393641],"about_ca_topic_score_codex":0.000011687881,"about_ca_topic_score_gemma":0.0000020951786,"teacher_disagreement_score":0.5031725,"about_ca_system_score_codex":0.000056333236,"about_ca_system_score_gemma":0.0003162851,"threshold_uncertainty_score":0.63727343},"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,"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; 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","score_opus":0.019279421334858018,"score_gpt":0.25853441303013025,"score_spread":0.23925499169527223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387154953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009146622,0.0011229565,0.9829777,0.0011316019,0.004856075,0.00025453613,7.1743017e-7,0.0001354829,0.000374314],"genre_scores_gemma":[0.24874875,0.000010466917,0.7485004,0.00017264155,0.002396588,0.000009182366,0.0000011632665,0.000016360993,0.00014442965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974198,0.0002652781,0.0010868653,0.00028193442,0.0005376811,0.00040846018],"domain_scores_gemma":[0.99810874,0.00023832706,0.00063775235,0.00051900826,0.00039905257,0.00009712155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016181571,0.0002323184,0.00063531526,0.00046185,0.00006086958,0.00036906794,0.0016294732,0.00012056576,0.0000013730482],"category_scores_gemma":[0.00004560832,0.00017320142,0.0001274317,0.0013909561,0.000017031743,0.0006603188,0.0004097837,0.00030919068,0.000006827219],"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.000010700814,0.00005403601,0.008775698,0.000015059007,0.000020746047,0.000108143446,0.000071926,0.9629448,0.000028162916,0.003750916,0.021762516,0.0024573186],"study_design_scores_gemma":[0.0006552811,0.0001779829,0.0090043675,0.0002406743,0.0000042822617,0.0004860263,0.000005292841,0.9828129,0.000015029129,0.001592417,0.00479971,0.00020606612],"about_ca_topic_score_codex":0.00010473984,"about_ca_topic_score_gemma":0.000026376794,"teacher_disagreement_score":0.23960213,"about_ca_system_score_codex":0.00014622473,"about_ca_system_score_gemma":0.00006467002,"threshold_uncertainty_score":0.7062949},"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,"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; 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","score_opus":0.006557398697715129,"score_gpt":0.24592896329699984,"score_spread":0.23937156459928471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394122558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448154,0.0013485276,0.9472123,0.0013085165,0.004923329,0.00021013625,6.0254115e-7,0.00019714839,0.00031793004],"genre_scores_gemma":[0.707546,0.0000028987424,0.29021677,0.00023313235,0.0019352203,0.000006249411,5.575446e-7,0.000017759708,0.000041446874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966829,0.00032735855,0.0012503905,0.0003858868,0.00081918715,0.00053427136],"domain_scores_gemma":[0.9975313,0.00047125752,0.0006961517,0.0007252372,0.00043581444,0.00014021667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00236948,0.00033412987,0.0008328033,0.0007016946,0.0000648684,0.00045761533,0.0022649718,0.00017880696,9.096991e-7],"category_scores_gemma":[0.000067096094,0.0002512655,0.00021405848,0.0017120636,0.000024001753,0.00056214817,0.00037299865,0.0005554077,0.000008320091],"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.00002102544,0.000099168356,0.03152865,0.000032056363,0.0000268558,0.000632611,0.00011139674,0.92721355,0.00014501884,0.00086411304,0.014930409,0.024395173],"study_design_scores_gemma":[0.0009312514,0.00019935967,0.032007527,0.0003242763,0.0000051723628,0.00051926274,0.0000042074435,0.9617224,0.000035445475,0.0007609264,0.00321642,0.00027378066],"about_ca_topic_score_codex":0.0001612505,"about_ca_topic_score_gemma":0.00012572834,"teacher_disagreement_score":0.6630644,"about_ca_system_score_codex":0.00030526886,"about_ca_system_score_gemma":0.00019308168,"threshold_uncertainty_score":0.999994},"labels":[],"label_agreement":null}]}