{"meta":{"query_hash":"d1d6321d76d1","filters":{"venue":"Brazilian Symposium on Databases"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/d1d6321d76d1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Brazilian+Symposium+on+Databases"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Computer science; Database; Presentation (obstetrics); Latin Americans; Library science; World Wide Web; Political science; Geography","score_opus":0.025971609493490564,"score_gpt":0.259488498731684,"score_spread":0.23351688923819344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913175468","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065170466,0.22860412,0.10386843,0.04863131,0.08629588,0.0012274263,0.013941383,0.0062442673,0.5046701],"genre_scores_gemma":[0.042736683,0.12772404,0.09946937,0.011455017,0.024342211,0.00080123596,0.03010294,0.003604544,0.659764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99420184,0.0012718701,0.0008201405,0.00084477366,0.0024731096,0.00038825578],"domain_scores_gemma":[0.99193317,0.0013143151,0.00031619283,0.0017084894,0.0037037737,0.0010241433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059218467,0.0012762989,0.002202962,0.003627789,0.001738756,0.0105737755,0.0026282694,0.002280479,0.10755782],"category_scores_gemma":[0.01051654,0.000760025,0.0018190987,0.0040127835,0.0013101221,0.006617546,0.0044489307,0.0040263315,0.06425944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00014770842,0.00008846963,0.0011023604,0.0007848435,0.00009831586,0.00020582088,0.0003945282,0.0003624594,0.0026469028,0.032018945,0.7097315,0.25241804],"study_design_scores_gemma":[0.0000047579074,0.000014304199,0.0002529864,0.0001492795,0.00001372373,0.00012914852,0.000060534672,0.00025221915,0.00024956214,0.0022920358,0.9965731,0.000008286304],"about_ca_topic_score_codex":0.0060133664,"about_ca_topic_score_gemma":0.0051019792,"teacher_disagreement_score":0.10755782,"about_ca_system_score_codex":0.002656246,"about_ca_system_score_gemma":0.0049218494,"threshold_uncertainty_score":0.35981673},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07017860466193648,"score_gpt":0.282689483014899,"score_spread":0.2125108783529625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30283385","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.01434127,0.00039031805,0.98101586,0.00032852,0.000047148897,0.00021282308,0.000872975,0.00172272,0.0010683245],"genre_scores_gemma":[0.09193062,0.00029542943,0.9040697,0.00012522266,0.000061972045,0.0003284849,0.0020068728,0.0002686137,0.0009131523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975963,0.0007857338,0.00020069392,0.00064755266,0.0005110662,0.0002585678],"domain_scores_gemma":[0.9899829,0.006064015,0.0007786609,0.0016439635,0.0011549775,0.00037548138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030383493,0.0017399184,0.0023294673,0.004536993,0.0011854605,0.0028458526,0.0046791034,0.0013870635,0.0047800904],"category_scores_gemma":[0.016031343,0.0016224904,0.002963739,0.0067525846,0.0018975602,0.004383706,0.0046028644,0.001737055,0.0009806836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00067787396,0.0002832531,0.011384486,0.001071194,0.0006102443,0.0006305142,0.0008497443,0.55305505,0.004188432,0.04875606,0.007961215,0.370532],"study_design_scores_gemma":[0.000057487818,0.00009457661,0.0008800579,0.000048284972,0.000079445395,0.00009165892,0.00022781175,0.9281982,0.00081589917,0.06596818,0.0035112977,0.000027096989],"about_ca_topic_score_codex":0.027274929,"about_ca_topic_score_gemma":0.045972954,"teacher_disagreement_score":0.027274929,"about_ca_system_score_codex":0.001459453,"about_ca_system_score_gemma":0.0031243984,"threshold_uncertainty_score":0.05423236},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Order (exchange); Information retrieval; Keyword search","score_opus":0.045043638085699285,"score_gpt":0.2636945420906061,"score_spread":0.21865090400490683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30607122","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.28332922,0.013767111,0.52237874,0.0077296603,0.00042108097,0.0022536025,0.09068899,0.01833679,0.061094828],"genre_scores_gemma":[0.66570276,0.0028219684,0.2781681,0.00088674686,0.00019723458,0.00039730172,0.031616095,0.0005003404,0.019709462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978078,0.00062756863,0.0002662272,0.0003871971,0.0006251882,0.00028605407],"domain_scores_gemma":[0.9950723,0.00315233,0.00028077458,0.0008499983,0.00037532538,0.00026925944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020761539,0.00078521756,0.0020795036,0.002586558,0.0010509478,0.0020148666,0.0014840792,0.001422794,0.015560935],"category_scores_gemma":[0.011374061,0.0005850111,0.0011566635,0.005516102,0.0005907208,0.0056152525,0.0018853166,0.0006772875,0.004241438],"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.003864278,0.00069647183,0.011817052,0.0029207931,0.00058259413,0.0012977057,0.0011033806,0.08863694,0.0073374445,0.059590884,0.1329765,0.68917584],"study_design_scores_gemma":[0.00070693914,0.0006518217,0.0054655485,0.00019347321,0.0004468534,0.0027055573,0.0013680169,0.62588894,0.0074569806,0.28050226,0.07443476,0.00017880845],"about_ca_topic_score_codex":0.02133489,"about_ca_topic_score_gemma":0.059941277,"teacher_disagreement_score":0.02133489,"about_ca_system_score_codex":0.0017885937,"about_ca_system_score_gemma":0.0036651168,"threshold_uncertainty_score":0.05205649},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03519003957862123,"score_gpt":0.31631496417117805,"score_spread":0.28112492459255684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88109437","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.0032367434,0.29992893,0.47623628,0.037786514,0.010786117,0.0006202356,0.006836742,0.007814896,0.15675353],"genre_scores_gemma":[0.025022024,0.3257626,0.41458997,0.0217528,0.017579176,0.0018512957,0.012622501,0.002850481,0.17796911],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918896,0.00032123865,0.00007547244,0.00009529417,0.00026006912,0.000059019752],"domain_scores_gemma":[0.9969194,0.0022932664,0.000115866984,0.00012487234,0.00035884898,0.00018765985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015854179,0.0018128314,0.0010286523,0.004326598,0.00081938773,0.002769464,0.0012967933,0.0021031396,0.04737416],"category_scores_gemma":[0.0065610535,0.0007522208,0.0009775572,0.0060641714,0.000713609,0.008258161,0.0019043828,0.0022851797,0.026109178],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000025028661,0.00010045665,0.0004946215,0.0013746558,0.00004084007,0.00028822554,0.0006925737,0.0013484001,0.0012661562,0.06636751,0.6867603,0.24124123],"study_design_scores_gemma":[0.000007181883,0.000023283064,0.0004913235,0.0004125623,0.00001274051,0.0006081454,0.00025099923,0.001894837,0.00016513605,0.055674516,0.94044346,0.00001574738],"about_ca_topic_score_codex":0.001066645,"about_ca_topic_score_gemma":0.0019751827,"teacher_disagreement_score":0.04737416,"about_ca_system_score_codex":0.0010061978,"about_ca_system_score_gemma":0.0010586476,"threshold_uncertainty_score":0.15848237},"labels":[],"label_agreement":null}]}