{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014089987,0.0016468985,0.9770364,0.0008358122,0.00015568567,0.00015330386,0.0006598512,0.0018654054,0.0035567086],"genre_scores_gemma":[0.39096093,0.0022320189,0.58748835,0.0008145704,0.00045137168,0.00081464107,0.0039292183,0.00050166954,0.012807233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854505,0.00042761725,0.00013068842,0.0004440894,0.00035159674,0.000100918776],"domain_scores_gemma":[0.9991443,0.00031461194,0.0000805831,0.00012258849,0.00029701594,0.0000407402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017044595,0.0009104555,0.0013842337,0.003355717,0.000797976,0.0021598192,0.0015311342,0.0009779787,0.0032136037],"category_scores_gemma":[0.0030285777,0.0004205255,0.0014166659,0.0034485955,0.00072213233,0.0072526424,0.0015052073,0.0012803986,0.0019104752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00085188745,0.00067830866,0.0037731607,0.0012059418,0.000679314,0.0006339637,0.0013347567,0.08530878,0.022205736,0.15321925,0.031925913,0.69818306],"study_design_scores_gemma":[0.00012953313,0.00019121877,0.000921529,0.00005554958,0.0002221498,0.00041997278,0.0001796927,0.9041,0.0050888825,0.07137462,0.017219966,0.00009686347],"about_ca_topic_score_codex":0.00616193,"about_ca_topic_score_gemma":0.006771999,"teacher_disagreement_score":0.00616193,"about_ca_system_score_codex":0.0012777086,"about_ca_system_score_gemma":0.0016535249,"threshold_uncertainty_score":0.012252152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065807537,0.0006657446,0.9822704,0.00040025153,0.00007174486,0.00006417493,0.000068561865,0.00011950141,0.00975878],"genre_scores_gemma":[0.57728046,0.0018888911,0.4006187,0.0004130682,0.00023259717,0.0007475238,0.00038786643,0.00024225695,0.018188613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994956,0.00019906004,0.000019810072,0.00009128237,0.0001338708,0.00006026932],"domain_scores_gemma":[0.9994597,0.00032003724,0.000047271944,0.000025447998,0.00012506536,0.000022470183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009371784,0.0008171619,0.00072784367,0.0008451391,0.0005018706,0.0009548204,0.0008694524,0.0008375407,0.004262412],"category_scores_gemma":[0.0024477374,0.00031965703,0.00046262675,0.00087006396,0.00057295815,0.001264237,0.00085778383,0.00070047646,0.0003891499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.00006460671,0.00004991111,0.0007344403,0.00021024405,0.00005483017,0.00012736267,0.00008736295,0.8397842,0.0016100958,0.10260617,0.0049028643,0.0497679],"study_design_scores_gemma":[0.000010840397,0.000017647393,0.00008597844,0.0000101816095,0.00000905193,0.000019953244,0.000015234782,0.97996557,0.00027852738,0.017599368,0.0019826707,0.000005010252],"about_ca_topic_score_codex":0.003134298,"about_ca_topic_score_gemma":0.0017155919,"teacher_disagreement_score":0.004262412,"about_ca_system_score_codex":0.0010690285,"about_ca_system_score_gemma":0.0010051501,"threshold_uncertainty_score":0.014259219},"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":"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.014644316,0.00057680876,0.9773685,0.00026941567,0.00020900911,0.00015155412,0.00014072345,0.0013526642,0.005287101],"genre_scores_gemma":[0.5045865,0.0012086265,0.479622,0.00026413536,0.00044051625,0.00048127776,0.00066111697,0.00027162608,0.012464197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900633,0.00018980111,0.000052282736,0.00018517554,0.00048263627,0.00008379382],"domain_scores_gemma":[0.99930215,0.00015163631,0.000048020935,0.00013937271,0.00030517398,0.0000536362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075190404,0.0003663883,0.0005809463,0.0010570297,0.0014511261,0.0011364227,0.0015067209,0.0006550758,0.0029891306],"category_scores_gemma":[0.0015852939,0.000225194,0.0003812803,0.0015322214,0.0004608916,0.0019057456,0.001011938,0.0005841809,0.0008364923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0005079978,0.00019990034,0.001970736,0.00040296387,0.00015590763,0.0002900995,0.00066193956,0.12708512,0.044233948,0.08079409,0.021410145,0.7222871],"study_design_scores_gemma":[0.00015483066,0.00013367734,0.00093811395,0.00002788769,0.000055334232,0.00033476512,0.00017591238,0.91413903,0.018383514,0.03197909,0.033608228,0.000069668145],"about_ca_topic_score_codex":0.0033640843,"about_ca_topic_score_gemma":0.002784409,"teacher_disagreement_score":0.0033640843,"about_ca_system_score_codex":0.0008545573,"about_ca_system_score_gemma":0.0008968692,"threshold_uncertainty_score":0.009999692},"labels":[],"label_agreement":null}]}