{"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":"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.0076091327,0.00007737654,0.9917814,0.00003653385,0.000008236591,0.00001887213,0.000025545634,0.00021567897,0.00022725623],"genre_scores_gemma":[0.28418416,0.0004539956,0.71410775,0.00007711123,0.000042272088,0.00012240178,0.00015450179,0.00012133741,0.000736473],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995042,0.00012977466,0.000024927356,0.0000958281,0.0002169734,0.000028306262],"domain_scores_gemma":[0.99952006,0.00023965644,0.00008722807,0.00006269921,0.000071948234,0.000018397794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065053743,0.00041097958,0.0005211239,0.0016366739,0.00017912478,0.00093481963,0.00063998724,0.0008655409,0.00094284554],"category_scores_gemma":[0.0022876086,0.0003954355,0.00068603776,0.0011168864,0.0006871187,0.0007771434,0.00075444195,0.00048257987,0.00064284174],"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.00049860834,0.00008636675,0.0030524307,0.00035053203,0.000136851,0.0006644692,0.00025725056,0.20241834,0.300547,0.020831168,0.0018098035,0.46934727],"study_design_scores_gemma":[0.000020755331,0.00011922759,0.002497102,0.000023036982,0.000043444325,0.0008777447,0.000039069346,0.9377669,0.0490449,0.0066143465,0.0029120448,0.00004134061],"about_ca_topic_score_codex":0.00072839047,"about_ca_topic_score_gemma":0.0005100593,"teacher_disagreement_score":0.0016366739,"about_ca_system_score_codex":0.00030134752,"about_ca_system_score_gemma":0.00046160497,"threshold_uncertainty_score":0.0034404397},"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":"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.12716159,0.00055946043,0.86333746,0.00011408775,0.00005134409,0.00027933528,0.0003416254,0.0056003937,0.0025547647],"genre_scores_gemma":[0.21265337,0.00019546707,0.7848235,0.000045191875,0.000014512346,0.00009356556,0.00052782026,0.00033845747,0.0013081094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945337,0.00011173379,0.000030534145,0.00016328054,0.00017729125,0.000063772466],"domain_scores_gemma":[0.99904615,0.0004851082,0.000071727685,0.00012884328,0.00020625396,0.00006195981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010926448,0.0010412292,0.00079188234,0.0020490813,0.00042255782,0.00084940385,0.0012598453,0.0010003143,0.0022126292],"category_scores_gemma":[0.0019456327,0.00037560577,0.0006249772,0.0013339816,0.00036133334,0.0012366417,0.0006470689,0.0004657886,0.00074517884],"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.0012908472,0.00032147896,0.0032180564,0.0004668175,0.00024176901,0.0002186604,0.00024792028,0.16548063,0.19073,0.0026281157,0.0024423345,0.63271344],"study_design_scores_gemma":[0.000026458862,0.00011024357,0.0017255656,0.000009381084,0.00004222654,0.00017123994,0.000048927475,0.9406875,0.055348154,0.0009492889,0.00085641525,0.000024653576],"about_ca_topic_score_codex":0.0092076035,"about_ca_topic_score_gemma":0.013008768,"teacher_disagreement_score":0.0092076035,"about_ca_system_score_codex":0.0008143454,"about_ca_system_score_gemma":0.0007622583,"threshold_uncertainty_score":0.018308043},"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":"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.02929065,0.00013330765,0.96536404,0.00015782361,0.000040383446,0.00018425215,0.000050048853,0.0012259355,0.003553484],"genre_scores_gemma":[0.3378244,0.00022614516,0.659596,0.00009850799,0.000023482846,0.00030824848,0.00022226955,0.00033857653,0.001362357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396163,0.002938485,0.00042547646,0.00045688095,0.0019477038,0.0002697187],"domain_scores_gemma":[0.97811925,0.018046035,0.0009916248,0.0015813932,0.0010664809,0.00019531333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034191501,0.0010246983,0.0007189137,0.0014412414,0.00039325864,0.0012324889,0.0013428426,0.0010160413,0.0034689016],"category_scores_gemma":[0.020333968,0.00051710854,0.00097047846,0.0008427207,0.002687552,0.0013256314,0.0012886635,0.0011525634,0.00043585215],"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.00046496693,0.00040633374,0.0025198855,0.0014008431,0.00013329246,0.0024731846,0.0016040471,0.37007156,0.06394895,0.25644284,0.0015920919,0.29894197],"study_design_scores_gemma":[0.000290099,0.00053325284,0.0004544211,0.00031048435,0.00013142222,0.0007119994,0.00022872206,0.7795263,0.10315093,0.100452416,0.014154347,0.0000556152],"about_ca_topic_score_codex":0.001137638,"about_ca_topic_score_gemma":0.0011548976,"teacher_disagreement_score":0.0034689016,"about_ca_system_score_codex":0.0008257232,"about_ca_system_score_gemma":0.0012571358,"threshold_uncertainty_score":0.01808238},"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":"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.15160619,0.03981474,0.5331065,0.08301186,0.0027490319,0.00044025344,0.0004143113,0.00069074915,0.1881664],"genre_scores_gemma":[0.93337244,0.0050240736,0.05322391,0.0025050347,0.00050590275,0.0004252651,0.00012450595,0.00025425002,0.0045646527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091256,0.004656487,0.00071401295,0.0013182677,0.0017832502,0.0006153927],"domain_scores_gemma":[0.98278886,0.009365605,0.0021236122,0.0023037859,0.002329864,0.0010882599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008679789,0.0014486939,0.0012887273,0.0037922538,0.0031253623,0.007978697,0.0026319819,0.004444635,0.0063613425],"category_scores_gemma":[0.040301662,0.00086859445,0.0010867863,0.003128429,0.055130415,0.056805518,0.007648635,0.006488589,0.00081512984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00008888456,0.000028307713,0.001467348,0.00044177374,0.000013282687,0.000212742,0.04683917,0.0001400733,0.00067417277,0.92116475,0.0012803114,0.027649228],"study_design_scores_gemma":[0.00003092948,0.00007904547,0.0017196293,0.00069925503,0.000026343254,0.00086276996,0.038231317,0.0008787501,0.00047758478,0.91415757,0.0427723,0.00006451048],"about_ca_topic_score_codex":0.002452139,"about_ca_topic_score_gemma":0.0017954945,"teacher_disagreement_score":0.008679789,"about_ca_system_score_codex":0.0024996747,"about_ca_system_score_gemma":0.002168251,"threshold_uncertainty_score":0.045903683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5867534,0.0003672465,0.39868712,0.0005969379,0.000039514736,0.00043882325,0.00074020395,0.00080665847,0.01157012],"genre_scores_gemma":[0.66196436,0.0002396224,0.3295196,0.00009906753,0.00003749419,0.00021777143,0.0013286982,0.00028524935,0.006308254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988167,0.00022121199,0.00007565883,0.00041399262,0.00032639274,0.00014609622],"domain_scores_gemma":[0.9955389,0.0025363332,0.0007048505,0.00055182603,0.0004008801,0.00026715448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082586595,0.00040746006,0.00061118964,0.0018824474,0.0009402976,0.0013197535,0.0010410988,0.0005305083,0.0060051926],"category_scores_gemma":[0.006705629,0.00063265255,0.0006986311,0.0018764962,0.0014553394,0.0028864215,0.0017730513,0.0009865655,0.0005679701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0014718068,0.00030177605,0.02880883,0.0007288276,0.00015781721,0.0014108367,0.0029940633,0.15833652,0.06351815,0.4961897,0.007270286,0.23881134],"study_design_scores_gemma":[0.00011071766,0.00020340667,0.0053470293,0.00010516421,0.00007498164,0.0009872812,0.00097509765,0.40385294,0.031018697,0.53794605,0.019322239,0.000056392164],"about_ca_topic_score_codex":0.001493217,"about_ca_topic_score_gemma":0.0014678856,"teacher_disagreement_score":0.0060051926,"about_ca_system_score_codex":0.0009957232,"about_ca_system_score_gemma":0.0006091209,"threshold_uncertainty_score":0.020089388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69304645,0.0011755374,0.24434693,0.007785218,0.0001907704,0.0009892919,0.007495362,0.0053104474,0.039659955],"genre_scores_gemma":[0.82284486,0.00071473455,0.15970708,0.00077952305,0.00010135999,0.00041565084,0.0064145764,0.0007891618,0.0082330275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708456,0.0005865966,0.00017877805,0.00082937925,0.0005866374,0.0007341708],"domain_scores_gemma":[0.98960555,0.007674724,0.00064320525,0.001234779,0.00036407853,0.0004777774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013069821,0.0012257152,0.0023199618,0.000972523,0.0019460752,0.0053698397,0.0036816332,0.0025554078,0.0143012395],"category_scores_gemma":[0.009666537,0.000884863,0.002505294,0.0025708864,0.0017327615,0.0059211818,0.0035144764,0.0019002307,0.002033311],"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.0026862144,0.00095061515,0.012645413,0.0023193555,0.00046777356,0.0012503207,0.0017509161,0.53290147,0.038337033,0.12405846,0.04850827,0.23412415],"study_design_scores_gemma":[0.00049919717,0.000155365,0.0030271604,0.000071945804,0.00019708951,0.0006526997,0.0007188217,0.72752047,0.008336406,0.25381315,0.0049391286,0.00006852597],"about_ca_topic_score_codex":0.009402671,"about_ca_topic_score_gemma":0.0074523464,"teacher_disagreement_score":0.0143012395,"about_ca_system_score_codex":0.003407645,"about_ca_system_score_gemma":0.003611875,"threshold_uncertainty_score":0.047842443},"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":"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.04752322,0.00018494242,0.94094694,0.00014404608,0.000016606826,0.0001336154,0.00013568226,0.009491899,0.0014230438],"genre_scores_gemma":[0.16871893,0.00010269363,0.82902855,0.000027995413,0.000012488496,0.0002324686,0.0004125376,0.00029506165,0.001169326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.00022765141,0.000056601777,0.00016396819,0.00015607697,0.00006461395],"domain_scores_gemma":[0.9991449,0.00040592407,0.000092065275,0.00012418652,0.00016003512,0.000072827475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010899538,0.00075339805,0.0007958448,0.001388723,0.001062241,0.0012474706,0.001671697,0.00076249655,0.0027818352],"category_scores_gemma":[0.0030647889,0.00054883905,0.00052768085,0.0021880285,0.00061874965,0.0012336317,0.0011322043,0.0007380983,0.001343296],"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.00077417766,0.00038050467,0.006921517,0.00045922803,0.00011510597,0.0005214789,0.00068308524,0.43684646,0.032797858,0.022187576,0.007404846,0.49090815],"study_design_scores_gemma":[0.00006377587,0.00004371296,0.000634295,0.000012030342,0.0000119426995,0.000050251543,0.00008576615,0.9843066,0.0047674333,0.008481077,0.0015332471,0.000009778128],"about_ca_topic_score_codex":0.006777778,"about_ca_topic_score_gemma":0.0048796157,"teacher_disagreement_score":0.006777778,"about_ca_system_score_codex":0.0009122125,"about_ca_system_score_gemma":0.0013709749,"threshold_uncertainty_score":0.01347661},"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":"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.14705797,0.00059346296,0.8233276,0.00029551628,0.00006823411,0.0005725093,0.0008741749,0.023974186,0.003236336],"genre_scores_gemma":[0.6257312,0.00024299209,0.36695588,0.00013562481,0.00004743186,0.00039155182,0.0021577843,0.0006697892,0.0036677716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783844,0.00039393787,0.00017207589,0.0006191165,0.0008453804,0.00013101783],"domain_scores_gemma":[0.9939255,0.0026572503,0.00085987174,0.0009181447,0.0011991424,0.00044010484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002226835,0.0010499456,0.0007730644,0.0032403173,0.0004863175,0.0017133736,0.0013590292,0.0006282542,0.0018741051],"category_scores_gemma":[0.007980159,0.00049184,0.00092958286,0.0014358398,0.00036973305,0.0024670654,0.0025604104,0.0008174248,0.00094717444],"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.0013249328,0.0010609879,0.04775524,0.0009366445,0.00015002427,0.0006592409,0.0017407361,0.0059563387,0.062285688,0.0041375556,0.0082313055,0.8657613],"study_design_scores_gemma":[0.00037000206,0.0022102536,0.13651559,0.00032575088,0.0005351975,0.0020444323,0.0014080339,0.62867707,0.15637472,0.0149144055,0.056300763,0.0003238756],"about_ca_topic_score_codex":0.0016600601,"about_ca_topic_score_gemma":0.0019786714,"teacher_disagreement_score":0.0032403173,"about_ca_system_score_codex":0.0005429692,"about_ca_system_score_gemma":0.00076059165,"threshold_uncertainty_score":0.011776745},"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":"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.09687876,0.0006310056,0.89323837,0.0001120953,0.000060299266,0.00029853394,0.00034578567,0.00587289,0.002562267],"genre_scores_gemma":[0.16049239,0.00025229095,0.83688444,0.000044287157,0.000016537717,0.00010708129,0.0005638562,0.00036646725,0.001272775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993538,0.00012747428,0.000035901634,0.00019451563,0.00021949632,0.00006883493],"domain_scores_gemma":[0.99881834,0.000615858,0.00009051305,0.00015776335,0.00024648572,0.00007109629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012983023,0.0012231673,0.00090843515,0.002391252,0.00047605328,0.0009958954,0.0013902513,0.0011538024,0.002278332],"category_scores_gemma":[0.002300261,0.0004379145,0.0007295267,0.0016531189,0.00041185378,0.0014471242,0.0007143438,0.0005436523,0.0008565937],"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.0012483493,0.00034458566,0.0031980851,0.0005702247,0.00029813722,0.00022338756,0.00025422816,0.16315754,0.15805033,0.0024762938,0.0027325195,0.6674463],"study_design_scores_gemma":[0.000027905287,0.0001457245,0.0017630422,0.000011592531,0.000056349378,0.00020609722,0.000058680253,0.9387746,0.056791484,0.0010793796,0.0010532029,0.00003197103],"about_ca_topic_score_codex":0.009122964,"about_ca_topic_score_gemma":0.013680584,"teacher_disagreement_score":0.009122964,"about_ca_system_score_codex":0.0008684058,"about_ca_system_score_gemma":0.0007777924,"threshold_uncertainty_score":0.01813972},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016819932,0.560509,0.40372077,0.0051545408,0.00092117966,0.00030715184,0.00031342398,0.0007796199,0.011474445],"genre_scores_gemma":[0.27828902,0.55178475,0.15440418,0.0028150706,0.0040457495,0.0006271904,0.00094807293,0.00025775091,0.0068281954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767,0.00038663644,0.00032816947,0.0004768344,0.0009880908,0.0001502581],"domain_scores_gemma":[0.9924394,0.004491292,0.0007718326,0.00061672134,0.001452894,0.00022775772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342165,0.0016320873,0.001542999,0.0048032408,0.0008306867,0.003442878,0.0030486784,0.0030684231,0.001288201],"category_scores_gemma":[0.011408672,0.0008044967,0.0010816343,0.0048369993,0.0030037074,0.007130983,0.0030146197,0.003705383,0.0006168146],"study_design_candidate":"not_applicable","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.00014407278,0.00019446682,0.007516153,0.004882589,0.00020656317,0.00031863688,0.00063023536,0.02268981,0.0012224972,0.10802023,0.009232185,0.8449426],"study_design_scores_gemma":[0.00005895892,0.0006487544,0.008507608,0.0049794223,0.0004914375,0.0034005793,0.00089941104,0.1806159,0.008454566,0.5790807,0.21239658,0.00046606446],"about_ca_topic_score_codex":0.0024093313,"about_ca_topic_score_gemma":0.0014963847,"teacher_disagreement_score":0.0048032408,"about_ca_system_score_codex":0.0018381121,"about_ca_system_score_gemma":0.0019526129,"threshold_uncertainty_score":0.018095613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8063482,0.011732407,0.07871577,0.002133887,0.00044260878,0.0011218381,0.06531005,0.0050904476,0.029104754],"genre_scores_gemma":[0.7689124,0.0032157593,0.12814459,0.00028792483,0.00013449976,0.000744558,0.093833625,0.0008326127,0.003894098],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983551,0.00054593047,0.00038662975,0.0003711865,0.00024264617,0.00009838033],"domain_scores_gemma":[0.99371827,0.0041555697,0.00042416572,0.00043220219,0.0011463085,0.00012334489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540768,0.00093702576,0.00061970134,0.0046676407,0.0009791016,0.0011039833,0.0004600686,0.00046866926,0.003250073],"category_scores_gemma":[0.010354368,0.00037178554,0.00082696613,0.0036516055,0.0005154219,0.0016774886,0.0013948021,0.0005473141,0.0014960999],"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.0014360396,0.00048028945,0.024598107,0.019423816,0.00032325718,0.010352968,0.02269615,0.009944714,0.18314046,0.009902694,0.049872607,0.66782886],"study_design_scores_gemma":[0.00045186703,0.00064570055,0.16856676,0.0024937186,0.0009939886,0.014824426,0.027736628,0.10078257,0.15442517,0.0065463344,0.52207744,0.00045536546],"about_ca_topic_score_codex":0.02028047,"about_ca_topic_score_gemma":0.029931124,"teacher_disagreement_score":0.02028047,"about_ca_system_score_codex":0.0011294085,"about_ca_system_score_gemma":0.002297055,"threshold_uncertainty_score":0.040324867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96028125,0.0007410531,0.029663332,0.00073508103,0.00019697074,0.00011587398,0.001379977,0.0026374157,0.0042490494],"genre_scores_gemma":[0.98214906,0.00015736914,0.0131595675,0.00012297521,0.000048642338,0.00004720012,0.0026969367,0.0000724044,0.0015458313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856156,0.0006475261,0.00009474299,0.00029148848,0.0002641289,0.00014056881],"domain_scores_gemma":[0.9958125,0.002442154,0.00036737428,0.00084622327,0.00040354097,0.00012823069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002558065,0.0009102096,0.00058149913,0.0007433748,0.00047454186,0.0011682304,0.00068218587,0.000999366,0.0007534573],"category_scores_gemma":[0.009933075,0.00024998098,0.0005811274,0.00053242286,0.0005862869,0.001223221,0.00064515014,0.0009480746,0.0006513328],"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.0034527841,0.0013118883,0.05547648,0.0011117433,0.00035370604,0.0038660867,0.001681806,0.47120127,0.046866097,0.004844056,0.01769814,0.39213604],"study_design_scores_gemma":[0.000071228445,0.00027293173,0.012097582,0.000044438904,0.000047095924,0.00037285395,0.00026560255,0.96381664,0.018848408,0.0012634011,0.0028538129,0.00004600056],"about_ca_topic_score_codex":0.00787608,"about_ca_topic_score_gemma":0.0057624234,"teacher_disagreement_score":0.00787608,"about_ca_system_score_codex":0.000888708,"about_ca_system_score_gemma":0.0006932195,"threshold_uncertainty_score":0.015660465},"labels":[],"label_agreement":null}]}