{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":805,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":805,"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":"09dbf0475f87","filters":{"topic":"Computability, Logic, AI Algorithms"}},"results":[{"id":"W2582697902","doi":"10.1007/978-0-387-49820-1","title":"An Introduction to Kolmogorov Complexity and Its Applications","year":2008,"lang":"en","type":"book","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1467,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; The Internet; Computer science; Hierarchical clustering; Genomics; Data science; Evolutionary biology; Artificial intelligence; World Wide Web; Biology; Genome; Genetics","authors":[{"name":"Ming Li","is_ca":true},{"name":"Paul Vitányi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03283127747495537,"gpt":0.2860018840093828,"spread":0.2531706065344274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023565,0.001404066,0.001584562,0.003928996,0.001093478,0.003071153,0.001112669,0.001539248,0.01877458],"category_scores_gemma":[0.003275761,0.0007202183,0.001151407,0.005063951,0.00317848,0.007528353,0.001725086,0.005691803,0.008553902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001752643,"about_ca_system_score_gemma":0.001186773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007815731,"about_ca_topic_score_gemma":0.0009874216,"domain_scores_codex":[0.9993712,0.00009830969,0.00005368648,0.0001065271,0.0003282053,0.00004201573],"domain_scores_gemma":[0.9976314,0.001842425,0.00008327734,0.0001269352,0.0002559685,0.00006000439],"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.00001230955,0.00004079924,0.0001730436,0.0007243013,0.0000196262,0.00007429304,0.0001965033,0.001671813,0.0005101517,0.7771453,0.1034317,0.1160002],"study_design_scores_gemma":[0.000004296653,0.00001380627,0.0002533145,0.0001958077,0.000008702925,0.000202763,0.00003918377,0.001220752,0.0001613993,0.7654557,0.2324248,0.00001953175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003172417,0.3134921,0.2093408,0.0165583,0.01046655,0.0001141635,0.00109179,0.001089342,0.4446745],"genre_scores_gemma":[0.1011437,0.369962,0.1937146,0.01251816,0.03305439,0.001000089,0.001562753,0.001147866,0.2858965],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01877458,"threshold_uncertainty_score":0.0628072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149852414","doi":"10.1080/03640210801897856","title":"The Tractable Cognition Thesis","year":2008,"lang":"en","type":"article","venue":"Cognitive Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":297,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Memorial University of Newfoundland; Technische Universiteit Eindhoven; Radboud Universiteit; University of Victoria","keywords":"Cognition; Cognitive science; Computational model; Argument (complex analysis); Computer science; Animal cognition; Constraint (computer-aided design); Artificial intelligence; Theoretical computer science; Psychology; Mathematics","authors":[{"name":"Iris van Rooij","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03316757706246389,"gpt":0.2618080005411066,"spread":0.2286404234786427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003720816,0.0006519305,0.0007812872,0.001354062,0.001900827,0.005603966,0.001487721,0.002151147,0.01024117],"category_scores_gemma":[0.01490714,0.0003501639,0.001936586,0.0009638425,0.0128418,0.01184187,0.003335734,0.004765621,0.001631645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003838979,"about_ca_system_score_gemma":0.002816672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002629736,"about_ca_topic_score_gemma":0.001239532,"domain_scores_codex":[0.9973196,0.0007376892,0.0001465891,0.000795292,0.0007150812,0.0002856764],"domain_scores_gemma":[0.9916113,0.005665557,0.0004533188,0.001187847,0.000785016,0.0002969894],"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.000004824943,0.00000440805,0.00007980772,0.00003084418,0.000006368281,0.00002478291,0.0001274193,0.0005591721,0.0000693439,0.9945855,0.001308068,0.003199497],"study_design_scores_gemma":[0.000004963631,0.000005108497,0.00008257924,0.00001441083,0.0000042137,0.0000392746,0.00003344426,0.001439148,0.00009839708,0.9905277,0.007745866,0.000004827987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.032997,0.005268664,0.6107234,0.04251373,0.000775263,0.0001732831,0.0006071061,0.0005576602,0.3063838],"genre_scores_gemma":[0.8789282,0.004250012,0.08420013,0.006130631,0.001467184,0.0004346218,0.0005335396,0.000257514,0.02379819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01024117,"threshold_uncertainty_score":0.03426015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3085332162","doi":"10.22148/001c.17212","title":"Can GPT-3 Pass a Writer’s Turing Test?","year":2020,"lang":"en","type":"article","venue":"Journal of Cultural Analytics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Turing test; Heuristic; Field (mathematics); Grammar; Test (biology); Artificial intelligence; Scale (ratio); Language model; Natural language processing; Natural language; Turing; Language identification; Programming language; Linguistics; Mathematics","authors":[{"name":"Katherine Elkins","is_ca":false},{"name":"Jon Chun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04380876233099833,"gpt":0.2608145662498129,"spread":0.2170058039188145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02406939,0.001593007,0.001454692,0.001354577,0.004158891,0.007674352,0.003408726,0.004879539,0.02701957],"category_scores_gemma":[0.1270535,0.000697776,0.001777639,0.001220152,0.007660642,0.01798639,0.005734114,0.008590098,0.03745231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002433242,"about_ca_system_score_gemma":0.005002933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002795217,"about_ca_topic_score_gemma":0.002339252,"domain_scores_codex":[0.9858576,0.00573923,0.0007556164,0.002436464,0.003993981,0.001217148],"domain_scores_gemma":[0.9410293,0.03246045,0.001184489,0.01137457,0.01095422,0.002997007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003141781,0.0001318508,0.00160174,0.0003354937,0.00009748532,0.0002603903,0.0007503344,0.00217276,0.0005613537,0.2166682,0.5968908,0.1802154],"study_design_scores_gemma":[0.0001388323,0.0002251583,0.0008551439,0.0004568344,0.00005579696,0.0004934738,0.0004926056,0.009401583,0.002623856,0.4408433,0.5442974,0.0001161065],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.02145346,0.01379599,0.2102687,0.5001205,0.02971779,0.0005170859,0.003859173,0.01559705,0.2046701],"genre_scores_gemma":[0.3295205,0.01292814,0.3311094,0.1180474,0.01346921,0.002467877,0.009113978,0.01431151,0.169032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02701957,"threshold_uncertainty_score":0.1272926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070787093","doi":"10.1145/1060710.1060716","title":"Scale-free geometry in OO programs","year":2005,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":198,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scale (ratio); Computer graphics (images); Geometry; Programming language; Engineering drawing; Mathematics; Engineering; Cartography; Geography","authors":[{"name":"Alex Potanin","is_ca":false},{"name":"James Noble","is_ca":false},{"name":"Marcus Frean","is_ca":false},{"name":"Robert Biddle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04378453855222991,"gpt":0.2895007338208802,"spread":0.2457161952686502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723019,0.0003029367,0.0003946142,0.000874771,0.00117984,0.002745453,0.0006883443,0.0009832573,0.003055897],"category_scores_gemma":[0.004420485,0.0005940355,0.0006113173,0.0008917595,0.005819786,0.005659862,0.002563112,0.001431571,0.0004672596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009744602,"about_ca_system_score_gemma":0.0004913185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001544714,"about_ca_topic_score_gemma":0.001031132,"domain_scores_codex":[0.9989864,0.0002154163,0.000066525,0.0002236483,0.0004017561,0.0001060905],"domain_scores_gemma":[0.9978524,0.00104457,0.0002229013,0.000506371,0.0002018202,0.0001719008],"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.00001580567,0.000007991568,0.0002702325,0.00003439952,0.000003621246,0.00009230502,0.0004101309,0.004264233,0.001277966,0.98461,0.0005364945,0.008476853],"study_design_scores_gemma":[0.00001688528,0.00002064612,0.0003547058,0.0000138696,0.000007139497,0.0001203221,0.000103208,0.01163066,0.001470195,0.9733782,0.0128708,0.00001329719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1601278,0.001233724,0.7793911,0.002053752,0.0001409035,0.00006539955,0.0001261362,0.001104244,0.05575692],"genre_scores_gemma":[0.8911488,0.0008315696,0.09494268,0.0003069697,0.0001940122,0.0001113954,0.000140045,0.0004007823,0.01192368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003055897,"threshold_uncertainty_score":0.01022303,"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":"W3209192400","doi":"10.1145/3485628","title":"MIP* = RE","year":2021,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":167,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Institute for Quantum Information and Matter, California Institute of Technology; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; Massachusetts Institute of Technology; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Class (philosophy); Computer science; Complexity class; Mathematical proof; Quantum entanglement; Theoretical computer science; Verifiable secret sharing; Quantum complexity theory; Decidability; Cryptography; Probabilistic logic; Computational complexity theory; Recursively enumerable language; Discrete mathematics; Quantum; Mathematics; Algorithm; Quantum computer; Programming language; Artificial intelligence","authors":[{"name":"Zhengfeng Ji","is_ca":false},{"name":"Anand Natarajan","is_ca":false},{"name":"Thomas Vidick","is_ca":false},{"name":"John C. Wright","is_ca":false},{"name":"Henry Yuen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0759074459117106,"gpt":0.3100415070347768,"spread":0.2341340611230662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999474,0.001171299,0.00097671,0.001079196,0.00238147,0.005638745,0.001750585,0.001728159,0.5023199],"category_scores_gemma":[0.003718757,0.0006412886,0.001140053,0.001366849,0.001204361,0.009665167,0.00476596,0.003215654,0.3637773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001685705,"about_ca_system_score_gemma":0.001439724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103844,"about_ca_topic_score_gemma":0.001757098,"domain_scores_codex":[0.9984766,0.0001941844,0.0001011269,0.0005430923,0.0003739125,0.0003111409],"domain_scores_gemma":[0.9985575,0.000199427,0.00009225259,0.0004904498,0.0004869511,0.0001734173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00024901,0.00006141877,0.0004681779,0.0003429764,0.00002746404,0.0003578659,0.0002179086,0.0002451073,0.001304528,0.1764693,0.7119474,0.1083088],"study_design_scores_gemma":[0.00001518915,0.00001586655,0.0001817811,0.00003885075,0.00000963443,0.0002874013,0.0001017762,0.0002410584,0.001247599,0.02031579,0.97753,0.00001511301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.00287904,0.0005022315,0.02870775,0.007255131,0.007278926,0.000330375,0.00977981,0.008806838,0.9344599],"genre_scores_gemma":[0.04833868,0.001135034,0.02029458,0.004826395,0.002190588,0.0004231195,0.01444112,0.00931953,0.899031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5023199,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2640088286","doi":"10.4018/978-1-5225-2255-3.ch010","title":"Artificial Intelligence Review","year":2017,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton","funders":"","keywords":"Turing test; Artificial intelligence; Computer science; Fuzzy logic; Artificial Intelligence System; Applications of artificial intelligence; Artificial neural network; Cover (algebra); Machine learning; Engineering","authors":[{"name":"Amal Kilani","is_ca":false},{"name":"Ahmed Ben Hamida","is_ca":false},{"name":"Habib Hamam","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06276968317688227,"gpt":0.3042134384574336,"spread":0.2414437552805513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009322619,0.0009732562,0.0009878742,0.004759051,0.001012655,0.004165647,0.001777574,0.001900099,0.04924346],"category_scores_gemma":[0.003106835,0.000378563,0.0007092532,0.006384747,0.001276647,0.003757209,0.001665461,0.002549969,0.02786427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002526582,"about_ca_system_score_gemma":0.002360893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001995979,"about_ca_topic_score_gemma":0.002837435,"domain_scores_codex":[0.9991136,0.0001644422,0.00008284094,0.0001599596,0.0004083365,0.00007081586],"domain_scores_gemma":[0.998478,0.000797692,0.00007196074,0.0001199536,0.0004367165,0.00009566136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002422717,0.00004409548,0.0001974608,0.004211358,0.00004137523,0.0001940893,0.0002787872,0.0006704815,0.0003959328,0.0791003,0.420152,0.4946899],"study_design_scores_gemma":[0.000001205239,0.000005505794,0.0001124023,0.0007645865,0.000004965132,0.000203693,0.00003436769,0.00004042266,0.00004209417,0.006421411,0.9923649,0.000004445964],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0005110622,0.842267,0.003028963,0.008257228,0.00589173,0.00003652656,0.0003509499,0.0001377595,0.1395188],"genre_scores_gemma":[0.006920723,0.8893019,0.004065873,0.006880024,0.005419799,0.00007429855,0.0008677956,0.0001425762,0.086327],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.04924346,"threshold_uncertainty_score":0.1647358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077525424","doi":"10.1016/j.tcs.2009.02.023","title":"On the similarity metric and the distance metric","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Division of Mathematical Sciences; National University of Singapore","keywords":"Metric (unit); Similarity (geometry); Mathematics; String metric; Measure (data warehouse); Fisher information metric; Metric space; Equivalence of metrics; Convex metric space; Discrete mathematics; Artificial intelligence; Computer science; Data mining; Image (mathematics)","authors":[{"name":"Shihyen Chen","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Kaizhong Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01072900924257724,"gpt":0.2432926968346178,"spread":0.2325636875920406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00540539,0.001113589,0.001802843,0.005258288,0.002140143,0.00491518,0.00238135,0.003835793,0.005255201],"category_scores_gemma":[0.03098715,0.000858757,0.001360026,0.007168953,0.008810005,0.02189553,0.005965634,0.004614572,0.00123374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002330721,"about_ca_system_score_gemma":0.001025475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002166518,"about_ca_topic_score_gemma":0.001079237,"domain_scores_codex":[0.9940065,0.002681767,0.0004896652,0.001048206,0.00152076,0.0002531588],"domain_scores_gemma":[0.9810619,0.01312816,0.001052296,0.002139559,0.00203272,0.0005853337],"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.00001943297,0.000007101019,0.0001765345,0.0000507328,0.00001120963,0.00003271528,0.0001228497,0.001423508,0.0001768541,0.9853908,0.001262547,0.01132573],"study_design_scores_gemma":[0.0000047072,0.0000144046,0.0001212162,0.00002512139,0.000007376764,0.00007345388,0.00003852878,0.00555686,0.00009606339,0.9873863,0.006663509,0.00001243275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03210872,0.0219803,0.8826845,0.009421506,0.001147182,0.0000716135,0.0003172877,0.0001293943,0.05213948],"genre_scores_gemma":[0.5836945,0.0236038,0.3570256,0.002846043,0.004805563,0.0004196988,0.00124731,0.0003329702,0.02602441],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00540539,"threshold_uncertainty_score":0.0285868,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206167679","doi":"10.1007/978-0-387-21652-2","title":"Computational Excursions in Analysis and Number Theory","year":2002,"lang":"en","type":"book","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; History","authors":[{"name":"Peter Borwein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0142509091236419,"gpt":0.2467933484572351,"spread":0.2325424393335932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006013752,0.00104898,0.000859348,0.001605415,0.001197541,0.003488282,0.001254768,0.0007148791,0.01475203],"category_scores_gemma":[0.003386856,0.0004004509,0.0004912738,0.002489872,0.004620715,0.007847762,0.001210029,0.003984042,0.005423422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001516201,"about_ca_system_score_gemma":0.0006634523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006313262,"about_ca_topic_score_gemma":0.001077554,"domain_scores_codex":[0.9995078,0.0001263583,0.00002435632,0.00006374176,0.0002507216,0.00002716183],"domain_scores_gemma":[0.9985343,0.000971196,0.00004968653,0.0002006326,0.0001955104,0.0000487974],"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.00001009684,0.000008206743,0.00002408652,0.00007776768,0.000003715973,0.00001571822,0.0001105452,0.0004683014,0.0001121265,0.9257487,0.04066177,0.03275909],"study_design_scores_gemma":[0.000005111588,0.000005709201,0.0000604267,0.00004570688,0.000005109745,0.00007345474,0.00003769895,0.001600862,0.0001533494,0.779438,0.2185697,0.000004945295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.003253971,0.04722164,0.1491907,0.009387862,0.006335433,0.00005886686,0.0001458504,0.0004832819,0.7839225],"genre_scores_gemma":[0.0914356,0.04168684,0.08635734,0.003219552,0.009113196,0.0003159288,0.0003802195,0.0007466274,0.7667447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01475203,"threshold_uncertainty_score":0.04935044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084748398","doi":"10.1038/nmeth.3335","title":"Bayes' theorem","year":2015,"lang":"en","type":"article","venue":"Nature Methods","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Bayes' theorem; Computer science; Computational biology; Biology; Bayesian probability; Artificial intelligence","authors":[{"name":"Jorge López Puga","is_ca":false},{"name":"Martin Krzywinski","is_ca":true},{"name":"Naomi Altman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04076569988103329,"gpt":0.4012698471811063,"spread":0.360504147300073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009480173,0.001227086,0.002542711,0.00439625,0.001339828,0.005517151,0.001762115,0.002911125,0.01842938],"category_scores_gemma":[0.04183533,0.000842182,0.001367211,0.002387413,0.004144007,0.005286642,0.00149956,0.00452754,0.006832896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001587383,"about_ca_system_score_gemma":0.00185001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621176,"about_ca_topic_score_gemma":0.001171169,"domain_scores_codex":[0.992731,0.002566084,0.0003639081,0.001280985,0.002811605,0.000246379],"domain_scores_gemma":[0.9854408,0.01109027,0.0004016204,0.001245282,0.001644795,0.0001772917],"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.000011592,0.00001116763,0.0003611717,0.0001563393,0.00005829107,0.00005041464,0.00007827092,0.0008733352,0.0000885723,0.9507054,0.007827578,0.03977782],"study_design_scores_gemma":[0.00001152116,0.000005291718,0.0001770437,0.00008244527,0.00002349217,0.0001040642,0.00001691948,0.003195486,0.0001069862,0.982119,0.01414962,0.000008228129],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004065277,0.01417092,0.8053573,0.0112597,0.002952789,0.000169148,0.0009279231,0.000338802,0.1607582],"genre_scores_gemma":[0.429798,0.03109756,0.4147344,0.01212326,0.01737705,0.001271569,0.001489896,0.0004229294,0.09168525],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01842938,"threshold_uncertainty_score":0.06165236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281750406","doi":"10.1016/j.tics.2022.04.008","title":"The strength of weak integrated information theory","year":2022,"lang":"en","type":"review","venue":"Trends in Cognitive Sciences","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research","funders":"Wellcome Trust","keywords":"Psychology; Cognitive psychology; Cognitive science","authors":[{"name":"Pedro A. M. Mediano","is_ca":false},{"name":"Fernando E. Rosas","is_ca":false},{"name":"Daniel Bor","is_ca":false},{"name":"Anil K. Seth","is_ca":true},{"name":"Adam B. Barrett","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1708924704806185,"gpt":0.410785035889401,"spread":0.2398925654087825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01008022,0.001324298,0.003028851,0.00340258,0.003570008,0.008454536,0.003583611,0.004810214,0.008719458],"category_scores_gemma":[0.02694306,0.0009823649,0.002206218,0.002440257,0.02277095,0.02292132,0.008250779,0.01240231,0.002243785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0045093,"about_ca_system_score_gemma":0.003968553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00324304,"about_ca_topic_score_gemma":0.0009735345,"domain_scores_codex":[0.9905456,0.003641564,0.0005687434,0.001515724,0.003146565,0.0005817094],"domain_scores_gemma":[0.9815302,0.0120379,0.0007294654,0.002315094,0.002816503,0.0005708092],"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.000008319491,0.000004763319,0.0000649319,0.00004491323,0.00001213941,0.00001943587,0.00009454657,0.0002427343,0.00003549938,0.9960837,0.0009647576,0.002424195],"study_design_scores_gemma":[0.000005527907,0.000005680621,0.00002753144,0.00002239191,0.0000046742,0.0000204442,0.00001901327,0.0006845152,0.00005005232,0.9942197,0.00493336,0.000007215961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.01585202,0.02863265,0.5574392,0.04477056,0.005022642,0.0002332134,0.0006319767,0.0004014702,0.3470163],"genre_scores_gemma":[0.7459704,0.02072423,0.1515509,0.02272205,0.009091181,0.0009463818,0.0005311911,0.0005437102,0.04791998],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.01008022,"threshold_uncertainty_score":0.05330992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069661173","doi":"10.1103/physrevlett.111.130505","title":"Experimental Determination of Ramsey Numbers","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computation; Ramsey's theorem; Adiabatic process; Order (exchange); Quantum computer; Adiabatic quantum computation; Qubit; Ramsey theory; Statistical physics; Quantum; Computer science; Physics; Quantum mechanics; Algorithm; Mathematics; Discrete mathematics","authors":[{"name":"Zhengbing Bian","is_ca":true},{"name":"Fabián A. Chudak","is_ca":true},{"name":"William G. Macready","is_ca":true},{"name":"Lane Clark","is_ca":false},{"name":"Frank Gaitan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01782741193160744,"gpt":0.2971551657201182,"spread":0.2793277537885108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700726,0.0003391116,0.0002198387,0.0004536866,0.0007267506,0.0005057693,0.0009420342,0.0007161034,0.005746968],"category_scores_gemma":[0.003556764,0.0002441886,0.0001331718,0.0005752167,0.001078274,0.0009883948,0.0006714807,0.001250174,0.0006884988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004476676,"about_ca_system_score_gemma":0.0002869142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005211177,"about_ca_topic_score_gemma":0.0007395691,"domain_scores_codex":[0.9991762,0.00017079,0.0000357042,0.0001875679,0.0003161273,0.0001135535],"domain_scores_gemma":[0.9976388,0.001304469,0.0001991518,0.0004180733,0.0003600266,0.00007944211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006165028,0.0007319296,0.005704558,0.0003791259,0.00005389002,0.0002246424,0.0005076154,0.007038431,0.892287,0.06392668,0.003646373,0.0248831],"study_design_scores_gemma":[0.00007791707,0.0005075022,0.003689686,0.00003536506,0.00002325265,0.0001619058,0.0001623836,0.02730766,0.9514226,0.00697756,0.009575338,0.00005892571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9369715,0.0006564289,0.03058167,0.0004716133,0.0001536515,0.00007617698,0.0008008439,0.0006063161,0.02968168],"genre_scores_gemma":[0.9801154,0.0001983525,0.01717668,0.00008133674,0.00001772767,0.00009330979,0.0003887218,0.0000937946,0.001834616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005746968,"threshold_uncertainty_score":0.01922548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101694047","doi":"10.5555/644108.644253","title":"The similarity metric","year":2003,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Bioinformatics Solutions (Canada); University of Waterloo","funders":"","keywords":"Metric (unit); Similarity (geometry); Class (philosophy); Computer science; Theoretical computer science; Tree (set theory); Metric space; Declaration; Mathematics; Artificial intelligence; Discrete mathematics; Combinatorics; Programming language","authors":[{"name":"Ming Li","is_ca":true},{"name":"Xin Chen","is_ca":false},{"name":"Xin Li","is_ca":true},{"name":"Bin Ma","is_ca":true},{"name":"Paul Vitányi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01216355382483211,"gpt":0.1926145650503548,"spread":0.1804510112255227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003358136,0.001391903,0.001629332,0.007021324,0.00175081,0.005967382,0.002657877,0.002797659,0.005436026],"category_scores_gemma":[0.02185469,0.0004743478,0.001348804,0.006406176,0.004010842,0.01294837,0.004357489,0.002487624,0.002495437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002241409,"about_ca_system_score_gemma":0.001407098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008084814,"about_ca_topic_score_gemma":0.0004987586,"domain_scores_codex":[0.9895583,0.002927375,0.001355726,0.002432649,0.00338744,0.0003384668],"domain_scores_gemma":[0.9903715,0.004296718,0.001018004,0.002044295,0.001741763,0.0005276278],"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.00008603358,0.00004873341,0.002142276,0.0006354045,0.0001350864,0.0001978624,0.0004375968,0.008945958,0.003951407,0.8154964,0.00941837,0.1585049],"study_design_scores_gemma":[0.0000203221,0.0002003431,0.00160046,0.0001782575,0.00007464665,0.001377837,0.0002822947,0.04230373,0.003143461,0.8451907,0.1055369,0.00009116291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01713833,0.008178226,0.9406647,0.001666091,0.0007176794,0.000274634,0.001248737,0.0004941135,0.02961747],"genre_scores_gemma":[0.4090589,0.007961843,0.5607309,0.001379951,0.001695126,0.001164274,0.00377163,0.0005252091,0.01371208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007021324,"threshold_uncertainty_score":0.01818532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1809268447","doi":"10.1090/s0894-0347-05-00516-3","title":"Non-computable Julia sets","year":2005,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computable analysis; Julia set; Computability; Computable number; Quadratic equation; Computable function; Point (geometry); Pure mathematics; Algebra over a field; Discrete mathematics; Geometry","authors":[{"name":"Mark Braverman","is_ca":true},{"name":"Michael Yampolsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01213936361503018,"gpt":0.2661813547541859,"spread":0.2540419911391558,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151407,0.0005170489,0.0008898654,0.0009136147,0.001956315,0.004819165,0.001260436,0.0008228889,0.008288203],"category_scores_gemma":[0.01073295,0.000393666,0.0009760258,0.0007670819,0.005249396,0.00776274,0.00450663,0.004670459,0.0008453808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001864321,"about_ca_system_score_gemma":0.001194309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006560264,"about_ca_topic_score_gemma":0.0005757701,"domain_scores_codex":[0.997856,0.0003444367,0.0001077695,0.0004324784,0.0008374072,0.0004218715],"domain_scores_gemma":[0.9934492,0.00364367,0.000399461,0.001118932,0.000833686,0.0005551049],"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.00001621313,0.00001141034,0.0001165748,0.00002613107,0.000002165707,0.0000303769,0.0001128745,0.0006894923,0.0005161958,0.9970412,0.0002950069,0.001142315],"study_design_scores_gemma":[0.00001634178,0.00001779906,0.0001289197,0.00001443013,0.00000535274,0.00008143298,0.000101194,0.01242258,0.00205962,0.9809373,0.004203063,0.00001211226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4012617,0.00100091,0.4075201,0.004664079,0.0005049288,0.0001696478,0.0003536028,0.0004949506,0.1840301],"genre_scores_gemma":[0.9282643,0.0003763652,0.04097047,0.0003224944,0.0001848545,0.0001485029,0.0001891305,0.0001070049,0.02943696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008288203,"threshold_uncertainty_score":0.02772683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177980858","doi":"10.1007/s00037-008-0250-4","title":"Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems","year":2008,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gas meter prover; Mathematics; Discrete mathematics; XOR gate; Function (biology); Repetition (rhetorical device); Class (philosophy); Automated theorem proving; Computer science; Algorithm; Mathematical proof","authors":[{"name":"Richard Cleve","is_ca":true},{"name":"William Slofstra","is_ca":false},{"name":"Falk Unger","is_ca":false},{"name":"Sarvagya Upadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1007173327167769,"gpt":0.293439077805599,"spread":0.1927217450888221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003502541,0.0007409712,0.001474435,0.001393357,0.00240285,0.00413699,0.002851932,0.001856896,0.01238805],"category_scores_gemma":[0.01534779,0.0008859421,0.0016582,0.001314375,0.004539302,0.01103463,0.004476354,0.004463421,0.001493072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002360082,"about_ca_system_score_gemma":0.002911421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001097744,"about_ca_topic_score_gemma":0.001067659,"domain_scores_codex":[0.996204,0.0009900871,0.0002403931,0.000640652,0.001455333,0.0004695842],"domain_scores_gemma":[0.9855462,0.009563534,0.000758181,0.00257783,0.001141749,0.0004124728],"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.00009860165,0.00002896813,0.0001641562,0.00006823674,0.00002332566,0.00006023881,0.0001153654,0.004728136,0.0008538174,0.9847312,0.001818831,0.007309191],"study_design_scores_gemma":[0.00002472722,0.00001175618,0.00005419712,0.000008053962,0.0000111141,0.00003568841,0.00001230831,0.01786794,0.0007999567,0.9802403,0.0009231972,0.00001076774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1533002,0.001177595,0.7269093,0.006369153,0.0004799441,0.0003366054,0.0007803764,0.001268913,0.1093778],"genre_scores_gemma":[0.8887812,0.0007139691,0.09043293,0.001099489,0.0006885271,0.0003914215,0.000449613,0.00031352,0.01712936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01238805,"threshold_uncertainty_score":0.04144216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036937896","doi":"10.3138/cjfs.26.2.br2","title":"What Algorithms Want: Imagination in the Age of Computing","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Film Studies","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Aesthetics; Algorithm; Art","authors":[{"name":"Jonathan Cohn","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06182993158240879,"gpt":0.3245648491938231,"spread":0.2627349176114143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004866731,0.0005245541,0.0004470654,0.001243069,0.00592172,0.01345833,0.001039525,0.003790008,0.006679683],"category_scores_gemma":[0.01683939,0.0003071258,0.0003150372,0.001061201,0.03794096,0.02493863,0.002772985,0.008242047,0.0008159913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004750265,"about_ca_system_score_gemma":0.002815644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01295687,"about_ca_topic_score_gemma":0.009225748,"domain_scores_codex":[0.9976255,0.00161329,0.00004922358,0.0001690707,0.0003317242,0.0002112132],"domain_scores_gemma":[0.9903977,0.007035043,0.0002292561,0.0005357036,0.0009521468,0.0008500902],"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.00004369589,0.00001319599,0.0003021093,0.00007689703,0.000005347877,0.00007984489,0.03374262,0.0001630791,0.000235796,0.9431584,0.01480852,0.007370592],"study_design_scores_gemma":[0.00001758977,0.00001333401,0.000252475,0.0001457476,0.000005644161,0.000100359,0.02645818,0.0005752618,0.0002026897,0.8116096,0.1606029,0.00001629398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05274497,0.03879739,0.02281568,0.4189024,0.002921735,0.00003896494,0.0002380965,0.0001264643,0.4634145],"genre_scores_gemma":[0.954762,0.01050377,0.005989261,0.008791339,0.001220679,0.00003176992,0.00007637424,0.0001443031,0.01848055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345833,"threshold_uncertainty_score":0.03446573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232449914","doi":"10.1007/978-1-4939-7131-2_100376","title":"Factorization Machines","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Factorization; Algorithm","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02336337479344803,"gpt":0.236053066052135,"spread":0.212689691258687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003565865,0.001077097,0.0007520947,0.001220011,0.001650994,0.003243388,0.001183955,0.001171453,0.1024763],"category_scores_gemma":[0.001530521,0.0005325883,0.0007767336,0.001583823,0.001719158,0.00690665,0.001760103,0.002280003,0.0475318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366387,"about_ca_system_score_gemma":0.0009226851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001001349,"about_ca_topic_score_gemma":0.001480029,"domain_scores_codex":[0.9995028,0.00007369715,0.0000188011,0.0001887178,0.000149463,0.00006651966],"domain_scores_gemma":[0.9996898,0.00009141328,0.00001293383,0.0001042346,0.0000719632,0.0000296434],"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.00003136345,0.00002087663,0.00005405981,0.0001858546,0.000008805711,0.00002716492,0.0001247323,0.0009345243,0.0008466929,0.7638729,0.08934403,0.144549],"study_design_scores_gemma":[0.000007035128,0.000009257384,0.00009442739,0.00009122492,0.000007131993,0.0001072918,0.00004816508,0.002708764,0.0009782467,0.6307011,0.3652364,0.00001095668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.003517228,0.008094512,0.2176624,0.003539934,0.001748004,0.0001098051,0.00128901,0.002280639,0.7617585],"genre_scores_gemma":[0.1166352,0.009917339,0.1497476,0.001614235,0.001962249,0.0002787122,0.004909383,0.001182582,0.7137527],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1024763,"threshold_uncertainty_score":0.3428172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094663018","doi":"10.1145/1024922.1024924","title":"Abstract versus concrete computation on metric partial algebras","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":70,"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":"Mathematics; Nondeterministic algorithm; Computation; Converse; Equivalence (formal languages); Discrete mathematics; Countable set; Model of computation; Metric (unit); Algebra over a field; Pure mathematics; Algorithm","authors":[{"name":"John V. Tucker","is_ca":false},{"name":"J. I. Zucker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04956502520449148,"gpt":0.2997099780135482,"spread":0.2501449528090567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500701,0.0006886379,0.0006758209,0.0008424095,0.001047456,0.003344622,0.001115577,0.001075356,0.004568908],"category_scores_gemma":[0.004131715,0.000364185,0.00153096,0.001040206,0.004612661,0.009692471,0.002689121,0.00271718,0.0007271681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002280406,"about_ca_system_score_gemma":0.001403202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176479,"about_ca_topic_score_gemma":0.001061991,"domain_scores_codex":[0.9975994,0.0007847347,0.0001437524,0.0003431844,0.000870146,0.0002587037],"domain_scores_gemma":[0.9980094,0.0006960559,0.0002252386,0.0004186232,0.0004155224,0.0002351962],"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.000006757753,0.000004682008,0.00004328422,0.00001987719,0.000003429938,0.00001499142,0.00006649708,0.00302202,0.0003742072,0.9954,0.0001100981,0.0009343615],"study_design_scores_gemma":[0.000007379941,0.00002524778,0.00006181766,0.00001794527,0.000008364083,0.00003832255,0.00005488563,0.04271031,0.001085575,0.9526744,0.003299499,0.00001634447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09368134,0.0007390251,0.8711662,0.001328754,0.0001512489,0.00006966451,0.0002592441,0.0006952404,0.03190925],"genre_scores_gemma":[0.8669272,0.000742965,0.1206333,0.0003697016,0.0002083557,0.0001556166,0.000334689,0.0002153151,0.01041286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004568908,"threshold_uncertainty_score":0.01654553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1574394872","doi":"10.1090/surv/086","title":"Number Theoretic Density and Logical Limit Laws","year":2000,"lang":"en","type":"book","venue":"Mathematical surveys and monographs","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Limit (mathematics); Mathematics; Mathematical economics; Law; Calculus (dental); Theoretical physics; Statistical physics; Physics; Political science; Mathematical analysis","authors":[{"name":"Stanley Burris","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02063753444790398,"gpt":0.2376826594167222,"spread":0.2170451249688183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008085238,0.0005166075,0.0005401856,0.002164022,0.001256626,0.003443452,0.0008374306,0.0007667412,0.005623726],"category_scores_gemma":[0.003508685,0.0003451517,0.0004389451,0.002621963,0.003983467,0.007806288,0.001070507,0.002212955,0.001143016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003100621,"about_ca_system_score_gemma":0.0008613084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001599515,"about_ca_topic_score_gemma":0.001084161,"domain_scores_codex":[0.9995266,0.000136003,0.00002277649,0.00008982523,0.0001921577,0.00003261154],"domain_scores_gemma":[0.9987746,0.0007988778,0.00006525406,0.00009213662,0.0002188191,0.00005029716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[8.753487e-7,0.000002145618,0.00002161293,0.00001818045,8.353942e-7,0.000005229062,0.00004109761,0.0002179318,0.00003260991,0.9948248,0.00178941,0.003045362],"study_design_scores_gemma":[0.00000112617,0.000002070032,0.00008278024,0.00001337348,0.000001563684,0.00002348598,0.00002393607,0.0009787716,0.00004227251,0.9872432,0.01158516,0.000002147834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0404791,0.07124295,0.2179996,0.015925,0.001070028,0.00007593108,0.0005397185,0.0003204791,0.6523471],"genre_scores_gemma":[0.714725,0.03783521,0.07458429,0.002722392,0.003997013,0.0003764165,0.0006785144,0.0002021076,0.1648791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005623726,"threshold_uncertainty_score":0.02249664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2977793662","doi":"","title":"Computing over the Reals: Foundations for Scientific Computing","year":2005,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":65,"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":"Computability; Computer science; Turing machine; Turing; Theoretical computer science; Model of computation; Computation; Algebra over a field; Discrete mathematics; Programming language; Mathematics; Pure mathematics","authors":[{"name":"Mark Braverman","is_ca":false},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05101728491683192,"gpt":0.3217880068180046,"spread":0.2707707219011726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004961619,0.001163262,0.002032534,0.003275804,0.002772646,0.01073964,0.002227461,0.004060729,0.004824831],"category_scores_gemma":[0.01733189,0.0009333387,0.001680039,0.005483077,0.01325193,0.01922818,0.00359328,0.009074942,0.001697677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003576085,"about_ca_system_score_gemma":0.003302452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003410726,"about_ca_topic_score_gemma":0.001641006,"domain_scores_codex":[0.9972711,0.0008610818,0.0001883956,0.0005291528,0.0009356592,0.0002145871],"domain_scores_gemma":[0.9898911,0.006897594,0.0004364905,0.001249567,0.001022081,0.0005032772],"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.00000592369,0.000007708777,0.00005319609,0.00007702447,0.00000568189,0.0000139653,0.00006371275,0.001180277,0.00006190961,0.9918315,0.001672097,0.005027051],"study_design_scores_gemma":[0.000002802188,0.000001496035,0.00002520068,0.00001870546,0.000001807877,0.000008435834,0.00001186317,0.002031169,0.00001953587,0.9919253,0.005949341,0.000004267565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009807351,0.1128353,0.7277579,0.0419733,0.002821092,0.0001001978,0.0006724194,0.0006234279,0.103409],"genre_scores_gemma":[0.5798489,0.08609799,0.2956537,0.006229086,0.01652854,0.0004507539,0.0009327385,0.0004450133,0.01381318],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01073964,"threshold_uncertainty_score":0.02623987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076087052","doi":"10.1016/j.tcs.2006.05.021","title":"Approximating and computing behavioural distances in probabilistic transition systems","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Functor; Probabilistic logic; Mathematics; Equivalence (formal languages); Metric (unit); Probability measure; Discrete mathematics; Statistics","authors":[{"name":"Franck van Breugel","is_ca":true},{"name":"James Worrell","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01054023630763494,"gpt":0.2271227122498332,"spread":0.2165824759421983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004096812,0.0009967866,0.001689363,0.002100638,0.001045432,0.002779595,0.003627141,0.001887471,0.002105734],"category_scores_gemma":[0.04278799,0.001113195,0.001050271,0.001985559,0.003257386,0.007296672,0.00428427,0.003807474,0.0002402465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003542332,"about_ca_system_score_gemma":0.001581588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00864256,"about_ca_topic_score_gemma":0.009254638,"domain_scores_codex":[0.9967115,0.001101148,0.0002516242,0.0007674994,0.0008267607,0.0003414446],"domain_scores_gemma":[0.9503695,0.04275749,0.001828152,0.002458025,0.001461458,0.001125391],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005173429,0.0001401023,0.006277001,0.000179285,0.00006618274,0.00007627516,0.0005622043,0.8216602,0.001562725,0.119903,0.0005044698,0.04855128],"study_design_scores_gemma":[0.00001334731,0.00003073193,0.0003163675,0.00000766408,0.00001097087,0.00001551603,0.00004929126,0.8873317,0.0005336853,0.1115352,0.0001469075,0.000008672556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3046521,0.0003299071,0.6922261,0.0005802286,0.00003992646,0.00004977892,0.0001831929,0.0007231806,0.001215595],"genre_scores_gemma":[0.8992913,0.0001533479,0.09891715,0.0000727322,0.0000465388,0.00006094711,0.0003418681,0.0001061033,0.001010085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00864256,"threshold_uncertainty_score":0.02570152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016571584","doi":"10.1109/access.2014.2332333","title":"Cognitive Control: Theory and Application","year":2014,"lang":"en","type":"article","venue":"IEEE Access","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":62,"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":"Computer science; Controller (irrigation); Cognition; Reinforcement learning; Dynamic programming; Convergence (economics); Artificial intelligence; Optimal control; Cognitive architecture; Cognitive model; Machine learning; Mathematical optimization; Algorithm; Mathematics","authors":[{"name":"Mehdi Fatemi","is_ca":true},{"name":"S. Haykin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01305018456387604,"gpt":0.2911354432234913,"spread":0.2780852586596153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082629,0.0008971756,0.0008465346,0.001640562,0.0007067911,0.003258792,0.001440374,0.002223504,0.00540265],"category_scores_gemma":[0.004688967,0.0003085986,0.0007954229,0.001841228,0.004655296,0.00265593,0.001441804,0.002141254,0.0006833067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002367196,"about_ca_system_score_gemma":0.001657001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0052817,"about_ca_topic_score_gemma":0.001249654,"domain_scores_codex":[0.9991979,0.0002324206,0.00004922331,0.0001810295,0.0002625062,0.00007694848],"domain_scores_gemma":[0.9980016,0.001413155,0.0001024935,0.000166222,0.0002503831,0.00006615525],"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.00001539073,0.00003206233,0.0005026587,0.0003138004,0.00004409823,0.00006693875,0.0001611132,0.02349033,0.0002764429,0.9115043,0.002763026,0.06082976],"study_design_scores_gemma":[0.00001173282,0.0000269297,0.0003808094,0.0001502215,0.00001439945,0.00007380851,0.00007492216,0.04839079,0.0001968681,0.9325531,0.01810416,0.00002231545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01148912,0.07652806,0.776779,0.01087419,0.0008981095,0.0001129956,0.0002156548,0.0004354935,0.1226673],"genre_scores_gemma":[0.7735953,0.0670253,0.1382579,0.002290805,0.002934126,0.0005644863,0.0002243006,0.0001337344,0.01497392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00540265,"threshold_uncertainty_score":0.01807368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570115677","doi":"10.1145/2189778.2189780","title":"Complexity Theory for Operators in Analysis","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics","authors":[{"name":"Akitoshi Kawamura","is_ca":false},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04978698707724363,"gpt":0.3141534168676975,"spread":0.2643664297904539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00467283,0.00138194,0.001318164,0.002988781,0.001972815,0.005750876,0.002415966,0.001879918,0.006051918],"category_scores_gemma":[0.01228772,0.0006095701,0.003940758,0.00324199,0.007538635,0.01633357,0.004154347,0.007466988,0.0008974295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005304294,"about_ca_system_score_gemma":0.001549746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002308572,"about_ca_topic_score_gemma":0.001263339,"domain_scores_codex":[0.9940118,0.002154132,0.0004188131,0.0009375902,0.001984284,0.0004933716],"domain_scores_gemma":[0.9845882,0.01179374,0.0005832365,0.001680185,0.001045031,0.0003095053],"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.00000510063,0.000005902428,0.00005767918,0.00004671862,0.000007397968,0.00001730342,0.00007233335,0.002692843,0.0001148621,0.9944187,0.0004171235,0.002143988],"study_design_scores_gemma":[0.000004347996,0.000006582299,0.00004071472,0.0000113312,0.000005235684,0.00001836273,0.00002090068,0.01153632,0.0001132601,0.9844826,0.003754969,0.000005498836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00972975,0.001953656,0.9602966,0.004370055,0.0002049298,0.00008740831,0.0003004281,0.0001935773,0.02286361],"genre_scores_gemma":[0.538418,0.004322264,0.4353035,0.002056329,0.002077468,0.001039178,0.00101642,0.0003546963,0.01541223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006051918,"threshold_uncertainty_score":0.03848553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151152712","doi":"10.1348/000711002760554516","title":"Skill set analysis in knowledge structures","year":2002,"lang":"en","type":"article","venue":"British Journal of Mathematical and Statistical Psychology","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Consistency (knowledge bases); Set (abstract data type); Interpretation (philosophy); Computer science; Test (biology); Cognitive psychology; Empirical research; Test theory; Artificial intelligence; Mathematics; Psychology; Statistics; Psychometrics","authors":[{"name":"Günther Gediga","is_ca":false},{"name":"Ivo Düntsch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03577935715460232,"gpt":0.328755334554809,"spread":0.2929759774002066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003633058,0.0004812934,0.0006832595,0.006172246,0.001229496,0.003378823,0.001720169,0.001179134,0.007255208],"category_scores_gemma":[0.02832067,0.0004386419,0.001439949,0.003498887,0.003970549,0.008511789,0.003754196,0.00207063,0.000561082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002349846,"about_ca_system_score_gemma":0.001096632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002894634,"about_ca_topic_score_gemma":0.001821395,"domain_scores_codex":[0.996325,0.001170142,0.000221289,0.0006835614,0.001288371,0.0003115929],"domain_scores_gemma":[0.9783058,0.01589861,0.00166268,0.002310075,0.001272287,0.0005506248],"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.000037859,0.00005251221,0.003707679,0.0001068669,0.00005007521,0.00007279427,0.0006909799,0.01782112,0.0006385058,0.9228249,0.000565352,0.05343141],"study_design_scores_gemma":[0.000006767238,0.00002089707,0.001659733,0.00002560719,0.00001293025,0.00002836553,0.0000850856,0.06223182,0.0003777071,0.9340693,0.001471164,0.00001055676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09756979,0.0005670434,0.8789157,0.001231432,0.00003709207,0.0001075988,0.0004253976,0.0002544718,0.02089152],"genre_scores_gemma":[0.8035203,0.0004042064,0.1906736,0.0002419786,0.000137773,0.0002859505,0.0005816058,0.00007008841,0.004084507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007255208,"threshold_uncertainty_score":0.02427107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1499541096","doi":"","title":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","year":2012,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Library science; Conjecture; Operations research; Mathematics; Discrete mathematics; World Wide Web","authors":[{"name":"Howard Karloff","is_ca":false},{"name":"Toniann Pitassi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01797516866140384,"gpt":0.2418414627699648,"spread":0.2238662941085609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005874504,0.002053096,0.003825328,0.001968829,0.001692472,0.008495379,0.002821425,0.002656737,0.1462241],"category_scores_gemma":[0.01655486,0.00113144,0.001716066,0.002642379,0.002370068,0.007466041,0.004263473,0.009107856,0.05692421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002746291,"about_ca_system_score_gemma":0.00366025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001326785,"about_ca_topic_score_gemma":0.001438683,"domain_scores_codex":[0.9938368,0.002037621,0.0005741264,0.00106845,0.002031034,0.0004520003],"domain_scores_gemma":[0.9873216,0.005447641,0.0003985171,0.002847369,0.00236055,0.001624283],"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.0002274044,0.0001338451,0.0008578624,0.000878067,0.000249897,0.0001654855,0.000260891,0.001563212,0.001275293,0.07207555,0.7434274,0.1788851],"study_design_scores_gemma":[0.00005075838,0.00007896981,0.0005886441,0.0003837743,0.00006692277,0.0002549427,0.00009930656,0.004024819,0.0003584389,0.06127848,0.9327728,0.00004213527],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.007282154,0.1514248,0.3300409,0.06289097,0.1273173,0.001085942,0.008063074,0.006403278,0.3054915],"genre_scores_gemma":[0.09395149,0.1465272,0.1602568,0.0235146,0.0699941,0.00257831,0.02442236,0.005055575,0.4736995],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1462241,"threshold_uncertainty_score":0.4891684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526810261","doi":"10.17323/1609-4514-2008-8-2-185-231","title":"Computability of Julia Sets","year":2008,"lang":"en","type":"article","venue":"Moscow Mathematical Journal","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Branco Weiss Fellowship – Society in Science","keywords":"Julia set; Computability; Computable analysis; Mathematics; Set (abstract data type); Quadratic equation; Subject (documents); Dynamical systems theory; Computer science; Algorithm; Algebra over a field; Pure mathematics; Geometry; Programming language","authors":[{"name":"Mark Braverman","is_ca":true},{"name":"Michael Yampolsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04047369647215496,"gpt":0.2762703952587099,"spread":0.2357966987865549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001699184,0.0004751339,0.001051134,0.0011758,0.002152072,0.005642307,0.002203829,0.0009040758,0.006879554],"category_scores_gemma":[0.01184773,0.0005731322,0.001880303,0.001068707,0.00580363,0.009497705,0.004673546,0.004865718,0.0008287979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00211385,"about_ca_system_score_gemma":0.0013498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000847548,"about_ca_topic_score_gemma":0.0006251271,"domain_scores_codex":[0.9969133,0.0004478549,0.0001666844,0.0008381687,0.001063192,0.0005707795],"domain_scores_gemma":[0.9925167,0.004629482,0.0003183801,0.001616874,0.0005178152,0.0004008395],"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.0000538233,0.00002859867,0.0004025123,0.00005761888,0.00001269601,0.00005246139,0.0004192135,0.003707939,0.001575148,0.987245,0.0003541929,0.006090729],"study_design_scores_gemma":[0.00001781291,0.00002400146,0.0001283554,0.0000204753,0.000008682943,0.00006622689,0.0001094567,0.01654737,0.004136811,0.9757421,0.003182587,0.00001622704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.502367,0.0007717653,0.4333439,0.002424093,0.0002180236,0.0002125697,0.0004210247,0.001142334,0.05909942],"genre_scores_gemma":[0.9154308,0.0003224897,0.07484311,0.0001844718,0.0001354903,0.000157012,0.0003963246,0.0002121412,0.008318197],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006879554,"threshold_uncertainty_score":0.02301443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3199228775","doi":"10.1007/11786.1661-8289","title":"Mathematics in Computer Science","year":2013,"lang":"en","type":"paratext","venue":"Mathematics in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Mathematics education; Computer science","authors":[{"name":"Dardo Goyeneche","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true},{"name":"Padraig Ó Catháin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03441838138543281,"gpt":0.2910074292922361,"spread":0.2565890479068033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126979,0.001069358,0.001233519,0.002586548,0.002540617,0.01173011,0.0009120183,0.002063878,0.08585935],"category_scores_gemma":[0.005956643,0.0004237096,0.0004619716,0.004348493,0.005193247,0.00796825,0.002426247,0.006557048,0.02347078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005534989,"about_ca_system_score_gemma":0.003014351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002225632,"about_ca_topic_score_gemma":0.003001274,"domain_scores_codex":[0.9983405,0.0006022945,0.00009659843,0.0003295209,0.0005356325,0.00009540913],"domain_scores_gemma":[0.9979013,0.001087002,0.0001232996,0.0002826325,0.0003898849,0.0002159596],"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.000008572682,0.00001266506,0.00009872841,0.0001615249,0.000005664224,0.00001726248,0.000204831,0.000138522,0.0001190163,0.8669472,0.1009316,0.03135438],"study_design_scores_gemma":[0.000007063915,0.000008374195,0.0002803183,0.0001317327,0.000006733503,0.00006273529,0.0001045516,0.0005116989,0.00007922434,0.5579001,0.4409013,0.000006128007],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002858829,0.05047663,0.02948208,0.03959011,0.008659291,0.00006170324,0.0007646099,0.0005705875,0.8675362],"genre_scores_gemma":[0.1591336,0.06153746,0.02445958,0.008247657,0.02252523,0.0004045897,0.001282032,0.001201942,0.721208],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.08585935,"threshold_uncertainty_score":0.2872282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402901095","doi":"10.1007/s42113-024-00217-5","title":"Reclaiming AI as a Theoretical Tool for Cognitive Science","year":2024,"lang":"en","type":"article","venue":"Computational Brain & Behavior","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Koninklijke Nederlandse Akademie van Wetenschappen; Lorentz Center; Netherlands Institute for Advanced Study in the Humanities and Social Sciences","keywords":"Cognitive science; Cognition; Psychology; Computer science; Neuroscience","authors":[{"name":"Iris van Rooij","is_ca":false},{"name":"Olivia Guest","is_ca":false},{"name":"Federico Adolfi","is_ca":false},{"name":"Ronald de Haan","is_ca":false},{"name":"Antonina Kolokolova","is_ca":true},{"name":"Patricia Rich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02187341066985489,"gpt":0.3505455981938253,"spread":0.3286721875239704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0129445,0.0008248106,0.0008408637,0.003267156,0.003099083,0.01140127,0.003247778,0.005219133,0.004226089],"category_scores_gemma":[0.01504106,0.000544046,0.001197884,0.001528236,0.05881113,0.01824464,0.006650056,0.01251761,0.001315107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007946316,"about_ca_system_score_gemma":0.003749483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003282039,"about_ca_topic_score_gemma":0.001708515,"domain_scores_codex":[0.9878091,0.007501729,0.0006467021,0.001184356,0.00242013,0.0004380264],"domain_scores_gemma":[0.9798956,0.0129667,0.0008592349,0.002844519,0.002590852,0.0008430173],"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.000002418128,0.000002349584,0.00001258331,0.00001714975,0.000001868183,0.00001044494,0.0002497582,0.000207734,0.00002834238,0.9981431,0.0006455237,0.0006787219],"study_design_scores_gemma":[0.00000491879,0.000004401868,0.00001526824,0.00003639686,0.00000233965,0.00001968569,0.000106171,0.001347333,0.00005145866,0.9812995,0.01710715,0.000005379417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02096941,0.02203535,0.3911108,0.2830254,0.006404392,0.0001025187,0.0001996742,0.0006772081,0.2754752],"genre_scores_gemma":[0.83263,0.008672008,0.1055641,0.02074216,0.005639288,0.0004554117,0.0001802882,0.0003605886,0.02575602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0129445,"threshold_uncertainty_score":0.0684579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2887387095","doi":"10.1103/physrevb.99.035120","title":"Algorithmic Matsubara integration for Hubbard-like models","year":2019,"lang":"en","type":"article","venue":"Physical review. B./Physical review. B","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hubbard model; Computer science; Physics; Quantum mechanics; Superconductivity","authors":[{"name":"Amir Taheridehkordi","is_ca":true},{"name":"S. H. Curnoe","is_ca":true},{"name":"J. P. F. LeBlanc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02672519603406507,"gpt":0.3599595855839312,"spread":0.3332343895498661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966747,0.0006086145,0.0008269842,0.001116981,0.0009333276,0.001327907,0.001354453,0.0006547325,0.005075831],"category_scores_gemma":[0.002933314,0.0003862821,0.0007321126,0.0007767905,0.0008239666,0.00164393,0.001702393,0.001084811,0.00100702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050043,"about_ca_system_score_gemma":0.000923937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001856207,"about_ca_topic_score_gemma":0.004147978,"domain_scores_codex":[0.9997595,0.00007919661,0.000014247,0.00002923773,0.00007805939,0.00003975657],"domain_scores_gemma":[0.9994431,0.0003430869,0.0000379107,0.00005870213,0.00007812114,0.00003901878],"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.0001684829,0.0001108266,0.001447144,0.0002060759,0.00006946544,0.0002855962,0.0005039427,0.3575393,0.006368926,0.4494395,0.003174772,0.1806859],"study_design_scores_gemma":[0.00001374334,0.000008541079,0.00006748105,0.00001337881,0.00000727995,0.00002193228,0.00003195858,0.82996,0.0009609415,0.1676007,0.001307469,0.000006581053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05928335,0.0002899569,0.927215,0.0002598735,0.00003711827,0.00005765009,0.00007067224,0.000994149,0.01179231],"genre_scores_gemma":[0.3644063,0.0001631621,0.6300828,0.0001015207,0.00003570524,0.0001527231,0.0001722591,0.0004316221,0.004453925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005075831,"threshold_uncertainty_score":0.01698041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068458312","doi":"10.1007/s00224-010-9263-x","title":"Randomness on Computable Probability Spaces—A Dynamical Point of View","year":2010,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Randomness; Ergodic theory; Mathematics; Pointwise; Point (geometry); Mixing (physics); Computable analysis; Discrete mathematics; Pure mathematics; Computable function; Mathematical analysis","authors":[{"name":"Péter Gács","is_ca":false},{"name":"Mathieu Hoyrup","is_ca":false},{"name":"Cristóbal Rojas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01555738778436423,"gpt":0.2465730864953659,"spread":0.2310156987110017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003196489,0.000943844,0.001829352,0.002492735,0.002010487,0.005719862,0.003109734,0.003123122,0.004502142],"category_scores_gemma":[0.01057096,0.0008909051,0.002475508,0.001357956,0.009231799,0.01379128,0.003588254,0.004428363,0.0004342905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003171015,"about_ca_system_score_gemma":0.001356717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00139428,"about_ca_topic_score_gemma":0.0007266174,"domain_scores_codex":[0.9972265,0.00113033,0.0001481403,0.0004419452,0.0008009283,0.0002521502],"domain_scores_gemma":[0.9902773,0.006521599,0.0005870553,0.001223768,0.0008807837,0.0005095665],"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.000003670829,0.000004480153,0.00005027374,0.00001528247,0.000006727098,0.0000168192,0.00003749784,0.002489598,0.0001223782,0.9966885,0.0001286701,0.0004360521],"study_design_scores_gemma":[0.000007586554,0.000009451088,0.00007533401,0.000007560906,0.000004472551,0.00002369559,0.00001658123,0.01295259,0.0000777084,0.9859877,0.0008276447,0.00000964221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07934009,0.005214769,0.8445097,0.01629121,0.0008202509,0.00008787474,0.0005315621,0.0002487766,0.05295586],"genre_scores_gemma":[0.9279361,0.003751659,0.04776796,0.001303992,0.002864732,0.000294563,0.000394168,0.0001985217,0.01548832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005719862,"threshold_uncertainty_score":0.02300739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3019480792","doi":"10.1037/amp0000637","title":"Words or numbers? Communicating probability in intelligence analysis.","year":2020,"lang":"en","type":"review","venue":"American Psychologist","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada","funders":"Ministère de la Défense Nationale; New Zealand Government","keywords":"Intelligence analysis; Computer science; Psychology; Artificial intelligence; Computer security","authors":[{"name":"Mandeep K. Dhami","is_ca":false},{"name":"David R. Mandel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1447265649232287,"gpt":0.4332301295061516,"spread":0.2885035645829229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003544746,0.0008080027,0.001014819,0.004052128,0.0005165268,0.003384937,0.001527869,0.00278022,0.003279904],"category_scores_gemma":[0.0111661,0.0004169962,0.0005588551,0.005055641,0.004401709,0.007761855,0.001197089,0.003292224,0.002367029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001993847,"about_ca_system_score_gemma":0.002699335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003486022,"about_ca_topic_score_gemma":0.003796367,"domain_scores_codex":[0.9982179,0.000974783,0.0001494552,0.0001642037,0.0004437719,0.00004993747],"domain_scores_gemma":[0.9925014,0.006369639,0.0003372447,0.0001473363,0.0005415228,0.0001029217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004135737,0.00003015845,0.0002369252,0.01096393,0.00006942569,0.00006391136,0.000471374,0.0004984813,0.0001635919,0.08975746,0.03537735,0.8623261],"study_design_scores_gemma":[0.00001825656,0.0000556517,0.001067735,0.01372506,0.00008857396,0.0007187267,0.0004297342,0.0004482208,0.0003220905,0.08314978,0.8999354,0.00004076588],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00007685056,0.9941847,0.0008941825,0.001959564,0.0002749934,0.000004670742,0.000007899505,0.000009012146,0.002588189],"genre_scores_gemma":[0.003169511,0.9931015,0.001303762,0.00112352,0.0004979947,0.00001806613,0.00001789531,0.000008277403,0.0007595214],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004052128,"threshold_uncertainty_score":0.01874661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1636577564","doi":"10.48550/arxiv.cs/0509042","title":"Computing over the Reals: Foundations for Scientific Computing","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":50,"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":"Computer science; Theoretical computer science; Data science; Mathematical economics; Mathematics","authors":[{"name":"Mark Braverman","is_ca":false},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1077638105331092,"gpt":0.340904778139331,"spread":0.2331409676062218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004499181,0.0008009814,0.0009494342,0.002500124,0.002462381,0.007834084,0.001855685,0.003108689,0.007529699],"category_scores_gemma":[0.008831663,0.0006357667,0.001192042,0.00287707,0.01135727,0.01584097,0.003576433,0.006742389,0.002486759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002993781,"about_ca_system_score_gemma":0.002367672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001568323,"about_ca_topic_score_gemma":0.001077649,"domain_scores_codex":[0.9982034,0.0006310926,0.0001026169,0.0002548724,0.0006213863,0.0001866085],"domain_scores_gemma":[0.9950337,0.002735102,0.0002376624,0.001237932,0.0004808108,0.0002747368],"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.000002073469,0.000002885494,0.0000247028,0.00003068607,0.000001801616,0.000008209321,0.00003188121,0.0005362534,0.00004396965,0.995922,0.0008778428,0.002517737],"study_design_scores_gemma":[0.000001352672,0.000001202078,0.00001364654,0.00001511933,6.661811e-7,0.000007017755,0.00000920304,0.0011247,0.00002528191,0.9932928,0.005506711,0.000002359015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00827269,0.03261521,0.7691756,0.03712733,0.001632973,0.00008464538,0.0005535218,0.0006684851,0.1498695],"genre_scores_gemma":[0.6068476,0.03945248,0.315233,0.006071781,0.007801387,0.0006298008,0.0007463573,0.000521353,0.02269614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007834084,"threshold_uncertainty_score":0.0251894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170052858","doi":"10.1016/s0004-3702(00)00034-5","title":"Applying MDL to learn best model granularity","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; European Commission; University of Waterloo; York University; Office of Naval Research; Harvard University","keywords":"Minimum description length; Algorithm; Computer science; Granularity; Model selection; Artificial intelligence; Set (abstract data type); Mathematics; Pattern recognition (psychology)","authors":[{"name":"Qiong Gao","is_ca":false},{"name":"Ming Li","is_ca":false},{"name":"Paul Vitányi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08122447488248963,"gpt":0.3113414049876533,"spread":0.2301169301051637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003512705,0.0009536344,0.001905504,0.002265248,0.0008382565,0.001892152,0.001999323,0.00160565,0.004887022],"category_scores_gemma":[0.02153711,0.0008988309,0.001167274,0.001378842,0.000928787,0.004862302,0.002528299,0.003000438,0.0005771792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002453011,"about_ca_system_score_gemma":0.002070166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005017525,"about_ca_topic_score_gemma":0.006634281,"domain_scores_codex":[0.9985633,0.0005507224,0.0001305271,0.000359823,0.0002881955,0.0001073411],"domain_scores_gemma":[0.9887109,0.009121399,0.0003637819,0.001159865,0.0004394788,0.0002045347],"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.0003124878,0.0001721809,0.00329257,0.0002521822,0.0001415087,0.0001100676,0.0001050475,0.7496147,0.001089878,0.02467889,0.004736176,0.2154943],"study_design_scores_gemma":[0.00001732301,0.00001234696,0.00005132448,0.00001286842,0.00001094947,0.000007864695,0.00000937697,0.9711166,0.0003967409,0.02805747,0.0003039838,0.000003051622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05542365,0.0008689864,0.9359099,0.001195302,0.0001083294,0.0001041263,0.0006853014,0.003063292,0.002641231],"genre_scores_gemma":[0.6619045,0.0002844675,0.3345997,0.0004391845,0.00009479804,0.0002111314,0.001109958,0.0003362721,0.001020032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005017525,"threshold_uncertainty_score":0.01857722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1854153889","doi":"10.1134/s0081543811060058","title":"Algorithmic tests and randomness with respect to a class of measures","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Steklov Institute of Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"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":"Agence Nationale de la Recherche","keywords":"Randomness; Bernoulli's principle; Mathematics; Sequence (biology); Randomness tests; Class (philosophy); Property (philosophy); Measure (data warehouse); Discrete mathematics; Context (archaeology); Bernoulli number; Metric (unit); Bernoulli process; Combinatorics; Computer science; Statistics; Artificial intelligence","authors":[{"name":"Laurent Bienvenu","is_ca":false},{"name":"Péter Gács","is_ca":false},{"name":"Mathieu Hoyrup","is_ca":false},{"name":"Cristóbal Rojas","is_ca":true},{"name":"Alexander Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03480845670536498,"gpt":0.2366268819779675,"spread":0.2018184252726025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004301027,0.0007101694,0.001125011,0.002796728,0.001277739,0.004127427,0.001286024,0.001635259,0.003389857],"category_scores_gemma":[0.02043932,0.000408364,0.00150069,0.001802609,0.01026981,0.010162,0.003193396,0.003077051,0.000286043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002097105,"about_ca_system_score_gemma":0.0009116842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005660615,"about_ca_topic_score_gemma":0.000247873,"domain_scores_codex":[0.9932239,0.002071409,0.0005158158,0.001394814,0.00220887,0.0005852907],"domain_scores_gemma":[0.9756249,0.01727017,0.002178233,0.002545198,0.001514652,0.0008669473],"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.00001109594,0.00000589273,0.000460378,0.00002047768,0.000008006741,0.00002183551,0.00006063044,0.002111614,0.0002804288,0.994208,0.0001086954,0.002703038],"study_design_scores_gemma":[0.00001183611,0.00005932259,0.0006223203,0.00002621261,0.00001127169,0.0001637637,0.00007075191,0.01878658,0.0007718335,0.9755641,0.003890386,0.00002169668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1974514,0.001686928,0.7583763,0.002437076,0.000189147,0.000088687,0.0003649479,0.0001948055,0.03921069],"genre_scores_gemma":[0.9296458,0.0007632197,0.06313299,0.0003601037,0.000547563,0.0002084931,0.0003575,0.00007980131,0.004904421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004301027,"threshold_uncertainty_score":0.02274626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990125233","doi":"10.3934/dcds.2011.29.193","title":"Dynamics and abstract computability: Computing invariant measures","year":2010,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Computable analysis; Computability; Computable number; Invariant measure; Computable function; Invariant (physics); Measure (data warehouse); Mathematics; Transfer operator; Metric space; Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Stefano Galatolo","is_ca":false},{"name":"Mathieu Hoyrup","is_ca":true},{"name":"Cristóbal Rojas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008618561469826036,"gpt":0.2262105296436449,"spread":0.2175919681738189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578278,0.0006957584,0.0007922616,0.001646663,0.001116597,0.003432244,0.001171994,0.001346977,0.002677074],"category_scores_gemma":[0.00906694,0.00035892,0.001117068,0.001460097,0.01003607,0.0125308,0.00276795,0.00250565,0.0003166479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262227,"about_ca_system_score_gemma":0.0007084193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001104133,"about_ca_topic_score_gemma":0.0003991311,"domain_scores_codex":[0.9983653,0.0005069575,0.0001036665,0.0004222519,0.0004418537,0.0001599228],"domain_scores_gemma":[0.9960408,0.002408581,0.0003810055,0.0007383984,0.0002512113,0.0001799538],"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.00000659368,0.000005211818,0.0001283725,0.00003314488,0.000006190156,0.00002908308,0.0001010279,0.004671018,0.000409925,0.9919933,0.0001301725,0.002485918],"study_design_scores_gemma":[0.000003970971,0.000006884793,0.00006643611,0.00001005372,0.000003232943,0.00002564927,0.00002749973,0.0117075,0.0004826695,0.9864858,0.001174273,0.000005968574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09091862,0.002328987,0.8754918,0.004173283,0.0001943158,0.00004427063,0.0001441631,0.0003753994,0.02632916],"genre_scores_gemma":[0.8953413,0.001613796,0.09838988,0.0003939967,0.0002425823,0.0001270053,0.0001585399,0.0001267775,0.003606183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003432244,"threshold_uncertainty_score":0.01641363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2727177017","doi":"10.1063/1.4996867","title":"A synchronous game for binary constraint systems","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Constraint (computer-aided design); Mathematics; Computer science; Applied mathematics; Algebra over a field; Mathematical economics; Mathematical optimization; Calculus (dental); Pure mathematics; Arithmetic; Geometry","authors":[{"name":"Se-Jin Kim","is_ca":true},{"name":"Vern I. Paulsen","is_ca":true},{"name":"Christopher Schafhauser","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03109511339544873,"gpt":0.282808530928047,"spread":0.2517134175325983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767176,0.0005677255,0.000645505,0.000575611,0.001281599,0.002196216,0.001079516,0.001037898,0.00517351],"category_scores_gemma":[0.007726338,0.0003377332,0.0006330419,0.0009552535,0.002069042,0.003877228,0.001926441,0.001748726,0.0003001129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002407349,"about_ca_system_score_gemma":0.001779149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005474677,"about_ca_topic_score_gemma":0.005085373,"domain_scores_codex":[0.997687,0.0009809923,0.0001223936,0.0003960309,0.000539561,0.0002740549],"domain_scores_gemma":[0.9964992,0.0024148,0.0002068998,0.0002311198,0.0003118783,0.0003360571],"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.00006016388,0.0000225102,0.0001748408,0.00003513782,0.00001326617,0.00007586519,0.0001445834,0.01668354,0.0007252953,0.977133,0.0007128732,0.004218936],"study_design_scores_gemma":[0.00005557571,0.00002388513,0.0001662685,0.00001161806,0.00001276094,0.00005640817,0.00007605027,0.2120986,0.0007293964,0.7831561,0.003596227,0.00001717117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1836886,0.0003931421,0.7651245,0.002102199,0.000103394,0.000309497,0.0006487655,0.0002653869,0.0473645],"genre_scores_gemma":[0.9046795,0.0002660238,0.08658192,0.0002807698,0.00006843611,0.0002951509,0.0003376021,0.00004216621,0.007448428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005474677,"threshold_uncertainty_score":0.01746655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966303569","doi":"10.1090/s0002-9939-09-10115-6","title":"On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics","year":2009,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; John Templeton Foundation; National Science Foundation","keywords":"Mathematics; Order (exchange); Reverse mathematics; Calculus (dental); Applied mathematics; Geometry; Axiom","authors":[{"name":"C.P. Chong","is_ca":false},{"name":"Steffen Lempp","is_ca":false},{"name":"Yue Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01363867840563703,"gpt":0.2547967305169723,"spread":0.2411580521113353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006621083,0.001181694,0.001295742,0.002085278,0.00442251,0.006423001,0.00260627,0.002240626,0.01391217],"category_scores_gemma":[0.01104659,0.001229743,0.003762288,0.002027748,0.01141118,0.02289496,0.007426836,0.007056305,0.004628582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003545703,"about_ca_system_score_gemma":0.002130999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006077805,"about_ca_topic_score_gemma":0.004992513,"domain_scores_codex":[0.9951866,0.00186827,0.0003361554,0.000846479,0.001155257,0.0006071545],"domain_scores_gemma":[0.9922262,0.003959659,0.000323759,0.001816428,0.001316027,0.000357917],"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.000009098306,0.00000629333,0.0000555166,0.00002360567,0.000005195393,0.00003713481,0.0001982223,0.0001689995,0.000120307,0.9951307,0.001522153,0.002722813],"study_design_scores_gemma":[0.00001316371,0.0000109235,0.0000930932,0.00002767246,0.0000118381,0.00007813789,0.0000830659,0.001153237,0.0005663662,0.9792047,0.01874218,0.00001563335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02170701,0.002159384,0.6714985,0.008315636,0.001327052,0.0001021049,0.0005185279,0.001525014,0.2928468],"genre_scores_gemma":[0.6329294,0.003383039,0.2652194,0.007040469,0.002116538,0.0004367607,0.001369138,0.003218737,0.08428656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01391217,"threshold_uncertainty_score":0.04654086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894178851","doi":"10.22331/q-2020-07-20-301","title":"Law without law: from observer states to physics via algorithmic information theory","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":47,"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":"Observer (physics); Physical law; Probabilistic logic; Perspective (graphical); Physical system; Point (geometry); Information theory; State (computer science)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02357027136651258,"gpt":0.2376864589492625,"spread":0.2141161875827499,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00638563,0.0007500126,0.001138483,0.001962923,0.001717093,0.006955734,0.002234465,0.002814755,0.004967527],"category_scores_gemma":[0.02256914,0.0007174299,0.001969174,0.001290138,0.01279423,0.01653833,0.004959691,0.005813469,0.0008706042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002514024,"about_ca_system_score_gemma":0.002550194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001805824,"about_ca_topic_score_gemma":0.001099604,"domain_scores_codex":[0.9949561,0.002387878,0.0002333354,0.0008240435,0.001242033,0.000356606],"domain_scores_gemma":[0.9877623,0.008456411,0.0006281817,0.002103587,0.0006968979,0.0003526323],"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.000003755271,0.000005060406,0.00006117906,0.00001671371,0.000004306827,0.00002095871,0.0001085976,0.001367257,0.00004963071,0.9965608,0.0002947641,0.001506979],"study_design_scores_gemma":[0.000004264494,0.000004224461,0.00002605982,0.000009703634,0.000002680809,0.00001143575,0.000013425,0.009377119,0.00004920473,0.9893867,0.001110031,0.000005152376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01745993,0.001481186,0.9222807,0.006868314,0.0002759615,0.0001056138,0.0002239884,0.0003926067,0.05091182],"genre_scores_gemma":[0.7285886,0.002538128,0.2533298,0.002151119,0.001049255,0.0004243754,0.0004713414,0.0003724234,0.01107492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006955734,"threshold_uncertainty_score":0.0337708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2206772957","doi":"10.1016/j.tcs.2015.11.027","title":"Descriptional Complexity of Formal Systems","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Middlesex London Health Unit","funders":"","keywords":"Formal language; Computer science; Formal system; Theoretical computer science; Programming language; Mathematics; Linguistics; Philosophy","authors":[{"name":"Helmut Jürgensen","is_ca":true},{"name":"Juhani Karhumäki","is_ca":false},{"name":"Alexander Okhotin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07158295952416184,"gpt":0.2757495938322175,"spread":0.2041666343080557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004867475,0.0007089644,0.001445314,0.002770962,0.001945658,0.00952008,0.00304583,0.002044726,0.008278567],"category_scores_gemma":[0.0270996,0.001050215,0.001933139,0.003106396,0.006472786,0.02129873,0.004745175,0.006041033,0.0004693067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005740639,"about_ca_system_score_gemma":0.002248882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002374129,"about_ca_topic_score_gemma":0.00153858,"domain_scores_codex":[0.9916637,0.002695818,0.0005694995,0.001006747,0.003342743,0.0007215129],"domain_scores_gemma":[0.9530526,0.03853324,0.001889011,0.003429231,0.002011447,0.001084488],"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.00002429499,0.00002343017,0.0004355783,0.00007515639,0.00001987939,0.00002883115,0.0002862631,0.005339821,0.000152602,0.9890416,0.0006553985,0.003916986],"study_design_scores_gemma":[0.000007299746,0.000003601176,0.0001189557,0.000008052251,0.000007129913,0.00002124368,0.00005161785,0.01241077,0.00009891869,0.9865906,0.0006757655,0.00000597402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3070665,0.004412999,0.5850009,0.0249037,0.0002056128,0.0001777232,0.002047197,0.000477067,0.07570825],"genre_scores_gemma":[0.961293,0.001537214,0.02883758,0.0005800072,0.0003318632,0.0002002009,0.00101665,0.00009943797,0.006104111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00952008,"threshold_uncertainty_score":0.04165149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979127885","doi":"10.1016/j.apal.2008.04.005","title":"Introduction to Turing categories","year":2008,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; University of Calgary","funders":"","keywords":"Turing machine; Turing; Categorical variable; Mathematics; Computability theory; Description number; Recursion (computer science); Computability; Generality; Super-recursive algorithm; Algebra over a field; Exposition (narrative); Universal Turing machine; Computer science; Computation; Discrete mathematics; Algorithm; Pure mathematics; Programming language","authors":[{"name":"J.R.B. Cockett","is_ca":true},{"name":"Pieter Hofstra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04680070270485933,"gpt":0.2678986461075334,"spread":0.2210979434026741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962759,0.0008434203,0.001160726,0.003413511,0.002420883,0.004061549,0.001088877,0.001590359,0.02450617],"category_scores_gemma":[0.003371249,0.0007146199,0.0009830587,0.004009274,0.006549979,0.007167874,0.002855367,0.005910259,0.007090834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002645588,"about_ca_system_score_gemma":0.001608251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001175622,"about_ca_topic_score_gemma":0.001502803,"domain_scores_codex":[0.9990609,0.0002903557,0.00005238811,0.0002343226,0.0002702248,0.00009175252],"domain_scores_gemma":[0.9984879,0.0008200911,0.00004514267,0.0002570912,0.0002596666,0.0001300638],"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.0000043884,0.000006306965,0.00004730584,0.00006171776,0.000004013813,0.00001393399,0.0001623869,0.0001463268,0.0001085771,0.9651636,0.02227498,0.01200637],"study_design_scores_gemma":[0.000002259357,0.000004473044,0.00009874615,0.00003927135,0.000003712501,0.00005874529,0.00003477676,0.0002460569,0.00008366782,0.7678422,0.2315794,0.000006688062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.006748931,0.1374633,0.1927157,0.03642326,0.01877081,0.00008750962,0.00151127,0.001194773,0.6050844],"genre_scores_gemma":[0.3426507,0.07511504,0.09080631,0.01535342,0.04456965,0.0006179149,0.00143879,0.001331715,0.4281164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02450617,"threshold_uncertainty_score":0.08198136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081148745","doi":"10.1016/j.aam.2004.10.003","title":"Is complexity a source of incompleteness?","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Discrete mathematics; Peano axioms; Bounded function; Measure (data warehouse); Null set; Probability theory; Probability measure; Set (abstract data type); Statistics","authors":[{"name":"Cristian S. Calude","is_ca":false},{"name":"Helmut Jürgensen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03344240360397974,"gpt":0.290507433322412,"spread":0.2570650297184322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01046403,0.0004635624,0.001884533,0.002828819,0.002097511,0.006607594,0.002986437,0.002909716,0.009638357],"category_scores_gemma":[0.08415756,0.0009130538,0.001404147,0.002440159,0.01152838,0.02877216,0.003385609,0.005667293,0.001100712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003037595,"about_ca_system_score_gemma":0.003556307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002543404,"about_ca_topic_score_gemma":0.00186234,"domain_scores_codex":[0.9945875,0.001597268,0.0004273408,0.0007719756,0.002222959,0.0003929695],"domain_scores_gemma":[0.8922348,0.07030776,0.007621523,0.01311025,0.01471022,0.002015463],"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.00004023791,0.0000284709,0.001583211,0.0002629816,0.00005904367,0.00009466869,0.0005658743,0.00246213,0.0002615415,0.9750898,0.003618556,0.01593347],"study_design_scores_gemma":[0.000006907,0.00000543551,0.0003555731,0.00005134656,0.00001021956,0.00005769493,0.0001838966,0.002533007,0.0001796781,0.99242,0.004181315,0.00001483908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1564705,0.01826929,0.5440817,0.1486766,0.001523554,0.0001568031,0.002643432,0.0006230599,0.127555],"genre_scores_gemma":[0.92067,0.006190813,0.05819071,0.004278632,0.001807446,0.0001774715,0.001145196,0.0002355908,0.007304282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046403,"threshold_uncertainty_score":0.05533975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4397047033","doi":"10.1007/s11023-024-09664-2","title":"Reflective Artificial Intelligence","year":2024,"lang":"en","type":"article","venue":"Minds and Machines","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Philosophy of mind; Philosophy of science; Theory of computation; Artificial intelligence; Cognitive science; Computer science; Psychology; Philosophy; Epistemology; Algorithm; Metaphysics","authors":[{"name":"Peter R. Lewis","is_ca":true},{"name":"Ştefan Sarkadi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02867142387087685,"gpt":0.3079905601223323,"spread":0.2793191362514555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00618691,0.0008674138,0.0006976207,0.001418111,0.002338259,0.009068285,0.002136956,0.002432552,0.007315774],"category_scores_gemma":[0.01608764,0.0005306157,0.001140738,0.0009510833,0.01485703,0.01019626,0.006563852,0.003433227,0.001699372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002466837,"about_ca_system_score_gemma":0.002530706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001143362,"about_ca_topic_score_gemma":0.0009289104,"domain_scores_codex":[0.9928373,0.003999548,0.0004189447,0.001176797,0.001197839,0.0003695499],"domain_scores_gemma":[0.9879994,0.005063231,0.0008882078,0.00399675,0.00141683,0.0006355615],"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.0000157748,0.00002388912,0.0003222944,0.00008694345,0.00002115083,0.00005746272,0.001060823,0.002122554,0.0005108703,0.9800081,0.002238056,0.01353212],"study_design_scores_gemma":[0.00001237276,0.0000147224,0.0000788763,0.00006519578,0.00001142479,0.0000757263,0.0003510345,0.007184961,0.0005764849,0.9589643,0.03265327,0.00001163179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02128884,0.002531607,0.6993282,0.01938212,0.000706677,0.0002866001,0.0001185453,0.001144281,0.2552131],"genre_scores_gemma":[0.7050651,0.001974158,0.2596764,0.002690451,0.0004840236,0.000323146,0.0002970768,0.0002795877,0.02921016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009068285,"threshold_uncertainty_score":0.03271985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091708223","doi":"10.1017/s0305004106009352","title":"All realizability is relative","year":2006,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":37,"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":"Realizability; Morphism; Object (grammar); Filter (signal processing); Mathematics; Preorder; Variety (cybernetics); Extensional definition; Subcategory; Characterization (materials science); Algebra over a field; Computer science; Pure mathematics; Discrete mathematics; Algorithm; Artificial intelligence","authors":[{"name":"Pieter Hofstra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02317474790309713,"gpt":0.2467123824562242,"spread":0.2235376345531271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318671,0.0006540022,0.0007162173,0.001705723,0.002249517,0.004925349,0.0007028416,0.0008702903,0.01497621],"category_scores_gemma":[0.002564939,0.000517449,0.001283179,0.001395461,0.005949433,0.01023371,0.003085264,0.002642316,0.001695806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441128,"about_ca_system_score_gemma":0.0008553935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00145113,"about_ca_topic_score_gemma":0.001143596,"domain_scores_codex":[0.9977707,0.0003552125,0.0001850792,0.000748557,0.0006142863,0.0003262067],"domain_scores_gemma":[0.998118,0.0005399315,0.0001730716,0.00054699,0.0004491717,0.0001728232],"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.000009219801,0.000006470702,0.0001469552,0.00002814667,0.000009678435,0.00005601104,0.0002233202,0.000258638,0.0004111276,0.9940717,0.0004565201,0.00432211],"study_design_scores_gemma":[0.000007215074,0.00002535418,0.000374427,0.0000191023,0.00001671912,0.0002106596,0.0002775403,0.001078716,0.0007992355,0.9663852,0.03079068,0.00001512699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09972671,0.00164171,0.5920648,0.002191009,0.0004031626,0.0001629048,0.001366905,0.001211378,0.3012314],"genre_scores_gemma":[0.9086949,0.001154686,0.05515931,0.0004666409,0.0003746185,0.0002620651,0.001479601,0.0003043257,0.03210396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01497621,"threshold_uncertainty_score":0.05010039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157945276","doi":"10.2178/jsl/1254748693","title":"The strength of the rainbow Ramsey Theorem","year":2009,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ramsey's theorem; Ramsey theory; Converse; Mathematics; Rainbow; Corollary; Combinatorics; Discrete mathematics; Carlson's theorem; Randomness; Constant (computer programming); Injective function; Brouwer fixed-point theorem; Danskin's theorem; Fixed-point theorem; Physics; Computer science; Statistics","authors":[{"name":"Barbara F. Csima","is_ca":true},{"name":"Joseph R. Mileti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01178406988355374,"gpt":0.2418620093778536,"spread":0.2300779394942999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005329707,0.0004024029,0.00124999,0.001232833,0.002224968,0.003479758,0.001774254,0.001336856,0.008621606],"category_scores_gemma":[0.02063236,0.0008108589,0.0008819742,0.0005757202,0.006356212,0.01115594,0.006380169,0.003228669,0.0007152308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001436217,"about_ca_system_score_gemma":0.0008618375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009102594,"about_ca_topic_score_gemma":0.0007320878,"domain_scores_codex":[0.9949754,0.001396169,0.000286028,0.001384496,0.001370793,0.0005871656],"domain_scores_gemma":[0.9764749,0.01474615,0.001439,0.003910124,0.002017037,0.001412699],"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.0001292689,0.00002772961,0.001427193,0.00010389,0.00003561697,0.0001025374,0.0002461542,0.002230183,0.002725052,0.985935,0.001289119,0.005748272],"study_design_scores_gemma":[0.00003171014,0.00007047216,0.0007857825,0.00003037075,0.00003428609,0.0002722057,0.0001609917,0.0163565,0.003408505,0.975015,0.003797568,0.00003662909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5548233,0.001259242,0.3273539,0.007713381,0.0003946566,0.00008218701,0.0004372371,0.0008136472,0.1071224],"genre_scores_gemma":[0.9875485,0.000169725,0.008617736,0.0004691167,0.0001521314,0.0000425974,0.00007191442,0.00005567067,0.002872729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008621606,"threshold_uncertainty_score":0.02884215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3124285541","doi":"","title":"Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete","year":2010,"lang":"en","type":"article","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lipschitz continuity; Mathematics; Polynomial; Ordinary differential equation; Matrix polynomial; Space (punctuation); Initial value problem; Differential equation; Differential (mechanical device); Function (biology); Pure mathematics; Mathematical analysis; Discrete mathematics; Computer science","authors":[{"name":"Akitoshi Kawamura","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0180171777035858,"gpt":0.2369196725968633,"spread":0.2189024948932775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079667,0.000437512,0.00125305,0.0005581242,0.000857906,0.002875871,0.0007986458,0.0008725476,0.005743623],"category_scores_gemma":[0.005430857,0.000450315,0.001378856,0.0008945637,0.002415301,0.004001492,0.001529089,0.00359486,0.0004450737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002383986,"about_ca_system_score_gemma":0.001232988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002723065,"about_ca_topic_score_gemma":0.002371951,"domain_scores_codex":[0.9991139,0.0001560584,0.00004610284,0.0001903859,0.0003484002,0.0001452229],"domain_scores_gemma":[0.9967178,0.002283085,0.0002282388,0.0002462957,0.000379284,0.0001453873],"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.00006110443,0.00001699588,0.0002495766,0.00005593398,0.00001494412,0.00006957917,0.0001473221,0.01981695,0.001071757,0.9735563,0.0007713164,0.00416824],"study_design_scores_gemma":[0.00004777914,0.00001960601,0.0002645712,0.0000122986,0.00001118025,0.00004532413,0.00004122686,0.09172264,0.00153625,0.9037538,0.00252872,0.00001654033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3727259,0.0007817188,0.5810553,0.002282522,0.0001190438,0.0001293927,0.001325271,0.0004356451,0.04114521],"genre_scores_gemma":[0.9476112,0.0003949566,0.03618337,0.0002337511,0.00008149123,0.0001184124,0.0006088528,0.00009133724,0.01467671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005743623,"threshold_uncertainty_score":0.01921433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014032276","doi":"10.2178/jsl/1268917492","title":"Schnorr trivial sets and truth-table reducibility","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Table (database); Triviality; Ideal (ethics); Truth table; Mathematics; Computer science; Discrete mathematics; Pure mathematics; Algorithm; Epistemology; Data mining; Philosophy","authors":[{"name":"Johanna N. Y. Franklin","is_ca":true},{"name":"Frank Stephan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01413839293032509,"gpt":0.2619920865501573,"spread":0.2478536936198322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250769,0.0005310514,0.0009383341,0.002683708,0.002150598,0.004084965,0.00133905,0.001000858,0.007094366],"category_scores_gemma":[0.009851954,0.0005579905,0.001324344,0.001605247,0.006846439,0.008279577,0.00355696,0.003707283,0.0008139178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002512233,"about_ca_system_score_gemma":0.0008468239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001010161,"about_ca_topic_score_gemma":0.0007524553,"domain_scores_codex":[0.9950805,0.001124616,0.0003513418,0.0009788134,0.001614464,0.0008503243],"domain_scores_gemma":[0.9878898,0.006367632,0.001022824,0.002170184,0.001902763,0.0006467901],"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.00009261623,0.00002986165,0.0006503499,0.00006341155,0.00002284037,0.00009267986,0.00040046,0.003203966,0.001810831,0.987182,0.001045625,0.005405308],"study_design_scores_gemma":[0.00001014453,0.0000204227,0.0002719378,0.00001370459,0.00001176398,0.00009568108,0.0001623935,0.006981567,0.003011151,0.9874894,0.001909052,0.00002283185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3428724,0.001359061,0.5671765,0.004225066,0.0002647266,0.0001664314,0.0008492005,0.0015109,0.08157572],"genre_scores_gemma":[0.9776791,0.0001549192,0.01736251,0.0004030357,0.0001459925,0.00006108515,0.0002422409,0.00005572565,0.003895265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007094366,"threshold_uncertainty_score":0.02373296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1636748716","doi":"10.3233/com-2012-004","title":"The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility","year":2012,"lang":"en","type":"article","venue":"Computability","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Research Foundation of The City University of New York; Isaac Newton Institute for Mathematical Sciences; City University of New York; Simons Foundation; National Science Foundation","keywords":"Mathematics; Equivalence relation; Computable analysis; Hierarchy; Borel hierarchy; Equivalence (formal languages); Natural number; Isomorphism (crystallography); Computable function; Discrete mathematics; Pure mathematics; Algebra over a field; Borel measure","authors":[{"name":"Samuel Coskey","is_ca":true},{"name":"Joel David Hamkins","is_ca":false},{"name":"Russell Miller","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03527172603760496,"gpt":0.2774204450242962,"spread":0.2421487189866912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002838071,0.0006028463,0.001343703,0.003436207,0.0024659,0.006478027,0.001372471,0.001496792,0.004664908],"category_scores_gemma":[0.01512941,0.0006824996,0.001568525,0.002150847,0.008592539,0.01325959,0.003519124,0.004944932,0.000545864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002797155,"about_ca_system_score_gemma":0.0009987977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002106205,"about_ca_topic_score_gemma":0.001095653,"domain_scores_codex":[0.9942153,0.001293341,0.0003786634,0.001221278,0.002155098,0.0007364009],"domain_scores_gemma":[0.9881689,0.007932125,0.0007267655,0.00157461,0.00103833,0.0005592578],"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.00002563569,0.00001486673,0.0003123331,0.00005792793,0.00001003975,0.00007775483,0.000444619,0.001238796,0.000648896,0.991598,0.0003257056,0.00524534],"study_design_scores_gemma":[0.00001441213,0.00001683006,0.0004616227,0.00002233945,0.00001307656,0.0001162084,0.0001062415,0.003297644,0.0006547252,0.9930186,0.002266492,0.00001172914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.513095,0.005232517,0.3190381,0.008512135,0.000308413,0.0001706839,0.0007872303,0.001197794,0.1516582],"genre_scores_gemma":[0.9659908,0.001192727,0.02569569,0.0004394963,0.0003845152,0.0001115825,0.0004078862,0.000111656,0.005665589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006478027,"threshold_uncertainty_score":0.0202949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1813435591","doi":"10.3982/ecta7163","title":"The Complexity of Forecast Testing","year":2008,"lang":"en","type":"article","venue":"Econometrica","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Test (biology); Sequence (biology); Computer science; Forecast skill; Econometrics; Mathematics; Statistics","authors":[{"name":"Lance Fortnow","is_ca":false},{"name":"Rakesh Vohra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1934291853155568,"gpt":0.2551249838271196,"spread":0.06169579851156284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007481771,0.0009204451,0.001782782,0.00171243,0.002569548,0.006735384,0.00345731,0.002967723,0.01182538],"category_scores_gemma":[0.08195262,0.00102302,0.002467666,0.001980416,0.006023587,0.01603572,0.004682651,0.004635453,0.001144811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00518608,"about_ca_system_score_gemma":0.004612892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009103703,"about_ca_topic_score_gemma":0.004913072,"domain_scores_codex":[0.9885821,0.004834471,0.0007592501,0.0020069,0.002503434,0.00131389],"domain_scores_gemma":[0.8647214,0.1191083,0.00388471,0.00745565,0.003324324,0.001505831],"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.001085212,0.0002774162,0.0113336,0.0006495655,0.0003098348,0.0007644637,0.001297776,0.1964427,0.001564016,0.6947117,0.01381565,0.07774816],"study_design_scores_gemma":[0.00009292697,0.0000361213,0.001135753,0.00003751697,0.00004709336,0.0001428879,0.0001775371,0.1993343,0.0007005094,0.7955489,0.002714106,0.000032368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3588771,0.002114074,0.5511268,0.03229235,0.0003459889,0.0005729114,0.004688984,0.00194022,0.0480416],"genre_scores_gemma":[0.8933648,0.0009637026,0.09409442,0.001134891,0.0003826607,0.0004327441,0.002798361,0.0003010227,0.006527383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01182538,"threshold_uncertainty_score":0.03956783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390563271","doi":"10.1177/26339137231222481","title":"Designing ecosystems of intelligence from first principles","year":2024,"lang":"en","type":"article","venue":"Collective Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"John Templeton Foundation; Biotechnology and Biological Sciences Research Council; Office of Naval Research; Medical Research Foundation; Medical Research Council; Social Sciences and Humanities Research Council of Canada","keywords":"Computer science; Inference; Generative grammar; Artificial intelligence; Cognitive science; Generative model; Context (archaeology); Psychology","authors":[{"name":"Karl Friston","is_ca":false},{"name":"Maxwell JD Ramstead","is_ca":false},{"name":"Alex Kiefer","is_ca":false},{"name":"Alexander Tschantz","is_ca":false},{"name":"Christopher L. Buckley","is_ca":false},{"name":"Mahault Albarracin","is_ca":true},{"name":"Riddhi J. Pitliya","is_ca":false},{"name":"Conor Heins","is_ca":false},{"name":"Brennan Klein","is_ca":false},{"name":"Beren Millidge","is_ca":false},{"name":"Dalton A R Sakthivadivel","is_ca":false},{"name":"Toby St Clere Smithe","is_ca":false},{"name":"Magnus Koudahl","is_ca":false},{"name":"Safae Essafi Tremblay","is_ca":true},{"name":"Capm Petersen","is_ca":false},{"name":"Kaiser Fung","is_ca":false},{"name":"Jason G. Fox","is_ca":false},{"name":"Steven Swanson","is_ca":false},{"name":"Dan Mapes","is_ca":false},{"name":"Gabriel René","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05603875960920384,"gpt":0.2778152361688712,"spread":0.2217764765596674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003616603,0.0009587905,0.0008162659,0.00108949,0.002726252,0.00971326,0.00230434,0.003375234,0.006550411],"category_scores_gemma":[0.006265427,0.001106214,0.001554154,0.0006592602,0.01009708,0.01354346,0.009518767,0.004600552,0.001527681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002149132,"about_ca_system_score_gemma":0.001955638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230198,"about_ca_topic_score_gemma":0.001625753,"domain_scores_codex":[0.9979912,0.0009770696,0.00009874511,0.0003268456,0.0003667657,0.0002393243],"domain_scores_gemma":[0.9972216,0.001164318,0.0001698843,0.0008938417,0.0002233677,0.0003269688],"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.000008628522,0.0000129938,0.0001251027,0.00007866011,0.00001531501,0.0000518101,0.000383022,0.007396167,0.0003462101,0.9848413,0.001279592,0.005461125],"study_design_scores_gemma":[0.00001372193,0.00001854619,0.00005715682,0.00007158147,0.00000991133,0.00004637316,0.0001817336,0.01513785,0.0003688595,0.9458998,0.03818046,0.00001410052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02069874,0.002850689,0.838394,0.01429571,0.0005506615,0.0002182889,0.0001547588,0.0008847935,0.1219524],"genre_scores_gemma":[0.4949015,0.003398878,0.4701105,0.003026034,0.0003741965,0.001226935,0.0003422012,0.000658103,0.02596155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00971326,"threshold_uncertainty_score":0.02191329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170528642","doi":"10.5555/1227085.1227122","title":"Deterministic Complexity and Entropy","year":2004,"lang":"en","type":"article","venue":"ResearchSpace (University of Auckland)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Entropy (arrow of time); Mathematics; Measure (data warehouse); Kolmogorov complexity; Upper and lower bounds; String (physics); Statistical physics; Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis; Physics; Data mining; Quantum mechanics","authors":[{"name":"M.R. Titchener","is_ca":false},{"name":"Radu Nicolescu","is_ca":false},{"name":"Ludwig Staiger","is_ca":false},{"name":"Aaron Gulliver","is_ca":true},{"name":"Ulrich Speidel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03545164968956798,"gpt":0.2478133096290972,"spread":0.2123616599395292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946709,0.00041102,0.0004863641,0.001830058,0.0009761284,0.002881861,0.0007235635,0.001208332,0.003437132],"category_scores_gemma":[0.01149514,0.0002892458,0.0005971122,0.001098474,0.006923839,0.007227198,0.002688296,0.001758975,0.0004096508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003296808,"about_ca_system_score_gemma":0.0007870638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009094527,"about_ca_topic_score_gemma":0.0005488545,"domain_scores_codex":[0.9981288,0.0005414818,0.0001215259,0.000350644,0.0006645702,0.0001930803],"domain_scores_gemma":[0.9939173,0.004443883,0.0004053221,0.0006486997,0.0004307434,0.0001541028],"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.000004591174,0.000001872878,0.00009628692,0.0000134321,0.00000251777,0.000005933647,0.00002552063,0.002476526,0.0001104075,0.9947207,0.0002168746,0.002325376],"study_design_scores_gemma":[0.000002094565,0.000005520514,0.0001873268,0.00001190062,0.00000136864,0.00001483898,0.00001170462,0.006164287,0.0002127794,0.9911142,0.002267371,0.000006630393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1155821,0.02123028,0.6620389,0.01651799,0.0005707917,0.00006809721,0.0005689765,0.0002457057,0.1831773],"genre_scores_gemma":[0.9540581,0.002942761,0.03372832,0.0006261774,0.0007930411,0.0001002755,0.0001588618,0.00006925882,0.007523167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003437132,"threshold_uncertainty_score":0.02392012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}