{"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":"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.6222881,0.0001788036,0.36019617,0.013901556,0.00083733455,0.00038940684,0.000008755355,0.00036479087,0.0018350537],"genre_scores_gemma":[0.91346747,0.000025880225,0.0779736,0.0004988403,0.00012818094,0.000016046848,0.0000060349917,0.000018443377,0.007865499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857676,0.000034378547,0.0003330797,0.00039455053,0.0003815391,0.0002797099],"domain_scores_gemma":[0.9987737,0.000048944516,0.00014388979,0.00078915944,0.00011264799,0.00013165413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469813,0.00016095222,0.00026935458,0.00008900241,0.00012281413,0.00016432756,0.00055948837,0.000046093213,0.000020077916],"category_scores_gemma":[0.000069452675,0.00013963901,0.00009215062,0.0004884587,0.000062456755,0.00019878625,0.00021451023,0.00010505032,0.000017454635],"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.00012139682,0.00076150877,0.005094209,0.00032600842,0.00028800152,0.006277496,0.010658041,0.017136592,0.005082878,0.09229197,0.025622541,0.83633935],"study_design_scores_gemma":[0.00039459465,0.00086339767,0.010173591,0.00012468733,0.00001788697,0.0032389744,0.000094087474,0.1887804,0.016140902,0.00794447,0.7714632,0.0007637834],"about_ca_topic_score_codex":0.00006873928,"about_ca_topic_score_gemma":0.0000052326495,"teacher_disagreement_score":0.8355756,"about_ca_system_score_codex":0.00001958841,"about_ca_system_score_gemma":0.000088137596,"threshold_uncertainty_score":0.56943136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16264208,0.00002731291,0.8364439,0.00012600976,0.00005443315,0.000193581,0.000020949119,0.000055777444,0.00043595082],"genre_scores_gemma":[0.91968614,0.0000061758437,0.08015311,0.00007367996,0.0000046800046,0.000025332834,0.000028262477,0.000005544633,0.000017104501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989463,0.00002580034,0.000282094,0.00028560782,0.00032342304,0.00013676075],"domain_scores_gemma":[0.9991618,0.000032409298,0.00007495467,0.00041069448,0.00024077784,0.00007935552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023955085,0.00009274262,0.00013760722,0.00009771492,0.000077869554,0.00005692374,0.00019939663,0.000023556055,0.0000036474764],"category_scores_gemma":[0.000026093321,0.00008459758,0.000033195534,0.0008580898,0.000060946753,0.0003465557,0.000029188484,0.00004534519,0.0000033660665],"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.000044274857,0.00016677426,0.0075776246,0.000041626503,0.000026661683,0.00012521111,0.001591141,0.007270025,0.00036471282,0.9809802,0.00038938088,0.0014223695],"study_design_scores_gemma":[0.0019782097,0.002037406,0.18832786,0.000092187525,0.00007321366,0.0072207903,0.0006098399,0.02248902,0.028883798,0.52132434,0.22497979,0.001983549],"about_ca_topic_score_codex":0.000054671076,"about_ca_topic_score_gemma":0.000066540866,"teacher_disagreement_score":0.757044,"about_ca_system_score_codex":0.000010861231,"about_ca_system_score_gemma":0.00014845644,"threshold_uncertainty_score":0.34497893},"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":"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.9867423,0.0017756604,0.00004183441,0.00030546982,0.00012249178,0.00008964245,0.000004355826,0.000007981889,0.0109102735],"genre_scores_gemma":[0.989441,0.00034139206,0.0009715108,0.000101087804,0.00014949197,0.0000060088228,0.00003048274,0.000018327617,0.008940722],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990696,0.0000197814,0.00030210396,0.00030127657,0.000089511144,0.00021776599],"domain_scores_gemma":[0.9994888,0.0000076792585,0.00011179493,0.00029895632,0.00005349751,0.000039298542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013802454,0.00013430219,0.00017443295,0.000039853858,0.000080422906,0.000021163394,0.00010288026,0.00007902226,0.00002855696],"category_scores_gemma":[0.00008857226,0.00013508959,0.000060055438,0.00010645825,0.00006450908,0.000001011012,0.00014161087,0.000050420073,0.000019284911],"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.000036316098,0.00014179938,0.0522184,0.000022196533,0.00010597805,0.0004917444,0.00039524282,0.0006282363,0.93006706,0.00013123419,0.010344775,0.005417021],"study_design_scores_gemma":[0.0010921485,0.0006302299,0.2605281,0.000045287827,0.000044736742,0.0026474982,0.00030374588,0.001058,0.11161861,0.00053612754,0.62036794,0.0011276025],"about_ca_topic_score_codex":0.000030560775,"about_ca_topic_score_gemma":0.0001241778,"teacher_disagreement_score":0.8184484,"about_ca_system_score_codex":0.000009926194,"about_ca_system_score_gemma":0.000016254307,"threshold_uncertainty_score":0.55087936},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20965126,0.000023229037,0.7832735,0.0015820405,0.00045738905,0.00014265021,0.000003233721,0.00008797733,0.0047786813],"genre_scores_gemma":[0.97285634,0.0000016727688,0.02670216,0.00031208526,0.000013239495,0.00000441488,0.0000057486513,0.0000033976846,0.000100927944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990529,0.000049916693,0.00031661932,0.00011502191,0.00034683378,0.0001187502],"domain_scores_gemma":[0.99903,0.0001803654,0.00025833535,0.000328287,0.00017364646,0.000029381872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004304701,0.00008314037,0.00010124111,0.000063550506,0.00016605303,0.00009232022,0.00024900198,0.000027422502,0.0000067661563],"category_scores_gemma":[0.00036739415,0.0000568971,0.0000460052,0.0003774323,0.000059770897,0.00026704784,0.00006124746,0.00008798152,0.000009842095],"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.0000026757714,0.000020094389,0.00011991234,0.000009259514,0.000007712092,0.000022830376,0.00053457567,0.055403396,0.00000919795,0.9411874,0.0012351136,0.0014478583],"study_design_scores_gemma":[0.00020915872,0.00022843652,0.0055791805,0.00003355985,0.000004996066,0.0018384258,0.00012847659,0.6097672,0.0016750348,0.33706853,0.043210987,0.0002560334],"about_ca_topic_score_codex":0.0000072765465,"about_ca_topic_score_gemma":4.8772193e-7,"teacher_disagreement_score":0.7632051,"about_ca_system_score_codex":0.000011312765,"about_ca_system_score_gemma":0.00013750016,"threshold_uncertainty_score":0.23201965},"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":"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.38224265,0.0015085236,0.27186078,0.0059849373,0.0014975077,0.00034059677,0.000007405487,0.0017557509,0.33480185],"genre_scores_gemma":[0.73663825,0.00031442015,0.18804626,0.0012535437,0.0003305254,0.000032313317,0.000011445953,0.00002701584,0.07334626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989975,0.000013832818,0.00023003505,0.00031293862,0.00022859462,0.00021709704],"domain_scores_gemma":[0.99889654,0.000026051604,0.000088285604,0.0008738411,0.000047189747,0.0000680796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011880516,0.00010370219,0.00012443401,0.000032073756,0.00013911663,0.000118289885,0.00062101654,0.00004071499,0.00019122685],"category_scores_gemma":[0.00007184166,0.0000907869,0.000046483365,0.00028462178,0.000058885224,0.00093687733,0.00015091048,0.00007507555,0.00008555327],"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.00003095202,0.00022622205,0.011011443,0.0000567402,0.00006777552,0.012877001,0.0017578959,0.0010857488,0.00071602495,0.4991683,0.016222958,0.4567789],"study_design_scores_gemma":[0.00017847489,0.00010177278,0.019466767,0.000011923628,0.0000072422617,0.00445513,0.000035950787,0.000634068,0.0020497795,0.23614608,0.73651356,0.00039923628],"about_ca_topic_score_codex":0.000014558469,"about_ca_topic_score_gemma":0.000012182367,"teacher_disagreement_score":0.7202906,"about_ca_system_score_codex":0.000012404471,"about_ca_system_score_gemma":0.000042893917,"threshold_uncertainty_score":0.37021825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04224288,0.00088355644,0.9505098,0.004074891,0.00035779312,0.00093342026,0.00011972116,0.0003861292,0.0004918353],"genre_scores_gemma":[0.48331398,0.001049673,0.513637,0.00021964023,0.00012908268,0.000047999816,0.00043571016,0.00004214853,0.0011247626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845135,0.000025092606,0.0002823146,0.00062172883,0.0003163225,0.00030321322],"domain_scores_gemma":[0.9986654,0.00007599103,0.000074876654,0.0007885834,0.00022796085,0.00016720637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051612034,0.0001471845,0.00019358637,0.00010271974,0.00034574515,0.00050698186,0.0004673469,0.00007347736,0.000003467715],"category_scores_gemma":[0.0002366147,0.00013385707,0.000018091663,0.00032930193,0.00016304667,0.0008613926,0.0006865498,0.000110150664,7.244622e-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.00023119092,0.0012378698,0.12562661,0.0018393265,0.00094553974,0.0078074182,0.031245748,0.03589704,0.0023258736,0.32869217,0.012456894,0.45169434],"study_design_scores_gemma":[0.0058798227,0.0019440828,0.30681705,0.00030297355,0.00014612086,0.03460127,0.0012638929,0.4288435,0.004919858,0.07519338,0.13657877,0.0035092756],"about_ca_topic_score_codex":0.00037118417,"about_ca_topic_score_gemma":0.00043992617,"teacher_disagreement_score":0.44818506,"about_ca_system_score_codex":0.000028169361,"about_ca_system_score_gemma":0.00022566102,"threshold_uncertainty_score":0.5458533},"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":"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.9125395,0.0011870445,0.07546341,0.0026667654,0.0003552891,0.00011158791,0.0000041651556,0.0005998437,0.0070724455],"genre_scores_gemma":[0.9555918,0.0007362356,0.038559042,0.00071266084,0.00017282882,0.000016724207,0.0000065108406,0.000025642075,0.0041785873],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987604,0.00002942117,0.00027534502,0.00038384373,0.00023352573,0.00031744788],"domain_scores_gemma":[0.9986844,0.00006942073,0.00015260908,0.0008977305,0.000058148635,0.00013770582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046973556,0.00014920958,0.00017351354,0.000088192355,0.00017365774,0.00027545434,0.00061404204,0.00007091727,0.000019753015],"category_scores_gemma":[0.00020793025,0.0001379324,0.000041549793,0.00038971053,0.0001032533,0.00084190303,0.00050009124,0.00009633446,0.0000067590804],"study_design_candidate":"observational","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.000055344026,0.00034481645,0.4452361,0.0001997008,0.00019126387,0.027064094,0.0072570904,0.00007406736,0.03241344,0.36966228,0.033815924,0.08368588],"study_design_scores_gemma":[0.00078547554,0.00025168766,0.27162507,0.000119498465,0.00005693817,0.069129266,0.0007585056,0.009604534,0.020844916,0.28618616,0.33920643,0.0014315369],"about_ca_topic_score_codex":0.000082253915,"about_ca_topic_score_gemma":0.000025089788,"teacher_disagreement_score":0.30539048,"about_ca_system_score_codex":0.000025239722,"about_ca_system_score_gemma":0.000068540976,"threshold_uncertainty_score":0.562472},"labels":[],"label_agreement":null}]}