{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":72,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":72,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d87e99d333c6","filters":{"venue":"Mathematical Structures in Computer Science"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01011974981243016,"gpt":0.2693401354551416,"spread":0.2592203856427114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585157,0.0002531075,0.0002842305,0.0003101926,0.0002616221,0.0006750267,0.002736531,0.00005431841,0.000007754978],"category_scores_gemma":[0.0001132343,0.000190009,0.00008162642,0.001618789,0.0004591251,0.000418645,0.001204558,0.0003351048,0.00002257941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248945,"about_ca_system_score_gemma":0.000235742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003623028,"about_ca_topic_score_gemma":0.000003846274,"domain_scores_codex":[0.9971696,0.00003862193,0.0003859259,0.0007930006,0.000832325,0.0007804855],"domain_scores_gemma":[0.9987138,0.00008331693,0.00008921819,0.0008310096,0.00006198081,0.0002207075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001337013,0.00007414447,0.00002748369,0.00003139837,0.000002489545,0.0001296098,0.003769723,0.01571942,0.0002452208,0.4870425,0.000004559976,0.4929521],"study_design_scores_gemma":[0.0002839727,0.00006071707,0.001512459,0.00006871323,0.000001098619,0.0002217024,0.00001482699,0.5976896,0.0009587368,0.3989277,0.00004292683,0.0002175656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1883365,0.0000598447,0.8098143,0.0007526194,0.0004344117,0.0001850459,5.241505e-7,0.0002644022,0.0001523829],"genre_scores_gemma":[0.5279873,4.155686e-7,0.4717069,0.0002099261,0.00008304321,0.000005049809,2.08366e-7,0.000006057556,0.000001108211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5819702,"threshold_uncertainty_score":0.7748342,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01117563736552843,"gpt":0.2579324113655679,"spread":0.2467567740000395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001059872,0.0003567616,0.0005211517,0.000293173,0.0003141656,0.0007333518,0.002035236,0.00008890084,0.000006748944],"category_scores_gemma":[0.0001150171,0.0002595662,0.0001089075,0.001349498,0.0009177262,0.0006327474,0.0005085998,0.0002461148,0.000009828777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002372983,"about_ca_system_score_gemma":0.0002389143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000308766,"about_ca_topic_score_gemma":0.00002733923,"domain_scores_codex":[0.9960965,0.0001043422,0.0006579804,0.001192771,0.001054453,0.0008939415],"domain_scores_gemma":[0.9975693,0.000992396,0.0001763901,0.0007592079,0.0003030552,0.0001996106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002936653,0.0002741551,0.0005778962,0.00007640645,0.000007058761,0.00004859712,0.0002145181,0.05172312,0.0001729576,0.8888628,0.0002111913,0.05780194],"study_design_scores_gemma":[0.0008254644,0.0001650768,0.006973413,0.00002158086,0.00000410035,0.00008840351,0.000002614307,0.6177821,0.0001299806,0.3737321,0.00004520389,0.0002300033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03283866,0.00002535743,0.964104,0.001219847,0.0004777964,0.000880972,0.000005151716,0.0002628518,0.000185382],"genre_scores_gemma":[0.5778522,9.228505e-8,0.4217599,0.0001957444,0.0001390921,0.00003801921,0.000001331416,0.00000955214,0.000004050119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.566059,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008472072875403596,"gpt":0.2417301204499637,"spread":0.2332580475745601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564479,0.0002325582,0.0002548903,0.0003428911,0.0003594708,0.0006273778,0.002342669,0.00005177801,0.00002989751],"category_scores_gemma":[0.00004879414,0.0001835995,0.00007559157,0.001381604,0.0005191836,0.0004775984,0.0007637249,0.0002783801,0.00004324911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007027997,"about_ca_system_score_gemma":0.0001144274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616113,"about_ca_topic_score_gemma":0.000007292326,"domain_scores_codex":[0.997414,0.00005327015,0.0004468643,0.0007628089,0.0006526274,0.0006704167],"domain_scores_gemma":[0.9986381,0.0002374304,0.00009965865,0.0008142461,0.00007337819,0.0001371933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.816399e-7,0.00009491271,0.0003546667,0.00002035518,0.000001676698,0.00004023211,0.0002259804,0.02609733,0.0003028256,0.9295174,0.0002706609,0.04307321],"study_design_scores_gemma":[0.0001039559,0.00002060377,0.01306342,0.00002241347,7.656649e-7,0.0001117384,0.000001179737,0.553871,0.0002703065,0.4322934,0.000096713,0.000144445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.15005,0.00003277186,0.8474394,0.000610742,0.0005883095,0.0001499059,0.000002033747,0.0002329079,0.0008938878],"genre_scores_gemma":[0.6701168,3.23199e-7,0.3295244,0.0001605428,0.0001734636,0.000006337226,8.93753e-7,0.000006577437,0.00001066336],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5277737,"threshold_uncertainty_score":0.748697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Axiom; Algebra over a field; Mathematics; Linear logic; Pure mathematics; Geometry; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03332210247724639,"gpt":0.3107493739238779,"spread":0.2774272714466315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954051,0.0001306149,0.0003012913,0.0002462218,0.00008116043,0.00002132732,0.000404222,0.00008428887,0.0004266299],"category_scores_gemma":[0.0003727121,0.0001061676,0.00003471172,0.0004022455,0.00126488,0.0001485966,0.00027538,0.0002271024,0.00001000767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003213071,"about_ca_system_score_gemma":0.00001295173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002673657,"about_ca_topic_score_gemma":0.000001548586,"domain_scores_codex":[0.9987046,0.00006420451,0.000389933,0.0003035504,0.0002683276,0.0002693631],"domain_scores_gemma":[0.9987896,0.000641885,0.0001161261,0.0003247764,0.00004795165,0.0000796273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004338281,0.000137587,0.001334346,0.0001143693,0.000007306033,0.00001720122,0.001086479,0.00001000175,0.0001947339,0.9691288,0.00008838977,0.02787647],"study_design_scores_gemma":[0.0002642855,0.00007997031,0.00243321,0.00004042136,0.000006573202,0.0002142432,0.00003647965,0.04566571,0.001789706,0.9493285,0.00002503585,0.000115874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9143887,0.00006124549,0.08400822,0.000177847,0.0003029486,0.0001305823,8.81714e-7,0.00003514437,0.0008944359],"genre_scores_gemma":[0.9342698,0.000004571628,0.06554847,0.0001120084,0.00003431797,0.000004021428,1.253286e-7,0.000006661042,0.0000199668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04565571,"threshold_uncertainty_score":0.4671298,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01394231334674149,"gpt":0.246129583237573,"spread":0.2321872698908315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003306541,0.0001875348,0.0002418928,0.0001837726,0.0002115731,0.0007867247,0.001988233,0.00005221026,0.00003545102],"category_scores_gemma":[0.00002983323,0.0001334466,0.0000565977,0.0008201235,0.0004954627,0.0004804645,0.0006913927,0.0001409176,0.00004093339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006719192,"about_ca_system_score_gemma":0.00007365171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007085268,"about_ca_topic_score_gemma":0.00001439033,"domain_scores_codex":[0.9977869,0.00004178837,0.0003707026,0.0005813568,0.0006666828,0.0005525776],"domain_scores_gemma":[0.9990125,0.00009343812,0.00008570273,0.0006390795,0.00007003921,0.00009928723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.230418e-7,0.00004075094,0.0007245645,0.00001915601,0.000001070794,0.00001951442,0.0002193299,0.0001377219,0.0001602147,0.9756806,0.00008724578,0.02290914],"study_design_scores_gemma":[0.0001522406,0.00002596122,0.007397497,0.000003186737,0.000001203216,0.00006420397,0.000003212511,0.1489859,0.001242107,0.8416963,0.0002543671,0.0001738387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02122209,0.00003480603,0.9748831,0.0001378436,0.0009541616,0.0001682635,1.885491e-7,0.0001734854,0.002426039],"genre_scores_gemma":[0.9270056,3.421081e-7,0.07265099,0.00006233608,0.0002245582,0.00000951255,6.164004e-7,0.000005328574,0.00004069913],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057835,"threshold_uncertainty_score":0.7586404,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02889547040022715,"gpt":0.2744766433418571,"spread":0.24558117294163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460478,0.0001647187,0.0002250214,0.0002557794,0.0001119853,0.0003164531,0.001695551,0.00006408716,0.0000226038],"category_scores_gemma":[0.00005315551,0.000122683,0.00003831436,0.001096318,0.0002312009,0.0005775519,0.0005305833,0.0002067903,0.00004680582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271977,"about_ca_system_score_gemma":0.00008309323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281896,"about_ca_topic_score_gemma":0.000005629245,"domain_scores_codex":[0.9979038,0.00009612074,0.0003838678,0.0005802068,0.0005178938,0.0005181428],"domain_scores_gemma":[0.9990414,0.0001319783,0.000072284,0.0005760968,0.00006312381,0.0001150549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002865037,0.00003468216,0.0001167898,0.00001301824,7.673937e-7,0.00001084048,0.0009842973,0.0583535,0.00003219308,0.8309892,0.00001583971,0.109446],"study_design_scores_gemma":[0.00009248887,0.00001934596,0.0001269013,0.000006906571,3.671157e-7,0.00002436265,0.000003224334,0.5470634,0.0001561862,0.4522064,0.0002060476,0.00009435514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04986013,0.0001404532,0.947799,0.0001625805,0.0005567954,0.0001756425,8.029436e-8,0.00008308509,0.001222246],"genre_scores_gemma":[0.7016475,0.000003125104,0.2980271,0.0001528259,0.0001333611,0.000003712477,1.849122e-7,0.000004496054,0.00002761866],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6517874,"threshold_uncertainty_score":0.5002868,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01365252177737777,"gpt":0.2680591647508541,"spread":0.2544066429734764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002114247,0.0002179408,0.000270573,0.0003369357,0.0002232657,0.0005324039,0.004523253,0.0000537961,0.0000439399],"category_scores_gemma":[0.0001777238,0.0001649822,0.00006142207,0.001434954,0.0007367734,0.0008513307,0.001164917,0.000220477,0.0000294725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015426,"about_ca_system_score_gemma":0.00008224811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001180553,"about_ca_topic_score_gemma":0.00000560538,"domain_scores_codex":[0.9972956,0.00003489161,0.0004496041,0.0006263118,0.0008204667,0.0007731222],"domain_scores_gemma":[0.9977895,0.0004563608,0.00009364911,0.00135966,0.00007110162,0.0002297524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002584756,0.00004057209,0.0004318394,0.00001523683,0.00000192094,0.00005260887,0.0007048489,0.0001521111,0.0004202761,0.9341575,0.0002023687,0.06381815],"study_design_scores_gemma":[0.0002043053,0.0000288872,0.01870657,0.00002226759,0.000001002286,0.000116917,0.00001481369,0.175779,0.004108579,0.8006948,0.0001173946,0.0002054511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06610508,0.00005035279,0.9298465,0.0004921433,0.0006414775,0.0001322192,0.000001187301,0.0002334246,0.00249761],"genre_scores_gemma":[0.7569553,7.008875e-7,0.2424859,0.0004470846,0.0000948409,9.814136e-7,2.546793e-7,0.000006169664,0.000008772951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6908503,"threshold_uncertainty_score":0.8405403,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02796409341007408,"gpt":0.2875864796936224,"spread":0.2596223862835483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000380586,0.000109294,0.0001946031,0.00003168409,0.00006291203,0.00002530228,0.0004306645,0.00004016814,0.0001014657],"category_scores_gemma":[0.0002654602,0.00009135478,0.00001681571,0.0001762587,0.001374081,0.0001100311,0.0003066121,0.0001462973,0.000001359284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008869325,"about_ca_system_score_gemma":0.00006703685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002806521,"about_ca_topic_score_gemma":6.616409e-7,"domain_scores_codex":[0.9988959,0.00001593051,0.0002709288,0.0002980525,0.0003282599,0.0001908798],"domain_scores_gemma":[0.9992083,0.0001617621,0.00007571115,0.0003548431,0.00006043477,0.0001389785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000636755,0.00179296,0.05292305,0.005455021,0.00009213179,0.000204233,0.07047777,0.009312706,0.2532886,0.1679038,0.001699222,0.4362137],"study_design_scores_gemma":[0.001694832,0.00004877584,0.0006976668,0.0002240847,0.0000110579,0.00008355738,0.0007399912,0.127762,0.2828498,0.5834516,0.001937279,0.0004992789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9490454,0.00008904155,0.04277866,0.00005361848,0.00005718457,0.0000499917,0.00000543849,0.0000288382,0.007891799],"genre_scores_gemma":[0.9565287,5.179359e-7,0.04335865,0.00004640314,0.00002206917,0.000002460039,9.699003e-7,0.000004257953,0.00003602923],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4357145,"threshold_uncertainty_score":0.5062857,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01519423353517707,"gpt":0.2622797731231014,"spread":0.2470855395879243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139423,0.0001677621,0.000219348,0.0002021437,0.0001938505,0.0004622777,0.001848283,0.00004497057,0.0001976584],"category_scores_gemma":[0.00007378209,0.0001237627,0.00004100977,0.001548796,0.0002875601,0.0005313928,0.0003698082,0.0001414785,0.0003997748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006898001,"about_ca_system_score_gemma":0.00006051096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402643,"about_ca_topic_score_gemma":0.00000293773,"domain_scores_codex":[0.9978102,0.00004578265,0.0003404145,0.0007232924,0.0005845826,0.0004956608],"domain_scores_gemma":[0.9988096,0.00005982952,0.00004332808,0.0008193469,0.00007473354,0.0001931911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002504316,0.00003301945,0.00007691668,0.00001492721,0.000001500813,0.000009075674,0.0009433782,0.001417855,0.00008637863,0.7113811,0.0004034021,0.2856299],"study_design_scores_gemma":[0.0001596232,0.0001145849,0.001853352,0.000005158812,0.000001638485,0.0001383145,0.000008299844,0.2361659,0.001442814,0.7436442,0.01616763,0.0002984067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01358727,0.00002043732,0.981977,0.001895039,0.0007669618,0.0002445001,1.474632e-7,0.00018593,0.001322755],"genre_scores_gemma":[0.7609202,0.000001136962,0.2379096,0.0003395201,0.0006839845,0.00001316142,3.35952e-7,0.000005439381,0.0001266259],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7473329,"threshold_uncertainty_score":0.513843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03226011253922527,"gpt":0.3198217263919793,"spread":0.287561613852754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542305,0.0001903991,0.000331644,0.0002012385,0.0002761605,0.00008231377,0.0004048401,0.0001372051,0.00004460792],"category_scores_gemma":[0.0006756138,0.0001537697,0.00003395468,0.0005275914,0.001599998,0.0001878429,0.0002593275,0.0002882147,0.000005676958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006612999,"about_ca_system_score_gemma":0.00006832475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001461581,"about_ca_topic_score_gemma":0.00004252161,"domain_scores_codex":[0.9980117,0.00006934997,0.0004656022,0.0004854558,0.0003799529,0.0005879092],"domain_scores_gemma":[0.9981977,0.001054157,0.0001112426,0.0003839268,0.00008468987,0.0001682613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002597216,0.00006274217,0.001377699,0.00003650741,0.000004786228,0.00007798052,0.0009260008,0.000007070836,0.0003532268,0.9768874,0.00008212672,0.0201585],"study_design_scores_gemma":[0.0003158245,0.0000762231,0.02305741,0.00001872566,0.000009890902,0.0003350281,0.00005547827,0.004524314,0.003739677,0.9676369,0.00005291589,0.0001776087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6509486,0.00002857355,0.3475349,0.0002225452,0.0004429978,0.0001803655,6.729234e-7,0.00006597789,0.000575342],"genre_scores_gemma":[0.9393755,0.000006156741,0.06020878,0.0002189607,0.0001604888,0.000006375948,3.599681e-7,0.00000863541,0.00001480034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2884268,"threshold_uncertainty_score":0.6270546,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0460157913763329,"gpt":0.3060719185987094,"spread":0.2600561272223765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757784,0.0001637787,0.0002189801,0.0002426536,0.0003291373,0.0006402568,0.002757514,0.00004615717,0.000019263],"category_scores_gemma":[0.0003346682,0.0001396201,0.00004932423,0.001255673,0.0003947848,0.000662913,0.0008656189,0.0002280917,0.0000453668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000714999,"about_ca_system_score_gemma":0.00006587472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005726842,"about_ca_topic_score_gemma":0.000001992988,"domain_scores_codex":[0.9976758,0.00009697289,0.0003918337,0.00069072,0.000649655,0.0004950088],"domain_scores_gemma":[0.9983058,0.0004299772,0.0001014579,0.000919621,0.00008781463,0.0001553371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.377597e-7,0.00002495832,0.0006473273,0.00002077529,7.879929e-7,0.000002318038,0.0006111838,0.001058294,0.0001729647,0.9004303,0.00002394297,0.09700651],"study_design_scores_gemma":[0.0001076325,0.00001486555,0.006516864,0.00002438925,5.037992e-7,0.00003622162,0.000003057551,0.6918923,0.0009102458,0.3001873,0.0001702024,0.0001363737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05634893,0.00001332277,0.9410437,0.0004158521,0.0006664817,0.0001042213,1.713275e-7,0.0001860082,0.001221286],"genre_scores_gemma":[0.615448,4.024462e-7,0.3841208,0.0003433494,0.00008007384,0.000002679253,1.158784e-7,0.000003210796,0.000001350017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.690834,"threshold_uncertainty_score":0.6174011,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02808843201013672,"gpt":0.2447546041980893,"spread":0.2166661721879526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002103639,0.0001056645,0.0001273632,0.0001498848,0.0002063665,0.00008389351,0.0005242144,0.00002329408,0.00002483352],"category_scores_gemma":[0.00002750277,0.00008483587,0.00001888695,0.000548306,0.000460736,0.001210131,0.0002969017,0.00008546608,0.000005249324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000208686,"about_ca_system_score_gemma":0.00006402089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001706781,"about_ca_topic_score_gemma":0.00001436562,"domain_scores_codex":[0.9989271,0.00002570318,0.0002041254,0.0003689306,0.0002335262,0.0002406834],"domain_scores_gemma":[0.9993178,0.00007936509,0.00004091518,0.0004186566,0.00003978945,0.0001034293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[8.23298e-7,0.00001284398,0.000167433,0.00000978857,9.623704e-7,0.000009066606,0.002059022,0.000049092,0.0001034154,0.9735979,0.000009353063,0.02398033],"study_design_scores_gemma":[0.0002815213,0.00006777394,0.01741626,0.00005203704,0.000002886432,0.0001744044,0.00005649739,0.363792,0.001311925,0.6159489,0.0005942247,0.0003016357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01210533,0.00003263487,0.986205,0.0001177937,0.0001509209,0.0001154007,0.000003506597,0.00007354282,0.001195905],"genre_scores_gemma":[0.4219101,0.00000159112,0.5780135,0.00005070317,0.00001430152,0.000002486117,3.27438e-7,0.000002128067,0.000004884328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4098048,"threshold_uncertainty_score":0.3459506,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04341360992882001,"gpt":0.3606467508382066,"spread":0.3172331409093866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002818503,0.0001726359,0.0003257684,0.0001690681,0.0002415315,0.00005159907,0.0008322948,0.0001226188,0.0001120592],"category_scores_gemma":[0.001074317,0.0001318084,0.00007472764,0.0003228115,0.001420573,0.0002029472,0.0003577585,0.0001867017,0.000006002623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008002734,"about_ca_system_score_gemma":0.00006723665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005784039,"about_ca_topic_score_gemma":0.00003611713,"domain_scores_codex":[0.9979211,0.00003625324,0.0005176247,0.0004047721,0.0003051933,0.0008150288],"domain_scores_gemma":[0.9975901,0.00167619,0.0001065194,0.0004414725,0.00007879385,0.0001069558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002287614,0.0000522569,0.0005691551,0.00005799565,0.000003779329,0.00001351095,0.000545876,0.000007647557,0.00008575983,0.9544993,0.00007206845,0.04406979],"study_design_scores_gemma":[0.0003231135,0.00008969474,0.004638582,0.0000124736,0.00000546773,0.0001013485,0.00004602956,0.005554877,0.003612678,0.9853748,0.00008215398,0.000158785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3101868,0.000008196211,0.6877006,0.0002410866,0.0004867082,0.0002908822,0.000001879372,0.00007068269,0.001013221],"genre_scores_gemma":[0.6673292,2.930303e-7,0.3322986,0.0002175092,0.0001222408,0.00001252354,4.227858e-7,0.000006093219,0.0000130875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3571424,"threshold_uncertainty_score":0.5374991,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01463487879761715,"gpt":0.277650234266991,"spread":0.2630153554693739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864559,0.0001337543,0.0002256583,0.000207423,0.0001145738,0.0002086123,0.0008060696,0.00005503149,0.00004326287],"category_scores_gemma":[0.00002475965,0.0001035116,0.00003069404,0.0007292216,0.0004371096,0.0005405493,0.0002533079,0.0001434549,0.000008249471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006076145,"about_ca_system_score_gemma":0.000046734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003045403,"about_ca_topic_score_gemma":0.000003274863,"domain_scores_codex":[0.9985657,0.00006916496,0.0003424542,0.0004029242,0.0003514402,0.0002683048],"domain_scores_gemma":[0.9992198,0.0001335108,0.00009539439,0.0003885,0.0000680556,0.00009477657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002963173,0.00005194947,0.0004137563,0.00005300468,0.000002252734,0.000008627057,0.0005561053,0.000176999,0.0001420061,0.8728333,0.00001284559,0.1257463],"study_design_scores_gemma":[0.0001909285,0.0001041157,0.005483217,0.00001495655,0.000001963094,0.0001659047,0.00001361907,0.1281566,0.001469646,0.8641278,0.0001282157,0.000142989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1459998,0.00007925794,0.8519281,0.0001013444,0.0002969193,0.00017188,2.257425e-7,0.0000650572,0.001357467],"genre_scores_gemma":[0.9466838,0.000005962435,0.05316405,0.0001011764,0.00002455916,0.000005212062,5.719419e-7,0.000003518732,0.00001114688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.800684,"threshold_uncertainty_score":0.422108,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03768632492651351,"gpt":0.282842901819051,"spread":0.2451565768925374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117329,0.0001693014,0.0002566632,0.0001660312,0.0002289567,0.0005523397,0.001496526,0.00006079182,0.000007986989],"category_scores_gemma":[0.00008225699,0.000120747,0.00004502743,0.0006324744,0.0002479984,0.0005799601,0.000511122,0.0001597443,0.00002083237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006563726,"about_ca_system_score_gemma":0.0000706818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002592461,"about_ca_topic_score_gemma":0.000001253222,"domain_scores_codex":[0.9979415,0.00007805678,0.0003409664,0.0005549674,0.0005906873,0.0004938521],"domain_scores_gemma":[0.9988695,0.000185636,0.0001111303,0.0005929149,0.00008820571,0.0001525691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001070976,0.0000256927,0.0001315259,0.00002572039,0.000001523344,0.000007083026,0.0004327905,0.08445995,0.0002074184,0.8671302,0.000005551361,0.0475715],"study_design_scores_gemma":[0.00009108208,0.0000166592,0.00007034333,0.00001126222,0.000001074301,0.00003729416,0.000001749939,0.6102229,0.0003110986,0.3890267,0.0001060956,0.0001036781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02528843,0.00003835816,0.9727256,0.00005845286,0.0006920656,0.0001525064,7.092759e-8,0.0001137353,0.0009307662],"genre_scores_gemma":[0.6796818,4.479602e-7,0.320099,0.0001056366,0.0001023194,0.000001891078,1.108494e-7,0.000004527289,0.000004271002],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6543933,"threshold_uncertainty_score":0.5326224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03026064021300274,"gpt":0.3297678971753615,"spread":0.2995072569623587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005059234,0.0002335037,0.000322385,0.00016913,0.0002775475,0.00021235,0.0007049628,0.00006887301,0.00009122223],"category_scores_gemma":[0.0007400271,0.0001721856,0.0000317666,0.0005819719,0.003376306,0.0003388973,0.0006631305,0.0002427338,0.00001449248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009512851,"about_ca_system_score_gemma":0.00007304268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000101926,"about_ca_topic_score_gemma":0.00003146211,"domain_scores_codex":[0.9980303,0.00003614835,0.0003975147,0.0005195399,0.0004997846,0.0005166855],"domain_scores_gemma":[0.9986634,0.0004203226,0.00009047559,0.0005313923,0.0001441344,0.0001502437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005047115,0.00002097827,0.0002643276,0.00005069792,0.000002926854,0.00001085288,0.00204033,0.000001790725,0.00008581908,0.9823746,0.00007507081,0.01506756],"study_design_scores_gemma":[0.000184367,0.0000591211,0.0009700133,0.00003300279,0.000005056786,0.0001124157,0.0000780027,0.0135168,0.003203218,0.9815181,0.0001104009,0.0002094387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3594249,0.00003293836,0.6381646,0.0002108998,0.0005022318,0.0001827622,0.000001441226,0.0000983264,0.001381884],"genre_scores_gemma":[0.6820791,0.000001274791,0.3175521,0.0001138443,0.0002033684,0.000007022522,2.426432e-7,0.00001191302,0.00003109062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3226542,"threshold_uncertainty_score":0.9993359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01163668540942525,"gpt":0.2573887304346815,"spread":0.2457520450252563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873715,0.000147008,0.0001789024,0.0001707585,0.0002018926,0.0003554201,0.0009440103,0.00004275547,0.000004468878],"category_scores_gemma":[0.0000837549,0.0001090738,0.00002409892,0.0008214996,0.0004164723,0.0007504378,0.0003244721,0.0001815751,0.000006157268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005054836,"about_ca_system_score_gemma":0.00004637275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001072957,"about_ca_topic_score_gemma":7.741334e-7,"domain_scores_codex":[0.9983953,0.00002974213,0.0002419525,0.0005359246,0.0004119206,0.0003851934],"domain_scores_gemma":[0.9992221,0.0001136233,0.00005226279,0.0004233329,0.00003890907,0.0001497856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001294526,0.00002019427,0.0001038406,0.000004112439,3.78565e-7,0.00001605399,0.0002197169,0.0001817023,0.0002491759,0.8519017,0.00002738917,0.1472744],"study_design_scores_gemma":[0.0001041062,0.00007168351,0.02498111,0.000009640865,7.353234e-7,0.00008752033,0.000004193686,0.194349,0.0003018053,0.7799152,0.00005635231,0.0001187567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05416786,0.00005160974,0.9433947,0.001334727,0.0002132603,0.00009976485,1.843172e-7,0.0001198899,0.0006179782],"genre_scores_gemma":[0.7389827,0.000004911451,0.2605008,0.0004464608,0.00005640782,0.000001597175,1.333704e-7,0.000001919469,0.000005084697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6848149,"threshold_uncertainty_score":0.4447899,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01304934107978247,"gpt":0.2612357940108767,"spread":0.2481864529310942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236833,0.0002633987,0.0003171481,0.0002490024,0.0001951979,0.000425572,0.001781299,0.00006050865,0.00003091499],"category_scores_gemma":[0.000458381,0.0001523021,0.00005397329,0.0008388159,0.001080709,0.0007218213,0.001264211,0.0001659851,0.00002538881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002112764,"about_ca_system_score_gemma":0.00008814572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006052713,"about_ca_topic_score_gemma":0.000005041021,"domain_scores_codex":[0.9969381,0.0001236942,0.0004573415,0.001146131,0.0007970488,0.0005376819],"domain_scores_gemma":[0.9972471,0.001239936,0.00008941555,0.00107896,0.0001162091,0.0002283526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003686866,0.00007634585,0.0007830067,0.00001421943,0.000001269507,0.000009283691,0.0002218755,0.0001991346,0.0002061544,0.5722073,0.00002023828,0.4262575],"study_design_scores_gemma":[0.0002226333,0.0000865495,0.03070707,0.00003981889,7.277673e-7,0.00004174269,0.000001433898,0.3446154,0.0004642721,0.6236473,0.0000119947,0.0001610466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1993044,0.00001202423,0.7982957,0.001356855,0.0004190378,0.0002387773,0.000001398365,0.0001468249,0.0002250321],"genre_scores_gemma":[0.7315593,0.000001002612,0.2681431,0.0002337028,0.00004827367,0.000006492488,1.089786e-7,0.000004865965,0.000003242671],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5322549,"threshold_uncertainty_score":0.6210698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0198271439006641,"gpt":0.2918634737537003,"spread":0.2720363298530362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586107,0.0001586591,0.0004508334,0.000125884,0.000117392,0.00005301757,0.000363175,0.00009354138,0.0002896957],"category_scores_gemma":[0.0009789388,0.000113059,0.00003160757,0.0004406163,0.001023957,0.0001775747,0.0001002747,0.0001628682,0.000002484235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002484416,"about_ca_system_score_gemma":0.0001159412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001249584,"about_ca_topic_score_gemma":0.00001186252,"domain_scores_codex":[0.9985467,0.00007946689,0.0004994746,0.0003092374,0.0002774294,0.0002876812],"domain_scores_gemma":[0.9982719,0.001186292,0.0001271494,0.0002446468,0.00009807957,0.00007195497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001533363,0.0002040869,0.008212816,0.0007735479,0.00003307962,0.00002107522,0.01300245,0.000159945,0.0004450151,0.8992075,0.00002776745,0.07775933],"study_design_scores_gemma":[0.0006808579,0.00007966389,0.002419252,0.00004412618,0.0000115854,0.00005066746,0.00004753476,0.007884642,0.002371399,0.9862673,0.00001296648,0.0001299645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9302258,0.00005289456,0.06848446,0.0001316867,0.0001078172,0.0002802205,0.000001283837,0.00004560905,0.0006702492],"genre_scores_gemma":[0.9518738,0.000007006555,0.04795436,0.00005631359,0.00005919769,0.00001332408,4.145325e-7,0.000007295619,0.00002833094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08705979,"threshold_uncertainty_score":0.4610412,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02001838402881809,"gpt":0.2905032228297754,"spread":0.2704848388009573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932938,0.0001252772,0.0002196988,0.0002720672,0.00007485418,0.00022326,0.001665817,0.0000601831,0.00004437238],"category_scores_gemma":[0.0001737189,0.00009045446,0.00005205087,0.001040587,0.0003580363,0.0004546861,0.0005706515,0.0002534972,0.00002103067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002891301,"about_ca_system_score_gemma":0.00009516546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002761686,"about_ca_topic_score_gemma":0.000009325999,"domain_scores_codex":[0.9983894,0.00002870805,0.0003482513,0.0003990938,0.0005263808,0.0003082022],"domain_scores_gemma":[0.9989133,0.0001059236,0.0001271014,0.0006376123,0.0001133323,0.0001027696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001531845,0.0000432888,0.0004439424,0.00003463996,0.000002045284,0.000005912643,0.0005307097,0.00003899522,0.001826742,0.8524812,0.00001780114,0.1445731],"study_design_scores_gemma":[0.0001911078,0.0000699043,0.007811188,0.00000917469,0.000001918665,0.0001323181,0.00001194986,0.2314864,0.007899579,0.7518628,0.0003472655,0.0001763757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1058052,0.00001008837,0.8902613,0.00008851648,0.001552308,0.0001340662,1.771156e-7,0.00006551884,0.002082833],"genre_scores_gemma":[0.8222623,3.368879e-7,0.1775911,0.00005256175,0.00007926521,0.000004009058,1.636479e-7,0.000003373618,0.000006844226],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7164571,"threshold_uncertainty_score":0.3688626,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02386510311144906,"gpt":0.2888497279891201,"spread":0.264984624877671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106399,0.0001450572,0.0002933211,0.0001185481,0.0005177766,0.0006928985,0.001404339,0.00004533451,0.000003695186],"category_scores_gemma":[0.0002218993,0.00009899912,0.00003604565,0.0001422883,0.0008919079,0.0005904679,0.0004431924,0.00009514373,4.595635e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002928886,"about_ca_system_score_gemma":0.00007821772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003809599,"about_ca_topic_score_gemma":0.00005393642,"domain_scores_codex":[0.9985501,0.00002487075,0.000273652,0.0004576094,0.0003480314,0.0003457529],"domain_scores_gemma":[0.9986122,0.0002437422,0.0002510591,0.0006760941,0.0001080798,0.0001088666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007889304,0.00002037442,0.008578308,0.00006179349,0.000007773811,0.000006607719,0.001125086,0.00009043149,0.00007231638,0.926264,0.000008115674,0.06375734],"study_design_scores_gemma":[0.001030389,0.0003883388,0.08468232,0.0001449813,0.0000109288,0.0001375541,0.00009017134,0.3932343,0.0007884696,0.5190665,0.00008504698,0.0003410139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07095097,0.00004623311,0.9276599,0.0001358308,0.0001899731,0.0003227236,7.051085e-7,0.00002749356,0.0006661946],"genre_scores_gemma":[0.790283,9.32782e-7,0.2096356,0.0000262961,0.00002934472,0.00001590182,3.213787e-7,0.00000376673,0.000004799541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.719332,"threshold_uncertainty_score":0.6681637,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04179656533753423,"gpt":0.2798113372138988,"spread":0.2380147718763646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123089,0.0001502912,0.0002485203,0.000185417,0.0001140465,0.0001594346,0.001830876,0.0000509079,0.000005710639],"category_scores_gemma":[0.00009194348,0.0001143452,0.00005185909,0.0006738966,0.0004774814,0.0005172771,0.0006670785,0.0001348689,0.00001723517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007512723,"about_ca_system_score_gemma":0.0002624253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009007079,"about_ca_topic_score_gemma":0.000002333755,"domain_scores_codex":[0.9979722,0.00001890349,0.0004407578,0.0005073475,0.0007021706,0.0003585535],"domain_scores_gemma":[0.9988426,0.00009794484,0.0001297188,0.0007255047,0.000087456,0.0001167703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001258847,0.00005003623,0.0000940205,0.00004085397,0.000001757823,0.000009595071,0.0007380739,0.03880263,0.0002919298,0.9489043,0.000005907352,0.01105958],"study_design_scores_gemma":[0.0001554915,0.00002704164,0.0006119811,0.000009137432,9.77078e-7,0.00002990807,0.00000152472,0.5119529,0.0002934653,0.4868366,0.000004307311,0.00007665021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01520771,0.00001123909,0.9832798,0.00008741819,0.0002893157,0.0001840434,0.000001034957,0.00004868589,0.0008907656],"genre_scores_gemma":[0.6122717,2.807257e-7,0.3876336,0.00005327771,0.00002830124,0.00000455881,4.516791e-7,0.000003075242,0.000004737104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.597064,"threshold_uncertainty_score":0.4662861,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02910316576555434,"gpt":0.2837472436446655,"spread":0.2546440778791112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164745,0.00007364285,0.0001513466,0.0008099787,0.0002548901,0.0009842876,0.0008244297,0.00002193101,0.00003051145],"category_scores_gemma":[0.0006379804,0.00004061677,0.00002599643,0.001314082,0.001343541,0.0007171002,0.0001756682,0.0001907576,0.000001163254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425844,"about_ca_system_score_gemma":0.00003067624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001834441,"about_ca_topic_score_gemma":0.000004933705,"domain_scores_codex":[0.9989657,0.00007147513,0.0002492938,0.0001430403,0.0004222391,0.0001482989],"domain_scores_gemma":[0.9988474,0.000549715,0.00008678554,0.0003480622,0.0001232617,0.00004483911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004781515,0.00001991126,0.0001088211,0.000008753331,9.061867e-7,3.830144e-7,0.006990147,0.00001870924,0.0000103784,0.9474586,0.0004948764,0.04488373],"study_design_scores_gemma":[0.000429793,0.0000492865,0.009134102,0.00003840233,0.000005346792,0.000007838865,0.0001124034,0.04730535,0.0000773078,0.9398291,0.002893846,0.0001172968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.784927,0.0008929939,0.1742864,0.009473868,0.004505162,0.0006643406,0.0000102382,0.0001465944,0.02509348],"genre_scores_gemma":[0.9871839,0.000007033644,0.01214181,0.0002381459,0.0004172212,0.000001219989,3.263445e-7,0.000002045988,0.000008306166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2022569,"threshold_uncertainty_score":0.9491507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Programming language; Executable; Debugging; Compiler; Temporal logic; Modeling language; Software","retraction":null,"screen_n_in":null,"score":{"opus":0.00820832302155748,"gpt":0.2404777155173934,"spread":0.232269392495836,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002126835,0.0001239108,0.0001805149,0.0001505494,0.00007719557,0.0001499353,0.0008074319,0.00004111497,0.000006776727],"category_scores_gemma":[0.000003250011,0.00009547734,0.00001762107,0.0004287689,0.0003948544,0.0003845652,0.0009027164,0.0001112463,0.000001592334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001629339,"about_ca_system_score_gemma":0.00002158271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007312388,"about_ca_topic_score_gemma":1.914711e-7,"domain_scores_codex":[0.9988054,0.00001825979,0.0002388936,0.0004053291,0.000305718,0.0002264232],"domain_scores_gemma":[0.9990643,0.00009739798,0.0000535796,0.0005636518,0.00009118451,0.000129927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.113454e-7,0.00002066181,0.0002483056,0.00004348536,0.000001575805,0.000001215449,0.0003303482,0.0001650564,0.0004265829,0.6085492,0.0001320586,0.3900813],"study_design_scores_gemma":[0.00008041361,0.000027285,0.02124873,0.00002925867,0.000001639301,0.00006333199,0.000002404059,0.6667225,0.0004552777,0.308825,0.002401006,0.0001431586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01436496,0.00008640662,0.9839051,0.001050156,0.00005428452,0.0003756177,6.659283e-7,0.0001287662,0.00003404408],"genre_scores_gemma":[0.2300096,0.000008176403,0.7697792,0.00005774489,0.00009165049,0.00004779855,1.178939e-7,0.000004102358,0.000001632675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6665574,"threshold_uncertainty_score":0.3893453,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02656293863260744,"gpt":0.3112078654493309,"spread":0.2846449268167235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001035277,0.0003790985,0.0004942339,0.0001330058,0.0003617872,0.0005117883,0.001544915,0.0001426283,0.000199359],"category_scores_gemma":[0.00008393377,0.0002937761,0.0001670956,0.0003062871,0.0006379959,0.0001362876,0.001900746,0.0006368674,0.0000116946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045871,"about_ca_system_score_gemma":0.0002460194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002172633,"about_ca_topic_score_gemma":5.462924e-7,"domain_scores_codex":[0.9974484,0.00005896716,0.0005942353,0.0008270908,0.0004230249,0.0006482876],"domain_scores_gemma":[0.9978873,0.0006622477,0.0002488698,0.0008731144,0.0001572419,0.0001712225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000470701,0.000060283,0.00001563621,0.0001222377,0.00001179381,3.413336e-7,0.0004928949,0.001819963,0.00001358381,0.9764374,0.00003197458,0.02098912],"study_design_scores_gemma":[0.00007193982,0.00001307072,0.00003957886,0.0001020941,0.000010035,0.000001277847,0.00002791934,0.4479325,0.00008442342,0.5514978,0.00002102915,0.0001983039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08411158,0.0000251406,0.9135683,0.0001530137,0.0006438159,0.001230453,0.00006434605,0.00004861588,0.0001546926],"genre_scores_gemma":[0.7515981,5.05245e-7,0.2472226,0.00009607022,0.0005020111,0.0005348323,0.00001872483,0.00002277519,0.000004414987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6674865,"threshold_uncertainty_score":0.9999514,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07388952295391411,"gpt":0.3504196541741919,"spread":0.2765301312202778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003318028,0.0004847495,0.0009383867,0.0002975059,0.0001357279,0.00006519548,0.001925534,0.0003447391,0.0003995186],"category_scores_gemma":[0.000745122,0.0003647753,0.0002272536,0.0003209301,0.003278345,0.0001916382,0.00255061,0.001010535,0.00001307797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001847414,"about_ca_system_score_gemma":0.0002028059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000210571,"about_ca_topic_score_gemma":0.000001885127,"domain_scores_codex":[0.9963645,0.000365236,0.0008825062,0.0007383818,0.0009053345,0.0007440693],"domain_scores_gemma":[0.9966366,0.00151621,0.0004479275,0.00108922,0.0001168716,0.0001931282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006231693,0.0001880737,0.0001931349,0.0005545815,0.00002855645,0.00001517111,0.004722258,0.0001192872,0.0001596772,0.9844928,0.00001630217,0.009447786],"study_design_scores_gemma":[0.0002786722,0.00003339594,0.000492106,0.0003332138,0.00003805445,0.0001209963,0.0001840612,0.004147789,0.001660291,0.99234,0.000003690737,0.0003676862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2735561,0.0003208284,0.7222734,0.00006188755,0.001199868,0.0005472157,0.00002839659,0.0000923881,0.001919931],"genre_scores_gemma":[0.8169175,0.000003676042,0.1827613,0.00007169957,0.0001845523,0.00002001693,0.000002651477,0.00002804064,0.00001061316],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5433614,"threshold_uncertainty_score":0.9998804,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04918352910942796,"gpt":0.3443535858998575,"spread":0.2951700567904295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002970838,0.0002868344,0.000428101,0.0004501824,0.0002922507,0.0008001815,0.002055111,0.0000748677,0.00001055106],"category_scores_gemma":[0.0001925035,0.0002104043,0.0000543122,0.002457511,0.0006632545,0.0007775636,0.001210777,0.0003118061,0.00002157122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001714068,"about_ca_system_score_gemma":0.0001770875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002508592,"about_ca_topic_score_gemma":0.0003151073,"domain_scores_codex":[0.9963413,0.0002798632,0.0006015198,0.001148925,0.0008082293,0.0008201782],"domain_scores_gemma":[0.9982427,0.0002372328,0.0001579133,0.0009763444,0.0001940761,0.0001917103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006971046,0.0006372955,0.00740298,0.00006237577,0.000009442088,0.00369366,0.03412558,0.0001083331,0.00003773971,0.3518271,0.00001369733,0.6020749],"study_design_scores_gemma":[0.001147135,0.001076469,0.007260493,0.00003331687,0.00000806361,0.01108047,0.001245765,0.4275876,0.0005168941,0.5492446,0.0001069227,0.0006922714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1615845,0.00001363751,0.8361177,0.00006245195,0.0005967884,0.001140696,1.325312e-7,0.0001347135,0.0003494385],"genre_scores_gemma":[0.6434786,6.490876e-8,0.3562784,0.00005225149,0.000123296,0.000055188,6.917042e-8,0.000006857687,0.000005323233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6013826,"threshold_uncertainty_score":0.858004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01409398797940812,"gpt":0.2768772586362708,"spread":0.2627832706568627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011208,0.0001585468,0.0002089216,0.0002282456,0.0001154362,0.0004707999,0.001485774,0.00005373261,0.00001325409],"category_scores_gemma":[0.0001610699,0.0001310447,0.00002385854,0.0009055145,0.000327655,0.001033488,0.0008578391,0.0001323623,0.00002281652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006662136,"about_ca_system_score_gemma":0.00005963583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002380649,"about_ca_topic_score_gemma":1.11235e-7,"domain_scores_codex":[0.9979824,0.00008339842,0.0003382778,0.0006457409,0.0005831374,0.0003670765],"domain_scores_gemma":[0.9987215,0.0001286514,0.0001050809,0.0008776948,0.00006086247,0.0001062459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001750932,0.00002418344,0.0004480048,0.00006486774,0.000001224822,0.000002758132,0.0006415825,0.002518167,0.0004591517,0.92647,0.00000661335,0.0693617],"study_design_scores_gemma":[0.0001510904,0.00002737019,0.006182674,0.00003005214,9.468937e-7,0.00005335792,0.000003556353,0.7487299,0.001314363,0.2433519,0.00002868277,0.0001260895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09964077,0.00002030508,0.8986971,0.0001268285,0.0004573062,0.0002723291,3.397705e-7,0.0001310419,0.0006539203],"genre_scores_gemma":[0.3358202,0.000001487572,0.6640081,0.000137946,0.00001791743,0.000004230522,3.130024e-7,0.000004738577,0.000005094097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7462118,"threshold_uncertainty_score":0.5343849,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Allison University","funders":"","keywords":"Differential (mechanical device); Mathematics; Cartesian coordinate system; Computer science; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03947984108463434,"gpt":0.3194914315522174,"spread":0.2800115904675831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741402,0.0002082014,0.0004030682,0.0001907186,0.0001303762,0.0001088466,0.0009003058,0.0001060069,0.0002085337],"category_scores_gemma":[0.0007046345,0.0001567651,0.00005232271,0.0005511582,0.001283456,0.0001648026,0.0004033614,0.0002586608,0.00003493964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009752693,"about_ca_system_score_gemma":0.0001400149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007566773,"about_ca_topic_score_gemma":0.000007789883,"domain_scores_codex":[0.9979323,0.0001231605,0.0004366595,0.0004599815,0.0005144375,0.0005334358],"domain_scores_gemma":[0.9986385,0.0003503507,0.00009312888,0.0005701301,0.000106328,0.0002415431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009023078,0.00005963938,0.0007668133,0.0000368379,0.000005337474,0.00005499354,0.001652457,0.000008406492,0.00006557324,0.9910492,0.0004386675,0.005853082],"study_design_scores_gemma":[0.0003478985,0.00006205377,0.001281818,0.00002107222,0.000008947432,0.0002233461,0.0000481997,0.01015585,0.0006209535,0.9869847,0.00006255729,0.0001826023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5420181,0.00003326415,0.4536849,0.0004737255,0.0007164865,0.000256784,0.000002006642,0.0001336941,0.00268111],"genre_scores_gemma":[0.9219342,5.423119e-7,0.07766365,0.0001661328,0.0001770434,0.0000113459,0.000001052591,0.00001110933,0.00003494076],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3799161,"threshold_uncertainty_score":0.6392697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01462481135828267,"gpt":0.2780769385946162,"spread":0.2634521272363335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002215219,0.0003307846,0.0002992591,0.000278864,0.001814934,0.00138013,0.004762191,0.00006834613,0.00001367425],"category_scores_gemma":[0.0002574999,0.0001937822,0.0001013835,0.002299855,0.001846627,0.0003781886,0.001631397,0.000524571,0.0000346599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008617939,"about_ca_system_score_gemma":0.0001899872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003117136,"about_ca_topic_score_gemma":0.000006695265,"domain_scores_codex":[0.9958039,0.0001729727,0.000500735,0.0009936409,0.001293106,0.001235667],"domain_scores_gemma":[0.9970073,0.001209783,0.0001174772,0.0012091,0.0002018278,0.0002544767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002594305,0.000060341,0.0006644824,0.00002196749,0.000006644348,0.00002849891,0.005191124,0.003737754,0.0001301487,0.09426466,0.00003497107,0.8958568],"study_design_scores_gemma":[0.0001333114,0.0001355785,0.01375099,0.00004208032,0.000001305287,0.00008498407,0.00004119372,0.8710361,0.00160918,0.1128904,0.00003318036,0.0002417039],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3136662,0.00003972121,0.6843817,0.0002765876,0.001144917,0.000190045,7.386508e-7,0.0001607841,0.0001393144],"genre_scores_gemma":[0.7404827,0.000001463507,0.2590962,0.0001059821,0.0002984621,0.000001491057,2.216111e-7,0.000009074452,0.000004423882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8956151,"threshold_uncertainty_score":0.9996566,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0346561703712842,"gpt":0.2635266988924376,"spread":0.2288705285211534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009010087,0.0001411118,0.0002093708,0.0001011187,0.0002836508,0.000254901,0.002606658,0.00004274051,0.00002686085],"category_scores_gemma":[0.000158468,0.00007675378,0.00006276142,0.0009508973,0.0007443322,0.000257009,0.000644028,0.0001438052,0.00003960201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003564529,"about_ca_system_score_gemma":0.00002720077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007020446,"about_ca_topic_score_gemma":0.000002846084,"domain_scores_codex":[0.9980339,0.00006238731,0.000406355,0.0003978403,0.0006601667,0.000439385],"domain_scores_gemma":[0.9985356,0.0003389551,0.0001301205,0.0008044547,0.00009229005,0.0000985333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[5.711889e-7,0.00002963015,0.0002511565,0.00001775256,0.000002022583,0.000006497845,0.000621267,0.0001806511,0.00003582407,0.9214635,0.00009151241,0.07729959],"study_design_scores_gemma":[0.00009764327,0.00005489706,0.0008451554,0.000004704412,0.000001016808,0.00003545572,0.000007907024,0.4606787,0.000318265,0.5372157,0.0006417718,0.00009882562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004579032,0.0002108261,0.9917282,0.0003321862,0.0007395054,0.0001838573,1.383264e-7,0.0000703139,0.002155968],"genre_scores_gemma":[0.9286287,0.000005004213,0.07112526,0.0001133705,0.0000772292,0.000005625439,5.65199e-8,0.0000037095,0.00004104814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9240497,"threshold_uncertainty_score":0.4843863,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02040349900912089,"gpt":0.2687050296310084,"spread":0.2483015306218875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000995373,0.000218685,0.000259908,0.0002631031,0.0002404855,0.00062672,0.002733869,0.00005721184,0.00001741854],"category_scores_gemma":[0.00006962836,0.0001690851,0.00005197705,0.001109286,0.0003408826,0.001505357,0.001933041,0.0002533088,0.00005313087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001508178,"about_ca_system_score_gemma":0.0001965062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002332873,"about_ca_topic_score_gemma":6.442939e-7,"domain_scores_codex":[0.997008,0.00006444636,0.0003926448,0.0007703988,0.001220164,0.000544294],"domain_scores_gemma":[0.9983127,0.0001105547,0.00009186708,0.0009697148,0.0001378284,0.0003773531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002156722,0.0001157717,0.0001565661,0.00002237866,0.000004648291,0.0001308954,0.002117671,0.008667381,0.000135569,0.2085874,0.0004542242,0.7796053],"study_design_scores_gemma":[0.0001852247,0.00002456276,0.0008580757,0.0000272542,9.247373e-7,0.000155766,0.00001416,0.6218503,0.0001184349,0.3763693,0.0002441534,0.0001518749],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004856716,0.00007956601,0.9928911,0.0002493231,0.001033953,0.0001539282,0.000003169399,0.000181142,0.0005510655],"genre_scores_gemma":[0.1767939,0.000001456176,0.8227199,0.0002859597,0.0001732676,0.000007845536,0.000002006764,0.000007921478,0.000007722419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7794535,"threshold_uncertainty_score":0.6895091,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04018705340121978,"gpt":0.3115883072052049,"spread":0.2714012538039852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134375,0.0002458744,0.000407554,0.0001149703,0.0003026926,0.0004150184,0.001608766,0.0000722443,0.0000240772],"category_scores_gemma":[0.0001042239,0.0001755182,0.00006418074,0.0005486781,0.0007151496,0.0003935315,0.0004391022,0.0001497335,0.00002033636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000566806,"about_ca_system_score_gemma":0.00006049389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002573026,"about_ca_topic_score_gemma":0.00001088196,"domain_scores_codex":[0.9975017,0.00009213557,0.0004602508,0.0008926216,0.0004609788,0.0005922735],"domain_scores_gemma":[0.9984928,0.0003615789,0.0001093618,0.00071265,0.0001260655,0.0001975376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001540005,0.00008556954,0.0006858791,0.0001003456,0.000006045782,0.000008678092,0.001476922,0.0002843474,0.0002068874,0.8068989,0.00002504984,0.190206],"study_design_scores_gemma":[0.000401074,0.00008428044,0.005051527,0.000008754469,0.000002511072,0.00008591008,0.000007976096,0.4821878,0.0001611853,0.5112739,0.0005294877,0.000205632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03763152,0.00006969657,0.9604356,0.0004060613,0.0002225715,0.0006827959,0.00000246661,0.000135141,0.000414102],"genre_scores_gemma":[0.6797961,0.000001769291,0.3197642,0.0002879082,0.00008207057,0.00003831914,9.101077e-7,0.000005948772,0.00002274853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6421646,"threshold_uncertainty_score":0.7157424,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02542242488827532,"gpt":0.2948909800593444,"spread":0.269468555171069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400863,0.0001457239,0.0001794599,0.0004352453,0.000099722,0.0002759392,0.0009725261,0.00006031739,0.000003909147],"category_scores_gemma":[0.0002399362,0.0001282065,0.00002201033,0.001298285,0.0004432542,0.001049855,0.0003578587,0.0001562903,0.000004600665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000159745,"about_ca_system_score_gemma":0.00008665787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002989255,"about_ca_topic_score_gemma":0.00001251625,"domain_scores_codex":[0.9980864,0.0000745114,0.000415902,0.0005666433,0.000510542,0.0003460376],"domain_scores_gemma":[0.9991449,0.0001117185,0.00009846806,0.0004965336,0.00005015499,0.00009820228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004262615,0.00004314527,0.0008939196,0.00003120348,7.229601e-7,0.000008180971,0.002678001,0.003712404,0.0005772371,0.9039847,0.000003338954,0.08806288],"study_design_scores_gemma":[0.0002960671,0.00003828168,0.0950351,0.00004254431,7.193373e-7,0.0000499305,0.00001395449,0.3155248,0.002099347,0.5867642,0.000006723982,0.00012837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2608307,0.00001424568,0.7381776,0.0003636904,0.0001916007,0.000169069,3.984067e-7,0.00004634294,0.0002063953],"genre_scores_gemma":[0.4906189,0.000002133031,0.5092442,0.0001056679,0.00001905928,0.000006633856,2.860845e-7,0.000002581471,5.257774e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3172205,"threshold_uncertainty_score":0.5228108,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006107569646732289,"gpt":0.2314636695249382,"spread":0.225356099878206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004057176,0.0002192,0.0002573543,0.0001683733,0.000396936,0.0006261027,0.003466566,0.00004657858,0.0000189976],"category_scores_gemma":[0.0001208887,0.000123083,0.00006985528,0.0009666963,0.0007063879,0.0004029387,0.001328698,0.0003115397,0.000007149868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003388222,"about_ca_system_score_gemma":0.00007620271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003268393,"about_ca_topic_score_gemma":0.000004517102,"domain_scores_codex":[0.9976498,0.00006557832,0.0004792983,0.0005247457,0.0007041133,0.0005764742],"domain_scores_gemma":[0.9982152,0.0004616315,0.0001512104,0.0009183826,0.000122161,0.0001314272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002061819,0.0000349108,0.0006762359,0.00005283625,0.000007568266,0.00000747031,0.001359499,0.02409243,0.004977403,0.2328989,0.0001033378,0.7357874],"study_design_scores_gemma":[0.00007833718,0.00002022029,0.009691469,0.00002104229,6.555559e-7,0.00004474204,0.000003042957,0.6118925,0.00213225,0.3759976,0.00001664258,0.0001014767],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4436108,0.00007564276,0.5548607,0.0005981376,0.0005085487,0.0001984945,8.177806e-7,0.00006463468,0.00008219433],"genre_scores_gemma":[0.7278606,0.000001161898,0.2719406,0.00009508685,0.00008977994,0.000003033563,1.168226e-7,0.000005610895,0.000003986008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7356859,"threshold_uncertainty_score":0.6441801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01984092983995294,"gpt":0.2744189667916013,"spread":0.2545780369516484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002299254,0.0001931748,0.0002142762,0.00003912048,0.0001217606,0.0002303351,0.0007887377,0.00009256364,0.00004548541],"category_scores_gemma":[0.0001553134,0.0001400654,0.00007289152,0.0003359199,0.0004532838,0.0000222512,0.0007728399,0.0001423965,0.00002035932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001519483,"about_ca_system_score_gemma":0.0000437359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003474441,"about_ca_topic_score_gemma":0.000001170633,"domain_scores_codex":[0.9982657,0.00004166597,0.0002945345,0.0006919877,0.0002876146,0.000418525],"domain_scores_gemma":[0.999331,0.00004346192,0.00005681353,0.0003037286,0.00005226015,0.0002127281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001052147,0.0002101901,0.006693478,0.0002364773,0.00002959795,0.00007118941,0.002729525,0.001890053,0.2310139,0.004332314,0.001799489,0.7508886],"study_design_scores_gemma":[0.00209366,0.001067912,0.02241004,0.0002506335,0.00001585921,0.0001261017,0.0004206372,0.763777,0.1690764,0.02688031,0.01232577,0.001555683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7655995,0.0005824825,0.2318694,0.001178225,0.0002860843,0.000262889,0.000006645515,0.00004197475,0.00017279],"genre_scores_gemma":[0.9323439,0.00004800969,0.06219067,0.005167382,0.0002279131,0.000004227408,0.000005832996,0.000008056672,0.000004005398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.761887,"threshold_uncertainty_score":0.5711703,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02551804787441153,"gpt":0.263819457371371,"spread":0.2383014094969594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008472812,0.0002054853,0.0002507447,0.0001980975,0.0004070433,0.0006122121,0.00188547,0.00007012564,0.00005356515],"category_scores_gemma":[0.0001017452,0.0001299896,0.00004018531,0.001442724,0.0008047794,0.0006314199,0.000704371,0.0002032605,0.0001126567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008884944,"about_ca_system_score_gemma":0.0001212821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008080292,"about_ca_topic_score_gemma":0.00001466111,"domain_scores_codex":[0.9974794,0.00006381067,0.0003503501,0.0007505107,0.0007596092,0.0005963185],"domain_scores_gemma":[0.9986338,0.0001314658,0.0001141728,0.0007611506,0.0001769527,0.0001824686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002538776,0.00004323271,0.0004649899,0.00001444874,0.000002964425,0.00002319556,0.001113099,0.00007019957,0.00008867513,0.9697729,0.00005829963,0.02834544],"study_design_scores_gemma":[0.000228513,0.0002440432,0.002029753,0.00001777308,0.000002683441,0.0002063052,0.0000151723,0.2975844,0.000726032,0.6981961,0.0005042969,0.0002449461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008049759,0.00002046584,0.9861128,0.0002728684,0.0004318651,0.0003244895,1.844195e-7,0.0002165281,0.00457099],"genre_scores_gemma":[0.6857498,1.696786e-7,0.3139088,0.0001494803,0.0001374459,0.00001232533,2.252813e-7,0.000005572071,0.00003617215],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6777,"threshold_uncertainty_score":0.5903575,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04669299312110983,"gpt":0.2780399702881751,"spread":0.2313469771670652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009370928,0.0002566609,0.0004036239,0.0003387412,0.0002162635,0.0003578258,0.002406226,0.00006745764,0.00003492164],"category_scores_gemma":[0.0001582586,0.0001879586,0.0001103615,0.001147287,0.000921325,0.0005396277,0.0006856389,0.0001907269,0.00003091947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009670643,"about_ca_system_score_gemma":0.0001395498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006305774,"about_ca_topic_score_gemma":0.00001164196,"domain_scores_codex":[0.9973717,0.00004261274,0.0005513642,0.0007456577,0.0005850611,0.0007036505],"domain_scores_gemma":[0.9982882,0.0003421646,0.0001713154,0.0008194576,0.0001594608,0.0002194382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000032603,0.00009359179,0.0002023231,0.00005962357,0.000005279675,0.00001281307,0.002224469,0.000007828984,0.00003368651,0.9569856,0.00006697866,0.04030455],"study_design_scores_gemma":[0.0002738243,0.00007223742,0.0006707867,0.00001241745,0.000003699802,0.00009604709,0.00002503099,0.2009614,0.0008639655,0.7965571,0.0002477281,0.0002157949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002075082,0.0000217441,0.9896908,0.00009171783,0.0008040393,0.0006083825,8.463923e-7,0.00017414,0.006533183],"genre_scores_gemma":[0.5129257,2.258625e-7,0.4868312,0.00009738759,0.0000692895,0.000037078,2.056625e-7,0.000006961106,0.00003183795],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5108507,"threshold_uncertainty_score":0.766473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01983313019163382,"gpt":0.2468271035333534,"spread":0.2269939733417196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224597,0.000152876,0.0002772207,0.00009800668,0.00009661298,0.0002090083,0.003089803,0.00005669034,0.0000259532],"category_scores_gemma":[0.00003250885,0.00008456512,0.0000963124,0.0008670239,0.0003920569,0.0003606282,0.001341009,0.0001771993,0.00002187405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005641937,"about_ca_system_score_gemma":0.00009702241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001996518,"about_ca_topic_score_gemma":0.000002042874,"domain_scores_codex":[0.9978267,0.00006866112,0.0003798463,0.000484881,0.0008324953,0.0004074149],"domain_scores_gemma":[0.9986255,0.0001122718,0.0001232751,0.0009720904,0.00007655553,0.00009033986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000112319,0.00003902499,0.0004600311,0.0000346107,0.000002155479,0.000002126038,0.0005235305,0.001328049,0.0002399208,0.9849193,0.00001316618,0.01243699],"study_design_scores_gemma":[0.000114921,0.00002070935,0.001910765,0.000004120172,0.000001071028,0.00002532083,0.000003037283,0.5052008,0.0006191339,0.4920087,0.00001635841,0.00007505838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06268153,0.00002132765,0.9342242,0.0001159917,0.001188677,0.0002895358,1.733719e-7,0.00004385609,0.001434636],"genre_scores_gemma":[0.9825576,4.134361e-7,0.01727773,0.00007336129,0.00005159297,0.000005055558,9.987115e-8,0.000004583108,0.00002960056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.919876,"threshold_uncertainty_score":0.5741674,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03399042463299039,"gpt":0.2662922667684897,"spread":0.2323018421354993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212541,0.0003465386,0.0004183238,0.0003480094,0.0003954409,0.000993484,0.003348825,0.00006801966,0.00003646249],"category_scores_gemma":[0.0002012011,0.0001995403,0.00007481525,0.001372592,0.001299395,0.001781726,0.001364949,0.0002152536,0.00002982453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002147209,"about_ca_system_score_gemma":0.0002499988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001883071,"about_ca_topic_score_gemma":0.00003460508,"domain_scores_codex":[0.9960116,0.0001396586,0.0004650904,0.001112011,0.001477191,0.0007944258],"domain_scores_gemma":[0.9971325,0.001040077,0.0001609237,0.001165868,0.0002528702,0.0002477926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008507073,0.0001402605,0.005283589,0.00006179095,0.00001244693,0.00009028906,0.001614466,0.003424736,0.0002929106,0.6885644,0.0000734854,0.3004331],"study_design_scores_gemma":[0.0004960667,0.0001200507,0.02343158,0.0002188653,0.00000452676,0.0002514874,0.00003195862,0.3745561,0.001170532,0.5992125,0.0000485777,0.0004578473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06479248,0.00004253053,0.9322196,0.001495231,0.0004731341,0.000299306,0.000003305684,0.0003430216,0.0003314138],"genre_scores_gemma":[0.5722521,0.000001154636,0.4275146,0.0001549009,0.00005449959,0.000008876807,2.058975e-7,0.000008932293,0.00000466752],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5074596,"threshold_uncertainty_score":0.958019,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02602241376037715,"gpt":0.2903041255594583,"spread":0.2642817117990811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009490115,0.0001617053,0.000341561,0.0001321182,0.0001061998,0.0001740086,0.001156771,0.00008753269,0.00001052584],"category_scores_gemma":[0.0004910773,0.0001175026,0.00005217544,0.001332992,0.0002308951,0.0002071834,0.000964219,0.0001771361,0.00001447995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003335297,"about_ca_system_score_gemma":0.0000949126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002450624,"about_ca_topic_score_gemma":0.000001924446,"domain_scores_codex":[0.9979157,0.0001015521,0.00040195,0.0006768771,0.0005487177,0.0003551584],"domain_scores_gemma":[0.9985212,0.0003942233,0.0001039998,0.0006181191,0.0001851049,0.0001773248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002120582,0.00005036132,0.000146398,0.0000525223,0.000003189756,0.00001621198,0.0008358773,0.0003833913,0.0006976723,0.9504079,0.000002753722,0.04740155],"study_design_scores_gemma":[0.0001000523,0.00006683944,0.001561596,0.00001394828,0.000002776216,0.00005233387,0.00001001262,0.2317313,0.004946985,0.7613017,0.00007746443,0.0001350202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03315377,0.0001612575,0.9656466,0.0002395279,0.00020652,0.0002872021,4.861323e-7,0.00006283438,0.0002417783],"genre_scores_gemma":[0.65139,0.000001896459,0.348327,0.0002178239,0.00004400408,0.00001202294,2.132597e-7,0.00000334481,0.000003778316],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6182362,"threshold_uncertainty_score":0.4791615,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02648866468639146,"gpt":0.3035279746954387,"spread":0.2770393100090472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006163,0.0001853776,0.000354412,0.0001228055,0.00008624499,0.00006329898,0.0005814756,0.0001198514,0.0002420983],"category_scores_gemma":[0.0008132456,0.0001383162,0.00002975145,0.0005212338,0.0008859684,0.0001194521,0.0003485618,0.0003632694,0.00001552096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003330444,"about_ca_system_score_gemma":0.00006317548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002544663,"about_ca_topic_score_gemma":0.000005763323,"domain_scores_codex":[0.9984274,0.0001335902,0.0003129344,0.0004696547,0.0002699967,0.0003864285],"domain_scores_gemma":[0.9987656,0.000703695,0.00006740139,0.0002817023,0.00003742599,0.0001441136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004051033,0.0000580178,0.00287737,0.0001131584,0.000006771121,0.0001067469,0.004185249,0.0001072517,0.0001231937,0.9798163,0.0001564702,0.01240894],"study_design_scores_gemma":[0.0002691403,0.0001012424,0.006251461,0.00003192043,0.00000583619,0.00007942119,0.00005973574,0.01330047,0.0004104596,0.9792407,0.00008962514,0.0001599743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8634525,0.0001843909,0.1312185,0.003943337,0.0002342912,0.0003210591,0.000001434457,0.00007682524,0.0005676462],"genre_scores_gemma":[0.9518149,0.000005391571,0.04620292,0.001861444,0.00009062464,0.00000628865,3.636553e-7,0.00001045695,0.000007534582],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08836249,"threshold_uncertainty_score":0.5640371,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02141809593852007,"gpt":0.272738823549276,"spread":0.251320727610756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400653,0.0001269987,0.0002753762,0.0001477473,0.00009730082,0.0003281699,0.001361804,0.00006155066,0.000003576215],"category_scores_gemma":[0.0002169625,0.00009741323,0.00004349927,0.001153986,0.0001689379,0.001025412,0.0005404478,0.0001131294,0.00001090793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002105341,"about_ca_system_score_gemma":0.0001136682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003060414,"about_ca_topic_score_gemma":9.385813e-7,"domain_scores_codex":[0.9975471,0.00008923274,0.0004553988,0.0004026754,0.001085027,0.000420493],"domain_scores_gemma":[0.9987364,0.0002026774,0.0002387523,0.0005089398,0.0001601573,0.0001530711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001078314,0.0002088376,0.007337942,0.00009809771,0.00001636083,0.00001810019,0.003863538,0.009898736,0.00063652,0.8924806,0.004631934,0.08079856],"study_design_scores_gemma":[0.000369984,0.00006243012,0.003032236,0.00002163259,0.000002352216,0.0000250112,0.00002746362,0.743616,0.0006910704,0.2519418,0.00006981962,0.0001402123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08950344,0.00006721827,0.9076464,0.0001769279,0.0006287114,0.0001924587,0.000002649121,0.00005677638,0.001725394],"genre_scores_gemma":[0.8137531,0.000001522933,0.1860934,0.00008078924,0.00005035161,0.000007018793,0.000001373426,0.000003591688,0.000008822528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7337172,"threshold_uncertainty_score":0.3972397,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0382530588361936,"gpt":0.3001589032769855,"spread":0.2619058444407918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623363,0.000105078,0.0001642229,0.0001013712,0.00008621538,0.0002164782,0.002085237,0.00003525474,0.00005462495],"category_scores_gemma":[0.0000626582,0.00006168899,0.00001673126,0.0005523859,0.0005888241,0.0002520034,0.0002799543,0.0001373353,0.00001081784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000153661,"about_ca_system_score_gemma":0.00004347794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006761197,"about_ca_topic_score_gemma":0.0000267486,"domain_scores_codex":[0.9986342,0.0000514058,0.0002786373,0.000406511,0.0003947315,0.0002345344],"domain_scores_gemma":[0.9987046,0.0002772533,0.00005740744,0.0008943681,0.00001956005,0.00004677788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001864932,0.00004528303,0.0003604602,0.00002085139,0.000001598322,0.000009569394,0.001035858,0.000190034,0.000009867115,0.8660769,0.00004181758,0.1322059],"study_design_scores_gemma":[0.0002738941,0.00006725559,0.01646022,0.00002865741,0.000002424142,0.0002150176,0.00002726034,0.2768064,0.0000772061,0.7051334,0.0007410992,0.0001670861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2747621,0.0001715603,0.7090545,0.0005559744,0.0005222971,0.0006098009,0.000006552577,0.00007641766,0.01424072],"genre_scores_gemma":[0.9811184,0.000001590452,0.01861672,0.0002195618,0.00003151194,0.000003124828,3.186751e-7,0.000002648788,0.000006125359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7063563,"threshold_uncertainty_score":0.3874924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01107800157972715,"gpt":0.2921296828278611,"spread":0.281051681248134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001924842,0.00007292264,0.0001000843,0.00005065433,0.0001196323,0.000157521,0.0001708866,0.00001804559,0.0000525363],"category_scores_gemma":[0.00004036354,0.00005693977,0.0000159168,0.0001187182,0.0001246294,0.0002722861,0.00009492406,0.00008361793,0.000004613449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005606737,"about_ca_system_score_gemma":0.00001937558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008106561,"about_ca_topic_score_gemma":4.651891e-7,"domain_scores_codex":[0.9993597,0.000005085381,0.0001693849,0.0001378416,0.0001526692,0.0001753214],"domain_scores_gemma":[0.9995753,0.0001522007,0.00004211034,0.000110652,0.00004660898,0.00007319465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001489702,0.000005112789,0.003454325,0.00001086715,0.000001226508,5.81723e-8,0.0001552288,0.00002260841,0.0002359029,0.8773721,0.00002979087,0.1187113],"study_design_scores_gemma":[0.0001273268,0.00001664394,0.01252455,0.000005450619,0.000002755003,6.655177e-7,0.000007372524,0.3234604,0.0007199682,0.6629456,0.0001229737,0.0000662869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3032741,5.924141e-7,0.6962763,0.00005394993,0.0001317602,0.0001172469,0.00001495745,0.000006649706,0.0001244304],"genre_scores_gemma":[0.863835,7.44138e-8,0.1360188,0.00002823199,0.000100128,0.00001034767,0.000004185766,0.000001824332,0.000001346995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5605609,"threshold_uncertainty_score":0.2321936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009863122991491707,"gpt":0.248374828716861,"spread":0.2385117057253693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064595,0.0002379261,0.0002907284,0.0002506354,0.0002234481,0.0005884992,0.003003078,0.00005751234,0.0007854313],"category_scores_gemma":[0.0001047774,0.0001937176,0.00006870648,0.0019132,0.0006488321,0.000960745,0.0007469085,0.0002644319,0.0002218467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000171066,"about_ca_system_score_gemma":0.0001005206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008255734,"about_ca_topic_score_gemma":0.000002120572,"domain_scores_codex":[0.9967767,0.00008638106,0.0004787584,0.001109065,0.0008853116,0.0006637631],"domain_scores_gemma":[0.9981365,0.0001723922,0.000059517,0.001340407,0.0000928841,0.0001982513],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002780283,0.00009594218,0.0001159253,0.00001710905,0.000001858878,0.00002377031,0.0004672216,0.006821682,0.00009445456,0.1954152,0.000312511,0.7966315],"study_design_scores_gemma":[0.0001313282,0.00003923501,0.005786009,0.000007328328,9.286775e-7,0.000146914,0.000001568787,0.5813419,0.0003762027,0.4112092,0.0007767548,0.0001825672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06643367,0.00002695922,0.9285145,0.0022159,0.00084239,0.0002333983,4.972702e-7,0.0002750225,0.001457695],"genre_scores_gemma":[0.4455479,0.000002047891,0.5535614,0.0003220493,0.000508252,0.000008736505,3.681468e-7,0.000006597675,0.00004267105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7964489,"threshold_uncertainty_score":0.8599922,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01099076605160411,"gpt":0.270382784079142,"spread":0.2593920180275379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852896,0.0002312989,0.0002654681,0.0002389373,0.0002391847,0.0006867515,0.002114914,0.00006177538,0.00008326474],"category_scores_gemma":[0.0001087216,0.0001684268,0.00006831591,0.0009923934,0.0004426042,0.0003916729,0.0006141014,0.0002174793,0.0001469841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009865413,"about_ca_system_score_gemma":0.00007457429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002053708,"about_ca_topic_score_gemma":0.00001310211,"domain_scores_codex":[0.9975046,0.00005156298,0.0003434301,0.0007175456,0.0007220504,0.000660837],"domain_scores_gemma":[0.998848,0.0002049463,0.00008966764,0.000664376,0.00006767551,0.0001253648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001993099,0.00009565568,0.000253639,0.00001922226,0.000001101596,0.00005912122,0.0005032166,0.0002583954,0.00003452804,0.7940867,0.001576433,0.20311],"study_design_scores_gemma":[0.00045666,0.0001863399,0.01350115,0.00009240532,0.000003205734,0.0001297,0.00002574026,0.3157254,0.001676717,0.652723,0.01492797,0.0005517371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0261049,0.00005585269,0.9227973,0.000443288,0.001981357,0.0003606025,9.048114e-7,0.0003119901,0.04794376],"genre_scores_gemma":[0.7056924,9.024588e-7,0.2875455,0.0002845339,0.006309242,0.00001337217,8.69001e-7,0.00001167574,0.0001415225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6795875,"threshold_uncertainty_score":0.6868247,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04306107150266057,"gpt":0.3306566029812192,"spread":0.2875955314785587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000911341,0.0001398164,0.000275483,0.0002065338,0.0003188674,0.0004378351,0.002536354,0.00005788794,0.00000900088],"category_scores_gemma":[0.0005453207,0.00009818721,0.00007982746,0.0002379966,0.0003964071,0.0005030262,0.0005769146,0.0001298717,0.00001041003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004980448,"about_ca_system_score_gemma":0.00005187574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001701945,"about_ca_topic_score_gemma":0.000002387775,"domain_scores_codex":[0.9983965,0.00002930241,0.0003451275,0.0004638804,0.0004352546,0.0003299232],"domain_scores_gemma":[0.998173,0.0003064968,0.0002827166,0.001036689,0.0001168832,0.00008422037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000820306,0.00005400309,0.0001869867,0.00005540657,0.000003066481,0.000003417144,0.0002161572,0.0001313175,0.0004105887,0.9660104,0.00001544602,0.03290503],"study_design_scores_gemma":[0.0002896397,0.0001389975,0.001589891,0.00001576311,0.000001511158,0.00001646077,0.000003530522,0.3031219,0.001856686,0.6928045,0.00005910228,0.0001020148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01877264,0.00001016161,0.9789562,0.0001903148,0.001089173,0.0003048429,6.451186e-7,0.00004364087,0.000632353],"genre_scores_gemma":[0.8006077,3.783819e-7,0.1991961,0.00009366063,0.00007825301,0.000008737985,2.810887e-7,0.000003783827,0.00001101424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7818351,"threshold_uncertainty_score":0.4713219,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01784311639969774,"gpt":0.2500368813857108,"spread":0.232193764986013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687734,0.0001856579,0.0002555007,0.0002217512,0.0005823251,0.0004980221,0.002875591,0.0000294838,0.0001402961],"category_scores_gemma":[0.00004403517,0.0001477862,0.00006858142,0.001072076,0.0003787166,0.0004158615,0.002475873,0.0002867493,0.00002097306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001519954,"about_ca_system_score_gemma":0.0001251536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003386751,"about_ca_topic_score_gemma":0.000003359524,"domain_scores_codex":[0.9973403,0.000110955,0.0003605005,0.0006639559,0.0009684731,0.0005558012],"domain_scores_gemma":[0.9988631,0.00009932779,0.0001060718,0.0007409216,0.00004903869,0.0001415302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002691524,0.00006039274,0.0003282554,0.00001999186,0.000002695013,0.00004635885,0.001547092,0.0006678065,0.0001282042,0.9615204,0.000190887,0.03548528],"study_design_scores_gemma":[0.0002372232,0.00008458024,0.001387137,0.000001643677,0.000001992902,0.0001684392,0.00003931825,0.2805039,0.00029525,0.7155275,0.001519696,0.0002333275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02078002,0.00003629974,0.9760534,0.0002560396,0.001689522,0.0003118895,7.213141e-7,0.0001533229,0.0007187899],"genre_scores_gemma":[0.9554495,4.827618e-7,0.0441139,0.000209003,0.0001123346,0.00005617598,8.243813e-7,0.000006552928,0.00005119812],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9346695,"threshold_uncertainty_score":0.6026547,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02477339122742333,"gpt":0.2666185337299233,"spread":0.2418451425024999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777846,0.0001791735,0.0002780333,0.0003744614,0.0001722928,0.0003721801,0.001522703,0.00006370684,0.00002565317],"category_scores_gemma":[0.0001685579,0.0001300746,0.0001080826,0.0009696138,0.0005499581,0.000646256,0.0002316138,0.000123926,0.000007389994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004951461,"about_ca_system_score_gemma":0.00008676568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001244936,"about_ca_topic_score_gemma":0.0000017428,"domain_scores_codex":[0.9975829,0.00005783457,0.0005534387,0.0003918901,0.001005012,0.0004088836],"domain_scores_gemma":[0.9985939,0.0002900198,0.0002017667,0.0004141754,0.0003696479,0.0001305132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006747743,0.00009830442,0.0002430949,0.0001143363,0.000004667322,7.330184e-7,0.0007197782,0.002556117,0.0007387105,0.9331946,0.0002987112,0.0620242],"study_design_scores_gemma":[0.0003079475,0.0001032335,0.01738323,0.00003307045,0.00000160376,0.000006373582,0.00002045636,0.589886,0.001595432,0.3905065,0.00003261474,0.0001235811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06885444,0.00003071858,0.9292591,0.000590355,0.0002436196,0.0004889222,0.000001457438,0.00009074016,0.0004406342],"genre_scores_gemma":[0.6835654,2.637414e-7,0.3160441,0.0003361809,0.00002037635,0.00002949341,4.745144e-7,0.000003160216,6.02229e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6147109,"threshold_uncertainty_score":0.5304289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}