{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Peter Selinger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003339747,0.0007436784,0.0008022808,0.0009591692,0.002116203,0.004304688,0.002406532,0.002049551,0.005187222],"category_scores_gemma":[0.004212601,0.001004735,0.002201791,0.0009673232,0.005951349,0.008494359,0.004062755,0.005639617,0.002370209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001427445,"about_ca_system_score_gemma":0.003145586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001312713,"about_ca_topic_score_gemma":0.001030656,"domain_scores_codex":[0.9978224,0.0007327247,0.0001749543,0.0003185039,0.0007436161,0.0002077939],"domain_scores_gemma":[0.9980592,0.0006527699,0.0001420438,0.0003238134,0.000611933,0.0002101765],"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.000006730781,0.00001250733,0.00003780348,0.00004499153,0.000004661938,0.00004268175,0.0002832529,0.001178239,0.0009634978,0.9919709,0.00121586,0.004238809],"study_design_scores_gemma":[0.00003365298,0.00003604537,0.00002995305,0.00007083957,0.00001297322,0.0001279563,0.0001480447,0.02853315,0.001996857,0.8833836,0.08559605,0.00003086643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003310608,0.0003272415,0.9798651,0.003700709,0.000354518,0.0001063672,0.00007020304,0.00071681,0.01154841],"genre_scores_gemma":[0.06152386,0.0007363831,0.9261401,0.001779646,0.0003895444,0.0003824171,0.0001367148,0.0003888734,0.008522616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005187222,"threshold_uncertainty_score":0.01766253,"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","authors":[{"name":"Peter Selinger","is_ca":true},{"name":"Benoît Valiron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002103487,0.0005831756,0.0006239619,0.0008754248,0.001917251,0.002896339,0.001738105,0.001160758,0.005303434],"category_scores_gemma":[0.002693759,0.0005140026,0.001481531,0.0009819129,0.004824666,0.005504344,0.002264927,0.00318993,0.001295157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148586,"about_ca_system_score_gemma":0.002227443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002254682,"about_ca_topic_score_gemma":0.001393814,"domain_scores_codex":[0.9984238,0.0003695466,0.00009951098,0.0002335587,0.0006903707,0.000183303],"domain_scores_gemma":[0.9989506,0.0004482437,0.00008736206,0.0001834118,0.000236186,0.00009415152],"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.000005041868,0.000005895181,0.00001877592,0.00001657813,0.000002526362,0.00002826502,0.00009562178,0.001245038,0.0004426504,0.9954053,0.0003326267,0.002401743],"study_design_scores_gemma":[0.00001520776,0.00001826854,0.00003343187,0.00002074623,0.00001251855,0.00005685369,0.00003306536,0.0164581,0.0009283058,0.9566192,0.02578261,0.00002165776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006044955,0.0005677014,0.9739683,0.001066313,0.0003367618,0.00006204187,0.00008459674,0.0004570553,0.01741223],"genre_scores_gemma":[0.3585216,0.001596534,0.6077712,0.001537838,0.001002418,0.0004375072,0.0001741934,0.0004848738,0.02847381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005303434,"threshold_uncertainty_score":0.0177418,"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","authors":[{"name":"Ellie D’Hondt","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002533906,0.0004872262,0.0004859954,0.001064978,0.001448939,0.002061793,0.001119587,0.001215522,0.01150495],"category_scores_gemma":[0.00567635,0.000414328,0.001195616,0.0005657406,0.005520637,0.007329669,0.004282066,0.003245957,0.002235632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001368259,"about_ca_system_score_gemma":0.002007178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000937416,"about_ca_topic_score_gemma":0.0007555284,"domain_scores_codex":[0.9980236,0.000409307,0.0001369746,0.0003311103,0.0007544631,0.0003445669],"domain_scores_gemma":[0.9974976,0.000894359,0.0001781168,0.0005823072,0.000641302,0.0002062539],"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.000006850742,0.000004718317,0.00002948307,0.00001586986,0.00000173652,0.00002024346,0.00008175687,0.0005090323,0.0005956167,0.996369,0.0003205514,0.002045163],"study_design_scores_gemma":[0.00001067884,0.00002126564,0.00003658303,0.00001408589,0.000005582879,0.00004207233,0.00004462651,0.005642348,0.002752363,0.9821025,0.009316918,0.00001091961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02627675,0.0002462905,0.8949442,0.002150115,0.0004066919,0.0001845681,0.0002768844,0.000947498,0.07456706],"genre_scores_gemma":[0.7729676,0.0006684096,0.1977145,0.001204034,0.0004397694,0.0004767492,0.0003112941,0.0004764556,0.02574111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01150495,"threshold_uncertainty_score":0.03848791,"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","authors":[{"name":"Samson Abramsky","is_ca":false},{"name":"Esfandiar Haghverdi","is_ca":false},{"name":"Philip Scott","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008745656,0.0003752414,0.0003826031,0.001113482,0.001957077,0.002754409,0.001241141,0.0008024196,0.006584486],"category_scores_gemma":[0.001152399,0.0002132278,0.0006639406,0.0007771467,0.006121757,0.005256896,0.003092019,0.001895839,0.0009567532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154209,"about_ca_system_score_gemma":0.0008121062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001577702,"about_ca_topic_score_gemma":0.0008760869,"domain_scores_codex":[0.9989663,0.0002823641,0.00004563736,0.00016383,0.0003773015,0.0001646158],"domain_scores_gemma":[0.9993045,0.0002023259,0.00008198414,0.0001153793,0.0001599258,0.0001358696],"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.000001596225,0.000001423223,0.00002570052,0.000003281294,7.765667e-7,0.00001518529,0.0000579136,0.0001701068,0.00009325834,0.9990478,0.00007986346,0.0005029816],"study_design_scores_gemma":[0.000004220932,0.000008341353,0.00008609769,0.000003619925,0.000002330771,0.00006938772,0.0000844821,0.001706125,0.0003067085,0.9920035,0.005718161,0.00000687527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1931395,0.001088152,0.5788789,0.003116914,0.0001910434,0.0001148928,0.0003143876,0.0005416524,0.2226146],"genre_scores_gemma":[0.9395308,0.0004345526,0.04204505,0.0003631627,0.0001209806,0.0001228084,0.0001627791,0.00006655081,0.01715341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006584486,"threshold_uncertainty_score":0.02202731,"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","authors":[{"name":"Richard Blute","is_ca":true},{"name":"J.R.B. Cockett","is_ca":true},{"name":"R. A. G. Seely","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558995,0.0006504637,0.0006083304,0.00283096,0.002519283,0.002981781,0.001208271,0.0009400777,0.009028484],"category_scores_gemma":[0.002373982,0.0003773457,0.0007895017,0.00209966,0.005114217,0.006295466,0.004016472,0.002299498,0.001818832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002149512,"about_ca_system_score_gemma":0.0009278043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722619,"about_ca_topic_score_gemma":0.001489114,"domain_scores_codex":[0.9986439,0.0003941239,0.00008939363,0.0003304817,0.0003820978,0.0001598677],"domain_scores_gemma":[0.9988616,0.0003842181,0.00006906306,0.0002089344,0.0003278412,0.000148471],"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.000001763256,0.000001728345,0.00004536481,0.00001329848,0.000001671306,0.00001354159,0.0001369397,0.00006253547,0.00006952571,0.9963775,0.0009495982,0.002326474],"study_design_scores_gemma":[0.000003967734,0.00000706384,0.0001125025,0.00001954094,0.000003721527,0.0001511181,0.0001089723,0.0004582239,0.0001853294,0.8786085,0.1203348,0.00000626614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0268131,0.01538176,0.5320727,0.005588048,0.00155531,0.000187821,0.001116513,0.0005891976,0.4166956],"genre_scores_gemma":[0.6836311,0.007686262,0.2050894,0.004020609,0.001471912,0.0004101485,0.001449025,0.0003640925,0.09587745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009028484,"threshold_uncertainty_score":0.03020334,"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","authors":[{"name":"Ana Bove","is_ca":false},{"name":"Venanzio Capretta","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007730971,0.000870944,0.001263777,0.002517032,0.001817236,0.007113476,0.003013501,0.002683331,0.003464805],"category_scores_gemma":[0.01071599,0.00096066,0.002610921,0.002912218,0.01049461,0.01385667,0.003954102,0.003952248,0.001129002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003583036,"about_ca_system_score_gemma":0.002496073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003824058,"about_ca_topic_score_gemma":0.003851805,"domain_scores_codex":[0.9950059,0.002329694,0.0003935992,0.0007994786,0.00106209,0.000409264],"domain_scores_gemma":[0.9936149,0.003876682,0.0004169967,0.001366187,0.0005333417,0.0001917198],"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.000007837079,0.000006539525,0.0001260212,0.00003784976,0.000006698182,0.00004738671,0.0002951364,0.00516308,0.0002094238,0.9898976,0.0002824989,0.00391993],"study_design_scores_gemma":[0.0000124125,0.000009564092,0.00004120475,0.00003904791,0.00001198962,0.00006969445,0.00004787841,0.02818839,0.0003794657,0.9589142,0.01227346,0.00001263416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007577605,0.001229981,0.9786738,0.0006991657,0.0001264755,0.00007015481,0.00009850597,0.0005153744,0.0110091],"genre_scores_gemma":[0.2528391,0.002461271,0.7334774,0.0005721315,0.0004951097,0.0004412614,0.0003170042,0.000444813,0.008951844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007730971,"threshold_uncertainty_score":0.04088581,"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","authors":[{"name":"Anne Preller","is_ca":false},{"name":"Joachim Lambek","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130102,0.0004513162,0.0003771919,0.001449361,0.001317446,0.002300046,0.0009869048,0.0009981532,0.008713147],"category_scores_gemma":[0.002579716,0.0003274538,0.0006984238,0.0006633413,0.002365574,0.005621262,0.00259498,0.0009049803,0.0008832315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008649856,"about_ca_system_score_gemma":0.0004555451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009992289,"about_ca_topic_score_gemma":0.00110867,"domain_scores_codex":[0.9986386,0.0003115305,0.0001403214,0.0003281455,0.0003879632,0.0001934163],"domain_scores_gemma":[0.9983792,0.0006794615,0.0001243018,0.0002405748,0.0004351534,0.0001413922],"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.00001983977,0.000006322628,0.0001766651,0.00003282557,0.00000543174,0.0001000952,0.0005210363,0.0004204555,0.001453384,0.98994,0.0006354594,0.006688419],"study_design_scores_gemma":[0.000009397588,0.00002417676,0.0003553172,0.00001939044,0.000008495431,0.0001655222,0.0002054189,0.003482502,0.002175047,0.975201,0.01833453,0.00001920801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2548456,0.001598314,0.6600605,0.001112647,0.0003946529,0.000192093,0.001157652,0.00119708,0.07944151],"genre_scores_gemma":[0.8656728,0.0003251002,0.1104017,0.0004643897,0.0002496081,0.0001854475,0.0008428429,0.0002339156,0.02162421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008713147,"threshold_uncertainty_score":0.0291484,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002655275,0.0005349307,0.0005688329,0.003021488,0.001893729,0.003645213,0.0009698656,0.0009719811,0.006413076],"category_scores_gemma":[0.004627214,0.0005482579,0.001380512,0.001816878,0.005619291,0.007994667,0.002703245,0.002216528,0.0007162939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002092464,"about_ca_system_score_gemma":0.001038156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002159955,"about_ca_topic_score_gemma":0.001286514,"domain_scores_codex":[0.997198,0.0006815559,0.000319923,0.0007068831,0.000808836,0.0002848351],"domain_scores_gemma":[0.99589,0.002187591,0.0003835294,0.0005043934,0.0007115311,0.000322962],"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.000008540823,0.000006890931,0.00009675718,0.00001726079,0.000004522986,0.00007295366,0.0001689778,0.0004641099,0.000243784,0.9965891,0.0001662821,0.00216092],"study_design_scores_gemma":[0.00001049112,0.00001652756,0.0001743611,0.00002137692,0.000009650624,0.0001715219,0.0001186186,0.002873897,0.000653617,0.9875222,0.008411763,0.00001599521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2444744,0.00684782,0.5599819,0.002911891,0.0007221808,0.0002342301,0.001366776,0.0005836886,0.1828771],"genre_scores_gemma":[0.8695009,0.00254245,0.09765699,0.0008098198,0.0004417377,0.00025705,0.0007422502,0.000100309,0.02794844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006413076,"threshold_uncertainty_score":0.02145386,"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","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Jürgen Koslowski","is_ca":false},{"name":"R. A. G. Seely","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724566,0.0009909482,0.0008269709,0.003531489,0.003795233,0.003991577,0.001696632,0.001689761,0.02376337],"category_scores_gemma":[0.002934084,0.000821963,0.001231554,0.005451239,0.005846858,0.006733327,0.00481199,0.005570181,0.007489458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002585805,"about_ca_system_score_gemma":0.001414433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003863782,"about_ca_topic_score_gemma":0.002948797,"domain_scores_codex":[0.998104,0.0005554765,0.00014643,0.0003760772,0.0005337756,0.0002842175],"domain_scores_gemma":[0.9976145,0.001024122,0.0001117151,0.0002318673,0.0007891903,0.0002287071],"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.000009875941,0.00001402454,0.000192466,0.0001412714,0.000005044074,0.0001017335,0.0005534916,0.0002190723,0.0003482192,0.9709298,0.01042611,0.01705895],"study_design_scores_gemma":[0.000004069134,0.00002069782,0.0002844799,0.0001498462,0.000007215736,0.0005384354,0.0002258738,0.0005123079,0.0003026965,0.5831894,0.4147435,0.0000214556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01535337,0.05675655,0.3712735,0.01206322,0.005766126,0.0002761934,0.002381069,0.001378637,0.5347514],"genre_scores_gemma":[0.4190015,0.05028294,0.2797378,0.02004246,0.01085529,0.001167612,0.003265775,0.001242503,0.214404],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02376337,"threshold_uncertainty_score":0.07949644,"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","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Stephen Lack","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00258786,0.0004391527,0.0005563012,0.002230742,0.001511304,0.004337068,0.0007983194,0.001067032,0.004086839],"category_scores_gemma":[0.003272619,0.0003945867,0.0008240996,0.001181839,0.009922632,0.008229308,0.005603053,0.001617392,0.000452187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337977,"about_ca_system_score_gemma":0.000723809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149194,"about_ca_topic_score_gemma":0.0006919889,"domain_scores_codex":[0.9980308,0.0005461863,0.0001553056,0.0003818348,0.0005956606,0.0002901967],"domain_scores_gemma":[0.9979941,0.0007383521,0.0002134256,0.000401807,0.00040388,0.0002484403],"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.000007286267,0.000005241679,0.000385942,0.00002790117,0.000007938866,0.0001022484,0.0006917751,0.0002863768,0.0006736926,0.994396,0.0002054177,0.003210208],"study_design_scores_gemma":[0.000004852543,0.0000279228,0.0008337088,0.00004554225,0.00001126667,0.0003598458,0.0007235869,0.001309172,0.001072388,0.9812439,0.01435097,0.00001681052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.440793,0.008225058,0.3226281,0.003254368,0.0003210945,0.0001122285,0.0002781585,0.0004422425,0.2239457],"genre_scores_gemma":[0.959375,0.001487814,0.01639584,0.0004748976,0.0002594431,0.0001227142,0.0001811439,0.00009124923,0.02161194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004337068,"threshold_uncertainty_score":0.01368606,"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","authors":[{"name":"Béatrice Bérard","is_ca":false},{"name":"John Mullins","is_ca":true},{"name":"Mathieu Sassolas","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477683,0.001199706,0.001303849,0.002804573,0.002483781,0.007353929,0.002506339,0.002475749,0.004228886],"category_scores_gemma":[0.04151671,0.001020992,0.002879391,0.001838731,0.0116877,0.01651157,0.007545891,0.004750662,0.0003891649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004162056,"about_ca_system_score_gemma":0.002232474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002265051,"about_ca_topic_score_gemma":0.0009834494,"domain_scores_codex":[0.9875239,0.003589946,0.0009088736,0.002376232,0.004461305,0.001139616],"domain_scores_gemma":[0.963063,0.02186676,0.003726948,0.008358247,0.002283503,0.0007015507],"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.00003166544,0.00001422216,0.0005277066,0.00007576156,0.00003237908,0.0001014567,0.0003974219,0.01163889,0.001312052,0.9804155,0.0002582179,0.005194654],"study_design_scores_gemma":[0.00001007843,0.00002783699,0.0002548108,0.00003486084,0.00003360916,0.0001444471,0.00007687698,0.0399771,0.00187964,0.9543638,0.003163693,0.00003309724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01903792,0.000300146,0.9713699,0.000833458,0.00007119629,0.00008510798,0.0001969611,0.0003517536,0.007753573],"genre_scores_gemma":[0.8154131,0.0004335121,0.1792435,0.0004040236,0.0002408962,0.0002734785,0.0002163992,0.0002266974,0.003548509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009477683,"threshold_uncertainty_score":0.05012339,"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","authors":[{"name":"Michael Johnson","is_ca":false},{"name":"Robert Rosebrugh","is_ca":true},{"name":"Richard J. Wood","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002487997,0.0006477528,0.0005212938,0.002133475,0.002332234,0.004134017,0.0006815523,0.001234233,0.005369848],"category_scores_gemma":[0.004335774,0.0005613618,0.001071375,0.001194027,0.008239608,0.01454978,0.005081705,0.002058819,0.0007489649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704728,"about_ca_system_score_gemma":0.0008535396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0021411,"about_ca_topic_score_gemma":0.001336221,"domain_scores_codex":[0.997421,0.0006084321,0.0001995332,0.0006597144,0.0006614418,0.0004499174],"domain_scores_gemma":[0.9966323,0.00130345,0.0003584167,0.0006047177,0.0006272075,0.000473959],"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.00001094038,0.000004481865,0.0001644482,0.00002170932,0.000003455036,0.00009814088,0.0004676635,0.0001600609,0.0004417984,0.9941658,0.0003364722,0.004124986],"study_design_scores_gemma":[0.00001255477,0.00003174328,0.0003753064,0.00002963763,0.0000142799,0.0005198584,0.0006184836,0.002056212,0.001951069,0.9708564,0.02350981,0.00002470121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1683137,0.00624278,0.694536,0.003255497,0.0005726375,0.00009732902,0.0003467689,0.001030653,0.1256048],"genre_scores_gemma":[0.8893771,0.00246002,0.08794256,0.0005994167,0.0004676692,0.0001162605,0.0002689882,0.0003187691,0.0184492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005369848,"threshold_uncertainty_score":0.01796389,"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","authors":[{"name":"Nicola Gambino","is_ca":true},{"name":"Peter Schuster","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263978,0.0006381402,0.0006497249,0.002673683,0.002528904,0.003672273,0.0007576004,0.001307267,0.006866297],"category_scores_gemma":[0.006950487,0.0003967779,0.0009847014,0.001712447,0.008614547,0.01277053,0.004971377,0.002187382,0.0008816297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001337775,"about_ca_system_score_gemma":0.0005714744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006271866,"about_ca_topic_score_gemma":0.0004952201,"domain_scores_codex":[0.9976577,0.0007888207,0.0002321444,0.0004980484,0.0005067257,0.0003165277],"domain_scores_gemma":[0.994288,0.00241299,0.0007874313,0.0008253503,0.001108478,0.0005778355],"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.000003387316,0.000002388319,0.00009709314,0.00001766261,0.000002655945,0.00003286566,0.0002346867,0.0001977565,0.0002605377,0.9980229,0.0001621481,0.0009659677],"study_design_scores_gemma":[0.000005390853,0.00001975853,0.0002030969,0.00002353992,0.000008498815,0.0001805071,0.0003818535,0.001545785,0.0006822269,0.9868484,0.01008771,0.00001327746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2728511,0.004159927,0.550605,0.006192507,0.0006067393,0.0001110735,0.0004742425,0.000381972,0.1646174],"genre_scores_gemma":[0.9459381,0.001275354,0.04037088,0.0006272786,0.0004158946,0.0001468149,0.0002501997,0.0001267017,0.0108489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006866297,"threshold_uncertainty_score":0.02297008,"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","authors":[{"name":"Esfandiar Haghverdi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001439684,0.0005095386,0.0005050616,0.002388899,0.002000837,0.003965949,0.001146576,0.0008786801,0.005608488],"category_scores_gemma":[0.001580196,0.0003373692,0.0007223533,0.001748883,0.007962146,0.00743589,0.003709108,0.002216094,0.0004484229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002808841,"about_ca_system_score_gemma":0.0009355047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002162878,"about_ca_topic_score_gemma":0.001843933,"domain_scores_codex":[0.9987066,0.0004734739,0.00004317573,0.0002076883,0.000357716,0.0002112415],"domain_scores_gemma":[0.9983945,0.0007138368,0.0001774498,0.0002118993,0.0002273567,0.0002749152],"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.000002101718,0.000001322626,0.00007487735,0.000006681342,0.000001590427,0.00001150063,0.00008516428,0.0001434418,0.00005570284,0.9980197,0.0002460879,0.001351828],"study_design_scores_gemma":[0.000001813336,0.000004297493,0.0001864539,0.000006592553,0.000002222377,0.00005569004,0.0001177619,0.0006527456,0.00008761841,0.9926651,0.006214806,0.000004826036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.137786,0.01092498,0.6006588,0.009344842,0.0003380138,0.00006579371,0.0004578441,0.00050604,0.2399177],"genre_scores_gemma":[0.9365342,0.001809689,0.04764772,0.0005596657,0.0001950805,0.0000829402,0.0002115679,0.00009866145,0.01286059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005608488,"threshold_uncertainty_score":0.02037966,"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","authors":[{"name":"Giovanni Bernardi","is_ca":true},{"name":"Matthew Hennessy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008901169,0.001097433,0.0009805789,0.002287793,0.002069591,0.006823829,0.002403599,0.002993048,0.004397166],"category_scores_gemma":[0.01511755,0.001183457,0.002514053,0.003412108,0.005009426,0.01675481,0.00464367,0.00435062,0.0008219339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002482005,"about_ca_system_score_gemma":0.002817867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004115783,"about_ca_topic_score_gemma":0.002237893,"domain_scores_codex":[0.9910451,0.00404432,0.0008959213,0.0009099272,0.002356242,0.0007485527],"domain_scores_gemma":[0.9861303,0.00749138,0.001417932,0.002876521,0.001497097,0.0005867372],"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.00002287292,0.00001195846,0.0001837911,0.00003312977,0.0000105965,0.00007873917,0.0004213965,0.008699812,0.0005248197,0.9867106,0.0004442012,0.002858105],"study_design_scores_gemma":[0.00003736029,0.00003276478,0.0001137132,0.00007352332,0.00003103968,0.0001825927,0.0002076683,0.07542,0.001392133,0.8970751,0.02539848,0.00003558405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01642865,0.0004340168,0.9725977,0.0008580978,0.0001118524,0.0001137991,0.0002840329,0.00044628,0.008725644],"genre_scores_gemma":[0.5009892,0.002389232,0.4792967,0.0006776453,0.0005091943,0.0009523705,0.0009530724,0.000544697,0.01368796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008901169,"threshold_uncertainty_score":0.04707444,"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","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Jean-Simon Pacaud Lemay","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760924,0.0004185562,0.0004701907,0.00268845,0.002160939,0.003548461,0.0007965986,0.001176552,0.006587165],"category_scores_gemma":[0.002461788,0.000298672,0.0005506376,0.001999433,0.008213573,0.006860843,0.003925213,0.002095942,0.0006298291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002628837,"about_ca_system_score_gemma":0.001246225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639497,"about_ca_topic_score_gemma":0.001003322,"domain_scores_codex":[0.9977532,0.0007086564,0.0001357319,0.000374255,0.0007908929,0.0002373724],"domain_scores_gemma":[0.9985177,0.0006340492,0.0001135582,0.0002177457,0.0003334609,0.0001835256],"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.000001753539,0.000001514646,0.00006051302,0.00001237703,0.000001569639,0.00001402919,0.0001759816,0.00007971752,0.00009665694,0.9967791,0.0003402987,0.002436435],"study_design_scores_gemma":[0.000002031842,0.000004795389,0.0002004965,0.00001214729,0.000002339626,0.00008281403,0.0001149642,0.0003172643,0.0001132435,0.9690747,0.03007093,0.000004220477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1099726,0.02738485,0.4574079,0.008248399,0.0009382451,0.0001214651,0.000594567,0.0006499064,0.3946821],"genre_scores_gemma":[0.8798261,0.005065756,0.0750187,0.002057764,0.0009072181,0.0001970857,0.0005345784,0.0001335517,0.03625914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006587165,"threshold_uncertainty_score":0.02203631,"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","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Ernie Manes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702386,0.0003895526,0.0004170467,0.002375263,0.001712132,0.0033489,0.00108275,0.0009629902,0.01062645],"category_scores_gemma":[0.002618749,0.0002818319,0.0006750086,0.00175356,0.00668381,0.008844152,0.003513154,0.001682223,0.001068323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002342836,"about_ca_system_score_gemma":0.001162451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00399805,"about_ca_topic_score_gemma":0.002004631,"domain_scores_codex":[0.9976662,0.0004928554,0.0001255595,0.0004647018,0.0008879838,0.0003627347],"domain_scores_gemma":[0.9983529,0.0004997265,0.0001544731,0.0002528376,0.0005148456,0.0002252399],"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.00000459208,0.000003600922,0.0000768192,0.00001615806,0.000002247095,0.00002539953,0.0001461058,0.0001052329,0.0001999835,0.9964818,0.0006311733,0.002306854],"study_design_scores_gemma":[0.000005885442,0.000009707387,0.0003861293,0.00002050878,0.000006323015,0.0001447725,0.0001986537,0.00121638,0.0003460703,0.9577433,0.03990997,0.00001234685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.136794,0.008013483,0.3719822,0.007364035,0.0005590105,0.0001708166,0.001960007,0.0008158266,0.4723406],"genre_scores_gemma":[0.8748235,0.002122003,0.06357881,0.001845,0.0007202784,0.0003137745,0.001540839,0.0001840152,0.05487164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01062645,"threshold_uncertainty_score":0.03554904,"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","authors":[{"name":"Nathanael Ackerman","is_ca":false},{"name":"Cameron E. Freer","is_ca":false},{"name":"Daniel M. Roy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418263,0.0005182711,0.0006106325,0.001799512,0.00178342,0.002625442,0.0007970345,0.0008294003,0.003998233],"category_scores_gemma":[0.006102988,0.0003017966,0.0008665262,0.001769589,0.01005365,0.008804456,0.004699723,0.003465672,0.0004206361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002455616,"about_ca_system_score_gemma":0.0007182073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002018461,"about_ca_topic_score_gemma":0.001022552,"domain_scores_codex":[0.9982418,0.0004172148,0.0001155373,0.0004236167,0.0005366809,0.0002651048],"domain_scores_gemma":[0.9958515,0.002421948,0.0003165542,0.0006865715,0.0004398793,0.0002835561],"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.00000429743,0.000002829853,0.00007252627,0.000009300988,0.00000180068,0.00001821587,0.0001023818,0.0003768929,0.0001825454,0.9977977,0.00009420767,0.001337309],"study_design_scores_gemma":[0.000003507865,0.000008764877,0.0002025246,0.000009932503,0.000003086462,0.00005715297,0.00005758717,0.003854173,0.0003987446,0.9925096,0.002889665,0.000005213402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2757522,0.003695603,0.5515075,0.006940604,0.0001904112,0.00006956836,0.0002055098,0.0003156246,0.1613229],"genre_scores_gemma":[0.955869,0.001254386,0.03237403,0.0004139947,0.0002698772,0.00009824742,0.0001366244,0.0000985322,0.009485401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003998233,"threshold_uncertainty_score":0.01781684,"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","authors":[{"name":"Marta Bunge","is_ca":true},{"name":"Marcelo Fiore","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001793691,0.000611153,0.0004944283,0.001723167,0.001613855,0.002358817,0.001255278,0.001117869,0.005013787],"category_scores_gemma":[0.002830839,0.0003997813,0.001381327,0.001121171,0.006702352,0.007561795,0.004074079,0.001770379,0.0005128165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001230533,"about_ca_system_score_gemma":0.0008817834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001504611,"about_ca_topic_score_gemma":0.000710362,"domain_scores_codex":[0.9980749,0.0003526825,0.0001252929,0.0005530094,0.0005067733,0.0003873401],"domain_scores_gemma":[0.9978962,0.0007424384,0.0003210302,0.0004366602,0.0003482239,0.0002554375],"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.00001273371,0.00001217412,0.0002556204,0.00003594007,0.00000736942,0.0001509314,0.0007253511,0.000955163,0.001875532,0.9911342,0.000111994,0.004723071],"study_design_scores_gemma":[0.00001127397,0.00005068903,0.0003601307,0.00002761724,0.00001965383,0.0002497387,0.0003661492,0.006280682,0.004464791,0.9794565,0.008683181,0.00002960635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2169478,0.001263504,0.7493927,0.0006990588,0.0001179994,0.0001411573,0.0002041021,0.0006358741,0.03059782],"genre_scores_gemma":[0.8991868,0.0007308833,0.0890643,0.0001697841,0.0001396627,0.0002505965,0.000213495,0.0001118076,0.01013267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005013787,"threshold_uncertainty_score":0.01677281,"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","authors":[{"name":"Esfandiar Haghverdi","is_ca":false},{"name":"Philip Scott","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00266558,0.0006323545,0.0005783502,0.002080463,0.001613411,0.00560931,0.002202965,0.00158865,0.004270094],"category_scores_gemma":[0.003652093,0.0007187928,0.001193303,0.001657099,0.008886327,0.01170257,0.005341758,0.004670315,0.0007239332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003697108,"about_ca_system_score_gemma":0.001285728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003178623,"about_ca_topic_score_gemma":0.00151835,"domain_scores_codex":[0.9973595,0.0009179359,0.0001157949,0.0005260265,0.0007561328,0.0003246081],"domain_scores_gemma":[0.9980887,0.0006864077,0.0001818241,0.0004240292,0.0003934587,0.0002255615],"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.000002823613,0.000001753293,0.00006209325,0.000004833072,0.000001258605,0.00001574694,0.0001708262,0.0004715559,0.000120686,0.9980452,0.0001222301,0.0009809081],"study_design_scores_gemma":[0.000007851977,0.00001452281,0.00009452014,0.00001196819,0.000005328262,0.00005747997,0.0001848501,0.008172145,0.0006072059,0.9755255,0.01530703,0.00001165799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06151521,0.001044542,0.8788987,0.004724957,0.0002540394,0.00006351216,0.0002533441,0.0008041575,0.05244157],"genre_scores_gemma":[0.7703987,0.0007248515,0.2108682,0.00092805,0.0002712006,0.0001525245,0.000201507,0.0003531283,0.01610182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00560931,"threshold_uncertainty_score":0.02682453,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Alberto Momigliano","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01726605,0.001227101,0.001391437,0.004288546,0.002729696,0.007883566,0.00547475,0.002242617,0.005828652],"category_scores_gemma":[0.07822418,0.001141586,0.002103639,0.005394961,0.004311741,0.01651424,0.004869092,0.004221706,0.0009281098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004441741,"about_ca_system_score_gemma":0.004954651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005479602,"about_ca_topic_score_gemma":0.005397643,"domain_scores_codex":[0.9791613,0.008815242,0.002743404,0.001474864,0.006590656,0.001214549],"domain_scores_gemma":[0.9413133,0.03940079,0.003403446,0.009371901,0.005362858,0.001147641],"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.0002218693,0.0002434938,0.003115969,0.0007202892,0.0000781902,0.0002013564,0.00160126,0.03609468,0.003403738,0.9033156,0.004290828,0.04671272],"study_design_scores_gemma":[0.000113493,0.0002086061,0.001225027,0.0004767008,0.0001195551,0.0002443933,0.001056963,0.2195698,0.02125206,0.7219604,0.03363506,0.000137891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05071967,0.0006074677,0.9225407,0.001152599,0.0001484274,0.0003981299,0.001346233,0.006861707,0.01622513],"genre_scores_gemma":[0.35981,0.0005787057,0.6319946,0.0002715603,0.00006999859,0.0005989127,0.002721199,0.001948423,0.002006559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01726605,"threshold_uncertainty_score":0.09131271,"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","authors":[{"name":"Thomas Hildebrandt","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Glynn Winskel","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003214577,0.0004208367,0.0005318406,0.001331231,0.001739195,0.005564872,0.001750603,0.001345373,0.006075086],"category_scores_gemma":[0.005099329,0.0004429593,0.001252427,0.001438788,0.005879862,0.01310546,0.003413759,0.003218917,0.001137643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002194257,"about_ca_system_score_gemma":0.001703808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002676419,"about_ca_topic_score_gemma":0.0017593,"domain_scores_codex":[0.9977425,0.0004726401,0.0001878307,0.000581607,0.0007816458,0.0002337444],"domain_scores_gemma":[0.9963531,0.001195171,0.0003019404,0.001133575,0.000673793,0.0003424075],"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.000003819009,0.000003856899,0.00005960152,0.000009037321,0.000001812946,0.00003016998,0.0001507354,0.0005996207,0.0002007127,0.9971846,0.0001365323,0.001619516],"study_design_scores_gemma":[0.000009113103,0.00002212147,0.00007480327,0.00001944301,0.00001328678,0.0001093661,0.00009275919,0.01360084,0.001130854,0.9634547,0.02145544,0.00001735889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512575,0.000555386,0.9614812,0.001598209,0.0001927086,0.00004153641,0.0002043782,0.0004407877,0.02036003],"genre_scores_gemma":[0.6180899,0.001299332,0.3519096,0.000978839,0.0005218972,0.0003031501,0.0004151018,0.0002424317,0.0262398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006075086,"threshold_uncertainty_score":0.02032316,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.03399948,0.002028827,0.00396912,0.01101835,0.004418716,0.01568396,0.004501823,0.009883285,0.01536296],"category_scores_gemma":[0.1853562,0.00100412,0.001311282,0.01453773,0.007753571,0.01760973,0.004391765,0.01623864,0.01033469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004646806,"about_ca_system_score_gemma":0.006179027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006203743,"about_ca_topic_score_gemma":0.01032597,"domain_scores_codex":[0.9746692,0.00608748,0.003728729,0.00337437,0.01131525,0.0008249759],"domain_scores_gemma":[0.781191,0.1213103,0.008721449,0.008312087,0.07529753,0.00516761],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006623038,0.000004144508,0.00009306527,0.00009331731,0.000007175971,0.00001589387,0.0001220595,0.00001397978,0.00001285625,0.004145348,0.9905729,0.004912542],"study_design_scores_gemma":[0.00002213376,0.000006121602,0.0004981277,0.0005405752,0.0000269104,0.00009085067,0.0003271565,0.0001913937,0.00009950759,0.0132254,0.9849305,0.000041248],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"commentary","genre_gemma":"commentary","genre_scores_codex":[0.0001252422,0.01631041,0.0004921286,0.6089663,0.3709647,0.00001103631,0.0002013171,0.0000865745,0.002842224],"genre_scores_gemma":[0.004446309,0.02012617,0.001236781,0.2142022,0.7466209,0.00006139192,0.0001749565,0.0002868526,0.01284454],"genre_candidate":"commentary","genre_consensus":"commentary","teacher_disagreement_score":0.9889817,"threshold_uncertainty_score":0.1798086,"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","authors":[{"name":"Emina Torlak","is_ca":false},{"name":"Mana Taghdiri","is_ca":false},{"name":"Greg Dennis","is_ca":false},{"name":"Joseph P. Near","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417141,0.0006903839,0.0004616465,0.001921038,0.0004689251,0.00263306,0.001967274,0.001319238,0.002923617],"category_scores_gemma":[0.004029886,0.0007026356,0.001173734,0.001964524,0.002064383,0.004910904,0.001791461,0.002573318,0.001486377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310812,"about_ca_system_score_gemma":0.001410739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001680088,"about_ca_topic_score_gemma":0.001513858,"domain_scores_codex":[0.9983956,0.0004318742,0.0001437456,0.0002207871,0.0006774465,0.0001304848],"domain_scores_gemma":[0.9971387,0.001278913,0.0001489386,0.0005165401,0.0007364105,0.0001804653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001607757,0.0001050757,0.001291931,0.0008432903,0.00002645434,0.0002945273,0.001080877,0.005807853,0.007943563,0.5973518,0.01157053,0.3735233],"study_design_scores_gemma":[0.00001945907,0.0002213525,0.0008274176,0.0006948629,0.00003941362,0.001643664,0.0004707791,0.02785858,0.007541145,0.2842877,0.6763219,0.00007377598],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.03960302,0.2037163,0.5712541,0.02326143,0.002347648,0.0001388112,0.000221815,0.003782053,0.1556749],"genre_scores_gemma":[0.2440619,0.1583532,0.5455309,0.004464841,0.002872331,0.0001619834,0.0007100339,0.0009688442,0.04287612],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003417141,"threshold_uncertainty_score":0.01807177,"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","authors":[{"name":"Lucién Hardy","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003836934,0.001133416,0.001308635,0.001790539,0.003051527,0.004263173,0.002363671,0.002406984,0.006759662],"category_scores_gemma":[0.003333563,0.000617131,0.002193468,0.001663254,0.01004129,0.01083445,0.003935104,0.006015351,0.00134973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003395849,"about_ca_system_score_gemma":0.001751023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002261745,"about_ca_topic_score_gemma":0.00184684,"domain_scores_codex":[0.9982688,0.0007977764,0.00008949233,0.0002669522,0.0004036631,0.0001732115],"domain_scores_gemma":[0.9982148,0.0007737963,0.0001720126,0.0004685515,0.0001943707,0.0001764413],"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":[6.942097e-7,0.000001912119,0.00001007475,0.000007773975,0.000001247597,0.00001344859,0.00005201409,0.0003177644,0.00004068081,0.9991047,0.0001052327,0.0003443759],"study_design_scores_gemma":[0.000002412085,0.000005193509,0.00001596927,0.000009830223,0.000002036026,0.00002340868,0.00002596195,0.002692139,0.00003590524,0.9928611,0.004321703,0.000004338607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00773628,0.002364896,0.9238851,0.004432859,0.0003241838,0.00007654353,0.0001994981,0.0002783985,0.06070231],"genre_scores_gemma":[0.5206972,0.00349586,0.4424778,0.003175823,0.002095787,0.0008378646,0.00038399,0.0004590657,0.0263766],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006759662,"threshold_uncertainty_score":0.02463877,"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","authors":[{"name":"Rafael D. Sorkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00691513,0.0006448163,0.001325111,0.001860427,0.002113629,0.003912749,0.002490895,0.002186868,0.004190716],"category_scores_gemma":[0.0113185,0.0005345642,0.001710399,0.001074676,0.01102458,0.01123108,0.004751856,0.005113499,0.0007684053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00246329,"about_ca_system_score_gemma":0.001333916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009103357,"about_ca_topic_score_gemma":0.0004179341,"domain_scores_codex":[0.9980166,0.0007079187,0.00008980353,0.00038683,0.0006453084,0.0001535022],"domain_scores_gemma":[0.9939803,0.003812378,0.0003231781,0.00086469,0.000699326,0.0003202343],"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.000001528001,0.00000260151,0.00002844386,0.00001309539,0.000002130382,0.000008437049,0.00005405912,0.0005677794,0.00003881905,0.9983464,0.0001460534,0.0007906333],"study_design_scores_gemma":[0.000002837789,0.000006333946,0.00002663123,0.000009136962,8.190074e-7,0.00001482166,0.0000134065,0.003885311,0.00003987685,0.9936367,0.00236081,0.000003371397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01868278,0.002252801,0.9319871,0.004864349,0.000511009,0.00004290434,0.0001279754,0.0001509117,0.04138019],"genre_scores_gemma":[0.6300304,0.004177312,0.3417381,0.003080659,0.003150051,0.0004697881,0.0002469404,0.0003315328,0.01677528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00691513,"threshold_uncertainty_score":0.0365712,"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","authors":[{"name":"Alberto Momigliano","is_ca":false},{"name":"Brigitte Pientka","is_ca":true},{"name":"David Thibodeau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01184285,0.0006679918,0.00106234,0.001970664,0.003844554,0.004417541,0.002302598,0.004182625,0.00375536],"category_scores_gemma":[0.0230158,0.0008289025,0.001868667,0.001570201,0.01567536,0.01220177,0.005477599,0.007115161,0.001030445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00299629,"about_ca_system_score_gemma":0.002091255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00490582,"about_ca_topic_score_gemma":0.003448625,"domain_scores_codex":[0.9900672,0.005942202,0.0002851182,0.000945791,0.002009562,0.0007500011],"domain_scores_gemma":[0.987816,0.008920318,0.0002267931,0.001784709,0.0008964571,0.0003556786],"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.00001776901,0.00001848143,0.0001194612,0.00003097677,0.000007038416,0.0001514373,0.0007996697,0.0005660221,0.0002841871,0.9875608,0.00127014,0.009174045],"study_design_scores_gemma":[0.00005551791,0.00006216976,0.0001391332,0.0001529194,0.00003188463,0.0006617858,0.0007269733,0.01521583,0.005026898,0.8679145,0.1099445,0.00006785092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01719847,0.003248523,0.9203795,0.01262625,0.0005487263,0.0001329569,0.00004304344,0.001193542,0.04462907],"genre_scores_gemma":[0.3737207,0.002002974,0.6038993,0.00227414,0.0003181125,0.0002767609,0.00004454122,0.0006667285,0.0167968],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01184285,"threshold_uncertainty_score":0.06263173,"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","authors":[{"name":"Borja Balle","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Doina Precup","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00146298,0.0005126482,0.0006957272,0.0009397962,0.0004916213,0.001581127,0.001069437,0.0006253253,0.002782623],"category_scores_gemma":[0.00620173,0.0003525865,0.0008399849,0.000717111,0.002048679,0.002039173,0.001441403,0.001253995,0.0004950475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001149911,"about_ca_system_score_gemma":0.0007722512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001038881,"about_ca_topic_score_gemma":0.001179116,"domain_scores_codex":[0.9977887,0.0007779315,0.0001391444,0.000447247,0.0006884523,0.0001585436],"domain_scores_gemma":[0.9975899,0.001114629,0.0001656257,0.0005109498,0.0005403205,0.00007859214],"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.00007872044,0.0000318617,0.0005216187,0.00008105524,0.00003329897,0.0000623034,0.0001950528,0.1213721,0.006603794,0.8288949,0.0006977062,0.04142769],"study_design_scores_gemma":[0.000006631626,0.000028533,0.00007091018,0.00001662244,0.000006761314,0.0000261541,0.00003528675,0.5621905,0.00462675,0.4316449,0.001336226,0.00001071367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02781243,0.00009368767,0.9694462,0.000108915,0.00002499795,0.00002172516,0.00004136796,0.0002898573,0.002160836],"genre_scores_gemma":[0.6692752,0.0001700904,0.3252381,0.0001106875,0.00005085772,0.0001233359,0.0002313187,0.0001960655,0.004604398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002782623,"threshold_uncertainty_score":0.009308755,"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","authors":[{"name":"G. S. H. Cruttwell","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001544255,0.0003986601,0.0003782104,0.001355155,0.001418452,0.00221666,0.0006285875,0.0007324629,0.005916947],"category_scores_gemma":[0.001819715,0.000239005,0.0004807848,0.001267451,0.005279643,0.005426861,0.003882538,0.002049819,0.0005657832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366851,"about_ca_system_score_gemma":0.0007191778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003132528,"about_ca_topic_score_gemma":0.002412674,"domain_scores_codex":[0.9988853,0.0002721678,0.0000640314,0.0002736811,0.0003487522,0.0001559806],"domain_scores_gemma":[0.9989572,0.0002960328,0.00009240005,0.000155523,0.0003718034,0.0001270899],"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.000004351631,0.000003424198,0.0004303058,0.00003630441,0.000003756158,0.00008736175,0.0007017445,0.0001567539,0.0004445937,0.9923574,0.0008446088,0.004929455],"study_design_scores_gemma":[0.00001017075,0.0000558631,0.002805924,0.0001178544,0.00002423589,0.002290654,0.001426557,0.002179781,0.001330357,0.7737031,0.2160284,0.00002695632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2265056,0.02181986,0.3887678,0.00945825,0.001419632,0.000104189,0.0005031189,0.0004403799,0.3509812],"genre_scores_gemma":[0.9044445,0.004812092,0.05406592,0.001382077,0.0004245144,0.00007089775,0.0001984768,0.00008859338,0.03451304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005916947,"threshold_uncertainty_score":0.01979417,"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)","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004016633,0.0002697804,0.0008516107,0.0007693754,0.0009574923,0.001316798,0.001129532,0.001399023,0.003040694],"category_scores_gemma":[0.03558667,0.0002363221,0.0003485121,0.001053497,0.00181215,0.00282345,0.0008614534,0.001005984,0.0002913676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001488577,"about_ca_system_score_gemma":0.001803857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003867287,"about_ca_topic_score_gemma":0.003650058,"domain_scores_codex":[0.9989021,0.0004569513,0.00005731607,0.0001064422,0.0002965288,0.0001807471],"domain_scores_gemma":[0.9801486,0.01672154,0.000528448,0.001366662,0.000901629,0.0003329628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003868146,0.000190503,0.00501411,0.0001771953,0.00006127585,0.0001267969,0.0001670008,0.8429732,0.005499412,0.1264704,0.001185249,0.01774806],"study_design_scores_gemma":[0.00004712434,0.00005273349,0.0004462667,0.00001139055,0.00001032359,0.00002593972,0.0000412775,0.9838245,0.001070182,0.0142347,0.0002247043,0.00001091858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8589115,0.0006790528,0.1232749,0.001888606,0.00006407216,0.0001848904,0.0001709384,0.0002737459,0.01455236],"genre_scores_gemma":[0.9605676,0.0001344996,0.03837189,0.00008273709,0.0000104022,0.00009530322,0.00007463077,0.0000622662,0.0006007338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004016633,"threshold_uncertainty_score":0.02124226,"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","authors":[{"name":"Richard Blute","is_ca":true},{"name":"J.R.B. Cockett","is_ca":true},{"name":"R. A. G. Seely","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002296143,0.000393129,0.0003285852,0.001322256,0.001866705,0.003429317,0.000854815,0.001053985,0.005920519],"category_scores_gemma":[0.002316453,0.0003241422,0.0007233432,0.001104531,0.006904305,0.007795054,0.002749181,0.001835352,0.001117809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002473077,"about_ca_system_score_gemma":0.001312454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001491813,"about_ca_topic_score_gemma":0.0008840056,"domain_scores_codex":[0.9985158,0.0005691326,0.0000739475,0.0002178593,0.0004192977,0.0002039022],"domain_scores_gemma":[0.9987318,0.0006388817,0.0001023885,0.0001541691,0.0002436074,0.0001291773],"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.000004139907,0.000002640847,0.00002897693,0.00001073253,0.000001379837,0.00001494763,0.0001341736,0.0001279295,0.0001121322,0.9965605,0.0005690275,0.002433446],"study_design_scores_gemma":[0.000006310036,0.00000808953,0.0000547678,0.00001250032,0.000003266692,0.00005263372,0.00006666674,0.001180248,0.0002381817,0.9790644,0.01930658,0.00000639272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07210487,0.01125928,0.5012392,0.01588879,0.000905446,0.000101559,0.0006450597,0.001472002,0.3963838],"genre_scores_gemma":[0.8914105,0.002408164,0.05981208,0.001928129,0.0006140316,0.0001227332,0.0002946873,0.0001215815,0.04328807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005920519,"threshold_uncertainty_score":0.01980615,"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","authors":[{"name":"Tanver Athar","is_ca":false},{"name":"Carl Barton","is_ca":false},{"name":"Widmer Bland","is_ca":true},{"name":"Jia Gao","is_ca":false},{"name":"Costas S. Iliopoulos","is_ca":false},{"name":"Chang Liu","is_ca":false},{"name":"Solon P. Pissis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332675,0.0006138643,0.001243804,0.001690329,0.001052302,0.001226335,0.001726554,0.001323757,0.009041062],"category_scores_gemma":[0.003172331,0.0003950075,0.0006648062,0.002612029,0.0006071407,0.002016514,0.002002171,0.0007320333,0.004945606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006653459,"about_ca_system_score_gemma":0.002100633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002360664,"about_ca_topic_score_gemma":0.002859093,"domain_scores_codex":[0.9987003,0.0001259859,0.0001371005,0.0003704172,0.0004687203,0.0001974594],"domain_scores_gemma":[0.9988153,0.000215366,0.0001003779,0.0004058318,0.0004059371,0.00005725498],"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.0007452284,0.0001572769,0.001629872,0.0002330939,0.00006469167,0.0002475636,0.0001822289,0.04857311,0.03394474,0.02199343,0.01837165,0.8738571],"study_design_scores_gemma":[0.0001416195,0.0001961409,0.0008286127,0.00002986947,0.00004357204,0.0009007254,0.0001360921,0.9020497,0.04987875,0.0226577,0.02308586,0.00005133835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01777829,0.0004175563,0.975575,0.0001496303,0.0001153006,0.0001180702,0.0003303722,0.002609281,0.002906424],"genre_scores_gemma":[0.1318658,0.0002731806,0.8584101,0.0001949428,0.00007188979,0.0001833588,0.001654634,0.0002632947,0.007082878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009041062,"threshold_uncertainty_score":0.03024542,"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","authors":[{"name":"Masahiro Hamano","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920888,0.0005058993,0.00081059,0.001415094,0.001950062,0.00290618,0.001211782,0.000975061,0.003177603],"category_scores_gemma":[0.004423598,0.0005722926,0.001772443,0.0008742061,0.005450482,0.008113058,0.005456324,0.003348596,0.0007093185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595653,"about_ca_system_score_gemma":0.001538022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008286316,"about_ca_topic_score_gemma":0.000857895,"domain_scores_codex":[0.9977382,0.000618203,0.000147287,0.0004125134,0.0007359087,0.0003479729],"domain_scores_gemma":[0.9971578,0.001228124,0.0001786555,0.0005546555,0.0007047522,0.0001759927],"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.0000267693,0.00003323925,0.0002951555,0.0001321677,0.00001518608,0.00007888996,0.0006049828,0.0007702148,0.001137535,0.9871663,0.0008819417,0.008857716],"study_design_scores_gemma":[0.00001851826,0.00003725638,0.0002818984,0.00002426329,0.00001952289,0.0001560354,0.0001345075,0.004441022,0.003864956,0.9831397,0.007864471,0.00001783055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1370133,0.001830186,0.7743413,0.004348694,0.0001884757,0.0001352862,0.0005241151,0.001241896,0.08037677],"genre_scores_gemma":[0.8543649,0.0006082155,0.1334654,0.001184962,0.0002272878,0.0002381986,0.0004009916,0.0001859747,0.009324094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003920888,"threshold_uncertainty_score":0.02073586,"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","authors":[{"name":"Robert Rosebrugh","is_ca":true},{"name":"N. Sabadini","is_ca":false},{"name":"R. F. C. Walters","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001888021,0.0003608472,0.0003478207,0.001471513,0.0008510752,0.001870258,0.000653034,0.0005158463,0.002641285],"category_scores_gemma":[0.002355112,0.0003010833,0.001075559,0.000772409,0.00310174,0.004216423,0.002699064,0.001169157,0.0004132643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007299609,"about_ca_system_score_gemma":0.0005906496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149124,"about_ca_topic_score_gemma":0.0009012003,"domain_scores_codex":[0.998282,0.0004343991,0.0001210506,0.0004880663,0.0004453988,0.0002291285],"domain_scores_gemma":[0.9986231,0.0005902452,0.0001472762,0.0001815675,0.0003386788,0.0001191484],"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.000034399,0.00001399369,0.0003062373,0.00006622019,0.00001331418,0.0001406784,0.000655324,0.001727891,0.00354415,0.9794545,0.0002968856,0.01374633],"study_design_scores_gemma":[0.000005455247,0.00004085128,0.0003024552,0.00001838751,0.00001459741,0.0002359049,0.0002239515,0.006186454,0.004236026,0.9793034,0.00941573,0.00001676838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1590314,0.001349734,0.8072295,0.0007093995,0.0001203306,0.00008443458,0.0001843538,0.0007563648,0.03053446],"genre_scores_gemma":[0.8492186,0.0006164968,0.1371313,0.0002965022,0.0001353307,0.0001449265,0.0003765507,0.0002514278,0.01182878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002641285,"threshold_uncertainty_score":0.00998491,"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","authors":[{"name":"Miklós Bartha","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891333,0.0006054969,0.0006843924,0.002483435,0.00340961,0.005006409,0.001523434,0.00162342,0.005326081],"category_scores_gemma":[0.004036754,0.0006389472,0.001220392,0.00164204,0.005795585,0.01079255,0.003709337,0.002784352,0.001395896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001828395,"about_ca_system_score_gemma":0.001607714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164139,"about_ca_topic_score_gemma":0.0007810244,"domain_scores_codex":[0.9979054,0.000496509,0.0002250039,0.00049243,0.0006298972,0.0002508606],"domain_scores_gemma":[0.9974769,0.0006787804,0.0002447185,0.0006269938,0.0007335203,0.0002390988],"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.000004102502,0.000005989062,0.00002743519,0.00001336368,0.000001809752,0.00002308011,0.0001676175,0.000143656,0.0003262059,0.9972782,0.0002501673,0.001758452],"study_design_scores_gemma":[0.00000551771,0.00001668091,0.00009269822,0.00001993875,0.000007569427,0.0000923961,0.0000914156,0.00356713,0.000942022,0.9816559,0.01349733,0.0000112453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07896654,0.003884729,0.7958537,0.003046852,0.0008970865,0.0002377902,0.0006891818,0.0008351099,0.1155891],"genre_scores_gemma":[0.8070214,0.001785654,0.1570129,0.0008646753,0.001137293,0.0004364442,0.0006610241,0.0002195078,0.03086112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005326081,"threshold_uncertainty_score":0.01781756,"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","authors":[{"name":"Helmut Jürgensen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984901,0.0005440538,0.001078054,0.003619869,0.003085204,0.008165647,0.001643717,0.002713202,0.004646964],"category_scores_gemma":[0.004906751,0.0004874678,0.001218666,0.003838806,0.01272278,0.0237209,0.003709679,0.002606597,0.0009217713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173741,"about_ca_system_score_gemma":0.001101918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009354713,"about_ca_topic_score_gemma":0.0007412699,"domain_scores_codex":[0.9975242,0.001042714,0.0002414967,0.0004759361,0.0005776283,0.0001379205],"domain_scores_gemma":[0.9961638,0.001739154,0.0004025915,0.0005655982,0.000712662,0.0004162038],"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.0000190644,0.000009636587,0.0002368139,0.00007009472,0.000008870987,0.00005800747,0.0007014832,0.0003443392,0.0002686711,0.9915316,0.001032309,0.005719045],"study_design_scores_gemma":[0.000004880439,0.00002066182,0.0001782253,0.0001228854,0.00001038581,0.0003031097,0.0006947502,0.001793552,0.0003761541,0.968347,0.02812977,0.00001859135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.06958122,0.03949166,0.8062606,0.02733555,0.002970061,0.00008074955,0.0004028335,0.0004138197,0.05346344],"genre_scores_gemma":[0.6904668,0.01484064,0.2731201,0.005242404,0.002573382,0.0002675333,0.000296461,0.00027448,0.01291823],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.008165647,"threshold_uncertainty_score":0.02636302,"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","authors":[{"name":"Andrew Cave","is_ca":true},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009516928,0.0009632413,0.0008441512,0.001785527,0.001980573,0.004831276,0.003610216,0.001590177,0.01033682],"category_scores_gemma":[0.03422511,0.001411271,0.002480687,0.001235307,0.008058869,0.0164899,0.009232184,0.005336737,0.003542899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002175174,"about_ca_system_score_gemma":0.00425095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002229724,"about_ca_topic_score_gemma":0.003123006,"domain_scores_codex":[0.9893882,0.004344708,0.0006540634,0.001415583,0.003446682,0.0007507142],"domain_scores_gemma":[0.978015,0.01234998,0.0008828022,0.006112135,0.002239979,0.0004000472],"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.0000382271,0.0000381056,0.0002354797,0.0002216842,0.00003435994,0.0001153227,0.0005717925,0.005201726,0.003087316,0.9635916,0.002653353,0.02421108],"study_design_scores_gemma":[0.00006084201,0.00005010582,0.0001891907,0.0001652166,0.00006971634,0.0002472913,0.0002101009,0.03175791,0.02164947,0.8977183,0.04779861,0.00008329944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005508752,0.0002297833,0.9823087,0.0008150069,0.0001440471,0.00009361524,0.0000933826,0.002904009,0.007902697],"genre_scores_gemma":[0.2205239,0.0006674721,0.7684695,0.0008590634,0.0001990097,0.0002575554,0.0003126419,0.001511237,0.007199651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01033682,"threshold_uncertainty_score":0.05033094,"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)","authors":[{"name":"Russell O’Connor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006428413,0.0008155214,0.0007669759,0.00236134,0.002943792,0.008227483,0.001987089,0.002127131,0.01484701],"category_scores_gemma":[0.01034416,0.0007456669,0.001923221,0.001602759,0.01002229,0.01591241,0.005444217,0.006820166,0.003768383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003130913,"about_ca_system_score_gemma":0.002395902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009603552,"about_ca_topic_score_gemma":0.001284631,"domain_scores_codex":[0.9959934,0.001837383,0.0001990888,0.0004288281,0.001283353,0.0002579604],"domain_scores_gemma":[0.9921812,0.00483606,0.0003671993,0.001528919,0.0008231406,0.0002634815],"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.000003137882,0.000002837821,0.00001450676,0.00001726295,0.000002332737,0.00001284275,0.00006733395,0.0001899171,0.0001075055,0.997134,0.0007166523,0.001731668],"study_design_scores_gemma":[0.000006872188,0.000004424418,0.00001656517,0.00002953732,0.000006488734,0.00003715311,0.00004047782,0.001727665,0.000469578,0.9711756,0.02647875,0.000006825735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005711808,0.002737944,0.9009383,0.01076819,0.0009799144,0.00005317309,0.000180644,0.000863495,0.07776657],"genre_scores_gemma":[0.3179715,0.004222214,0.6387163,0.004983349,0.002222848,0.0003598744,0.00037783,0.0008283724,0.03031764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01484701,"threshold_uncertainty_score":0.04966819,"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","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Jonathan Gallagher","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00143616,0.000256065,0.0004084337,0.001034053,0.001283385,0.003293144,0.001027179,0.0006108895,0.003507316],"category_scores_gemma":[0.00207191,0.0002431886,0.0006619721,0.0007260532,0.004925756,0.003889306,0.003656501,0.001427733,0.000429568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00273348,"about_ca_system_score_gemma":0.001083848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002054627,"about_ca_topic_score_gemma":0.001321647,"domain_scores_codex":[0.9983919,0.0003410176,0.00008695099,0.0002610863,0.0006993258,0.0002195784],"domain_scores_gemma":[0.9985334,0.0003775045,0.000117735,0.0002856651,0.0004324791,0.0002532809],"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.000005222344,0.000004059916,0.0001218512,0.000005788259,0.000001626924,0.00003717217,0.0001928702,0.0004136916,0.0002707227,0.9979253,0.0001296408,0.0008921127],"study_design_scores_gemma":[0.000008665069,0.00001153061,0.000186374,0.000007076784,0.00000477893,0.00006543654,0.0001255599,0.004643192,0.0005432182,0.9884112,0.005984477,0.000008542453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4886188,0.0008309874,0.3361453,0.002973304,0.000319359,0.00006440523,0.0004162498,0.0007253754,0.1699061],"genre_scores_gemma":[0.9790009,0.0001273568,0.01148243,0.0001806292,0.00007261771,0.00003116608,0.0001006652,0.00004071072,0.008963585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003507316,"threshold_uncertainty_score":0.01983291,"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","authors":[{"name":"Edwin Beggs","is_ca":false},{"name":"José Félix Costa","is_ca":false},{"name":"Diogo Poças","is_ca":true},{"name":"John V. Tucker","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007156924,0.001024853,0.001361676,0.00138648,0.001170157,0.005779107,0.002808598,0.002660012,0.007412585],"category_scores_gemma":[0.04086438,0.000652867,0.002134518,0.001669321,0.01194375,0.01872479,0.0040813,0.004338166,0.001227763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001881698,"about_ca_system_score_gemma":0.001026634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009954699,"about_ca_topic_score_gemma":0.0004622558,"domain_scores_codex":[0.9918358,0.00331843,0.0006276543,0.001846967,0.001620527,0.0007506597],"domain_scores_gemma":[0.9718071,0.01934159,0.001855996,0.005272413,0.001204811,0.0005179939],"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.00006323902,0.00001495586,0.0003571897,0.00009795949,0.0000192964,0.00006003485,0.0001340602,0.005386855,0.0005361227,0.9852926,0.0004683398,0.007569352],"study_design_scores_gemma":[0.00002112273,0.00004342444,0.000178904,0.00003833853,0.00002012918,0.00006228421,0.00004294081,0.03105824,0.001587437,0.9632868,0.003635019,0.00002538688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04392075,0.002304056,0.9247241,0.003532254,0.0004365628,0.0001827789,0.0003176295,0.0009739838,0.02360792],"genre_scores_gemma":[0.7323365,0.001681214,0.2552185,0.001496381,0.0006271079,0.0004044398,0.0003619522,0.0004168046,0.007457087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007412585,"threshold_uncertainty_score":0.0378499,"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","authors":[{"name":"Amy Felty","is_ca":true},{"name":"Carlos Olarte","is_ca":false},{"name":"Bruno Xavier","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428993,0.0003636253,0.0003315813,0.00276178,0.001226298,0.002910142,0.001450636,0.0008315595,0.003065377],"category_scores_gemma":[0.003627396,0.0005785928,0.001207106,0.00119402,0.004817334,0.003734352,0.002136175,0.002475704,0.0003442517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003716772,"about_ca_system_score_gemma":0.001493691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004397362,"about_ca_topic_score_gemma":0.003706719,"domain_scores_codex":[0.9981996,0.0008997333,0.0001089655,0.0002114416,0.0004150875,0.0001651814],"domain_scores_gemma":[0.9971101,0.001659151,0.0002279671,0.0003156184,0.0005583945,0.0001287477],"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.000004661804,0.000008340639,0.0000917135,0.0000161479,0.000006108792,0.00003547929,0.0001661097,0.0009779923,0.0003463199,0.9948631,0.0002748235,0.00320926],"study_design_scores_gemma":[0.00001367694,0.00001874285,0.0001159512,0.00003071025,0.00001346303,0.00005817509,0.0001201909,0.0174191,0.001368394,0.9744577,0.006371726,0.00001212688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02542656,0.0007852275,0.9451698,0.00247938,0.0000724921,0.00006624937,0.0001119479,0.0005389753,0.0253493],"genre_scores_gemma":[0.6431565,0.0006024413,0.3497004,0.0009305569,0.0001895588,0.000171331,0.0001488297,0.0001092838,0.004991088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004397362,"threshold_uncertainty_score":0.02696717,"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","authors":[{"name":"Luis Scoccola","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109457,0.0003329758,0.0005524918,0.002136106,0.001481154,0.002783623,0.0009520421,0.0008288397,0.00615934],"category_scores_gemma":[0.003265782,0.0003787774,0.0004332913,0.0009833331,0.005414295,0.007198278,0.003854836,0.002082933,0.0006318155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007325,"about_ca_system_score_gemma":0.0004199072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005594845,"about_ca_topic_score_gemma":0.0004629459,"domain_scores_codex":[0.9990966,0.0001810386,0.00005844107,0.0001857781,0.0003618477,0.0001162377],"domain_scores_gemma":[0.9978335,0.0009027643,0.0002192159,0.0002537373,0.0004742543,0.0003164987],"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.00001031694,0.000005226805,0.0004227906,0.00002329934,0.000003552534,0.00009856464,0.0003373433,0.0003821858,0.0007327001,0.995156,0.0002563621,0.002571622],"study_design_scores_gemma":[0.000005291504,0.00001463465,0.0004559368,0.00001831803,0.000004442138,0.0002679804,0.0003627757,0.002869377,0.0009951597,0.9913974,0.003595143,0.00001361835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5934108,0.001503154,0.3235554,0.002199249,0.000430534,0.00005863065,0.0002491687,0.0004462876,0.07814675],"genre_scores_gemma":[0.9755029,0.0003637206,0.0153951,0.0001963954,0.0001391556,0.00003695676,0.00008117181,0.00004765728,0.008236891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00615934,"threshold_uncertainty_score":0.02060503,"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","authors":[{"name":"Lankun Guo","is_ca":false},{"name":"Qingguo Li","is_ca":false},{"name":"Petko Valtchev","is_ca":true},{"name":"Yaping Lin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002882354,0.000543088,0.0006750933,0.002276282,0.0008174092,0.003357601,0.001218207,0.0008608699,0.002101658],"category_scores_gemma":[0.007066501,0.0003297538,0.001178497,0.001677407,0.002417571,0.004622174,0.002197783,0.001601063,0.0005384904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006542226,"about_ca_system_score_gemma":0.0009977054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001205623,"about_ca_topic_score_gemma":0.0008787756,"domain_scores_codex":[0.9963657,0.001498707,0.0004164438,0.000724853,0.0008273937,0.0001669089],"domain_scores_gemma":[0.9969008,0.001449479,0.0004643844,0.0005560446,0.000525784,0.0001035245],"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.00003395455,0.00002576331,0.000439827,0.000134899,0.00004591015,0.0002266684,0.0003898153,0.02183726,0.001366257,0.932273,0.0005135465,0.04271306],"study_design_scores_gemma":[0.00003471585,0.00004744606,0.0001953014,0.00008394049,0.00005550208,0.0002558416,0.0001575608,0.099136,0.001621288,0.8796202,0.01875102,0.00004112902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01329863,0.0006196196,0.9812305,0.000332397,0.00008186204,0.00008030909,0.0001482556,0.0002814479,0.003927033],"genre_scores_gemma":[0.3041135,0.001053584,0.6921084,0.0002241513,0.0001636868,0.0002603889,0.000433445,0.00003358762,0.001609181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003357601,"threshold_uncertainty_score":0.01524347,"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","authors":[{"name":"Jonathan P. Seldin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008877601,0.001026306,0.001248524,0.003650761,0.003909569,0.007840885,0.001953087,0.002283512,0.004482104],"category_scores_gemma":[0.006342629,0.001116293,0.002671551,0.005404616,0.01356044,0.01896104,0.005291602,0.006277784,0.001323421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005113234,"about_ca_system_score_gemma":0.002429549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003831502,"about_ca_topic_score_gemma":0.003098627,"domain_scores_codex":[0.993458,0.002887856,0.0004624101,0.0007432716,0.001844898,0.0006035659],"domain_scores_gemma":[0.995779,0.002441813,0.0004041259,0.0007487432,0.0004268115,0.0001994219],"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.000005066725,0.000002517944,0.00003271537,0.00001351293,0.000001776769,0.00002372968,0.0001783022,0.0001973385,0.0000872345,0.9979602,0.0002149407,0.001282814],"study_design_scores_gemma":[0.000008193322,0.000009775244,0.00006307885,0.00002865458,0.00000865838,0.00006735932,0.00006385741,0.001291479,0.0002803559,0.9830305,0.01513392,0.0000142106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02340215,0.01017282,0.8929442,0.004835552,0.0006946272,0.0001058985,0.0003556938,0.0004815276,0.06700746],"genre_scores_gemma":[0.4586712,0.01081482,0.4862491,0.003772497,0.002040963,0.0006700025,0.0007501303,0.0006298769,0.03640139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008877601,"threshold_uncertainty_score":0.0469498,"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","authors":[{"name":"Rahul Jain","is_ca":false},{"name":"Ashwin Nayak","is_ca":true},{"name":"Yi Su","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051651,0.001144074,0.002100806,0.003013579,0.001848859,0.00457606,0.002392097,0.002719501,0.003168472],"category_scores_gemma":[0.05573637,0.0007359364,0.001483489,0.001698327,0.008298883,0.01541449,0.008580101,0.006946463,0.0005288402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002136171,"about_ca_system_score_gemma":0.001050224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000419935,"about_ca_topic_score_gemma":0.0003217364,"domain_scores_codex":[0.9895527,0.003476695,0.0006024939,0.001657303,0.003931996,0.0007789095],"domain_scores_gemma":[0.9436826,0.04126565,0.003027822,0.006416651,0.003644309,0.001962993],"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.00003819676,0.00001490291,0.0003877826,0.00006600867,0.00001847739,0.00003967599,0.0001863904,0.00361243,0.0008455711,0.9899442,0.0004320837,0.004414386],"study_design_scores_gemma":[0.00000590513,0.00002917877,0.0002437963,0.0000310655,0.000006085564,0.00006358004,0.00002405543,0.02303119,0.0004267258,0.9752871,0.0008335629,0.0000177115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07981417,0.001764377,0.8909504,0.001937907,0.0002601285,0.00006255813,0.0003697636,0.0001648576,0.02467598],"genre_scores_gemma":[0.8926457,0.001178715,0.1003037,0.001321271,0.0008128719,0.000223485,0.000452229,0.0002343195,0.002827602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051651,"threshold_uncertainty_score":0.05561727,"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","authors":[{"name":"M. BARR","is_ca":false},{"name":"P. J. SCOTT","is_ca":false},{"name":"R. A. G. SEELY","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001799072,0.0009618793,0.0007401663,0.001530653,0.002798954,0.006349178,0.002140562,0.003330972,0.4934808],"category_scores_gemma":[0.008156225,0.0003988624,0.0007900535,0.001589075,0.00120965,0.004314282,0.003954699,0.003038011,0.3114487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003225972,"about_ca_system_score_gemma":0.003317451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005451754,"about_ca_topic_score_gemma":0.005947507,"domain_scores_codex":[0.997755,0.000301075,0.0001176145,0.000549251,0.0009176822,0.0003594169],"domain_scores_gemma":[0.9972039,0.0003788582,0.0001403734,0.0003087192,0.001375435,0.0005927479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001011745,0.00004031926,0.0006702218,0.000180492,0.00000668511,0.0001663069,0.0005310149,0.00006901158,0.0002275872,0.0368636,0.8679419,0.09320176],"study_design_scores_gemma":[0.000003214321,0.00001100744,0.0002420046,0.00007418052,0.00000122204,0.0000652516,0.0001078975,0.00001287044,0.00004868103,0.002340058,0.9970894,0.000004121044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.003006033,0.007995999,0.006060112,0.03062422,0.02234024,0.0004161431,0.01136376,0.001712255,0.9164811],"genre_scores_gemma":[0.01419069,0.004246505,0.002480661,0.01311704,0.00287153,0.0002757442,0.007655103,0.0005989102,0.9545639],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.4934808,"threshold_uncertainty_score":0.7224882,"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","authors":[{"name":"Peter Selinger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216041,0.001485193,0.002385444,0.005024501,0.00386777,0.009140741,0.001808641,0.003768078,0.09936874],"category_scores_gemma":[0.009694133,0.0009108898,0.002001758,0.004281071,0.002011723,0.01067475,0.003949747,0.007345389,0.02442564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002883837,"about_ca_system_score_gemma":0.002358039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008566223,"about_ca_topic_score_gemma":0.001515742,"domain_scores_codex":[0.9967778,0.0006136112,0.0003968577,0.0006897543,0.001193642,0.0003283316],"domain_scores_gemma":[0.9900805,0.004756861,0.0004771723,0.0009415199,0.002425211,0.00131868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002990532,0.00003599346,0.000107888,0.0002880846,0.00002033322,0.00008340797,0.0001022496,0.0001221393,0.0002610267,0.02225827,0.9494002,0.02729054],"study_design_scores_gemma":[0.0000106874,0.00001983849,0.0001909996,0.0001716737,0.00001082873,0.0001982976,0.00005188892,0.0002828629,0.0001129355,0.01419839,0.9847408,0.00001081235],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.001175649,0.0461196,0.01266554,0.08741899,0.7297337,0.0001705087,0.0009900875,0.0006830548,0.121043],"genre_scores_gemma":[0.008281519,0.02646605,0.00266201,0.01803986,0.7623315,0.0002106563,0.001625801,0.001258701,0.1791237],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.09936874,"threshold_uncertainty_score":0.3324215,"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","authors":[{"name":"Masahiro Hamano","is_ca":false},{"name":"Philip Scott","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145967,0.0005987027,0.0004923125,0.001924661,0.002057513,0.004513778,0.0011473,0.001092165,0.007617197],"category_scores_gemma":[0.001894735,0.0003991246,0.00128303,0.001194559,0.005327635,0.006790157,0.004872069,0.003184821,0.001114878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002859583,"about_ca_system_score_gemma":0.0008927542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002357816,"about_ca_topic_score_gemma":0.001080509,"domain_scores_codex":[0.9980398,0.0005944215,0.00006825747,0.0002892366,0.0006593723,0.0003488943],"domain_scores_gemma":[0.9988136,0.0004573089,0.0001300094,0.0001731395,0.0002324194,0.0001935071],"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.000005730238,0.000004297299,0.0000964377,0.000009655562,0.00000222556,0.00004289383,0.0002496589,0.0003925531,0.0003005319,0.9975399,0.0001731337,0.001182956],"study_design_scores_gemma":[0.00001029321,0.0000318008,0.0002768478,0.0000217859,0.00001028789,0.0001386195,0.0003255045,0.006702418,0.0007935716,0.9774593,0.01420816,0.00002137892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1286778,0.001853796,0.7008656,0.004504274,0.0002360384,0.0001499903,0.000570869,0.0007856402,0.1623559],"genre_scores_gemma":[0.9193246,0.0007794809,0.06208656,0.0008570839,0.0002303326,0.0002066146,0.0003627051,0.0002278511,0.01592473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007617197,"threshold_uncertainty_score":0.02548212,"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","authors":[{"name":"G. S. H. Cruttwell","is_ca":true},{"name":"Jonathan Gallagher","is_ca":false},{"name":"Jean-Simon Pacaud Lemay","is_ca":true},{"name":"Dorette Pronk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001262563,0.0004093777,0.0004013496,0.001717019,0.001211917,0.001971979,0.0008459211,0.0007892483,0.006150913],"category_scores_gemma":[0.002167278,0.0002792035,0.0006730465,0.001211441,0.003273826,0.003899169,0.003165368,0.001605258,0.000702938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001299839,"about_ca_system_score_gemma":0.0007381366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001625935,"about_ca_topic_score_gemma":0.0008387304,"domain_scores_codex":[0.9985387,0.000328485,0.0001029711,0.0003534916,0.0004793821,0.0001970234],"domain_scores_gemma":[0.9977201,0.0004811889,0.0002538711,0.0004801773,0.0008242399,0.0002404467],"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.0000082943,0.00000450599,0.0002182888,0.00001403132,0.000002681067,0.0000559022,0.0001508766,0.0003724737,0.0006187892,0.9952749,0.0004156098,0.002863632],"study_design_scores_gemma":[0.000009236787,0.00002783534,0.0004605281,0.0000264521,0.000009758514,0.000545127,0.0002338751,0.008417434,0.00163732,0.9577791,0.03083511,0.00001811382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2132626,0.001617905,0.6601012,0.00221612,0.0004399186,0.0001588404,0.001096088,0.001021297,0.1200861],"genre_scores_gemma":[0.9079389,0.0005217174,0.07025217,0.0006083246,0.0002151483,0.000111747,0.000564978,0.0001198751,0.01966707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006150913,"threshold_uncertainty_score":0.02057683,"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","authors":[{"name":"Damian Markham","is_ca":true},{"name":"Janet Anders","is_ca":false},{"name":"Michal Hajdušek","is_ca":false},{"name":"Vlatko Vedral","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009061805,0.000281368,0.0005217365,0.001158703,0.001123939,0.002431656,0.000871474,0.001048511,0.003673724],"category_scores_gemma":[0.0052157,0.0003158001,0.0004582161,0.0006657356,0.003598224,0.004226672,0.00186958,0.001135639,0.0003496715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000577674,"about_ca_system_score_gemma":0.0003712288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002244776,"about_ca_topic_score_gemma":0.0003033107,"domain_scores_codex":[0.9992746,0.0002373318,0.00003894176,0.00008847771,0.0002069824,0.0001536856],"domain_scores_gemma":[0.9954086,0.002403454,0.0005073454,0.001009027,0.0002920511,0.0003794402],"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.00003605283,0.00001354037,0.0002814455,0.00003885933,0.000006677644,0.00007995269,0.0001369379,0.004235285,0.003696257,0.9881639,0.0004079929,0.002902978],"study_design_scores_gemma":[0.00001888215,0.00002991183,0.0003221175,0.00001429865,0.000009258418,0.0001427751,0.0001419854,0.02514466,0.002671603,0.9691675,0.002317992,0.0000189766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7451177,0.0008801708,0.1947911,0.002932376,0.0001842171,0.00007395044,0.0002940125,0.0004458996,0.05528051],"genre_scores_gemma":[0.9795752,0.0001495407,0.01897339,0.00008444238,0.00005779708,0.00004528772,0.00005855365,0.00004155772,0.001014247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003673724,"threshold_uncertainty_score":0.01228988,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}