{"meta":{"query_hash":"75a590b4c01a","filters":{"venue":"Journal of the Brazilian Computer Society"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/75a590b4c01a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+the+Brazilian+Computer+Society"},"results":[{"id":"W1996766943","doi":"10.1007/s13173-011-0032-8","title":"Detection of point landmarks in 3D medical images via phase congruency model","year":2011,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Philips (Canada); Princess Margaret Cancer Centre; University of Toronto","funders":"Universidade Federal de Uberlândia","keywords":"Phase congruency; Artificial intelligence; Computer science; Computer vision; Point (geometry); Pattern recognition (psychology); Feature (linguistics); Image (mathematics); Mathematics; Geometry","score_opus":0.015298963223126294,"score_gpt":0.2755091249199168,"score_spread":0.2602101616967905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996766943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01632576,0.00005527182,0.98224026,0.00062737963,0.00051881216,0.00011421795,0.0000011507582,0.000029629606,0.00008749921],"genre_scores_gemma":[0.48475835,0.000051936073,0.51379734,0.0012545661,0.00010706752,0.0000020288721,1.8809575e-7,0.000007794113,0.000020751353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800736,0.00017533377,0.0007378256,0.00016470355,0.00072699744,0.00018775978],"domain_scores_gemma":[0.9986351,0.000086537504,0.0005479515,0.00035270661,0.00022106954,0.00015664802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013840721,0.00012480174,0.0002745098,0.000074710784,0.00005394357,0.000032526077,0.001441927,0.00011803047,0.00004015655],"category_scores_gemma":[0.00006842985,0.00008449546,0.00030786174,0.0003053798,0.0001715387,0.00061695033,0.00034132577,0.00050354167,0.0000014371143],"study_design_candidate":"design_other","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.00007605974,0.0017263133,0.0015267585,0.00013703262,0.00020447468,0.00009781875,0.014877097,0.00025734518,0.03930183,0.00020423603,0.021503948,0.9200871],"study_design_scores_gemma":[0.002230556,0.00037971747,0.0028250332,0.00021298125,0.000018810417,0.00024946904,0.000040782765,0.827051,0.1627988,0.003993307,0.00003394731,0.00016561623],"about_ca_topic_score_codex":0.00002837036,"about_ca_topic_score_gemma":0.00000667528,"teacher_disagreement_score":0.91992146,"about_ca_system_score_codex":0.0000814111,"about_ca_system_score_gemma":0.00019389512,"threshold_uncertainty_score":0.3445625},"labels":[],"label_agreement":null},{"id":"W2112531565","doi":"10.1007/bf03192570","title":"Fast two-step segmentation of natural color scenes using hierarchical region-growing and a Color-Gradient Network","year":2008,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Westfälische Wilhelms-Universität Münster; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Artificial intelligence; Segmentation; Computer science; Computer vision; Ground truth; Image segmentation; Matching (statistics); Focus (optics); Bipartite graph; Pattern recognition (psychology); Graph; Mathematics; Theoretical computer science","score_opus":0.018417741920272335,"score_gpt":0.2702198995421865,"score_spread":0.25180215762191416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112531565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29889557,0.00047006854,0.69930154,0.00065639743,0.00051583746,0.00013008938,4.0541258e-7,0.000024050354,0.0000060549723],"genre_scores_gemma":[0.4492047,0.00014659781,0.5494804,0.00077948574,0.00036124617,6.783168e-7,1.9080846e-7,0.000008242087,0.00001843653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984809,0.00015353129,0.0005080072,0.00020525724,0.00039563922,0.0002566484],"domain_scores_gemma":[0.99864,0.00017289934,0.0005952727,0.0002619195,0.0002360684,0.00009384489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839526,0.00016240972,0.0003275536,0.00004326169,0.00038548512,0.00007493155,0.0007092601,0.000061203114,4.417675e-7],"category_scores_gemma":[0.000019832161,0.00011355492,0.00036100327,0.000467031,0.0002628407,0.000994668,0.00046117543,0.00042612615,1.6144936e-7],"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.0008531278,0.0012391041,0.08026446,0.00056745,0.0019885963,0.00075384707,0.034341406,0.08320656,0.112445936,0.01799271,0.084281184,0.58206564],"study_design_scores_gemma":[0.0022628831,0.0007464026,0.02511687,0.000724891,0.00007447713,0.0045454814,0.0001484103,0.94400746,0.017012209,0.003487405,0.0014124754,0.00046105683],"about_ca_topic_score_codex":0.0000055184764,"about_ca_topic_score_gemma":9.971507e-7,"teacher_disagreement_score":0.86080086,"about_ca_system_score_codex":0.00011354898,"about_ca_system_score_gemma":0.00012626007,"threshold_uncertainty_score":0.4630635},"labels":[],"label_agreement":null},{"id":"W2126602474","doi":"10.1007/bf03192393","title":"On synthesizing test cases in symbolic real-time testing","year":2006,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Test (biology); Symbolic execution; Formal specification; Test case; Programming language; Algorithm; Software","score_opus":0.018707792455028918,"score_gpt":0.25662419585911744,"score_spread":0.23791640340408854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126602474","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70196676,0.00008504799,0.29196566,0.0018415679,0.0016269733,0.000274084,0.0000027884641,0.00013253176,0.0021045802],"genre_scores_gemma":[0.3150121,0.0000058865485,0.6840558,0.0003773133,0.0004556092,0.0000013514114,1.1061326e-7,0.000012888549,0.00007892107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823296,0.00022774232,0.0006092638,0.00021566421,0.00042869768,0.00028565136],"domain_scores_gemma":[0.99687505,0.0017686324,0.00060480007,0.0005375499,0.00015722039,0.00005674332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418872,0.00016503982,0.00026264085,0.00007951623,0.0001896513,0.00018659732,0.0015154876,0.00008144884,0.0000024606838],"category_scores_gemma":[0.00043793948,0.00011865193,0.0002777735,0.0007422589,0.00007228081,0.0005002157,0.00025757702,0.0003975801,0.000013166412],"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.00008137045,0.0033967204,0.11016464,0.00037458548,0.00025809006,0.00062169833,0.0087326,0.12391207,0.08527526,0.07088083,0.104001164,0.49230096],"study_design_scores_gemma":[0.0006437974,0.00040102153,0.27133578,0.00075383805,0.000019294417,0.0011761303,0.000027577245,0.7087223,0.0068484982,0.009185894,0.000507063,0.00037881732],"about_ca_topic_score_codex":0.000042268937,"about_ca_topic_score_gemma":0.000002198662,"teacher_disagreement_score":0.5848102,"about_ca_system_score_codex":0.00021747724,"about_ca_system_score_gemma":0.000117842654,"threshold_uncertainty_score":0.48384854},"labels":[],"label_agreement":null},{"id":"W2127484779","doi":"10.1590/s0104-65002000000200004","title":"Missing and declining affordances: are these appropriate concepts?","year":2000,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Usability and User Interface Design","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Pontifícia Universidade Católica do Rio de Janeiro; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Affordance; Rhetoric; Framing (construction); Dimension (graph theory); Cognitive dimensions of notations; Computer science; Human–computer interaction; Cognition; Cognitive science; Psychology; Linguistics; Engineering","score_opus":0.019483515552903015,"score_gpt":0.264593819414717,"score_spread":0.24511030386181398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127484779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5129885,0.0006931483,0.47543088,0.00948929,0.0010568196,0.00013231926,0.0000014750041,0.000048871945,0.00015870965],"genre_scores_gemma":[0.7044399,0.00011390233,0.2913142,0.003353017,0.00050683075,9.525363e-7,7.204887e-8,0.000013359044,0.00025777548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984247,0.00021551801,0.0004870281,0.00025449548,0.00035459056,0.00026366932],"domain_scores_gemma":[0.9986031,0.00023499243,0.00042330148,0.00047516153,0.00013093562,0.00013248422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009774938,0.00017256317,0.00030720496,0.00001931702,0.0002561591,0.00040639588,0.0014905749,0.0000879529,0.00002780873],"category_scores_gemma":[0.000025249776,0.0001110349,0.00039955176,0.00023721837,0.00019790027,0.0007444764,0.000238154,0.000444103,0.0000074858763],"study_design_candidate":"design_other","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.00006838641,0.0002756243,0.011387414,0.0001232985,0.0003551265,0.000031430496,0.03938821,0.0047413846,0.00048636715,0.0006760375,0.022163069,0.92030364],"study_design_scores_gemma":[0.0042826985,0.0008804824,0.08487916,0.0020606176,0.0001394784,0.0016349566,0.0011656181,0.7380688,0.0048046443,0.044597734,0.11622494,0.00126088],"about_ca_topic_score_codex":0.0000036334961,"about_ca_topic_score_gemma":0.0000016439234,"teacher_disagreement_score":0.91904277,"about_ca_system_score_codex":0.0000520531,"about_ca_system_score_gemma":0.00008913107,"threshold_uncertainty_score":0.45278716},"labels":[],"label_agreement":null},{"id":"W2152272083","doi":"10.1007/s13173-012-0064-8","title":"Gene clusters as intersections of powers of paths","year":2012,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Graph; Induced subgraph; Path (computing); Intersection (aeronautics); Mathematics; Genome; Set (abstract data type); Computer science; Discrete mathematics; Gene; Biology; Genetics; Vertex (graph theory)","score_opus":0.007209846335613205,"score_gpt":0.23459485128222765,"score_spread":0.22738500494661446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152272083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848185,0.0005302243,0.012899899,0.00028215727,0.0012653926,0.00007958674,0.0000063068937,0.0000015763342,0.00011636456],"genre_scores_gemma":[0.9870451,0.00008537914,0.011964057,0.00024656105,0.000508065,4.6641182e-7,0.0000017498213,0.000010934485,0.00013770322],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992374,0.000056427587,0.0003137369,0.00007058964,0.00017556445,0.00014626337],"domain_scores_gemma":[0.9991322,0.000010493314,0.00040214421,0.00022917111,0.00015949603,0.00006650318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030275498,0.00008813916,0.00015739189,0.0000213398,0.000037808,0.0000065044987,0.0003324762,0.00007701108,0.000012729665],"category_scores_gemma":[0.000011132009,0.0000637857,0.000544654,0.00008922325,0.00009595143,0.000008816027,0.00018806999,0.00011310769,0.0000013153598],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000084538035,0.00045987335,0.03937242,0.0000992169,0.0013621126,0.0000010312463,0.0047925157,0.0010505794,0.89795876,0.0000155922,0.046240285,0.008563058],"study_design_scores_gemma":[0.0031707329,0.0018576187,0.102390215,0.00019320766,0.00034708847,0.00049082213,0.0022718678,0.0009910848,0.8553307,0.00010527827,0.03237296,0.00047844762],"about_ca_topic_score_codex":0.0000032519008,"about_ca_topic_score_gemma":9.1284664e-7,"teacher_disagreement_score":0.06301779,"about_ca_system_score_codex":0.000023624945,"about_ca_system_score_gemma":0.00005282083,"threshold_uncertainty_score":0.26011056},"labels":[],"label_agreement":null},{"id":"W2162059435","doi":"10.1186/s13173-015-0036-x","title":"Complexity of greedy edge-colouring","year":2015,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Graph; Time complexity; Enhanced Data Rates for GSM Evolution; Mathematics; Greedy algorithm; Computer science; Index (typography); Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.06586970787758335,"score_gpt":0.3041930945483636,"score_spread":0.23832338667078024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162059435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12596817,0.0002618649,0.8667779,0.004308477,0.0020777727,0.0001734712,0.0000026026232,0.000037715763,0.0003919916],"genre_scores_gemma":[0.6270435,0.000012588186,0.3716255,0.0006395949,0.00049527094,9.2127937e-7,1.4517032e-7,0.000015303867,0.00016719308],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772906,0.00028639266,0.00056140084,0.0001969978,0.0008976111,0.000328539],"domain_scores_gemma":[0.9974017,0.00016701157,0.00063450035,0.00076451065,0.00078698096,0.00024526435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018427075,0.00015556489,0.00035944403,0.0000703507,0.00015221769,0.000098901146,0.003427236,0.00007173292,0.00000425613],"category_scores_gemma":[0.000077603734,0.00010574429,0.00062705955,0.0006876463,0.0004938906,0.00073274085,0.001324732,0.00055619085,0.000006415505],"study_design_candidate":"theoretical_or_conceptual","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.00041345364,0.0021952426,0.04485457,0.00048678124,0.0019834044,0.00016870988,0.04860376,0.044455376,0.0073166504,0.29701817,0.38467315,0.16783074],"study_design_scores_gemma":[0.0062270314,0.0016496757,0.06697452,0.00053279434,0.000068906375,0.0014255648,0.00059351994,0.31117946,0.016136866,0.57836545,0.015959386,0.000886851],"about_ca_topic_score_codex":0.000004321894,"about_ca_topic_score_gemma":0.0000020013726,"teacher_disagreement_score":0.5010753,"about_ca_system_score_codex":0.00013919063,"about_ca_system_score_gemma":0.00030143163,"threshold_uncertainty_score":0.63687146},"labels":[],"label_agreement":null},{"id":"W2165184089","doi":"10.1007/bf03192360","title":"Local DNA sequence alignment in a cluster of workstations: Algorithms and tools","year":2004,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Heuristics; Parallel computing; Workstation; Scope (computer science); Software; Sequence (biology); Scalability; Overhead (engineering); Shared memory; Distributed memory; Distributed shared memory; Synchronization (alternating current); Distributed computing; Memory management; Overlay; Programming language; Uniform memory access; Operating system","score_opus":0.014531858182991056,"score_gpt":0.2467798767154686,"score_spread":0.23224801853247756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165184089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492091,0.0007105994,0.04868145,0.0011200161,0.00018072272,0.000080747806,0.000005552309,3.4013738e-7,0.000011500923],"genre_scores_gemma":[0.9727653,0.00036848936,0.026098836,0.0006360562,0.000112587,0.0000011036794,6.035425e-7,0.000004880364,0.00001210728],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9994491,0.000027995953,0.00024559395,0.00008997118,0.00009395622,0.00009341915],"domain_scores_gemma":[0.99962527,0.000014002011,0.00015379941,0.000114361705,0.00006326515,0.000029332823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001931843,0.00007163807,0.00012184154,0.000009680994,0.000037594167,0.000017393557,0.0001597118,0.00005163052,4.8313876e-7],"category_scores_gemma":[0.000007192734,0.000050641098,0.0001363634,0.00005312529,0.00011868483,0.0000024687142,0.00014568456,0.00007487137,1.1762539e-7],"study_design_candidate":"bench_or_experimental","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.00025632468,0.00077670615,0.024298415,0.00022101302,0.0016096428,0.000019646914,0.015206967,0.228097,0.5269219,0.0005643854,0.009954748,0.19207321],"study_design_scores_gemma":[0.016749835,0.0031608953,0.6581235,0.0011383746,0.00025722975,0.0009732333,0.004578344,0.012917874,0.26637557,0.012956196,0.021488441,0.0012805001],"about_ca_topic_score_codex":0.0000054574225,"about_ca_topic_score_gemma":0.0000073153433,"teacher_disagreement_score":0.63382506,"about_ca_system_score_codex":0.000027331687,"about_ca_system_score_gemma":0.00006937994,"threshold_uncertainty_score":0.2065084},"labels":[],"label_agreement":null},{"id":"W3048392083","doi":"10.1186/s13173-020-00100-8","title":"MylynSDP — Process - aware artifact filtering based on interest","year":2020,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Artifact (error); Software engineering; Software development; Software; Function (biology); Plug-in; Process (computing); Task (project management); Context (archaeology); Software development process; Goal-Driven Software Development Process; Programming language; Artificial intelligence; Systems engineering; Engineering","score_opus":0.03342834874107232,"score_gpt":0.2720713729770696,"score_spread":0.23864302423599731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048392083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09289732,0.00002111577,0.8891888,0.016608633,0.0010264305,0.000120771256,0.0000020608745,0.00011829216,0.000016533699],"genre_scores_gemma":[0.9589603,0.0000021681865,0.0358311,0.004497213,0.0006695918,0.0000017970265,2.4714612e-7,0.000021270236,0.00001632663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.000086225926,0.00038033575,0.0002692216,0.0006626735,0.00031862117],"domain_scores_gemma":[0.99838537,0.00042663267,0.0002303616,0.0005016161,0.00020273068,0.0002533152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040851813,0.0001901233,0.00025137252,0.00004556467,0.00014079687,0.00030176685,0.0027659794,0.00007077812,0.000017159324],"category_scores_gemma":[0.00017812465,0.00013157935,0.0004914231,0.00058117864,0.000052565687,0.00040053844,0.00045762231,0.00078678905,0.000022093654],"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.00015544391,0.0005981434,0.02801429,0.00094671885,0.00055027223,0.0003055907,0.01580492,0.63636285,0.002621378,0.00032194555,0.2133738,0.10094466],"study_design_scores_gemma":[0.0006168617,0.0003995392,0.016099526,0.0002795954,0.000007625237,0.000052518848,0.000025604239,0.97477984,0.004379926,0.00007973978,0.0030697477,0.00020945488],"about_ca_topic_score_codex":6.650751e-7,"about_ca_topic_score_gemma":2.1290643e-7,"teacher_disagreement_score":0.86606294,"about_ca_system_score_codex":0.000108355416,"about_ca_system_score_gemma":0.00020860256,"threshold_uncertainty_score":0.53656507},"labels":[],"label_agreement":null},{"id":"W4252361136","doi":"10.1590/s0104-65002008000400004","title":"Fast two-step segmentation of natural color scenes using hierarchical region-growing and a color-gradient network","year":2008,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Westfälische Wilhelms-Universität Münster; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Artificial intelligence; Segmentation; Computer science; Ground truth; Computer vision; Image segmentation; Matching (statistics); Focus (optics); Bipartite graph; Pattern recognition (psychology); Graph; Mathematics; Theoretical computer science","score_opus":0.018417741920272335,"score_gpt":0.2702198995421865,"score_spread":0.25180215762191416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252361136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29889557,0.00047006854,0.69930154,0.00065639743,0.00051583746,0.00013008938,4.0541258e-7,0.000024050354,0.0000060549723],"genre_scores_gemma":[0.4492047,0.00014659781,0.5494804,0.00077948574,0.00036124617,6.783168e-7,1.9080846e-7,0.000008242087,0.00001843653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984809,0.00015353129,0.0005080072,0.00020525724,0.00039563922,0.0002566484],"domain_scores_gemma":[0.99864,0.00017289934,0.0005952727,0.0002619195,0.0002360684,0.00009384489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003839526,0.00016240972,0.0003275536,0.00004326169,0.00038548512,0.00007493155,0.0007092601,0.000061203114,4.417675e-7],"category_scores_gemma":[0.000019832161,0.00011355492,0.00036100327,0.000467031,0.0002628407,0.000994668,0.00046117543,0.00042612615,1.6144936e-7],"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.0008531278,0.0012391041,0.08026446,0.00056745,0.0019885963,0.00075384707,0.034341406,0.08320656,0.112445936,0.01799271,0.084281184,0.58206564],"study_design_scores_gemma":[0.0022628831,0.0007464026,0.02511687,0.000724891,0.00007447713,0.0045454814,0.0001484103,0.94400746,0.017012209,0.003487405,0.0014124754,0.00046105683],"about_ca_topic_score_codex":0.0000055184764,"about_ca_topic_score_gemma":9.971507e-7,"teacher_disagreement_score":0.86080086,"about_ca_system_score_codex":0.00011354898,"about_ca_system_score_gemma":0.00012626007,"threshold_uncertainty_score":0.4630635},"labels":[],"label_agreement":null},{"id":"W4401478512","doi":"10.5753/jbcs.2024.3966","title":"Catastrophic Forgetting in Deep Learning: A Comprehensive Taxonomy","year":2024,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":37,"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":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Institute for Catastrophic Loss Reduction","keywords":"Forgetting; Taxonomy (biology); Computer science; Artificial intelligence; Natural language processing; Psychology; Cognitive psychology; Biology; Ecology","score_opus":0.018465004560146547,"score_gpt":0.23907906175264582,"score_spread":0.22061405719249927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401478512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025145495,0.0012089221,0.96743417,0.003760982,0.002020755,0.0001534409,3.8702132e-7,0.00007788283,0.00019797382],"genre_scores_gemma":[0.7500568,0.000053985223,0.2474745,0.0014754642,0.0006492432,0.000004390715,6.257887e-7,0.000021365444,0.0002636325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983208,0.00023109872,0.00051388174,0.00024515565,0.00038860211,0.0003004577],"domain_scores_gemma":[0.9989289,0.00028002917,0.00028899606,0.00026401642,0.00013631527,0.00010172825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065000914,0.00016488397,0.00024828606,0.00010560444,0.00019750923,0.0004752272,0.001171182,0.000070438626,0.000009385146],"category_scores_gemma":[0.00002786058,0.000120149256,0.0005052258,0.00071231165,0.00006980754,0.00064700155,0.00040816027,0.0010944175,0.000018849698],"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.000019405432,0.00014555528,0.0070053916,0.00023158563,0.00039520295,0.0002951045,0.024061065,0.16952781,0.0009462604,0.008773265,0.02587232,0.762727],"study_design_scores_gemma":[0.00045229736,0.00009026202,0.011434874,0.00026062183,0.000010825267,0.00032452858,0.00035618286,0.7918136,0.000047538997,0.00047780867,0.19456959,0.00016188304],"about_ca_topic_score_codex":0.0000040735003,"about_ca_topic_score_gemma":0.000002150675,"teacher_disagreement_score":0.76256514,"about_ca_system_score_codex":0.00015029265,"about_ca_system_score_gemma":0.0001632869,"threshold_uncertainty_score":0.48995444},"labels":[],"label_agreement":null},{"id":"W4415203880","doi":"10.5753/jbcs.2025.5815","title":"Cross-Lingual Keyword Extraction for Pesticide Terminology in Brazilian Portuguese and English","year":2025,"lang":"en","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Advanced Text Analysis Techniques","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":false,"ca_institutions":"Université du Québec en Outaouais; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Universität St. Gallen","keywords":"Terminology; Portuguese; Standardization; Brazilian Portuguese; Pesticide; Representation (politics)","score_opus":0.009630347366461907,"score_gpt":0.3190914924121837,"score_spread":0.3094611450457218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415203880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21976334,0.00041681775,0.7767258,0.0014072104,0.0013176379,0.00021296008,0.0000014558364,0.00006619469,0.000088584326],"genre_scores_gemma":[0.5698844,0.00013690544,0.42695937,0.0019627542,0.00054939714,0.000009343791,7.774648e-7,0.00001554609,0.000481457],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99828506,0.000098124474,0.00073251594,0.00033894036,0.00023208797,0.0003132977],"domain_scores_gemma":[0.998043,0.0004086782,0.0005489247,0.00049019576,0.00043534607,0.00007387959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088195276,0.00019553187,0.00040304218,0.00017053926,0.00018319878,0.00019557706,0.0012932603,0.00016537677,0.0000017992027],"category_scores_gemma":[0.00019477341,0.00015217043,0.00045908516,0.0005463079,0.00018236718,0.0008415558,0.00047682712,0.00052896264,3.2812375e-7],"study_design_candidate":"design_other","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.0000817802,0.00036768976,0.06570276,0.00013910464,0.0003328516,0.000051423594,0.004887884,0.0022718706,0.0020547796,0.006942989,0.015952652,0.90121424],"study_design_scores_gemma":[0.0034616143,0.00049285026,0.7348248,0.0005655421,0.00014313852,0.00031751554,0.00020149414,0.15247568,0.009506484,0.059225745,0.03809747,0.0006876599],"about_ca_topic_score_codex":0.000006306098,"about_ca_topic_score_gemma":0.000017268212,"teacher_disagreement_score":0.9005266,"about_ca_system_score_codex":0.00016078459,"about_ca_system_score_gemma":0.00019808761,"threshold_uncertainty_score":0.620533},"labels":[],"label_agreement":null},{"id":"W4415881819","doi":"10.5753/jbcs.2025.5525","title":"Fake News Detection in Portuguese Under Large Language Model-Generated Content","year":2025,"lang":"","type":"article","venue":"Journal of the Brazilian Computer Society","topic":"Misinformation and Its Impacts","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministério da Ciência, Tecnologia e Inovação; Universidade de São Paulo; Fundação de Amparo à Pesquisa do Estado de São Paulo; International Business Machines Corporation","keywords":"Fake news; Language model; Social media; Portuguese; Sample (material); Content (measure theory); Deep learning","score_opus":0.02797824289358833,"score_gpt":0.2982061176617501,"score_spread":0.2702278747681618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415881819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7565379,0.0011505251,0.21943007,0.014011503,0.005813451,0.0005001347,0.000018745572,0.00002762646,0.002510007],"genre_scores_gemma":[0.98102427,0.00064807653,0.0011518591,0.012328317,0.0005293999,4.7216352e-7,0.0000011877902,0.000011001624,0.0043054204],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709696,0.00040857037,0.0011300363,0.00017114903,0.0006970629,0.0004962102],"domain_scores_gemma":[0.9981448,0.000081468395,0.0008890928,0.0002975747,0.00038154767,0.00020548483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013287,0.00023503928,0.00042543805,0.00012858167,0.000517946,0.00028659793,0.00075004576,0.00029401915,0.00008819741],"category_scores_gemma":[0.000091196736,0.00016987385,0.00079722895,0.0011548614,0.00015533915,0.0008394758,0.00021007202,0.00082925416,0.000008615783],"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.00026235075,0.0012768734,0.0017094426,0.0002503505,0.0010802436,0.000018953813,0.47288844,0.10223091,0.0033882156,0.004636925,0.17392986,0.23832743],"study_design_scores_gemma":[0.0044261664,0.00014397883,0.029394764,0.0007178955,0.00012990186,0.000023517221,0.06964148,0.88530993,0.0016884912,0.0009128784,0.0071965726,0.00041444265],"about_ca_topic_score_codex":0.0002164078,"about_ca_topic_score_gemma":0.0015191397,"teacher_disagreement_score":0.783079,"about_ca_system_score_codex":0.00063125824,"about_ca_system_score_gemma":0.0009547041,"threshold_uncertainty_score":0.6927254},"labels":[],"label_agreement":null}]}