{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8589115,0.00067905284,0.12327492,0.0018886062,0.000064072156,0.00018489039,0.00017093842,0.00027374589,0.014552363],"genre_scores_gemma":[0.9605676,0.00013449961,0.03837189,0.00008273709,0.000010402204,0.00009530322,0.00007463077,0.0000622662,0.0006007338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989021,0.00045695133,0.000057316065,0.000106442225,0.00029652877,0.00018074705],"domain_scores_gemma":[0.9801486,0.016721543,0.00052844797,0.0013666623,0.00090162904,0.00033296278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040166327,0.00026978043,0.0008516107,0.0007693754,0.00095749233,0.0013167979,0.0011295322,0.0013990226,0.0030406944],"category_scores_gemma":[0.03558667,0.00023632208,0.00034851205,0.001053497,0.0018121499,0.0028234504,0.00086145336,0.0010059845,0.00029136756],"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.00038681465,0.000190503,0.0050141104,0.00017719531,0.00006127585,0.00012679688,0.00016700085,0.8429732,0.0054994123,0.12647043,0.0011852488,0.017748063],"study_design_scores_gemma":[0.000047124344,0.000052733492,0.00044626667,0.000011390549,0.000010323589,0.000025939717,0.000041277504,0.9838245,0.0010701817,0.014234704,0.00022470426,0.000010918577],"about_ca_topic_score_codex":0.0038672872,"about_ca_topic_score_gemma":0.0036500583,"teacher_disagreement_score":0.0040166327,"about_ca_system_score_codex":0.0014885772,"about_ca_system_score_gemma":0.0018038566,"threshold_uncertainty_score":0.021242261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13701335,0.0018301859,0.7743413,0.004348694,0.0001884757,0.00013528622,0.0005241151,0.0012418961,0.080376774],"genre_scores_gemma":[0.8543649,0.00060821546,0.13346536,0.0011849615,0.00022728782,0.00023819857,0.0004009916,0.00018597473,0.009324094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773824,0.00061820296,0.00014728705,0.00041251341,0.0007359087,0.0003479729],"domain_scores_gemma":[0.9971578,0.0012281237,0.00017865551,0.0005546555,0.0007047522,0.00017599274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920888,0.0005058993,0.00081059005,0.0014150942,0.0019500618,0.0029061795,0.0012117819,0.000975061,0.0031776028],"category_scores_gemma":[0.0044235983,0.0005722926,0.0017724432,0.0008742061,0.005450482,0.008113058,0.005456324,0.0033485962,0.0007093185],"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.000026769303,0.00003323925,0.00029515554,0.00013216774,0.000015186083,0.000078889956,0.00060498284,0.0007702148,0.0011375349,0.98716635,0.0008819417,0.008857716],"study_design_scores_gemma":[0.000018518258,0.00003725638,0.00028189842,0.00002426329,0.000019522895,0.00015603538,0.00013450746,0.004441022,0.0038649563,0.9831397,0.007864471,0.000017830553],"about_ca_topic_score_codex":0.00082863163,"about_ca_topic_score_gemma":0.000857895,"teacher_disagreement_score":0.003920888,"about_ca_system_score_codex":0.0015956531,"about_ca_system_score_gemma":0.0015380217,"threshold_uncertainty_score":0.02073586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16831367,0.00624278,0.694536,0.0032554974,0.00057263754,0.00009732902,0.00034676885,0.0010306532,0.1256048],"genre_scores_gemma":[0.88937706,0.0024600197,0.08794256,0.0005994167,0.00046766925,0.00011626053,0.00026898817,0.00031876913,0.018449204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997421,0.0006084321,0.00019953315,0.0006597144,0.00066144177,0.0004499174],"domain_scores_gemma":[0.9966323,0.0013034502,0.00035841667,0.0006047177,0.00062720745,0.00047395902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024879966,0.00064775284,0.00052129384,0.0021334754,0.0023322338,0.004134017,0.0006815523,0.0012342334,0.0053698476],"category_scores_gemma":[0.0043357736,0.0005613618,0.001071375,0.0011940269,0.008239608,0.014549779,0.005081705,0.0020588192,0.0007489649],"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.000010940375,0.000004481865,0.00016444818,0.000021709324,0.0000034550364,0.00009814088,0.00046766354,0.00016006085,0.00044179845,0.9941658,0.00033647218,0.0041249855],"study_design_scores_gemma":[0.000012554774,0.000031743275,0.00037530638,0.000029637633,0.000014279898,0.0005198584,0.00061848364,0.0020562124,0.0019510686,0.97085637,0.023509808,0.00002470121],"about_ca_topic_score_codex":0.0021410997,"about_ca_topic_score_gemma":0.0013362215,"teacher_disagreement_score":0.0053698476,"about_ca_system_score_codex":0.0017047281,"about_ca_system_score_gemma":0.0008535396,"threshold_uncertainty_score":0.017963886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033106084,0.00032724146,0.97986513,0.0037007094,0.00035451804,0.00010636719,0.000070203045,0.00071681,0.011548411],"genre_scores_gemma":[0.06152386,0.00073638314,0.92614007,0.0017796459,0.00038954444,0.0003824171,0.00013671479,0.00038887336,0.008522616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978224,0.00073272473,0.00017495432,0.00031850385,0.0007436161,0.0002077939],"domain_scores_gemma":[0.9980592,0.0006527699,0.0001420438,0.00032381335,0.000611933,0.00021017651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003339747,0.0007436784,0.0008022808,0.0009591692,0.0021162028,0.0043046884,0.0024065317,0.0020495513,0.0051872223],"category_scores_gemma":[0.0042126006,0.0010047355,0.0022017907,0.0009673232,0.0059513487,0.0084943585,0.004062755,0.005639617,0.002370209],"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.0000067307806,0.000012507335,0.000037803482,0.00004499153,0.000004661938,0.00004268175,0.00028325286,0.0011782394,0.00096349785,0.9919709,0.0012158602,0.0042388085],"study_design_scores_gemma":[0.00003365298,0.00003604537,0.00002995305,0.00007083957,0.000012973216,0.00012795633,0.00014804472,0.028533153,0.0019968569,0.8833836,0.085596055,0.000030866428],"about_ca_topic_score_codex":0.0013127133,"about_ca_topic_score_gemma":0.0010306564,"teacher_disagreement_score":0.0051872223,"about_ca_system_score_codex":0.0014274449,"about_ca_system_score_gemma":0.003145586,"threshold_uncertainty_score":0.017662525},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039603017,0.20371628,0.5712541,0.023261428,0.002347648,0.00013881121,0.00022181502,0.0037820525,0.15567487],"genre_scores_gemma":[0.24406189,0.1583532,0.54553086,0.0044648405,0.0028723308,0.0001619834,0.0007100339,0.0009688442,0.04287612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983956,0.00043187418,0.00014374562,0.00022078706,0.00067744654,0.00013048481],"domain_scores_gemma":[0.99713874,0.0012789125,0.00014893865,0.00051654014,0.0007364105,0.00018046531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417141,0.0006903839,0.00046164653,0.0019210377,0.00046892508,0.0026330599,0.0019672737,0.0013192376,0.0029236167],"category_scores_gemma":[0.004029886,0.0007026356,0.0011737339,0.0019645242,0.0020643834,0.004910904,0.0017914608,0.0025733183,0.0014863767],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016077571,0.00010507571,0.0012919314,0.0008432903,0.000026454336,0.0002945273,0.0010808774,0.0058078533,0.007943563,0.5973518,0.011570526,0.3735233],"study_design_scores_gemma":[0.00001945907,0.00022135251,0.0008274176,0.0006948629,0.000039413622,0.0016436641,0.0004707791,0.027858581,0.007541145,0.2842877,0.67632186,0.00007377598],"about_ca_topic_score_codex":0.0016800882,"about_ca_topic_score_gemma":0.0015138584,"teacher_disagreement_score":0.003417141,"about_ca_system_score_codex":0.0013108117,"about_ca_system_score_gemma":0.0014107393,"threshold_uncertainty_score":0.01807177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009346327,0.000017399714,0.9886591,0.0000314796,0.000013520499,0.000030678908,0.00002393764,0.0015653003,0.0003123658],"genre_scores_gemma":[0.33015695,0.000090032576,0.6677332,0.000093981536,0.000028161434,0.00016896409,0.0001372702,0.00043743776,0.0011540572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968027,0.0007044297,0.00024166337,0.00051534525,0.0014522838,0.00028348854],"domain_scores_gemma":[0.99173427,0.003982901,0.00069604174,0.0024710498,0.0009857619,0.0001300833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034847734,0.0007737269,0.00063936174,0.0009920804,0.00056328136,0.0012168927,0.0026226556,0.0010354838,0.0029409132],"category_scores_gemma":[0.0075600273,0.00064025476,0.0016356916,0.0006089401,0.0022429693,0.0042466815,0.0019024016,0.0022793727,0.000469407],"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.00063313625,0.0003747121,0.0056764144,0.00058364857,0.00022222033,0.000756433,0.0012397104,0.13882968,0.21795225,0.36105084,0.0028244834,0.26985648],"study_design_scores_gemma":[0.00013619378,0.00028286368,0.00066040613,0.00005555153,0.000096488395,0.00033880284,0.00005197068,0.75261503,0.14854577,0.09164704,0.005482525,0.0000873859],"about_ca_topic_score_codex":0.0021533014,"about_ca_topic_score_gemma":0.0025263052,"teacher_disagreement_score":0.0034847734,"about_ca_system_score_codex":0.00090607314,"about_ca_system_score_gemma":0.0019913958,"threshold_uncertainty_score":0.018429458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34144622,0.0026309418,0.5564937,0.0018134724,0.0002702092,0.00010742614,0.0003294989,0.00038573277,0.09652281],"genre_scores_gemma":[0.9497512,0.0005737578,0.03960393,0.000214497,0.00013549125,0.00008903114,0.0001227153,0.00004307293,0.0094662905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879336,0.0003708278,0.00009284347,0.00026850883,0.00033351642,0.00014088195],"domain_scores_gemma":[0.99825484,0.0006281426,0.00026055623,0.0002882456,0.00031324738,0.00025495238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014571992,0.000309251,0.00034158115,0.0013863894,0.0017557206,0.0040779016,0.00046048185,0.0005522786,0.0028285566],"category_scores_gemma":[0.0026355656,0.00026561547,0.0007252199,0.0010780061,0.005911733,0.008085699,0.0027046273,0.0015037361,0.00046676217],"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.00001026272,0.0000042978163,0.00028392315,0.000015430636,0.000004000015,0.000045981687,0.00033096713,0.00028162551,0.00055820623,0.9959772,0.00011248279,0.0023756672],"study_design_scores_gemma":[0.000008619504,0.000023584073,0.00040704475,0.000017309625,0.0000075990215,0.00017885673,0.00041862257,0.0028861635,0.0015972338,0.984073,0.010368843,0.00001305752],"about_ca_topic_score_codex":0.0008727712,"about_ca_topic_score_gemma":0.00094636495,"teacher_disagreement_score":0.0040779016,"about_ca_system_score_codex":0.0012104235,"about_ca_system_score_gemma":0.00070259074,"threshold_uncertainty_score":0.009462476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023402147,0.010172817,0.8929442,0.004835552,0.0006946272,0.00010589854,0.00035569383,0.00048152762,0.06700746],"genre_scores_gemma":[0.45867118,0.010814819,0.48624915,0.0037724967,0.0020409634,0.0006700025,0.00075013033,0.00062987686,0.036401395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993458,0.002887856,0.00046241007,0.00074327155,0.0018448977,0.00060356595],"domain_scores_gemma":[0.99577904,0.0024418125,0.0004041259,0.00074874324,0.0004268115,0.00019942193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008877601,0.001026306,0.0012485238,0.0036507605,0.003909569,0.007840885,0.0019530868,0.0022835124,0.004482104],"category_scores_gemma":[0.006342629,0.0011162934,0.002671551,0.005404616,0.01356044,0.018961038,0.005291602,0.006277784,0.0013234214],"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.000005066725,0.0000025179436,0.000032715372,0.000013512929,0.0000017767687,0.000023729683,0.00017830222,0.00019733848,0.000087234504,0.9979602,0.00021494065,0.001282814],"study_design_scores_gemma":[0.000008193322,0.000009775244,0.00006307885,0.000028654584,0.00000865838,0.00006735932,0.000063857406,0.001291479,0.00028035592,0.9830305,0.015133924,0.000014210598],"about_ca_topic_score_codex":0.0038315023,"about_ca_topic_score_gemma":0.0030986273,"teacher_disagreement_score":0.008877601,"about_ca_system_score_codex":0.0051132343,"about_ca_system_score_gemma":0.002429549,"threshold_uncertainty_score":0.046949804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25484562,0.0015983136,0.66006047,0.0011126469,0.0003946529,0.00019209301,0.0011576518,0.0011970805,0.07944151],"genre_scores_gemma":[0.86567277,0.00032510018,0.11040168,0.0004643897,0.0002496081,0.00018544754,0.00084284286,0.00023391558,0.021624213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986386,0.00031153046,0.0001403214,0.00032814554,0.0003879632,0.00019341633],"domain_scores_gemma":[0.99837923,0.0006794615,0.00012430182,0.00024057482,0.00043515343,0.00014139224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011301021,0.00045131618,0.00037719193,0.0014493611,0.0013174465,0.0023000457,0.0009869048,0.0009981532,0.008713147],"category_scores_gemma":[0.002579716,0.00032745377,0.00069842377,0.0006633413,0.0023655738,0.0056212624,0.00259498,0.00090498035,0.00088323146],"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.000019839772,0.000006322628,0.00017666513,0.000032825566,0.0000054317397,0.00010009519,0.00052103633,0.00042045547,0.0014533837,0.98994,0.00063545944,0.006688419],"study_design_scores_gemma":[0.000009397588,0.000024176756,0.00035531717,0.000019390438,0.000008495431,0.0001655222,0.00020541894,0.003482502,0.0021750473,0.975201,0.01833453,0.000019208008],"about_ca_topic_score_codex":0.0009992289,"about_ca_topic_score_gemma":0.0011086705,"teacher_disagreement_score":0.008713147,"about_ca_system_score_codex":0.0008649856,"about_ca_system_score_gemma":0.0004555451,"threshold_uncertainty_score":0.0291484},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017801451,0.016614867,0.0007811274,0.050768234,0.8921578,0.000050146886,0.0002705419,0.00016524558,0.039014086],"genre_scores_gemma":[0.0026829904,0.010597452,0.0003669359,0.018023366,0.85587806,0.000057095047,0.00048631002,0.00028252281,0.11162523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983797,0.000193881,0.00018827755,0.00036653134,0.00069135125,0.00018019037],"domain_scores_gemma":[0.99479103,0.0014788699,0.00029005847,0.0002716881,0.0020925237,0.0010758542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018066061,0.0021671392,0.0019580696,0.002898503,0.0026842593,0.009093051,0.0015402914,0.005640927,0.11800517],"category_scores_gemma":[0.005620111,0.000570577,0.0017657821,0.0017939354,0.0016526853,0.0058720205,0.0016586478,0.00652991,0.063329056],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000014648637,0.000010887365,0.00002879259,0.00011095785,0.000005673075,0.000030891766,0.0000109092225,0.000018676663,0.00008345846,0.0020068483,0.99215686,0.0055215517],"study_design_scores_gemma":[0.000011040442,0.000020700356,0.00025187142,0.00018123616,0.000010381827,0.000113572176,0.000023837281,0.00006967115,0.0000862301,0.004701456,0.9945227,0.0000073150545],"about_ca_topic_score_codex":0.00083238835,"about_ca_topic_score_gemma":0.0013292758,"teacher_disagreement_score":0.11800517,"about_ca_system_score_codex":0.0036142045,"about_ca_system_score_gemma":0.0022745999,"threshold_uncertainty_score":0.39476663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028607484,0.0006864434,0.9669329,0.00018843415,0.000051746207,0.00003282295,0.00005406287,0.000063969004,0.003382123],"genre_scores_gemma":[0.9700106,0.0007701864,0.026505854,0.000055220422,0.00006477834,0.00012897867,0.00009445484,0.000032872143,0.0023370965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994954,0.00013750061,0.00003598323,0.00013363581,0.00015416912,0.000043338878],"domain_scores_gemma":[0.9988451,0.00059203,0.00026275005,0.000029687077,0.00024020988,0.00003020077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013376303,0.001330206,0.0007601902,0.00054383365,0.00032958604,0.0011429258,0.00097086414,0.0009742972,0.0012829932],"category_scores_gemma":[0.002757347,0.00028408345,0.0007090718,0.0003823954,0.00093779655,0.0010048896,0.0007794905,0.0008771782,0.00013312353],"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.00007449338,0.000020704181,0.00028658813,0.00021040486,0.00005593638,0.00018194773,0.000117305804,0.9247717,0.010842926,0.05341765,0.00027333703,0.009746895],"study_design_scores_gemma":[0.0000058511587,0.000038042257,0.00007730137,0.000008726153,0.000009774254,0.000021374522,0.000013438356,0.99054855,0.0013499152,0.0076370835,0.0002818843,0.0000079867705],"about_ca_topic_score_codex":0.0015238937,"about_ca_topic_score_gemma":0.0008887864,"teacher_disagreement_score":0.0015238937,"about_ca_system_score_codex":0.0013299044,"about_ca_system_score_gemma":0.00066671724,"threshold_uncertainty_score":0.0096491575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15903142,0.0013497337,0.80722946,0.00070939946,0.000120330624,0.00008443458,0.00018435383,0.00075636484,0.030534456],"genre_scores_gemma":[0.8492186,0.0006164968,0.1371313,0.0002965022,0.0001353307,0.00014492648,0.00037655066,0.00025142776,0.011828776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828196,0.00043439915,0.000121050645,0.00048806632,0.0004453988,0.00022912849],"domain_scores_gemma":[0.99862313,0.0005902452,0.00014727617,0.00018156754,0.00033867883,0.0001191484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018880211,0.00036084725,0.00034782066,0.0014715133,0.0008510752,0.0018702584,0.000653034,0.0005158463,0.0026412848],"category_scores_gemma":[0.002355112,0.00030108332,0.0010755586,0.000772409,0.0031017396,0.004216423,0.002699064,0.0011691571,0.0004132643],"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.000034399003,0.000013993694,0.0003062373,0.000066220186,0.000013314183,0.00014067844,0.00065532397,0.0017278912,0.0035441497,0.9794545,0.00029688558,0.013746329],"study_design_scores_gemma":[0.000005455247,0.000040851275,0.00030245518,0.00001838751,0.000014597413,0.00023590485,0.00022395147,0.006186454,0.0042360257,0.97930336,0.00941573,0.000016768383],"about_ca_topic_score_codex":0.0011491238,"about_ca_topic_score_gemma":0.0009012003,"teacher_disagreement_score":0.0026412848,"about_ca_system_score_codex":0.0007299609,"about_ca_system_score_gemma":0.0005906496,"threshold_uncertainty_score":0.0099849105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07896654,0.0038847295,0.7958537,0.0030468523,0.0008970865,0.0002377902,0.00068918185,0.0008351099,0.1155891],"genre_scores_gemma":[0.8070214,0.0017856539,0.15701286,0.0008646753,0.001137293,0.00043644424,0.0006610241,0.00021950775,0.030861123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979054,0.00049650896,0.0002250039,0.00049243,0.00062989723,0.00025086064],"domain_scores_gemma":[0.9974769,0.00067878043,0.00024471848,0.00062699383,0.0007335203,0.00023909881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018913335,0.00060549687,0.0006843924,0.0024834352,0.0034096097,0.005006409,0.0015234337,0.0016234199,0.005326081],"category_scores_gemma":[0.0040367544,0.0006389472,0.0012203923,0.0016420401,0.005795585,0.010792546,0.003709337,0.002784352,0.0013958957],"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.000004102502,0.000005989062,0.000027435188,0.000013363679,0.0000018097521,0.000023080109,0.00016761755,0.00014365597,0.0003262059,0.99727815,0.00025016727,0.001758452],"study_design_scores_gemma":[0.0000055177097,0.000016680913,0.00009269822,0.000019938752,0.000007569427,0.0000923961,0.0000914156,0.00356713,0.00094202196,0.9816559,0.013497329,0.000011245302],"about_ca_topic_score_codex":0.0011641385,"about_ca_topic_score_gemma":0.0007810244,"teacher_disagreement_score":0.005326081,"about_ca_system_score_codex":0.0018283947,"about_ca_system_score_gemma":0.0016077138,"threshold_uncertainty_score":0.017817557},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011756486,0.046119597,0.012665545,0.08741899,0.7297337,0.00017050869,0.0009900875,0.0006830548,0.121042974],"genre_scores_gemma":[0.008281519,0.02646605,0.00266201,0.018039864,0.76233155,0.00021065633,0.0016258006,0.0012587006,0.17912373],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99677783,0.00061361125,0.0003968577,0.0006897543,0.0011936416,0.0003283316],"domain_scores_gemma":[0.99008054,0.0047568614,0.00047717232,0.0009415199,0.0024252115,0.0013186804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216041,0.0014851926,0.0023854442,0.0050245007,0.00386777,0.009140741,0.001808641,0.0037680783,0.099368736],"category_scores_gemma":[0.009694133,0.0009108898,0.002001758,0.0042810715,0.0020117231,0.010674746,0.0039497474,0.0073453886,0.024425635],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000029905323,0.000035993464,0.000107888016,0.00028808464,0.000020333224,0.00008340797,0.00010224963,0.00012213929,0.00026102667,0.022258272,0.94940025,0.027290536],"study_design_scores_gemma":[0.000010687398,0.000019838491,0.00019099965,0.00017167369,0.000010828733,0.00019829762,0.000051888917,0.00028286286,0.000112935515,0.014198391,0.9847408,0.000010812346],"about_ca_topic_score_codex":0.0008566223,"about_ca_topic_score_gemma":0.0015157424,"teacher_disagreement_score":0.099368736,"about_ca_system_score_codex":0.002883837,"about_ca_system_score_gemma":0.0023580391,"threshold_uncertainty_score":0.33242154},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21694778,0.0012635041,0.7493927,0.00069905876,0.00011799936,0.00014115727,0.00020410212,0.0006358741,0.03059782],"genre_scores_gemma":[0.8991868,0.00073088333,0.0890643,0.00016978408,0.0001396627,0.0002505965,0.000213495,0.00011180765,0.0101326695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980749,0.00035268252,0.0001252929,0.0005530094,0.0005067733,0.00038734006],"domain_scores_gemma":[0.9978962,0.00074243837,0.0003210302,0.0004366602,0.00034822387,0.00025543745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017936912,0.000611153,0.0004944283,0.0017231667,0.0016138555,0.0023588166,0.0012552775,0.0011178693,0.0050137867],"category_scores_gemma":[0.0028308386,0.00039978133,0.0013813266,0.0011211712,0.006702352,0.0075617954,0.004074079,0.0017703789,0.00051281654],"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.000012733714,0.000012174118,0.00025562037,0.000035940066,0.00000736942,0.0001509314,0.0007253511,0.00095516304,0.0018755321,0.9911342,0.00011199403,0.004723071],"study_design_scores_gemma":[0.000011273972,0.000050689032,0.00036013065,0.000027617243,0.000019653833,0.00024973875,0.00036614915,0.006280682,0.004464791,0.9794565,0.008683181,0.000029606354],"about_ca_topic_score_codex":0.0015046105,"about_ca_topic_score_gemma":0.000710362,"teacher_disagreement_score":0.0050137867,"about_ca_system_score_codex":0.0012305335,"about_ca_system_score_gemma":0.00088178343,"threshold_uncertainty_score":0.016772807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74511766,0.00088017085,0.19479114,0.0029323755,0.00018421709,0.00007395044,0.00029401248,0.00044589955,0.055280507],"genre_scores_gemma":[0.9795752,0.00014954068,0.018973393,0.000084442385,0.00005779708,0.000045287725,0.00005855365,0.000041557716,0.0010142471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927455,0.00023733184,0.00003894176,0.00008847771,0.00020698238,0.00015368561],"domain_scores_gemma":[0.9954086,0.0024034544,0.00050734536,0.0010090268,0.0002920511,0.00037944023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090618053,0.000281368,0.0005217365,0.0011587031,0.0011239392,0.0024316565,0.00087147404,0.0010485107,0.003673724],"category_scores_gemma":[0.0052157003,0.0003158001,0.00045821615,0.0006657356,0.003598224,0.004226672,0.0018695804,0.0011356388,0.00034967152],"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.000036052832,0.000013540367,0.00028144554,0.000038859325,0.0000066776443,0.00007995269,0.00013693793,0.004235285,0.0036962575,0.98816395,0.0004079929,0.0029029776],"study_design_scores_gemma":[0.000018882145,0.000029911831,0.00032211747,0.000014298654,0.000009258418,0.00014277513,0.00014198542,0.02514466,0.0026716029,0.96916753,0.0023179923,0.000018976596],"about_ca_topic_score_codex":0.00022447757,"about_ca_topic_score_gemma":0.00030331066,"teacher_disagreement_score":0.003673724,"about_ca_system_score_codex":0.00057767396,"about_ca_system_score_gemma":0.0003712288,"threshold_uncertainty_score":0.012289882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44079304,0.008225058,0.32262805,0.0032543675,0.00032109453,0.00011222847,0.00027815855,0.0004422425,0.22394572],"genre_scores_gemma":[0.95937496,0.0014878138,0.016395845,0.00047489756,0.00025944307,0.0001227142,0.00018114394,0.000091249225,0.02161194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803084,0.00054618635,0.0001553056,0.0003818348,0.00059566065,0.00029019668],"domain_scores_gemma":[0.99799407,0.00073835213,0.00021342556,0.000401807,0.00040388003,0.0002484403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00258786,0.0004391527,0.0005563012,0.0022307425,0.001511304,0.004337068,0.0007983194,0.0010670318,0.004086839],"category_scores_gemma":[0.0032726186,0.00039458674,0.0008240996,0.0011818386,0.009922632,0.008229308,0.0056030527,0.0016173921,0.00045218697],"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.000007286267,0.000005241679,0.00038594197,0.000027901166,0.0000079388665,0.00010224839,0.00069177506,0.00028637683,0.0006736926,0.994396,0.00020541772,0.0032102077],"study_design_scores_gemma":[0.0000048525426,0.000027922804,0.0008337088,0.000045542252,0.000011266671,0.0003598458,0.0007235869,0.0013091725,0.001072388,0.9812439,0.014350973,0.000016810523],"about_ca_topic_score_codex":0.0014919399,"about_ca_topic_score_gemma":0.00069198885,"teacher_disagreement_score":0.004337068,"about_ca_system_score_codex":0.0013379775,"about_ca_system_score_gemma":0.000723809,"threshold_uncertainty_score":0.013686061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728511,0.0041599274,0.550605,0.0061925068,0.00060673925,0.00011107345,0.00047424252,0.000381972,0.16461743],"genre_scores_gemma":[0.94593805,0.0012753536,0.04037088,0.0006272786,0.00041589464,0.00014681491,0.00025019972,0.00012670172,0.010848899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765766,0.0007888207,0.00023214443,0.00049804844,0.0005067257,0.00031652767],"domain_scores_gemma":[0.994288,0.0024129902,0.0007874313,0.00082535035,0.0011084782,0.00057783554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026397803,0.00063814025,0.00064972485,0.0026736825,0.0025289042,0.0036722734,0.0007576004,0.0013072671,0.006866297],"category_scores_gemma":[0.006950487,0.00039677788,0.0009847014,0.0017124474,0.008614547,0.012770532,0.0049713766,0.0021873824,0.0008816297],"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.0000033873164,0.000002388319,0.00009709314,0.000017662609,0.0000026559449,0.00003286566,0.00023468671,0.0001977565,0.0002605377,0.9980229,0.00016214809,0.00096596766],"study_design_scores_gemma":[0.000005390853,0.000019758527,0.00020309693,0.000023539924,0.000008498815,0.00018050708,0.00038185352,0.0015457851,0.0006822269,0.9868484,0.01008771,0.000013277461],"about_ca_topic_score_codex":0.00062718656,"about_ca_topic_score_gemma":0.00049522007,"teacher_disagreement_score":0.006866297,"about_ca_system_score_codex":0.0013377749,"about_ca_system_score_gemma":0.00057147443,"threshold_uncertainty_score":0.02297008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07210487,0.011259277,0.5012392,0.015888792,0.00090544595,0.000101558966,0.00064505974,0.0014720018,0.39638376],"genre_scores_gemma":[0.8914105,0.0024081639,0.059812076,0.001928129,0.0006140316,0.00012273315,0.00029468726,0.00012158146,0.043288074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985158,0.0005691326,0.0000739475,0.0002178593,0.00041929766,0.00020390221],"domain_scores_gemma":[0.9987318,0.0006388817,0.000102388534,0.00015416906,0.00024360738,0.00012917734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022961425,0.00039312895,0.0003285852,0.0013222559,0.0018667049,0.0034293171,0.000854815,0.0010539849,0.005920519],"category_scores_gemma":[0.0023164526,0.00032414217,0.0007233432,0.0011045308,0.0069043054,0.0077950535,0.0027491814,0.0018353516,0.0011178086],"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.000004139907,0.0000026408472,0.000028976925,0.000010732531,0.0000013798366,0.000014947628,0.0001341736,0.00012792952,0.000112132235,0.9965605,0.0005690275,0.0024334462],"study_design_scores_gemma":[0.0000063100356,0.00000808953,0.0000547678,0.000012500317,0.0000032666921,0.000052633724,0.00006666674,0.0011802479,0.00023818175,0.9790644,0.019306576,0.00000639272],"about_ca_topic_score_codex":0.0014918126,"about_ca_topic_score_gemma":0.00088400557,"teacher_disagreement_score":0.005920519,"about_ca_system_score_codex":0.002473077,"about_ca_system_score_gemma":0.0013124545,"threshold_uncertainty_score":0.019806147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19313954,0.001088152,0.5788789,0.0031169138,0.00019104338,0.0001148928,0.0003143876,0.0005416524,0.22261459],"genre_scores_gemma":[0.9395308,0.0004345526,0.042045046,0.00036316266,0.00012098064,0.00012280837,0.00016277908,0.000066550805,0.017153412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00028236408,0.000045637364,0.00016383003,0.00037730153,0.00016461578],"domain_scores_gemma":[0.99930453,0.00020232586,0.00008198414,0.00011537935,0.00015992582,0.0001358696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008745656,0.00037524142,0.00038260306,0.0011134816,0.0019570766,0.002754409,0.0012411411,0.00080241956,0.0065844865],"category_scores_gemma":[0.0011523991,0.0002132278,0.00066394056,0.0007771467,0.006121757,0.0052568964,0.0030920194,0.0018958388,0.00095675315],"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.0000015962253,0.0000014232231,0.000025700521,0.0000032812943,7.765667e-7,0.00001518529,0.000057913596,0.00017010684,0.00009325834,0.9990478,0.00007986346,0.0005029816],"study_design_scores_gemma":[0.0000042209317,0.000008341353,0.00008609769,0.0000036199249,0.000002330771,0.000069387715,0.000084482104,0.001706125,0.0003067085,0.9920035,0.005718161,0.0000068752697],"about_ca_topic_score_codex":0.0015777024,"about_ca_topic_score_gemma":0.0008760869,"teacher_disagreement_score":0.0065844865,"about_ca_system_score_codex":0.0015420897,"about_ca_system_score_gemma":0.0008121062,"threshold_uncertainty_score":0.022027314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13778602,0.010924977,0.6006588,0.009344842,0.00033801378,0.00006579371,0.00045784406,0.00050604,0.23991773],"genre_scores_gemma":[0.9365342,0.0018096888,0.047647722,0.00055966567,0.00019508047,0.0000829402,0.0002115679,0.00009866145,0.012860592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987066,0.00047347386,0.000043175725,0.00020768825,0.000357716,0.00021124154],"domain_scores_gemma":[0.99839455,0.0007138368,0.00017744984,0.00021189934,0.00022735672,0.0002749152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014396837,0.00050953863,0.00050506165,0.0023888985,0.0020008371,0.003965949,0.0011465761,0.00087868015,0.0056084883],"category_scores_gemma":[0.0015801964,0.00033736922,0.0007223533,0.0017488834,0.007962146,0.00743589,0.003709108,0.0022160944,0.00044842288],"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.0000021017179,0.0000013226264,0.000074877345,0.000006681342,0.0000015904272,0.000011500632,0.00008516428,0.00014344176,0.000055702836,0.9980197,0.0002460879,0.0013518285],"study_design_scores_gemma":[0.0000018133361,0.0000042974925,0.0001864539,0.0000065925533,0.0000022223771,0.000055690038,0.00011776187,0.0006527456,0.00008761841,0.9926651,0.0062148063,0.000004826036],"about_ca_topic_score_codex":0.0021628777,"about_ca_topic_score_gemma":0.0018439332,"teacher_disagreement_score":0.0056084883,"about_ca_system_score_codex":0.0028088412,"about_ca_system_score_gemma":0.00093550474,"threshold_uncertainty_score":0.020379663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300606,0.00235551,0.21402521,0.005175186,0.0003449773,0.0001646458,0.00087413663,0.00046882828,0.24653089],"genre_scores_gemma":[0.97548795,0.00030090552,0.01650338,0.00016868312,0.000061291576,0.00009180146,0.0002025267,0.000033049946,0.007150419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971253,0.0008432125,0.0001515437,0.00024173605,0.0012783252,0.00035981898],"domain_scores_gemma":[0.9965784,0.0011532953,0.00043542654,0.0007415238,0.00041298548,0.00067841937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030118765,0.0006277436,0.0006813993,0.0018786668,0.0017315116,0.0077167405,0.0018702274,0.001932845,0.0077837314],"category_scores_gemma":[0.0046247724,0.000364775,0.0014091871,0.0016030776,0.0073723933,0.00790169,0.004905182,0.0023393165,0.00057519524],"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.00004121359,0.00001658409,0.00039840213,0.000019832247,0.000009409691,0.00003515355,0.00036173157,0.0007773441,0.00025100034,0.99669826,0.0001639361,0.0012270556],"study_design_scores_gemma":[0.00006270947,0.00006392808,0.0007161353,0.000049939692,0.000025829548,0.00013901046,0.00084420154,0.0071380646,0.0009183007,0.9829421,0.0070674256,0.000032404834],"about_ca_topic_score_codex":0.0016928803,"about_ca_topic_score_gemma":0.0015920906,"teacher_disagreement_score":0.0077837314,"about_ca_system_score_codex":0.0029096913,"about_ca_system_score_gemma":0.0012492357,"threshold_uncertainty_score":0.026039183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01868278,0.002252801,0.9319871,0.004864349,0.00051100896,0.00004290434,0.00012797539,0.0001509117,0.041380186],"genre_scores_gemma":[0.6300304,0.0041773124,0.34173808,0.003080659,0.0031500508,0.0004697881,0.00024694044,0.00033153276,0.016775277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980166,0.00070791866,0.00008980353,0.00038682998,0.0006453084,0.00015350223],"domain_scores_gemma":[0.9939803,0.0038123778,0.00032317807,0.00086469,0.000699326,0.00032023434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069151297,0.0006448163,0.0013251108,0.0018604269,0.0021136287,0.0039127492,0.0024908953,0.0021868683,0.0041907164],"category_scores_gemma":[0.011318497,0.0005345642,0.0017103993,0.0010746757,0.011024577,0.011231077,0.0047518564,0.005113499,0.0007684053],"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.0000015280007,0.0000026015102,0.000028443857,0.00001309539,0.000002130382,0.000008437049,0.000054059125,0.00056777935,0.000038819053,0.99834645,0.00014605335,0.0007906333],"study_design_scores_gemma":[0.0000028377885,0.000006333946,0.000026631227,0.000009136962,8.1900737e-7,0.000014821661,0.000013406496,0.003885311,0.000039876846,0.9936367,0.0023608096,0.0000033713973],"about_ca_topic_score_codex":0.0009103357,"about_ca_topic_score_gemma":0.00041793406,"teacher_disagreement_score":0.0069151297,"about_ca_system_score_codex":0.0024632905,"about_ca_system_score_gemma":0.0013339155,"threshold_uncertainty_score":0.036571205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026276747,0.00024629052,0.8949442,0.0021501149,0.0004066919,0.00018456813,0.0002768844,0.00094749796,0.074567065],"genre_scores_gemma":[0.7729676,0.00066840963,0.19771452,0.0012040344,0.00043976944,0.0004767492,0.0003112941,0.00047645558,0.025741113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980236,0.00040930705,0.00013697457,0.00033111026,0.0007544631,0.00034456688],"domain_scores_gemma":[0.9974976,0.000894359,0.00017811677,0.00058230717,0.000641302,0.00020625386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025339057,0.00048722624,0.0004859954,0.0010649784,0.001448939,0.0020617926,0.0011195868,0.0012155223,0.011504949],"category_scores_gemma":[0.00567635,0.00041432798,0.0011956162,0.00056574057,0.005520637,0.007329669,0.0042820657,0.0032459572,0.0022356322],"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.0000068507416,0.0000047183166,0.000029483068,0.000015869864,0.0000017365201,0.000020243464,0.000081756865,0.0005090323,0.0005956167,0.996369,0.00032055142,0.0020451627],"study_design_scores_gemma":[0.000010678838,0.000021265638,0.000036583027,0.000014085895,0.0000055828787,0.00004207233,0.000044626515,0.0056423484,0.0027523628,0.9821025,0.009316918,0.000010919607],"about_ca_topic_score_codex":0.00093741604,"about_ca_topic_score_gemma":0.0007555284,"teacher_disagreement_score":0.011504949,"about_ca_system_score_codex":0.0013682591,"about_ca_system_score_gemma":0.002007178,"threshold_uncertainty_score":0.03848791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0151257515,0.000555386,0.9614812,0.0015982095,0.00019270863,0.000041536412,0.00020437824,0.0004407877,0.02036003],"genre_scores_gemma":[0.6180899,0.001299332,0.35190958,0.000978839,0.00052189716,0.0003031501,0.0004151018,0.00024243175,0.026239805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774253,0.00047264007,0.00018783074,0.00058160705,0.00078164577,0.00023374443],"domain_scores_gemma":[0.99635315,0.0011951709,0.00030194037,0.0011335746,0.000673793,0.00034240753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032145767,0.00042083673,0.0005318406,0.0013312306,0.0017391947,0.005564872,0.0017506033,0.0013453733,0.006075086],"category_scores_gemma":[0.005099329,0.0004429593,0.0012524269,0.001438788,0.005879862,0.01310546,0.0034137587,0.0032189174,0.0011376435],"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.000003819009,0.0000038568987,0.000059601523,0.000009037321,0.0000018129456,0.000030169978,0.00015073543,0.0005996207,0.0002007127,0.9971846,0.00013653234,0.0016195157],"study_design_scores_gemma":[0.000009113103,0.000022121467,0.00007480327,0.00001944301,0.000013286779,0.00010936606,0.00009275919,0.013600836,0.0011308544,0.96345466,0.021455437,0.000017358885],"about_ca_topic_score_codex":0.0026764187,"about_ca_topic_score_gemma":0.0017592995,"teacher_disagreement_score":0.006075086,"about_ca_system_score_codex":0.0021942568,"about_ca_system_score_gemma":0.0017038082,"threshold_uncertainty_score":0.020323157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061515212,0.0010445418,0.8788987,0.004724957,0.00025403945,0.00006351216,0.0002533441,0.00080415746,0.052441567],"genre_scores_gemma":[0.7703987,0.0007248515,0.21086818,0.00092805,0.00027120058,0.00015252452,0.00020150698,0.0003531283,0.016101817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735945,0.0009179359,0.00011579493,0.0005260265,0.00075613277,0.00032460815],"domain_scores_gemma":[0.99808866,0.00068640773,0.0001818241,0.00042402922,0.00039345873,0.00022556154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266558,0.00063235447,0.0005783502,0.0020804626,0.0016134115,0.00560931,0.0022029653,0.00158865,0.0042700935],"category_scores_gemma":[0.0036520928,0.00071879284,0.0011933031,0.0016570992,0.008886327,0.011702569,0.0053417585,0.0046703154,0.0007239332],"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.0000028236127,0.0000017532931,0.00006209325,0.000004833072,0.0000012586053,0.00001574694,0.00017082624,0.00047155592,0.00012068597,0.9980452,0.00012223009,0.000980908],"study_design_scores_gemma":[0.000007851977,0.000014522807,0.00009452014,0.000011968189,0.0000053282624,0.000057479967,0.00018485014,0.008172145,0.0006072059,0.9755255,0.01530703,0.00001165799],"about_ca_topic_score_codex":0.0031786226,"about_ca_topic_score_gemma":0.0015183497,"teacher_disagreement_score":0.00560931,"about_ca_system_score_codex":0.003697108,"about_ca_system_score_gemma":0.0012857284,"threshold_uncertainty_score":0.026824534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003830734,0.00048586805,0.96836144,0.0010276109,0.00017529374,0.00007719875,0.0006472102,0.01620087,0.009193727],"genre_scores_gemma":[0.09084854,0.00070238573,0.88218266,0.0014107215,0.00017334886,0.00066092645,0.0015803935,0.007780928,0.014660107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996393,0.0009583738,0.00041923329,0.0005166993,0.0013624304,0.00035020988],"domain_scores_gemma":[0.99559927,0.0019253194,0.00023611709,0.0013505952,0.00069771823,0.00019103281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047314577,0.0010586007,0.0011263915,0.0012843651,0.0015289605,0.00531436,0.004520917,0.0015398382,0.007837354],"category_scores_gemma":[0.011434439,0.0018675028,0.0024705504,0.001662405,0.005172472,0.011319223,0.007667289,0.00558019,0.0036674053],"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.00022671687,0.000025924332,0.0005708327,0.00039025166,0.000027634522,0.00013506725,0.0014391498,0.0061216736,0.0026611518,0.9256491,0.018591031,0.044161476],"study_design_scores_gemma":[0.00014223058,0.00007718223,0.00022217714,0.0004311987,0.00007314745,0.00041730725,0.00021357776,0.062394906,0.015058214,0.452945,0.46785635,0.00016878931],"about_ca_topic_score_codex":0.0037278947,"about_ca_topic_score_gemma":0.0052742916,"teacher_disagreement_score":0.007837354,"about_ca_system_score_codex":0.0037411829,"about_ca_system_score_gemma":0.003766124,"threshold_uncertainty_score":0.027144372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016428651,0.00043401678,0.97259766,0.0008580978,0.00011185244,0.00011379907,0.0002840329,0.00044628003,0.008725644],"genre_scores_gemma":[0.5009892,0.002389232,0.47929665,0.0006776453,0.00050919433,0.0009523705,0.0009530724,0.00054469705,0.01368796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910451,0.0040443195,0.0008959213,0.0009099272,0.0023562424,0.00074855273],"domain_scores_gemma":[0.9861303,0.0074913795,0.0014179324,0.002876521,0.0014970967,0.0005867372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008901169,0.0010974329,0.000980579,0.0022877934,0.0020695913,0.006823829,0.0024035994,0.0029930482,0.0043971664],"category_scores_gemma":[0.015117547,0.0011834573,0.0025140534,0.0034121077,0.0050094263,0.01675481,0.0046436703,0.00435062,0.0008219339],"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.000022872922,0.000011958459,0.00018379111,0.00003312977,0.000010596497,0.00007873917,0.0004213965,0.008699812,0.00052481965,0.9867106,0.00044420117,0.002858105],"study_design_scores_gemma":[0.000037360285,0.000032764776,0.00011371323,0.00007352332,0.000031039683,0.00018259273,0.00020766832,0.07542,0.0013921332,0.8970751,0.025398476,0.000035584046],"about_ca_topic_score_codex":0.0041157827,"about_ca_topic_score_gemma":0.0022378934,"teacher_disagreement_score":0.008901169,"about_ca_system_score_codex":0.0024820052,"about_ca_system_score_gemma":0.0028178669,"threshold_uncertainty_score":0.047074437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005711808,0.0027379442,0.90093833,0.010768195,0.0009799144,0.000053173095,0.00018064401,0.000863495,0.07776657],"genre_scores_gemma":[0.3179715,0.004222214,0.63871634,0.004983349,0.0022228477,0.00035987442,0.00037783003,0.0008283724,0.030317638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959934,0.001837383,0.00019908877,0.0004288281,0.0012833528,0.00025796038],"domain_scores_gemma":[0.9921812,0.00483606,0.00036719927,0.001528919,0.0008231406,0.00026348146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006428413,0.0008155214,0.00076697586,0.0023613404,0.0029437924,0.008227483,0.0019870894,0.002127131,0.014847013],"category_scores_gemma":[0.010344156,0.00074566685,0.0019232212,0.0016027587,0.010022291,0.015912408,0.005444217,0.0068201656,0.0037683826],"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.0000031378825,0.0000028378213,0.000014506764,0.000017262946,0.0000023327368,0.000012842748,0.000067333945,0.00018991715,0.00010750548,0.997134,0.0007166523,0.0017316685],"study_design_scores_gemma":[0.000006872188,0.000004424418,0.000016565173,0.000029537317,0.0000064887345,0.00003715311,0.00004047782,0.0017276648,0.000469578,0.9711756,0.026478754,0.000006825735],"about_ca_topic_score_codex":0.0009603552,"about_ca_topic_score_gemma":0.0012846311,"teacher_disagreement_score":0.014847013,"about_ca_system_score_codex":0.0031309132,"about_ca_system_score_gemma":0.002395902,"threshold_uncertainty_score":0.049668193},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059491507,0.044397026,0.006393711,0.11864964,0.7606234,0.00009624087,0.0021209368,0.00048485523,0.06663931],"genre_scores_gemma":[0.0078045023,0.041186344,0.0030135345,0.020391997,0.73860383,0.00016690596,0.0037247548,0.0011155355,0.18399262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978612,0.00034700928,0.00016359435,0.00052986323,0.00094118883,0.00015721179],"domain_scores_gemma":[0.98718446,0.005176352,0.0005062625,0.0009986022,0.004307411,0.0018268755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037741365,0.0019812766,0.0019813832,0.0041888743,0.0021084032,0.008919823,0.0019809522,0.00367501,0.109253295],"category_scores_gemma":[0.017090123,0.0007335533,0.0019791638,0.0030582065,0.0014286328,0.0062007247,0.00233386,0.010105472,0.056114916],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000012934059,0.000012243829,0.00005983067,0.000102614424,0.000007811681,0.000023131983,0.00001995909,0.000082647144,0.000047155863,0.005136288,0.9848075,0.009687878],"study_design_scores_gemma":[0.000016405991,0.00002088139,0.00057113834,0.0003305851,0.000014606268,0.00010123456,0.000037634283,0.00047236905,0.00007671581,0.012591601,0.98574996,0.000016877542],"about_ca_topic_score_codex":0.0021415958,"about_ca_topic_score_gemma":0.0033320691,"teacher_disagreement_score":0.109253295,"about_ca_system_score_codex":0.0057697715,"about_ca_system_score_gemma":0.0025256576,"threshold_uncertainty_score":0.36548865},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015353367,0.05675655,0.37127355,0.012063224,0.0057661263,0.00027619343,0.002381069,0.0013786367,0.53475136],"genre_scores_gemma":[0.41900152,0.050282944,0.2797378,0.02004246,0.010855294,0.0011676123,0.0032657753,0.0012425026,0.21440402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998104,0.0005554765,0.00014642996,0.00037607722,0.0005337756,0.00028421753],"domain_scores_gemma":[0.9976145,0.0010241225,0.00011171513,0.00023186734,0.0007891903,0.00022870707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017245659,0.0009909482,0.0008269709,0.0035314888,0.0037952326,0.003991577,0.0016966325,0.0016897613,0.023763373],"category_scores_gemma":[0.002934084,0.00082196295,0.0012315536,0.005451239,0.0058468585,0.0067333267,0.0048119896,0.005570181,0.0074894577],"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.000009875941,0.00001402454,0.00019246603,0.00014127143,0.0000050440744,0.00010173352,0.00055349164,0.00021907233,0.00034821924,0.9709298,0.010426106,0.017058948],"study_design_scores_gemma":[0.000004069134,0.000020697822,0.0002844799,0.0001498462,0.000007215736,0.00053843536,0.00022587381,0.00051230786,0.00030269646,0.5831894,0.4147435,0.000021455604],"about_ca_topic_score_codex":0.003863782,"about_ca_topic_score_gemma":0.002948797,"teacher_disagreement_score":0.023763373,"about_ca_system_score_codex":0.0025858053,"about_ca_system_score_gemma":0.0014144328,"threshold_uncertainty_score":0.07949644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00773628,0.002364896,0.9238851,0.0044328594,0.00032418378,0.00007654353,0.00019949807,0.00027839848,0.06070231],"genre_scores_gemma":[0.52069724,0.0034958604,0.4424778,0.0031758235,0.0020957866,0.0008378646,0.00038399,0.00045906575,0.026376603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826884,0.0007977764,0.00008949233,0.00026695218,0.0004036631,0.00017321148],"domain_scores_gemma":[0.99821484,0.0007737963,0.00017201265,0.00046855147,0.00019437066,0.00017644127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038369335,0.0011334162,0.001308635,0.0017905392,0.0030515273,0.004263173,0.0023636713,0.002406984,0.006759662],"category_scores_gemma":[0.0033335625,0.00061713095,0.0021934677,0.0016632543,0.010041295,0.010834453,0.0039351042,0.0060153506,0.00134973],"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":[6.942097e-7,0.0000019121187,0.00001007475,0.000007773975,0.0000012475972,0.000013448594,0.000052014093,0.00031776435,0.000040680814,0.9991047,0.0001052327,0.0003443759],"study_design_scores_gemma":[0.0000024120848,0.000005193509,0.00001596927,0.000009830223,0.0000020360258,0.000023408678,0.000025961952,0.0026921395,0.00003590524,0.9928611,0.0043217028,0.0000043386067],"about_ca_topic_score_codex":0.0022617446,"about_ca_topic_score_gemma":0.0018468405,"teacher_disagreement_score":0.006759662,"about_ca_system_score_codex":0.003395849,"about_ca_system_score_gemma":0.0017510233,"threshold_uncertainty_score":0.024638772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079814166,0.0017643766,0.8909504,0.001937907,0.0002601285,0.00006255813,0.00036976364,0.00016485756,0.024675978],"genre_scores_gemma":[0.8926457,0.0011787147,0.10030373,0.0013212711,0.0008128719,0.00022348501,0.00045222903,0.00023431952,0.0028276017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895527,0.0034766952,0.00060249394,0.0016573031,0.003931996,0.0007789095],"domain_scores_gemma":[0.9436826,0.04126565,0.0030278221,0.0064166514,0.0036443092,0.0019629926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051651,0.0011440738,0.0021008062,0.0030135794,0.0018488589,0.0045760595,0.0023920974,0.0027195015,0.003168472],"category_scores_gemma":[0.055736374,0.0007359364,0.0014834893,0.001698327,0.008298883,0.01541449,0.008580101,0.0069464627,0.0005288402],"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.000038196762,0.000014902907,0.00038778264,0.000066008666,0.00001847739,0.000039675986,0.0001863904,0.0036124296,0.0008455711,0.9899442,0.0004320837,0.0044143857],"study_design_scores_gemma":[0.00000590513,0.000029178771,0.00024379627,0.0000310655,0.0000060855637,0.00006358004,0.000024055425,0.023031194,0.00042672578,0.9752871,0.0008335629,0.000017711498],"about_ca_topic_score_codex":0.000419935,"about_ca_topic_score_gemma":0.00032173638,"teacher_disagreement_score":0.01051651,"about_ca_system_score_codex":0.0021361713,"about_ca_system_score_gemma":0.0010502237,"threshold_uncertainty_score":0.055617273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060449545,0.00056770135,0.9739683,0.0010663131,0.00033676185,0.00006204187,0.00008459674,0.0004570553,0.017412234],"genre_scores_gemma":[0.35852164,0.0015965336,0.6077712,0.0015378385,0.0010024183,0.00043750717,0.00017419337,0.0004848738,0.02847381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.00036954661,0.00009951098,0.00023355875,0.00069037074,0.00018330295],"domain_scores_gemma":[0.9989506,0.00044824366,0.00008736206,0.00018341176,0.00023618595,0.00009415152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002103487,0.0005831756,0.0006239619,0.00087542477,0.0019172509,0.0028963387,0.0017381046,0.0011607584,0.005303434],"category_scores_gemma":[0.0026937593,0.0005140026,0.0014815313,0.000981913,0.0048246663,0.0055043437,0.0022649267,0.0031899302,0.0012951572],"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.000005041868,0.0000058951814,0.000018775916,0.000016578128,0.0000025263623,0.000028265018,0.000095621785,0.001245038,0.0004426504,0.9954053,0.00033262672,0.002401743],"study_design_scores_gemma":[0.000015207763,0.00001826854,0.00003343187,0.000020746225,0.000012518552,0.000056853685,0.000033065357,0.016458098,0.0009283058,0.9566192,0.025782613,0.000021657757],"about_ca_topic_score_codex":0.0022546817,"about_ca_topic_score_gemma":0.0013938136,"teacher_disagreement_score":0.005303434,"about_ca_system_score_codex":0.0014858604,"about_ca_system_score_gemma":0.002227443,"threshold_uncertainty_score":0.0177418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007577605,0.0012299813,0.97867376,0.0006991657,0.00012647548,0.00007015481,0.00009850597,0.0005153744,0.011009101],"genre_scores_gemma":[0.25283915,0.0024612711,0.7334774,0.0005721315,0.0004951097,0.00044126142,0.00031700425,0.00044481305,0.008951844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950059,0.0023296939,0.00039359918,0.0007994786,0.0010620897,0.00040926397],"domain_scores_gemma":[0.9936149,0.003876682,0.00041699666,0.0013661871,0.0005333417,0.00019171978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007730971,0.000870944,0.0012637773,0.0025170315,0.0018172364,0.0071134763,0.0030135007,0.0026833313,0.0034648047],"category_scores_gemma":[0.010715987,0.00096066,0.0026109212,0.0029122184,0.010494611,0.013856675,0.003954102,0.0039522485,0.0011290024],"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.0000078370795,0.000006539525,0.0001260212,0.00003784976,0.000006698182,0.000047386715,0.00029513641,0.0051630796,0.00020942383,0.9898976,0.0002824989,0.00391993],"study_design_scores_gemma":[0.0000124125045,0.000009564092,0.000041204752,0.000039047907,0.00001198962,0.00006969445,0.000047878413,0.028188385,0.00037946567,0.95891416,0.012273461,0.000012634165],"about_ca_topic_score_codex":0.0038240582,"about_ca_topic_score_gemma":0.003851805,"teacher_disagreement_score":0.007730971,"about_ca_system_score_codex":0.0035830357,"about_ca_system_score_gemma":0.0024960735,"threshold_uncertainty_score":0.040885806},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13679396,0.008013483,0.37198216,0.0073640347,0.0005590105,0.00017081664,0.001960007,0.0008158266,0.4723406],"genre_scores_gemma":[0.8748235,0.0021220027,0.063578814,0.0018449997,0.0007202784,0.00031377454,0.0015408386,0.00018401524,0.05487164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766624,0.00049285544,0.00012555947,0.00046470176,0.00088798377,0.00036273472],"domain_scores_gemma":[0.9983529,0.0004997265,0.00015447312,0.0002528376,0.0005148456,0.00022523986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023862,0.00038955262,0.00041704674,0.0023752633,0.0017121319,0.0033489002,0.0010827499,0.0009629902,0.010626451],"category_scores_gemma":[0.0026187494,0.00028183195,0.00067500863,0.0017535599,0.00668381,0.008844152,0.003513154,0.0016822226,0.0010683226],"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.00000459208,0.0000036009224,0.0000768192,0.000016158065,0.0000022470947,0.000025399533,0.00014610583,0.000105232866,0.00019998352,0.9964818,0.00063117326,0.0023068541],"study_design_scores_gemma":[0.000005885442,0.000009707387,0.00038612934,0.000020508778,0.0000063230154,0.00014477248,0.00019865368,0.0012163797,0.00034607033,0.9577433,0.03990997,0.00001234685],"about_ca_topic_score_codex":0.0039980505,"about_ca_topic_score_gemma":0.002004631,"teacher_disagreement_score":0.010626451,"about_ca_system_score_codex":0.0023428358,"about_ca_system_score_gemma":0.0011624515,"threshold_uncertainty_score":0.035549045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22650558,0.021819856,0.3887678,0.00945825,0.0014196325,0.000104188985,0.0005031189,0.0004403799,0.3509812],"genre_scores_gemma":[0.9044445,0.004812092,0.054065924,0.0013820773,0.00042451444,0.00007089775,0.00019847677,0.00008859338,0.03451304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888533,0.00027216782,0.0000640314,0.00027368107,0.00034875225,0.00015598058],"domain_scores_gemma":[0.99895716,0.00029603284,0.00009240005,0.000155523,0.00037180335,0.00012708994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001544255,0.00039866014,0.0003782104,0.0013551546,0.0014184525,0.0022166597,0.0006285875,0.00073246285,0.0059169475],"category_scores_gemma":[0.0018197154,0.00023900498,0.0004807848,0.0012674509,0.005279643,0.005426861,0.0038825376,0.0020498186,0.0005657832],"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.0000043516307,0.0000034241984,0.00043030578,0.000036304406,0.0000037561583,0.00008736175,0.0007017445,0.00015675389,0.00044459372,0.9923574,0.00084460876,0.004929455],"study_design_scores_gemma":[0.000010170748,0.0000558631,0.0028059236,0.00011785439,0.000024235886,0.0022906545,0.0014265572,0.0021797814,0.001330357,0.7737031,0.21602844,0.000026956319],"about_ca_topic_score_codex":0.0031325284,"about_ca_topic_score_gemma":0.0024126745,"teacher_disagreement_score":0.0059169475,"about_ca_system_score_codex":0.0013668513,"about_ca_system_score_gemma":0.0007191778,"threshold_uncertainty_score":0.019794166},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029225886,0.009487637,0.0013354478,0.04047224,0.91769814,0.000094006726,0.0008029201,0.00027906528,0.02953824],"genre_scores_gemma":[0.0032175032,0.011892756,0.00080693164,0.013952863,0.7985647,0.00013393158,0.0020877167,0.0005746825,0.1687689],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982084,0.00019048167,0.00018871548,0.00031230337,0.0009319585,0.00016813105],"domain_scores_gemma":[0.9851767,0.0041894643,0.0006825986,0.00068205496,0.006945498,0.0023237474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028025378,0.0016903525,0.0020102982,0.005463877,0.0025039823,0.008241428,0.0017574766,0.0034526621,0.12151671],"category_scores_gemma":[0.011813939,0.00056098687,0.001338242,0.003341085,0.0009630105,0.005046132,0.0019837797,0.0057064374,0.06034995],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001844266,0.00001575916,0.00004590975,0.000110627785,0.0000033157664,0.000019602307,0.000015028435,0.000029525414,0.00008109526,0.00066902506,0.9894225,0.009569291],"study_design_scores_gemma":[0.000019233808,0.000040098053,0.00070368743,0.00025532237,0.000011428892,0.00007737472,0.00004325358,0.00019408365,0.00012041819,0.0017897645,0.99673235,0.000012942138],"about_ca_topic_score_codex":0.0021699488,"about_ca_topic_score_gemma":0.0031215677,"teacher_disagreement_score":0.12151671,"about_ca_system_score_codex":0.0033447647,"about_ca_system_score_gemma":0.0025275177,"threshold_uncertainty_score":0.40651387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017778292,0.00041755626,0.975575,0.00014963029,0.000115300594,0.00011807023,0.00033037216,0.0026092813,0.002906424],"genre_scores_gemma":[0.13186575,0.00027318063,0.85841006,0.00019494278,0.000071889786,0.0001833588,0.001654634,0.00026329467,0.007082878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.00012598591,0.00013710052,0.00037041717,0.0004687203,0.00019745938],"domain_scores_gemma":[0.9988153,0.00021536603,0.000100377874,0.00040583182,0.00040593705,0.000057254983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332675,0.00061386434,0.0012438045,0.001690329,0.0010523018,0.0012263352,0.0017265544,0.0013237565,0.009041062],"category_scores_gemma":[0.0031723313,0.0003950075,0.00066480617,0.002612029,0.0006071407,0.0020165136,0.0020021705,0.00073203334,0.0049456055],"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.00074522843,0.00015727685,0.0016298721,0.00023309386,0.00006469167,0.00024756364,0.00018222889,0.04857311,0.033944737,0.021993432,0.018371655,0.87385714],"study_design_scores_gemma":[0.00014161947,0.00019614086,0.0008286127,0.00002986947,0.000043572036,0.00090072537,0.00013609206,0.9020497,0.049878754,0.0226577,0.023085862,0.00005133835],"about_ca_topic_score_codex":0.0023606643,"about_ca_topic_score_gemma":0.0028590928,"teacher_disagreement_score":0.009041062,"about_ca_system_score_codex":0.00066534587,"about_ca_system_score_gemma":0.0021006332,"threshold_uncertainty_score":0.030245423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013298627,0.00061961956,0.9812305,0.00033239703,0.00008186204,0.00008030909,0.00014825564,0.0002814479,0.003927033],"genre_scores_gemma":[0.30411354,0.0010535843,0.6921084,0.00022415134,0.00016368684,0.00026038886,0.00043344498,0.000033587625,0.0016091807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636567,0.0014987068,0.0004164438,0.00072485296,0.0008273937,0.00016690885],"domain_scores_gemma":[0.9969008,0.0014494787,0.0004643844,0.0005560446,0.00052578404,0.00010352453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002882354,0.000543088,0.00067509327,0.002276282,0.0008174092,0.0033576011,0.0012182072,0.0008608699,0.0021016581],"category_scores_gemma":[0.0070665013,0.00032975385,0.0011784974,0.0016774071,0.0024175707,0.004622174,0.002197783,0.0016010634,0.0005384904],"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.00003395455,0.000025763311,0.00043982698,0.00013489899,0.000045910154,0.00022666839,0.00038981528,0.02183726,0.0013662567,0.932273,0.0005135465,0.04271306],"study_design_scores_gemma":[0.000034715853,0.000047446058,0.00019530136,0.00008394049,0.000055502078,0.00025584162,0.00015756083,0.099136,0.0016212877,0.8796202,0.01875102,0.000041129017],"about_ca_topic_score_codex":0.0012056235,"about_ca_topic_score_gemma":0.0008787756,"teacher_disagreement_score":0.0033576011,"about_ca_system_score_codex":0.0006542226,"about_ca_system_score_gemma":0.0009977054,"threshold_uncertainty_score":0.015243471},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24447437,0.0068478202,0.55998194,0.0029118906,0.0007221808,0.00023423006,0.0013667764,0.0005836886,0.18287708],"genre_scores_gemma":[0.8695009,0.0025424499,0.09765699,0.0008098198,0.00044173773,0.00025705004,0.00074225024,0.000100309,0.02794844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997198,0.0006815559,0.00031992295,0.0007068831,0.000808836,0.00028483506],"domain_scores_gemma":[0.99588996,0.0021875908,0.0003835294,0.00050439336,0.00071153115,0.00032296198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026552747,0.0005349307,0.00056883285,0.003021488,0.0018937286,0.0036452126,0.0009698656,0.00097198115,0.0064130756],"category_scores_gemma":[0.004627214,0.0005482579,0.0013805125,0.0018168775,0.0056192908,0.007994667,0.0027032453,0.002216528,0.0007162939],"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.000008540823,0.000006890931,0.000096757176,0.000017260787,0.000004522986,0.00007295366,0.0001689778,0.00046410994,0.00024378399,0.99658906,0.00016628207,0.0021609198],"study_design_scores_gemma":[0.000010491119,0.00001652756,0.0001743611,0.000021376916,0.000009650624,0.0001715219,0.00011861864,0.002873897,0.000653617,0.9875222,0.008411763,0.000015995214],"about_ca_topic_score_codex":0.002159955,"about_ca_topic_score_gemma":0.0012865136,"teacher_disagreement_score":0.0064130756,"about_ca_system_score_codex":0.002092464,"about_ca_system_score_gemma":0.0010381558,"threshold_uncertainty_score":0.021453857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27575222,0.0036956028,0.55150753,0.006940604,0.00019041119,0.000069568356,0.00020550979,0.00031562464,0.16132292],"genre_scores_gemma":[0.955869,0.0012543857,0.032374028,0.00041399465,0.0002698772,0.00009824742,0.00013662437,0.000098532204,0.009485401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982418,0.00041721482,0.00011553728,0.0004236167,0.00053668086,0.00026510478],"domain_scores_gemma":[0.9958515,0.0024219484,0.00031655421,0.00068657147,0.00043987928,0.00028355612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014182626,0.0005182711,0.0006106325,0.0017995121,0.0017834201,0.002625442,0.0007970345,0.0008294003,0.0039982325],"category_scores_gemma":[0.0061029885,0.0003017966,0.0008665262,0.0017695887,0.010053646,0.008804456,0.0046997233,0.0034656723,0.00042063615],"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.00000429743,0.0000028298534,0.000072526265,0.000009300988,0.0000018006798,0.00001821587,0.000102381775,0.0003768929,0.00018254538,0.9977977,0.000094207666,0.0013373091],"study_design_scores_gemma":[0.0000035078651,0.000008764877,0.00020252464,0.000009932503,0.0000030864621,0.000057152974,0.000057587167,0.0038541728,0.0003987446,0.9925096,0.0028896648,0.000005213402],"about_ca_topic_score_codex":0.0020184605,"about_ca_topic_score_gemma":0.0010225524,"teacher_disagreement_score":0.0039982325,"about_ca_system_score_codex":0.0024556161,"about_ca_system_score_gemma":0.00071820733,"threshold_uncertainty_score":0.017816842},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012524224,0.016310409,0.0004921286,0.6089663,0.3709647,0.00001103631,0.00020131707,0.000086574495,0.0028422237],"genre_scores_gemma":[0.004446309,0.020126168,0.0012367812,0.21420223,0.7466209,0.00006139192,0.00017495654,0.00028685265,0.012844537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97466916,0.00608748,0.0037287292,0.0033743703,0.011315247,0.0008249759],"domain_scores_gemma":[0.781191,0.12131029,0.008721449,0.008312087,0.075297534,0.0051676105],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.03399948,0.002028827,0.0039691203,0.011018345,0.004418716,0.01568396,0.0045018233,0.009883285,0.01536296],"category_scores_gemma":[0.18535616,0.0010041198,0.0013112818,0.014537726,0.0077535706,0.017609734,0.004391765,0.016238635,0.010334691],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000006623038,0.0000041445082,0.000093065275,0.000093317314,0.0000071759714,0.000015893875,0.00012205953,0.000013979781,0.000012856248,0.0041453484,0.99057287,0.0049125417],"study_design_scores_gemma":[0.00002213376,0.000006121602,0.00049812766,0.00054057525,0.0000269104,0.00009085067,0.00032715648,0.0001913937,0.00009950759,0.013225404,0.9849305,0.000041247997],"about_ca_topic_score_codex":0.006203743,"about_ca_topic_score_gemma":0.010325969,"teacher_disagreement_score":0.98898166,"about_ca_system_score_codex":0.0046468056,"about_ca_system_score_gemma":0.0061790273,"threshold_uncertainty_score":0.17980862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04392075,0.0023040557,0.9247241,0.0035322537,0.00043656275,0.00018277887,0.00031762946,0.0009739838,0.023607923],"genre_scores_gemma":[0.7323365,0.0016812136,0.25521848,0.0014963809,0.0006271079,0.00040443975,0.00036195223,0.00041680457,0.007457087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918358,0.0033184302,0.0006276543,0.0018469669,0.0016205268,0.0007506597],"domain_scores_gemma":[0.9718071,0.019341588,0.0018559956,0.005272413,0.0012048106,0.0005179939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071569243,0.0010248525,0.0013616756,0.0013864798,0.0011701571,0.0057791066,0.0028085983,0.0026600119,0.0074125854],"category_scores_gemma":[0.040864382,0.00065286696,0.0021345182,0.001669321,0.011943749,0.018724786,0.0040813,0.004338166,0.0012277635],"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.00006323902,0.000014955861,0.00035718974,0.00009795949,0.000019296398,0.00006003485,0.00013406022,0.0053868555,0.0005361227,0.9852926,0.0004683398,0.0075693517],"study_design_scores_gemma":[0.000021122734,0.000043424443,0.000178904,0.000038338534,0.000020129175,0.000062284205,0.000042940806,0.031058237,0.0015874371,0.9632868,0.0036350193,0.000025386884],"about_ca_topic_score_codex":0.0009954699,"about_ca_topic_score_gemma":0.0004622558,"teacher_disagreement_score":0.0074125854,"about_ca_system_score_codex":0.0018816985,"about_ca_system_score_gemma":0.0010266345,"threshold_uncertainty_score":0.037849903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14200033,0.0024414638,0.43636557,0.00787492,0.0010619207,0.00015802137,0.00060765387,0.001411139,0.40807897],"genre_scores_gemma":[0.91369754,0.0007274395,0.041815206,0.0016771252,0.0005944876,0.00006430895,0.00026004153,0.00022180953,0.040941913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858475,0.00022469953,0.00007600208,0.00031034418,0.00060124975,0.00020294955],"domain_scores_gemma":[0.9982936,0.0005769863,0.00008744767,0.00030874895,0.0005923937,0.00014079375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014155195,0.0002543411,0.0003411311,0.001044754,0.0014298686,0.0017507893,0.00065066956,0.0006232006,0.011444442],"category_scores_gemma":[0.002817188,0.0002537189,0.0007897237,0.00062374165,0.0031131196,0.0035758668,0.0033688068,0.0020334406,0.000973286],"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.00000940489,0.0000075597513,0.00018291462,0.00003251646,0.0000053851445,0.00015894807,0.00033413724,0.00017972072,0.0010078275,0.99025834,0.0017741276,0.0060491026],"study_design_scores_gemma":[0.000015351396,0.000030505535,0.000562466,0.000026024849,0.000015284053,0.0005514933,0.00023096672,0.0030311027,0.0031731287,0.93769526,0.054646835,0.000021444706],"about_ca_topic_score_codex":0.0038552063,"about_ca_topic_score_gemma":0.0026062985,"teacher_disagreement_score":0.011444442,"about_ca_system_score_codex":0.0013391197,"about_ca_system_score_gemma":0.00069247035,"threshold_uncertainty_score":0.038285494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05071967,0.00060746766,0.92254066,0.001152599,0.00014842738,0.0003981299,0.0013462333,0.006861707,0.016225135],"genre_scores_gemma":[0.35981,0.00057870575,0.6319946,0.00027156027,0.00006999859,0.0005989127,0.0027211988,0.0019484231,0.002006559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9791613,0.008815242,0.0027434044,0.0014748643,0.0065906565,0.0012145488],"domain_scores_gemma":[0.9413133,0.039400794,0.003403446,0.009371901,0.0053628576,0.0011476415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017266048,0.0012271006,0.0013914368,0.0042885463,0.0027296958,0.007883566,0.00547475,0.0022426173,0.0058286516],"category_scores_gemma":[0.07822418,0.0011415863,0.002103639,0.005394961,0.004311741,0.016514238,0.0048690923,0.0042217057,0.0009281098],"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.00022186925,0.0002434938,0.0031159688,0.0007202892,0.0000781902,0.00020135644,0.0016012603,0.03609468,0.003403738,0.9033156,0.0042908275,0.046712715],"study_design_scores_gemma":[0.00011349301,0.00020860607,0.001225027,0.00047670078,0.00011955513,0.00024439328,0.0010569631,0.2195698,0.02125206,0.72196037,0.033635065,0.000137891],"about_ca_topic_score_codex":0.0054796017,"about_ca_topic_score_gemma":0.0053976434,"teacher_disagreement_score":0.017266048,"about_ca_system_score_codex":0.004441741,"about_ca_system_score_gemma":0.0049546505,"threshold_uncertainty_score":0.09131271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109972574,0.027384847,0.4574079,0.008248399,0.0009382451,0.00012146513,0.000594567,0.0006499064,0.39468214],"genre_scores_gemma":[0.8798261,0.0050657564,0.075018704,0.0020577644,0.0009072181,0.00019708567,0.0005345784,0.00013355172,0.036259137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977532,0.0007086564,0.00013573193,0.000374255,0.0007908929,0.00023737243],"domain_scores_gemma":[0.9985177,0.00063404924,0.000113558184,0.00021774568,0.00033346092,0.00018352555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760924,0.0004185562,0.00047019066,0.0026884496,0.0021609387,0.0035484605,0.0007965986,0.0011765519,0.0065871654],"category_scores_gemma":[0.0024617878,0.00029867204,0.0005506376,0.0019994332,0.008213573,0.006860843,0.003925213,0.0020959417,0.00062982907],"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.0000017535389,0.0000015146464,0.000060513015,0.0000123770305,0.000001569639,0.000014029187,0.00017598162,0.00007971752,0.000096656935,0.99677914,0.00034029875,0.002436435],"study_design_scores_gemma":[0.0000020318416,0.0000047953886,0.00020049648,0.000012147286,0.0000023396258,0.00008281403,0.00011496416,0.00031726432,0.000113243455,0.96907467,0.03007093,0.0000042204774],"about_ca_topic_score_codex":0.0016394968,"about_ca_topic_score_gemma":0.0010033217,"teacher_disagreement_score":0.0065871654,"about_ca_system_score_codex":0.002628837,"about_ca_system_score_gemma":0.0012462247,"threshold_uncertainty_score":0.022036314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027812429,0.000093687675,0.9694462,0.00010891503,0.000024997953,0.000021725164,0.000041367955,0.00028985733,0.0021608358],"genre_scores_gemma":[0.66927516,0.00017009041,0.32523808,0.00011068754,0.000050857718,0.00012333589,0.00023131867,0.00019606548,0.0046043983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778867,0.00077793153,0.00013914437,0.00044724703,0.00068845233,0.00015854364],"domain_scores_gemma":[0.99758995,0.001114629,0.00016562566,0.00051094976,0.00054032047,0.00007859214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014629798,0.0005126482,0.00069572724,0.00093979615,0.0004916213,0.0015811273,0.001069437,0.00062532525,0.0027826233],"category_scores_gemma":[0.00620173,0.00035258647,0.00083998486,0.00071711105,0.0020486787,0.0020391732,0.0014414026,0.0012539946,0.00049504754],"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.00007872044,0.0000318617,0.0005216187,0.000081055245,0.00003329897,0.0000623034,0.00019505284,0.12137208,0.0066037937,0.82889485,0.0006977062,0.041427687],"study_design_scores_gemma":[0.0000066316256,0.000028533,0.00007091018,0.000016622436,0.0000067613137,0.000026154104,0.000035286754,0.5621905,0.0046267505,0.43164492,0.0013362262,0.00001071367],"about_ca_topic_score_codex":0.0010388809,"about_ca_topic_score_gemma":0.0011791162,"teacher_disagreement_score":0.0027826233,"about_ca_system_score_codex":0.001149911,"about_ca_system_score_gemma":0.00077225117,"threshold_uncertainty_score":0.009308755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055087516,0.0002297833,0.98230875,0.0008150069,0.00014404712,0.000093615236,0.0000933826,0.0029040088,0.007902697],"genre_scores_gemma":[0.2205239,0.00066747214,0.76846945,0.0008590634,0.0001990097,0.00025755537,0.00031264193,0.0015112374,0.0071996506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893882,0.004344708,0.0006540634,0.0014155828,0.0034466821,0.0007507142],"domain_scores_gemma":[0.978015,0.012349979,0.0008828022,0.0061121355,0.0022399786,0.0004000472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009516928,0.00096324127,0.0008441512,0.0017855265,0.0019805734,0.004831276,0.003610216,0.0015901771,0.010336817],"category_scores_gemma":[0.034225114,0.0014112714,0.0024806869,0.0012353066,0.008058869,0.016489899,0.009232184,0.005336737,0.0035428994],"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.000038227096,0.000038105598,0.00023547966,0.00022168424,0.00003435994,0.00011532273,0.00057179254,0.005201726,0.0030873162,0.9635916,0.0026533534,0.024211077],"study_design_scores_gemma":[0.000060842012,0.000050105824,0.00018919066,0.00016521658,0.00006971634,0.00024729135,0.00021010092,0.03175791,0.021649469,0.89771825,0.04779861,0.00008329944],"about_ca_topic_score_codex":0.0022297238,"about_ca_topic_score_gemma":0.0031230056,"teacher_disagreement_score":0.010336817,"about_ca_system_score_codex":0.0021751742,"about_ca_system_score_gemma":0.00425095,"threshold_uncertainty_score":0.050330937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017198471,0.003248523,0.92037946,0.012626254,0.0005487263,0.00013295692,0.000043043445,0.001193542,0.044629075],"genre_scores_gemma":[0.3737207,0.0020029736,0.6038993,0.0022741405,0.0003181125,0.00027676087,0.000044541215,0.0006667285,0.016796801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99006724,0.0059422017,0.00028511824,0.000945791,0.0020095622,0.00075000105],"domain_scores_gemma":[0.98781604,0.008920318,0.00022679314,0.0017847086,0.00089645706,0.00035567864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011842849,0.0006679918,0.0010623398,0.0019706637,0.0038445536,0.0044175414,0.0023025977,0.004182625,0.0037553601],"category_scores_gemma":[0.023015799,0.0008289025,0.0018686666,0.0015702007,0.015675357,0.012201775,0.005477599,0.0071151606,0.0010304452],"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.000017769014,0.000018481433,0.00011946123,0.000030976767,0.000007038416,0.0001514373,0.0007996697,0.00056602206,0.0002841871,0.9875608,0.0012701402,0.009174045],"study_design_scores_gemma":[0.000055517914,0.00006216976,0.00013913319,0.00015291944,0.00003188463,0.00066178583,0.00072697335,0.015215835,0.0050268983,0.8679145,0.10994454,0.000067850924],"about_ca_topic_score_codex":0.00490582,"about_ca_topic_score_gemma":0.0034486253,"teacher_disagreement_score":0.011842849,"about_ca_system_score_codex":0.0029962896,"about_ca_system_score_gemma":0.0020912546,"threshold_uncertainty_score":0.062631726},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026813103,0.015381758,0.53207266,0.005588048,0.0015553102,0.00018782096,0.0011165128,0.00058919756,0.41669556],"genre_scores_gemma":[0.68363106,0.007686262,0.20508939,0.004020609,0.0014719117,0.00041014847,0.0014490248,0.00036409253,0.09587745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864393,0.0003941239,0.00008939363,0.0003304817,0.0003820978,0.00015986766],"domain_scores_gemma":[0.99886155,0.00038421806,0.00006906306,0.0002089344,0.00032784118,0.00014847095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015589945,0.0006504637,0.0006083304,0.0028309599,0.0025192832,0.0029817813,0.0012082711,0.0009400777,0.009028484],"category_scores_gemma":[0.0023739822,0.00037734568,0.0007895017,0.00209966,0.005114217,0.006295466,0.0040164725,0.0022994976,0.0018188319],"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.0000017632557,0.000001728345,0.00004536481,0.000013298479,0.0000016713063,0.00001354159,0.0001369397,0.000062535466,0.00006952571,0.9963775,0.00094959815,0.0023264736],"study_design_scores_gemma":[0.000003967734,0.0000070638403,0.00011250246,0.000019540938,0.0000037215266,0.00015111815,0.0001089723,0.00045822386,0.00018532942,0.8786085,0.12033481,0.00000626614],"about_ca_topic_score_codex":0.0017226188,"about_ca_topic_score_gemma":0.0014891139,"teacher_disagreement_score":0.009028484,"about_ca_system_score_codex":0.0021495118,"about_ca_system_score_gemma":0.0009278043,"threshold_uncertainty_score":0.030203342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5934108,0.0015031536,0.32355544,0.0021992493,0.000430534,0.00005863065,0.00024916872,0.00044628762,0.07814675],"genre_scores_gemma":[0.9755029,0.00036372058,0.015395098,0.00019639544,0.00013915556,0.000036956764,0.00008117181,0.00004765728,0.008236891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909663,0.00018103865,0.000058441074,0.00018577813,0.0003618477,0.000116237694],"domain_scores_gemma":[0.99783355,0.00090276427,0.00021921592,0.00025373726,0.00047425428,0.00031649866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011094565,0.0003329758,0.0005524918,0.0021361061,0.0014811539,0.0027836226,0.00095204206,0.0008288397,0.00615934],"category_scores_gemma":[0.0032657818,0.00037877745,0.00043329125,0.0009833331,0.0054142955,0.007198278,0.003854836,0.0020829332,0.0006318155],"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.000010316939,0.0000052268047,0.00042279062,0.000023299344,0.0000035525343,0.00009856464,0.00033734334,0.00038218577,0.0007327001,0.99515605,0.00025636208,0.0025716221],"study_design_scores_gemma":[0.0000052915043,0.000014634646,0.0004559368,0.00001831803,0.000004442138,0.00026798042,0.00036277567,0.0028693774,0.0009951597,0.9913974,0.0035951429,0.000013618347],"about_ca_topic_score_codex":0.00055948447,"about_ca_topic_score_gemma":0.0004629459,"teacher_disagreement_score":0.00615934,"about_ca_system_score_codex":0.0010073248,"about_ca_system_score_gemma":0.0004199072,"threshold_uncertainty_score":0.020605028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1286778,0.0018537963,0.7008656,0.004504274,0.00023603835,0.00014999026,0.00057086896,0.0007856402,0.16235593],"genre_scores_gemma":[0.9193246,0.0007794809,0.062086564,0.00085708394,0.00023033259,0.00020661457,0.0003627051,0.00022785114,0.015924733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980398,0.0005944215,0.00006825747,0.00028923663,0.0006593723,0.0003488943],"domain_scores_gemma":[0.9988136,0.00045730887,0.00013000943,0.00017313949,0.00023241939,0.00019350706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596699,0.0005987027,0.00049231254,0.0019246615,0.0020575135,0.0045137783,0.0011472999,0.001092165,0.007617197],"category_scores_gemma":[0.0018947347,0.0003991246,0.0012830299,0.0011945588,0.0053276345,0.006790157,0.0048720688,0.0031848215,0.0011148778],"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.0000057302377,0.0000042972993,0.000096437696,0.000009655562,0.0000022255604,0.000042893826,0.00024965891,0.00039255313,0.00030053192,0.9975399,0.0001731337,0.0011829556],"study_design_scores_gemma":[0.000010293209,0.000031800795,0.0002768478,0.000021785901,0.00001028789,0.00013861948,0.00032550446,0.006702418,0.0007935716,0.97745925,0.014208159,0.000021378915],"about_ca_topic_score_codex":0.002357816,"about_ca_topic_score_gemma":0.0010805092,"teacher_disagreement_score":0.007617197,"about_ca_system_score_codex":0.0028595834,"about_ca_system_score_gemma":0.0008927542,"threshold_uncertainty_score":0.025482118},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005344835,0.031809803,0.0028503328,0.11226802,0.8260626,0.000054894383,0.00025928553,0.00029856904,0.025861915],"genre_scores_gemma":[0.0050098957,0.016535409,0.0011442984,0.017304232,0.8829556,0.00007167507,0.00036451555,0.0006152297,0.07599909],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99421847,0.0010529322,0.00039874134,0.0012785302,0.0024804191,0.0005709982],"domain_scores_gemma":[0.9862124,0.006547205,0.00067339704,0.00091292604,0.002739605,0.0029144178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047996906,0.0018437287,0.0022792707,0.0027951926,0.004276007,0.011512545,0.0021077974,0.0050488766,0.04662111],"category_scores_gemma":[0.015088421,0.0010898291,0.0022614703,0.0018680753,0.0031693743,0.01008722,0.0040004756,0.011151162,0.014442672],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000031183437,0.000024718998,0.00006934017,0.00015848917,0.000014186589,0.00007231205,0.00005795311,0.00009565046,0.00015280527,0.0075503555,0.98149693,0.010275982],"study_design_scores_gemma":[0.000009752538,0.00001644237,0.00015115221,0.00017618075,0.000009046846,0.00011904524,0.000035247744,0.00017831803,0.00007679178,0.006730561,0.9924867,0.000010683971],"about_ca_topic_score_codex":0.00089954975,"about_ca_topic_score_gemma":0.0023108898,"teacher_disagreement_score":0.04662111,"about_ca_system_score_codex":0.0054628174,"about_ca_system_score_gemma":0.003382063,"threshold_uncertainty_score":0.15596318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48861882,0.00083098735,0.33614528,0.0029733044,0.00031935898,0.00006440523,0.0004162498,0.00072537543,0.1699061],"genre_scores_gemma":[0.97900087,0.00012735679,0.011482434,0.00018062921,0.00007261771,0.000031166077,0.00010066522,0.00004071072,0.008963585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983919,0.0003410176,0.00008695099,0.00026108627,0.00069932576,0.00021957842],"domain_scores_gemma":[0.99853337,0.0003775045,0.00011773498,0.0002856651,0.0004324791,0.00025328086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014361598,0.00025606502,0.00040843367,0.0010340529,0.001283385,0.0032931438,0.0010271794,0.0006108895,0.0035073163],"category_scores_gemma":[0.00207191,0.00024318855,0.0006619721,0.0007260532,0.004925756,0.0038893062,0.003656501,0.0014277331,0.00042956803],"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.0000052223445,0.0000040599157,0.00012185125,0.0000057882594,0.0000016269245,0.000037172173,0.00019287015,0.00041369157,0.00027072272,0.9979253,0.00012964084,0.0008921127],"study_design_scores_gemma":[0.000008665069,0.000011530612,0.00018637402,0.0000070767837,0.00000477893,0.00006543654,0.00012555988,0.0046431916,0.00054321816,0.9884112,0.005984477,0.000008542453],"about_ca_topic_score_codex":0.0020546273,"about_ca_topic_score_gemma":0.0013216465,"teacher_disagreement_score":0.0035073163,"about_ca_system_score_codex":0.0027334797,"about_ca_system_score_gemma":0.0010838478,"threshold_uncertainty_score":0.01983291},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958122,0.03949166,0.80626065,0.027335554,0.0029700606,0.000080749545,0.00040283354,0.0004138197,0.05346344],"genre_scores_gemma":[0.69046676,0.014840638,0.27312014,0.005242404,0.0025733816,0.00026753332,0.00029646105,0.00027448,0.012918229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975242,0.0010427143,0.00024149673,0.0004759361,0.00057762826,0.00013792048],"domain_scores_gemma":[0.99616385,0.0017391538,0.00040259148,0.0005655982,0.000712662,0.0004162038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049849013,0.0005440538,0.0010780544,0.0036198688,0.0030852037,0.008165647,0.0016437169,0.0027132018,0.0046469644],"category_scores_gemma":[0.004906751,0.00048746783,0.0012186662,0.0038388057,0.01272278,0.0237209,0.0037096788,0.0026065973,0.0009217713],"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.000019064399,0.000009636587,0.00023681394,0.00007009472,0.000008870987,0.000058007467,0.0007014832,0.0003443392,0.00026867105,0.99153155,0.0010323086,0.0057190447],"study_design_scores_gemma":[0.0000048804386,0.000020661817,0.00017822534,0.0001228854,0.000010385808,0.00030310967,0.0006947502,0.0017935522,0.0003761541,0.968347,0.028129771,0.000018591354],"about_ca_topic_score_codex":0.0009354713,"about_ca_topic_score_gemma":0.0007412699,"teacher_disagreement_score":0.008165647,"about_ca_system_score_codex":0.002173741,"about_ca_system_score_gemma":0.001101918,"threshold_uncertainty_score":0.026363015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019037917,0.00030014603,0.9713699,0.000833458,0.000071196286,0.00008510798,0.00019696113,0.00035175364,0.007753573],"genre_scores_gemma":[0.8154131,0.00043351212,0.17924346,0.00040402362,0.00024089623,0.0002734785,0.00021639916,0.00022669745,0.0035485094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9875239,0.0035899458,0.0009088736,0.002376232,0.004461305,0.001139616],"domain_scores_gemma":[0.963063,0.021866761,0.0037269476,0.008358247,0.0022835026,0.00070155074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477683,0.0011997061,0.0013038489,0.0028045732,0.0024837812,0.007353929,0.0025063392,0.002475749,0.0042288858],"category_scores_gemma":[0.041516714,0.001020992,0.002879391,0.0018387309,0.011687703,0.016511567,0.0075458908,0.0047506616,0.00038916492],"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.000031665444,0.0000142221625,0.00052770664,0.000075761556,0.000032379077,0.00010145668,0.00039742186,0.011638891,0.001312052,0.9804155,0.00025821786,0.0051946538],"study_design_scores_gemma":[0.00001007843,0.000027836993,0.00025481076,0.000034860845,0.000033609158,0.00014444707,0.000076876975,0.0399771,0.0018796398,0.9543638,0.0031636932,0.000033097243],"about_ca_topic_score_codex":0.0022650505,"about_ca_topic_score_gemma":0.0009834494,"teacher_disagreement_score":0.009477683,"about_ca_system_score_codex":0.0041620564,"about_ca_system_score_gemma":0.002232474,"threshold_uncertainty_score":0.050123394},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148161845,0.00057978084,0.9782321,0.0008671859,0.00017370615,0.00012974751,0.00020674498,0.0011546098,0.003839906],"genre_scores_gemma":[0.14879215,0.00020324643,0.843095,0.00059061305,0.00017098946,0.00038014728,0.0007773675,0.00043284995,0.0055576116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986765,0.00044191178,0.000056037225,0.0003235455,0.00027008523,0.00023189203],"domain_scores_gemma":[0.9983065,0.0009783243,0.00013416728,0.00015970426,0.0002878059,0.00013354585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024080628,0.0021444315,0.002914069,0.0010622714,0.000950198,0.0019976993,0.0033240896,0.002964996,0.006485669],"category_scores_gemma":[0.0042135306,0.0011292406,0.0015912796,0.0018284677,0.0012911205,0.0021418282,0.0020288252,0.004673639,0.0020772072],"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.00037513408,0.0003014865,0.00062459626,0.00019157161,0.00008643781,0.00008521417,0.00009480191,0.881847,0.0012793388,0.016227847,0.010978442,0.087908],"study_design_scores_gemma":[0.00002797311,0.000015653468,0.0000334185,0.0000069085213,0.000004560422,0.000011246173,0.000008704527,0.9961797,0.00017629325,0.0031755932,0.00035552407,0.00000454062],"about_ca_topic_score_codex":0.013023481,"about_ca_topic_score_gemma":0.012417895,"teacher_disagreement_score":0.013023481,"about_ca_system_score_codex":0.0025069998,"about_ca_system_score_gemma":0.0038912871,"threshold_uncertainty_score":0.025895357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025426565,0.0007852275,0.9451698,0.00247938,0.0000724921,0.00006624937,0.0001119479,0.0005389753,0.025349298],"genre_scores_gemma":[0.6431565,0.0006024413,0.34970036,0.00093055685,0.00018955878,0.00017133099,0.00014882968,0.00010928382,0.004991088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981996,0.00089973334,0.00010896553,0.00021144157,0.00041508747,0.00016518141],"domain_scores_gemma":[0.99711007,0.0016591513,0.00022796706,0.00031561838,0.0005583945,0.00012874772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428993,0.0003636253,0.00033158134,0.0027617798,0.0012262978,0.002910142,0.0014506356,0.0008315595,0.0030653775],"category_scores_gemma":[0.0036273957,0.0005785928,0.0012071058,0.0011940196,0.0048173335,0.0037343518,0.0021361746,0.002475704,0.00034425175],"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.000004661804,0.000008340639,0.0000917135,0.0000161479,0.0000061087917,0.00003547929,0.00016610969,0.0009779923,0.0003463199,0.9948631,0.00027482354,0.0032092603],"study_design_scores_gemma":[0.000013676937,0.000018742854,0.00011595124,0.000030710253,0.000013463033,0.000058175086,0.0001201909,0.017419096,0.0013683937,0.97445774,0.0063717263,0.000012126885],"about_ca_topic_score_codex":0.0043973625,"about_ca_topic_score_gemma":0.0037067195,"teacher_disagreement_score":0.0043973625,"about_ca_system_score_codex":0.0037167722,"about_ca_system_score_gemma":0.0014936912,"threshold_uncertainty_score":0.026967168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09884577,0.0003626646,0.89269716,0.0012665212,0.00008125246,0.0002489901,0.00052355323,0.00046251,0.005511558],"genre_scores_gemma":[0.677175,0.00017545442,0.31535172,0.00033206388,0.00010558459,0.0002933315,0.00065266615,0.00017535458,0.0057388926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983474,0.00069346896,0.00005306603,0.00041807312,0.00020030503,0.0002877068],"domain_scores_gemma":[0.99709797,0.0017898422,0.00023595891,0.00034343248,0.00025145378,0.0002814489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002843844,0.0014163285,0.0020517216,0.00050534966,0.0005580524,0.0013419853,0.002086664,0.0017539138,0.0058368384],"category_scores_gemma":[0.006242451,0.00065572787,0.0014011367,0.0011134959,0.001243526,0.0029805622,0.0017640389,0.002055519,0.0005078089],"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.001257245,0.00045107907,0.0021070195,0.00054122857,0.00022091139,0.00042866674,0.0001853469,0.75135815,0.010183524,0.13716659,0.012191681,0.08390865],"study_design_scores_gemma":[0.00009062375,0.000092321556,0.0002100092,0.000012045039,0.000021448635,0.0000627441,0.000019606052,0.9621253,0.0014068378,0.03508332,0.0008632893,0.000012414015],"about_ca_topic_score_codex":0.0024197258,"about_ca_topic_score_gemma":0.0021143216,"teacher_disagreement_score":0.0058368384,"about_ca_system_score_codex":0.0015765782,"about_ca_system_score_gemma":0.0015062232,"threshold_uncertainty_score":0.019526184},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003006033,0.007995999,0.0060601123,0.030624218,0.022340242,0.0004161431,0.0113637615,0.0017122551,0.91648114],"genre_scores_gemma":[0.0141906915,0.004246505,0.0024806615,0.013117043,0.0028715301,0.0002757442,0.007655103,0.0005989102,0.95456386],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997755,0.00030107496,0.00011761448,0.00054925104,0.00091768225,0.00035941685],"domain_scores_gemma":[0.99720395,0.00037885824,0.00014037342,0.0003087192,0.0013754346,0.0005927479],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017990719,0.0009618793,0.0007401663,0.0015306532,0.002798954,0.0063491776,0.0021405616,0.003330972,0.4934808],"category_scores_gemma":[0.008156225,0.00039886238,0.00079005345,0.0015890751,0.0012096502,0.0043142824,0.0039546993,0.0030380115,0.31144866],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00010117447,0.00004031926,0.0006702218,0.00018049205,0.00000668511,0.00016630688,0.0005310149,0.00006901158,0.00022758722,0.036863603,0.8679419,0.09320176],"study_design_scores_gemma":[0.0000032143212,0.000011007438,0.00024200461,0.00007418052,0.0000012220403,0.0000652516,0.00010789745,0.000012870436,0.00004868103,0.002340058,0.99708945,0.0000041210437],"about_ca_topic_score_codex":0.0054517537,"about_ca_topic_score_gemma":0.0059475075,"teacher_disagreement_score":0.4934808,"about_ca_system_score_codex":0.0032259722,"about_ca_system_score_gemma":0.0033174513,"threshold_uncertainty_score":0.72248816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21326257,0.001617905,0.6601012,0.0022161196,0.0004399186,0.00015884035,0.0010960883,0.001021297,0.12008609],"genre_scores_gemma":[0.9079389,0.00052171736,0.070252165,0.0006083246,0.00021514829,0.00011174698,0.000564978,0.00011987511,0.01966707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853873,0.00032848498,0.000102971106,0.0003534916,0.00047938214,0.00019702343],"domain_scores_gemma":[0.99772006,0.00048118885,0.00025387105,0.00048017735,0.0008242399,0.00024044671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012625632,0.00040937774,0.00040134956,0.0017170192,0.0012119169,0.0019719792,0.00084592105,0.00078924827,0.0061509134],"category_scores_gemma":[0.0021672775,0.00027920346,0.00067304645,0.0012114409,0.0032738256,0.003899169,0.0031653682,0.001605258,0.000702938],"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.0000082943,0.00000450599,0.00021828877,0.00001403132,0.0000026810674,0.0000559022,0.00015087664,0.00037247367,0.0006187892,0.9952749,0.0004156098,0.0028636316],"study_design_scores_gemma":[0.000009236787,0.00002783534,0.00046052813,0.000026452097,0.000009758514,0.00054512697,0.00023387514,0.008417434,0.00163732,0.9577791,0.030835114,0.000018113822],"about_ca_topic_score_codex":0.0016259351,"about_ca_topic_score_gemma":0.00083873037,"teacher_disagreement_score":0.0061509134,"about_ca_system_score_codex":0.0012998391,"about_ca_system_score_gemma":0.0007381366,"threshold_uncertainty_score":0.020576835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1861397,0.00049194955,0.7747847,0.0014973631,0.00028906766,0.00021901132,0.0002288151,0.00043007353,0.035919342],"genre_scores_gemma":[0.95159274,0.00018632467,0.043477632,0.00026752622,0.0001550949,0.00022261664,0.00019490936,0.00006310792,0.0038400362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99305433,0.0020590723,0.0005979968,0.0012344194,0.0023176852,0.0007365152],"domain_scores_gemma":[0.9896818,0.0053677363,0.0011679969,0.0010251238,0.001880472,0.00087690214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003917221,0.0005303409,0.0005787776,0.0016665102,0.0010817611,0.0026378552,0.0011302329,0.0013223075,0.0041135163],"category_scores_gemma":[0.014253667,0.00040185513,0.0015561337,0.00078908616,0.0043325284,0.0046012984,0.0033900847,0.0030786593,0.00035939572],"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.000022383989,0.00003422068,0.00028166312,0.000018483908,0.000009012927,0.000078325116,0.0003583705,0.0023993216,0.0005261587,0.99301237,0.00012678382,0.003132851],"study_design_scores_gemma":[0.000018907329,0.000036379028,0.00025731715,0.000017270573,0.000010460108,0.00006149101,0.00010816438,0.02880509,0.00070811267,0.9680882,0.001875344,0.000013343335],"about_ca_topic_score_codex":0.0017807836,"about_ca_topic_score_gemma":0.0007454079,"teacher_disagreement_score":0.0041135163,"about_ca_system_score_codex":0.0022088827,"about_ca_system_score_gemma":0.0010683679,"threshold_uncertainty_score":0.020716488},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006147873,0.004103958,0.0006723546,0.033838257,0.79652023,0.00026365943,0.005506253,0.00081357,0.1576669],"genre_scores_gemma":[0.0039061643,0.0035125338,0.000533182,0.01092824,0.20835744,0.00023868101,0.0053982083,0.0005436273,0.76658195],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990969,0.00008304347,0.00006949455,0.0001107495,0.0004748484,0.00016504098],"domain_scores_gemma":[0.99395907,0.0005088082,0.00024868565,0.0002928501,0.003517583,0.0014729965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021147423,0.0014232477,0.0009705334,0.0027178274,0.001968212,0.0060725557,0.0014278623,0.0041665942,0.3976822],"category_scores_gemma":[0.00563786,0.00031896814,0.00084480614,0.0013931559,0.0006077155,0.0028819195,0.0016016115,0.003282192,0.28393534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000027738157,0.000009452718,0.00003872396,0.00006673491,0.0000013203786,0.00002467344,0.000004507152,0.000022745502,0.000079159094,0.00033124365,0.9921536,0.0072401385],"study_design_scores_gemma":[0.000010712465,0.000018930648,0.0005823612,0.00012441388,0.0000026039213,0.000030172547,0.000023823945,0.000049963306,0.00007163134,0.00050261355,0.99857616,0.0000066206567],"about_ca_topic_score_codex":0.003762719,"about_ca_topic_score_gemma":0.0072670556,"teacher_disagreement_score":0.3976822,"about_ca_system_score_codex":0.0024133676,"about_ca_system_score_gemma":0.0032774876,"threshold_uncertainty_score":0.85913324},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7315141,0.0016685071,0.11992699,0.00094633974,0.00019901649,0.000073153205,0.00051985565,0.0005680248,0.1445841],"genre_scores_gemma":[0.98762894,0.00018250252,0.004604577,0.00012579357,0.000102526086,0.000028730563,0.00018044324,0.00003688409,0.0071095875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990387,0.00016305441,0.00006105998,0.00016625294,0.00040702053,0.00016391222],"domain_scores_gemma":[0.9989262,0.00028565215,0.00011519057,0.00018995427,0.00027875334,0.00020418726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008999479,0.0002416476,0.00038681383,0.00222843,0.001194227,0.0031913118,0.0006124376,0.0004599375,0.0054345],"category_scores_gemma":[0.0015174254,0.00027126865,0.00050840987,0.0009813518,0.0029627401,0.0040926132,0.0035087012,0.0008006911,0.00058923126],"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.000010720676,0.000008242545,0.0007594605,0.000025757572,0.000011351206,0.000109101,0.0008252026,0.00023314044,0.0009135603,0.99226356,0.00039489186,0.0044450676],"study_design_scores_gemma":[0.000011325019,0.00003465211,0.0025498285,0.000028397635,0.000018992823,0.00043961333,0.00071345735,0.0027954476,0.0017897068,0.9704146,0.021185422,0.000018604434],"about_ca_topic_score_codex":0.0007548836,"about_ca_topic_score_gemma":0.00044232493,"teacher_disagreement_score":0.0054345,"about_ca_system_score_codex":0.0012314944,"about_ca_system_score_gemma":0.00033859152,"threshold_uncertainty_score":0.018180251},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7473301,0.0008587196,0.2022352,0.0009330358,0.00021783425,0.000053965552,0.00031342387,0.00030145157,0.047756206],"genre_scores_gemma":[0.9796934,0.00022560346,0.013332687,0.00008332711,0.000086122694,0.000026020607,0.00016344337,0.00006902726,0.00632053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988839,0.00025051893,0.000085862484,0.00021390982,0.00038791623,0.00017787525],"domain_scores_gemma":[0.9981072,0.0006480508,0.0002882076,0.0002627671,0.00042961282,0.00026414322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016521103,0.0005224449,0.00042431412,0.0018884481,0.0010201931,0.002753449,0.0006671743,0.00062532345,0.005888056],"category_scores_gemma":[0.003091831,0.00026026808,0.0005814739,0.0008748457,0.003424886,0.006670868,0.0040589287,0.0014740966,0.00052040716],"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.000023857969,0.000010599719,0.0004969737,0.000030581872,0.0000065347394,0.000162187,0.00036827495,0.0005677231,0.001557789,0.99279565,0.00019977785,0.0037800611],"study_design_scores_gemma":[0.000016858898,0.00005911219,0.0009845119,0.00003087591,0.000012674434,0.0005371973,0.0006228736,0.0059919143,0.003949705,0.97365713,0.01411402,0.000023299828],"about_ca_topic_score_codex":0.0003188657,"about_ca_topic_score_gemma":0.00027402927,"teacher_disagreement_score":0.005888056,"about_ca_system_score_codex":0.0009750039,"about_ca_system_score_gemma":0.000331441,"threshold_uncertainty_score":0.019697487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15987924,0.00026664382,0.8353563,0.00038752222,0.0000667441,0.00004832283,0.00013985581,0.0004967942,0.003358595],"genre_scores_gemma":[0.79984564,0.000120040684,0.19675289,0.00009950479,0.000037650952,0.00012368121,0.00023101426,0.00015542554,0.0026341076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867094,0.0004949124,0.00008503492,0.0003003698,0.00030594197,0.0001428256],"domain_scores_gemma":[0.99465936,0.003862902,0.00023674383,0.00061659334,0.00047813993,0.00014622175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012601076,0.00061187975,0.0011167912,0.00052290596,0.00047300002,0.0012367659,0.001414484,0.001067466,0.0024637734],"category_scores_gemma":[0.0094511835,0.0003289839,0.0006690922,0.00061493035,0.0010933658,0.0023238477,0.0010707363,0.0011028197,0.0003444338],"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.00030754445,0.000087140754,0.00081581564,0.0002597226,0.000053217904,0.000115701856,0.00020604441,0.7887083,0.009159695,0.14235967,0.0014119307,0.056515127],"study_design_scores_gemma":[0.0000051481325,0.000021375832,0.000039326864,0.0000073511605,0.000004127609,0.000013073216,0.000018551944,0.949066,0.0015178422,0.04908651,0.00021663899,0.0000040835066],"about_ca_topic_score_codex":0.0010754613,"about_ca_topic_score_gemma":0.0012731762,"teacher_disagreement_score":0.0024637734,"about_ca_system_score_codex":0.0011331048,"about_ca_system_score_gemma":0.0007739814,"threshold_uncertainty_score":0.00824219},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44475415,0.0026087218,0.44990784,0.0018028924,0.00033190273,0.00009670644,0.00029259743,0.00037365043,0.09983145],"genre_scores_gemma":[0.95591587,0.0006349618,0.0359564,0.0002341988,0.00016166075,0.000056760386,0.00012019085,0.00007488713,0.0068450305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982886,0.0005208884,0.000095484815,0.00032076193,0.00049998885,0.0002744012],"domain_scores_gemma":[0.99893075,0.00035800296,0.00010672084,0.00020447368,0.00023160825,0.0001684144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013965726,0.00034222333,0.00048159622,0.0019286778,0.0015568199,0.0031964702,0.0006737811,0.00081712304,0.0028226464],"category_scores_gemma":[0.0020895735,0.00034756146,0.0006458607,0.0011381421,0.0059063155,0.0061765537,0.004158046,0.0019438687,0.00035408343],"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.000004624726,0.0000036349118,0.00010378069,0.000009736827,0.000003160175,0.00005849757,0.0003285589,0.00029766676,0.000513821,0.9969639,0.00012882391,0.0015837105],"study_design_scores_gemma":[0.0000067933797,0.000022251448,0.00071690767,0.00002009812,0.000008992327,0.00019840333,0.00019483734,0.0030592524,0.0009830974,0.98524874,0.009522607,0.000018077608],"about_ca_topic_score_codex":0.001929596,"about_ca_topic_score_gemma":0.0012003644,"teacher_disagreement_score":0.0031964702,"about_ca_system_score_codex":0.001489299,"about_ca_system_score_gemma":0.0007250279,"threshold_uncertainty_score":0.010805666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6367944,0.0015827814,0.2604177,0.0013893587,0.00027168138,0.00007280343,0.00022811396,0.00023200939,0.09901112],"genre_scores_gemma":[0.9796286,0.00032950213,0.012643497,0.00010962898,0.00008486269,0.00006465211,0.00012949409,0.000039304734,0.006970466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984053,0.00046352702,0.00011307932,0.00023317519,0.00059945905,0.00018545741],"domain_scores_gemma":[0.997184,0.00089552207,0.0002629144,0.00031211053,0.0009230207,0.00042238904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022446455,0.00038682565,0.0004869187,0.0028783372,0.0016151789,0.003545226,0.0010103533,0.00089601637,0.0044775424],"category_scores_gemma":[0.0051617236,0.00029516107,0.00064304087,0.00091838563,0.005315151,0.007108474,0.0048015383,0.0015224157,0.00039782058],"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.0000060920793,0.000004661489,0.00033091783,0.000014126115,0.0000034514387,0.000059962487,0.00023893242,0.000372999,0.00033244785,0.9972543,0.00008895972,0.0012932157],"study_design_scores_gemma":[0.000005048257,0.000026022371,0.0005276455,0.000018975223,0.000005981465,0.00022901905,0.00037114092,0.0060067405,0.0012640483,0.985401,0.006132659,0.000011739262],"about_ca_topic_score_codex":0.0005792503,"about_ca_topic_score_gemma":0.0004965175,"teacher_disagreement_score":0.0044775424,"about_ca_system_score_codex":0.0014864737,"about_ca_system_score_gemma":0.00045435966,"threshold_uncertainty_score":0.014978826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50300056,0.0020348453,0.36927238,0.0017650059,0.0006126456,0.00008650401,0.00030061422,0.0011505048,0.121776946],"genre_scores_gemma":[0.9655226,0.00045997748,0.018180188,0.0002250493,0.00022629627,0.00004870482,0.00014835027,0.00017526238,0.015013636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990784,0.00021131634,0.00006914092,0.00020824603,0.00028668722,0.00014620057],"domain_scores_gemma":[0.99903345,0.00021397042,0.00011921326,0.00014560379,0.00026135624,0.00022640941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008421996,0.0005318193,0.00042822357,0.0019367518,0.0015833706,0.002639931,0.0008842023,0.0006302906,0.0059001795],"category_scores_gemma":[0.0015565843,0.00037183662,0.00083200453,0.0008972064,0.0038521253,0.0052120895,0.004832087,0.001989307,0.00055067014],"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.0000109988605,0.000011027124,0.00021969357,0.000021055563,0.000003877509,0.00012704694,0.000499435,0.00030546522,0.00088055024,0.99427927,0.00020381893,0.0034377985],"study_design_scores_gemma":[0.000009462451,0.000054298063,0.00084609684,0.000022192264,0.000012052453,0.00039013525,0.00041540418,0.0045431745,0.0022392785,0.97750616,0.01393722,0.000024515168],"about_ca_topic_score_codex":0.0011013655,"about_ca_topic_score_gemma":0.0009865331,"teacher_disagreement_score":0.0059001795,"about_ca_system_score_codex":0.0015254805,"about_ca_system_score_gemma":0.0004871543,"threshold_uncertainty_score":0.019738078},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08403311,0.0011011207,0.83586246,0.0016230338,0.00056049024,0.00006379302,0.0004739512,0.0007247454,0.07555728],"genre_scores_gemma":[0.88623655,0.00055157364,0.09231022,0.0004813522,0.0002264379,0.00010351493,0.00033362425,0.00020986809,0.01954697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984829,0.00046453756,0.00011219222,0.00022149328,0.00056195323,0.00015693769],"domain_scores_gemma":[0.9981103,0.00052397273,0.00012908549,0.0004534619,0.0005736457,0.00020954623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018185283,0.00037515166,0.00042013763,0.0017966349,0.0013198396,0.0035180869,0.0012805632,0.0010104963,0.006272235],"category_scores_gemma":[0.002571866,0.00030450238,0.0008728922,0.0013519311,0.005796151,0.007948267,0.003268549,0.0019808845,0.000788781],"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.0000044286276,0.0000023372997,0.00007383813,0.000010189549,0.0000024552621,0.000030221634,0.00013655615,0.000368958,0.0002775035,0.9974897,0.00018236009,0.0014213716],"study_design_scores_gemma":[0.0000061113265,0.000010028392,0.000082492916,0.00002182845,0.0000055744276,0.000099916535,0.00014565677,0.004824544,0.0007767565,0.9837284,0.010286869,0.000011703064],"about_ca_topic_score_codex":0.0015997756,"about_ca_topic_score_gemma":0.00126477,"teacher_disagreement_score":0.006272235,"about_ca_system_score_codex":0.002151509,"about_ca_system_score_gemma":0.00092200754,"threshold_uncertainty_score":0.020982683},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015276074,0.006291323,0.00072622334,0.044459157,0.93162763,0.00003944168,0.00024101927,0.00015141245,0.016311131],"genre_scores_gemma":[0.0019380363,0.0051976526,0.00043407886,0.017307024,0.8922471,0.00007915219,0.0004929469,0.00037049345,0.08193347],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998154,0.00028563666,0.00019351506,0.00031918264,0.0008465814,0.00020108244],"domain_scores_gemma":[0.9905351,0.0019382202,0.00066993834,0.00033731174,0.0043276753,0.002191731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022122336,0.001859654,0.0020492421,0.002865631,0.0020998109,0.006116598,0.0014603204,0.004383256,0.11379339],"category_scores_gemma":[0.0076989,0.00044840938,0.00125161,0.0011080855,0.0010965122,0.0042614467,0.0017684276,0.00641293,0.07387475],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018577977,0.000006871414,0.000022623168,0.000086722306,0.000004775494,0.00002217187,0.000007658411,0.000013333078,0.00011557148,0.0010623677,0.9930577,0.005581476],"study_design_scores_gemma":[0.000012347311,0.000025752151,0.00026878793,0.00014708826,0.000011085647,0.00008070116,0.000017192562,0.00008321574,0.0001427277,0.002193117,0.9970094,0.000008416634],"about_ca_topic_score_codex":0.00046312486,"about_ca_topic_score_gemma":0.0007514689,"teacher_disagreement_score":0.11379339,"about_ca_system_score_codex":0.0017700107,"about_ca_system_score_gemma":0.001562417,"threshold_uncertainty_score":0.3806768},"labels":[],"label_agreement":null}]}