{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"81a69d3f0a61","filters":{"venue":"Data Science and Engineering"}},"results":[{"id":"W4292512861","doi":"10.1007/s41019-022-00193-5","title":"Dimensionality Reduction in Surrogate Modeling: A Review of Combined Methods","year":2022,"lang":"en","type":"review","venue":"Data Science and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate model; Dimensionality reduction; Curse of dimensionality; Computer science; Uncertainty quantification; Reduction (mathematics); Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","authors":[{"name":"Chun Kit Jeffery Hou","is_ca":true},{"name":"Kamran Behdinan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1561659719154234,"gpt":0.4220003777894886,"spread":0.2658344058740651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839634,0.001698488,0.002705367,0.003633405,0.0004031257,0.002367348,0.001602926,0.001655475,0.003827595],"category_scores_gemma":[0.005493491,0.0008085365,0.002001987,0.005649243,0.000922846,0.00237844,0.001335565,0.002107615,0.001796935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007311967,"about_ca_system_score_gemma":0.001418376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001290006,"about_ca_topic_score_gemma":0.001093375,"domain_scores_codex":[0.9984281,0.0004547194,0.000231879,0.0002392988,0.0005936267,0.00005240888],"domain_scores_gemma":[0.9968844,0.002117995,0.0001867551,0.0001448516,0.0006106627,0.00005515249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006421108,0.0001028115,0.0004463568,0.01669546,0.0003006897,0.0001366772,0.0001106652,0.01387983,0.001419514,0.03512606,0.0152401,0.9164777],"study_design_scores_gemma":[0.00005650664,0.0004045762,0.001679634,0.01199481,0.0007122155,0.001689805,0.0001716408,0.04744591,0.004852943,0.05533849,0.8753825,0.0002710152],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0004851234,0.9473172,0.04816126,0.0005989266,0.0004347288,0.00003772517,0.00008215816,0.00007684781,0.002806006],"genre_scores_gemma":[0.006055329,0.9654381,0.02622193,0.0002548196,0.0006937223,0.00009910679,0.0001642131,0.00005107549,0.001021646],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003827595,"threshold_uncertainty_score":0.01501763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3155426438","doi":"10.1007/s41019-021-00156-2","title":"A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores","year":2021,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Exploit; Workload; Graph traversal; Graph; Tree traversal; Latency (audio); Theoretical computer science; Distributed computing; Operating system; Algorithm","authors":[{"name":"Ali Davoudian","is_ca":true},{"name":"Liu Chen","is_ca":false},{"name":"Hongwei Tu","is_ca":false},{"name":"Mengchi Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02622165019799239,"gpt":0.2374815617922062,"spread":0.2112599115942138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006615,0.0009364255,0.0009493292,0.001314389,0.0007698287,0.001401992,0.003354953,0.0008396744,0.00334763],"category_scores_gemma":[0.00442267,0.0005565913,0.0005146963,0.001802963,0.0006040291,0.00314655,0.002470179,0.001160915,0.001060403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000862256,"about_ca_system_score_gemma":0.001017113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00320261,"about_ca_topic_score_gemma":0.00447458,"domain_scores_codex":[0.9990709,0.0001332429,0.00008250265,0.0002338648,0.0003977276,0.0000817609],"domain_scores_gemma":[0.9973978,0.0008003916,0.000167595,0.0009416493,0.0004383447,0.0002540985],"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.003047708,0.001009156,0.007400671,0.0007217916,0.0002110942,0.0006319341,0.001104453,0.123514,0.1542224,0.01387947,0.04524042,0.6490169],"study_design_scores_gemma":[0.000184609,0.0001649385,0.0007182073,0.00001491017,0.00002503303,0.0001696311,0.0001832045,0.9555231,0.03024663,0.005369839,0.007364026,0.00003589627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1266886,0.0006995634,0.8018268,0.0006557176,0.0001743505,0.0005235078,0.001864587,0.06511262,0.002454259],"genre_scores_gemma":[0.4443191,0.0002725469,0.5458831,0.0002485216,0.00009638041,0.0003803466,0.003669607,0.001781177,0.003349184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003354953,"threshold_uncertainty_score":0.01119894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243973573","doi":"10.1007/s41019-017-0053-1","title":"Sliding Window Top-K Monitoring over Distributed Data Streams","year":2017,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Sliding window protocol; Distributed computing; Overhead (engineering); Data stream mining; Distributed Computing Environment; Distributed algorithm; Aggregate (composite); Window (computing); Data stream; Real-time computing; Data mining; Database; Operating system","authors":[{"name":"Ben Chen","is_ca":false},{"name":"Zhijin Lv","is_ca":false},{"name":"Xiaohui Yu","is_ca":true},{"name":"Yang Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06100806266574163,"gpt":0.2964756951502873,"spread":0.2354676324845457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172721,0.001071824,0.00195898,0.001390037,0.001168538,0.001922025,0.001943457,0.0006219027,0.0005590419],"category_scores_gemma":[0.007877362,0.0005326995,0.0005850716,0.002096763,0.0008598796,0.003111361,0.001674234,0.0009589845,0.0002089211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000958306,"about_ca_system_score_gemma":0.001383181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005056149,"about_ca_topic_score_gemma":0.00408344,"domain_scores_codex":[0.9978831,0.0003263459,0.0002034664,0.0007230251,0.0006309528,0.0002331495],"domain_scores_gemma":[0.9954364,0.001734054,0.0009170209,0.0009432589,0.0006441351,0.000325169],"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.002126896,0.0003462595,0.02074896,0.0002820256,0.000259211,0.0005163284,0.0008210478,0.3916993,0.04859462,0.007049248,0.00322003,0.524336],"study_design_scores_gemma":[0.00002820106,0.00007500013,0.001028197,0.000004944734,0.00002588892,0.00008770394,0.00006926727,0.9873713,0.007629842,0.003067326,0.00060011,0.00001225858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09881251,0.0005750044,0.8962637,0.0001412211,0.00005933291,0.0001098127,0.0001237956,0.003309759,0.0006048605],"genre_scores_gemma":[0.7732824,0.0002186484,0.2254398,0.00004540995,0.00004597057,0.00007658989,0.0002096432,0.0001126942,0.0005687501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005056149,"threshold_uncertainty_score":0.01149058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393347796","doi":"10.1007/s41019-023-00239-2","title":"Uncovering Flat and Hierarchical Topics by Community Discovery on Word Co-occurrence Network","year":2024,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; University of Alberta","funders":"Centre National de la Recherche Scientifique; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Hierarchy; Identification (biology); Topic model; Word (group theory); Exploit; Data science; Tree (set theory); Information retrieval; Linguistics","authors":[{"name":"Eric Austin","is_ca":true},{"name":"Shraddha Makwana","is_ca":true},{"name":"Amine Trabelsi","is_ca":true},{"name":"Christine Largeron","is_ca":false},{"name":"Osmar R. Zai͏̈ane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02326652083480183,"gpt":0.2920903359651108,"spread":0.268823815130309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001791662,0.001398175,0.001220016,0.01111595,0.001523715,0.001608342,0.001333717,0.001299595,0.0008332788],"category_scores_gemma":[0.006843528,0.000492062,0.001454037,0.006835887,0.0008192831,0.003979882,0.002131102,0.001231576,0.000763652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007747484,"about_ca_system_score_gemma":0.001228158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006110988,"about_ca_topic_score_gemma":0.008862048,"domain_scores_codex":[0.9981628,0.0004970985,0.00010017,0.0006103496,0.0004274637,0.0002021678],"domain_scores_gemma":[0.9953041,0.002745843,0.0006722467,0.0003606623,0.0006919269,0.0002251383],"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.001003416,0.0005659446,0.05207582,0.00116259,0.0006551389,0.001232364,0.003487588,0.1104807,0.02586428,0.02857766,0.01928394,0.7556105],"study_design_scores_gemma":[0.00004122082,0.00006823376,0.005045797,0.00007539419,0.0001326399,0.0004430249,0.0006327314,0.9463732,0.005070652,0.03491358,0.007153866,0.00004963932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1057074,0.002552721,0.8852381,0.0004530801,0.00007654077,0.0003280116,0.001625949,0.001611414,0.002406876],"genre_scores_gemma":[0.5231264,0.001450459,0.4648589,0.0001254601,0.0002459289,0.0004391874,0.006579452,0.0002795194,0.002894678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01111595,"threshold_uncertainty_score":0.01215082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}