{"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"},"query_hash":"d1d6321d76d1","filters":{"venue":"Brazilian Symposium on Databases"}},"results":[{"id":"W30607122","doi":"10.3747/co.25.4117","title":"Personalized Keyword Search with Partial-Order Preferences.","year":2002,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Order (exchange); Information retrieval; Keyword search","retraction":null,"screen_n_in":null,"score":{"opus":0.04504363808569928,"gpt":0.2636945420906061,"spread":0.2186509040049068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002313735,0.0002891754,0.0002353468,0.0001894344,0.000244443,0.0004505916,0.001498369,0.00003158314,0.0008889569],"category_scores_gemma":[0.00001996675,0.0002235167,0.00005134227,0.0007927543,0.0001671733,0.001691316,0.0005318818,0.0001881193,0.001155418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002846,"about_ca_system_score_gemma":0.00003470224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008809048,"about_ca_topic_score_gemma":0.00003560681,"domain_scores_codex":[0.9974428,0.0001164342,0.0002292914,0.0008855214,0.0007552226,0.0005707187],"domain_scores_gemma":[0.9980486,0.0001119427,0.00007286449,0.001482838,0.00007910105,0.0002046736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002577503,0.002852718,0.01116676,0.0003114813,0.0004320552,0.0008122381,0.003014923,0.0004930565,0.001081631,0.3461227,0.3695507,0.263904],"study_design_scores_gemma":[0.002469708,0.0007116476,0.001256575,0.0002371608,0.00005045853,0.0000366957,0.0002013507,0.06887387,0.004131852,0.00006698687,0.9208379,0.001125767],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05679112,0.001352299,0.6383315,0.0305434,0.002230233,0.003470145,0.001842512,0.003405302,0.2620335],"genre_scores_gemma":[0.588627,0.002756102,0.2869891,0.01115191,0.001592388,0.0005464003,0.002244435,0.0002442665,0.1058485],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5512872,"threshold_uncertainty_score":0.9996223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913175468","doi":"","title":"Proceedings of the 23rd Brazilian symposium on Databases","year":2008,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Context (archaeology); Computer science; Database; Presentation (obstetrics); Latin Americans; Library science; World Wide Web; Political science; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.02597160949349056,"gpt":0.259488498731684,"spread":0.2335168892381934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004391428,0.0007300085,0.0007296461,0.0003393432,0.000901078,0.00007359947,0.002154999,0.00009153054,0.00006532989],"category_scores_gemma":[0.0002404664,0.0005322626,0.0003026576,0.001237137,0.0006595154,0.002752438,0.001423304,0.0004828792,0.0002410599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173944,"about_ca_system_score_gemma":0.0002708938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00031778,"about_ca_topic_score_gemma":0.00009718513,"domain_scores_codex":[0.9950645,0.0001120401,0.0009674992,0.001583624,0.001366957,0.0009053743],"domain_scores_gemma":[0.9953483,0.0004068466,0.0006460064,0.002939362,0.0003117814,0.0003476859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002673833,0.001076539,0.008597983,0.0004281682,0.0001072221,0.0001123244,0.001032906,0.0002011756,0.09256911,0.7612239,0.1331858,0.001197503],"study_design_scores_gemma":[0.001276835,0.0005811022,0.007544392,0.001235684,0.0000435735,0.0004089934,0.0002728498,0.0005106538,0.26048,0.00006233553,0.7264265,0.001157019],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7928149,0.001155215,0.04831668,0.02055972,0.009519692,0.007062257,0.02118337,0.003157188,0.09623097],"genre_scores_gemma":[0.9018158,0.001654642,0.07188922,0.008520093,0.00176367,0.0004996406,0.001133612,0.0003440592,0.0123793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7611616,"threshold_uncertainty_score":0.9997129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W30283385","doi":"10.3389/fpsyg.2018.01740","title":"Computing data cubes without redundant aggregated nodes and single graph paths: the sequential MCG approach","year":2008,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Cuboid; Cube (algebra); Data cube; Computer science; Computation; Tuple; Graph; Hypercube; Base (topology); Algorithm; Reduction (mathematics); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Data mining; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.07017860466193648,"gpt":0.282689483014899,"spread":0.2125108783529625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004851635,0.0004236842,0.0004227198,0.0001512262,0.001190952,0.0001710425,0.001551427,0.00005545294,0.000006427642],"category_scores_gemma":[0.0001186879,0.0002974091,0.00006417018,0.0005293275,0.0006661617,0.002088215,0.002240571,0.0002792566,0.00002287784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003264607,"about_ca_system_score_gemma":0.0001199533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000571864,"about_ca_topic_score_gemma":0.00006092508,"domain_scores_codex":[0.9967008,0.0002852431,0.0005231802,0.001344589,0.0005710971,0.0005750544],"domain_scores_gemma":[0.9957431,0.0002240532,0.0002909663,0.003455014,0.00009332835,0.0001935383],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008684944,0.005384007,0.02724169,0.001752185,0.00120709,0.002255755,0.01784918,0.00576622,0.2073474,0.5508279,0.09266538,0.08683468],"study_design_scores_gemma":[0.005170471,0.0009520325,0.00710323,0.002220391,0.0002167135,0.007964483,0.002952703,0.3804474,0.0490425,0.0002097024,0.5392077,0.004512711],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1143137,0.001395286,0.8771772,0.0008056549,0.0007573287,0.000773626,0.002595188,0.0006431493,0.001538849],"genre_scores_gemma":[0.8014929,0.0006318811,0.1937733,0.000757126,0.0004868458,0.00002949728,0.002478617,0.00006959299,0.0002802212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6871792,"threshold_uncertainty_score":0.9999478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W88109437","doi":"","title":"A Tutorial on Social Network Analysis for Database Practitioners.","year":2009,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Visibility; Social network analysis; Data science; Social network (sociolinguistics); Network analysis; Network science; World Wide Web; Complex network; Social media","retraction":null,"screen_n_in":null,"score":{"opus":0.03519003957862123,"gpt":0.316314964171178,"spread":0.2811249245925568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003968031,0.0002386457,0.0002922021,0.0002222895,0.0006463081,0.0002987969,0.0009152028,0.00005102579,0.00002538833],"category_scores_gemma":[0.00007568085,0.0002307662,0.0001931456,0.001290615,0.0000439795,0.0008902167,0.0001303449,0.000155516,0.000102079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005563279,"about_ca_system_score_gemma":0.00008876844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004100798,"about_ca_topic_score_gemma":0.00002397984,"domain_scores_codex":[0.9979203,0.00006783369,0.0003138352,0.0008585282,0.0003927108,0.0004468073],"domain_scores_gemma":[0.9979088,0.0003587271,0.0001905037,0.001306767,0.00008672427,0.0001484964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001375708,0.0007950207,0.00005141616,0.00001036264,0.0002084154,0.00001403667,0.0001372801,0.0009125089,0.001149704,0.4646923,0.5021152,0.02977623],"study_design_scores_gemma":[0.001582834,0.0006823999,0.003271193,0.00006645783,0.0004413387,0.000008245001,0.00004963418,0.04996838,0.001734865,0.001169952,0.9401074,0.0009172869],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002278361,0.0000407484,0.9627268,0.01734375,0.001326346,0.001004257,0.01057923,0.0006742553,0.004026256],"genre_scores_gemma":[0.2136334,0.0001667455,0.7195568,0.01825145,0.01388954,0.000793485,0.03194483,0.00008483715,0.001678929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4635223,"threshold_uncertainty_score":0.9410374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}