{"meta":{"query_hash":"d87e99d333c6","filters":{"venue":"Mathematical Structures in Computer Science"},"cohort_total":72,"direct_labels_cover":0,"predictions_cover":72,"exported":72,"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/d87e99d333c6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Mathematical+Structures+in+Computer+Science"},"results":[{"id":"W1624997067","doi":"10.1017/s0960129518000051","title":"The quantum walk search algorithm: factors affecting efficiency","year":2018,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","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":"University of Calgary","funders":"","keywords":"Curse of dimensionality; Quantum walk; Dimension (graph theory); Symmetry (geometry); Quantum; Carry (investment); Current (fluid); Work (physics)","score_opus":0.014624811358282669,"score_gpt":0.2780769385946162,"score_spread":0.2634521272363335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624997067","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.31366622,0.00003972121,0.68438166,0.0002765876,0.0011449165,0.00019004503,7.386508e-7,0.00016078407,0.0001393144],"genre_scores_gemma":[0.7404827,0.0000014635068,0.2590962,0.000105982086,0.00029846214,0.0000014910572,2.2161115e-7,0.0000090744525,0.000004423882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958039,0.00017297266,0.00050073495,0.0009936409,0.0012931057,0.0012356669],"domain_scores_gemma":[0.9970073,0.0012097833,0.000117477175,0.0012091005,0.00020182776,0.0002544767],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022152192,0.00033078462,0.0002992591,0.00027886397,0.0018149341,0.0013801296,0.0047621913,0.000068346126,0.000013674248],"category_scores_gemma":[0.00025749987,0.00019378215,0.00010138349,0.0022998555,0.0018466266,0.0003781886,0.0016313972,0.000524571,0.0000346599],"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.0000025943052,0.000060340997,0.0006644824,0.000021967486,0.0000066443476,0.000028498911,0.005191124,0.003737754,0.00013014868,0.094264664,0.000034971068,0.8958568],"study_design_scores_gemma":[0.0001333114,0.00013557846,0.013750986,0.000042080315,0.0000013052872,0.000084984065,0.00004119372,0.8710361,0.0016091805,0.1128904,0.000033180357,0.00024170388],"about_ca_topic_score_codex":0.000031171363,"about_ca_topic_score_gemma":0.0000066952653,"teacher_disagreement_score":0.8956151,"about_ca_system_score_codex":0.00008617939,"about_ca_system_score_gemma":0.00018998721,"threshold_uncertainty_score":0.99965656},"labels":[],"label_agreement":null},{"id":"W1984173115","doi":"10.1017/s0960129599003072","title":"Pontrjagin duality and full completeness for multiplicative linear logic (without Mix)","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"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 Ottawa","keywords":"Completeness (order theory); Mathematics; Duality (order theory); Sequent calculus; Multiplicative function; Abelian group; Sequent; Interpretation (philosophy); Pure mathematics; Section (typography); Algebra over a field; Discrete mathematics; Calculus (dental); Mathematical analysis; Computer science; Geometry","score_opus":0.04018705340121978,"score_gpt":0.3115883072052049,"score_spread":0.27140125380398517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984173115","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.037631523,0.000069696565,0.9604356,0.00040606133,0.00022257146,0.00068279594,0.0000024666099,0.00013514102,0.00041410205],"genre_scores_gemma":[0.6797961,0.0000017692905,0.31976423,0.0002879082,0.00008207057,0.00003831914,9.101077e-7,0.0000059487725,0.000022748529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750173,0.000092135575,0.0004602508,0.0008926216,0.00046097883,0.00059227354],"domain_scores_gemma":[0.9984928,0.00036157892,0.00010936178,0.00071264995,0.0001260655,0.0001975376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011343755,0.00024587437,0.00040755398,0.000114970346,0.0003026926,0.00041501838,0.0016087659,0.0000722443,0.000024077199],"category_scores_gemma":[0.00010422388,0.00017551819,0.00006418074,0.0005486781,0.0007151496,0.00039353152,0.00043910218,0.00014973352,0.000020336362],"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.000015400054,0.00008556954,0.0006858791,0.00010034559,0.0000060457824,0.000008678092,0.001476922,0.00028434736,0.00020688743,0.8068989,0.000025049838,0.19020599],"study_design_scores_gemma":[0.00040107404,0.00008428044,0.005051527,0.0000087544695,0.0000025110724,0.00008591008,0.000007976096,0.48218778,0.00016118526,0.51127386,0.0005294877,0.000205632],"about_ca_topic_score_codex":0.000025730258,"about_ca_topic_score_gemma":0.00001088196,"teacher_disagreement_score":0.6421646,"about_ca_system_score_codex":0.0000566806,"about_ca_system_score_gemma":0.00006049389,"threshold_uncertainty_score":0.7157424},"labels":[],"label_agreement":null},{"id":"W1998219992","doi":"10.1017/s0960129511000442","title":"Lenses, fibrations and universal translations","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":43,"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; Mount Allison University","funders":"","keywords":"Categorical variable; Lens (geology); Complement (music); Through-the-lens metering; Constant (computer programming); Computer science; Variation (astronomy); Mathematics; Pure mathematics; Algebra over a field; Physics; Programming language; Optics","score_opus":0.028088432010136718,"score_gpt":0.24475460419808934,"score_spread":0.21666617218795262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998219992","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.012105329,0.000032634867,0.986205,0.00011779368,0.00015092085,0.00011540068,0.0000035065968,0.00007354282,0.0011959046],"genre_scores_gemma":[0.4219101,0.00000159112,0.5780135,0.000050703173,0.00001430152,0.000002486117,3.2743804e-7,0.000002128067,0.000004884328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892706,0.000025703182,0.00020412538,0.00036893057,0.00023352618,0.0002406834],"domain_scores_gemma":[0.9993178,0.00007936509,0.000040915183,0.00041865662,0.000039789455,0.000103429295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021036388,0.00010566455,0.00012736316,0.00014988479,0.00020636647,0.00008389351,0.0005242144,0.000023294077,0.000024833522],"category_scores_gemma":[0.000027502774,0.00008483587,0.000018886947,0.000548306,0.00046073602,0.0012101313,0.0002969017,0.00008546608,0.000005249324],"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":[8.2329797e-7,0.00001284398,0.00016743298,0.0000097885695,9.623704e-7,0.000009066606,0.0020590217,0.000049092,0.00010341543,0.9735979,0.000009353063,0.023980325],"study_design_scores_gemma":[0.00028152132,0.000067773944,0.017416256,0.000052037038,0.0000028864315,0.00017440435,0.00005649739,0.36379197,0.0013119254,0.61594886,0.00059422466,0.00030163574],"about_ca_topic_score_codex":0.000017067814,"about_ca_topic_score_gemma":0.0000143656225,"teacher_disagreement_score":0.40980476,"about_ca_system_score_codex":0.0000208686,"about_ca_system_score_gemma":0.00006402089,"threshold_uncertainty_score":0.34595063},"labels":[],"label_agreement":null},{"id":"W1999626800","doi":"10.1017/s0960129504004256","title":"Towards a quantum programming language","year":2004,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":496,"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 Ottawa","funders":"","keywords":"Computer science; Programming language; First-generation programming language; Denotational semantics; Semantics (computer science); Operational semantics; Theoretical computer science; Syntax; Programming paradigm; Artificial intelligence","score_opus":0.010119749812430157,"score_gpt":0.26934013545514157,"score_spread":0.25922038564271144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999626800","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.18833652,0.000059844697,0.8098143,0.00075261935,0.00043441172,0.00018504592,5.241505e-7,0.00026440216,0.00015238288],"genre_scores_gemma":[0.5279873,4.1556862e-7,0.47170687,0.00020992615,0.00008304321,0.000005049809,2.0836598e-7,0.000006057556,0.0000011082107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971696,0.000038621933,0.0003859259,0.00079300057,0.000832325,0.00078048545],"domain_scores_gemma":[0.9987138,0.00008331693,0.00008921819,0.0008310096,0.000061980805,0.00022070746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585157,0.00025310754,0.00028423048,0.00031019264,0.0002616221,0.0006750267,0.0027365307,0.000054318414,0.0000077549785],"category_scores_gemma":[0.00011323427,0.00019000898,0.00008162642,0.0016187886,0.00045912515,0.00041864504,0.0012045583,0.00033510482,0.00002257941],"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.0000013370134,0.00007414447,0.00002748369,0.00003139837,0.0000024895448,0.00012960982,0.0037697232,0.015719423,0.0002452208,0.4870425,0.0000045599763,0.49295214],"study_design_scores_gemma":[0.00028397268,0.00006071707,0.0015124594,0.000068713234,0.0000010986186,0.00022170243,0.000014826989,0.59768957,0.0009587368,0.3989277,0.000042926826,0.00021756561],"about_ca_topic_score_codex":0.00003623028,"about_ca_topic_score_gemma":0.000003846274,"teacher_disagreement_score":0.58197016,"about_ca_system_score_codex":0.00012489446,"about_ca_system_score_gemma":0.00023574197,"threshold_uncertainty_score":0.77483416},"labels":[],"label_agreement":null},{"id":"W2001007953","doi":"10.1017/s0960129512000291","title":"Applications and extensions of Alloy: past, present and future","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Programming language; Executable; Debugging; Compiler; Temporal logic; Modeling language; Software","score_opus":0.00820832302155748,"score_gpt":0.24047771551739344,"score_spread":0.23226939249583597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001007953","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.014364963,0.000086406624,0.9839051,0.0010501562,0.000054284515,0.00037561773,6.659283e-7,0.00012876617,0.000034044082],"genre_scores_gemma":[0.23000957,0.000008176403,0.7697792,0.00005774489,0.000091650494,0.00004779855,1.1789386e-7,0.0000041023577,0.0000016326746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988054,0.000018259792,0.0002388936,0.00040532908,0.00030571804,0.00022642322],"domain_scores_gemma":[0.99906427,0.00009739798,0.0000535796,0.0005636518,0.00009118451,0.000129927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126835,0.00012391082,0.00018051488,0.0001505494,0.00007719557,0.0001499353,0.0008074319,0.00004111497,0.000006776727],"category_scores_gemma":[0.0000032500109,0.00009547734,0.000017621069,0.00042876892,0.00039485437,0.00038456524,0.00090271636,0.00011124633,0.0000015923335],"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":[2.1134544e-7,0.000020661808,0.00024830565,0.000043485357,0.0000015758047,0.000001215449,0.00033034824,0.00016505642,0.00042658293,0.60854924,0.00013205865,0.3900813],"study_design_scores_gemma":[0.000080413614,0.000027284996,0.021248726,0.000029258674,0.0000016393005,0.000063331994,0.0000024040587,0.6667225,0.0004552777,0.30882505,0.0024010057,0.0001431586],"about_ca_topic_score_codex":0.0000073123883,"about_ca_topic_score_gemma":1.9147114e-7,"teacher_disagreement_score":0.66655743,"about_ca_system_score_codex":0.000016293392,"about_ca_system_score_gemma":0.00002158271,"threshold_uncertainty_score":0.38934532},"labels":[],"label_agreement":null},{"id":"W2002702549","doi":"10.1017/s0960129513000054","title":"Verification of tree-processing programs via higher-order mode checking","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Software Testing and Debugging 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":"Career Trek","funders":"","keywords":"Soundness; Computer science; Programmer; Tree (set theory); Recursion (computer science); Programming language; Data structure; Algorithm; Theoretical computer science; Mathematics","score_opus":0.023457602234503876,"score_gpt":0.29050006344815543,"score_spread":0.26704246121365155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002702549","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.016255587,0.000020759446,0.9815697,0.00014322909,0.00017671593,0.00013357525,1.08898995e-7,0.0013105724,0.00038973938],"genre_scores_gemma":[0.518228,1.6516398e-7,0.4816722,0.00005757952,0.000029460722,0.000006502842,2.6317605e-7,0.000004459939,0.0000013827038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980049,0.000052897,0.00040796094,0.00054852245,0.00061328127,0.00037240153],"domain_scores_gemma":[0.9986246,0.00018475408,0.0001789147,0.0007455865,0.00017562107,0.000090528134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008888525,0.00016716831,0.00025188868,0.00020687177,0.00013899348,0.00026878767,0.0017970669,0.000056249428,0.0000030616156],"category_scores_gemma":[0.00019987435,0.00013492675,0.00003761514,0.0013507255,0.00046216,0.00045121426,0.0004511421,0.00014720272,0.0000026548205],"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.0000011908526,0.000051119263,0.0009987433,0.00006733483,9.1201434e-7,0.0000011029373,0.00048578493,0.0004076306,0.00052896404,0.06274278,0.000015598656,0.9346988],"study_design_scores_gemma":[0.00006250571,0.000031210082,0.003646879,0.000081531776,0.0000010830188,0.000012240669,3.0958915e-7,0.5607793,0.0014705072,0.4338043,0.000011478594,0.000098685785],"about_ca_topic_score_codex":0.000019143989,"about_ca_topic_score_gemma":9.74606e-7,"teacher_disagreement_score":0.9346002,"about_ca_system_score_codex":0.000053034313,"about_ca_system_score_gemma":0.00006405175,"threshold_uncertainty_score":0.55021536},"labels":[],"label_agreement":null},{"id":"W2005119283","doi":"10.1017/s0960129511000053","title":"Domains occur among spaces as strict algebras among lax","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","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":"York University","funders":"","keywords":"Monad (category theory); Mathematics; Pure mathematics; Compact-open topology; Topological space; Algebra over a field; Topology (electrical circuits); Topological tensor product; Functor; Combinatorics; Functional analysis","score_opus":0.018982194511927127,"score_gpt":0.252168824692303,"score_spread":0.2331866301803759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005119283","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.41679162,0.000024485144,0.579706,0.000058300597,0.00036102327,0.00019575651,6.1462134e-7,0.00016935267,0.002692858],"genre_scores_gemma":[0.73087484,0.0000021856695,0.26878327,0.00023925143,0.000062767525,0.000011928504,2.8096125e-7,0.000009193266,0.000016252456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964786,0.00010748685,0.00051622087,0.0010520702,0.000930303,0.000915316],"domain_scores_gemma":[0.99793863,0.00026115967,0.00019406603,0.001146881,0.00009151158,0.0003677405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085358176,0.0003536755,0.00039092635,0.0003754164,0.00032500835,0.0005062949,0.0038259423,0.00009978003,0.00011854932],"category_scores_gemma":[0.00022527263,0.00026608104,0.00009931217,0.0017935373,0.0012534757,0.0017154925,0.0015163008,0.00035436635,0.00008038988],"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.0000053953604,0.00009751889,0.012264931,0.000025857184,0.0000070808996,0.00017629194,0.0039463523,0.000297471,0.00006037943,0.96183056,0.000053433756,0.021234727],"study_design_scores_gemma":[0.000221521,0.00009141584,0.12951215,0.00004124286,0.0000036178224,0.0000683191,0.00004650927,0.083971255,0.0013699579,0.78431153,0.00001550864,0.00034696198],"about_ca_topic_score_codex":0.000050052684,"about_ca_topic_score_gemma":0.000019406778,"teacher_disagreement_score":0.31408325,"about_ca_system_score_codex":0.000097674034,"about_ca_system_score_gemma":0.000113331866,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W2009343859","doi":"10.1017/s096012959900300x","title":"On lists and other abstract data types in the calculus of constructions","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","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":"University of Lethbridge","funders":"","keywords":"Axiom; Predicate (mathematical logic); Injective function; Mathematics; Type (biology); Pure mathematics; Computer science; Calculus (dental); Discrete mathematics; Programming language","score_opus":0.0382530588361936,"score_gpt":0.30015890327698547,"score_spread":0.26190584444079185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009343859","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.27476212,0.00017156034,0.7090545,0.0005559744,0.00052229705,0.0006098009,0.0000065525774,0.00007641766,0.014240722],"genre_scores_gemma":[0.9811184,0.0000015904516,0.018616725,0.0002195618,0.000031511936,0.0000031248278,3.1867512e-7,0.000002648788,0.0000061253586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863416,0.000051405805,0.00027863734,0.000406511,0.0003947315,0.00023453444],"domain_scores_gemma":[0.9987046,0.00027725328,0.000057407444,0.0008943681,0.000019560046,0.00004677788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623363,0.00010507797,0.00016422295,0.00010137119,0.00008621538,0.00021647823,0.0020852373,0.000035254743,0.000054624947],"category_scores_gemma":[0.0000626582,0.00006168899,0.000016731265,0.00055238587,0.0005888241,0.0002520034,0.00027995426,0.00013733532,0.000010817836],"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.0000018649321,0.00004528303,0.0003604602,0.000020851388,0.0000015983225,0.000009569394,0.0010358582,0.00019003401,0.000009867115,0.8660769,0.000041817577,0.1322059],"study_design_scores_gemma":[0.00027389405,0.00006725559,0.016460223,0.00002865741,0.000002424142,0.00021501756,0.000027260345,0.27680644,0.0000772061,0.70513344,0.0007410992,0.00016708614],"about_ca_topic_score_codex":0.000067611974,"about_ca_topic_score_gemma":0.000026748603,"teacher_disagreement_score":0.7063563,"about_ca_system_score_codex":0.000015366102,"about_ca_system_score_gemma":0.00004347794,"threshold_uncertainty_score":0.38749245},"labels":[],"label_agreement":null},{"id":"W2013957001","doi":"10.1017/s0960129506005901","title":"Free compact 2-categories","year":2007,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":67,"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":"","keywords":"Parsing; Symmetric monoidal category; Meaning (existential); Closed monoidal category; Enriched category; Monoidal category; Sentence; Mathematics; Computer science; Pure mathematics; Linguistics; Rule-based machine translation; Algebra over a field; Natural language processing; Functor; Epistemology; Philosophy","score_opus":0.013652521777377765,"score_gpt":0.2680591647508541,"score_spread":0.25440664297347637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957001","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.066105075,0.00005035279,0.9298465,0.0004921433,0.00064147747,0.00013221917,0.0000011873013,0.00023342457,0.0024976102],"genre_scores_gemma":[0.7569553,7.0088754e-7,0.24248588,0.0004470846,0.0000948409,9.814136e-7,2.546793e-7,0.0000061696637,0.000008772951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972956,0.000034891615,0.00044960406,0.0006263118,0.0008204667,0.0007731222],"domain_scores_gemma":[0.9977895,0.00045636084,0.000093649105,0.0013596601,0.00007110162,0.00022975238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021142473,0.00021794083,0.00027057304,0.0003369357,0.0002232657,0.00053240394,0.0045232526,0.000053796095,0.0000439399],"category_scores_gemma":[0.00017772379,0.00016498221,0.00006142207,0.0014349542,0.00073677336,0.0008513307,0.0011649167,0.00022047704,0.000029472496],"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.000002584756,0.00004057209,0.0004318394,0.0000152368275,0.0000019209401,0.00005260887,0.0007048489,0.00015211111,0.0004202761,0.9341575,0.00020236874,0.06381815],"study_design_scores_gemma":[0.00020430528,0.0000288872,0.018706566,0.000022267588,0.0000010022861,0.00011691702,0.00001481369,0.17577904,0.0041085794,0.80069476,0.00011739459,0.00020545106],"about_ca_topic_score_codex":0.00001180553,"about_ca_topic_score_gemma":0.00000560538,"teacher_disagreement_score":0.69085026,"about_ca_system_score_codex":0.000101542595,"about_ca_system_score_gemma":0.00008224811,"threshold_uncertainty_score":0.84054035},"labels":[],"label_agreement":null},{"id":"W2028603410","doi":"10.1017/s0960129510000538","title":"Foreword: special issue on coalgebraic logic","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Leibniz-Gemeinschaft; Engineering and Physical Sciences Research Council","keywords":"Enthusiasm; Event (particle physics); China; Computer science; Epistemology; Political science; Psychology; Philosophy; Law; Physics; Social psychology; Quantum mechanics","score_opus":0.030146234668675533,"score_gpt":0.26804793781392194,"score_spread":0.23790170314524642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028603410","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.016707739,0.000013981961,0.964842,0.00022931892,0.0013513911,0.00025179423,0.000001195399,0.0001715552,0.016430983],"genre_scores_gemma":[0.560692,0.0000012800642,0.43711814,0.00142608,0.0007086712,0.000009765018,2.5013662e-7,0.0000082238,0.000035571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972543,0.000052594376,0.00040093585,0.00086536474,0.0007132766,0.00071354065],"domain_scores_gemma":[0.998489,0.00017783948,0.00010462118,0.00095158414,0.00006116521,0.00021579595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779021,0.00027274244,0.00030752036,0.00029378862,0.00022177567,0.0001602773,0.0031244014,0.0000704686,0.000505549],"category_scores_gemma":[0.00011876297,0.00019778378,0.00007257365,0.0011481169,0.0006553197,0.00064105925,0.00088665035,0.0002890181,0.00029082215],"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.0000052052687,0.000074032265,0.00008893588,0.000010225742,0.0000013814446,0.00005980854,0.00090840925,0.00014230733,0.000015469524,0.8809514,0.000215291,0.117527515],"study_design_scores_gemma":[0.00019994688,0.00016245026,0.0063683246,0.000026755864,0.0000012482251,0.00006499967,0.000007727986,0.07705616,0.0009796631,0.91461724,0.00025899327,0.00025649247],"about_ca_topic_score_codex":0.0000025696902,"about_ca_topic_score_gemma":0.000002668491,"teacher_disagreement_score":0.5439843,"about_ca_system_score_codex":0.000085336185,"about_ca_system_score_gemma":0.000067589055,"threshold_uncertainty_score":0.8065388},"labels":[],"label_agreement":null},{"id":"W2038525809","doi":"10.1017/s0960129512000448","title":"Delay-dependent robust stability criteria for stochastic neural networks of neutral-type with interval time-varying delay and linear fractional uncertainties","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Neural Networks Stability and Synchronization","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":"University of Guelph","funders":"","keywords":"Differentiable function; Interval (graph theory); Monotonic function; Mathematics; Linear matrix inequality; Stability (learning theory); Artificial neural network; Control theory (sociology); Type (biology); Applied mathematics; Upper and lower bounds; Computer science; Mathematical optimization; Mathematical analysis; Control (management)","score_opus":0.02474701951213501,"score_gpt":0.2675476564540189,"score_spread":0.2428006369418839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038525809","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.29349703,0.000014970728,0.7057852,0.0001252819,0.0002740111,0.0002576359,0.0000017792141,0.00003690383,0.0000072109115],"genre_scores_gemma":[0.80731684,4.7454162e-7,0.19248495,0.00008429908,0.00009495236,0.0000078588355,0.0000022091376,0.000007082351,0.0000013413083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796635,0.00011950358,0.00046208815,0.0006416707,0.00039849582,0.00041190456],"domain_scores_gemma":[0.99817693,0.0008253826,0.00014899696,0.00045363783,0.00026975627,0.0001252947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009622313,0.00021096667,0.00034355343,0.000104839506,0.00021944886,0.0002402994,0.0008148995,0.000063547755,0.000019686644],"category_scores_gemma":[0.00016570941,0.00015816974,0.000041791616,0.00052401755,0.0006679386,0.00067712873,0.00044634088,0.00020561431,6.0011274e-7],"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.00007490731,0.000059650945,0.00036670084,0.00010108962,0.000006027134,0.0000019344607,0.0004045189,0.9730464,0.00020079435,0.01562136,0.0000075363987,0.010109035],"study_design_scores_gemma":[0.00030905023,0.00029406237,0.00083790213,0.000052579184,0.00000618498,0.00007006265,0.0000051281404,0.96725005,0.00019130675,0.030810915,0.0000011765363,0.00017156002],"about_ca_topic_score_codex":0.000009892083,"about_ca_topic_score_gemma":0.000012563318,"teacher_disagreement_score":0.5138198,"about_ca_system_score_codex":0.000064483436,"about_ca_system_score_gemma":0.000061074395,"threshold_uncertainty_score":0.64499754},"labels":[],"label_agreement":null},{"id":"W2053655101","doi":"10.1017/s096012950400430x","title":"Minimisation and minimal realisation in Span(Graph)","year":2004,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Formal Methods in Verification","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":"Mount Allison University","funders":"","keywords":"Concurrency; Realisation; Minimisation (clinical trials); Computer science; Reachability; Principle of compositionality; Algebra over a field; Theoretical computer science; Programming language; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.02542242488827532,"score_gpt":0.2948909800593444,"score_spread":0.26946855517106905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053655101","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.2608307,0.000014245683,0.7381776,0.0003636904,0.00019160072,0.000169069,3.9840674e-7,0.000046342942,0.00020639531],"genre_scores_gemma":[0.4906189,0.0000021330309,0.5092442,0.00010566794,0.000019059282,0.000006633856,2.860845e-7,0.0000025814713,5.257774e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980864,0.0000745114,0.00041590203,0.0005666433,0.000510542,0.00034603762],"domain_scores_gemma":[0.9991449,0.000111718495,0.00009846806,0.00049653364,0.000050154995,0.000098202276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014008633,0.00014572393,0.00017945986,0.00043524525,0.000099722,0.00027593915,0.00097252615,0.00006031739,0.0000039091474],"category_scores_gemma":[0.00023993623,0.00012820646,0.00002201033,0.0012982849,0.00044325416,0.0010498547,0.00035785872,0.00015629028,0.000004600665],"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.0000042626148,0.00004314527,0.0008939196,0.00003120348,7.2296007e-7,0.000008180971,0.0026780006,0.0037124036,0.0005772371,0.9039847,0.0000033389545,0.08806288],"study_design_scores_gemma":[0.00029606707,0.000038281683,0.0950351,0.000042544314,7.1933727e-7,0.0000499305,0.0000139544945,0.31552476,0.002099347,0.5867642,0.0000067239816,0.00012837004],"about_ca_topic_score_codex":0.000029892553,"about_ca_topic_score_gemma":0.000012516252,"teacher_disagreement_score":0.31722048,"about_ca_system_score_codex":0.00015974497,"about_ca_system_score_gemma":0.00008665787,"threshold_uncertainty_score":0.5228108},"labels":[],"label_agreement":null},{"id":"W2060880530","doi":"10.1017/s0960129512000096","title":"The monoidal structure of Turing machines","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","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":"Memorial University of Newfoundland","funders":"","keywords":"Turing machine; Turing machine examples; Super-recursive algorithm; Universal Turing machine; Description number; NSPACE; Time hierarchy theorem; Computer science; Non-deterministic Turing machine; Probabilistic Turing machine; Von Neumann architecture; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Programming language; Computation","score_opus":0.0061075696467322894,"score_gpt":0.23146366952493824,"score_spread":0.22535609987820596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060880530","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.44361082,0.00007564276,0.5548607,0.00059813756,0.0005085487,0.0001984945,8.1778063e-7,0.00006463468,0.00008219433],"genre_scores_gemma":[0.72786057,0.000001161898,0.27194065,0.00009508685,0.00008977994,0.0000030335634,1.1682265e-7,0.000005610895,0.0000039860083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976498,0.000065578315,0.00047929832,0.0005247457,0.0007041133,0.00057647424],"domain_scores_gemma":[0.9982152,0.0004616315,0.00015121036,0.0009183826,0.00012216099,0.0001314272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040571758,0.00021919995,0.00025735435,0.0001683733,0.00039693603,0.00062610273,0.0034665663,0.00004657858,0.000018997602],"category_scores_gemma":[0.00012088866,0.000123083,0.00006985528,0.0009666963,0.0007063879,0.00040293866,0.0013286978,0.00031153968,0.000007149868],"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.0000020618193,0.000034910798,0.00067623594,0.000052836247,0.000007568266,0.00000747031,0.0013594987,0.024092428,0.004977403,0.23289889,0.00010333777,0.7357874],"study_design_scores_gemma":[0.00007833718,0.000020220288,0.009691469,0.000021042293,6.5555594e-7,0.000044742043,0.0000030429574,0.6118925,0.0021322505,0.3759976,0.000016642576,0.00010147674],"about_ca_topic_score_codex":0.000032683925,"about_ca_topic_score_gemma":0.000004517102,"teacher_disagreement_score":0.7356859,"about_ca_system_score_codex":0.000033882217,"about_ca_system_score_gemma":0.00007620271,"threshold_uncertainty_score":0.64418006},"labels":[],"label_agreement":null},{"id":"W2070533073","doi":"10.1017/s0960129506005226","title":"Special issue on quantum programming languages","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, Reasoning, and Knowledge","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":"Dalhousie University","funders":"","keywords":"Computer science; Rotation formalisms in three dimensions; Quantum computer; Programming language; Quantum; Theoretical computer science; Mathematics","score_opus":0.010990766051604109,"score_gpt":0.270382784079142,"score_spread":0.2593920180275379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070533073","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.026104901,0.000055852688,0.9227973,0.00044328795,0.0019813573,0.00036060245,9.048114e-7,0.0003119901,0.047943756],"genre_scores_gemma":[0.70569235,9.024588e-7,0.2875455,0.0002845339,0.006309242,0.000013372166,8.6900104e-7,0.000011675744,0.00014152254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975046,0.00005156298,0.00034343006,0.00071754557,0.00072205043,0.000660837],"domain_scores_gemma":[0.99884796,0.00020494634,0.00008966764,0.000664376,0.00006767551,0.00012536484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852896,0.00023129887,0.00026546806,0.00023893725,0.0002391847,0.0006867515,0.0021149144,0.00006177538,0.00008326474],"category_scores_gemma":[0.00010872156,0.00016842682,0.00006831591,0.0009923934,0.00044260416,0.00039167295,0.00061410136,0.00021747932,0.00014698411],"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.0000019930994,0.00009565568,0.00025363904,0.00001922226,0.0000011015965,0.00005912122,0.0005032166,0.00025839542,0.00003452804,0.7940867,0.0015764327,0.20311],"study_design_scores_gemma":[0.00045666,0.00018633986,0.013501146,0.00009240532,0.0000032057342,0.00012970004,0.000025740264,0.3157254,0.0016767171,0.652723,0.014927974,0.0005517371],"about_ca_topic_score_codex":0.000020537078,"about_ca_topic_score_gemma":0.0000131021125,"teacher_disagreement_score":0.6795875,"about_ca_system_score_codex":0.000098654134,"about_ca_system_score_gemma":0.000074574295,"threshold_uncertainty_score":0.6868247},"labels":[],"label_agreement":null},{"id":"W2076730925","doi":"10.1017/s0960129599003023","title":"Unique factorisation lifting functors and categories of linearly-controlled processes","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":17,"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":"","keywords":"Functor; Mathematics; Factorization; Morphism; Sheaf; Path (computing); Pure mathematics; Concrete category; Category theory; Algebra over a field; Topology (electrical circuits); Computer science; Algorithm; Combinatorics","score_opus":0.0198271439006641,"score_gpt":0.2918634737537003,"score_spread":0.2720363298530362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076730925","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.9302258,0.000052894557,0.068484455,0.00013168665,0.00010781717,0.00028022053,0.0000012838375,0.000045609053,0.0006702492],"genre_scores_gemma":[0.9518738,0.000007006555,0.047954362,0.00005631359,0.00005919769,0.000013324079,4.1453245e-7,0.0000072956186,0.000028330942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985467,0.00007946689,0.0004994746,0.00030923737,0.00027742935,0.0002876812],"domain_scores_gemma":[0.9982719,0.0011862923,0.00012714943,0.0002446468,0.000098079574,0.00007195497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586107,0.00015865914,0.00045083344,0.00012588402,0.00011739196,0.000053017575,0.000363175,0.000093541385,0.00028969574],"category_scores_gemma":[0.0009789388,0.00011305899,0.000031607575,0.0004406163,0.0010239569,0.00017757474,0.000100274716,0.00016286824,0.0000024842352],"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.00015333628,0.00020408694,0.008212816,0.0007735479,0.000033079617,0.000021075224,0.013002447,0.00015994499,0.0004450151,0.89920753,0.00002776745,0.07775933],"study_design_scores_gemma":[0.0006808579,0.00007966389,0.0024192517,0.000044126184,0.000011585402,0.000050667455,0.00004753476,0.007884642,0.0023713992,0.9862673,0.000012966477,0.00012996446],"about_ca_topic_score_codex":0.000012495838,"about_ca_topic_score_gemma":0.000011862519,"teacher_disagreement_score":0.08705979,"about_ca_system_score_codex":0.000024844165,"about_ca_system_score_gemma":0.00011594118,"threshold_uncertainty_score":0.46104115},"labels":[],"label_agreement":null},{"id":"W2076857531","doi":"10.1017/s0960129512000175","title":"Topological features of good resources for measurement-based quantum computation","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Information and Cryptography","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":"Canadian Nautical Research Society","funders":"Agence Nationale de la Recherche","keywords":"Analogy; Computation; Fractal; Quantum computer; Computer science; Quantum; Topology (electrical circuits); Dimension (graph theory); Context (archaeology); Theoretical computer science; Fractal dimension; Theoretical physics; Mathematics; Pure mathematics; Algorithm; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.02477339122742333,"score_gpt":0.2666185337299233,"score_spread":0.24184514250249994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076857531","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.068854444,0.00003071858,0.9292591,0.00059035496,0.00024361964,0.00048892223,0.0000014574381,0.00009074016,0.0004406342],"genre_scores_gemma":[0.6835654,2.6374144e-7,0.3160441,0.00033618094,0.000020376354,0.00002949341,4.745144e-7,0.0000031602156,6.0222897e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975829,0.000057834568,0.00055343873,0.00039189012,0.0010050122,0.00040888358],"domain_scores_gemma":[0.99859387,0.00029001985,0.00020176666,0.00041417536,0.00036964787,0.00013051317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777846,0.00017917354,0.00027803326,0.00037446144,0.00017229281,0.0003721801,0.0015227034,0.000063706844,0.000025653168],"category_scores_gemma":[0.00016855786,0.00013007462,0.000108082575,0.00096961384,0.00054995815,0.000646256,0.00023161377,0.00012392599,0.000007389994],"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.000006747743,0.000098304416,0.0002430949,0.00011433628,0.0000046673217,7.330184e-7,0.0007197782,0.0025561175,0.0007387105,0.9331946,0.00029871115,0.062024202],"study_design_scores_gemma":[0.0003079475,0.00010323351,0.017383229,0.00003307045,0.0000016037598,0.0000063735815,0.000020456357,0.58988595,0.0015954318,0.3905065,0.00003261474,0.00012358109],"about_ca_topic_score_codex":0.0000124493645,"about_ca_topic_score_gemma":0.0000017428004,"teacher_disagreement_score":0.6147109,"about_ca_system_score_codex":0.00004951461,"about_ca_system_score_gemma":0.00008676568,"threshold_uncertainty_score":0.5304289},"labels":[],"label_agreement":null},{"id":"W2082745618","doi":"10.1017/s0960129507006056","title":"Restriction categories III: colimits, partial limits and extensivity","year":2007,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":45,"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":"","keywords":"Coproduct; Mathematics; Limit (mathematics); Closed category; Distributive property; 2-category; Enriched category; Context (archaeology); Pure mathematics; Concrete category; Category theory; Algebra over a field; Mathematical analysis","score_opus":0.03226011253922527,"score_gpt":0.3198217263919793,"score_spread":0.287561613852754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082745618","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.6509486,0.000028573551,0.34753492,0.00022254516,0.00044299784,0.00018036552,6.7292336e-7,0.00006597789,0.00057534204],"genre_scores_gemma":[0.93937546,0.0000061567407,0.06020878,0.0002189607,0.00016048875,0.0000063759476,3.5996814e-7,0.00000863541,0.000014800342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980117,0.00006934997,0.00046560224,0.00048545576,0.00037995286,0.0005879092],"domain_scores_gemma":[0.99819773,0.001054157,0.00011124261,0.00038392676,0.00008468987,0.00016826134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015423048,0.00019039908,0.000331644,0.00020123854,0.00027616046,0.000082313774,0.0004048401,0.00013720509,0.000044607925],"category_scores_gemma":[0.00067561376,0.0001537697,0.00003395468,0.0005275914,0.0015999981,0.00018784295,0.00025932747,0.00028821468,0.000005676958],"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.000025972158,0.00006274217,0.0013776991,0.00003650741,0.0000047862277,0.00007798052,0.0009260008,0.0000070708356,0.00035322685,0.9768874,0.00008212672,0.0201585],"study_design_scores_gemma":[0.0003158245,0.0000762231,0.023057407,0.000018725663,0.000009890902,0.00033502813,0.000055478275,0.0045243143,0.003739677,0.9676369,0.000052915893,0.00017760873],"about_ca_topic_score_codex":0.000014615813,"about_ca_topic_score_gemma":0.000042521606,"teacher_disagreement_score":0.28842685,"about_ca_system_score_codex":0.00006612999,"about_ca_system_score_gemma":0.00006832475,"threshold_uncertainty_score":0.6270546},"labels":[],"label_agreement":null},{"id":"W2085205555","doi":"10.1017/s0960129506005810","title":"Spatiality for formal topologies","year":2007,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":38,"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 à Montréal","funders":"Division of Mathematical Sciences","keywords":"Network topology; Computer science; Topology (electrical circuits); Mathematics; Combinatorics; Computer network","score_opus":0.043413609928820006,"score_gpt":0.3606467508382066,"score_spread":0.3172331409093866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085205555","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.31018677,0.000008196211,0.68770057,0.00024108663,0.00048670822,0.0002908822,0.0000018793719,0.00007068269,0.0010132208],"genre_scores_gemma":[0.6673292,2.930303e-7,0.3322986,0.00021750915,0.00012224079,0.000012523538,4.2278577e-7,0.0000060932193,0.000013087502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979211,0.000036253245,0.0005176247,0.0004047721,0.00030519327,0.00081502885],"domain_scores_gemma":[0.99759007,0.0016761896,0.00010651935,0.0004414725,0.00007879385,0.00010695577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028185027,0.0001726359,0.00032576843,0.0001690681,0.00024153145,0.00005159907,0.00083229475,0.00012261876,0.000112059235],"category_scores_gemma":[0.0010743169,0.0001318084,0.00007472764,0.00032281145,0.0014205734,0.0002029472,0.00035775854,0.00018670173,0.000006002623],"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.000022876136,0.000052256895,0.0005691551,0.000057995647,0.000003779329,0.000013510946,0.00054587604,0.000007647557,0.00008575983,0.9544993,0.00007206845,0.04406979],"study_design_scores_gemma":[0.00032311346,0.00008969474,0.004638582,0.000012473601,0.0000054677303,0.000101348545,0.00004602956,0.0055548768,0.0036126776,0.9853748,0.00008215398,0.00015878498],"about_ca_topic_score_codex":0.000005784039,"about_ca_topic_score_gemma":0.000036117133,"teacher_disagreement_score":0.35714245,"about_ca_system_score_codex":0.00008002734,"about_ca_system_score_gemma":0.00006723665,"threshold_uncertainty_score":0.53749907},"labels":[],"label_agreement":null},{"id":"W2092185282","doi":"10.1017/s0960129502003717","title":"The logic of linear functors","year":2002,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"University of Ottawa","funders":"","keywords":"Functor; Linear logic; Substructural logic; Mathematics; Noncommutative geometry; Intermediate logic; Multimodal logic; Algebra over a field; Predicate logic; Higher-order logic; Normal modal logic; Linear temporal logic; Modal logic; Description logic; Computer science; Theoretical computer science; Pure mathematics; Discrete mathematics; Algorithm; Modal","score_opus":0.0346561703712842,"score_gpt":0.26352669889243757,"score_spread":0.22887052852115336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092185282","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.004579032,0.00021082611,0.9917282,0.0003321862,0.0007395054,0.0001838573,1.3832644e-7,0.0000703139,0.002155968],"genre_scores_gemma":[0.9286287,0.000005004213,0.07112526,0.00011337052,0.0000772292,0.0000056254394,5.65199e-8,0.0000037095003,0.00004104814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980339,0.00006238731,0.00040635502,0.00039784025,0.0006601667,0.00043938504],"domain_scores_gemma":[0.99853563,0.00033895508,0.00013012053,0.0008044547,0.00009229005,0.0000985333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010087,0.00014111183,0.00020937076,0.00010111871,0.0002836508,0.000254901,0.002606658,0.000042740507,0.000026860853],"category_scores_gemma":[0.00015846796,0.00007675378,0.00006276142,0.00095089735,0.00074433215,0.00025700903,0.00064402795,0.00014380524,0.00003960201],"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":[5.711889e-7,0.00002963015,0.00025115648,0.000017752558,0.0000020225834,0.0000064978453,0.00062126695,0.00018065108,0.000035824072,0.92146355,0.00009151241,0.077299595],"study_design_scores_gemma":[0.00009764327,0.000054897057,0.00084515545,0.0000047044123,0.0000010168077,0.000035455723,0.000007907024,0.4606787,0.000318265,0.53721565,0.00064177177,0.00009882562],"about_ca_topic_score_codex":0.0000070204455,"about_ca_topic_score_gemma":0.000002846084,"teacher_disagreement_score":0.9240497,"about_ca_system_score_codex":0.000035645287,"about_ca_system_score_gemma":0.000027200767,"threshold_uncertainty_score":0.48438627},"labels":[],"label_agreement":null},{"id":"W2096885339","doi":"10.1017/s0960129502003730","title":"Geometry of Interaction and linear combinatory algebras","year":2002,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":155,"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 Ottawa","funders":"","keywords":"Axiom; Algebra over a field; Mathematics; Linear logic; Pure mathematics; Geometry; Discrete mathematics","score_opus":0.033322102477246394,"score_gpt":0.31074937392387786,"score_spread":0.2774272714466315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096885339","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.9143887,0.00006124549,0.084008224,0.00017784702,0.00030294864,0.00013058228,8.8171396e-7,0.000035144367,0.00089443586],"genre_scores_gemma":[0.93426985,0.000004571628,0.06554847,0.000112008405,0.000034317974,0.000004021428,1.253286e-7,0.0000066610423,0.000019966797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987046,0.00006420451,0.00038993297,0.00030355036,0.00026832757,0.00026936305],"domain_scores_gemma":[0.9987896,0.000641885,0.00011612613,0.0003247764,0.000047951653,0.0000796273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954051,0.00013061495,0.0003012913,0.00024622184,0.00008116043,0.000021327322,0.00040422197,0.00008428887,0.00042662988],"category_scores_gemma":[0.0003727121,0.00010616763,0.000034711717,0.0004022455,0.00126488,0.00014859662,0.00027538,0.00022710238,0.000010007672],"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.000004338281,0.00013758702,0.0013343465,0.00011436926,0.000007306033,0.000017201222,0.0010864792,0.00001000175,0.00019473389,0.9691288,0.00008838977,0.027876468],"study_design_scores_gemma":[0.0002642855,0.00007997031,0.0024332101,0.00004042136,0.0000065732024,0.00021424318,0.000036479647,0.04566571,0.0017897061,0.9493285,0.000025035846,0.00011587403],"about_ca_topic_score_codex":0.0000026736573,"about_ca_topic_score_gemma":0.0000015485856,"teacher_disagreement_score":0.04565571,"about_ca_system_score_codex":0.000032130705,"about_ca_system_score_gemma":0.0000129517275,"threshold_uncertainty_score":0.4671298},"labels":[],"label_agreement":null},{"id":"W2099951171","doi":"10.1017/s0960129599003035","title":"Unique decomposition categories, Geometry of Interaction and combinatory logic","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":29,"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 Ottawa","funders":"","keywords":"Categorical variable; Decomposition; Computer science; Algebra over a field; Mathematics; Theoretical computer science; Pure mathematics","score_opus":0.014634878797617148,"score_gpt":0.27765023426699104,"score_spread":0.2630153554693739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099951171","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.14599982,0.00007925794,0.85192806,0.000101344434,0.00029691926,0.00017187996,2.2574253e-7,0.000065057204,0.001357467],"genre_scores_gemma":[0.9466838,0.000005962435,0.053164054,0.000101176396,0.000024559162,0.000005212062,5.719419e-7,0.000003518732,0.000011146878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856573,0.00006916496,0.0003424542,0.00040292423,0.00035144025,0.00026830478],"domain_scores_gemma":[0.9992198,0.00013351081,0.00009539439,0.00038849996,0.000068055604,0.000094776566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058645586,0.00013375432,0.00022565827,0.00020742297,0.00011457377,0.00020861233,0.00080606964,0.000055031487,0.000043262866],"category_scores_gemma":[0.000024759645,0.00010351158,0.00003069404,0.0007292216,0.00043710956,0.00054054934,0.0002533079,0.00014345495,0.000008249471],"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.0000029631733,0.00005194947,0.00041375632,0.000053004682,0.0000022527336,0.0000086270575,0.0005561053,0.00017699905,0.0001420061,0.87283325,0.000012845587,0.12574625],"study_design_scores_gemma":[0.00019092846,0.00010411566,0.0054832166,0.000014956553,0.0000019630936,0.00016590471,0.000013619072,0.12815665,0.0014696462,0.8641278,0.00012821566,0.00014298895],"about_ca_topic_score_codex":0.000030454034,"about_ca_topic_score_gemma":0.0000032748626,"teacher_disagreement_score":0.800684,"about_ca_system_score_codex":0.000060761453,"about_ca_system_score_gemma":0.000046734003,"threshold_uncertainty_score":0.42210796},"labels":[],"label_agreement":null},{"id":"W2105781220","doi":"10.1017/s0960129509007440","title":"Three extensional models of type theory","year":2009,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; McGill University","keywords":"Extensional definition; Type theory; Type (biology); Categorical variable; Extensionality; Mathematics; Computer science; Discrete mathematics; Geology; Statistics","score_opus":0.044136653478171514,"score_gpt":0.3315818087464013,"score_spread":0.2874451552682298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105781220","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.1805423,0.00004917788,0.8177738,0.00008347758,0.00015468919,0.000114856644,9.345702e-7,0.00003569811,0.0012450274],"genre_scores_gemma":[0.6917929,9.590257e-7,0.30798572,0.00017548206,0.000033586,7.776692e-7,1.9120613e-7,0.0000042380934,0.0000061046835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986261,0.000044722066,0.00035265656,0.0002998231,0.000375015,0.00030169857],"domain_scores_gemma":[0.99857175,0.00071099197,0.0000926559,0.0004483486,0.00010420224,0.00007206606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940233,0.0001397961,0.00029466598,0.00013230299,0.00008976142,0.000015398695,0.0006224706,0.000064441345,0.00011713162],"category_scores_gemma":[0.00039803883,0.00010068775,0.000046736244,0.00040000724,0.00087526103,0.00019600627,0.00015357227,0.00017647096,0.0000049750656],"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.00003047874,0.00006433086,0.000013834034,0.000016373222,0.000002188311,0.000008814492,0.00031320148,0.001093074,0.00026962944,0.9788808,0.000030580995,0.019276656],"study_design_scores_gemma":[0.00014312896,0.000060523565,0.00072217325,0.000037185346,0.000004118481,0.00004711336,0.000009596603,0.107260235,0.0005325171,0.89108163,0.0000014922335,0.00010031557],"about_ca_topic_score_codex":2.7418056e-7,"about_ca_topic_score_gemma":8.060302e-7,"teacher_disagreement_score":0.5112506,"about_ca_system_score_codex":0.000027530401,"about_ca_system_score_gemma":0.00005789218,"threshold_uncertainty_score":0.41059273},"labels":[],"label_agreement":null},{"id":"W2106223528","doi":"10.1017/s0960129511000545","title":"Toward a fundamental theorem of quantal measure theory","year":2012,"lang":"en","type":"preprint","venue":"Mathematical Structures in Computer Science","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Measure (data warehouse); Mathematics; Bounded function; Analogy; Sequence (biology); Bounded variation; Event (particle physics); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.07388952295391411,"score_gpt":0.3504196541741919,"score_spread":0.2765301312202778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106223528","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.27355608,0.00032082837,0.7222734,0.00006188755,0.0011998679,0.0005472157,0.000028396587,0.0000923881,0.0019199315],"genre_scores_gemma":[0.8169175,0.0000036760418,0.18276128,0.00007169957,0.00018455234,0.000020016934,0.0000026514765,0.000028040644,0.000010613156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963645,0.00036523602,0.0008825062,0.00073838176,0.0009053345,0.00074406934],"domain_scores_gemma":[0.9966366,0.0015162104,0.00044792748,0.0010892198,0.00011687155,0.00019312816],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0033180283,0.0004847495,0.00093838666,0.00029750593,0.00013572791,0.00006519548,0.0019255335,0.00034473906,0.00039951858],"category_scores_gemma":[0.00074512203,0.00036477527,0.00022725356,0.00032093012,0.0032783453,0.00019163816,0.00255061,0.0010105353,0.000013077974],"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.00006231693,0.00018807367,0.00019313491,0.00055458146,0.000028556453,0.000015171113,0.0047222576,0.00011928716,0.00015967718,0.98449284,0.00001630217,0.009447786],"study_design_scores_gemma":[0.0002786722,0.00003339594,0.00049210596,0.00033321377,0.000038054448,0.00012099631,0.00018406121,0.0041477885,0.0016602905,0.99234,0.0000036907368,0.00036768624],"about_ca_topic_score_codex":0.00000210571,"about_ca_topic_score_gemma":0.0000018851266,"teacher_disagreement_score":0.54336137,"about_ca_system_score_codex":0.00018474138,"about_ca_system_score_gemma":0.00020280585,"threshold_uncertainty_score":0.99988043},"labels":[],"label_agreement":null},{"id":"W2121087903","doi":"10.1017/s0960129506005251","title":"Quantum weakest preconditions","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":156,"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":"Fonds Wetenschappelijk Onderzoek","keywords":"Predicate transformer semantics; Precondition; Predicate (mathematical logic); Computer science; Computation; Probabilistic logic; Semantics (computer science); Operational semantics; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Pure mathematics; Artificial intelligence","score_opus":0.008472072875403596,"score_gpt":0.24173012044996373,"score_spread":0.23325804757456012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121087903","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.15005004,0.000032771863,0.8474394,0.00061074196,0.00058830954,0.00014990589,0.0000020337475,0.00023290794,0.0008938878],"genre_scores_gemma":[0.67011684,3.2319898e-7,0.32952437,0.00016054277,0.00017346365,0.0000063372263,8.93753e-7,0.000006577437,0.00001066336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997414,0.000053270152,0.0004468643,0.0007628089,0.00065262744,0.0006704167],"domain_scores_gemma":[0.9986381,0.00023743043,0.00009965865,0.0008142461,0.00007337819,0.00013719327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564479,0.00023255825,0.00025489027,0.00034289106,0.00035947084,0.00062737777,0.002342669,0.000051778014,0.000029897514],"category_scores_gemma":[0.000048794143,0.00018359949,0.00007559157,0.0013816039,0.0005191836,0.00047759837,0.0007637249,0.00027838012,0.000043249114],"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":[7.8163987e-7,0.00009491271,0.00035466667,0.000020355184,0.0000016766983,0.000040232106,0.00022598042,0.026097331,0.00030282565,0.9295174,0.0002706609,0.04307321],"study_design_scores_gemma":[0.000103955936,0.000020603773,0.013063417,0.000022413466,7.656649e-7,0.000111738365,0.000001179737,0.553871,0.00027030654,0.43229344,0.000096713,0.00014444505],"about_ca_topic_score_codex":0.000026161131,"about_ca_topic_score_gemma":0.000007292326,"teacher_disagreement_score":0.5277737,"about_ca_system_score_codex":0.00007027997,"about_ca_system_score_gemma":0.0001144274,"threshold_uncertainty_score":0.748697},"labels":[],"label_agreement":null},{"id":"W2121166249","doi":"10.1017/s0960129504004293","title":"A relational model of non-deterministic dataflow","year":2004,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":15,"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":"","keywords":"Dataflow; Bisimulation; Computer science; Axiom; Categorical variable; Concurrency; Congruence (geometry); Monotone polygon; Semantics (computer science); Theoretical computer science; Automaton; Relational calculus; Algebra over a field; Mathematics; Relational model; Programming language; Pure mathematics; Relational database","score_opus":0.04179656533753423,"score_gpt":0.2798113372138988,"score_spread":0.23801477187636455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121166249","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.015207706,0.000011239088,0.98327976,0.000087418186,0.00028931568,0.0001840434,0.0000010349565,0.00004868589,0.0008907656],"genre_scores_gemma":[0.6122717,2.8072574e-7,0.38763356,0.000053277712,0.00002830124,0.00000455881,4.516791e-7,0.000003075242,0.000004737104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797225,0.000018903485,0.0004407578,0.0005073475,0.0007021706,0.00035855355],"domain_scores_gemma":[0.9988426,0.00009794484,0.00012971876,0.0007255047,0.000087456,0.000116770294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123089,0.00015029116,0.00024852031,0.00018541703,0.00011404646,0.0001594346,0.0018308762,0.000050907904,0.000005710639],"category_scores_gemma":[0.000091943475,0.00011434518,0.00005185909,0.0006738966,0.00047748137,0.0005172771,0.00066707854,0.00013486894,0.000017235167],"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.0000012588473,0.00005003623,0.0000940205,0.000040853967,0.0000017578226,0.000009595071,0.0007380739,0.038802635,0.00029192975,0.94890434,0.0000059073523,0.011059579],"study_design_scores_gemma":[0.00015549152,0.000027041642,0.0006119811,0.000009137432,9.77078e-7,0.000029908071,0.0000015247203,0.5119529,0.00029346533,0.4868366,0.0000043073114,0.00007665021],"about_ca_topic_score_codex":0.000009007079,"about_ca_topic_score_gemma":0.0000023337552,"teacher_disagreement_score":0.597064,"about_ca_system_score_codex":0.00007512723,"about_ca_system_score_gemma":0.00026242534,"threshold_uncertainty_score":0.46628612},"labels":[],"label_agreement":null},{"id":"W2123018358","doi":"10.1017/s096012951000006x","title":"Towards a typed Geometry of Interaction","year":2010,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"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 Ottawa","funders":"","keywords":"Linear logic; Multiplicative function; Soundness; Orthogonality; Categorical variable; Interpretation (philosophy); TRACE (psycholinguistics); Algebra over a field; Mathematics; Exponential function; Invariant (physics); Computer science; Pure mathematics; Calculus (dental); Discrete mathematics; Geometry; Programming language; Mathematical analysis","score_opus":0.02001838402881809,"score_gpt":0.29050322282977536,"score_spread":0.27048483880095725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123018358","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.10580519,0.000010088373,0.8902613,0.000088516485,0.0015523083,0.0001340662,1.7711561e-7,0.00006551884,0.0020828326],"genre_scores_gemma":[0.82226235,3.368879e-7,0.17759112,0.00005256175,0.00007926521,0.000004009058,1.6364788e-7,0.0000033736176,0.000006844226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838936,0.00002870805,0.00034825125,0.0003990938,0.0005263808,0.00030820217],"domain_scores_gemma":[0.9989133,0.00010592357,0.0001271014,0.0006376123,0.0001133323,0.000102769554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079329376,0.0001252772,0.00021969878,0.00027206718,0.00007485418,0.00022326002,0.0016658172,0.000060183098,0.00004437238],"category_scores_gemma":[0.00017371892,0.00009045446,0.000052050866,0.0010405871,0.0003580363,0.00045468615,0.0005706515,0.0002534972,0.000021030672],"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.0000015318453,0.0000432888,0.00044394235,0.000034639965,0.0000020452837,0.000005912643,0.0005307097,0.00003899522,0.0018267423,0.85248125,0.000017801136,0.14457314],"study_design_scores_gemma":[0.00019110779,0.0000699043,0.0078111878,0.00000917469,0.000001918665,0.00013231814,0.000011949864,0.23148642,0.007899579,0.7518628,0.0003472655,0.00017637567],"about_ca_topic_score_codex":0.000027616865,"about_ca_topic_score_gemma":0.000009325999,"teacher_disagreement_score":0.7164571,"about_ca_system_score_codex":0.000028913008,"about_ca_system_score_gemma":0.00009516546,"threshold_uncertainty_score":0.36886257},"labels":[],"label_agreement":null},{"id":"W2126293901","doi":"10.1017/s0960129513000388","title":"Multidimensional infinite data in the language Lucid","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Parallel Computing and Optimization 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":"University of Victoria","funders":"","keywords":"Computer science; Lucid dream; Sequence (biology); Programmer; Theoretical computer science; Value (mathematics); Loop (graph theory); Programming language; Algorithm; Mathematics","score_opus":0.023878365687961887,"score_gpt":0.303900635172346,"score_spread":0.28002226948438413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126293901","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.01963603,0.00002591642,0.9783899,0.00069976127,0.00015872772,0.00015172541,8.3408844e-7,0.00012357302,0.0008134898],"genre_scores_gemma":[0.51614195,7.5615935e-7,0.48284024,0.0009698903,0.000038201397,0.000002914853,0.0000014629557,0.0000025463771,0.0000020314342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977991,0.00018413897,0.00034371455,0.00062020356,0.0006810124,0.0003718481],"domain_scores_gemma":[0.99744374,0.0006162251,0.00007656908,0.0017592296,0.000041164694,0.00006308057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027707494,0.00014678642,0.00017966027,0.0002338439,0.00014581738,0.00031612732,0.0052855746,0.00003931073,0.000006977026],"category_scores_gemma":[0.00038350883,0.00009438248,0.000022443017,0.001124558,0.00028573113,0.00050574605,0.0019337839,0.00023932154,0.000014783611],"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.0000033625088,0.0001453969,0.0012196818,0.000033033186,0.0000022476625,0.000039225757,0.005173572,0.019626549,0.00014160447,0.82225627,0.0006985305,0.15066053],"study_design_scores_gemma":[0.0001472811,0.000018595836,0.005725149,0.000029336728,5.7939906e-7,0.000040215717,0.0000078420935,0.92141557,0.00014533117,0.072149746,0.00019693295,0.00012343285],"about_ca_topic_score_codex":0.000019269923,"about_ca_topic_score_gemma":0.0000055455494,"teacher_disagreement_score":0.901789,"about_ca_system_score_codex":0.000028511578,"about_ca_system_score_gemma":0.000057836012,"threshold_uncertainty_score":0.9822001},"labels":[],"label_agreement":null},{"id":"W2126641514","doi":"10.1017/s0960129514000243","title":"Modelling session types using contracts","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Session (web analytics); Rotation formalisms in three dimensions; Computer science; Interpretation (philosophy); Programming language; World Wide Web; Mathematics","score_opus":0.03768632492651351,"score_gpt":0.282842901819051,"score_spread":0.24515657689253745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126641514","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.025288425,0.00003835816,0.97272563,0.00005845286,0.00069206563,0.0001525064,7.092759e-8,0.00011373535,0.00093076617],"genre_scores_gemma":[0.6796818,4.4796022e-7,0.32009903,0.0001056366,0.00010231936,0.0000018910781,1.108494e-7,0.0000045272886,0.0000042710017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979415,0.00007805678,0.0003409664,0.0005549674,0.0005906873,0.0004938521],"domain_scores_gemma":[0.99886954,0.00018563602,0.00011113031,0.0005929149,0.00008820571,0.00015256906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173286,0.00016930145,0.00025666316,0.00016603115,0.00022895673,0.00055233965,0.0014965262,0.000060791815,0.000007986989],"category_scores_gemma":[0.000082256985,0.00012074703,0.00004502743,0.0006324744,0.0002479984,0.00057996006,0.000511122,0.0001597443,0.000020832365],"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.0000010709764,0.000025692698,0.0001315259,0.00002572039,0.0000015233437,0.0000070830256,0.00043279046,0.08445995,0.0002074184,0.86713016,0.0000055513615,0.047571503],"study_design_scores_gemma":[0.00009108208,0.000016659198,0.000070343325,0.0000112622165,0.0000010743006,0.000037294158,0.0000017499385,0.61022294,0.00031109864,0.38902673,0.00010609562,0.0001036781],"about_ca_topic_score_codex":0.000025924606,"about_ca_topic_score_gemma":0.0000012532221,"teacher_disagreement_score":0.6543933,"about_ca_system_score_codex":0.00006563726,"about_ca_system_score_gemma":0.000070681795,"threshold_uncertainty_score":0.5326224},"labels":[],"label_agreement":null},{"id":"W2134649613","doi":"10.1017/s0960129511000132","title":"Classical mathematics for a constructive world","year":2011,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Constructive; Constructive set theory; Axiom; Intuitionistic logic; Perspective (graphical); Type theory; Mathematics; Constructive proof; Function (biology); Algebra over a field; Type (biology); Calculus (dental); Computer science; Discrete mathematics; Artificial intelligence; Pure mathematics; Linear logic; Axiom of choice; Set theory; Programming language; Process (computing)","score_opus":0.046692993121109826,"score_gpt":0.27803997028817506,"score_spread":0.23134697716706523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134649613","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.0020750822,0.000021744103,0.98969084,0.000091717826,0.0008040393,0.0006083825,8.463923e-7,0.00017413999,0.006533183],"genre_scores_gemma":[0.51292574,2.2586245e-7,0.48683125,0.000097387594,0.000069289505,0.000037078004,2.0566246e-7,0.000006961106,0.000031837946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973717,0.000042612737,0.00055136415,0.00074565766,0.0005850611,0.00070365047],"domain_scores_gemma":[0.99828815,0.00034216463,0.00017131545,0.00081945764,0.00015946076,0.00021943824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009370928,0.00025666092,0.00040362394,0.00033874123,0.00021626349,0.00035782583,0.0024062255,0.000067457644,0.000034921635],"category_scores_gemma":[0.00015825857,0.00018795862,0.000110361485,0.0011472865,0.000921325,0.0005396277,0.0006856389,0.0001907269,0.000030919466],"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.0000032602995,0.00009359179,0.00020232308,0.00005962357,0.0000052796754,0.000012813068,0.0022244686,0.000007828984,0.000033686512,0.9569856,0.00006697866,0.040304553],"study_design_scores_gemma":[0.0002738243,0.000072237424,0.0006707867,0.000012417452,0.0000036998024,0.00009604709,0.000025030986,0.20096135,0.0008639655,0.7965571,0.00024772805,0.00021579495],"about_ca_topic_score_codex":0.000006305774,"about_ca_topic_score_gemma":0.000011641963,"teacher_disagreement_score":0.51085067,"about_ca_system_score_codex":0.00009670643,"about_ca_system_score_gemma":0.00013954981,"threshold_uncertainty_score":0.766473},"labels":[],"label_agreement":null},{"id":"W2137154666","doi":"10.1017/s0960129512000084","title":"Preface to special issue: Developments In Computational Models 2010","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Bayesian Modeling and Causal Inference","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":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Theme (computing); Scope (computer science); Computer science; Focus (optics); Computation; Nexus (standard); Rubric; Data science; Engineering ethics; Mathematics; Mathematics education; Algorithm; Programming language; Engineering; World Wide Web","score_opus":0.02676107469415012,"score_gpt":0.2743192043049344,"score_spread":0.24755812961078427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137154666","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.032248605,0.0000064322194,0.9636745,0.0012190158,0.0006278958,0.00037632126,7.5591373e-7,0.00007184259,0.0017746537],"genre_scores_gemma":[0.45803726,4.1151944e-7,0.54119265,0.0005995967,0.00012440156,0.000021092408,3.6431857e-7,0.0000046793575,0.000019520145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970959,0.000050945357,0.0005309671,0.000798238,0.00086999143,0.0006539917],"domain_scores_gemma":[0.99886906,0.00013881993,0.00006380489,0.000489178,0.00015798908,0.00028117542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595126,0.00023025974,0.00027615106,0.0004051593,0.00012938179,0.00066713383,0.0023963258,0.0000656513,0.00011687298],"category_scores_gemma":[0.00006190903,0.00019750524,0.000031079024,0.0014146846,0.00020667074,0.0012102127,0.0010540518,0.00025492633,0.00031930493],"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.000003108181,0.00011089091,0.00036628568,0.000026505644,0.0000026388136,0.000016299951,0.0035289337,0.34209532,0.0001034344,0.42845187,0.0016493985,0.22364533],"study_design_scores_gemma":[0.00010542703,0.000014564262,0.00860402,0.000034753913,2.5359253e-7,0.000012740035,0.000003995034,0.55669326,0.00008256762,0.4342732,0.000022476426,0.00015273734],"about_ca_topic_score_codex":0.000038851198,"about_ca_topic_score_gemma":0.000009214289,"teacher_disagreement_score":0.42578867,"about_ca_system_score_codex":0.00015576805,"about_ca_system_score_gemma":0.00021893664,"threshold_uncertainty_score":0.805403},"labels":[],"label_agreement":null},{"id":"W2140500391","doi":"10.1017/s0960129520003047","title":"Introduction to linear bicategories","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":45,"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; University of Calgary","funders":"","keywords":"Mathematics; Linear logic; Generalization; Commutative property; Pure mathematics; Linear map; Algebra over a field; Linear algebra; Linear system; Discrete mathematics; Mathematical analysis","score_opus":0.015194233535177066,"score_gpt":0.26227977312310136,"score_spread":0.24708553958792429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140500391","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.013587269,0.000020437315,0.981977,0.0018950389,0.0007669618,0.00024450014,1.4746321e-7,0.00018592997,0.0013227549],"genre_scores_gemma":[0.7609202,0.0000011369618,0.2379096,0.0003395201,0.0006839845,0.000013161424,3.3595197e-7,0.000005439381,0.00012662594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781024,0.00004578265,0.00034041447,0.0007232924,0.00058458257,0.0004956608],"domain_scores_gemma":[0.9988096,0.000059829523,0.000043328077,0.0008193469,0.00007473354,0.00019319105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139423,0.00016776206,0.00021934802,0.00020214371,0.00019385053,0.00046227768,0.0018482831,0.00004497057,0.00019765845],"category_scores_gemma":[0.00007378209,0.00012376271,0.00004100977,0.0015487957,0.00028756013,0.00053139275,0.00036980817,0.00014147854,0.0003997748],"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.0000025043157,0.000033019453,0.00007691668,0.000014927208,0.0000015008127,0.000009075674,0.0009433782,0.0014178555,0.000086378626,0.71138114,0.00040340214,0.28562993],"study_design_scores_gemma":[0.0001596232,0.000114584895,0.0018533516,0.000005158812,0.0000016384854,0.00013831454,0.000008299844,0.23616593,0.0014428141,0.74364424,0.016167628,0.00029840673],"about_ca_topic_score_codex":0.000014026432,"about_ca_topic_score_gemma":0.0000029377304,"teacher_disagreement_score":0.74733293,"about_ca_system_score_codex":0.000068980014,"about_ca_system_score_gemma":0.000060510956,"threshold_uncertainty_score":0.513843},"labels":[],"label_agreement":null},{"id":"W2141274581","doi":"10.1017/s0960129512000163","title":"A formalism-local framework for general probabilistic theories, including quantum theory","year":2013,"lang":"en","type":"preprint","venue":"Mathematical Structures in Computer Science","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Probabilistic logic; Spacetime; Formalism (music); Locality; Computer science; Fragment (logic); Theoretical computer science; Algorithm; Mathematics; Topology (electrical circuits); Physics; Quantum mechanics; Artificial intelligence; Combinatorics","score_opus":0.02656293863260744,"score_gpt":0.31120786544933093,"score_spread":0.2846449268167235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141274581","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.08411158,0.0000251406,0.9135683,0.00015301372,0.0006438159,0.0012304534,0.00006434605,0.000048615882,0.00015469264],"genre_scores_gemma":[0.75159806,5.05245e-7,0.2472226,0.000096070224,0.0005020111,0.0005348323,0.000018724833,0.000022775193,0.000004414987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974484,0.00005896716,0.0005942353,0.0008270908,0.00042302493,0.0006482876],"domain_scores_gemma":[0.9978873,0.00066224765,0.0002488698,0.00087311445,0.00015724187,0.00017122252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010352769,0.00037909846,0.0004942339,0.00013300581,0.00036178724,0.0005117883,0.001544915,0.00014262827,0.00019935901],"category_scores_gemma":[0.00008393377,0.00029377613,0.00016709564,0.0003062871,0.0006379959,0.00013628762,0.001900746,0.0006368674,0.000011694604],"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.00000470701,0.000060282997,0.000015636208,0.00012223766,0.000011793805,3.4133356e-7,0.0004928949,0.0018199625,0.000013583806,0.97643745,0.000031974578,0.020989124],"study_design_scores_gemma":[0.00007193982,0.00001307072,0.000039578856,0.00010209411,0.000010034998,0.0000012778469,0.000027919337,0.4479325,0.000084423424,0.5514978,0.00002102915,0.00019830385],"about_ca_topic_score_codex":0.000021726331,"about_ca_topic_score_gemma":5.4629237e-7,"teacher_disagreement_score":0.6674865,"about_ca_system_score_codex":0.00010458715,"about_ca_system_score_gemma":0.00024601942,"threshold_uncertainty_score":0.9999514},"labels":[],"label_agreement":null},{"id":"W2144872930","doi":"10.1017/s0960129510000289","title":"A separation between divergence and Holevo information for ensembles","year":2010,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Divergence (linguistics); Context (archaeology); Mathematics; Kullback–Leibler divergence; Coherent information; Information theory; Construct (python library); Quantum information; Statistical physics; Quantum; Probability distribution; Pure mathematics; Computer science; Quantum channel; Quantum mechanics; Statistics; Physics","score_opus":0.011078001579727152,"score_gpt":0.2921296828278611,"score_spread":0.28105168124813396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144872930","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.30327412,5.924141e-7,0.6962763,0.00005394993,0.00013176021,0.00011724691,0.000014957449,0.0000066497064,0.00012443043],"genre_scores_gemma":[0.86383504,7.44138e-8,0.1360188,0.000028231985,0.00010012799,0.000010347666,0.000004185766,0.0000018243319,0.0000013469946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993597,0.0000050853814,0.00016938492,0.00013784159,0.00015266924,0.00017532145],"domain_scores_gemma":[0.99957526,0.0001522007,0.00004211034,0.00011065204,0.000046608977,0.00007319465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019248419,0.00007292264,0.00010008433,0.000050654326,0.0001196323,0.00015752098,0.00017088656,0.000018045586,0.000052536296],"category_scores_gemma":[0.00004036354,0.00005693977,0.000015916801,0.00011871823,0.0001246294,0.0002722861,0.00009492406,0.00008361793,0.000004613449],"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.0000014897021,0.0000051127886,0.0034543246,0.000010867152,0.0000012265077,5.8172297e-8,0.0001552288,0.000022608408,0.00023590289,0.8773721,0.000029790866,0.118711285],"study_design_scores_gemma":[0.00012732684,0.000016643939,0.012524553,0.000005450619,0.000002755003,6.6551775e-7,0.0000073725237,0.32346043,0.00071996823,0.66294557,0.00012297365,0.0000662869],"about_ca_topic_score_codex":0.000008106561,"about_ca_topic_score_gemma":4.651891e-7,"teacher_disagreement_score":0.56056094,"about_ca_system_score_codex":0.000005606737,"about_ca_system_score_gemma":0.000019375582,"threshold_uncertainty_score":0.23219363},"labels":[],"label_agreement":null},{"id":"W2145862486","doi":"10.1017/s0960129506005238","title":"A lambda calculus for quantum computation with classical control","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":182,"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 Ottawa; Dalhousie University","funders":"","keywords":"Church encoding; Dependent type; Typed lambda calculus; Computer science; Simply typed lambda calculus; System F; Lambda calculus; Curry–Howard correspondence; Calculus (dental); Linear logic; Programming language; Type (biology); Operational semantics; Theoretical computer science; Quantum; Lambda; Quantum computer; Semantics (computer science); Algebra over a field; Mathematics; Pure mathematics; Quantum mechanics; Physics","score_opus":0.011175637365528433,"score_gpt":0.2579324113655679,"score_spread":0.24675677400003945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145862486","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.032838657,0.000025357434,0.964104,0.0012198471,0.00047779636,0.00088097196,0.0000051517163,0.00026285177,0.00018538204],"genre_scores_gemma":[0.57785225,9.228505e-8,0.42175987,0.00019574443,0.00013909211,0.00003801921,0.0000013314163,0.00000955214,0.000004050119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960965,0.00010434221,0.0006579804,0.0011927711,0.0010544528,0.0008939415],"domain_scores_gemma":[0.9975693,0.000992396,0.00017639012,0.0007592079,0.0003030552,0.00019961059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010598715,0.0003567616,0.0005211517,0.000293173,0.00031416563,0.0007333518,0.0020352365,0.00008890084,0.0000067489436],"category_scores_gemma":[0.00011501706,0.00025956618,0.00010890751,0.0013494982,0.0009177262,0.0006327474,0.0005085998,0.00024611477,0.000009828777],"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.000029366525,0.00027415509,0.0005778962,0.00007640645,0.000007058761,0.000048597125,0.00021451812,0.05172312,0.00017295762,0.8888628,0.00021119135,0.057801936],"study_design_scores_gemma":[0.0008254644,0.00016507681,0.0069734133,0.000021580865,0.0000041003505,0.00008840351,0.0000026143066,0.6177821,0.0001299806,0.37373206,0.000045203895,0.00023000326],"about_ca_topic_score_codex":0.000030876596,"about_ca_topic_score_gemma":0.000027339225,"teacher_disagreement_score":0.566059,"about_ca_system_score_codex":0.00023729834,"about_ca_system_score_gemma":0.00023891435,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2146471655","doi":"10.1017/s0960129505004822","title":"Modelling general recursion in type theory","year":2005,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":85,"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 Ottawa","funders":"","keywords":"Type theory; Recursion (computer science); Mathematical proof; Computer science; Mutual recursion; Type (biology); Theory of computation; Functional programming; Constructive; Predicate (mathematical logic); Proof theory; Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.02889547040022715,"score_gpt":0.2744766433418571,"score_spread":0.24558117294162995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146471655","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.049860135,0.00014045315,0.94779897,0.00016258047,0.0005567954,0.00017564248,8.0294356e-8,0.00008308509,0.001222246],"genre_scores_gemma":[0.7016475,0.0000031251038,0.29802713,0.00015282595,0.00013336107,0.0000037124769,1.8491217e-7,0.0000044960543,0.000027618658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790376,0.00009612074,0.00038386777,0.0005802068,0.0005178938,0.0005181428],"domain_scores_gemma":[0.99904144,0.00013197826,0.000072284,0.0005760968,0.00006312381,0.0001150549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014604782,0.00016471872,0.00022502142,0.00025577942,0.00011198525,0.00031645308,0.0016955513,0.00006408716,0.000022603801],"category_scores_gemma":[0.000053155512,0.00012268299,0.000038314363,0.0010963178,0.00023120093,0.0005775519,0.0005305833,0.00020679033,0.000046805817],"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.000002865037,0.00003468216,0.00011678984,0.000013018235,7.6739366e-7,0.000010840482,0.0009842973,0.058353502,0.00003219308,0.83098924,0.000015839705,0.10944595],"study_design_scores_gemma":[0.000092488866,0.000019345956,0.00012690133,0.000006906571,3.6711575e-7,0.000024362655,0.0000032243345,0.5470634,0.00015618622,0.45220643,0.0002060476,0.00009435514],"about_ca_topic_score_codex":0.000012818957,"about_ca_topic_score_gemma":0.0000056292447,"teacher_disagreement_score":0.6517874,"about_ca_system_score_codex":0.00012719768,"about_ca_system_score_gemma":0.00008309323,"threshold_uncertainty_score":0.50028676},"labels":[],"label_agreement":null},{"id":"W2155406913","doi":"10.1017/s0960129509007543","title":"Boolean and classical restriction categories","year":2009,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":20,"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":"","keywords":"Mathematics; Closed category; Two-element Boolean algebra; Complete Boolean algebra; Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Functor","score_opus":0.011636685409425248,"score_gpt":0.2573887304346815,"score_spread":0.24575204502525627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155406913","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.054167856,0.000051609735,0.9433947,0.001334727,0.00021326034,0.000099764846,1.8431724e-7,0.00011988988,0.00061797816],"genre_scores_gemma":[0.73898274,0.0000049114506,0.26050076,0.00044646082,0.000056407822,0.000001597175,1.333704e-7,0.000001919469,0.0000050846975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839526,0.00002974213,0.00024195247,0.0005359246,0.0004119206,0.0003851934],"domain_scores_gemma":[0.9992221,0.00011362331,0.00005226279,0.00042333294,0.000038909067,0.00014978564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028737145,0.000147008,0.00017890244,0.00017075855,0.00020189257,0.0003554201,0.00094401033,0.000042755466,0.000004468878],"category_scores_gemma":[0.0000837549,0.000109073764,0.000024098916,0.0008214996,0.00041647226,0.00075043784,0.00032447212,0.00018157506,0.000006157268],"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.0000012945262,0.00002019427,0.00010384059,0.0000041124395,3.7856503e-7,0.000016053986,0.00021971694,0.0001817023,0.00024917594,0.8519017,0.00002738917,0.1472744],"study_design_scores_gemma":[0.000104106206,0.00007168351,0.024981113,0.000009640865,7.353234e-7,0.000087520326,0.000004193686,0.19434896,0.00030180527,0.77991515,0.000056352314,0.00011875668],"about_ca_topic_score_codex":0.0000010729568,"about_ca_topic_score_gemma":7.7413335e-7,"teacher_disagreement_score":0.6848149,"about_ca_system_score_codex":0.00005054836,"about_ca_system_score_gemma":0.000046372752,"threshold_uncertainty_score":0.44478992},"labels":[],"label_agreement":null},{"id":"W2160144389","doi":"10.1017/s0960129515000055","title":"Cartesian differential categories revisited","year":2015,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"Mount Allison University","funders":"","keywords":"Differential (mechanical device); Mathematics; Cartesian coordinate system; Computer science; Physics; Geometry","score_opus":0.039479841084634336,"score_gpt":0.31949143155221743,"score_spread":0.2800115904675831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160144389","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.54201806,0.000033264147,0.45368487,0.0004737255,0.0007164865,0.00025678403,0.0000020066416,0.0001336941,0.00268111],"genre_scores_gemma":[0.9219342,5.4231185e-7,0.07766365,0.00016613283,0.00017704336,0.0000113458955,0.0000010525906,0.000011109334,0.000034940764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979323,0.00012316053,0.00043665947,0.00045998153,0.0005144375,0.00053343584],"domain_scores_gemma":[0.9986385,0.0003503507,0.00009312888,0.0005701301,0.00010632804,0.00024154312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741402,0.00020820138,0.00040306823,0.00019071864,0.00013037623,0.0001088466,0.0009003058,0.00010600688,0.00020853373],"category_scores_gemma":[0.00070463447,0.00015676515,0.00005232271,0.0005511582,0.0012834561,0.00016480264,0.00040336142,0.00025866076,0.000034939643],"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.000009023078,0.000059639377,0.00076681335,0.000036837904,0.000005337474,0.000054993536,0.0016524574,0.000008406492,0.00006557324,0.9910492,0.00043866746,0.005853082],"study_design_scores_gemma":[0.00034789855,0.00006205377,0.0012818178,0.000021072221,0.0000089474315,0.00022334613,0.000048199698,0.010155854,0.0006209535,0.98698467,0.000062557294,0.00018260234],"about_ca_topic_score_codex":0.000007566773,"about_ca_topic_score_gemma":0.000007789883,"teacher_disagreement_score":0.37991613,"about_ca_system_score_codex":0.00009752693,"about_ca_system_score_gemma":0.00014001493,"threshold_uncertainty_score":0.6392697},"labels":[],"label_agreement":null},{"id":"W2163726877","doi":"10.1017/s0960129509990235","title":"Preface to special issue: Expressiveness in Concurrency 2008","year":2010,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Computer science; Event (particle physics); Programming language; Concurrency control","score_opus":0.012261519406126053,"score_gpt":0.2841829877159594,"score_spread":0.2719214683098333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163726877","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.19566183,0.000013524557,0.79797447,0.0007324599,0.003756347,0.0006013085,0.000002559596,0.00012709218,0.001130417],"genre_scores_gemma":[0.57044137,5.744183e-7,0.42823136,0.00027343005,0.0010020105,0.00002817477,3.2820284e-7,0.000009429195,0.000013331114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565434,0.00011025386,0.000710791,0.0014163665,0.0011309976,0.0009772358],"domain_scores_gemma":[0.99733067,0.00045315814,0.00011538331,0.0015254989,0.0001699913,0.0004053261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001312456,0.00035936627,0.0004957492,0.0005228919,0.00017732025,0.0006490206,0.0052809604,0.00011637824,0.00029456208],"category_scores_gemma":[0.00050855806,0.00030550995,0.00007243767,0.0024956523,0.000689102,0.00084681355,0.0029274393,0.00065830647,0.000115911316],"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.0000146001175,0.0005323839,0.004698109,0.000114994655,0.0000040798463,0.00023406009,0.006938842,0.0091761025,0.004713824,0.2946514,0.0012244041,0.6776972],"study_design_scores_gemma":[0.0005238185,0.00009654631,0.05660953,0.00007341406,0.0000015096756,0.00012731396,0.000012585243,0.5921729,0.0040585925,0.34418762,0.0015130448,0.0006231209],"about_ca_topic_score_codex":0.000026085167,"about_ca_topic_score_gemma":0.000057952948,"teacher_disagreement_score":0.6770741,"about_ca_system_score_codex":0.000142064,"about_ca_system_score_gemma":0.0002571324,"threshold_uncertainty_score":0.9999397},"labels":[],"label_agreement":null},{"id":"W2171866929","doi":"10.1017/s0960129515000134","title":"Fast circular dictionary-matching algorithm","year":2015,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"String searching algorithm; Matching (statistics); Computation; Algorithm; String (physics); Pattern matching; Space (punctuation); Mathematics; Combinatorics; Approximate string matching; Computer science; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.02040349900912089,"score_gpt":0.2687050296310084,"score_spread":0.2483015306218875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171866929","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.004856716,0.00007956601,0.99289113,0.00024932311,0.0010339529,0.00015392817,0.0000031693992,0.00018114198,0.00055106555],"genre_scores_gemma":[0.17679387,0.0000014561756,0.82271993,0.00028595972,0.00017326756,0.000007845536,0.0000020067637,0.000007921478,0.0000077224195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997008,0.00006444636,0.00039264475,0.0007703988,0.0012201639,0.000544294],"domain_scores_gemma":[0.99831265,0.000110554705,0.000091867085,0.00096971483,0.00013782839,0.00037735308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000995373,0.00021868502,0.00025990797,0.00026310314,0.00024048552,0.00062672,0.0027338685,0.000057211844,0.00001741854],"category_scores_gemma":[0.00006962836,0.0001690851,0.000051977047,0.0011092857,0.00034088257,0.001505357,0.001933041,0.00025330877,0.00005313087],"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.000002156722,0.00011577166,0.0001565661,0.000022378656,0.000004648291,0.00013089542,0.002117671,0.008667381,0.00013556905,0.2085874,0.00045422418,0.7796053],"study_design_scores_gemma":[0.00018522466,0.000024562758,0.0008580757,0.000027254204,9.2473726e-7,0.00015576597,0.000014160002,0.62185025,0.00011843488,0.3763693,0.00024415337,0.00015187488],"about_ca_topic_score_codex":0.000023328734,"about_ca_topic_score_gemma":6.442939e-7,"teacher_disagreement_score":0.77945346,"about_ca_system_score_codex":0.00015081775,"about_ca_system_score_gemma":0.00019650623,"threshold_uncertainty_score":0.6895091},"labels":[],"label_agreement":null},{"id":"W2197366377","doi":"10.1017/s0960129515000237","title":"Representation of algebraic domains by formal association rule systems","year":2015,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"Université du Québec à Montréal","funders":"","keywords":"Equivalence (formal languages); Algebraic number; Mathematics; Formal system; Representation (politics); Basis (linear algebra); Antecedent (behavioral psychology); Algebraic structure; Algebra over a field; Context (archaeology); Association (psychology); Computer science; Discrete mathematics; Pure mathematics; Programming language; Epistemology","score_opus":0.02141809593852007,"score_gpt":0.27273882354927603,"score_spread":0.25132072761075597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197366377","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.08950344,0.000067218265,0.9076464,0.00017692786,0.00062871136,0.00019245873,0.000002649121,0.000056776382,0.0017253938],"genre_scores_gemma":[0.81375307,0.0000015229332,0.18609345,0.000080789236,0.000050351606,0.0000070187934,0.0000013734259,0.0000035916878,0.000008822528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754715,0.00008923274,0.0004553988,0.00040267542,0.001085027,0.00042049296],"domain_scores_gemma":[0.9987364,0.00020267736,0.0002387523,0.00050893985,0.00016015727,0.00015307107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014006533,0.00012699873,0.00027537622,0.0001477473,0.00009730082,0.00032816993,0.0013618042,0.00006155066,0.0000035762152],"category_scores_gemma":[0.00021696251,0.000097413234,0.000043499273,0.0011539863,0.00016893787,0.0010254116,0.0005404478,0.000113129376,0.000010907932],"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.000010783143,0.00020883759,0.007337942,0.000098097706,0.000016360833,0.00001810019,0.0038635384,0.009898736,0.00063652,0.8924806,0.0046319338,0.08079856],"study_design_scores_gemma":[0.000369984,0.00006243012,0.003032236,0.000021632593,0.0000023522157,0.000025011197,0.000027463619,0.743616,0.0006910704,0.25194183,0.000069819616,0.00014021232],"about_ca_topic_score_codex":0.000030604137,"about_ca_topic_score_gemma":9.3858125e-7,"teacher_disagreement_score":0.7337172,"about_ca_system_score_codex":0.00021053407,"about_ca_system_score_gemma":0.00011366822,"threshold_uncertainty_score":0.39723966},"labels":[],"label_agreement":null},{"id":"W2200757872","doi":"10.1017/s0960129515000444","title":"Resource convertibility and ordered commutative monoids","year":2015,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Convertibility; Commutative property; Context (archaeology); Monoid; Algebra over a field; Substitution (logic); Algebraic number; Algebraic geometry","score_opus":0.027964093410074085,"score_gpt":0.28758647969362244,"score_spread":0.25962238628354833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200757872","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.9490454,0.00008904155,0.042778663,0.000053618478,0.00005718457,0.000049991697,0.0000054384896,0.000028838202,0.007891799],"genre_scores_gemma":[0.95652866,5.1793586e-7,0.04335865,0.000046403144,0.000022069165,0.0000024600386,9.699003e-7,0.0000042579527,0.000036029232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889594,0.000015930507,0.0002709288,0.00029805247,0.00032825986,0.00019087976],"domain_scores_gemma":[0.9992083,0.00016176209,0.00007571115,0.00035484313,0.00006043477,0.00013897852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038058605,0.00010929399,0.0001946031,0.000031684085,0.00006291203,0.000025302275,0.0004306645,0.00004016814,0.00010146575],"category_scores_gemma":[0.0002654602,0.00009135478,0.000016815708,0.00017625873,0.0013740805,0.000110031084,0.0003066121,0.00014629729,0.0000013592844],"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.000636755,0.0017929605,0.05292305,0.005455021,0.00009213179,0.00020423305,0.07047777,0.009312706,0.2532886,0.16790383,0.0016992218,0.43621373],"study_design_scores_gemma":[0.0016948318,0.000048775844,0.00069766684,0.00022408474,0.000011057902,0.00008355738,0.0007399912,0.12776205,0.28284985,0.58345157,0.0019372795,0.0004992789],"about_ca_topic_score_codex":0.0000028065215,"about_ca_topic_score_gemma":6.616409e-7,"teacher_disagreement_score":0.43571445,"about_ca_system_score_codex":0.000088693254,"about_ca_system_score_gemma":0.000067036846,"threshold_uncertainty_score":0.50628567},"labels":[],"label_agreement":null},{"id":"W2226273852","doi":"10.1017/s0960129516000098","title":"On computability and disintegration","year":2016,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":19,"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","funders":"","keywords":"Mathematics; Computability; Measure (data warehouse); Limit (mathematics); Separable space; Operator (biology); Projection (relational algebra); Uniform limit theorem; Metric space; Basis (linear algebra); Computable number; Pure mathematics; Discrete mathematics; Combinatorics; Computable analysis; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.013049341079782471,"score_gpt":0.2612357940108767,"score_spread":0.24818645293109423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226273852","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.19930439,0.000012024229,0.7982957,0.0013568548,0.00041903782,0.00023877734,0.0000013983649,0.0001468249,0.0002250321],"genre_scores_gemma":[0.7315593,0.0000010026121,0.26814306,0.00023370277,0.000048273665,0.0000064924884,1.089786e-7,0.000004865965,0.000003242671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969381,0.0001236942,0.00045734146,0.0011461307,0.0007970488,0.00053768186],"domain_scores_gemma":[0.9972471,0.0012399362,0.000089415546,0.0010789604,0.00011620914,0.00022835261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236833,0.00026339872,0.00031714808,0.00024900236,0.00019519794,0.00042557204,0.0017812995,0.000060508646,0.000030914995],"category_scores_gemma":[0.000458381,0.00015230206,0.000053973286,0.0008388159,0.0010807087,0.0007218213,0.0012642114,0.00016598508,0.000025388807],"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.0000036868662,0.00007634585,0.0007830067,0.000014219426,0.0000012695066,0.000009283691,0.00022187551,0.00019913462,0.00020615444,0.5722073,0.000020238276,0.4262575],"study_design_scores_gemma":[0.00022263333,0.0000865495,0.030707065,0.000039818893,7.2776726e-7,0.000041742693,0.000001433898,0.34461543,0.00046427207,0.6236473,0.000011994698,0.00016104658],"about_ca_topic_score_codex":0.000006052713,"about_ca_topic_score_gemma":0.0000050410213,"teacher_disagreement_score":0.5322549,"about_ca_system_score_codex":0.00021127638,"about_ca_system_score_gemma":0.000088145716,"threshold_uncertainty_score":0.6210698},"labels":[],"label_agreement":null},{"id":"W2240891936","doi":"10.1017/s0960129508007391","title":"Editors' note: bibliometrics and the curators of orthodoxy","year":2009,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Publishing and Scholarly Communication","field":"Arts and Humanities","cited_by":14,"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":"Centre National de la Recherche Scientifique; Technische Universität Berlin; Chalmers Tekniska Högskola; Imperial College London; Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Ellipse; Citation; Orthodoxy; Metaphysics; Term (time); Politics; Epistemology; Inertia; Series (stratigraphy); Task (project management); Mathematics; Sociology; Computer science; Philosophy; Political science; Geometry; Law; Physics; Geology; Management; Economics; Library science; Classical mechanics; Astronomy","score_opus":0.02910316576555434,"score_gpt":0.2837472436446655,"score_spread":0.2546440778791112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240891936","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.78492695,0.00089299394,0.17428635,0.009473868,0.004505162,0.0006643406,0.000010238205,0.0001465944,0.025093477],"genre_scores_gemma":[0.98718387,0.000007033644,0.012141814,0.00023814586,0.00041722116,0.0000012199894,3.2634455e-7,0.0000020459881,0.000008306166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989657,0.00007147513,0.0002492938,0.00014304035,0.00042223913,0.00014829887],"domain_scores_gemma":[0.99884737,0.00054971495,0.00008678554,0.00034806223,0.00012326168,0.000044839107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016474504,0.00007364285,0.00015134657,0.0008099787,0.00025489007,0.0009842876,0.0008244297,0.000021931015,0.000030511452],"category_scores_gemma":[0.00063798035,0.00004061677,0.000025996434,0.0013140816,0.0013435413,0.00071710016,0.00017566819,0.00019075764,0.0000011632538],"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.000004781515,0.000019911264,0.00010882106,0.000008753331,9.061867e-7,3.8301442e-7,0.0069901473,0.000018709243,0.000010378396,0.9474586,0.0004948764,0.044883728],"study_design_scores_gemma":[0.00042979297,0.000049286504,0.009134102,0.00003840233,0.0000053467925,0.000007838865,0.00011240339,0.04730535,0.0000773078,0.93982905,0.0028938465,0.00011729677],"about_ca_topic_score_codex":0.000018344414,"about_ca_topic_score_gemma":0.000004933705,"teacher_disagreement_score":0.2022569,"about_ca_system_score_codex":0.000014258438,"about_ca_system_score_gemma":0.00003067624,"threshold_uncertainty_score":0.94915074},"labels":[],"label_agreement":null},{"id":"W2465729262","doi":"10.1017/s0960129516000219","title":"Computations with oracles that measure vanishing quantities","year":2016,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","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":"McMaster University","funders":"","keywords":"Timeout; Computation; Oracle; Computer science; Measure (data warehouse); Algorithm; Symbolic computation; Discrete mathematics; Theoretical computer science; Mathematics; Mathematical analysis; Data mining","score_opus":0.03399042463299039,"score_gpt":0.2662922667684897,"score_spread":0.23230184213549931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465729262","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.064792484,0.000042530533,0.93221956,0.0014952307,0.00047313407,0.00029930598,0.0000033056842,0.00034302162,0.00033141382],"genre_scores_gemma":[0.5722521,0.0000011546365,0.42751464,0.00015490087,0.000054499593,0.0000088768065,2.058975e-7,0.000008932293,0.0000046675204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960116,0.0001396586,0.00046509042,0.001112011,0.0014771906,0.00079442584],"domain_scores_gemma":[0.9971325,0.0010400771,0.00016092372,0.0011658685,0.0002528702,0.0002477926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012125409,0.0003465386,0.00041832382,0.00034800937,0.0003954409,0.000993484,0.0033488248,0.00006801966,0.000036462494],"category_scores_gemma":[0.00020120108,0.00019954027,0.00007481525,0.001372592,0.0012993949,0.0017817259,0.0013649493,0.00021525357,0.000029824534],"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.000008507073,0.00014026045,0.005283589,0.000061790946,0.00001244693,0.00009028906,0.0016144664,0.003424736,0.00029291055,0.6885644,0.0000734854,0.3004331],"study_design_scores_gemma":[0.0004960667,0.0001200507,0.023431577,0.0002188653,0.00000452676,0.00025148742,0.000031958618,0.37455606,0.0011705322,0.59921247,0.0000485777,0.00045784735],"about_ca_topic_score_codex":0.000018830708,"about_ca_topic_score_gemma":0.000034605084,"teacher_disagreement_score":0.50745964,"about_ca_system_score_codex":0.00021472093,"about_ca_system_score_gemma":0.00024999876,"threshold_uncertainty_score":0.95801896},"labels":[],"label_agreement":null},{"id":"W2576157276","doi":"10.1017/s0960129520000018","title":"A cubical Squier’s theorem","year":2020,"lang":"en","type":"preprint","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics","score_opus":0.035451640963291696,"score_gpt":0.28993763691340724,"score_spread":0.25448599595011556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576157276","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.0015763331,0.00014020593,0.99046326,0.0012641466,0.0024397948,0.00065363455,0.0000015444422,0.0004225631,0.0030385146],"genre_scores_gemma":[0.7641049,0.0000028763554,0.23487382,0.00055042794,0.00040295982,0.000035940895,0.0000018092662,0.00001654262,0.000010719862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994648,0.00018025987,0.0008331387,0.0019064568,0.00150031,0.0009318763],"domain_scores_gemma":[0.99693274,0.00027092456,0.0002895201,0.0019043144,0.00014756873,0.00045495326],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013565049,0.00054094696,0.00080882735,0.00031039314,0.00021626851,0.0018065206,0.0076808524,0.00027614908,0.000041647243],"category_scores_gemma":[0.0002818378,0.00040294262,0.00021948131,0.0011273616,0.0009989868,0.00036976367,0.009452033,0.0011051602,0.00012030236],"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.0000027490225,0.000051870607,0.00010029364,0.00019453264,0.000008089447,0.00011174989,0.0013990749,0.00050286116,0.00002808101,0.9465954,0.0001884769,0.05081688],"study_design_scores_gemma":[0.00012261531,0.00003902148,0.0004508573,0.00002664131,0.0000037383115,0.00006887675,0.0000043633486,0.36356008,0.00013532741,0.6349748,0.0002984474,0.00031524652],"about_ca_topic_score_codex":0.000019993278,"about_ca_topic_score_gemma":0.000003303892,"teacher_disagreement_score":0.7625286,"about_ca_system_score_codex":0.00020115712,"about_ca_system_score_gemma":0.00047036842,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W2610208837","doi":"10.1017/s0960129517000093","title":"Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions","year":2017,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":16,"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; University of Ottawa","funders":"","keywords":"Variety (cybernetics); Computer science; Syntax; Context (archaeology); Programming language; Logical framework; Qualitative reasoning; Artificial intelligence; Management science","score_opus":0.023865103111449064,"score_gpt":0.2888497279891201,"score_spread":0.26498462487767105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610208837","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.07095097,0.000046233108,0.92765987,0.0001358308,0.00018997313,0.0003227236,7.051085e-7,0.00002749356,0.0006661946],"genre_scores_gemma":[0.79028296,9.3278203e-7,0.20963565,0.000026296097,0.000029344716,0.000015901822,3.213787e-7,0.0000037667303,0.000004799541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855006,0.000024870753,0.000273652,0.0004576094,0.00034803138,0.0003457529],"domain_scores_gemma":[0.99861217,0.00024374222,0.0002510591,0.0006760941,0.00010807981,0.00010886662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106399,0.00014505725,0.00029332112,0.00011854814,0.00051777664,0.0006928985,0.001404339,0.000045334513,0.000003695186],"category_scores_gemma":[0.00022189935,0.000098999124,0.000036045654,0.00014228828,0.0008919079,0.0005904679,0.0004431924,0.00009514373,4.5956352e-7],"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.000007889304,0.000020374424,0.008578308,0.00006179349,0.000007773811,0.000006607719,0.0011250857,0.000090431495,0.000072316376,0.926264,0.000008115674,0.06375734],"study_design_scores_gemma":[0.0010303889,0.00038833884,0.084682316,0.0001449813,0.000010928805,0.0001375541,0.000090171336,0.39323425,0.00078846957,0.5190665,0.00008504698,0.00034101386],"about_ca_topic_score_codex":0.00003809599,"about_ca_topic_score_gemma":0.00005393642,"teacher_disagreement_score":0.71933204,"about_ca_system_score_codex":0.000029288862,"about_ca_system_score_gemma":0.00007821772,"threshold_uncertainty_score":0.66816366},"labels":[],"label_agreement":null},{"id":"W2737177195","doi":"10.1017/s0960129518000014","title":"Integral categories and calculus categories","year":2018,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":20,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coalgebra; Symmetric monoidal category; Mathematics; Differential (mechanical device); Category theory; Fundamental theorem of calculus; Calculus (dental); Differential calculus; Algebra over a field; Pure mathematics; Differential form; Fundamental theorem; Functor","score_opus":0.03026064021300274,"score_gpt":0.3297678971753615,"score_spread":0.29950725696235875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737177195","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.35942495,0.00003293836,0.6381646,0.00021089982,0.0005022318,0.00018276219,0.0000014412258,0.000098326396,0.0013818843],"genre_scores_gemma":[0.6820791,0.0000012747907,0.31755215,0.000113844326,0.00020336838,0.000007022522,2.426432e-7,0.000011913019,0.000031090618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980303,0.000036148347,0.00039751473,0.00051953987,0.0004997846,0.00051668554],"domain_scores_gemma":[0.9986634,0.00042032258,0.000090475594,0.00053139235,0.00014413436,0.00015024366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00050592335,0.00023350366,0.00032238502,0.00016913001,0.00027754751,0.00021235002,0.00070496276,0.00006887301,0.00009122223],"category_scores_gemma":[0.00074002706,0.00017218564,0.0000317666,0.0005819719,0.0033763056,0.00033889734,0.00066313054,0.00024273383,0.000014492475],"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.000005047115,0.000020978268,0.00026432757,0.00005069792,0.000002926854,0.0000108528775,0.0020403299,0.0000017907246,0.00008581908,0.9823746,0.00007507081,0.01506756],"study_design_scores_gemma":[0.00018436702,0.0000591211,0.0009700133,0.000033002787,0.000005056786,0.00011241571,0.000078002704,0.013516796,0.0032032179,0.98151815,0.00011040092,0.00020943866],"about_ca_topic_score_codex":0.000010192596,"about_ca_topic_score_gemma":0.00003146211,"teacher_disagreement_score":0.32265416,"about_ca_system_score_codex":0.00009512851,"about_ca_system_score_gemma":0.00007304268,"threshold_uncertainty_score":0.99933594},"labels":[],"label_agreement":null},{"id":"W2768277027","doi":"10.1017/s0960129519000094","title":"Singular value automata and approximate minimization","year":2019,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Formal Methods in Verification","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":"McGill University","funders":"","keywords":"Singular value decomposition; Mathematics; Automaton; Hankel matrix; Rank (graph theory); Canonical form; Singular value; Construct (python library); Decomposition; Value (mathematics); Minification; Discrete mathematics; Algorithm; Applied mathematics; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Mathematical optimization; Theoretical computer science; Mathematical analysis; Statistics","score_opus":0.014093987979408125,"score_gpt":0.27687725863627083,"score_spread":0.2627832706568627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768277027","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.09964077,0.000020305077,0.89869714,0.00012682848,0.00045730616,0.00027232908,3.3977045e-7,0.00013104186,0.0006539203],"genre_scores_gemma":[0.3358202,0.0000014875719,0.6640081,0.00013794596,0.00001791743,0.000004230522,3.130024e-7,0.000004738577,0.000005094097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979824,0.00008339842,0.00033827778,0.0006457409,0.00058313744,0.00036707654],"domain_scores_gemma":[0.9987215,0.0001286514,0.00010508091,0.00087769475,0.00006086247,0.00010624588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011207996,0.00015854678,0.00020892158,0.00022824558,0.00011543623,0.00047079986,0.0014857737,0.000053732612,0.000013254089],"category_scores_gemma":[0.00016106994,0.00013104474,0.000023858538,0.00090551446,0.00032765503,0.0010334881,0.00085783907,0.00013236226,0.000022816523],"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.0000017509321,0.000024183437,0.00044800484,0.00006486774,0.0000012248222,0.0000027581316,0.0006415825,0.0025181675,0.00045915172,0.92647,0.0000066133503,0.0693617],"study_design_scores_gemma":[0.00015109035,0.00002737019,0.006182674,0.00003005214,9.468937e-7,0.000053357922,0.0000035563535,0.74872994,0.0013143631,0.24335189,0.000028682765,0.00012608946],"about_ca_topic_score_codex":0.0000023806492,"about_ca_topic_score_gemma":1.11235046e-7,"teacher_disagreement_score":0.74621177,"about_ca_system_score_codex":0.00006662136,"about_ca_system_score_gemma":0.000059635833,"threshold_uncertainty_score":0.5343849},"labels":[],"label_agreement":null},{"id":"W2887657530","doi":"10.1017/s0960129518000154","title":"Mechanizing proofs with logical relations – Kripke-style","year":2018,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","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":"McGill University","funders":"","keywords":"Mathematical proof; Computer science; Normalization (sociology); Logical consequence; Theoretical computer science; Programming language; Algebra over a field; Calculus (dental); Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.02551804787441153,"score_gpt":0.26381945737137097,"score_spread":0.23830140949695944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887657530","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.008049759,0.00002046584,0.98611283,0.0002728684,0.00043186513,0.0003244895,1.8441948e-7,0.00021652813,0.0045709903],"genre_scores_gemma":[0.6857498,1.6967863e-7,0.3139088,0.00014948027,0.00013744594,0.000012325332,2.2528134e-7,0.0000055720707,0.00003617215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974794,0.00006381067,0.00035035014,0.0007505107,0.0007596092,0.00059631845],"domain_scores_gemma":[0.9986338,0.00013146576,0.000114172835,0.0007611506,0.00017695267,0.00018246863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084728125,0.00020548528,0.00025074475,0.00019809746,0.00040704326,0.00061221205,0.0018854698,0.00007012564,0.000053565145],"category_scores_gemma":[0.000101745194,0.00012998958,0.000040185307,0.0014427239,0.00080477935,0.0006314199,0.00070437096,0.00020326045,0.000112656715],"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.000002538776,0.00004323271,0.00046498986,0.000014448736,0.0000029644254,0.00002319556,0.0011130986,0.000070199574,0.00008867513,0.96977293,0.000058299633,0.028345443],"study_design_scores_gemma":[0.00022851303,0.00024404316,0.0020297528,0.00001777308,0.0000026834407,0.0002063052,0.0000151723025,0.29758444,0.000726032,0.69819605,0.0005042969,0.00024494607],"about_ca_topic_score_codex":0.000008080292,"about_ca_topic_score_gemma":0.000014661111,"teacher_disagreement_score":0.67770004,"about_ca_system_score_codex":0.00008884944,"about_ca_system_score_gemma":0.000121282144,"threshold_uncertainty_score":0.5903575},"labels":[],"label_agreement":null},{"id":"W2899165262","doi":"10.1017/s0960129518000415","title":"A case study in programming coinductive proofs: Howe’s method","year":2018,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"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":"","keywords":"Mathematical proof; Bisimulation; Coinduction; Computer science; Programming language; Operational semantics; Congruence (geometry); Theoretical computer science; Semantics (computer science); Mathematics","score_opus":0.049183529109427956,"score_gpt":0.3443535858998575,"score_spread":0.2951700567904295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899165262","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.16158447,0.000013637512,0.8361177,0.000062451945,0.00059678836,0.0011406959,1.3253121e-7,0.00013471345,0.00034943852],"genre_scores_gemma":[0.6434786,6.490876e-8,0.3562784,0.000052251493,0.000123296,0.000055187997,6.917042e-8,0.000006857687,0.0000053232334],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963413,0.00027986325,0.00060151983,0.0011489246,0.00080822926,0.0008201782],"domain_scores_gemma":[0.99824274,0.00023723285,0.00015791334,0.0009763444,0.00019407611,0.00019171028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029708375,0.00028683437,0.00042810096,0.00045018244,0.00029225068,0.00080018153,0.0020551106,0.0000748677,0.000010551063],"category_scores_gemma":[0.00019250355,0.00021040434,0.000054312204,0.0024575107,0.00066325447,0.0007775636,0.0012107765,0.0003118061,0.000021571224],"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.000006971046,0.0006372955,0.00740298,0.00006237577,0.000009442088,0.0036936596,0.034125578,0.00010833313,0.00003773971,0.35182706,0.0000136973285,0.60207486],"study_design_scores_gemma":[0.0011471348,0.0010764692,0.0072604935,0.00003331687,0.00000806361,0.011080475,0.0012457648,0.4275876,0.0005168941,0.5492446,0.00010692266,0.0006922714],"about_ca_topic_score_codex":0.00025085916,"about_ca_topic_score_gemma":0.0003151073,"teacher_disagreement_score":0.6013826,"about_ca_system_score_codex":0.00017140676,"about_ca_system_score_gemma":0.00017708748,"threshold_uncertainty_score":0.85800403},"labels":[],"label_agreement":null},{"id":"W2913248536","doi":"10.1017/s0960129506005676","title":"Differential categories","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":93,"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; University of Calgary; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Computer science; Differential (mechanical device); Physics","score_opus":0.013942313346741488,"score_gpt":0.246129583237573,"score_spread":0.23218726989083152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913248536","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.021222088,0.00003480603,0.97488314,0.0001378436,0.0009541616,0.00016826353,1.8854905e-7,0.0001734854,0.002426039],"genre_scores_gemma":[0.9270056,3.4210808e-7,0.07265099,0.00006233608,0.00022455816,0.00000951255,6.1640037e-7,0.0000053285744,0.000040699128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977869,0.000041788375,0.00037070262,0.0005813568,0.0006666828,0.0005525776],"domain_scores_gemma":[0.9990125,0.00009343812,0.000085702726,0.0006390795,0.00007003921,0.00009928723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033065406,0.0001875348,0.00024189282,0.00018377259,0.00021157307,0.0007867247,0.0019882326,0.00005221026,0.000035451023],"category_scores_gemma":[0.000029833234,0.00013344659,0.000056597702,0.00082012353,0.00049546274,0.00048046449,0.0006913927,0.0001409176,0.000040933388],"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":[7.230418e-7,0.000040750936,0.0007245645,0.000019156014,0.0000010707939,0.00001951442,0.0002193299,0.0001377219,0.00016021474,0.9756806,0.00008724578,0.022909138],"study_design_scores_gemma":[0.00015224055,0.000025961222,0.007397497,0.000003186737,0.000001203216,0.00006420397,0.000003212511,0.14898589,0.0012421071,0.84169626,0.00025436713,0.00017383866],"about_ca_topic_score_codex":0.00007085268,"about_ca_topic_score_gemma":0.000014390333,"teacher_disagreement_score":0.90578353,"about_ca_system_score_codex":0.00006719192,"about_ca_system_score_gemma":0.00007365171,"threshold_uncertainty_score":0.7586404},"labels":[],"label_agreement":null},{"id":"W2922234826","doi":"10.1017/s0960129520000146","title":"Nilpotent types and fracture squares in homotopy type theory","year":2020,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"Western University","funders":"","keywords":"Homotopy; Mathematics; Cofibration; Type (biology); Mathematical proof; Pure mathematics; Nilpotent; Construct (python library); Type theory; Constructive; n-connected; Homotopy lifting property; Algebra over a field; Regular homotopy; Space (punctuation); Discrete mathematics; Computer science; Geometry","score_opus":0.02648866468639146,"score_gpt":0.3035279746954387,"score_spread":0.27703931000904725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922234826","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.8634525,0.00018439088,0.13121852,0.003943337,0.00023429122,0.00032105914,0.0000014344567,0.00007682524,0.00056764623],"genre_scores_gemma":[0.95181495,0.000005391571,0.04620292,0.0018614441,0.000090624635,0.0000062886497,3.6365535e-7,0.000010456952,0.0000075345815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984274,0.00013359016,0.0003129344,0.0004696547,0.00026999667,0.00038642852],"domain_scores_gemma":[0.99876565,0.000703695,0.00006740139,0.00028170226,0.00003742599,0.0001441136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061630004,0.00018537759,0.000354412,0.0001228055,0.00008624499,0.000063298976,0.0005814756,0.000119851415,0.00024209834],"category_scores_gemma":[0.0008132456,0.00013831622,0.000029751447,0.0005212338,0.00088596845,0.0001194521,0.0003485618,0.00036326938,0.000015520956],"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.00004051033,0.000058017802,0.0028773702,0.000113158436,0.0000067711208,0.00010674692,0.004185249,0.000107251726,0.00012319366,0.9798163,0.00015647015,0.012408942],"study_design_scores_gemma":[0.00026914035,0.000101242375,0.0062514613,0.00003192043,0.0000058361898,0.00007942119,0.000059735736,0.013300475,0.00041045956,0.9792407,0.00008962514,0.00015997431],"about_ca_topic_score_codex":0.000002544663,"about_ca_topic_score_gemma":0.000005763323,"teacher_disagreement_score":0.088362485,"about_ca_system_score_codex":0.000033304445,"about_ca_system_score_gemma":0.00006317548,"threshold_uncertainty_score":0.56403714},"labels":[],"label_agreement":null},{"id":"W2963520450","doi":"10.1017/s0960129517000196","title":"On geometry of interaction for polarized linear logic","year":2017,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"University of Ottawa","funders":"Precursory Research for Embryonic Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Linear logic; Bimodule; Mathematical proof; Multiplicative function; Morphism; Pure mathematics; Mathematics; Algebra over a field; Categorical variable; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.04306107150266057,"score_gpt":0.33065660298121924,"score_spread":0.28759553147855865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963520450","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.018772636,0.000010161605,0.9789562,0.00019031482,0.0010891729,0.00030484286,6.451186e-7,0.000043640874,0.000632353],"genre_scores_gemma":[0.80060774,3.783819e-7,0.19919614,0.00009366063,0.00007825301,0.000008737985,2.8108866e-7,0.0000037838274,0.000011014237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983965,0.00002930241,0.00034512745,0.00046388042,0.0004352546,0.0003299232],"domain_scores_gemma":[0.998173,0.0003064968,0.0002827166,0.001036689,0.00011688323,0.000084220366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000911341,0.00013981643,0.000275483,0.00020653382,0.00031886742,0.00043783506,0.0025363541,0.000057887937,0.00000900088],"category_scores_gemma":[0.0005453207,0.00009818721,0.00007982746,0.00023799662,0.00039640712,0.0005030262,0.00057691464,0.00012987167,0.0000104100345],"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.00000820306,0.000054003092,0.0001869867,0.00005540657,0.0000030664812,0.000003417144,0.00021615725,0.00013131747,0.00041058866,0.9660104,0.000015446025,0.032905035],"study_design_scores_gemma":[0.0002896397,0.00013899748,0.0015898909,0.000015763111,0.0000015111575,0.00001646077,0.0000035305218,0.30312192,0.0018566863,0.69280446,0.000059102276,0.0001020148],"about_ca_topic_score_codex":0.000017019453,"about_ca_topic_score_gemma":0.0000023877753,"teacher_disagreement_score":0.78183514,"about_ca_system_score_codex":0.000049804476,"about_ca_system_score_gemma":0.000051875737,"threshold_uncertainty_score":0.4713219},"labels":[],"label_agreement":null},{"id":"W2979931682","doi":"10.1017/s0960129519000136","title":"A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller’s 60th birthday","year":2019,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Algebra and Logic","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":"École de Technologie Supérieure","funders":"","keywords":"Surprise; Miller; Event (particle physics); Computer science; Computation; Artificial intelligence; Cognitive science; Psychology; Algorithm; Communication","score_opus":0.008451916697481883,"score_gpt":0.2712746612722881,"score_spread":0.2628227445748062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979931682","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.6348422,0.000015196751,0.36315125,0.00008978221,0.00054414495,0.0004131027,0.0000011164,0.00008858681,0.0008545741],"genre_scores_gemma":[0.83496934,6.9590214e-7,0.16473548,0.00009358928,0.00018339283,0.0000039845254,0.0000010000355,0.000005805496,0.0000067133496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.00011637726,0.00044638265,0.00062061386,0.0005355182,0.00036124288],"domain_scores_gemma":[0.9990238,0.00029716897,0.00017005636,0.00036525205,0.00006403582,0.0000797048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063660514,0.0001977737,0.0003289378,0.00034374007,0.00008803656,0.00016363995,0.0007671453,0.000059357655,0.000039021525],"category_scores_gemma":[0.000108723514,0.00015155428,0.000029696137,0.0009794215,0.00031040589,0.0006060666,0.0003761681,0.0001856604,0.000008233342],"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.00003705072,0.00006685178,0.0028538562,0.00013533658,0.0000041663247,0.000018420396,0.0047770073,0.04902414,0.0007387391,0.7615502,0.00004382137,0.18075043],"study_design_scores_gemma":[0.00035797217,0.00011352243,0.02815319,0.000085656786,7.8420004e-7,0.000022966848,0.00001953173,0.688693,0.0011965743,0.28121153,0.000007997035,0.00013731373],"about_ca_topic_score_codex":0.0000042122906,"about_ca_topic_score_gemma":0.000004941734,"teacher_disagreement_score":0.6396688,"about_ca_system_score_codex":0.00007800776,"about_ca_system_score_gemma":0.00006462121,"threshold_uncertainty_score":0.6180205},"labels":[],"label_agreement":null},{"id":"W2990660716","doi":"10.1017/s0960129519000070","title":"Categorical models of the differential λ-calculus","year":2019,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"University of Calgary","funders":"","keywords":"Differential calculus; Mathematics; Differential (mechanical device); Calculus (dental); Categorical variable; Algebra over a field; Mathematical proof; Cartesian closed category; Category theory; Differential form; Pure mathematics","score_opus":0.01983313019163382,"score_gpt":0.24682710353335344,"score_spread":0.2269939733417196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990660716","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.06268153,0.000021327654,0.93422425,0.00011599168,0.0011886768,0.00028953585,1.7337193e-7,0.00004385609,0.0014346364],"genre_scores_gemma":[0.9825576,4.1343606e-7,0.017277725,0.00007336129,0.000051592968,0.000005055558,9.987115e-8,0.000004583108,0.000029600562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978267,0.000068661124,0.00037984631,0.000484881,0.00083249534,0.00040741492],"domain_scores_gemma":[0.99862546,0.0001122718,0.00012327507,0.0009720904,0.00007655553,0.00009033986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224597,0.00015287599,0.00027722068,0.000098006676,0.00009661298,0.00020900829,0.003089803,0.00005669034,0.000025953195],"category_scores_gemma":[0.000032508855,0.000084565116,0.0000963124,0.00086702395,0.00039205694,0.0003606282,0.001341009,0.00017719934,0.000021874052],"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.0000011231905,0.000039024988,0.00046003106,0.000034610697,0.0000021554795,0.0000021260378,0.00052353047,0.0013280485,0.00023992083,0.98491925,0.000013166178,0.012436988],"study_design_scores_gemma":[0.00011492101,0.000020709353,0.0019107648,0.0000041201715,0.0000010710277,0.000025320829,0.0000030372835,0.5052008,0.0006191339,0.49200872,0.000016358408,0.00007505838],"about_ca_topic_score_codex":0.000019965177,"about_ca_topic_score_gemma":0.0000020428743,"teacher_disagreement_score":0.91987604,"about_ca_system_score_codex":0.000056419372,"about_ca_system_score_gemma":0.00009702241,"threshold_uncertainty_score":0.57416743},"labels":[],"label_agreement":null},{"id":"W3004260013","doi":"10.1017/s0960129519000215","title":"Multisets, heaps, bags, families: What is a multiset?","year":2020,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"DNA and Biological Computing","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":"Western University","funders":"","keywords":"Multiset; Morphism; Intersection (aeronautics); Complement (music); Connection (principal bundle); Mathematics; Simple (philosophy); Category theory; Current (fluid); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Epistemology","score_opus":0.019840929839952937,"score_gpt":0.2744189667916013,"score_spread":0.2545780369516484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004260013","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.76559955,0.00058248255,0.23186935,0.0011782247,0.00028608425,0.00026288896,0.0000066455154,0.00004197475,0.00017278997],"genre_scores_gemma":[0.9323439,0.000048009693,0.06219067,0.005167382,0.0002279131,0.000004227408,0.0000058329956,0.0000080566715,0.000004005398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982657,0.00004166597,0.00029453452,0.0006919877,0.00028761462,0.000418525],"domain_scores_gemma":[0.999331,0.00004346192,0.000056813526,0.00030372856,0.00005226015,0.00021272813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022992535,0.00019317477,0.0002142762,0.00003912048,0.00012176057,0.00023033509,0.0007887377,0.00009256364,0.00004548541],"category_scores_gemma":[0.0001553134,0.00014006544,0.00007289152,0.00033591993,0.0004532838,0.000022251199,0.00077283994,0.00014239652,0.000020359319],"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.000105214676,0.00021019012,0.0066934777,0.0002364773,0.000029597946,0.00007118941,0.002729525,0.001890053,0.2310139,0.004332314,0.0017994887,0.7508886],"study_design_scores_gemma":[0.00209366,0.0010679117,0.022410043,0.00025063351,0.000015859207,0.00012610169,0.0004206372,0.763777,0.16907635,0.02688031,0.012325773,0.0015556826],"about_ca_topic_score_codex":0.000003474441,"about_ca_topic_score_gemma":0.0000011706334,"teacher_disagreement_score":0.76188695,"about_ca_system_score_codex":0.000015194831,"about_ca_system_score_gemma":0.000043735905,"threshold_uncertainty_score":0.5711703},"labels":[],"label_agreement":null},{"id":"W3037660916","doi":"10.1017/s0960129513000637","title":"Quantifying opacity","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Opacity; Predicate (mathematical logic); Probabilistic logic; Random variable; Observable; Computer science; Computation; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.046015791376332896,"score_gpt":0.3060719185987094,"score_spread":0.26005612722237653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037660916","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.056348927,0.000013322775,0.94104373,0.00041585206,0.0006664817,0.00010422128,1.7132746e-7,0.00018600815,0.0012212858],"genre_scores_gemma":[0.615448,4.0244623e-7,0.38412082,0.00034334944,0.00008007384,0.0000026792532,1.1587839e-7,0.0000032107957,0.0000013500174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767584,0.00009697289,0.0003918337,0.00069072,0.000649655,0.0004950088],"domain_scores_gemma":[0.9983058,0.00042997717,0.00010145789,0.000919621,0.00008781463,0.00015533708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017577843,0.00016377875,0.00021898009,0.00024265362,0.00032913729,0.0006402568,0.0027575141,0.000046157165,0.000019262996],"category_scores_gemma":[0.00033466818,0.00013962007,0.000049324226,0.0012556734,0.00039478482,0.00066291296,0.00086561893,0.00022809167,0.000045366804],"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":[6.3775974e-7,0.000024958323,0.00064732734,0.000020775295,7.8799286e-7,0.0000023180382,0.00061118376,0.0010582942,0.0001729647,0.9004303,0.000023942974,0.09700651],"study_design_scores_gemma":[0.00010763246,0.000014865548,0.006516864,0.00002438925,5.0379924e-7,0.000036221616,0.000003057551,0.6918923,0.00091024576,0.30018732,0.0001702024,0.00013637367],"about_ca_topic_score_codex":0.0000057268417,"about_ca_topic_score_gemma":0.0000019929876,"teacher_disagreement_score":0.69083405,"about_ca_system_score_codex":0.0000714999,"about_ca_system_score_gemma":0.00006587472,"threshold_uncertainty_score":0.6174011},"labels":[],"label_agreement":null},{"id":"W3193829882","doi":"10.1017/s0960129521000104","title":"An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties","year":2021,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Backslash; Integer (computer science); Approximation algorithm; Polynomial; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.01743896178105551,"score_gpt":0.2454790333430609,"score_spread":0.2280400715620054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193829882","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.008870053,0.000015426545,0.98855597,0.0011493589,0.00021116999,0.00060820964,0.0000018070264,0.000064091,0.000523944],"genre_scores_gemma":[0.42571756,0.0000016023797,0.5720082,0.0016902756,0.00038162546,0.000121602614,0.000016763657,0.000013471131,0.000048920534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862975,0.000009486636,0.00026572958,0.00039786324,0.0004037466,0.00029345337],"domain_scores_gemma":[0.9992322,0.000049323015,0.000059035076,0.00038088564,0.00026101904,0.00001753995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006734807,0.00013965093,0.00013726909,0.00009085893,0.0003361161,0.0006804281,0.0004749844,0.000021589618,0.00008731568],"category_scores_gemma":[0.00004599247,0.00008456489,0.000032905882,0.000672352,0.00025878075,0.00090131146,0.00020813577,0.00008182518,0.000008100292],"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.00002091607,0.0002560768,0.00022636076,0.00060883694,0.000019871275,0.0000050667677,0.00077331037,0.028344348,0.00035382042,0.35196772,0.00026873892,0.61715496],"study_design_scores_gemma":[0.00026161398,0.000014789894,0.0015976782,0.000019158319,0.000012519347,0.0000042451693,0.00016380352,0.94162285,0.00014032313,0.055155713,0.00087365514,0.00013361924],"about_ca_topic_score_codex":0.000044372784,"about_ca_topic_score_gemma":0.000101556354,"teacher_disagreement_score":0.9132785,"about_ca_system_score_codex":0.000032727952,"about_ca_system_score_gemma":0.0000507189,"threshold_uncertainty_score":0.6561384},"labels":[],"label_agreement":null},{"id":"W3213158637","doi":"10.1017/s0960129521000323","title":"A focused linear logical framework and its application to metatheory of object logics","year":2021,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"University of Ottawa","funders":"","keywords":"Metatheory; Natural deduction; Sequent calculus; Completeness (order theory); Computer science; Linear logic; Rule of inference; Sequent; Proof calculus; Cut-elimination theorem; Programming language; First-order logic; Theoretical computer science; Concurrency; Inference; Mathematics; Algorithm; Mathematical proof; Artificial intelligence","score_opus":0.02602241376037715,"score_gpt":0.2903041255594583,"score_spread":0.2642817117990811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213158637","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.03315377,0.00016125754,0.9656466,0.00023952786,0.00020651998,0.00028720207,4.861323e-7,0.00006283438,0.0002417783],"genre_scores_gemma":[0.65138996,0.0000018964593,0.34832695,0.00021782386,0.000044004082,0.000012022942,2.1325968e-7,0.0000033448096,0.0000037783157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791574,0.000101552105,0.00040195003,0.0006768771,0.00054871774,0.00035515838],"domain_scores_gemma":[0.9985212,0.0003942233,0.00010399979,0.00061811914,0.0001851049,0.00017732481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009490115,0.00016170532,0.00034156098,0.00013211825,0.00010619985,0.00017400862,0.0011567706,0.00008753269,0.000010525844],"category_scores_gemma":[0.00049107725,0.00011750255,0.000052175437,0.0013329925,0.00023089511,0.00020718345,0.00096421904,0.0001771361,0.000014479949],"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.0000021205824,0.000050361316,0.00014639804,0.0000525223,0.0000031897564,0.00001621198,0.00083587726,0.00038339134,0.00069767225,0.9504079,0.0000027537224,0.047401555],"study_design_scores_gemma":[0.00010005225,0.000066839435,0.0015615958,0.000013948284,0.0000027762155,0.000052333868,0.000010012622,0.23173128,0.004946985,0.7613017,0.00007746443,0.00013502021],"about_ca_topic_score_codex":0.000002450624,"about_ca_topic_score_gemma":0.000001924446,"teacher_disagreement_score":0.6182362,"about_ca_system_score_codex":0.00003335297,"about_ca_system_score_gemma":0.0000949126,"threshold_uncertainty_score":0.4791615},"labels":[],"label_agreement":null},{"id":"W3213890954","doi":"10.1017/s0960129521000372","title":"Two-stage submodular maximization problem beyond nonnegative and monotone","year":2021,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Mathematics; Matroid; Combinatorics; Cardinality (data modeling); Maximization; Constraint (computer-aided design); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.013735870939906622,"score_gpt":0.2589103105992053,"score_spread":0.24517443965929864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213890954","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.048744164,0.00009471587,0.9491312,0.0005287701,0.00024536645,0.00021042184,0.0000028929912,0.000089767,0.00095270673],"genre_scores_gemma":[0.38196528,0.0000052537293,0.61771536,0.00024567032,0.000037841844,0.000008323514,0.0000010339277,0.0000052422292,0.00001598817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975808,0.000087014836,0.0003688062,0.0008623071,0.0006341287,0.00046694538],"domain_scores_gemma":[0.99866575,0.00020270309,0.00009194774,0.0006937265,0.0001724211,0.0001734375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058752263,0.00021019766,0.00027875594,0.00021457694,0.00029949713,0.00070214795,0.0011669815,0.0000442525,0.000037102152],"category_scores_gemma":[0.00009270683,0.00018536166,0.000045947254,0.0016397901,0.0006696264,0.0008337877,0.0014970548,0.00022240545,0.0000055390738],"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.0000015427261,0.0000589835,0.00033533227,0.00004367646,0.000004084464,0.00007867702,0.0011603172,0.0024692458,0.00045605595,0.93764895,0.000008254427,0.05773485],"study_design_scores_gemma":[0.00022117361,0.000017409777,0.0020371107,0.000024743345,0.0000013438323,0.00008535322,0.000013262623,0.491502,0.0027371421,0.50319165,0.000025559526,0.00014326145],"about_ca_topic_score_codex":0.000010068886,"about_ca_topic_score_gemma":0.00001161123,"teacher_disagreement_score":0.48903275,"about_ca_system_score_codex":0.000060824364,"about_ca_system_score_gemma":0.00012993514,"threshold_uncertainty_score":0.7558829},"labels":[],"label_agreement":null},{"id":"W4205197728","doi":"10.1017/s0960129599002996","title":"Introduction","year":2000,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Honour; Wish; Philosophy of mathematics; Publication; Computer science; Classics; Library science; Art history; Philosophy; Epistemology; History; Sociology; Law; Political science; Anthropology","score_opus":0.009863122991491707,"score_gpt":0.24837482871686095,"score_spread":0.23851170572536926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205197728","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.06643367,0.000026959218,0.9285145,0.0022158998,0.00084239,0.00023339827,4.972702e-7,0.00027502252,0.0014576946],"genre_scores_gemma":[0.4455479,0.0000020478906,0.5535614,0.00032204934,0.000508252,0.000008736505,3.6814683e-7,0.0000065976747,0.00004267105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967767,0.000086381064,0.00047875845,0.0011090653,0.0008853116,0.0006637631],"domain_scores_gemma":[0.9981365,0.00017239225,0.000059517002,0.0013404073,0.000092884104,0.00019825126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645947,0.00023792608,0.00029072838,0.00025063544,0.00022344809,0.00058849924,0.003003078,0.000057512338,0.0007854313],"category_scores_gemma":[0.00010477742,0.00019371764,0.00006870648,0.0019132005,0.0006488321,0.000960745,0.0007469085,0.00026443193,0.00022184668],"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.0000027802832,0.00009594218,0.00011592534,0.000017109052,0.000001858878,0.00002377031,0.0004672216,0.006821682,0.00009445456,0.19541524,0.000312511,0.7966315],"study_design_scores_gemma":[0.00013132815,0.000039235012,0.005786009,0.000007328328,9.286775e-7,0.00014691395,0.0000015687867,0.5813419,0.00037620272,0.41120923,0.0007767548,0.00018256721],"about_ca_topic_score_codex":0.0000082557335,"about_ca_topic_score_gemma":0.000002120572,"teacher_disagreement_score":0.79644895,"about_ca_system_score_codex":0.00017106597,"about_ca_system_score_gemma":0.00010052057,"threshold_uncertainty_score":0.8599922},"labels":[],"label_agreement":null},{"id":"W4321372229","doi":"10.1017/s096012952200038x","title":"Monoidal reverse differential categories","year":2022,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Logic, programming, and type systems","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":"Dalhousie University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential (mechanical device); Symmetric monoidal category; Computer science; Theoretical computer science; Mathematics; Algebra over a field; Pure mathematics; Physics","score_opus":0.017843116399697743,"score_gpt":0.2500368813857108,"score_spread":0.23219376498601305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321372229","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.020780018,0.000036299738,0.9760534,0.0002560396,0.0016895217,0.00031188948,7.2131405e-7,0.00015332291,0.0007187899],"genre_scores_gemma":[0.9554495,4.8276183e-7,0.044113904,0.00020900299,0.0001123346,0.000056175977,8.2438135e-7,0.000006552928,0.000051198116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973403,0.000110955,0.00036050047,0.00066395587,0.00096847315,0.0005558012],"domain_scores_gemma":[0.9988631,0.000099327786,0.000106071784,0.0007409216,0.000049038692,0.00014153024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687734,0.00018565793,0.00025550072,0.00022175121,0.0005823251,0.0004980221,0.0028755907,0.000029483803,0.00014029614],"category_scores_gemma":[0.000044035172,0.00014778622,0.00006858142,0.0010720758,0.00037871662,0.00041586155,0.002475873,0.00028674927,0.00002097306],"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.000002691524,0.00006039274,0.0003282554,0.000019991858,0.0000026950127,0.000046358848,0.0015470922,0.0006678065,0.00012820424,0.9615204,0.00019088699,0.03548528],"study_design_scores_gemma":[0.00023722317,0.000084580235,0.001387137,0.0000016436775,0.0000019929023,0.00016843918,0.00003931825,0.28050387,0.00029525004,0.71552753,0.001519696,0.00023332749],"about_ca_topic_score_codex":0.00003386751,"about_ca_topic_score_gemma":0.0000033595236,"teacher_disagreement_score":0.9346695,"about_ca_system_score_codex":0.00015199538,"about_ca_system_score_gemma":0.00012515365,"threshold_uncertainty_score":0.6026547},"labels":[],"label_agreement":null},{"id":"W4361272622","doi":"10.1017/s0960129523000099","title":"Behavioural equivalences for continuous-time Markov processes","year":2023,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","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":"McGill University","funders":"","keywords":"Bisimulation; Equivalence (formal languages); Morphism; Mathematical proof; Theoretical computer science; Computer science; Equivalence relation; Mathematics; Discrete time and continuous time; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.03218182029196753,"score_gpt":0.2961706072596858,"score_spread":0.26398878696771827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361272622","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.11729612,0.000038724964,0.8794071,0.00084607664,0.00079813757,0.0007566201,0.000008641992,0.0006505851,0.00019799818],"genre_scores_gemma":[0.5243134,0.0000021677351,0.47523808,0.0001673119,0.00013258254,0.000078218975,0.000002389328,0.00001343737,0.000052388357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959107,0.000072744,0.00063402904,0.001234951,0.0010590955,0.0010885011],"domain_scores_gemma":[0.997002,0.0013237501,0.00015026929,0.0009551449,0.00033398,0.00023484143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001873815,0.0003314717,0.0004917963,0.0004521745,0.00035783745,0.0008868741,0.004345412,0.00008208921,0.000042890504],"category_scores_gemma":[0.0007575746,0.00026361275,0.0001102248,0.0031365089,0.00084753596,0.00091500406,0.0020309344,0.00019156722,0.00008053922],"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.00003538668,0.00057331595,0.012417919,0.0012967347,0.000027779184,0.00023536006,0.005178647,0.005596862,0.0012388969,0.21635039,0.002366084,0.7546826],"study_design_scores_gemma":[0.00025475278,0.000111447625,0.010740914,0.00005063749,0.0000033980116,0.00005493834,0.000011044646,0.6334641,0.0006840502,0.3542832,0.000044092976,0.0002974425],"about_ca_topic_score_codex":0.000008720293,"about_ca_topic_score_gemma":0.0000043570462,"teacher_disagreement_score":0.7543852,"about_ca_system_score_codex":0.00011930631,"about_ca_system_score_gemma":0.0003060522,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W4361772762","doi":"10.1017/s0960129523000075","title":"Preface to Special Issue: LSFA 2019 and 2020","year":2022,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Digital Education and Society","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":"University of Ottawa","funders":"","keywords":"Content (measure theory); Computer science; Action (physics); Information retrieval; World Wide Web; Mathematics; Physics","score_opus":0.008685593564779668,"score_gpt":0.2692667215899298,"score_spread":0.26058112802515015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361772762","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.11730464,0.000064611115,0.8596206,0.009390202,0.0034303027,0.0006279019,0.000008141542,0.0001713076,0.009382348],"genre_scores_gemma":[0.56769097,0.0000024770625,0.4252025,0.005631747,0.00081890315,0.000034488083,9.598405e-7,0.000010576823,0.00060738175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980818,0.000042656702,0.00023032838,0.00057682174,0.0007144914,0.00035388125],"domain_scores_gemma":[0.9991105,0.000101595695,0.00004299438,0.0004759752,0.000039435196,0.00022947585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005813732,0.00012561966,0.00016059341,0.00010529517,0.0003267767,0.00058171706,0.0017948,0.00001699639,0.00028773455],"category_scores_gemma":[0.000073850126,0.00011241245,0.000032295917,0.0012051039,0.00021738697,0.00045242455,0.002426489,0.00017641259,0.00004277912],"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.0000049355053,0.00016779745,0.00033493288,0.000029796387,0.000004069684,0.000020878559,0.01746398,0.0030102592,0.000103852915,0.5658409,0.07063957,0.34237906],"study_design_scores_gemma":[0.0004746626,0.00024264185,0.02765058,0.000020656344,0.0000029716787,0.0002630996,0.00031160907,0.348936,0.00023927138,0.5269738,0.09418269,0.0007020545],"about_ca_topic_score_codex":0.0000050609474,"about_ca_topic_score_gemma":8.328213e-7,"teacher_disagreement_score":0.45038635,"about_ca_system_score_codex":0.00011271694,"about_ca_system_score_gemma":0.0001346662,"threshold_uncertainty_score":0.5609511},"labels":[],"label_agreement":null},{"id":"W4381734619","doi":"10.1017/s0960129523000178","title":"Univalent categories of modules","year":2023,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Coproduct; Derived category; Abelian category; Sheaf; Axiom; Abelian group; Pure mathematics; Homotopy category; Ring (chemistry); Enriched category; Functor; Homotopy; Discrete mathematics; Geometry","score_opus":0.03598980780284592,"score_gpt":0.32376134764797687,"score_spread":0.28777153984513093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381734619","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.87386215,0.000014501548,0.12434946,0.00032321215,0.00038951784,0.00015935976,0.0000024604312,0.00012252356,0.0007768372],"genre_scores_gemma":[0.94160795,0.0000037053376,0.05824985,0.00004193109,0.00004399177,0.000008114659,5.672802e-7,0.000007968791,0.000035914643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984448,0.000061450264,0.00040451353,0.0003108628,0.00037976378,0.0003985889],"domain_scores_gemma":[0.9988015,0.00051456067,0.000092960705,0.00046184027,0.000059252143,0.00006985217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773379,0.00013807134,0.0003208378,0.0002910121,0.00009393845,0.000022873186,0.0007882824,0.00006925003,0.0001029042],"category_scores_gemma":[0.00039787163,0.00010218316,0.000050732964,0.0010156501,0.0015328422,0.00009341278,0.00042778885,0.00014457369,0.000024095076],"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.00000356976,0.000034811448,0.0005406599,0.000095966694,0.0000049715964,0.000026503652,0.0010910183,0.000087044384,0.00023983531,0.99156,0.00018637112,0.006129278],"study_design_scores_gemma":[0.00013645412,0.000035844398,0.0050916797,0.000024412664,0.0000064505043,0.000048195536,0.000056776757,0.019456869,0.0027896403,0.97223866,0.0000125382185,0.00010247412],"about_ca_topic_score_codex":0.000004973905,"about_ca_topic_score_gemma":0.000005121637,"teacher_disagreement_score":0.06774583,"about_ca_system_score_codex":0.000034107652,"about_ca_system_score_gemma":0.000061009225,"threshold_uncertainty_score":0.5647821},"labels":[],"label_agreement":null},{"id":"W4402619220","doi":"10.1017/s0960129525100339","title":"Exponentiable functors between synthetic $\\boldsymbol{\\infty}$-categories","year":2025,"lang":"en","type":"preprint","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":0,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Functor; Mathematics; Pure mathematics","score_opus":0.03624767132488236,"score_gpt":0.3223249797455608,"score_spread":0.2860773084206784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402619220","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.42355305,0.00017821392,0.5652464,0.00069689815,0.00361938,0.0010803031,0.00004855328,0.00037436353,0.0052028485],"genre_scores_gemma":[0.870895,0.0000070672486,0.12814216,0.00019410087,0.00037030803,0.00010279977,0.000008826819,0.00003005591,0.0002496144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948625,0.00028294497,0.0012652752,0.00153035,0.000913871,0.0011450434],"domain_scores_gemma":[0.9951674,0.002105734,0.00037852948,0.001943927,0.00016245349,0.00024199921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017496247,0.00071272964,0.0014296349,0.0007165691,0.0003479666,0.00031408417,0.0032968835,0.000670118,0.00053627294],"category_scores_gemma":[0.0010111773,0.00059601525,0.000246926,0.00081249385,0.0026378632,0.00016262618,0.0046992665,0.0014648905,0.000040031824],"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.0000121521925,0.00014673262,0.00334888,0.0012066914,0.000079460864,0.000066142566,0.0017293855,0.00026305043,0.000023765077,0.9796997,0.00049367413,0.012930403],"study_design_scores_gemma":[0.00023192691,0.000040568146,0.0020866878,0.0003886314,0.000087162436,0.00004331267,0.00003537632,0.0058527035,0.0011733478,0.9894174,0.00009571634,0.00054716785],"about_ca_topic_score_codex":0.000027721826,"about_ca_topic_score_gemma":0.000010712805,"teacher_disagreement_score":0.447342,"about_ca_system_score_codex":0.00025822036,"about_ca_system_score_gemma":0.00060471287,"threshold_uncertainty_score":0.9996491},"labels":[],"label_agreement":null},{"id":"W4404194047","doi":"10.1017/s0960129524000276","title":"Optimal approximate minimization of one-letter weighted finite automata","year":2024,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"semigroups and automata theory","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 Montréal; Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Minification; Automaton; DFA minimization; Computer science; Mathematics; Algorithm; Nondeterministic finite automaton; Mathematical optimization; Automata theory; Theoretical computer science","score_opus":0.014219542662139094,"score_gpt":0.25226532507429367,"score_spread":0.23804578241215457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404194047","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.040534,0.00008719302,0.9572521,0.0006482277,0.0006110169,0.00018549386,0.000004137926,0.00032780468,0.0003500282],"genre_scores_gemma":[0.5175095,0.0000025206828,0.48216632,0.00023052953,0.00006814143,0.000006591191,0.0000012981693,0.000008327261,0.000006740635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745876,0.00006411916,0.0005363915,0.0007181049,0.0007649828,0.00045765968],"domain_scores_gemma":[0.9984699,0.00043605774,0.000087504915,0.000832976,0.00006653137,0.000107056236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008014215,0.0002123229,0.00030239267,0.00044291906,0.00009406403,0.00060891017,0.0021457062,0.00006613963,0.00006328289],"category_scores_gemma":[0.00006743492,0.00016567014,0.00007524837,0.0016671404,0.00050412514,0.00095299986,0.00095078466,0.00018826115,0.000027105456],"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.0000042475,0.00009998214,0.00003592741,0.000315129,0.0000113728365,0.000053540723,0.001534321,0.0049318196,0.0010092135,0.8631479,0.0002875027,0.12856904],"study_design_scores_gemma":[0.00011635178,0.000027581733,0.00048760657,0.00017122144,0.0000034383934,0.000034113447,0.0000024419157,0.77770853,0.003808326,0.21740648,0.00007646319,0.00015746913],"about_ca_topic_score_codex":0.0000024442652,"about_ca_topic_score_gemma":2.0385424e-7,"teacher_disagreement_score":0.77277666,"about_ca_system_score_codex":0.000057884605,"about_ca_system_score_gemma":0.000105683495,"threshold_uncertainty_score":0.67558324},"labels":[],"label_agreement":null},{"id":"W4412733311","doi":"10.1017/s0960129525000155","title":"The Grothendieck construction in the context of tangent categories","year":2025,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"","keywords":"Context (archaeology); Computer science; Mathematics; Geology","score_opus":0.0191740323352979,"score_gpt":0.3105130004430579,"score_spread":0.29133896810776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412733311","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.8269111,0.00020287515,0.16182272,0.0044308654,0.0012109188,0.00087856414,0.0000025661611,0.00003606678,0.0045043565],"genre_scores_gemma":[0.9848794,0.0000051856177,0.0147498865,0.00028707588,0.000027031854,0.000034609602,1.5634046e-7,0.0000031407762,0.000013531648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845654,0.0001950094,0.0004948045,0.00023983819,0.0002984711,0.0003153444],"domain_scores_gemma":[0.99726224,0.0020459597,0.000110565,0.00050425495,0.000055199336,0.000021797732],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015034587,0.00012505849,0.00025082365,0.00013289948,0.00023164344,0.00006149555,0.001141195,0.00006619671,0.000026170377],"category_scores_gemma":[0.000563282,0.00006473028,0.000045837463,0.0006851107,0.0031442451,0.000065686014,0.00021748875,0.00024500414,0.0000020081216],"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.000009082165,0.000034507982,0.0011125724,0.00003755464,0.000005250451,0.000005597201,0.002463453,0.0000045620077,0.000029049053,0.97139466,0.00009503546,0.024808697],"study_design_scores_gemma":[0.00020117321,0.000027098491,0.0034056273,0.000033443528,0.000005968527,0.000069011745,0.00087155506,0.0020276192,0.0011225924,0.99206215,0.000111589216,0.000062163475],"about_ca_topic_score_codex":0.000017392475,"about_ca_topic_score_gemma":0.00013242863,"teacher_disagreement_score":0.15796831,"about_ca_system_score_codex":0.0000540796,"about_ca_system_score_gemma":0.000106868276,"threshold_uncertainty_score":0.99956864},"labels":[],"label_agreement":null},{"id":"W4414483426","doi":"10.1017/s0960129525100248","title":"Limits and colimits in synthetic $\\infty$-categories","year":2025,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"University of Ottawa","funders":"","keywords":"Limit (mathematics); Model category; Homotopy; Homotopy category; Type (biology); Type theory","score_opus":0.021158356950649895,"score_gpt":0.3139704145671298,"score_spread":0.29281205761647994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414483426","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.9001774,0.00011478915,0.093078434,0.0012695378,0.0004588593,0.00035746902,0.000001032093,0.000066529574,0.004475923],"genre_scores_gemma":[0.9549791,0.000006229705,0.04452946,0.00037706594,0.00002354409,0.00002381364,1.5711846e-7,0.000006432579,0.00005414967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982332,0.00009983806,0.00045658834,0.0004958091,0.0002328572,0.0004816919],"domain_scores_gemma":[0.9981961,0.0012081518,0.000061839,0.00041660428,0.000041638767,0.00007565011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082045177,0.00019035266,0.00039819692,0.0003898116,0.00013172047,0.000086924054,0.00063913234,0.00012200567,0.000056279823],"category_scores_gemma":[0.00085176615,0.00015465065,0.000029351098,0.0008152404,0.0016055984,0.00013003567,0.00038838753,0.00028361974,0.0000059434315],"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.000008301971,0.00006162773,0.0025545617,0.00010970854,0.0000040256637,0.00003566737,0.0007966793,0.000015246103,0.00007134758,0.9787155,0.00004483515,0.017582508],"study_design_scores_gemma":[0.00030237183,0.000030242805,0.012587474,0.00010251925,0.000006511497,0.000090930036,0.000045251647,0.010846411,0.00093933014,0.97487354,0.00003287444,0.00014253624],"about_ca_topic_score_codex":0.0000068546383,"about_ca_topic_score_gemma":0.000045436853,"teacher_disagreement_score":0.05480172,"about_ca_system_score_codex":0.00007158277,"about_ca_system_score_gemma":0.00011531033,"threshold_uncertainty_score":0.63064706},"labels":[],"label_agreement":null},{"id":"W4416725058","doi":"10.1017/s0960129525100273","title":"Pseudolimits for tangent categories with applications to equivariant algebraic and differential geometry","year":2025,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"University of Calgary; Dalhousie University","funders":"","keywords":"Morphism; Tangent bundle; Functor; Tangent cone; Tangent; Equivariant map; Differential (mechanical device); Tangent vector; Derived algebraic geometry","score_opus":0.023074991932661354,"score_gpt":0.3233742027963839,"score_spread":0.3002992108637226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416725058","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.22302675,0.000022661572,0.77484095,0.00091307104,0.00014747729,0.00076355576,0.0000046335394,0.000043502954,0.00023741405],"genre_scores_gemma":[0.75786513,9.3283717e-7,0.24140106,0.00037465044,0.000057166017,0.00024965187,8.672534e-7,0.000007651448,0.000042875898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984804,0.000031937867,0.00031989464,0.0005149807,0.0002169736,0.00043581505],"domain_scores_gemma":[0.9985753,0.00074011786,0.000058664074,0.00042337822,0.00008035679,0.00012216685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034145362,0.0001857826,0.00033265344,0.0003007764,0.00025322867,0.00010599734,0.00058146985,0.000079229416,0.00003829983],"category_scores_gemma":[0.00020490582,0.00013318268,0.000030350157,0.00070748024,0.0007943563,0.00007204345,0.00040195894,0.0001345969,0.0000025429356],"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.000021107799,0.000060930124,0.00024161079,0.00013614379,0.000013867981,0.0000032236887,0.00039141212,0.00001183619,0.00017465561,0.9833973,0.000089500565,0.015458407],"study_design_scores_gemma":[0.00036581518,0.00009636629,0.0028346947,0.000040128733,0.000023809373,0.000059072434,0.00003244565,0.00410618,0.0011363433,0.9910314,0.00011698911,0.00015672849],"about_ca_topic_score_codex":0.0000031839932,"about_ca_topic_score_gemma":0.000016004049,"teacher_disagreement_score":0.5348384,"about_ca_system_score_codex":0.000055898592,"about_ca_system_score_gemma":0.00010204413,"threshold_uncertainty_score":0.5431032},"labels":[],"label_agreement":null},{"id":"W4417412318","doi":"10.1017/s096012952510025x","title":"Displayed type theory and semi-simplicial types","year":2025,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Carnegie Mellon University; Johns Hopkins University; National Science Foundation","keywords":"Type (biology); Model category; Abstract simplicial complex; Type theory; Simplicial approximation theorem; Homotopy; Simplicial complex","score_opus":0.01467820944177885,"score_gpt":0.3273209675808629,"score_spread":0.31264275813908404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417412318","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.7038873,0.00008402627,0.29048792,0.00041532304,0.00063592294,0.00021331236,0.0000012395789,0.00007075709,0.0042042146],"genre_scores_gemma":[0.96644676,0.0000026482548,0.03281596,0.00056000147,0.0000663595,0.000006172578,2.7486527e-7,0.000005809699,0.00009601801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987266,0.00012005088,0.00027931636,0.00036621385,0.00017341955,0.00033441634],"domain_scores_gemma":[0.9982238,0.001273369,0.000047020818,0.00034686452,0.000045401506,0.000063573476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009483205,0.00014531305,0.00027301486,0.0001655335,0.00016374883,0.00006193963,0.00051569304,0.00009594837,0.00012515631],"category_scores_gemma":[0.0008368035,0.00010916735,0.000025445503,0.00051935867,0.0011941906,0.00007909975,0.00043067455,0.00020291345,0.00000816264],"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.000023160495,0.000029401293,0.0005525317,0.00004773789,0.000007701725,0.000011011284,0.00038425007,0.000005403552,0.0001610909,0.98334396,0.00014710978,0.015286628],"study_design_scores_gemma":[0.0001779282,0.000032435462,0.0031064937,0.00003587691,0.0000111866775,0.000050325885,0.000018259107,0.00429857,0.0005921909,0.9915093,0.000059858005,0.000107579974],"about_ca_topic_score_codex":0.000002150416,"about_ca_topic_score_gemma":0.0000066374882,"teacher_disagreement_score":0.26255947,"about_ca_system_score_codex":0.000035858342,"about_ca_system_score_gemma":0.000086958775,"threshold_uncertainty_score":0.4451715},"labels":[],"label_agreement":null},{"id":"W7101453984","doi":"10.1017/s0960129525100261","title":"Foreword for the special issue “Differential Structures in Computer Science and Mathematics”","year":2025,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","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":"Mount Allison University; University of Calgary","funders":"","keywords":"Special Interest Group; Special section; Computer Applications","score_opus":0.0213526667813859,"score_gpt":0.3225960368153469,"score_spread":0.30124337003396096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101453984","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.10552713,0.000024577757,0.8913862,0.00039424567,0.0012043534,0.0012015913,0.000011519416,0.000044024113,0.0002063605],"genre_scores_gemma":[0.6586341,0.0000024205965,0.34026355,0.0001536673,0.00082519173,0.0000685094,9.8272e-7,0.000015732498,0.00003583747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660176,0.00004741651,0.0008577918,0.00079099636,0.00095487805,0.0007471782],"domain_scores_gemma":[0.9967636,0.0019698516,0.00018075737,0.00071077957,0.00023835404,0.00013666617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013190887,0.00033999817,0.0005761354,0.00049844116,0.0005953066,0.00048425194,0.001427023,0.000100537196,0.000083583975],"category_scores_gemma":[0.0009978143,0.0002135998,0.00008354247,0.0014673639,0.002065164,0.0003217233,0.0008718301,0.00029391499,0.0000026377786],"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.000018490457,0.000100209196,0.00010019457,0.0002893545,0.000008596894,0.0000022534132,0.00085705356,0.0007003853,0.00018826779,0.88501936,0.0002023222,0.11251353],"study_design_scores_gemma":[0.00039467652,0.000023915674,0.001933532,0.000100076875,0.000010591259,0.000008455564,0.00003123197,0.46068323,0.00013991453,0.53647184,0.000064275,0.0001382512],"about_ca_topic_score_codex":0.000015121355,"about_ca_topic_score_gemma":0.000066229164,"teacher_disagreement_score":0.553107,"about_ca_system_score_codex":0.00023424346,"about_ca_system_score_gemma":0.00019148164,"threshold_uncertainty_score":0.8710347},"labels":[],"label_agreement":null}]}