{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001486596,0.0005510899,0.0006312914,0.001119745,0.0006077306,0.0006698799,0.005488258,0.0002111157,0.00001175223],"category_scores_gemma":[0.00005351698,0.0005839806,0.00007409712,0.00202334,0.001020069,0.00151293,0.003148078,0.0006454461,0.0001403845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007811171,"about_ca_system_score_gemma":0.001110607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001916644,"about_ca_topic_score_gemma":0.00004763856,"domain_scores_codex":[0.9940065,0.0001302165,0.0007030562,0.003137008,0.001185832,0.0008373571],"domain_scores_gemma":[0.9957202,0.0002028184,0.0002438249,0.002719257,0.0005255096,0.0005883671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005862792,0.0004085978,0.00005115345,0.00008738138,0.0000090639,0.00004619043,0.001692377,0.005660898,0.0001256894,0.2750481,0.006409416,0.7104553],"study_design_scores_gemma":[0.000336623,0.000555545,0.004694022,0.00006302535,0.000006937182,0.000423555,0.000002226131,0.8141808,0.0001455642,0.08789986,0.09037679,0.001315029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007431754,0.0002524426,0.9902974,0.002347839,0.001521276,0.001533547,0.0000129829,0.0005210879,0.00277024],"genre_scores_gemma":[0.01608732,0.00008492376,0.9693847,0.001473505,0.004776554,0.000227257,0.00002911895,0.00006214945,0.007874517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8085199,"threshold_uncertainty_score":0.9998925,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001548059,0.0001684931,0.0001419586,0.0001280825,0.002506491,0.0004092558,0.001990635,0.00003728422,0.00001974225],"category_scores_gemma":[0.00146853,0.0001171781,0.00007640023,0.002008487,0.002407203,0.001445967,0.0006051089,0.0001958907,0.0002955652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007619163,"about_ca_system_score_gemma":0.000485398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001481738,"about_ca_topic_score_gemma":0.000007067197,"domain_scores_codex":[0.997333,0.0001222286,0.0002360778,0.000755653,0.0009004595,0.0006525292],"domain_scores_gemma":[0.9970292,0.001276516,0.0001086108,0.0005400751,0.0008621998,0.0001834069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00003018659,0.0004806024,0.002965109,0.0000104469,0.00002668355,0.0001648349,0.003447491,0.00003371224,0.008504198,0.02674371,0.0008829922,0.95671],"study_design_scores_gemma":[0.002144024,0.0009283171,0.5032579,0.0001455052,0.00005675246,0.001421464,0.001522487,0.2098305,0.1384739,0.1295477,0.01066594,0.002005569],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2293214,0.0004865176,0.7041487,0.001934773,0.002076464,0.0008052591,0.00001258035,0.0005643577,0.06064998],"genre_scores_gemma":[0.9936107,0.00006307713,0.005383366,0.0004161059,0.00008296713,0.00004019846,8.74241e-7,0.000005991166,0.0003967413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9547045,"threshold_uncertainty_score":0.9987921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002836183,0.0001964754,0.0004022609,0.00007608067,0.00009416886,0.0003850571,0.001358158,0.00006208047,0.00001681297],"category_scores_gemma":[0.0004986395,0.0001328432,0.0002944052,0.0006475557,0.00005331593,0.0005963298,0.0003543173,0.0004568165,0.00001314945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259191,"about_ca_system_score_gemma":0.0001116695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001034533,"about_ca_topic_score_gemma":0.000008471317,"domain_scores_codex":[0.9981041,0.00006293324,0.0006687034,0.000245711,0.0006149987,0.0003035785],"domain_scores_gemma":[0.998153,0.0001741513,0.000439406,0.0002586436,0.0005841444,0.0003906303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002274299,0.002864481,0.09566623,0.0009391286,0.002219222,0.00859012,0.09229141,0.1251046,0.04673479,0.02430968,0.1229658,0.4780872],"study_design_scores_gemma":[0.001723491,0.001855343,0.02270716,0.0001519001,0.0001801423,0.001491966,0.001415033,0.9344832,0.003535417,0.01067262,0.02080879,0.0009749455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4494256,0.001013878,0.371239,0.17415,0.001887353,0.0003324081,0.0000171778,0.0003009899,0.001633574],"genre_scores_gemma":[0.951152,0.00003614496,0.04631538,0.001524865,0.000869702,3.979804e-7,5.968562e-7,0.000007576295,0.00009329316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8093786,"threshold_uncertainty_score":0.5417189,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006890961,0.00009905823,0.0001588347,0.0001201113,0.0001427817,0.00006012038,0.08519865,0.00005224061,0.000004646284],"category_scores_gemma":[0.003149122,0.00006989393,0.00009969391,0.001257782,0.000303194,0.0002666711,0.07416269,0.0002719065,0.00002482869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009126926,"about_ca_system_score_gemma":0.00006221529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000982,"about_ca_topic_score_gemma":0.0005979874,"domain_scores_codex":[0.9987739,0.0002303834,0.0003442793,0.000218711,0.0002305625,0.0002021622],"domain_scores_gemma":[0.9411366,0.0003807954,0.0001261353,0.05820796,0.000108509,0.00004001976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003350659,0.001625892,0.0631302,0.00002195316,0.00002108482,2.671187e-7,0.001971348,0.0005668598,0.0002292223,0.02148437,0.004962143,0.9059833],"study_design_scores_gemma":[0.0009501119,0.00009157759,0.2496501,0.0001134507,0.00001481972,0.00002455785,0.0001264627,0.1048879,0.001723621,0.601019,0.04099002,0.00040848],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"methods","genre_scores_codex":[0.3584418,0.003714771,0.01675984,0.6074166,0.0005043773,0.001641689,0.00001034439,0.0005152863,0.0109953],"genre_scores_gemma":[0.4847502,0.0000352311,0.5149767,0.0001291155,0.00001583686,0.00002663208,0.00000126174,0.000004319253,0.00006064904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9055749,"threshold_uncertainty_score":0.9333253,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145862486","doi":"10.1017/s0960129506005238","title":"A lambda calculus for quantum computation with classical control","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Dalhousie University","funders":"","keywords":"Church encoding; Dependent type; Typed lambda calculus; Computer science; Simply typed lambda calculus; System F; Lambda calculus; Curry–Howard correspondence; Calculus (dental); Linear logic; Programming language; Type (biology); Operational semantics; Theoretical computer science; Quantum; Lambda; Quantum computer; Semantics (computer science); Algebra over a field; Mathematics; Pure mathematics; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01117563736552843,"gpt":0.2579324113655679,"spread":0.2467567740000395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001059872,0.0003567616,0.0005211517,0.000293173,0.0003141656,0.0007333518,0.002035236,0.00008890084,0.000006748944],"category_scores_gemma":[0.0001150171,0.0002595662,0.0001089075,0.001349498,0.0009177262,0.0006327474,0.0005085998,0.0002461148,0.000009828777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002372983,"about_ca_system_score_gemma":0.0002389143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000308766,"about_ca_topic_score_gemma":0.00002733923,"domain_scores_codex":[0.9960965,0.0001043422,0.0006579804,0.001192771,0.001054453,0.0008939415],"domain_scores_gemma":[0.9975693,0.000992396,0.0001763901,0.0007592079,0.0003030552,0.0001996106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002936653,0.0002741551,0.0005778962,0.00007640645,0.000007058761,0.00004859712,0.0002145181,0.05172312,0.0001729576,0.8888628,0.0002111913,0.05780194],"study_design_scores_gemma":[0.0008254644,0.0001650768,0.006973413,0.00002158086,0.00000410035,0.00008840351,0.000002614307,0.6177821,0.0001299806,0.3737321,0.00004520389,0.0002300033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03283866,0.00002535743,0.964104,0.001219847,0.0004777964,0.000880972,0.000005151716,0.0002628518,0.000185382],"genre_scores_gemma":[0.5778522,9.228505e-8,0.4217599,0.0001957444,0.0001390921,0.00003801921,0.000001331416,0.00000955214,0.000004050119],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.566059,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003050665,0.00006584189,0.0001129156,0.00002573149,0.0002178572,0.00005139341,0.05389488,0.00003336225,0.00001609393],"category_scores_gemma":[0.006330969,0.00005228863,0.000107203,0.0006462078,0.0001773603,0.0001304851,0.08048826,0.0001683356,0.00002609685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003321631,"about_ca_system_score_gemma":0.0001288484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002382281,"about_ca_topic_score_gemma":0.00006832545,"domain_scores_codex":[0.9990374,0.0002984953,0.0002106624,0.0001781082,0.0001627792,0.0001125827],"domain_scores_gemma":[0.9341462,0.0005605358,0.0000940312,0.06492816,0.0002416127,0.00002949037],"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.000004342767,0.002041352,0.01709663,0.00008599986,0.0001706912,0.000004995541,0.006875488,0.0008995784,0.009753204,0.6618161,0.1391343,0.1621173],"study_design_scores_gemma":[0.0002233001,0.00002070187,0.0336779,0.00004416344,0.0000152529,0.0000269189,0.0001482234,0.02551432,0.009734943,0.8728034,0.05760689,0.0001839402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"methods","genre_scores_codex":[0.02872117,0.00830288,0.05387597,0.8613802,0.001209435,0.0005098831,0.00001548578,0.0003956959,0.04558927],"genre_scores_gemma":[0.3706132,0.00008052305,0.6286834,0.0003467663,0.00001284823,0.000009055349,0.000002044987,0.000003867116,0.0002482901],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.8610334,"threshold_uncertainty_score":0.951224,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005865435,0.0006888201,0.0009649143,0.00006581604,0.0002828292,0.000482664,0.004573015,0.0004115136,0.00007828709],"category_scores_gemma":[0.0001488362,0.0006642817,0.0005152414,0.00002435962,0.0003043517,0.0001633958,0.002045725,0.0005538729,0.001577012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003474342,"about_ca_system_score_gemma":0.0005303338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005946986,"about_ca_topic_score_gemma":0.00009083341,"domain_scores_codex":[0.9962662,0.00005242618,0.0008829347,0.001387217,0.0008366989,0.000574467],"domain_scores_gemma":[0.9950978,0.00009268301,0.000626541,0.003566853,0.0003207696,0.0002954088],"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.00000161465,0.000008413931,5.528898e-7,0.0001455703,0.00002112926,0.00008795936,0.00001092325,0.000001430666,3.823352e-7,0.6371295,0.001267487,0.361325],"study_design_scores_gemma":[0.00001905932,0.00009168973,0.000005831204,0.001450854,0.00004710143,0.0001166197,3.72879e-7,0.0007356829,0.00002310886,0.9072369,0.08963821,0.0006345903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[4.300801e-7,0.007051963,0.1519146,0.0006527185,0.001886216,0.0007025544,0.00003925355,0.0003818134,0.8373705],"genre_scores_gemma":[0.03289446,0.004988708,0.3064145,0.02547972,0.01150059,0.0004082661,0.0000446668,0.0005791449,0.61769],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3606904,"threshold_uncertainty_score":0.9995809,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.006630495,0.0002984693,0.0003491033,0.0003025532,0.001178204,0.00120275,0.005464156,0.00005851793,0.00002160595],"category_scores_gemma":[0.001436179,0.000144288,0.0001228545,0.006135699,0.006713334,0.0004614906,0.001556262,0.0005309744,0.00003512951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009998308,"about_ca_system_score_gemma":0.00009408786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004882281,"about_ca_topic_score_gemma":6.232655e-7,"domain_scores_codex":[0.9958031,0.0005775063,0.0003736606,0.001099865,0.001396497,0.0007494373],"domain_scores_gemma":[0.9923295,0.005139927,0.0001107734,0.001929966,0.0002317697,0.0002580557],"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.00001589327,0.00007494442,0.00001820186,0.000001679523,0.000003048619,0.000006285916,0.0002144225,0.0002278718,0.00000447166,0.9225156,0.00007550397,0.07684208],"study_design_scores_gemma":[0.0002623961,0.0001883502,0.00422007,0.000006226168,0.000004503039,0.00002036721,0.000002937388,0.473444,0.0001313841,0.5215073,0.0000757797,0.0001366112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081945,0.0002036788,0.9578375,0.02509462,0.0005096057,0.0004676372,0.000001233564,0.000208055,0.004858175],"genre_scores_gemma":[0.9503016,0.00001326304,0.04390583,0.005644714,0.0001116673,0.000008342065,1.3329e-7,0.000004956737,0.000009494172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9394822,"threshold_uncertainty_score":0.9999167,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005039152,0.000335547,0.0005995363,0.0006254144,0.00008891807,0.0001915013,0.0008985074,0.0002537554,0.00573521],"category_scores_gemma":[0.00005456061,0.00031018,0.0002373108,0.0009454166,0.0001704419,0.0002159442,0.0008311662,0.0004105029,0.0002920193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002094098,"about_ca_system_score_gemma":0.000179647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002675833,"about_ca_topic_score_gemma":0.00008884935,"domain_scores_codex":[0.9975651,0.0001961189,0.0004669364,0.0009616493,0.0004965072,0.0003136903],"domain_scores_gemma":[0.9972627,0.001585048,0.000142226,0.0007364246,0.0001263136,0.0001472989],"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.000004155173,0.0003288777,0.00276828,0.00005167437,0.0006685326,0.0001260274,0.0008898334,0.009629378,9.730202e-8,0.76732,0.09883338,0.1193798],"study_design_scores_gemma":[0.0001908941,0.00002107994,0.007715664,0.00002274001,0.00009591037,0.00002636271,0.000005513776,0.3963169,1.675516e-7,0.5790078,0.01616525,0.0004317868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00002562715,0.0001305818,0.6061915,0.0002428078,0.0001294062,0.000180701,0.00004406734,0.0001570474,0.3928982],"genre_scores_gemma":[0.002125169,0.00003495363,0.2569535,0.000543624,0.000139893,0.00002801724,0.0002084001,0.00002747953,0.739939],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.3866875,"threshold_uncertainty_score":0.999935,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005029224,0.0002022173,0.0002747294,0.0001206478,0.0000689361,0.0001599016,0.001765906,0.0003584858,0.00002177173],"category_scores_gemma":[0.001608111,0.0001589368,0.0001154421,0.0008278516,0.0000768687,0.0003090023,0.0008032796,0.0008716018,0.00005753656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071162,"about_ca_system_score_gemma":0.0001543395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008949855,"about_ca_topic_score_gemma":0.000002377623,"domain_scores_codex":[0.9971581,0.001139205,0.0002292119,0.0006395096,0.0004639729,0.0003700535],"domain_scores_gemma":[0.997301,0.0007923681,0.00007867986,0.001269277,0.0002929224,0.0002657338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006011874,0.00006665873,0.0002197214,0.000006539239,0.00001425076,0.00001862539,0.0006877842,0.00007484578,0.0002345695,0.269825,0.003923454,0.7249225],"study_design_scores_gemma":[0.0004761167,0.0001461593,0.001872041,0.000007767757,0.000009534077,0.000087671,0.0000372732,0.1121812,0.006930387,0.698139,0.1797082,0.0004047095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004804264,0.001662235,0.9681033,0.001953952,0.003394137,0.0001625996,0.000001053976,0.000475245,0.02376703],"genre_scores_gemma":[0.03410214,0.000002770681,0.9640124,0.001163493,0.0003521913,0.000008860149,0.000001081214,0.00001269611,0.0003443455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7245178,"threshold_uncertainty_score":0.6481255,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004739949,0.0003684448,0.0008364688,0.001100058,0.0005019888,0.0003548362,0.003561974,0.0001049444,0.000286208],"category_scores_gemma":[0.001152711,0.0002192114,0.0003098376,0.006663611,0.001184661,0.000977517,0.001302952,0.0006353392,0.00001746285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001667926,"about_ca_system_score_gemma":0.0006146322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005323376,"about_ca_topic_score_gemma":0.00005902394,"domain_scores_codex":[0.9956415,0.001376282,0.001010947,0.0006042244,0.0009108937,0.0004561664],"domain_scores_gemma":[0.9924302,0.006066703,0.0007812448,0.0005072039,0.0001546006,0.00006008379],"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.000002061107,0.00004435056,0.000004906972,0.0001266763,0.00001803393,0.000001324128,0.0003867362,0.000003553979,4.321184e-9,0.0201751,0.00005621644,0.9791811],"study_design_scores_gemma":[0.0001900275,0.0003477294,0.00006837307,0.001266839,0.00006386531,0.00002355763,0.001353314,0.00375168,0.000001979955,0.01041404,0.982088,0.0004306249],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000006671424,0.9414508,0.01111809,0.0000649034,0.001183966,0.0004523088,0.0001075633,0.0001105025,0.0455052],"genre_scores_gemma":[0.0003050061,0.9969766,0.00214637,0.00003224513,0.00003690758,0.0001777432,0.00006174797,0.000007950457,0.0002554725],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9820318,"threshold_uncertainty_score":0.8939182,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001408471,0.0001486087,0.0003287735,0.00002873092,0.00003174803,0.00004407037,0.0006931121,0.000008242814,0.00004571605],"category_scores_gemma":[0.00004536725,0.0001258289,0.0001815573,0.0002860527,0.00008571974,0.0004943485,0.0002576302,0.00009616203,0.0002142408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005913197,"about_ca_system_score_gemma":0.00001325615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004419299,"about_ca_topic_score_gemma":1.892371e-7,"domain_scores_codex":[0.9987067,0.0001210841,0.0002735028,0.0003419164,0.0003406511,0.0002161458],"domain_scores_gemma":[0.999031,0.0001492429,0.0001342234,0.0005385544,0.00006095054,0.00008600677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002721618,0.001420911,0.0005201039,0.001625044,0.00004033295,0.00001104729,0.001645564,0.00007216486,0.3199909,0.009078199,0.01211146,0.6534815],"study_design_scores_gemma":[0.001719023,0.0008445952,0.02082946,0.002881862,0.000115791,0.00006960463,0.00005817818,0.7820736,0.1631109,0.01529992,0.01048291,0.002514141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5625049,0.003583017,0.4165573,0.0142388,0.0004839078,0.001505518,0.000001509788,0.0002358496,0.0008892118],"genre_scores_gemma":[0.9628005,0.00007330513,0.02969921,0.007220957,0.00009328521,0.00009736834,0.000001723863,0.000008644781,0.000004993628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7820014,"threshold_uncertainty_score":0.5131153,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007550979,0.0001703816,0.0002534572,0.0001846784,0.0006339282,0.0000997008,0.002003934,0.00009347488,0.00008219095],"category_scores_gemma":[0.0001684416,0.0001617888,0.0001934088,0.001307383,0.0002618007,0.0004942205,0.0007547336,0.0002256624,0.00006678203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000124108,"about_ca_system_score_gemma":0.0001370237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001633276,"about_ca_topic_score_gemma":0.0001705286,"domain_scores_codex":[0.9982039,0.0002931675,0.0001644756,0.000486008,0.0004658001,0.000386688],"domain_scores_gemma":[0.9978374,0.0004810532,0.0001604414,0.001123699,0.0002542936,0.0001430811],"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.00007876203,0.001063632,0.02139901,0.0001654858,0.0003586795,0.0003348321,0.009507383,0.001063032,0.000348087,0.3501727,0.01869962,0.5968087],"study_design_scores_gemma":[0.004223789,0.001115256,0.2139661,0.00007543688,0.0001462059,0.0001638757,0.005955186,0.09131971,0.001440491,0.08681865,0.59281,0.001965354],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07207876,0.0005309061,0.890407,0.003639941,0.001131254,0.0004560189,0.00001387072,0.0003272042,0.03141507],"genre_scores_gemma":[0.9390861,0.00004493108,0.05928355,0.0001372928,0.0000272736,2.829439e-7,0.000001680282,0.000008563316,0.001410284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8670074,"threshold_uncertainty_score":0.6597556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232957,0.0002053347,0.000586596,0.00002953513,0.0001756081,0.0001707805,0.002393671,0.0000442151,0.00003966562],"category_scores_gemma":[0.0001411739,0.0001227677,0.0008345048,0.0007343407,0.0003610982,0.0003898075,0.0007897022,0.0005119804,0.0000870541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002298143,"about_ca_system_score_gemma":0.0001504624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005125161,"about_ca_topic_score_gemma":3.952239e-7,"domain_scores_codex":[0.9977224,0.0001101539,0.0006993946,0.0002361811,0.000816052,0.0004158407],"domain_scores_gemma":[0.9975437,0.0004171514,0.0008583697,0.0007506367,0.0002157098,0.0002144632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006641668,0.005936111,0.005708882,0.0004274925,0.00142092,0.00006724379,0.02415071,0.04833177,0.004470976,0.03155565,0.2958952,0.5819685],"study_design_scores_gemma":[0.0005578885,0.0003092882,0.00790769,0.00008406328,0.00005459279,0.0006160869,0.0002299757,0.8728918,0.0008765234,0.1095673,0.006548947,0.0003558238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1827332,0.00006401425,0.8003655,0.01518816,0.0003151163,0.0001609204,9.577128e-7,0.00005666619,0.00111547],"genre_scores_gemma":[0.4187443,0.00001151219,0.5785563,0.002206048,0.0003231148,0.000001832646,4.340658e-8,0.00001268524,0.0001441731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.82456,"threshold_uncertainty_score":0.5006322,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008865595,0.0003424413,0.0004752034,0.000174214,0.000812617,0.0002042192,0.001157871,0.000105238,0.00002247745],"category_scores_gemma":[0.0002093141,0.0003308021,0.000263306,0.0004842013,0.0004026644,0.0005059256,0.000385578,0.0002203125,0.00006280926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002218273,"about_ca_system_score_gemma":0.0003054402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005530076,"about_ca_topic_score_gemma":0.000006459121,"domain_scores_codex":[0.9967318,0.000349907,0.000662099,0.0009895241,0.0007439409,0.000522777],"domain_scores_gemma":[0.9969826,0.001008146,0.0002778538,0.0007474194,0.0007908549,0.0001930846],"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.00004538076,0.0003179591,0.0005944942,0.00009560514,0.00003734901,0.00001721736,0.0003894675,0.1300071,0.0000180685,0.8651519,0.001986024,0.001339444],"study_design_scores_gemma":[0.0005615313,0.0002208571,0.01568701,0.0000169123,0.000005184205,0.0002145811,0.000009552056,0.631435,0.00001577077,0.3505,0.001067081,0.0002665002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04537351,0.0002192282,0.9495575,0.001074588,0.001043815,0.001346746,0.00005332115,0.0005304359,0.0008008387],"genre_scores_gemma":[0.7646334,0.00000224514,0.2344641,0.0001860646,0.0003105213,0.0001756362,0.0001214025,0.00002071284,0.00008593304],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7192599,"threshold_uncertainty_score":0.9999144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660347,0.0001323398,0.0003531011,0.0002652126,0.0004899724,0.000581766,0.002089845,0.00003363502,0.000002519331],"category_scores_gemma":[0.0007109417,0.00009475252,0.0001055407,0.000195008,0.0003923254,0.001151731,0.0001792356,0.0002637972,0.000001801914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001603665,"about_ca_system_score_gemma":0.0003704184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001889558,"about_ca_topic_score_gemma":0.01643496,"domain_scores_codex":[0.9985825,0.0001434663,0.0004804462,0.0001755235,0.0003103461,0.0003076727],"domain_scores_gemma":[0.9979819,0.0002975093,0.000521309,0.0005688678,0.0005188027,0.0001115901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000538146,0.0001052365,0.04199139,0.0001199812,0.0002480026,0.002675171,0.1442918,0.001435818,0.0000536183,0.008322923,0.004970247,0.7957804],"study_design_scores_gemma":[0.001426889,0.0004668566,0.8818302,0.0008128789,0.00004572836,0.0005962205,0.01774836,0.04572238,0.0002603306,0.04377783,0.006799763,0.000512621],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.671528,0.04377895,0.1698104,0.09124815,0.01966966,0.0009892067,0.00002050498,0.00004057317,0.002914478],"genre_scores_gemma":[0.9846504,0.000245088,0.01468484,0.00023104,0.0001639647,9.830028e-7,3.21007e-7,0.000004760638,0.00001858341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8398387,"threshold_uncertainty_score":0.9171092,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001696567,0.0003658983,0.0003221508,0.0001654795,0.00009168504,0.0002233891,0.001361519,0.0002854064,0.002630364],"category_scores_gemma":[0.00002739398,0.0003070199,0.0001553907,0.00006236887,0.00008888709,0.0002669609,0.0008711361,0.0002128944,0.001407221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009840725,"about_ca_system_score_gemma":0.00007362769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001956134,"about_ca_topic_score_gemma":0.00002903136,"domain_scores_codex":[0.9981653,0.00001896153,0.0003368768,0.0007958699,0.0004483392,0.0002346268],"domain_scores_gemma":[0.9981905,0.000100898,0.0001626356,0.001178737,0.0002578085,0.0001094316],"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.000001241965,0.00001993759,0.00003371226,0.00002276432,0.00003154094,0.000009612084,0.0001742545,0.000008529754,0.000007978373,0.8685056,0.007316001,0.1238688],"study_design_scores_gemma":[0.0001137744,0.0001408129,0.0001425718,0.00002245072,0.00001150162,0.00001858179,6.132674e-7,0.04775127,0.00004395421,0.6382082,0.3129553,0.0005910123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000002378092,0.00004875574,0.5504242,0.0001653974,0.001195784,0.0001453015,0.000004343492,0.0004051236,0.4476088],"genre_scores_gemma":[0.001019278,0.00002077912,0.1077474,0.0003744114,0.001228847,0.000005074552,0.00003312033,0.00004706243,0.889524],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.4426768,"threshold_uncertainty_score":0.9999382,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000433811,0.0004492062,0.0003888606,0.0006368675,0.0005731716,0.0002916081,0.001300141,0.0001845812,0.0001133533],"category_scores_gemma":[0.0001790376,0.0004470786,0.0003003723,0.001618854,0.0001637641,0.0005732497,0.00005139199,0.0005714477,0.0008555612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005122932,"about_ca_system_score_gemma":0.0003085693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006434211,"about_ca_topic_score_gemma":0.00000910687,"domain_scores_codex":[0.996439,0.000151081,0.000658603,0.001082677,0.001119539,0.0005490998],"domain_scores_gemma":[0.9961216,0.002262819,0.000223301,0.0008063928,0.0003258811,0.0002599714],"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.0001196868,0.0002494905,0.00000580991,0.00001101403,0.00007339974,0.00003463806,0.0001390821,0.9070118,0.00002659385,0.04101337,0.00004844518,0.05126667],"study_design_scores_gemma":[0.009241427,0.003451559,0.01493225,0.00007291154,0.00007845465,0.00009259531,0.00006943378,0.383669,0.001937299,0.5844145,0.0005901174,0.001450526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02413411,0.00004440748,0.9669604,0.004654528,0.002020736,0.0004898666,0.00003135106,0.0007127391,0.0009518426],"genre_scores_gemma":[0.7745017,0.000005955148,0.2243137,0.0009458123,0.0001174476,0.00004450257,0.00004051972,0.00002175266,0.000008650376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7503676,"threshold_uncertainty_score":0.9999224,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002791994,0.0005791737,0.0009732758,0.0001156792,0.0002044399,0.0004656049,0.0007271851,0.0005160233,0.0004198111],"category_scores_gemma":[0.000109312,0.0004413212,0.0002522525,0.00021381,0.0008108232,0.0001509778,0.0009050171,0.0005733962,0.0001557479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003568781,"about_ca_system_score_gemma":0.00006622675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008814134,"about_ca_topic_score_gemma":0.000009062952,"domain_scores_codex":[0.9964969,0.0007784212,0.0005884196,0.00109414,0.0004881501,0.0005539387],"domain_scores_gemma":[0.9969266,0.001473852,0.0001388693,0.0009523011,0.0000914804,0.0004169124],"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.000009274157,0.0003981235,0.001364003,0.0004722318,0.000127971,0.0001321323,0.0005318447,0.000001565032,0.000001322948,0.8497346,0.003465625,0.1437613],"study_design_scores_gemma":[0.000253562,0.0001347286,0.006912184,0.0001040501,0.00005046993,0.0001790035,0.000004123041,0.005106636,0.000003849164,0.981537,0.005095755,0.0006186595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01793214,0.001012322,0.5817299,0.0004596769,0.0002995532,0.001183926,0.00004442064,0.0006443748,0.3966937],"genre_scores_gemma":[0.3266191,0.005369327,0.3969689,0.002365853,0.001247096,0.0003168762,0.0002393508,0.0004655906,0.2664079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3086869,"threshold_uncertainty_score":0.9998038,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002224008,0.0002003369,0.000204671,0.0001325921,0.001472168,0.001544163,0.001853793,0.00005517939,0.00004525674],"category_scores_gemma":[0.0002211502,0.0001447687,0.0001685783,0.000878646,0.0002326559,0.0005478577,0.001009565,0.0001696656,0.0001088836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001415807,"about_ca_system_score_gemma":0.000149999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005212745,"about_ca_topic_score_gemma":0.0001354063,"domain_scores_codex":[0.9975849,0.0001191457,0.0004866325,0.0007978597,0.0004300254,0.0005814733],"domain_scores_gemma":[0.9968204,0.001440988,0.0001626701,0.001158855,0.0003122155,0.0001048066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002363473,0.0002359109,0.0010565,0.0000226093,0.00003341175,0.000001057737,0.002754196,0.01907668,0.0002244886,0.3410859,0.01450748,0.6209994],"study_design_scores_gemma":[0.000274449,0.00003185776,0.006363275,0.000009348132,0.000005997005,0.00001267718,0.0000501931,0.9295762,0.0001802829,0.009037895,0.05426019,0.0001976079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03268376,0.00006159325,0.9562936,0.004834039,0.001349775,0.0006295965,0.000002793644,0.0005119909,0.003632827],"genre_scores_gemma":[0.6094938,4.523023e-7,0.3888064,0.0007121725,0.0004903608,0.000005572624,0.000005427711,0.00001051157,0.0004753369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9104996,"threshold_uncertainty_score":0.9998278,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002602703,0.0002634093,0.0003663612,0.0002372669,0.0004108061,0.0009865838,0.001379496,0.00006481264,0.000001936988],"category_scores_gemma":[0.00006250151,0.0002291778,0.0000486055,0.001371186,0.002397666,0.0007845356,0.0007128115,0.0002683296,0.000004295931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001684307,"about_ca_system_score_gemma":0.00008143784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001512835,"about_ca_topic_score_gemma":0.0000139602,"domain_scores_codex":[0.9965138,0.0002419002,0.0006614576,0.001095415,0.0007390624,0.000748328],"domain_scores_gemma":[0.9985321,0.0004493358,0.0001251936,0.0005688479,0.0001587164,0.000165875],"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.000003310962,0.000118441,0.001441863,0.00004704498,9.05474e-7,0.00002483574,0.0006342503,0.01119413,0.00009528306,0.9709526,0.000001566156,0.01548582],"study_design_scores_gemma":[0.0002520817,0.0001079185,0.01630757,0.00007803031,0.000003172887,0.00008912398,0.00002334981,0.8700144,0.00006014072,0.1127999,0.000002194411,0.0002622093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3376896,0.00006611992,0.6607245,0.0002106083,0.0003508017,0.0003167314,0.000001238883,0.0001916337,0.0004488116],"genre_scores_gemma":[0.8106363,5.625858e-7,0.1891934,0.00004456378,0.0001065668,0.000009358907,0.000001286833,0.000006956846,0.000001011713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8588202,"threshold_uncertainty_score":0.951365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008638927,0.0001059029,0.0001437482,0.00005253977,0.00009722754,0.0002643157,0.0007903898,0.00004586347,0.000004841229],"category_scores_gemma":[0.0001387019,0.00009346517,0.00002732006,0.0001904241,0.00009543812,0.0005312447,0.0002104893,0.00008838228,0.00003324696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439309,"about_ca_system_score_gemma":0.00001714709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002491098,"about_ca_topic_score_gemma":0.000008557547,"domain_scores_codex":[0.9988747,0.0002341565,0.0001410801,0.000417105,0.0001555286,0.0001774401],"domain_scores_gemma":[0.9983501,0.001005965,0.00007374801,0.000374148,0.000120371,0.00007562016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002709944,0.00008854929,0.006473352,0.00002031953,0.00002091206,0.000001860939,0.0003096854,0.0001457602,0.0003943833,0.1302428,0.000110306,0.862165],"study_design_scores_gemma":[0.00142921,0.000122463,0.09711296,0.00001682046,0.00002263497,0.00001900004,0.00001469906,0.4125473,0.003284445,0.4837984,0.001260335,0.0003716933],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05725191,0.00005552894,0.9399822,0.0002922046,0.0002527909,0.0002617894,0.00000198421,0.000168456,0.001733147],"genre_scores_gemma":[0.9968807,0.000003253603,0.001880358,0.00100586,0.0001518157,0.00004984626,8.877423e-7,0.000005930381,0.0000213715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9396288,"threshold_uncertainty_score":0.3811399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002751113,0.0002637852,0.0003913143,0.0008095009,0.000318019,0.0001256179,0.001031798,0.0001097495,0.0001074413],"category_scores_gemma":[0.0001470679,0.0002589733,0.0003308725,0.002075788,0.0001499496,0.0007373421,0.00004195833,0.000257508,0.00005258526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001974048,"about_ca_system_score_gemma":0.0000663126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002001781,"about_ca_topic_score_gemma":0.00003369649,"domain_scores_codex":[0.9972587,0.0008700106,0.0004987015,0.0005584081,0.0003057063,0.0005085125],"domain_scores_gemma":[0.9957654,0.002849534,0.0001145616,0.000932544,0.0001620926,0.000175901],"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.0001157211,0.001177941,0.0009057587,0.00002717247,0.0003839871,0.000001561507,0.00358366,0.1988971,0.00003570951,0.420815,0.00002200159,0.3740344],"study_design_scores_gemma":[0.0009071007,0.0001630205,0.0204962,0.00001046404,0.0001655445,0.000007123791,0.0002852668,0.3078057,0.0007248313,0.6687667,0.0002142348,0.0004537359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02566859,0.00008340479,0.9719173,0.0004762258,0.0007313661,0.0005549812,0.00002458981,0.0003023409,0.0002411511],"genre_scores_gemma":[0.7977042,0.000003049099,0.2016339,0.0004024276,0.00005378082,0.0001005474,0.00001484674,0.00001531637,0.00007191981],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7720356,"threshold_uncertainty_score":0.9999862,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357316,0.0001401594,0.0006476368,0.0002602336,0.00005312444,0.0001388179,0.0005401931,0.0001109335,0.0007711897],"category_scores_gemma":[0.0007089167,0.0001284013,0.0001140313,0.0006056633,0.0002605133,0.0001512375,0.0001454173,0.0004272278,0.000026261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002366665,"about_ca_system_score_gemma":0.00001199616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005946128,"about_ca_topic_score_gemma":0.00002490341,"domain_scores_codex":[0.9979457,0.0003172724,0.0008255974,0.0003321493,0.0002554925,0.0003237558],"domain_scores_gemma":[0.9981568,0.001090691,0.0001502592,0.0002263391,0.0001273676,0.000248526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001828366,0.001440096,0.001301199,0.00009974018,0.0002700989,0.002604365,0.001402099,0.00004818897,0.00001136785,0.3498204,0.006656264,0.6363279],"study_design_scores_gemma":[0.0008280896,0.0002877227,0.1108771,0.00003632495,0.00007623617,0.005636346,0.00002454136,0.07742089,0.000001672432,0.8042653,0.0003540709,0.0001916984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04176292,0.001261583,0.9538164,0.0006744095,0.0001715429,0.00007400856,0.00001811864,0.00001782229,0.002203172],"genre_scores_gemma":[0.7676089,0.0001444578,0.2318949,0.0002319465,0.0000651236,0.000001836059,9.287687e-7,0.000006357167,0.00004554939],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.725846,"threshold_uncertainty_score":0.8443987,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001429769,0.0001649273,0.000252657,0.00007917648,0.00009077758,0.00003115848,0.002232646,0.00006507981,0.00001329717],"category_scores_gemma":[0.0002284604,0.0001026259,0.0001436475,0.000498304,0.0001528222,0.000408949,0.001882928,0.0001676965,0.00000676644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003896102,"about_ca_system_score_gemma":0.00004160366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001257896,"about_ca_topic_score_gemma":9.07748e-7,"domain_scores_codex":[0.9984027,0.0000563759,0.0003818849,0.0002999085,0.0004692388,0.0003898826],"domain_scores_gemma":[0.99819,0.0004776391,0.0002598106,0.0007015974,0.0002838611,0.00008709898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001987714,0.0007402946,0.07531029,0.0001248108,0.00004784649,2.951651e-7,0.01208995,0.0003727033,0.002788981,0.870441,0.001131508,0.0369324],"study_design_scores_gemma":[0.001344832,0.001215104,0.6539373,0.0002508846,0.00006101406,0.00008454386,0.002693293,0.0809133,0.1463583,0.1102704,0.001819978,0.00105113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8743827,0.00003321305,0.09898613,0.0009575073,0.0009075719,0.0004701169,0.000004912162,0.0001784407,0.02407943],"genre_scores_gemma":[0.9473112,8.434404e-7,0.05215831,0.0002048305,0.0001302373,0.000002386376,1.513258e-7,0.000008325261,0.0001837105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7601707,"threshold_uncertainty_score":0.4184964,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122888,0.0002319751,0.000575647,0.0001140075,0.0002404743,0.00009773251,0.001483138,0.00009873042,0.0002008162],"category_scores_gemma":[0.0004337813,0.0001821623,0.0002568161,0.0004402702,0.0003322975,0.00041124,0.0005610916,0.0004845895,0.0001291465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009631108,"about_ca_system_score_gemma":0.0001909211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002716028,"about_ca_topic_score_gemma":3.578672e-7,"domain_scores_codex":[0.9971085,0.000247813,0.0009307737,0.0003741497,0.0008832741,0.0004554708],"domain_scores_gemma":[0.9976308,0.0005860191,0.0002920021,0.0008261523,0.0003197641,0.0003453091],"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.0001577722,0.01755624,0.03602728,0.001930573,0.0007264134,0.003057193,0.0270733,0.00631419,0.005466279,0.4953961,0.0220972,0.3841974],"study_design_scores_gemma":[0.0007874057,0.0003662741,0.01600751,0.00008243279,0.00001686936,0.006208004,0.00003072845,0.3495601,0.001509739,0.6246868,0.0003590015,0.0003851988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2254572,0.00006768938,0.7714595,0.0007542234,0.000317637,0.0001462858,0.000001424374,0.000100958,0.00169517],"genre_scores_gemma":[0.5976198,0.00000704703,0.4021436,0.00009608534,0.000077025,0.000002549647,2.637544e-7,0.000009769315,0.0000438301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3838122,"threshold_uncertainty_score":0.7428364,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.008409411,0.001473828,0.002181857,0.004303806,0.0006586992,0.004390493,0.02095711,0.0005425905,0.0002348138],"category_scores_gemma":[0.0003459264,0.001363713,0.0003054662,0.01185674,0.003976887,0.003248435,0.01327613,0.001865921,0.00564809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001994251,"about_ca_system_score_gemma":0.002946969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001296165,"about_ca_topic_score_gemma":0.00004911232,"domain_scores_codex":[0.9852316,0.0002081461,0.002878158,0.00420108,0.004417045,0.003063923],"domain_scores_gemma":[0.9894605,0.001390539,0.001197195,0.006091062,0.001136496,0.0007241699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009131142,0.01180238,0.0003403401,0.00640508,0.00009672592,0.0008008551,0.04598694,0.1962447,0.00148337,0.1234002,0.03550123,0.577929],"study_design_scores_gemma":[0.0005418957,0.0002117087,0.0003003087,0.001132195,0.000007109587,0.0001930711,0.00002358398,0.952616,0.0005836824,0.04238202,0.0005501348,0.001458342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006982173,0.0002250439,0.9734436,0.000485676,0.009530502,0.002040627,0.0000126343,0.000308586,0.006971176],"genre_scores_gemma":[0.01212587,0.00006726071,0.9853771,0.0004744313,0.0006989517,0.0001643267,0.000006302144,0.00008709084,0.0009986565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7563712,"threshold_uncertainty_score":0.9998011,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001519889,0.0002674457,0.0002392303,0.000368287,0.0005546501,0.001194314,0.001151329,0.00008777003,0.00009831374],"category_scores_gemma":[0.001071182,0.0002576248,0.0001933562,0.001278553,0.001056865,0.0009591837,0.000619319,0.000293309,0.0001770549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002317942,"about_ca_system_score_gemma":0.00115811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004336356,"about_ca_topic_score_gemma":5.651843e-7,"domain_scores_codex":[0.9967474,0.0001012781,0.0004288451,0.001232571,0.0009167614,0.0005731045],"domain_scores_gemma":[0.9949942,0.003660383,0.00005521404,0.0003551588,0.0007356123,0.0001994452],"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.00001032168,0.0001503849,0.0001626832,0.00002072254,0.00001009653,0.00005918808,0.0006175062,0.0006154603,0.0003003521,0.7700093,0.0004606145,0.2275834],"study_design_scores_gemma":[0.0003966716,0.0002889813,0.008206874,0.00009280976,0.00003359085,0.0002082667,0.00003563445,0.6272821,0.0005559286,0.3616866,0.0008143471,0.0003982524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1041034,0.0001125425,0.8859581,0.006762275,0.001140731,0.0009646161,0.00003891151,0.0005477767,0.0003716458],"genre_scores_gemma":[0.8539098,5.060264e-7,0.1434193,0.002000715,0.0002010962,0.0003087019,0.00002724476,0.00002281693,0.0001098573],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7498063,"threshold_uncertainty_score":0.9999876,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00118898,0.0009264167,0.002536287,0.00009726366,0.00017526,0.0002063955,0.002780124,0.00009066742,0.00003875421],"category_scores_gemma":[0.0005189735,0.0007309687,0.001739538,0.001482841,0.000142614,0.001525029,0.0009066597,0.0007317907,0.001798966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002732081,"about_ca_system_score_gemma":0.0002182895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001887985,"about_ca_topic_score_gemma":0.000002046992,"domain_scores_codex":[0.9938279,0.0005251975,0.001207735,0.002013557,0.00132648,0.001099074],"domain_scores_gemma":[0.9943201,0.001140962,0.0005533267,0.002799741,0.0006894296,0.0004964372],"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.00001064657,0.0009308862,0.0000178272,0.006039581,0.00006999227,0.000004674135,0.0001353441,0.0002148988,0.001871492,0.557067,0.007465828,0.4261718],"study_design_scores_gemma":[0.0003449896,0.0003636033,0.00008516847,0.003473829,0.0001324085,0.000009879385,0.000002529552,0.5961866,0.0006483782,0.3806427,0.01739939,0.0007104586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01129917,0.02994978,0.943918,0.005212347,0.0008600999,0.006435574,0.00003957894,0.0005452255,0.001740158],"genre_scores_gemma":[0.7744943,0.09865195,0.08960277,0.02868631,0.00338428,0.004063782,0.0002592989,0.0003119359,0.0005453519],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8543153,"threshold_uncertainty_score":0.9995142,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007861274,0.0003881883,0.001259194,0.0002041475,0.0001492752,0.0001294365,0.002087791,0.0001872035,0.00001418903],"category_scores_gemma":[0.0004713185,0.0003273987,0.0002883295,0.0006582173,0.0004905117,0.000197021,0.0008170923,0.0005595168,0.00002121605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008153674,"about_ca_system_score_gemma":0.0001593346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008449632,"about_ca_topic_score_gemma":0.00000593202,"domain_scores_codex":[0.9951428,0.001381552,0.001309872,0.0008412601,0.0007736141,0.0005508782],"domain_scores_gemma":[0.9937348,0.002892331,0.0007846853,0.001901293,0.0005056312,0.0001812671],"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.0001201584,0.0009295724,0.001150646,0.001135318,0.00008658071,0.000006327765,0.001909972,0.04166989,0.002247403,0.9180165,0.00004865502,0.03267901],"study_design_scores_gemma":[0.001945022,0.0004826972,0.004238723,0.0004885332,0.00002424902,0.00009997301,0.00008763972,0.8944809,0.001644096,0.09583446,0.0001755963,0.0004981415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5077227,0.00009392373,0.4875484,0.0001114397,0.002056898,0.0007673673,0.000004330657,0.0002334153,0.001461561],"genre_scores_gemma":[0.973053,8.786462e-7,0.02666452,0.0000329781,0.0001816316,0.000009024814,0.000002298362,0.00002277593,0.00003282134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.852811,"threshold_uncertainty_score":0.9999178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001871682,0.0008759073,0.004257081,0.0005779813,0.0001377835,0.0003177672,0.009096335,0.0002417414,0.00007189804],"category_scores_gemma":[0.001029916,0.0006811692,0.001099758,0.01623159,0.001668919,0.0002259335,0.002715182,0.001763174,0.0001859409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000622176,"about_ca_system_score_gemma":0.0004538738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001530875,"about_ca_topic_score_gemma":0.001257162,"domain_scores_codex":[0.9917719,0.002270138,0.002029486,0.002549368,0.0005223866,0.0008567496],"domain_scores_gemma":[0.9903882,0.002106178,0.001535342,0.005557794,0.0001071953,0.0003053384],"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.000005931124,0.0003011964,0.0003358636,0.0005505853,0.0002469827,0.0000764288,0.0004249645,0.00005086104,8.68446e-9,0.0007134336,0.00008944422,0.9972043],"study_design_scores_gemma":[0.0001250553,0.0005282211,0.0005428418,0.001103575,0.0006049403,0.0001057579,0.0001984267,0.00887955,1.085595e-7,0.002865685,0.9834445,0.001601389],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000006797985,0.7052168,0.2890197,0.0008099754,0.000330233,0.001285825,0.00002204355,0.0005300284,0.002778657],"genre_scores_gemma":[0.0005594568,0.8187594,0.1797696,0.0004573059,0.00007816245,0.0002720124,0.00003015016,0.0000374901,0.00003634059],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9956029,"threshold_uncertainty_score":0.9995639,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003475753,0.0006089932,0.0006470619,0.0002923812,0.001874233,0.00209503,0.004941377,0.0003118075,0.00002936852],"category_scores_gemma":[0.0005817479,0.0005114686,0.0005340976,0.0008954647,0.0005079533,0.0003871798,0.007893563,0.001092679,0.0001614765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004179573,"about_ca_system_score_gemma":0.0006351487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001603432,"about_ca_topic_score_gemma":0.0001203401,"domain_scores_codex":[0.9945837,0.0003455633,0.001085334,0.002214738,0.0007499458,0.001020764],"domain_scores_gemma":[0.9930811,0.001937848,0.000766977,0.003339144,0.0006837918,0.0001911367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003260135,0.001634912,0.2227529,0.0009712922,0.0007261662,0.00003489022,0.01975332,0.2141749,0.0005652233,0.05953849,0.02110699,0.4587083],"study_design_scores_gemma":[0.0003617898,0.00005053377,0.1478182,0.0001397756,0.00004378324,0.00001542654,0.00005193744,0.8228005,0.0001101957,0.01012646,0.01784345,0.0006380035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3877259,0.0002539383,0.6020938,0.002262976,0.005351185,0.001211809,0.00001957339,0.0005529838,0.000527792],"genre_scores_gemma":[0.8726125,0.00000671076,0.1243144,0.0006058023,0.001962235,0.00003999829,0.00007714445,0.00005037745,0.0003308828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6086256,"threshold_uncertainty_score":0.9997337,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006331649,0.0002656844,0.0002741318,0.0001334991,0.0003424193,0.0003794497,0.001812883,0.0001059929,0.0002598397],"category_scores_gemma":[0.0001174629,0.0002758951,0.0001309268,0.001013067,0.0001155681,0.000486431,0.0004387241,0.0003181393,0.003788523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009308034,"about_ca_system_score_gemma":0.0000934182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003841862,"about_ca_topic_score_gemma":0.0001862154,"domain_scores_codex":[0.9972292,0.00009696973,0.0005487453,0.000958233,0.0005160045,0.000650905],"domain_scores_gemma":[0.9982058,0.0001556799,0.00005359088,0.001125386,0.0001585146,0.0003010265],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009800346,0.0001845135,0.00004656092,0.000005169855,0.000004221007,0.00001164686,0.0008210417,0.1413401,0.0005301568,0.0448814,0.00006497453,0.8121005],"study_design_scores_gemma":[0.00001195304,0.00009973093,0.00003341744,0.00001134101,0.000004186118,0.000009589708,0.00004350496,0.8015871,0.008968265,0.1861591,0.002769652,0.0003021215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04203867,0.00005093511,0.9510322,0.001302248,0.0003552495,0.0006442316,0.000004654496,0.000360466,0.004211409],"genre_scores_gemma":[0.836331,0.00001524502,0.1617459,0.001003038,0.0001772668,0.0001406899,0.000002087207,0.00001866348,0.0005661395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8117983,"threshold_uncertainty_score":0.9999693,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948373,0.000223633,0.0005883944,0.0001716723,0.00006662175,0.00003512238,0.001581613,0.00006590492,0.000001742448],"category_scores_gemma":[0.000492083,0.0001413492,0.00009645177,0.0007248197,0.0004266904,0.0004124228,0.0008078491,0.0001278784,9.767746e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002972131,"about_ca_system_score_gemma":0.00008500995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003762679,"about_ca_topic_score_gemma":0.00001524513,"domain_scores_codex":[0.9981698,0.00001088461,0.0006067193,0.0003308154,0.0006518211,0.0002299982],"domain_scores_gemma":[0.998062,0.0001029048,0.0005776399,0.0004463325,0.0007200253,0.00009115107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008905284,0.004010216,0.02487472,0.01242889,0.001024544,0.00001319719,0.125173,0.0003701611,0.05737112,0.6874987,0.0007785411,0.08556632],"study_design_scores_gemma":[0.009391269,0.004062526,0.02846816,0.004924315,0.0005011723,0.0006223655,0.003015743,0.03693658,0.6838752,0.2253095,0.001124629,0.001768523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8865043,0.00009003338,0.1048927,0.0002766844,0.0002394785,0.001202372,0.000007036912,0.0000798138,0.006707541],"genre_scores_gemma":[0.6053192,0.000004935535,0.3945887,0.00001137328,0.00001616355,0.00001510575,4.120786e-8,0.00001016594,0.00003427959],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6265041,"threshold_uncertainty_score":0.5764053,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001336951,0.0004155927,0.0007269454,0.0001086046,0.0003396245,0.001072576,0.0008304992,0.0002656231,0.000003334904],"category_scores_gemma":[0.0001753705,0.0003530663,0.0001143295,0.0002699869,0.0003683679,0.0003759373,0.0009061472,0.0007041476,0.000004962832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006703263,"about_ca_system_score_gemma":0.00005598666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001008457,"about_ca_topic_score_gemma":0.0005808334,"domain_scores_codex":[0.9968171,0.0001933441,0.0007376541,0.001103517,0.0005028566,0.0006455152],"domain_scores_gemma":[0.9977573,0.0005568785,0.0002312027,0.0008486073,0.0001926216,0.0004134225],"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.0000362075,0.0003559473,0.07840027,0.0004104751,0.0001811978,0.0001555714,0.001545593,0.0005917739,0.002852318,0.5162206,0.00005729483,0.3991927],"study_design_scores_gemma":[0.0004612698,0.0001098664,0.06595971,0.00004608846,0.00001706791,0.0002804025,0.0001656806,0.9287517,0.000008395465,0.003568147,0.0001721463,0.0004595302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5795698,0.0002418125,0.4167362,0.000748361,0.000958451,0.0005052708,0.00001926007,0.0003218813,0.0008990015],"genre_scores_gemma":[0.9919311,0.000008673564,0.007683156,0.00007685208,0.0001995836,0.00001287695,0.00001498806,0.00002398693,0.00004883125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9281599,"threshold_uncertainty_score":0.9999644,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008953791,0.0001654574,0.0004889217,0.00005467454,0.00007211955,0.0001760177,0.0008804513,0.00006281792,0.00001239625],"category_scores_gemma":[0.0002560635,0.0001234749,0.0002467369,0.00020745,0.000249894,0.0003416329,0.0001912153,0.00018476,0.00005774954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080816,"about_ca_system_score_gemma":0.0001846226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.477022e-7,"about_ca_topic_score_gemma":6.556112e-8,"domain_scores_codex":[0.9982909,0.00007547524,0.0006844373,0.0001997106,0.0004485634,0.0003008884],"domain_scores_gemma":[0.9975218,0.0007772905,0.0004394031,0.0004429349,0.000643914,0.0001746889],"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.00003749696,0.001577159,0.00001753528,0.000635464,0.0001863837,0.00006775573,0.002213579,0.0009946227,0.001533263,0.9359667,0.003007914,0.05376216],"study_design_scores_gemma":[0.0004747961,0.001096218,0.00003963971,0.0001553293,0.00002796572,0.000434513,0.00006523518,0.4965001,0.0004154531,0.5000948,0.0005331836,0.0001628022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01648859,0.0000769113,0.9811095,0.0004254848,0.0007707159,0.0002837959,0.000003029602,0.00004692246,0.0007950386],"genre_scores_gemma":[0.7736545,0.000001826415,0.2249305,0.000081026,0.001284667,0.000006862735,1.854075e-7,0.00001267701,0.00002778612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7571658,"threshold_uncertainty_score":0.5035159,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150276,0.0004088341,0.0008732534,0.00004675666,0.0003958524,0.000128748,0.002685001,0.000133574,0.00004290758],"category_scores_gemma":[0.001971361,0.0002168133,0.0009062346,0.002488457,0.001028346,0.0002018296,0.0008641825,0.0005872726,0.000006354892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003160639,"about_ca_system_score_gemma":0.0001852329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002507088,"about_ca_topic_score_gemma":0.000004372002,"domain_scores_codex":[0.9967244,0.00005455359,0.001091521,0.0005588547,0.0009543442,0.0006163649],"domain_scores_gemma":[0.9956356,0.001289773,0.001592336,0.0007866282,0.0006061048,0.00008961699],"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.0001033761,0.003928349,0.001392586,0.001579572,0.000240828,1.281682e-7,0.03902246,0.0002718819,0.0103653,0.9308876,0.005395777,0.006812141],"study_design_scores_gemma":[0.0003992864,0.0005014622,0.003326433,0.0003758268,0.00007103959,0.00001043222,0.00371793,0.3388397,0.008541189,0.6436374,0.0003187576,0.0002606552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970678,0.00005060977,0.01097333,0.01027169,0.0001751106,0.003431056,0.00002193252,0.00006696708,0.004331301],"genre_scores_gemma":[0.8924415,0.0000162894,0.1055651,0.001190341,0.00007853641,0.00009831005,2.276983e-7,0.00003281007,0.0005769233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3385678,"threshold_uncertainty_score":0.8841389,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002944755,0.0002481294,0.0002941509,0.00002578194,0.0001534237,0.0003569793,0.001160104,0.00007048573,0.00003260641],"category_scores_gemma":[0.00004348939,0.0002296088,0.00009698346,0.0004168233,0.00008745521,0.00172878,0.0006833615,0.0002152314,0.0009737661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006786954,"about_ca_system_score_gemma":0.00004899512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008668877,"about_ca_topic_score_gemma":0.0000385037,"domain_scores_codex":[0.9981654,0.0001640433,0.0003934664,0.0004557847,0.0004467632,0.0003745358],"domain_scores_gemma":[0.9985337,0.0002220695,0.0001219373,0.0006920577,0.0001612555,0.0002689664],"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.00003289673,0.00008698164,0.0002389364,0.00003312633,0.00004198164,0.000008353483,0.009252918,0.0032964,0.000311731,0.908413,0.0006948271,0.07758887],"study_design_scores_gemma":[0.0002982301,0.0001866538,0.000812055,0.00001110066,0.000008128664,0.000001488131,0.00007571551,0.6765888,0.001444601,0.3094635,0.01080827,0.0003014233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02615432,0.00004075624,0.9692867,0.002232543,0.0005779372,0.0003771512,0.00004310636,0.0005237511,0.0007637666],"genre_scores_gemma":[0.8924434,0.000003122106,0.09424074,0.01282912,0.0003678576,0.00002940761,0.00005732282,0.00001860865,0.00001043635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.875046,"threshold_uncertainty_score":0.9998041,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003978029,0.0002304639,0.000383553,0.0002394084,0.0002585742,0.0004051701,0.00394228,0.000065606,0.00001540977],"category_scores_gemma":[0.0001883564,0.000190555,0.00009702491,0.001462048,0.006944933,0.001442345,0.002848805,0.0002149781,0.00006376818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001772144,"about_ca_system_score_gemma":0.0004572595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002701479,"about_ca_topic_score_gemma":8.218895e-7,"domain_scores_codex":[0.9959975,0.000225244,0.0005564778,0.0007913922,0.00164799,0.0007813608],"domain_scores_gemma":[0.9969291,0.0002260847,0.0001486997,0.001181426,0.0009177428,0.0005969367],"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.00001176498,0.000128537,0.0001781216,0.00001279149,0.000003846474,0.000007498785,0.0003516662,0.00185128,0.0001013103,0.9900587,0.0000614951,0.007232951],"study_design_scores_gemma":[0.0002622385,0.000398622,0.001811543,0.00001503744,0.000002575699,0.00009429081,0.00001375582,0.6993281,0.0004473976,0.2973794,0.00006950574,0.0001776163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04558259,0.00005591315,0.947787,0.0004623057,0.001980975,0.0002496641,0.000004507595,0.0002395532,0.0036375],"genre_scores_gemma":[0.7189242,4.642024e-7,0.2808176,0.0001014125,0.000141728,0.000005202358,8.770476e-7,0.0000048646,0.00000367991],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6974768,"threshold_uncertainty_score":0.9957576,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002348768,0.000127394,0.0002113856,0.00008862328,0.0001260415,0.00003500819,0.0003508316,0.00005266953,0.00001213411],"category_scores_gemma":[0.00002747753,0.0001083685,0.0000388837,0.0003450822,0.000079743,0.0001360478,0.0002969578,0.00009232189,0.00002428339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005700705,"about_ca_system_score_gemma":0.00002088944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000107649,"about_ca_topic_score_gemma":0.00000336973,"domain_scores_codex":[0.9989423,0.00001878502,0.0002022163,0.0004200372,0.0001823253,0.0002344034],"domain_scores_gemma":[0.9993307,0.00003809048,0.00006237905,0.0003844381,0.00009049903,0.00009387808],"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.00005347619,0.0003916351,0.0007335478,0.0001115687,0.00005830777,0.00002975093,0.006280714,0.004084668,0.01335985,0.7218298,0.03617804,0.2168886],"study_design_scores_gemma":[0.0007369177,0.001174323,0.05593351,0.00001820007,0.00001843021,0.0003088987,0.0004003007,0.003024457,0.2458084,0.6146452,0.07658147,0.001349878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6995391,0.0005778499,0.2690671,0.02536469,0.0004708943,0.0004471224,0.000002445378,0.0002781773,0.004252707],"genre_scores_gemma":[0.9767657,0.00005910971,0.02176875,0.0008254322,0.0004767411,0.00001450334,0.000001565127,0.000004611539,0.00008357694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2772267,"threshold_uncertainty_score":0.441914,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004515254,0.000218645,0.0004779815,0.0001364676,0.00005650712,0.00003734213,0.001328682,0.00006338717,0.0000305074],"category_scores_gemma":[0.00005151021,0.0002061256,0.0000743676,0.0006057231,0.0002276616,0.0003042158,0.0006451461,0.0001695103,0.00005360878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008400428,"about_ca_system_score_gemma":0.00003657602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006261664,"about_ca_topic_score_gemma":0.00003580577,"domain_scores_codex":[0.998109,0.00002189283,0.0006707437,0.0004308904,0.0004260514,0.0003414222],"domain_scores_gemma":[0.9981168,0.000489012,0.00029037,0.0009780737,0.00005759013,0.0000681759],"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.000005900067,0.0007257557,0.0006144533,0.0004124202,0.000009150212,0.000001729648,0.004261659,0.00548805,0.0003645084,0.7487874,0.00005051685,0.2392785],"study_design_scores_gemma":[0.00052756,0.00003943091,0.0005081795,0.00004814515,0.000005037456,0.00001293943,0.0001544449,0.3532805,0.003651658,0.6312304,0.01022994,0.0003117736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01361167,0.0003420441,0.972606,0.0003092778,0.00008641916,0.0003503848,0.000003145113,0.0001550494,0.01253601],"genre_scores_gemma":[0.4017339,0.00002210854,0.5979984,0.00016043,0.00003614553,0.00002265623,7.130237e-7,0.00000946776,0.00001609792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3881223,"threshold_uncertainty_score":0.840556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002411328,0.0001181078,0.0001134707,0.00009777679,0.00009118307,0.0003589572,0.0003077307,0.00003969774,0.00002491758],"category_scores_gemma":[0.00003579726,0.0000910379,0.0000446407,0.0003691045,0.00006299797,0.0002086515,0.0003071735,0.0001269677,0.00004100666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000200903,"about_ca_system_score_gemma":0.00003322595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005895099,"about_ca_topic_score_gemma":0.00004488717,"domain_scores_codex":[0.9990748,0.00003656937,0.0001520188,0.0004354734,0.0001275503,0.0001736211],"domain_scores_gemma":[0.9995124,0.0001419846,0.00001482619,0.000233814,0.00003447976,0.00006248923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001762663,0.00002178008,0.00006247871,0.00001606093,0.000007396603,0.00002389396,0.001004178,0.00002212364,0.0002370552,0.1111067,0.00009061032,0.887406],"study_design_scores_gemma":[0.00001263317,0.00009903302,0.0009180988,0.00001329388,0.000004795925,0.00004866403,0.00002346094,0.5910489,0.00128535,0.4038885,0.002509518,0.0001477298],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03244747,0.001440063,0.9592936,0.002700601,0.001077715,0.0001058558,0.00000275508,0.0002668802,0.002665067],"genre_scores_gemma":[0.9528086,0.00001481082,0.04660743,0.0001150467,0.0002449604,0.00001048965,0.000001020589,0.000006535486,0.0001911104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9203611,"threshold_uncertainty_score":0.3712418,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001289314,0.0003704217,0.0006056857,0.0000273059,0.0002290654,0.0001455984,0.002299557,0.0002868398,0.00002211843],"category_scores_gemma":[0.0003966073,0.0002510507,0.0009117581,0.0007979868,0.0008048378,0.0005525404,0.001775738,0.0006319719,0.00003689533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002226506,"about_ca_system_score_gemma":0.00004936312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003327195,"about_ca_topic_score_gemma":1.234574e-7,"domain_scores_codex":[0.9965537,0.00003673371,0.0009044605,0.0008497675,0.001092604,0.0005627398],"domain_scores_gemma":[0.9977875,0.0004584133,0.0003848681,0.0007017203,0.0004946539,0.0001728531],"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.000005471505,0.0005195718,0.0007539029,0.0002574936,0.00004822202,4.098339e-7,0.0004078401,0.000005191196,0.0008407474,0.9884943,0.008502718,0.0001641249],"study_design_scores_gemma":[0.0003047209,0.00006534439,0.004779804,0.00005588096,0.00004109956,0.00002204216,0.00001715379,0.05268395,0.002966077,0.9383492,0.0004339324,0.0002807433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3647297,0.0001736465,0.2110916,0.2929044,0.0005278141,0.002657049,0.00006293448,0.001220166,0.1266326],"genre_scores_gemma":[0.9289911,0.000003087713,0.0689462,0.001527608,0.0002914897,0.0000348739,0.000001089304,0.00002500307,0.0001795086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5642614,"threshold_uncertainty_score":0.9999942,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001946864,0.0001733199,0.0003476806,0.00007840814,0.0002380037,0.0001522941,0.003263245,0.00007580712,0.00001215837],"category_scores_gemma":[0.0004577529,0.00007719507,0.0003542775,0.0006070921,0.000222971,0.0002337082,0.0003152204,0.0004575199,0.000004935402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007466425,"about_ca_system_score_gemma":0.0002040797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004442471,"about_ca_topic_score_gemma":0.000001803541,"domain_scores_codex":[0.9976839,0.0003680973,0.0007185622,0.0001892403,0.0007044823,0.0003357415],"domain_scores_gemma":[0.9972739,0.0006267174,0.0007720922,0.0008698993,0.000353099,0.0001043538],"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.00003403108,0.0006082954,0.002129616,0.00001385696,0.0001038882,0.00004288527,0.00264638,0.001157239,0.001546302,0.5166019,0.002793274,0.4723223],"study_design_scores_gemma":[0.000868775,0.0008670487,0.1335239,0.00006437074,0.00003276966,0.0005991025,0.0002141373,0.010249,0.002355637,0.8459928,0.004989795,0.0002426462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7492847,0.00546654,0.1338461,0.08383866,0.00680637,0.001028942,0.000005641969,0.0001789768,0.01954404],"genre_scores_gemma":[0.9921049,0.00009428392,0.006612201,0.0007681902,0.0003129386,7.35507e-7,5.435118e-8,0.000004758726,0.0001019766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4720796,"threshold_uncertainty_score":0.6063975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002549092,0.0002971647,0.0003910494,0.0001624813,0.000327616,0.0004385874,0.001674303,0.0001416431,0.0004745293],"category_scores_gemma":[0.0002072692,0.0002637362,0.0001800391,0.0004430549,0.0001668492,0.0004180571,0.00117667,0.0005213202,0.0003492134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004078393,"about_ca_system_score_gemma":0.00009949585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002470112,"about_ca_topic_score_gemma":0.0004366242,"domain_scores_codex":[0.9977341,0.0001273537,0.000390101,0.0007813513,0.0004161032,0.0005509392],"domain_scores_gemma":[0.9974284,0.0005231652,0.0001744165,0.00140867,0.0001998163,0.000265578],"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.00008031615,0.00334661,0.02402098,0.00009645556,0.0002661925,0.0002223586,0.002482747,0.0004565247,0.1324745,0.5451819,0.05582757,0.2355438],"study_design_scores_gemma":[0.00189555,0.0004046077,0.1197141,0.00002039133,0.00003577051,0.0001387169,0.0001083669,0.824663,0.002288906,0.01050934,0.03885742,0.00136384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1032049,0.00002332007,0.883635,0.004361153,0.002942364,0.0003698068,0.00001399459,0.0007400268,0.004709384],"genre_scores_gemma":[0.8782296,0.000001020109,0.1192904,0.000274188,0.0005062553,0.00002445892,0.000007737078,0.00001743398,0.001648854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8242065,"threshold_uncertainty_score":0.9999815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00243992,0.0002246582,0.0005259896,0.0002208214,0.0001587605,0.0002757453,0.001307574,0.0001756022,0.00006067872],"category_scores_gemma":[0.0009626533,0.0001690458,0.0001590441,0.0005266386,0.000215463,0.000773702,0.0004859392,0.0008988851,0.00001607992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006145287,"about_ca_system_score_gemma":0.0002824654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002319868,"about_ca_topic_score_gemma":0.000009516354,"domain_scores_codex":[0.9976787,0.0001543571,0.000738172,0.0004859606,0.0005185263,0.0004242999],"domain_scores_gemma":[0.9975879,0.0003916855,0.0004647832,0.000842143,0.0003859884,0.0003275537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001954507,0.002836567,0.0493391,0.0002061485,0.0002509453,0.0006660771,0.004286269,0.000469464,0.04494181,0.1703675,0.004404747,0.7220359],"study_design_scores_gemma":[0.003640942,0.001650214,0.2498537,0.00005994941,0.00007729657,0.006601914,0.0001478719,0.03646525,0.004080253,0.6897732,0.006672678,0.0009767051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.960694,0.0003201207,0.03165163,0.002259769,0.003375622,0.0001695767,0.000002637331,0.00008506791,0.001441536],"genre_scores_gemma":[0.9302163,0.00002818001,0.06896233,0.0001915403,0.0005490412,0.000002041783,2.718424e-7,0.000008604082,0.00004170964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7210592,"threshold_uncertainty_score":0.6893487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006224211,0.0003982513,0.0004590558,0.00007203529,0.0011334,0.0002212543,0.003179273,0.0001296419,0.000052809],"category_scores_gemma":[0.0012228,0.0002386992,0.0003539963,0.001298362,0.001400927,0.0006868732,0.001766821,0.0009108739,0.00009866742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004411922,"about_ca_system_score_gemma":0.0002755326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001303754,"about_ca_topic_score_gemma":0.00002293617,"domain_scores_codex":[0.9945852,0.001494344,0.0009329664,0.000978104,0.0009804446,0.001028911],"domain_scores_gemma":[0.9868578,0.008198997,0.0003589507,0.003868311,0.0004548469,0.000261141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009141574,0.002557365,0.06658769,0.0001017489,0.0001611981,0.000001701701,0.003981337,0.03344894,0.0002618583,0.8164839,0.004358572,0.07196432],"study_design_scores_gemma":[0.0004464759,0.000204368,0.4057149,0.00004300258,0.00002548258,0.00003172381,0.0002440238,0.3760643,0.0009134316,0.2119306,0.003783321,0.0005983356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6486561,0.001002788,0.3307816,0.01048602,0.003672619,0.001289987,0.00001213425,0.0004136729,0.003685084],"genre_scores_gemma":[0.984874,0.000006964977,0.01439419,0.0003501803,0.0002085176,0.00003411646,0.000003061818,0.0000168335,0.0001121534],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6045532,"threshold_uncertainty_score":0.9733869,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000466183,0.0001011681,0.0001965204,0.0002188135,0.0003425021,0.00007315876,0.001274018,0.00002785294,0.00001723956],"category_scores_gemma":[0.0007995824,0.00007663928,0.00008024331,0.002220595,0.0004490502,0.0002667001,0.0005546269,0.0001055165,0.00004763724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006437652,"about_ca_system_score_gemma":0.00007212738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005879976,"about_ca_topic_score_gemma":0.000006451976,"domain_scores_codex":[0.9988653,0.0000523384,0.0003500805,0.0003035802,0.0001535746,0.0002751059],"domain_scores_gemma":[0.9975683,0.001325571,0.0001787465,0.0007171613,0.0001316699,0.00007853071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000006574757,0.0003716343,0.09012254,0.00002616711,0.00005575896,0.00002052067,0.0008333556,0.0008088116,0.00003184123,0.1415372,0.002188554,0.7639971],"study_design_scores_gemma":[0.000346838,0.0003019135,0.5407434,0.000005016132,0.000003205769,0.0001232849,0.00002674728,0.3814703,0.0003747698,0.06539642,0.01092136,0.0002867365],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3157333,0.001182737,0.5870859,0.003302698,0.001456663,0.0006245548,0.00001204487,0.0004628048,0.09013934],"genre_scores_gemma":[0.8897582,0.00000923822,0.1100474,0.00004302668,0.00005955113,0.000006173885,4.046631e-7,0.000004451186,0.00007153353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7637103,"threshold_uncertainty_score":0.3125259,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008399939,0.0003589389,0.0004833524,0.0003891484,0.0002248791,0.0004207605,0.002247002,0.0001414691,0.0001514838],"category_scores_gemma":[0.0006259433,0.0003364105,0.000221237,0.002643344,0.0002245965,0.0005813292,0.0008981656,0.0003697947,0.0002356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005649026,"about_ca_system_score_gemma":0.0006197119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005254548,"about_ca_topic_score_gemma":0.0003719272,"domain_scores_codex":[0.9966437,0.0002186005,0.0008572451,0.00123501,0.0005599459,0.0004854794],"domain_scores_gemma":[0.9952043,0.003025664,0.0001740752,0.001013341,0.0004220022,0.0001605977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001155935,0.000992388,0.007288964,0.001238438,0.0008355861,0.0005520983,0.05421046,0.1348495,0.006230005,0.3228892,0.001874261,0.4689235],"study_design_scores_gemma":[0.00002379214,0.0002207083,0.0003401504,0.0004223123,0.00001400401,0.00002356969,0.000251884,0.7595547,0.1581306,0.07808319,0.002581287,0.0003538213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005322425,0.003441111,0.9841722,0.0002100806,0.00196264,0.0006086731,0.00002398172,0.0004938212,0.003765017],"genre_scores_gemma":[0.8807488,0.0001122655,0.1183566,0.00002894275,0.0001654877,0.00008492164,0.00000244576,0.00002550505,0.0004750144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8754264,"threshold_uncertainty_score":0.9999088,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983798,0.0001130175,0.0002254294,0.0001871451,0.0002642065,0.00006403687,0.0009363497,0.00005978902,0.00003839674],"category_scores_gemma":[0.0000796338,0.0001274526,0.00006685607,0.0004128913,0.0006013845,0.0003372271,0.001119793,0.0001970161,0.00003779626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001148845,"about_ca_system_score_gemma":0.0001703672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001026823,"about_ca_topic_score_gemma":0.0005305845,"domain_scores_codex":[0.9985682,0.0001177532,0.00008224616,0.0004164322,0.0004516389,0.0003637513],"domain_scores_gemma":[0.9988452,0.000172585,0.00006240555,0.000533357,0.0001439078,0.0002424975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0004313777,0.001546438,0.02915663,0.0006922817,0.000258316,0.001892142,0.02151879,0.001289185,0.005545826,0.8129468,0.002528888,0.1221933],"study_design_scores_gemma":[0.008663841,0.002428142,0.4809618,0.0001762105,0.0000437933,0.0002723748,0.002616585,0.1736781,0.0008862957,0.3185493,0.01054432,0.001179193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4841606,0.0001141799,0.5068468,0.007062575,0.00007737695,0.000259133,0.00001171403,0.0001394444,0.001328168],"genre_scores_gemma":[0.917191,0.00007102293,0.08243348,0.00001860631,0.00001904211,1.450138e-7,0.000001927668,0.000004444221,0.0002602731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4943975,"threshold_uncertainty_score":0.5197367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}