{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874062,0.001601801,0.002163808,0.001795457,0.002178539,0.002640497,0.004572315,0.002294236,0.003728756],"category_scores_gemma":[0.01001874,0.0009249701,0.001157383,0.002075034,0.001521839,0.005234852,0.004770007,0.002469706,0.001686537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001217436,"about_ca_system_score_gemma":0.002340707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001620634,"about_ca_topic_score_gemma":0.002281539,"domain_scores_codex":[0.9968334,0.0007708923,0.0003282938,0.0007427749,0.001074459,0.0002501258],"domain_scores_gemma":[0.9959054,0.002425593,0.0002825476,0.0006297731,0.0005504274,0.0002062393],"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.0009338527,0.0003403463,0.001027158,0.0005431921,0.0001760819,0.0001953446,0.0007043869,0.3621936,0.01129103,0.09626201,0.01485134,0.5114816],"study_design_scores_gemma":[0.0002799286,0.000221461,0.00009877521,0.00002885776,0.00003411422,0.0001436058,0.0001069863,0.9313801,0.003387779,0.05498457,0.00930222,0.00003160814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002403002,0.0002973616,0.9951272,0.0001988919,0.00006539903,0.0001900285,0.00004792723,0.0008893593,0.0007807762],"genre_scores_gemma":[0.05506012,0.0003302583,0.9411383,0.0001396036,0.0001287483,0.0006138625,0.0003010815,0.0001676632,0.00212026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004874062,"threshold_uncertainty_score":0.0257768,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002103032,0.0007973162,0.001410952,0.002254276,0.000578806,0.001641571,0.001084412,0.0006463213,0.0006873194],"category_scores_gemma":[0.009483124,0.0004100978,0.0005057626,0.003022768,0.0003569902,0.003582865,0.0008448054,0.0006884742,0.0003655292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004837156,"about_ca_system_score_gemma":0.0006739002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008853615,"about_ca_topic_score_gemma":0.00154551,"domain_scores_codex":[0.9989858,0.000279849,0.000154159,0.0002040934,0.0003161859,0.00005992208],"domain_scores_gemma":[0.996492,0.001464935,0.0006209451,0.0005764302,0.0007015365,0.0001441807],"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.0006403564,0.0003208691,0.009650347,0.0009541227,0.0002468042,0.0004001922,0.0008795037,0.2432955,0.03402634,0.0192099,0.008485946,0.6818901],"study_design_scores_gemma":[0.00003736197,0.00034304,0.002083944,0.00005991097,0.0001158663,0.0002315933,0.0003002361,0.958502,0.01497332,0.01635099,0.006968865,0.0000328424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0677231,0.002651316,0.9265907,0.0005571908,0.00009992992,0.0001582132,0.0007017258,0.0009714156,0.0005464468],"genre_scores_gemma":[0.4114531,0.002307803,0.5817508,0.0001036067,0.0003646742,0.0002170866,0.002569032,0.000136212,0.001097655],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002254276,"threshold_uncertainty_score":0.01112205,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002354143,0.0007688979,0.001519916,0.001311642,0.0009861815,0.002828766,0.002368124,0.000915472,0.0008252028],"category_scores_gemma":[0.01150096,0.0004842143,0.0004340688,0.002535221,0.001103058,0.004153675,0.001944874,0.000953982,0.0004016803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009713128,"about_ca_system_score_gemma":0.001097089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001956458,"about_ca_topic_score_gemma":0.001479072,"domain_scores_codex":[0.9982355,0.0002865399,0.0001791869,0.0002811508,0.0008120369,0.0002056043],"domain_scores_gemma":[0.9956101,0.001886999,0.0004579893,0.000907394,0.0008962455,0.000241383],"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.001076524,0.0004557322,0.005293198,0.0002419816,0.00008858437,0.0003998264,0.0005357214,0.5520873,0.05520568,0.0217323,0.00461095,0.3582721],"study_design_scores_gemma":[0.00002674369,0.00005456612,0.0002703798,0.000003488771,0.000009193011,0.00004372077,0.00004704944,0.9829147,0.01091768,0.005127402,0.0005725446,0.00001255951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1566101,0.0004747029,0.8373263,0.0002815108,0.00007405532,0.0001529158,0.0001608187,0.0031839,0.001735708],"genre_scores_gemma":[0.7462261,0.0002703464,0.251341,0.00006500113,0.00009642451,0.0001541462,0.0004635993,0.0002585179,0.001124815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002828766,"threshold_uncertainty_score":0.01245004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}