{"meta":{"query_hash":"0edcf82d4ad5","filters":{"venue":"BRICS Report Series"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/0edcf82d4ad5","api":"https://metacan.xera.ac/api/v1/cohort?venue=BRICS+Report+Series"},"results":[{"id":"W2403742698","doi":"10.7146/brics.v7i52.20219","title":"How to Convert a Flavor of Quantum Bit Commitment","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Scheme (mathematics); Commitment scheme; Quantum; Bit (key); Computer science; Theoretical computer science; Mathematics; Arithmetic; Algorithm; Discrete mathematics; Computer security; Cryptography; Quantum mechanics; Physics","score_opus":0.011983943210925248,"score_gpt":0.2296793519396509,"score_spread":0.21769540872872564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403742698","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.008974019,0.00017579454,0.96016014,0.0029256833,0.0007699031,0.00018197155,0.0001121506,0.0008178602,0.025882404],"genre_scores_gemma":[0.35927492,0.0007909915,0.6033473,0.0028350845,0.00044590633,0.000503566,0.0003627344,0.0010025939,0.03143694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969555,0.0007197467,0.000156168,0.0005006807,0.0013209735,0.0003469679],"domain_scores_gemma":[0.99594045,0.0014184916,0.00014714003,0.0018870134,0.0004583392,0.00014866947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437484,0.00058540294,0.0006058655,0.0005403285,0.0017957747,0.0028879151,0.0021238907,0.0026946997,0.01666994],"category_scores_gemma":[0.011635061,0.00066641485,0.001100946,0.0007219686,0.004611997,0.009312481,0.005242001,0.008411498,0.0049821916],"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.000053501197,0.000032909807,0.00008433721,0.000053664364,0.000012534161,0.000064182575,0.0001747746,0.0046581877,0.002265473,0.9700243,0.0017542593,0.020821834],"study_design_scores_gemma":[0.00004294266,0.000059466427,0.000086368156,0.000059225327,0.00001592255,0.00018911174,0.00010550125,0.040512178,0.007854568,0.9232874,0.02773684,0.000050547977],"about_ca_topic_score_codex":0.0011145704,"about_ca_topic_score_gemma":0.0004648846,"teacher_disagreement_score":0.01666994,"about_ca_system_score_codex":0.0008432809,"about_ca_system_score_gemma":0.001827328,"threshold_uncertainty_score":0.055766463},"labels":[],"label_agreement":null},{"id":"W2465446327","doi":"10.7146/brics.v10i37.21805","title":"Computational Collapse of Quantum State with Application to Oblivious Transfer","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Oblivious transfer; Commitment scheme; Quantum; Reduction (mathematics); State (computer science); String (physics); Security parameter; Quantum state; Quantum computer; Mathematics; Computer science; Discrete mathematics; Cryptography; Physics; Theoretical computer science; Quantum mechanics; Algorithm","score_opus":0.008778372300756532,"score_gpt":0.22922074504269022,"score_spread":0.22044237274193368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465446327","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.12008386,0.0003678482,0.83368003,0.0028479823,0.00016401146,0.0003209104,0.00013565192,0.00065735856,0.041742276],"genre_scores_gemma":[0.92713255,0.00029033556,0.06396608,0.00029544425,0.00015367448,0.0002879806,0.00007798739,0.00015488596,0.00764114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959013,0.0014982152,0.00019215343,0.0005171855,0.0013461896,0.0005449877],"domain_scores_gemma":[0.9942801,0.0031796116,0.00037031292,0.001476931,0.00036406482,0.0003289522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348491,0.00063550373,0.0011325382,0.0010875107,0.0018349374,0.0027304045,0.0020540203,0.0016618313,0.0044908994],"category_scores_gemma":[0.011856796,0.0006325033,0.0017483659,0.0009491795,0.008500706,0.0046784417,0.009045612,0.0065978677,0.0006420623],"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.000042203275,0.000017823526,0.00009647279,0.000030286532,0.000007687693,0.000063466614,0.00023273425,0.011720993,0.0010120304,0.9835324,0.00024345604,0.0030005581],"study_design_scores_gemma":[0.000017666507,0.000037894446,0.000098529,0.000012982129,0.0000063670186,0.00003341301,0.000039561495,0.13164845,0.00240034,0.8639709,0.0017094644,0.00002448337],"about_ca_topic_score_codex":0.0016089765,"about_ca_topic_score_gemma":0.0006661187,"teacher_disagreement_score":0.0044908994,"about_ca_system_score_codex":0.0029788963,"about_ca_system_score_gemma":0.002143399,"threshold_uncertainty_score":0.021613479},"labels":[],"label_agreement":null},{"id":"W2486243297","doi":"10.7146/brics.v9i51.21766","title":"Computing Refined Buneman Trees in Cubic Time","year":2002,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Genomics and Phylogenetic Studies","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 Waterloo","funders":"","keywords":"Mathematics; Tree (set theory); Pairwise comparison; Measure (data warehouse); Algorithm; Set (abstract data type); Combinatorics; Binary tree; Weight-balanced tree; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Running time; Computer science; Data mining; Binary search tree; Artificial intelligence; Statistics","score_opus":0.013758439785927517,"score_gpt":0.22297415375533605,"score_spread":0.20921571396940852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486243297","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.109210946,0.00057583465,0.87202317,0.0007217493,0.000070841226,0.00018840277,0.0010943436,0.0054104286,0.010704254],"genre_scores_gemma":[0.19530727,0.00029342534,0.7955607,0.00013110199,0.000032062693,0.00021611495,0.0034027407,0.00056048366,0.00449609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886644,0.00019865377,0.00009960334,0.0002474515,0.00043454947,0.00015337618],"domain_scores_gemma":[0.99548316,0.0027405184,0.00024009508,0.00076752575,0.00060720806,0.00016144483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008352077,0.0006804901,0.0010795096,0.0010511406,0.00082567445,0.0019861704,0.001398655,0.0007668059,0.008944589],"category_scores_gemma":[0.007975588,0.00047967842,0.0009085022,0.0019186721,0.00066721364,0.004278016,0.0022402222,0.0011845687,0.0022054927],"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.0007288617,0.00016010142,0.003751159,0.0006159626,0.000109942426,0.0003040604,0.0006755078,0.19684862,0.012278405,0.09668995,0.0181834,0.669654],"study_design_scores_gemma":[0.00015854166,0.00010168908,0.0012872868,0.000042096024,0.00003545774,0.00023926502,0.000372221,0.720564,0.005326471,0.25475296,0.017077109,0.000042971147],"about_ca_topic_score_codex":0.0043330425,"about_ca_topic_score_gemma":0.010403276,"teacher_disagreement_score":0.008944589,"about_ca_system_score_codex":0.0010071981,"about_ca_system_score_gemma":0.0016326498,"threshold_uncertainty_score":0.029922664},"labels":[],"label_agreement":null},{"id":"W2725746804","doi":"10.7146/brics.v10i3.21774","title":"On the Computational Collapse of Quantum Information","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","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":"Université de Sherbrooke; McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Oblivious transfer; Commitment scheme; Computer science; Quantum; Theoretical computer science; Communication source; Quantum capacity; String (physics); Quantum computer; Predicate (mathematical logic); Mathematics; Discrete mathematics; Computation; Quantum network; Cryptography; Algorithm; Quantum mechanics; Physics; Computer network","score_opus":0.009961743944809205,"score_gpt":0.2203831740741499,"score_spread":0.2104214301293407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725746804","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.20460561,0.00031922135,0.7352799,0.0047192643,0.00012657946,0.00026572318,0.00014004605,0.00056210184,0.053981476],"genre_scores_gemma":[0.96098363,0.0002641743,0.03040691,0.00044931608,0.000084275176,0.00019115667,0.000073171796,0.00012448295,0.0074228817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951441,0.0018876402,0.00013306164,0.00046062403,0.0014267297,0.00094774226],"domain_scores_gemma":[0.99227434,0.0049063126,0.00048547905,0.0016470695,0.0003513624,0.0003354401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037282398,0.0007096261,0.00093780464,0.0011116416,0.0025237724,0.0029623178,0.0016925104,0.0022922559,0.0051815906],"category_scores_gemma":[0.011738824,0.00057727494,0.0013601227,0.0007280966,0.011328762,0.0073690894,0.007907277,0.0066171978,0.0009695191],"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.000058538386,0.000022705472,0.00014055679,0.000019829502,0.000011164195,0.0000948571,0.00029367334,0.012026278,0.0013346936,0.98327374,0.0003748601,0.0023491269],"study_design_scores_gemma":[0.00002575828,0.00005808594,0.00013861079,0.000019930934,0.000013420102,0.00007613788,0.00009305284,0.11816327,0.002860349,0.87652236,0.0019993158,0.000029634086],"about_ca_topic_score_codex":0.0012177605,"about_ca_topic_score_gemma":0.00043596604,"teacher_disagreement_score":0.0051815906,"about_ca_system_score_codex":0.0020262105,"about_ca_system_score_gemma":0.0012695851,"threshold_uncertainty_score":0.019717038},"labels":[],"label_agreement":null},{"id":"W2726927860","doi":"10.7146/brics.v7i28.20161","title":"Free mu-lattices","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Unary operation; Decidability; Combinatorics; Equivalence relation; Mathematics; Lattice (music); Partially ordered set; Discrete mathematics; Physics","score_opus":0.015413666733595609,"score_gpt":0.2429280225979744,"score_spread":0.2275143558643788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726927860","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.2776759,0.0034764349,0.57443464,0.0016541489,0.00039456124,0.0002374508,0.0025631178,0.0014373716,0.13812634],"genre_scores_gemma":[0.89155394,0.0007251942,0.07933464,0.0003726549,0.0002323559,0.00021528504,0.0011449682,0.00018377411,0.026237193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827933,0.00028388196,0.00011038862,0.00043717417,0.00058262906,0.00030660172],"domain_scores_gemma":[0.99805415,0.0006789977,0.00019888578,0.0004116531,0.0003554304,0.00030091434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323626,0.00045954325,0.00060241896,0.0014214023,0.0022417542,0.003596968,0.0010378486,0.00057345507,0.008613776],"category_scores_gemma":[0.0025578775,0.0005128583,0.00095863285,0.0010238439,0.0035215907,0.0060347375,0.0028049776,0.001609298,0.00087261654],"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.000040768216,0.000010943501,0.0002581193,0.000038715694,0.000008293884,0.000048368318,0.00017887076,0.0006433482,0.0010542189,0.99094427,0.00057392614,0.0062002055],"study_design_scores_gemma":[0.000023442508,0.00004185257,0.00040000933,0.000030241798,0.000015302137,0.00023244898,0.00024094647,0.004539877,0.0025745882,0.957352,0.034525387,0.00002382712],"about_ca_topic_score_codex":0.0019170573,"about_ca_topic_score_gemma":0.0016176698,"teacher_disagreement_score":0.008613776,"about_ca_system_score_codex":0.0019822689,"about_ca_system_score_gemma":0.0010904678,"threshold_uncertainty_score":0.028815925},"labels":[],"label_agreement":null},{"id":"W2944999878","doi":"10.7146/brics.v11i2.21827","title":"Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths","year":2004,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Optimization and Search Problems","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":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Combinatorics; Data structure; Algorithm; Theoretical computer science; Mathematics","score_opus":0.07440722122927845,"score_gpt":0.3161123087104155,"score_spread":0.24170508748113706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944999878","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.014400789,0.0012283529,0.9704945,0.00065545953,0.00013644421,0.00018479589,0.0010327436,0.006501222,0.005365586],"genre_scores_gemma":[0.13472457,0.0007986458,0.8523794,0.0004499176,0.00015437095,0.00075741974,0.0033298768,0.0012883455,0.0061174585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967906,0.0005127493,0.00033896026,0.00067546143,0.0012512376,0.00043091478],"domain_scores_gemma":[0.9931114,0.001890052,0.0005555378,0.0030706965,0.0011917527,0.00018061053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017676945,0.001537374,0.0013284779,0.0024557435,0.0015730925,0.0025313026,0.004815597,0.0015284618,0.008883283],"category_scores_gemma":[0.0093303835,0.001023823,0.0015196024,0.005905655,0.001674228,0.008901916,0.0038656835,0.0036637015,0.00348104],"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.0009574224,0.00047785576,0.0019377574,0.0011909447,0.0002233769,0.00015414601,0.0007408225,0.16268423,0.01592791,0.24991494,0.041463096,0.52432746],"study_design_scores_gemma":[0.00032751643,0.00031333475,0.0004387932,0.00016884589,0.00012925088,0.00023770996,0.00019935961,0.5895755,0.022741541,0.34697634,0.038764384,0.00012746165],"about_ca_topic_score_codex":0.00604635,"about_ca_topic_score_gemma":0.0079241805,"teacher_disagreement_score":0.008883283,"about_ca_system_score_codex":0.0031560413,"about_ca_system_score_gemma":0.004903646,"threshold_uncertainty_score":0.029717505},"labels":[],"label_agreement":null},{"id":"W4213316062","doi":"10.7146/brics.v8i38.21698","title":"Free De Morgan Bisemigroups and Bisemilattices","year":2001,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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":"University of Waterloo","keywords":"Computer science","score_opus":0.011783930890360735,"score_gpt":0.23312789835787498,"score_spread":0.22134396746751425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213316062","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.090291135,0.0025037876,0.7983177,0.0017486182,0.0009094907,0.00019415116,0.0005885172,0.000909848,0.1045368],"genre_scores_gemma":[0.6680755,0.001795293,0.28144664,0.0006729361,0.00048642306,0.00033378645,0.00085156463,0.0002626762,0.046075184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00013014581,0.00003882427,0.00012982872,0.00022608846,0.00010756416],"domain_scores_gemma":[0.99960357,0.000095945536,0.000069428825,0.00005221092,0.0001033582,0.000075541146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209335,0.0007345942,0.00033058642,0.0016714447,0.0013041464,0.0026591392,0.0008929852,0.00065736537,0.007848207],"category_scores_gemma":[0.0008396471,0.00033231048,0.00051117776,0.0011295306,0.0018760926,0.004115994,0.00192434,0.0011963135,0.0012179287],"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.000014215817,0.0000075448675,0.000057064597,0.000024859282,0.0000034628677,0.000063404834,0.00023778458,0.0008447378,0.000889523,0.9896253,0.00065263733,0.007579561],"study_design_scores_gemma":[0.00001026213,0.000018012712,0.0000933872,0.000016512471,0.000008549401,0.00014545275,0.00026821834,0.0040881434,0.0014983106,0.96127427,0.032565605,0.000013376568],"about_ca_topic_score_codex":0.0010671797,"about_ca_topic_score_gemma":0.0013577886,"teacher_disagreement_score":0.007848207,"about_ca_system_score_codex":0.0008062422,"about_ca_system_score_gemma":0.00049265265,"threshold_uncertainty_score":0.026254833},"labels":[],"label_agreement":null}]}