{"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":"74389af0069a","filters":{"venue":"International Conference on Scientific and Statistical Database Management"}},"results":[{"id":"W2159228726","doi":"10.1109/ssdbm.2007.26","title":"A Distributed Algorithm for Joins in Sensor Networks","year":2007,"lang":"en","type":"article","venue":"International Conference on Scientific and Statistical Database Management","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Joins; Computer science; Wireless sensor network; Distributed computing; Set (abstract data type); Context (archaeology); Join (topology); Flexibility (engineering); Distributed algorithm; Algorithm; Computer network","authors":[{"name":"Alexandru Coman","is_ca":true},{"name":"Mário A. Nascimento","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03755024114566358,"gpt":0.3078482048504488,"spread":0.2702979637047853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151891,0.0001662592,0.0001531319,0.0002987888,0.0001441124,0.0005650632,0.000638488,0.00004229008,0.00004599848],"category_scores_gemma":[0.00005836848,0.0001561276,0.00002890143,0.0003487514,0.0001811934,0.0001992274,0.0003723109,0.0001435898,0.00001658796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008035944,"about_ca_system_score_gemma":0.00001807904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001599826,"about_ca_topic_score_gemma":0.00006449923,"domain_scores_codex":[0.9978235,0.00004120434,0.0003726216,0.0007739824,0.0005421284,0.0004465706],"domain_scores_gemma":[0.9988469,0.0003556954,0.00007835063,0.000396075,0.000161565,0.0001613364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002578215,0.0001418381,0.00004958796,0.000007773049,0.00001863638,0.0001360162,0.00002142996,0.002813212,0.00001519544,0.8555841,0.00245049,0.1387359],"study_design_scores_gemma":[0.0006182743,0.00004304202,0.002594418,0.00006414275,0.000005718489,0.000004218551,0.00007598878,0.9852417,0.00002537262,0.001964058,0.009176769,0.0001862633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005151359,0.00001168706,0.9931229,0.0004758596,0.00129877,0.0003146171,0.0007419947,0.00005371411,0.003465371],"genre_scores_gemma":[0.3660923,0.00004043834,0.6302776,0.0003051678,0.00008279541,0.00003910089,0.001897862,0.00001158694,0.001253077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9824286,"threshold_uncertainty_score":0.63667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162954778","doi":"10.1109/ssdbm.2007.32","title":"Effective Summarization of Multi-Dimensional Data Streams for Historical Stream Mining","year":2007,"lang":"en","type":"article","venue":"International Conference on Scientific and Statistical Database Management","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Automatic summarization; Computer science; Data stream; Data stream mining; Data mining; ENCODE; Data stream clustering; Cluster analysis; STREAMS; Task (project management); Space (punctuation); Simple (philosophy); Information retrieval; Artificial intelligence","authors":[{"name":"Samer Nassar","is_ca":true},{"name":"Jörg Sander","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09385673441405702,"gpt":0.3485527483789883,"spread":0.2546960139649312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001447058,0.0001449507,0.0001557889,0.0002912052,0.000151427,0.0003157155,0.001187639,0.00002503727,0.00004839219],"category_scores_gemma":[0.0001917573,0.0001311836,0.00002137626,0.0002023314,0.0001415022,0.0006554403,0.001314137,0.00006393332,0.00001097066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008383086,"about_ca_system_score_gemma":0.00002450663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004305902,"about_ca_topic_score_gemma":0.00005167683,"domain_scores_codex":[0.9978578,0.00003468282,0.0003610622,0.0008394375,0.0006699068,0.0002371091],"domain_scores_gemma":[0.9984471,0.0003854968,0.0001341431,0.000710378,0.0002115201,0.0001114156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004842875,0.0002403991,0.0001343339,0.00003886996,0.00005515186,0.00002202424,0.00002810934,0.000009923288,0.00008527246,0.6916754,0.009811604,0.2978504],"study_design_scores_gemma":[0.001214839,0.0001488375,0.003195759,0.0001052041,0.00004331364,0.000001647464,0.000123677,0.9622474,0.0001619696,0.003953843,0.02855195,0.000251616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006807232,0.00001589948,0.9920346,0.0002970873,0.001247836,0.0004466039,0.002740535,0.00003226108,0.002504512],"genre_scores_gemma":[0.2654712,0.00002031276,0.7203074,0.000123192,0.0000736615,0.00003117929,0.01048929,0.00001126163,0.003472529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9622374,"threshold_uncertainty_score":0.5349511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123539568","doi":"10.1109/ssdbm.2007.33","title":"Efficient Indexing of Heterogeneous Data Streams with Automatic Performance Configurations","year":2007,"lang":"en","type":"article","venue":"International Conference on Scientific and Statistical Database Management","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Search engine indexing; Computer science; Data stream mining; Stream processing; Data mining; Data stream; Bitmap; Lossless compression; Sketch; Data structure; Cluster analysis; Index (typography); Data compression; Distributed computing; Information retrieval; Algorithm; Artificial intelligence","authors":[{"name":"Ken Q. Pu","is_ca":true},{"name":"Ying Zhu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05475050939834741,"gpt":0.3166149830975928,"spread":0.2618644736992454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008183417,0.0001462797,0.0001520902,0.0002105988,0.0001817651,0.0002016456,0.0007755187,0.00001715375,0.0001095443],"category_scores_gemma":[0.00004683976,0.000113492,0.00001052908,0.0002166254,0.0003186132,0.0003383868,0.0006875122,0.0000853996,0.00002307077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002834956,"about_ca_system_score_gemma":0.00004629574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002020306,"about_ca_topic_score_gemma":0.00004120404,"domain_scores_codex":[0.9979303,0.00002971828,0.0003834686,0.0006491761,0.000770205,0.0002370655],"domain_scores_gemma":[0.9984244,0.0001458807,0.0001496671,0.000979859,0.0001823869,0.0001178258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002630796,0.0001032898,0.00008865231,0.00006964356,0.00004069666,0.00006428628,0.00007707848,0.0003871592,0.0001558016,0.9263563,0.0001820049,0.0724488],"study_design_scores_gemma":[0.0004526231,0.0001169097,0.002338689,0.000288729,0.00001718512,0.00002761817,0.0002622459,0.9894192,0.0004429216,0.0003971771,0.006019639,0.0002171248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0261113,0.00001153694,0.9638349,0.0001116977,0.0003654325,0.0002304009,0.001633264,0.00004164972,0.007659772],"genre_scores_gemma":[0.8389004,0.00001018693,0.1599168,0.00003713483,0.00001318431,0.000006958347,0.0008671455,0.000004779931,0.0002434797],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.989032,"threshold_uncertainty_score":0.462807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}